wire / wire-format / adder-circuits

Adder circuits (half, full, ripple, lookahead)

Adders are combinational circuits for binary addition. Half adder: sum = A XOR B, carry = A AND B. Full adder: sum = A XOR B XOR Cin, carry = (A AND B) OR (Cin AND (A XOR B)). Ripple carry adder: chains full adders (carry propagates, O(n) delay). Carry lookahead adder (CLA): computes carry in parallel using generate (G = A AND B) and propagate (P = A XOR B) signals, O(log n) delay.

wire-format kind wire-format status standard verification verified tier B wire-format@1

aka: Adder circuits (half, full, ripple, lookahead)

wire format

spec: Digital logic design

Adders are combinational circuits for binary addition. Half adder: sum = A XOR B, carry = A AND B. Full adder: sum = A XOR B XOR Cin, carry = (A AND B) OR (Cin AND (A XOR B)). Ripple carry adder: chains full adders (carry propagates, O(n) delay). Carry lookahead adder (CLA): computes carry in parallel using generate (G = A AND B) and propagate (P = A XOR B) signals, O(log n) delay.

fieldsizemeaning
Half adder2 inputs, 2 outputsSum = A XOR B. Carry = A AND B. No carry input.
Full adder3 inputs, 2 outputsSum = A XOR B XOR Cin. Carry = (A AND B) OR (Cin AND (A XOR B)).
Ripple carry addern full addersChain n full adders. Carry out of bit i feeds carry in of bit i+1. Delay = O(n) (carry ripples through all bits).
Carry lookahead (CLA)n bitsGenerate: G_i = A_i AND B_i. Propagate: P_i = A_i XOR B_i. Carry: C_{i+1} = G_i OR (P_i AND C_i). Parallel computation of all carries. Delay = O(log n).
Carry select addern bitsCompute both possible sums (with carry 0 and carry 1) for each block, then select based on actual carry. Faster than ripple, slower than CLA.
Prefix adder (Kogge-Stone)n bitsTree-based carry computation. Delay = O(log n). Used in high-performance CPUs.

example:

00 00

Adder circuits (placeholder)


provenance

agent: curl -H 'accept: application/json' wire.phall.io/wire-format/adder-circuits or /wire-format/adder-circuits.json