Carry Select Adder (CSeA)
Speculates on carry-in, computes both options, selects with a MUX.
Problem
How do you speed up addition without full lookahead complexity?
How it works
Splits the operand into k-bit blocks. Each block computes two sums in parallel: one assuming carry-in = 0, one assuming carry-in = 1. When the actual carry arrives from the previous block, a multiplexer instantly selects the correct result.
Key insightSpeculative computation: do both possibilities, then pick. Doubles the adders but MUX selection is nearly instant.
Tradeoffs
- Area
- ~2.5n FA-eq
- Delay
- 2k + 2(ân/kââ1) gate delays
- Best when: Moderate speedup needed with predictable, regular layout.