ELM—A Fast Addition Algorithm Discovered by a Program

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

doi:10.1109/12.165399

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 journal › Article › peer-review

27 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 language	English (US)
Pages (from-to)	1181-1184
Number of pages	4
Journal	IEEE Transactions on Computers
Volume	41
Issue number	9
DOIs	https://doi.org/10.1109/12.165399
State	Published - Sep 1992

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/12.165399

Cite this

@article{23e71a335a2240ecaf8fbc33d8b78b18,

title = "ELM—A Fast Addition Algorithm Discovered by a Program",

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.",

author = "Kelliher, \{T. P.\} and Owens, \{R. M.\} and Irwin, \{M. J.\} and Hwang, \{T. T.\}",

year = "1992",

month = sep,

doi = "10.1109/12.165399",

language = "English (US)",

volume = "41",

pages = "1181--1184",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "9",

}

TY - JOUR

T1 - ELM—A Fast Addition Algorithm Discovered by a Program

AU - Kelliher, T. P.

AU - Owens, R. M.

AU - Irwin, M. J.

AU - Hwang, T. T.

PY - 1992/9

Y1 - 1992/9

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0026923645

UR - https://www.scopus.com/pages/publications/0026923645#tab=citedBy

U2 - 10.1109/12.165399

DO - 10.1109/12.165399

M3 - Article

AN - SCOPUS:0026923645

SN - 0018-9340

VL - 41

SP - 1181

EP - 1184

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 9

ER -

ELM—A Fast Addition Algorithm Discovered by a Program

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this