Issue No. 09 - September (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.165399
<p>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.</p>
simple processors tree; addition algorithm; ELM; augend; addend; VLSI CAD tool; FACTOR; CMOS VLSI circuits; computational complexity; digital arithmetic.
T.P. Kelliher, M.J. Irwin, T.-T. Hwang, R.M. Owens, "ELM-A Fast Addition Algorithm Discovered by a Program", IEEE Transactions on Computers, vol. 41, no. , pp. 1181-1184, September 1992, doi:10.1109/12.165399