Abstract
In this paper, we present a new addition algorithm-ELM. 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 at Penn State for use in synthesizing CMOS VLSI circuits. © 1992 IEEE
Cite
CITATION STYLE
APA
Kelliher, T. P., Owens, R. M., Irwin, M. J., & Hwang, T. T. (1992). ELM—A Fast Addition Algorithm Discovered by a Program. IEEE Transactions on Computers, 41(9), 1181–1184. https://doi.org/10.1109/12.165399
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free