Low-energy CSMT carry generators and binary adders

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 7, Issue 4, 1999, Pages 450-462

  Parhi, Keshab K ^a,b  

^a IEEE   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Addition; Carry select adders; Carry select modifled tree adders; Carry skip adders; Low energy; Multiplexer based adders; Redundant to binary conversion; Tree adders

Indexed keywords

BINARY CARRY ADDERS; BINARY CARRY GENERATORS; CARRY-SELECT MODIFIED-TREE (CSMT) ADDER ARCHITECTURES;

COMPUTATIONAL COMPLEXITY; INTEGRATED CIRCUIT LAYOUT; MULTIPLEXING EQUIPMENT; TREES (MATHEMATICS);

ADDERS;

EID: 0033281193     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/92.805752     Document Type: Article

References (26)

1. K. Hwang, Computer Arithmetic: Principles, Architecture and Design. New York: Wiley, 1979.
2. J. Uya, K. Kaneko, and J. Yasui, "A CMOS floating point multiplier," IEEE J. Solid-State Circuits, vol. SC-19, pp. 697-702, Oct. 1984.
3. N. E. Weste and K. Eshraghian, Principles of CMOS VLSI Design: A Systems Perspective. Reading, MA: Addison-Wesley, 1993.
4. O. L. MacSorley, "High-speed arithmetic in binary computers," Proc. IRE, vol. 49, pp. 67-91, 1961.
5. R. P. Brent and H. T. Kung, "A regular layout for parallel adders," IEEE Trans. Comput., vol. C-31, pp. 260-264, Mar. 1982.
6. P. K. Chan, M. D. F. Schlag, C. D. Thomborson, and V. G. Oklobdzija, "Delay optimization of carry-skip adders and block carry-lookahead adders," in Proc. 10th Comput. Arithmetic Symp., 1991, pp. 154-164.
7. V. Kantabutra, "Designing optimum carry-skip adders," in Proc. 10th Comput. Arithmetic Symp., 1991, pp. 146-153.
8. M. Lehman and N. Burla, "Skip techniques for high-speed carry propagation in binary arithmetic units," IRE Trans. Electron. Comput., vol. EC-10, pp. 691-698, Dec. 1962.
9. S. Turrini, "Optimal group distribution in carry-skip adders," in Proc. 9th Comput. Arithmetic Symp., 1989, pp. 96-103.
10. J. Sklansky, "Conditional-sum addition logic," IRE Trans. Electron. Comput., vol. EC-9, pp. 226-231, June 1960.
11. R. I. Hartley and K. K. Parhi, Digit-Serial Computation. Norwell, MA: Kluwer, 1995.
12. A. Avizienis, "Signed digit number representation for fast parallel arithmetic," IRE Trans. Comput., vol. EC-10, pp. 389-400, Sept. 1961.
13. H. R. Srinivas and K. K. Parhi, "A fast VLSI adder architecture," IEEE J. Solid-State Circuits, vol. 27, pp. 761-767, May 1992.
14. J. M. Dobson and G. M. Blair, "Fast two's complement VLSI adder design," Electron. Lett., vol. 31, no. 20, pp. 773-783, Sept. 28, 1995.
15. H. Makino et al., "An 8.8-ns 54 × 54-bit multiplier with high speed redundant binary architecture," IEEE J. Solid-State Circuits, vol. 31, no. 6, pp. 773-783, June 1996.
16. K. K. Parhi, "Fast Binary Addition," in Proc. IEEE Signal Processing Syst., Leicester, U.K., Nov. 1997, pp. 232-241.
17. _, "Fast low-power VLSI binary addition," in Proc. IEEE Int. Conf. Comput. Design, Austin, TX, Oct. 1997, pp. 676-684.
18. C. Nagendra, M. J. Irwin, and R. M. Owens, "Area-time-power tradeoffs in parallel adders," IEEE Trans. Circuits Syst. II, vol. 43, pp. 689-702, Oct. 1996.
19. L. Montalvo, K. K. Parhi, and J. H. Satyanarayana, "Estimation of average consumption of ripple-carry adder based on average length carry chains," in Proc. IEEE Workshop VLSI Signal Processing IX, San Francisco, CA, Oct. 30-Nov. 1, 1996, pp. 189-198.
20. T. K. Callaway and E. E. Swartzlander, "Low-power arithmetic components," in Low-Power Design Methodologies, J. M. Rabaey and M. Pedram, Eds. Norwell, MA: Kluwer, 1996, pp. 161-200.
21. A. P. Chandrakasan and R. W. Brodersen, "Minimizing power consumption in digital CMOS circuits," Proc. IEEE, vol. 83, pp. 498-523, Apr. 1995.
22. M. D. Ercegovac and T. Lang, "Sign detection and comparison networks with a small number of transitions," in Proc. 12th Comput. Arithmetic Symp., Bath, U.K., July 1995, pp. 59-66.
23. J. H. Satyanarayana and K. K. Parhi, "HEAT: Hierarchical energy analysis tool," in 33rd ACM/IEE Design Automation Conf., Las Vegas, NV, June 1996, pp. 9-14.
24. A. Vandemeulebroecke, E. Vanzieleghem, T. Denayer, and P. G. A. Jespers, "A new carry-free division algorithm and its application to a single-chip 1024-b RSA processor," IEEE J. Solid-State Circuits, vol. 25, pp. 748-756, June 1990.
25. P. M. Kogge and H. S. Stone, "A parallel algorithm for the efficient solution of a general class of recurrence equations," IEEE Trans. Comput., vol. C-22, pp. 786-792, Aug. 1973.
26. K. K. Parhi and D. G. Messerschmitt, "Pipeline interleaving and parallelism in recursive digital filters: Parts I and II," IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, pp. 1099-1135, July 1989.