A spanning tree carry lookahead adder
| Autor: | Thomas W. Lynch, Earl E. Swartzlander |
|---|---|
| Rok vydání: | 1992 |
| Předmět: |
Adder
Spanning tree Computer science Carry (arithmetic) Parallel computing Theoretical Computer Science law.invention Tree (data structure) Microprocessor Computational Theory and Mathematics CMOS Hardware and Architecture law Serial binary adder Carry-save adder Hardware_ARITHMETICANDLOGICSTRUCTURES Carry-lookahead adder Software |
| Zdroj: | IEEE Transactions on Computers. 41:931-939 |
| ISSN: | 0018-9340 |
| DOI: | 10.1109/12.156535 |
| Popis: | The design of the 56-b significant adder used in the Advanced Micro Devices Am29050 microprocessor is described. Originally implemented in a 1- mu m design role CMOS process, it evaluates 56-b sums in well under 4 ns. The adder employs a novel method for combining carries which does not require the back propagation associated with carry lookahead, and is not limited to radix-2 trees, as is the binary lookahead carry tree of R.P. Brent and H.T. Kung (1982). The adder also utilizes a hybrid carry lookahead-carry select structure which reduces the number of carriers that need to be derived in the carry lookahead tree. This approach produces a circuit well suited for CMOS implementation because of its balanced load distribution and regular layout. > |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|