By Topic

Variants of an improved carry look-ahead adder

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
$33 $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)
R. W. Doran ; Dept. of Comput. Sci., Auckland Univ., New Zealand

An improved variation on the carry look-ahead adder has been proposed by H. Ling (IBM J. Res. Develop., vol.25, p.156, May 1981). Ling's approach is based on the propagation of a composite term in place of the conventional look-ahead carry. This approach gives an adder that is faster and less expensive. In the present study, Ling's adder is introduced and described in a general manner in order to expose the essence of his approach. From this reformulation, it is shown that there are many such variations on the carry look-ahead adder, a few of which share the desirable properties of Ling's adder

Published in:

IEEE Transactions on Computers  (Volume:37 ,  Issue: 9 )