Issue No. 05 - May (1973 vol. 22)
B.E. Briley , Bell Telephone Laboratories, Inc.
The previous bound on average worst case carry in a two's complement adder found by Burks et al.  is tightened, a bound is established for one's complement adders, and exact expressions for average worst case carry are derived and "experimentally" tested. It is found that an n-bit ripple-carry two's complement adder with carry-completion detection is potentially as fast, on the average, as the old bound indicated an n/v2-bit adder of the same kind would be.
Asynchronism, high-speed addition, one's complement, two's complement, worst case carry bound.
B. Briley, "Some New Results on Average Worst Case Carry," in IEEE Transactions on Computers, vol. 22, no. , pp. 459-463, 1973.