
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
FuChiung Cheng, Stephen H. Unger, Michael Theobald, "SelfTimed CarryLookahead Adders," IEEE Transactions on Computers, vol. 49, no. 7, pp. 659672, July, 2000.  
BibTex  x  
@article{ 10.1109/12.863035, author = {FuChiung Cheng and Stephen H. Unger and Michael Theobald}, title = {SelfTimed CarryLookahead Adders}, journal ={IEEE Transactions on Computers}, volume = {49}, number = {7}, issn = {00189340}, year = {2000}, pages = {659672}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.863035}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  SelfTimed CarryLookahead Adders IS  7 SN  00189340 SP659 EP672 EPD  659672 A1  FuChiung Cheng, A1  Stephen H. Unger, A1  Michael Theobald, PY  2000 KW  Selftimed circuits KW  delayinsenstive circuits KW  carrylookahead adders KW  tree iterative circuits KW  CMOS. VL  49 JA  IEEE Transactions on Computers ER   
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 selftimed carrylookahead adder in which the logic complexity is a linear function of
[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. 117125, 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. 133136, 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. 459463, 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. 3479, 1963.
[8] T.F. Ngai and M.J. Irwin, “Regular, AreaTime Efficient CarryLookahead Adders,” Proc. IEEE Symp. Computer Arithmetic, pp. 915, 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. 365393, Apr. 1977.
[11] J. Sklansky, “ConditionalSum Addition Logic,” IRE Trans. Electronic Computers, vol. 9, no. 6, pp. 226231, June 1960.
[12] R.P. Brent and H.T. Kung, “A Regular Layout for Parallel Adders,” IEEE Trans. Computers, vol. 31, no. 3, pp. 260264, 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 DelayInsensitive Circuits,” Distributed Computing, vol. 5, no. 3, pp. 107119, 1991.
[15] A.J. Martin, “The Limitations to DelayInsensitivity in Asynchronous Circuits,” Proc. Sixth MIT Conf. Advanced Research in VLSI, William J. Dally, ed., pp. 263278, 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. 119137, July 1992.
[19] F.C. Cheng, “Practical Design and Performance Evaluation of Completion Detection Circuits,” Proc. Int'l Conf. Computer Design (ICCD), pp. 354359, Oct. 1998.
[20] M. Greenstreet private communication, 1995.
[21] O.J. Bedrij, “CarrySelect Adder,” IRE Trans. Electronic Computers, vol. 11, no. 6, pp. 340346, June 1962.
[22] M. Lehman and N. Burla, “Skip Techniques for HighSpeed CarryPropagation in Binary Arithmetic Units,” IRE Trans. Electronic Computers, vol. 10, no. 12, pp. 691698, Dec. 1961.
[23] N.M. Martin and S.P. Hufnagel, “ConditionalSum Early Completion Adder Logic,” IEEE Trans. Computers, vol. 29, no. 8, pp. 753756, Aug. 1980.
[24] F.C. Cheng, “Synthesis of High Performance SelfChecking DelayInsensitive 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. 137140, 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.