The carry-skip adder is obtained by a modification of the carry-ripple adder.
The objective is to reduce the worst-case delay by reducing the number of FA
cells through which the carry has to propagate (see expression (2.21)). To achieve
this, the adder is divided into groups ofm bits and the carry into group j + 1 is
determined by one of the following two conditions:
1. The carry is propagated by group j. That is, the carry-out of group j is
equal to the carry-in of that group. This situation occurs only when the sum
of the inputs to that group is equal to 2 m - 1. Calling x (J) and ...
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.