On the Addition of Binary Numbers

Authors:
R. Brent
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1970

Citing 3
Cited 8

On the Time Required to Perform Addition

Journal of the ACM (JACM)
On the Time Required to Perform Multiplication

Journal of the ACM (JACM)
The Time Required for Group Multiplication

Journal of the ACM (JACM)

Complexity of computations

ACM Turing award lectures
On the Parallel Evaluation of Polynomials

IEEE Transactions on Computers
A Regular Layout for Parallel Adders

IEEE Transactions on Computers
The Parallel Evaluation of Arithmetic Expressions Without Division

IEEE Transactions on Computers
Combinational Circuit Synthesis with Time and Component Bounds

IEEE Transactions on Computers
Computation Times of Arithmetic and Boolean Functions in (d, r) Circuits

IEEE Transactions on Computers
Parallel solution of recurrence problems

IBM Journal of Research and Development
An area-time efficient NMOS adder

Integration, the VLSI Journal

Quantified Score

Hi-index	15.00

Visualization

Abstract

An upper bound is derived for the time required to add numbers modulo 2n, using circuit elements with a limited fan-in and unit delay, and assuming that all numbers have the usual binary encoding. The upper bound is within a factor (1 + e) of Winograd's lower bound (which holds for all encodings), where e?0 as n?8, and only O(n log n) circuit elements are required.