Full Adder is a Combinational Circuit that perform Arithmetic Operation of 3 bits.In simple words it take three-three binary inputs and out...
Full Adder is a Combinational Circuit that perform Arithmetic Operation of 3 bits.In simple words it take three-three binary inputs and outputs and produce sum and carryout.Full adder divided into two types namely Serial Adder and Parallel Adder.
Truth Table of Full Adder:-
Block Diagram of Full Adder:-
Sum=A'B'C+A'BC'+AB'C'+ABC
Cout=A'BC+AB'C+ABC'+ABC
Full Adder Circuit Diagram:-
Implementation of Full Adder using NAND gate:-
Implementation of Full Adder using NOR gate:-
Truth Table of Full Adder:-
| A | B | C | Sum | Cout |
|---|---|---|---|---|
| o | 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 |
Block Diagram of Full Adder:-
Cout=A'BC+AB'C+ABC'+ABC
Full Adder Circuit Diagram:-
Simplification of full adder:-
=A'(B'C+BC')+A(B'C'+BC)
=A'(B⊕C)+A(B⊕C)'
Let x=B⊕C
=A'x+Ax'
=A⊕x
=A⊕B⊕C
Simplification of full adder Using K-Map:-
Cout:-AB+BC+AC=A'(B'C+BC')+A(B'C'+BC)
=A'(B⊕C)+A(B⊕C)'
Let x=B⊕C
=A'x+Ax'
=A⊕x
=A⊕B⊕C
Simplification of full adder Using K-Map:-
Implementation of Full Adder using NAND gate:-
If you have any query then leave your comments and don't forgot to follow me on Google+,Facebook,Twitter.
COMMENTS