Source

Adapted from my own handwritten and hand-typed notes from Year 1 to Year 3 of my EEE degree

Problem

In a ripple adder each carry waits for the carry below it, so the delay grows with the number of bits. A carry-look-ahead (CLA) adder computes every carry directly from the inputs.

Propagate and Generate

For each bit define:

These are just the sum and carry outputs of a half adder. Then:

Meaning of the terms:

  • : this bit creates a carry by itself (both inputs are 1)
  • : this bit passes an incoming carry on to the next bit

Expanding the Carries

Substitute each carry into the next:

Every carry is now a 2-level SOP of the , and signals, so no carry depends on the previous stage.

Delay and Cost

For a 4-bit CLA adder:

  • the look-ahead carry generator itself is 2 gate delays for every carry, independent of the word size
  • including the gate that forms and , each carry is ready after
  • each sum needs one more XOR, so
  • the cost is many more gates, and gate fan-in grows with the number of bits, so CLA blocks are usually 4 bits wide and then cascaded