This Article 
 Bibliographic References 
 Add to: 
ELM-A Fast Addition Algorithm Discovered by a Program
September 1992 (vol. 41 no. 9)
pp. 1181-1184

A new addition algorithm, ELM, is presented. This algorithm makes use of a tree of simple processors and requires O(log n) time, where n is the number of bits in the augend and addend. The sum itself is computed in one pass through the tree. This algorithm was discovered by a VLSI CAD tool, FACTOR, developed for use in synthesizing CMOS VLSI circuits.

[1] R. P. Brent and H. T. Kung, "A regular layout for parallel adders,"IEEE Trans. Comput., vol. C-31, pp. 260-264, Mar. 1982.
[2] B. W. Y. Wei and C. D. Thompson, "Area-time optimal adder design,"IEEE Trans. Comput., vol. 39, pp. 666-675, May 1990.
[3] J. Beekman, R. M. Owens, and M. J. Irwin, "Mesh arrays and LOGICIAN: A tool for their efficient generation," inProc. ICCAD-85, Nov. 1985, pp. 290-299.
[4] H. Garcia-Molina and A. Spauster, "Message ordering in a multicast environment," inProc. 9th Int. Conf. on Distr. Comput. Syst.(Newport Beach, CA), June 1989, pp. 354-361.
[5] M. J. Flynn and S. Waser,Introduction to Arithmetic for Digital Systems Designers. CBS College Publishing, 1982, pp. 215-222.
[6] C. A. Papachristou, "Iterative construction of binary lookahead addition trees,"Comput. Elect. Eng., vol. 12, no. 3/4, pp. 101-107, 1986.
[7] S. Winograd, "On the time required for binary addition,"J. ACM, vol. 12, pp. 277-285, 1965.
[8] S. Winograd, "On the time required to perform multiplication,"J. ACM, vol. 14, no. 4, pp. 793-802, 1967.
[9] N. Weste and K. Eshraghian,Principles of CMOS Design: A Systems Perspective. Reading, MA: Addison-Wesley, 1985, pp. 322-325.
[10] T.-T. Hwang, R. M. Owens, and M. J. Irwin, "Exploiting communication complexity for multi-level logic synthesis,"IEEE Trans. Comput.-Aided Design, vol. 9, pp. 1017-1027, Oct. 1990.
[11] N. Roussopoulos and H. Kang, "Preliminary design of ADMS±: A workstation-mainframe integrated architecture for database management systems," inProc. 12th Int. Conf. Very Large Data Bases, Kyoto, Japan, Aug. 1986.

Index Terms:
simple processors tree; addition algorithm; ELM; augend; addend; VLSI CAD tool; FACTOR; CMOS VLSI circuits; computational complexity; digital arithmetic.
T.P. Kelliher, R.M. Owens, M.J. Irwin, T.-T. Hwang, "ELM-A Fast Addition Algorithm Discovered by a Program," IEEE Transactions on Computers, vol. 41, no. 9, pp. 1181-1184, Sept. 1992, doi:10.1109/12.165399
Usage of this product signifies your acceptance of the Terms of Use.