This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Self-Timed Carry-Lookahead Adders
July 2000 (vol. 49 no. 7)
pp. 659-672

Abstract—Integer addition is one of the most important operations in digital computer systems because the performance of processors is significantly influenced by the speed of their adders. This paper proposes a self-timed carry-lookahead adder in which the logic complexity is a linear function of $n$, the number of inputs, and the average computation time is proportional to the logarithm of the logarithm of $n$. To the best of our knowledge, our adder has the best area-time efficiency which is $\Theta(n\log\log n)$. An economic implementation of this adder in CMOS technology is also presented. SPICE simulation results show that, based on random inputs, our 32-bit self-timed carry-lookahead adder is 2.39 and 1.42 times faster than its synchronous counterpart and self-timed ripple-carry adder, respectively; and, based on statistical data gathered from a 32-bit ARM simulator, it is 1.99 and 1.83 times faster than its synchronous counterpart and self-timed ripple-carry adder, respectively.

[1] J.L. Hennessy and D.A. Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, San Mateo, Calif., 1990.
[2] M.A. Franklin and T. Pan, “Performance Comparison of Asynchronous Adders,” Proc. Int'l Symp. Advanced Research in Asynchronous Circuits and Systems, pp. 117-125, Nov. 1994.
[3] J.D. Garside, "A CMOS VLSI Implementation of an Asynchronous ALU," Proc. IFIP Workshop Asynchronous Design Methodologies,Manchester, U.K., 1993.
[4] B. Gilchrist, J.H. Pomerene, and S.Y. Wong, “Fast Carry Logic for Digital Computers,” IRE Trans. Electronic Computers, vol. 4, no. 4, pp. 133-136, Dec. 1955.
[5] K. Hwang,Computer Arithmetic, Principles, Architecture, and Design.New York: John Wiley&Sons, 1979.
[6] B.E. Briley, “Some New Results on Average Worst Case Carry,” IEEE Trans. Computers, vol. 22, no. 5, pp. 459-463, May 1973.
[7] A.W. Burks, H.H. Goldstine, and J. von Neumann, “Preliminary Discussion of the Logical Design of an Electronic Computing Instrument,” Collected Works of John von Neumann, vol. 5, pp. 34-79, 1963.
[8] T.-F. Ngai and M.J. Irwin, “Regular, Area-Time Efficient Carry-Lookahead Adders,” Proc. IEEE Symp. Computer Arithmetic, pp. 9-15, 1985.
[9] I. Flores, The Logic of Computer Arithmetic. Prentice Hall, 1963.
[10] S.H. Unger, “Tree Realizations of Iterative Circuits,” IEEE Trans. Computers, vol. 26, no. 4, pp. 365-393, Apr. 1977.
[11] J. Sklansky, “Conditional-Sum Addition Logic,” IRE Trans. Electronic Computers, vol. 9, no. 6, pp. 226-231, June 1960.
[12] 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.
[13] E. Brunvand, “Translating Concurrent Communicating Programs into Asynchronous Circuits,” PhD thesis, Carnegie Mellon Univ., 1991.
[14] J.C. Ebergen, “A Formal Approach to Designing Delay-Insensitive Circuits,” Distributed Computing, vol. 5, no. 3, pp. 107-119, 1991.
[15] A.J. Martin, “The Limitations to Delay-Insensitivity in Asynchronous Circuits,” Proc. Sixth MIT Conf. Advanced Research in VLSI, William J. Dally, ed., pp. 263-278, 1990.
[16] I. Sutherland, "Micropipelines," Comm. ACM, Vol. 32 No. 6, ACM Press, New York, June 1989.
[17] S.H. Unger, “A Building Block Approach to Unclocked Systems,” Proc. Hawaii Int'l Conf. System Sciences, vol. I, Jan.1993.
[18] A.J. Martin, “Asynchronous Datapaths and the Design of an Asynchronous Adder,” Formal Methods in System Design, vol. 1, no. 1, pp. 119-137, July 1992.
[19] F.-C. Cheng, “Practical Design and Performance Evaluation of Completion Detection Circuits,” Proc. Int'l Conf. Computer Design (ICCD), pp. 354-359, Oct. 1998.
[20] M. Greenstreet private communication, 1995.
[21] O.J. Bedrij, “Carry-Select Adder,” IRE Trans. Electronic Computers, vol. 11, no. 6, pp. 340-346, June 1962.
[22] M. Lehman and N. Burla, “Skip Techniques for High-Speed Carry-Propagation in Binary Arithmetic Units,” IRE Trans. Electronic Computers, vol. 10, no. 12, pp. 691-698, Dec. 1961.
[23] N.M. Martin and S.P. Hufnagel, “Conditional-Sum Early Completion Adder Logic,” IEEE Trans. Computers, vol. 29, no. 8, pp. 753-756, Aug. 1980.
[24] F.-C. Cheng, “Synthesis of High Performance Self-Checking Delay-Insensitive Tree Circuits,” PhD thesis, Dept. of Computer Science, Columbia Univ., 1998.
[25] R.L. Scheaffer and J.T. McClave, Statistics for Engineers. Duxbury Press, 1982.
[26] D.J. Kinniment, "An Evaluation of Asynchronous Addition," IEEE Trans. VLSI Systems, vol. 4, no. 1, pp. 137-140, Mar. 1996.
[27] D.S. Bormann and P.Y.K. Cheung, “Asynchronous Wrapper for Heterogeneous Systems,” Proc. Int'l Conf. Computer Design (ICCD), Oct. 1997.

Index Terms:
Self-timed circuits, delay-insenstive circuits, carry-lookahead adders, tree iterative circuits, CMOS.
Citation:
Fu-Chiung Cheng, Stephen H. Unger, Michael Theobald, "Self-Timed Carry-Lookahead Adders," IEEE Transactions on Computers, vol. 49, no. 7, pp. 659-672, July 2000, doi:10.1109/12.863035
Usage of this product signifies your acceptance of the Terms of Use.