ELM-a fast addition algorithm discovered by a program

1 January 1992

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. 41 (9) , 1181-1184
https://doi.org/10.1109/12.165399

Abstract

[[abstract]]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[[fileno]]2030202010026[[department]]資訊工程學

Keywords

This publication has 7 references indexed in Scilit:

Time-Optimal Design of a CMOS Adder
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
Area-time optimal adder design
IEEE Transactions on Computers, 1990
Exploiting communication complexity for multilevel logic synthesis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
Iterative construction of binary lookahead addition trees
Computers and Electrical Engineering, 1986
A Regular Layout for Parallel Adders
IEEE Transactions on Computers, 1982
On the Time Required to Perform Multiplication
Journal of the ACM, 1967
On the Time Required to Perform Addition
Journal of the ACM, 1965