Construction of Half/ Full Adder Using XOR and NAND Gates and Veri Cation of Its Operation
Construction of Half/ Full Adder Using XOR and NAND Gates and Veri Cation of Its Operation
Construction of Half/ Full Adder Using XOR and NAND Gates and Veri Cation of Its Operation
Construction of half/ full adder using XOR and NAND gates and verification
of its operation
Introduction
Adders are digital circuits that carry out addition of numbers. Adders are a key component of arithmetic logic
unit. Adders can be constructed for most of the numerical representations like Binary Coded Decimal (BCD),
Excess – 3, Gray code, Binary etc. out of these, binary addition is the most frequently performed task by most
common adders. Apart from addition, adders are also used in certain digital applications like table index
calculation, address decoding etc.
Binary addition is similar to that of decimal addition. Some basic binary additions are shown below.
The sum output of the binary addition carried out above is similar to that of an Ex-OR operation while the carry
output is similar to that of an AND operation. The same can be verified with help of Karnaugh Map.
The truth table and K Map simplification and logic diagram for sum output is shown below.
Figure 3. Truth table, K Map simplification and Logic diagram for sum output of half adder
https://de-iitr.vlabs.ac.in/exp/half-full-adder/theory.html 1/5
9/21/21, 3:21 PM Virtual Labs
The truth table and K Map simplification and logic diagram for carry is shown below.
Figure 4. Truth table, K Map simplification and Logic diagram for sum output of half adder
Carry = AB
If A and B are binary inputs to the half adder, then the logic function to calculate sum S is Ex – OR of A and B and
logic function to calculate carry C is AND of A and B. Combining these two, the logical circuit to implement the
combinational circuit of half adder is shown below.
As we know that NAND and NOR are called universal gates as any logic system can be implemented using these
two, the half adder circuit can also be implemented using them. We know that a half adder circuit has one Ex –
OR gate and one AND gate.
Five NAND gates are required in order to design a half adder. The circuit to realize half adder using NAND gates
is shown below.
https://de-iitr.vlabs.ac.in/exp/half-full-adder/theory.html 2/5
9/21/21, 3:21 PM Virtual Labs
2)Full Adder
Full adder is a digital circuit used to calculate the sum of three binary bits. Full adders are complex and difficult to
implement when compared to half adders. Two of the three bits are same as before which are A, the augend bit
and B, the addend bit. The additional third bit is carry bit from the previous stage and is called 'Carry' – in
generally represented by CIN. It calculates the sum of three bits along with the carry. The output carry is called
Carry – out and is represented by Carry OUT.
The block diagram of a full adder with A, B and CIN as inputs and S, Carry OUT as outputs is shown below.
Based on the truth table, the Boolean functions for Sum (S) and Carry – out (COUT) can be derived using K –
Map.
https://de-iitr.vlabs.ac.in/exp/half-full-adder/theory.html 3/5
9/21/21, 3:21 PM Virtual Labs
Figure 10. The K-Map simplified equation for sum is S = A'B'Cin + A'BCin' + ABCin
Figure 11. The K-Map simplified equation for COUT is COUT = AB + ACIN + BCIN
In order to implement a combinational circuit for full adder, it is clear from the equations derived above, that we
need four 3-input AND gates and one 4-input OR gates for Sum and three 2-input AND gates and one 3-input OR
gate for Carry – out.
As mentioned earlier, a NOR gate is one of the universal gates and can be used to implement any logic design.
The circuit of full adder using only NOR gates is shown below.
https://de-iitr.vlabs.ac.in/exp/half-full-adder/theory.html 4/5
9/21/21, 3:21 PM Virtual Labs
https://de-iitr.vlabs.ac.in/exp/half-full-adder/theory.html 5/5