High-speed parallel-prefix VLSI ling adders

IEEE Transactions on Computers

Volumn 54, Issue 2, 2005, Pages 225-231

  Dimitrakopoulos, Giorgos ^a   Nikolos, Dimitris ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Adders; Computer arithmetic; Parallel prefix carry computation; VLSI design

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER ARCHITECTURE; DIGITAL ARITHMETIC; LOGIC CIRCUITS; THEOREM PROVING; VLSI CIRCUITS;

COMPUTER ARITHMETIC; PARALLEL PREFIX CARRY COMPUTATION; VLSI DESIGN;

ADDERS;

EID: 14844366754     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2005.26     Document Type: Article

References (23)

1. I. Koren, Computer Arithmetic Algorithms. A.K. Peters, Ltd., 2002.
2. B. Parhami Computer Arithmetic - Algorithms and Hardware Designs. Oxford Univ. Press, 2000.
3. M. Ergecovac and T. Lang, Digital Arithmetic. Morgan-Kauffman, 2003.
4. P.M. Kogge and H.S. Stone, "A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations," IEEE Trans. Computers, vol. 22, no. 8, pp. 786-792, Aug. 1973.
5. R.E. Ladner and M.J. Fisher, "Parallel Prefix Computation," J. ACM vol. 27, no. 4, pp. 831-838, Oct. 1980.
6. R.P. Brent and H.T. Kung, "A Regular Layout for Parallel Adders," IEEE Trans. Computers, vol. 31, no. 3, pp. 260-264, Mar. 1982.
7. T. Han and D. Carlson, "Fast Area-Efficient VLSI Adders," Proc. Symp. Computer Arithmetic, pp. 49-56, May 1987.
8. S. Knowles, "A Family of Adders," Proc. 14th Symp. Computer Arithmetic, pp. 30-34, Apr. 1999. Reprinted in ARITH-15, pp. 277-281.
9. A. Beaumont-Smith and C.C. Lim, "Parallel-Prefix Adder Design," Proc. 15th Symp. Computer Arithmetic, pp. 218-225, June 2001.
10. V.G. Oklobdzija et al., "Energy-Delay Estimation Technique for High-Performance Microprocessor VLSI Adders," Proc. 16th Symp. Computer Arithmetic, pp. 15-22, June 2003.
11. H. Ling, "High-Speed Binary Adder," IBM J. R&D, vol. 25, pp. 156-166, May 1981.
12. R.W. Doran, "Variants of an Improved Carry-Lookahead Adder," IEEE Trans. Computers, vol. 37, pp. 1110-1113, 1988.
13. S. Vassiliadis, "Recursive Equations for Hardwired Binary Adders," J. Electronics, vol. 67, no. 2, pp. 201-213, Aug. 1989.
14. N.T. Quach and M.J. Flynn, "High-Speed Addition in CMOS," IEEE Trans. Computers, vol. 41, no. 12, pp. 1612-1615, Dec. 1992.
15. S. Naffziger, "A Sub-Nanosecond 0.5mμm 64b Adder Design," Proc. IEEE Solid-State Circuits Conf., pp. 362-363, Feb. 1996.
16. D. Phatak and I. Koren, "Intermediate Variable Encodings that Enable Multiplexor Based Implementations of Two Operand Addition," Proc. Symp. Computer Arithmetic, pp. 22-29, Apr. 1999.
17. O. Kwon, E. Swartzlander, and K. Nowka, "A Fast Hybrid Carry-Lookahead/ Carry-Select Adder Design," Proc. Great Lakes Symp. VLSL pp. 149-152, Apr. 2001
18. Y. Wang, C. Pai, and X. Song, "The Design of Hybrid Carry-Lookahead/ Carry-Select Adders," IEEE Trans. Circuits and Systems II, vol. 49, no. 1, Jan. 2002.
19. C. Efstathiou, H.T. Vergos, and D. Nikolos, "Ling Adders in Standard CMOS Technologies," Proc. IEEE Int'l Conf. Electronics, Circuits, and Systems (ICECS), vol. 2, pp. 485-488, Sept. 2002.
20. T. Lynch and E. Swartzlander, "A Spanning Tree Carry Lookahead Adder," IEEE Trans Computers, vol. 41, no. 8, pp. 931-939, Aug. 1992.
21. A. Goldovsky et al., "A 1.0-nsec 32-bit Prefix Tree Adder in 0. 25-mμm Static CMOS," Proc. Midwest Symp. Circuits and Systems, vol. 2, pp. 608-612, Aug. 1999.
22. I. Sutherland, R. Sproull, and D. Harris, Logical Effort: Designing Fast CMOS Circuits. Morgan Kaufmann, 1999.
23. UMC-18, eSi-Route/11 0.8 Standard Cell Library, Virtual Silicon Technology, Jan. 2001.