Adder Circuit
A combinational circuit that adds binary numbers, the arithmetic core of a processor.
Definition
An adder is a combinational circuit that computes the binary sum of its inputs. A half adder adds two bits; a full adder also accepts a carry-in, so full adders chain to add multi-bit numbers.
The tension between simple slow adders and fast complex ones is a microcosm of digital design: carry-lookahead and its refinements buy speed with more gates and area. Which trade-off wins depends on whether the surrounding system is limited by timing, power, or silicon area.
The carry chain is the classic latency bottleneck in arithmetic, and the progression from ripple-carry to carry-lookahead to prefix adders illustrates how designers trade silicon area and power for speed. The right point on that spectrum depends on whether a given design is constrained by timing, energy, or area. As the core of the arithmetic unit, the adder's speed directly influences a processor's achievable clock frequency.
Designs
- Ripple-carry: simple, but carry propagates slowly through each stage.
- Carry-lookahead: computes carries in parallel for speed.
- Carry-save: efficient for summing many operands.
Why it matters
Addition is the most basic arithmetic operation, and, via two's complement, subtraction reduces to it. Adders sit at the heart of the arithmetic logic unit, and their carry-propagation delay often limits a processor's clock speed.
Fusion connection
High-throughput adders in programmable logic accumulate and process diagnostic samples in real time during simulated fusion operation.