Combinational Logic: Half adder
Definition
A half adder is a combinational logic circuit that adds two single-bit binary inputs and generates two outputs: Sum and Carry.
- The Sum output gives the least significant bit of the addition result.
- The Carry output indicates whether a carry is generated to the next higher bit position.
The half adder is implemented using basic logic gates such as:
XOR gate
- for Sum
AND gate
- for Carry
Main Content
1. Basic Concept of Binary Addition
- In binary arithmetic, only two digits are used: 0 and 1.
- The half adder adds two bits and follows the same logic as decimal addition, but with binary rules.
Binary addition rules for a single pair of bits:
| Input A | Input B | Sum | Carry |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
From this table:
- If both inputs are different, the Sum is 1 and Carry is 0
- If both inputs are 1, the Sum is 0 and Carry is 1
Example:
- in binary, so Sum = 0 and Carry = 1
This is the core idea behind the half adder.
2. Logic Expressions and Circuit Implementation
- The output of the half adder can be expressed using Boolean algebra:
- Sum = A ⊕ B
- Carry = A · B
- Here:
- means XOR
- means AND
Why these gates are used:
XOR gate
- gives 1 when inputs are different, which matches the binary sum without carry.
AND gate
- gives 1 only when both inputs are 1, which matches the carry condition.
A simple circuit structure:
A ----┬------> XOR ------> Sum
│
B ----┘
A ----┬------> AND ------> Carry
│
B ----┘
This circuit is compact, fast, and widely used in digital design. It is also easy to build in hardware using integrated circuits or logic gate combinations.
3. Truth Table, Features, and Limitations
- The truth table fully describes the behavior of the half adder and helps in analysis, design, and verification.
Truth table again in functional form:
| A | B | Sum (A ⊕ B) | Carry (A · B) |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
Important features:
- It is a combinational circuit, so outputs depend only on current inputs.
- It has no memory element.
- It is used only for 1-bit addition.
- It does not handle carry-in, so it cannot directly add multi-bit numbers by itself.
Limitation:
- In multi-bit binary addition, carry from one bit position must be added to the next. A half adder cannot do this alone.
- For that reason, a full adder is used in chained multi-bit addition circuits.
Example limitation:
- To add and , multiple stages are needed.
- A half adder can only handle one pair of bits at a time and cannot accept the carry from a previous stage.
Working / Process
1. Apply the two binary inputs
- The inputs and are given to the half adder.
- Each input can be either 0 or 1.
2. Generate the Sum output
- The XOR gate compares the two inputs.
- If the inputs are different, the Sum becomes 1.
- If the inputs are the same, the Sum becomes 0.
3. Generate the Carry output
- The AND gate checks whether both inputs are 1.
- If both are 1, Carry becomes 1.
- Otherwise, Carry remains 0.
Example process:
- Input:
- XOR output = 1 → Sum = 1
-
AND output = 0 → Carry = 0
-
Input:
- XOR output = 0 → Sum = 0
- AND output = 1 → Carry = 1
This process happens instantly in hardware because the circuit is purely combinational.
Advantages / Applications
Simple and easy to design
- Uses only two logic gates and two input signals, making it one of the easiest arithmetic circuits to understand and implement.
Foundation for larger adders
- Half adders are important building blocks in the design of more complex circuits such as full adders, ripple carry adders, and arithmetic logic units.
Used in digital arithmetic systems
- It is applied in binary addition circuits inside computers, calculators, digital signal systems, and microprocessor arithmetic units.
Fast operation
- Since it is a combinational circuit with no feedback or memory, it produces output quickly after inputs are applied.
Useful for learning Boolean logic
- It demonstrates practical use of XOR and AND gates and helps students understand binary arithmetic and logic design.
Summary
- A half adder adds two 1-bit binary inputs and gives Sum and Carry.
- Sum is produced by XOR, and Carry is produced by AND.
- It is a basic combinational circuit used as a building block in digital arithmetic.
Important terms to remember: Half adder, combinational logic, binary addition, XOR gate, AND gate, Sum, Carry, truth table