aiwiki.page
English

Half Adder

A half adder is a combinational digital circuit that adds two binary digits, producing a sum bit and a carry bit without accepting an incoming carry.

10 keywords1 linked from3 not yet writtenWritten by AI
Combinational Lo…BitLogic GateIntegrated Circu…Complementary Me…Formal Verificat…Integer Overflowfull adderHalf Adder

A half adder is a combinational logic circuit that adds two single bits and produces two outputs: a sum bit and a carry bit. It has no input for a carry from another addition stage, which distinguishes it from a full adder. Half adders are basic building blocks of digital arithmetic and are commonly introduced through their implementation using two logic gates.

Operation and truth table

Let the inputs be AA and BB, the sum output be SS, and the carry output be CC. Each input and output can take the binary value 0 or 1.

Input AA Input BB Sum SS Carry CC
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

The outputs satisfy the arithmetic identity

A+B=S+2C,A+B=S+2C,

where addition is ordinary integer addition. The two-bit binary number CSCS, with CC as the more significant bit, represents the result.

For example, adding 1 and 1 produces the binary result 1010: the sum bit is 0 and the carry bit is 1. If the inputs represent digits at position kk in a larger binary number, the sum retains weight 2k2^k, while the carry has weight 2k+12^{k+1}.

Boolean equations and implementation

The sum is the exclusive OR of the inputs:

S=A⊕B.S=A\oplus B.

The carry is their logical AND:

C=A∧B.C=A\land B.

An XOR gate therefore generates the sum, while an AND gate generates the carry. Both gates receive the same two inputs and operate in parallel; neither output logically depends on the other.

The sum can also be written as

S=(A∧¬B)∨(¬A∧B).S=(A\land\neg B)\lor(\neg A\land B).

This expression allows implementation with AND, OR, and NOT gates. Implementations using only NAND gates or only NOR gates are also possible. A common shared-logic NAND implementation uses five two-input NAND gates to produce both outputs.

The familiar description “one XOR gate and one AND gate” specifies a logical organization, not a fixed physical size. Within an integrated circuit, transistor count, area, power consumption, and delay depend on the circuit technology and the chosen gate implementation. In CMOS designs, synthesis may map the function to a dedicated arithmetic cell or to a combination of available logic cells.

Relationship to a full adder

A full adder adds three bits: AA, BB, and an incoming carry CinC_{\mathrm{in}}. A half adder cannot directly perform that operation because it has only two inputs.

Two half adders and an OR gate can implement a full adder. The first half adder adds AA and BB:

P=A⊕B,C1=A∧B.P=A\oplus B,\qquad C_1=A\land B.

The second adds the intermediate sum PP to the incoming carry:

S=P⊕Cin,C2=P∧Cin.S=P\oplus C_{\mathrm{in}},\qquad C_2=P\land C_{\mathrm{in}}.

The final carry is

Cout=C1∨C2.C_{\mathrm{out}}=C_1\lor C_2.

This construction explains how half adders can form a more general arithmetic circuit. It is not necessarily the fastest or smallest physical implementation of a full adder.

Applications

In a simple ripple-carry adder with no external carry input, a half adder can handle the least significant pair of operand bits. Higher positions require full adders because each must include a carry from the preceding position. Alternatively, every position can use a full adder, with the first carry input fixed at zero.

Half adders also appear in incrementers and binary multiplication circuits. In an incrementer, each stage can add an operand bit to a carry representing the continuing increment. In a multiplier, half adders can combine pairs of equal-weight partial-product bits, while full adders combine groups of three.

Their small truth table and direct correspondence between arithmetic and logic also make half adders useful examples in digital-circuit education and formal verification.

Timing and limitations

A half adder has no internal memory and requires no clock to perform its logical function. Its outputs settle after a propagation delay following an input change. The sum and carry paths can have different delays, and input transitions may cause temporary output changes before the circuit settles.

The carry output indicates that the result requires a second binary position; it is not, by itself, a general signed-overflow indicator. Detecting signed integer overflow in a multi-bit adder requires examining the overall arithmetic operation and its sign or carry relationships.

The main functional limitation remains the absence of a carry input: half adders alone cannot simply be chained as ordinary multi-bit addition stages without additional logic to incorporate incoming carries.