Cart (Loading....) | Create Account
Close category search window

Probabilistic carry state estimate for improved asynchronous adder performance

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 $31
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

3 Author(s)
Wallace, W.F. ; Dept. of Electr. & Electron. Eng., Newcastle upon Tyne Univ., UK ; Dlay, S.S. ; Hinton, O.R.

The paper presents a new type of simple adder, suitable for asynchronous digital circuits and implementation in VLSI technology, which has either speed and/or area advantages over existing designs. It is based on the concept of predicting the carry from least to most significant halves of a 32 or 64 bit adder in such a way that it has a high probability of being correct, while introducing only a low area overhead from the required early completion control circuitry. Detailed design and simulation of the adder at the gate level is presented, together with its evaluation by comparing detailed performance with equivalent ripple, carry lookahead, and carry select designs. Since the objective is improved asynchronous circuits, it is average rather than worst-case delays that are the significant measures. In comparison to other adder networks it is demonstrated that by using the important metrics of area, speed and delay-area product the proposed adder can outperform the 32 bit and 64 bit adders cited in the literature. Delay-area product results show that the proposed approach gives a saving of over 14% and 24% on the carry-select lookahead schemes for 32 bit and 64 bit adders respectively

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:148 ,  Issue: 6 )

Date of Publication:

Nov 2001

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.