ELM—A Fast Addition Algorithm Discovered by a Program

T. P. Kelliher, R. M. Owens, M. J. Irwin, T. T. Hwang

Research output: Contribution to journalArticlepeer-review

26 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)1181-1184
Number of pages4
JournalIEEE Transactions on Computers
Volume41
Issue number9
DOIs
StatePublished - Sep 1992

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'ELM—A Fast Addition Algorithm Discovered by a Program'. Together they form a unique fingerprint.

Cite this