Pipelined carry-ripple adder (for group size of 1 and n - 4).
C O
2 = 9
l~
Pipelined Adders
The throughput of the adder can be increased by pipelining. To do this, pipeline
registers are introduced to shorten the worst-case carry path. For example, a
C RA adder is divided into groups of bits and latches are introduced, as shown
in Figure
2.26.
Most latches are used to synchronize inputs and outputs since
different parts (groups) are processed at different cycles. The throughput R is
determined by the ...
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.