Half adder
Definition
A half adder is a basic combinational logic circuit used to add two 1-bit binary inputs and produce two outputs:
Sum (S)
Carry (C)
It is called a half adder because it performs addition only for two bits and does not include a carry-in input from a previous stage. In other words, it is the simplest binary adder and forms the foundation for designing more advanced arithmetic circuits such as full adders and binary adders.
For two input bits A and B:
- The sum is the result of adding the bits without considering any previous carry.
- The carry is generated when both input bits are 1.
The logical expressions are:
Sum = A ⊕ B
Carry = A · B
Where:
⊕
- represents the XOR operation
·
- represents the AND operation
Main Content
1. Basic Concept of Binary Addition
- In binary number system, only two digits are used: 0 and 1.
-
A half adder adds two single binary digits and follows these rules:
-
0 + 0 = 0, Sum = 0, Carry = 0
- 0 + 1 = 1, Sum = 1, Carry = 0
- 1 + 0 = 1, Sum = 1, Carry = 0
- 1 + 1 = 10, Sum = 0, Carry = 1
A half adder is designed directly from this truth table.
It is useful for understanding how computers perform arithmetic using logic gates.
Truth Table
| A | B | Sum (S) | Carry (C) |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
The table shows that the sum output is 1 only when the inputs are different, and the carry output is 1 only when both inputs are 1.
2. Logic Gate Implementation
- A half adder can be built using two basic logic gates:
- XOR gate for the sum output
- AND gate for the carry output
- The XOR gate gives 1 only when inputs are unequal, which matches the binary sum behavior without carry.
- The AND gate gives 1 only when both inputs are 1, which represents the carry condition.
Circuit Representation
A ─────┬────────> XOR ─────> Sum
│
└────────> AND ─────> Carry
B ─────┬────────> XOR
│
└────────> AND
This circuit is very compact and efficient.
The XOR output handles the addition result, while the AND output indicates whether a carry is generated.
Boolean Expressions
S = A ⊕ B
C = A · B
These expressions are the mathematical basis of the half adder and are used in digital circuit design and simplification.
3. Characteristics and Limitations
- A half adder is a combinational circuit, meaning its output depends only on the current inputs, not on past inputs or memory.
- It is the smallest adder circuit in digital electronics.
- It has an important limitation: it cannot add a carry-in bit.
Because of this limitation, a half adder is not sufficient for adding multi-bit binary numbers directly.
For example, if you want to add three bits like A + B + Cin, a half adder alone cannot perform the operation since it lacks a carry input.
Why it is still important
- It is used as the building block for larger adders.
- It helps in understanding binary arithmetic.
- It demonstrates the role of XOR and AND gates in arithmetic logic.
Example of limitation
If one stage already produced a carry, a half adder cannot include that carry in its addition. Therefore, a full adder is used instead in cascaded multi-bit addition systems.
Working / Process
1. Apply the two binary inputs
- Input bits A and B are given to the circuit.
- These bits may be 0 or 1.
2. Generate the sum and carry simultaneously
- The XOR gate compares the inputs and produces the Sum.
- The AND gate checks whether both inputs are 1 and produces the Carry.
3. Interpret the output
- If the two inputs are different, the sum is 1 and carry is 0.
- If both inputs are 1, the sum becomes 0 and carry becomes 1.
- If both inputs are 0, both outputs remain 0.
Step-by-step example
For inputs A = 1 and B = 1:
- XOR output: 1 ⊕ 1 = 0
- AND output: 1 · 1 = 1
So the result is:
Sum = 0
Carry = 1
This corresponds to binary 10, which is the correct binary representation of decimal 2.
Advantages / Applications
Simple design
- : It uses only two logic gates, making it easy to understand and implement.
Foundation for larger adders
- : It is used in the design of full adders and multi-bit binary addition circuits.
Useful in digital systems
- : It appears in arithmetic logic units, processors, and other digital computation circuits.
Fast operation
- : Since it has a minimal number of gates, its delay is low compared to more complex circuits.
Educational importance
- : It is one of the first circuits taught in combinational logic because it clearly demonstrates binary addition principles.
Summary
- A half adder is a basic combinational circuit that adds two 1-bit binary inputs.
- It produces two outputs: sum and carry.
- Important terms to remember: XOR gate, AND gate, Sum, Carry, Combinational logic