A recursive carry-lookahead/carry-select hybrid adder
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 42 (12) , 1495-1499
- https://doi.org/10.1109/12.260639
Abstract
The author presents a very fast adder for double-precision mantissas, which is an improvement on T. Lynch and E. E. Swartzlandes, Jr.'s spanning tree carry lookahead adder or redundant cell adder which was implemented using the Am29050 microprocessor. The adder presented is faster than theirs mainly because Manchester carry chains of various lengths are used instead of chains all of the same length.Keywords
This publication has 14 references indexed in Scilit:
- A 4.5 Ins 96b Cmos Adder DesignPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Optimal group distribution in carry-skip addersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Delay optimization of carry-skip adders and block carry-lookahead addersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Designing optimum one-level carry-skip addersIEEE Transactions on Computers, 1993
- A fast VLSI adder architectureIEEE Journal of Solid-State Circuits, 1992
- A spanning tree carry lookahead adderIEEE Transactions on Computers, 1992
- Ultrafast compact 32-bit CMOS adders in multiple-output domino logicIEEE Journal of Solid-State Circuits, 1989
- A Way to Build Efficient Carry-Skip AddersIEEE Transactions on Computers, 1987
- Some optimal schemes for ALU implementation in VLSI technologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Skip Techniques for High-Speed Carry-Propagation in Binary Arithmetic UnitsIEEE Transactions on Electronic Computers, 1961