This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Addition of Binary Numbers
August 1970 (vol. 19 no. 8)
pp. 758-759
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.
Index Terms:
Addition, binary numbers, computational complexity, group multiplication, logic circuits, logical design.
Citation:
R. Brent, "On the Addition of Binary Numbers," IEEE Transactions on Computers, vol. 19, no. 8, pp. 758-759, Aug. 1970, doi:10.1109/T-C.1970.223027
Usage of this product signifies your acceptance of the Terms of Use.