3.2Ripple-carry and carry look-ahead adders
The idea
In a ripple-carry adder each full adder waits for the carry of the previous one, so the delay grows with the word length. A carry look-ahead adder computes all carries in parallel from generate and propagate signals.
Think of it like this: A relay race versus a stadium where everyone starts at once.
Why it exists
Delay questions ask how many gate delays an n-bit adder needs, and which design is faster.
How it works
- Generate Gᵢ = AᵢBᵢ (this stage makes a carry on its own).
- Propagate Pᵢ = Aᵢ ⊕ Bᵢ (this stage passes a carry through).
- Cᵢ₊₁ = Gᵢ + PᵢCᵢ, and expanding gives each carry directly from the Gs, Ps and C₀.
- Ripple delay ≈ 2n gate delays; look-ahead is about 4 gate delays regardless of n, at the cost of wider gates.
Worked example: 16-bit adder with 1 ns gates
Ripple: 2 × 16 = 32 ns. One level of look-ahead: about 4 ns. Real designs use 4-bit blocks to keep the gates small.
Now play with it
- →Add 11 + 6: watch the carry column change stage by stage.
- →Change the bit count in the calculator and see ripple grow while look-ahead stays flat.
| stage | aᵢ | bᵢ | cᵢ in | Pᵢ = a⊕b | Gᵢ = a·b | sum = P⊕c | cᵢ₊₁ = G + P·c |
|---|---|---|---|---|---|---|---|
| 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 |
| 2 | 0 | 1 | 1 | 1 | 0 | 0 | 1 |
| 3 | 1 | 0 | 1 | 1 | 0 | 0 | 1 |
Delay formulas are the usual textbook counts: 2 gate delays per ripple stage, 4 for P/G + two-level carry + sum XOR.
Check yourself
Which statement is TRUE for an n-bit adder?
Exam notes (the dense version)
A ripple-carry adder of n bits has delay ≈ n × (carry delay of one full adder), roughly 2n gate delays. Carry look-ahead defines generate Gᵢ = AᵢBᵢ and propagate Pᵢ = Aᵢ ⊕ Bᵢ; then Cᵢ₊₁ = Gᵢ + PᵢCᵢ, expanded so every carry comes from Gs, Ps and C₀ in two more gate levels: delay is constant (about 4 gate delays) but fan-in grows with n, so large adders use groups (4-bit blocks with block P and G). Carry-select and carry-skip adders are other speed-ups.
Previous year questions: Combinational Circuits (10)
PYQs are grouped by topic, so this is the full set for Combinational Circuits; try the ones that match this subtopic. Open all 10 on the topic page.