Issue No. 08 - August (1970 vol. 19)
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.
Addition, binary numbers, computational complexity, group multiplication, logic circuits, logical design.
R. Brent, "On the Addition of Binary Numbers," in IEEE Transactions on Computers, vol. 19, no. , pp. 758-759, 1970.