← 🔌 Combinational Circuits
Subtopic 2 of 6

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

  1. Generate Gᵢ = AᵢBᵢ (this stage makes a carry on its own).
  2. Propagate Pᵢ = Aᵢ ⊕ Bᵢ (this stage passes a carry through).
  3. Cᵢ₊₁ = Gᵢ + PᵢCᵢ, and expanding gives each carry directly from the Gs, Ps and C₀.
  4. 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.
stageaᵢbᵢcᵢ inPᵢ = a⊕bGᵢ = a·bsum = P⊕ccᵢ₊₁ = G + P·c
01001010
11100101
20111001
31011001
Sum (binary)1 0001
Sum (decimal)17
Ripple carry-out delay8 gate delays (2 per stage)
Look-ahead carry delay3 gate delays (P,G then 2-level AND-OR), independent of n
C1 = G0 + P0C0 C2 = G1 + P1G0 + P1P0C0 C3 = G2 + P2G1 + P2P1G0 + P2P1P0C0 C4 = G3 + P3G2 + P3P2G1 + P3P2P1G0 + P3P2P1P0C0 (every carry computed in parallel)
Ripple-carry delay (2 per stage)32 ns
Single-level look-ahead delay4 ns
4-bit blocks, block look-ahead12 ns (approx.)
Full adders in a ripple adder16

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?

Remember: Ripple: delay proportional to n. Look-ahead: Cᵢ₊₁ = Gᵢ + PᵢCᵢ expanded, constant delay.
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.