By Topic

Some New Results on Average Worst Case Carry

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Briley, B.E. ; Bell Telephone Laboratories, Inc.

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-22 ,  Issue: 5 )