Chunky binary multiplier and method of operation
US5327368A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Jun 28, 1993 |
| Grant date | Jul 5, 1994 |
| Priority date | — |
| Expiry date | Jun 28, 2013 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F7/509
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A fast binary reduction tree of the type used in high speed digital computer multiplication circuits is disclosed having chunky adders formed by sub-dividing carry propagate adders into chunks of equal bit length such that chunk addition can be initiated in parallel. In the tree, chunky adders with the same chunk size and offset can be cascaded by connecting the carry-outs of one adder to the carry-ins of another, while carry-outs from adders having different offsets can be interleaved to form new partial product terms for input to the next adder level. The chunky adder tree reduces the number of levels without significantly increasing the computation time at each level, thereby increasing the overall computational speed of the circuit.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.