Draw the logic diagram for a full-adder. Derive the simplified expression for SUM and CARRY.
Advertisements
Question
Draw the logic diagram for a full-adder. Derive the simplified expression for SUM and CARRY.
Advertisements
Solution
A Full Adder is a combinational logic circuit that adds three single-bit binary numbers A, B and Cin (Carry-in). It produces two outputs: SUM (S) and CARRY (Cout).
1. Logic Diagram of a Full Adder

2. Truth Table
|
A |
B |
Cin |
SUM (S) |
CARRY (Cout) |
|---|---|---|---|---|
|
0 |
0 |
0 |
0 |
0 |
|
0 |
0 |
1 |
1 |
0 |
|
0 |
1 |
0 |
1 |
0 |
|
0 |
1 |
1 |
0 |
1 |
|
1 |
0 |
0 |
1 |
0 |
|
1 |
0 |
1 |
0 |
1 |
|
1 |
1 |
0 |
0 |
1 |
|
1 |
1 |
1 |
1 |
1 |
3. Derivation of the Simplified Expression for SUM
From the truth table, SUM is 1 for the input combinations 001, 010, 100 and 111.
Therefore, the Boolean expression is:
S = A'B'Cin + A'BCin' + AB'Cin' + ABCin
Grouping the terms:
S = Cin(A'B' + AB) + Cin'(A'B + AB')
Using XOR identities:
S = Cin(A ⊕ B)' + Cin'(A ⊕ B)
SUM (S) = A ⊕ B ⊕ Cin
4. Derivation of the Simplified Expression for CARRY
From the truth table, CARRY is 1 for the input combinations 011, 101, 110 and 111.
Therefore, the Boolean expression is:
Cout = A'BCin + AB'Cin + ABCin' + ABCin
Grouping and simplifying:
Cout = BCin(A' + A) + AB'Cin + ABCin'
Cout = BCin + AB'Cin + ABCin'
Cout = Cin(B + AB') + ABCin'
Using B + AB' = A + B':
Cout = ACin + BCin + ABCin'
Combining ACin + ABCin' = A(B + Cin):
CARRY (Cout) = AB + ACin + BCin
SUM (S) = A ⊕ B ⊕ Cin
CARRY (Cout) = AB + ACin + BCin
