Some New Results on Average Worst Case Carry
- 1 May 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-22 (5) , 459-463
- https://doi.org/10.1109/T-C.1973.223748
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/√2-bit adder of the same kind would be.Keywords
This publication has 0 references indexed in Scilit: