DocumentCode :
1025792
Title :
ELM-a fast addition algorithm discovered by a program
Author :
Kelliher, T.P. ; Owens, R.M. ; Irwin, M.J. ; Hwang, T.-T.
Author_Institution :
Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA
Volume :
41
Issue :
9
fYear :
1992
fDate :
9/1/1992 12:00:00 AM
Firstpage :
1181
Lastpage :
1184
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
Keywords :
computational complexity; digital arithmetic; CMOS VLSI circuits; ELM; FACTOR; VLSI CAD tool; addend; addition algorithm; augend; simple processors tree; Adders; CMOS logic circuits; Circuit synthesis; Computer science; Design automation; Equations; Integrated circuit interconnections; Logic circuits; Terminology; Very large scale integration;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.165399
Filename :
165399
Link To Document :
بازگشت