A Spanning Tree Carry Lookahead Adder

IEEE Transactions on Computers

Volumn 41, Issue 8, 1992, Pages 931-939

  Lynch, Thomas ^a   Swartzlander, Earl E ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Adders; adders; carry lookahead adders; carry select; fast adders; fundamental carry operation; high radix lookahead carry; Manchester carry chain circuit

Indexed keywords

CARRY LOGIC; DIGITAL ARITHMETIC;

CARRY-LOOKAHEAD ADDERS; COMPUTER ARITHMETIC; FAST ADDERS;

ADDERS;

EID: 0026907993     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.156535     Document Type: Article

References (14)

1. A.Weinberger and J. L. Smith,s“A logic for high-speed addition,”National Bureau of Standards Circular 591, pp. 3–12, 1958.
2. M. Lehman and N. Burla, “Skip techniques for high-speed carry propagation in binary arithmetic units,” IRE Trans. Electron. Compute vol. EC-10, pp. 691–698, 1961.
3. O. J. Bedrij, “Carry-select adder,” IRE Trans. Electron. Comput., vol. EC-11, pp. 340–346, 1962.
4. J, Sklansky, “Conditional-sum addition logic,” IRE Trans. Electron. Comput., vol. EC-9, ppruq. 226–231, 1960.
5. R. P. Brent and H. T. Rung, “A regular layout for parallel adders,” IEEE Trans. Comput., vol. C-31, pp. 260–264, 1982.
6. H. Ling, “High-speed binary adder,” IBM J. Res. Develop., vol. 25, pp. 156–166, May 1981.
7. I. S. Hang and A. L. Fisher, “A 3.2 ns 32-bit CMOS adder in multiple output domino logic,” in 1988 IEEE Int. Solid-State Circuits Conf. Dig. Tech. Papers, pp. 140, 141, 332, and 333.
8. G. Beick et al, “Approaching a nanosecond; A 32-bit adder,” in Proc. 1988 IEEE Int. Conf. Comput. Design: VLSI in Computers and Processors, pp. 221–226.
9. T. Kilbum, D. B. G. Edwards, and D. Aspinall, “Parallel addition in digital computers: A new fast ‘carry’ circuit,” IEE Proc., vol. 106, pt. B, pp. 464—466, 1959.
10. J. J. Cavanaugh, Digital Computer Arithmetic: Design and Implementation. NewYork: McGra-Hill, 1984, pp. 112–122.
11. P. K. Chan and M. D. F. Schlag, “Analysis and design of CMOS Manchester adders ith variable carry skip,” IEEE Trans Comput., vol. 39, pp. 983–992, 1990.
12. P. K. Chan et ai, “Delay optimization of carry-skip adders and block carry-lookahead adders,” in Proc. lOthSymp. Comput. Arithmetic, 1991, pp. 154–164.
13. T. Han and D. A. Carlson, “Fast area-efficient VLSI adders,” in Proc. 8th Symp. Comput. Arithmetic, 1987, pp. 49–56.
14. T. Lynch and E. E. Sartzlander, Jr., “The redundant cell adder,” in Proc. 10th Symp. Comput. Arithmetic, 1991, pp. 165–170.