Skip to Main Content
Digital Arithmetic
book

Digital Arithmetic

by Miloš D. Ercegovac, Tomás Lang
September 2003
Intermediate to advanced content levelIntermediate to advanced
709 pages
26h 51m
English
Morgan Kaufmann
Content preview from Digital Arithmetic
Carry-Lookahead Adder (CLA)
71
2,6
2,6=1
F ! G U R S 2.11 Optimal distribution of group sizes in carry-skip adder.
Further reduction of the worst-case delay can be obtained by putting several
groups into blocks and providing carry-skip around blocks. This process is gen-
eralized to multilevel carry-skip adders (see Exercise 2.9).
Carry-Lookahead Adder (CLA)
The basic idea of this adder is to compute several carries simultaneously. In the
extreme, all carries could be computed at the same time. As stated in expression
(2.6), if we call x (i) and y
(i)
the integers represented by the bit-vector from bit 0
to bit i; that is,
i
X
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Computer Arithmetic in Practice

Computer Arithmetic in Practice

Sławomir Gryś

Publisher Resources

ISBN: 9781558607989