The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1973 vol.22)
pp: 459-463
B.E. Briley , Bell Telephone Laboratories, Inc.
ABSTRACT
The previous bound on average worst case carry in a two's complement adder found by Burks et al. [1] 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.
INDEX TERMS
Asynchronism, high-speed addition, one's complement, two's complement, worst case carry bound.
CITATION
B.E. Briley, "Some New Results on Average Worst Case Carry", IEEE Transactions on Computers, vol.22, no. 5, pp. 459-463, May 1973, doi:10.1109/T-C.1973.223748
80 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool