LOGIC DESIGN - LAB

EXPERIMENT - 5

ADDERS: HALF ADDER ,FULL ADDER

Using “ Logic Tutor LT345 MK2”

Name: ………………………………………………….………

Group: …………………………………………………………
Second Level
Computer Engineer
AIM:
To design and verify Half adder and Full adder circuits using basic gates and universal gates.

An adder is a digital logic circuit in electronics that implements addition of numbers. Adders are classified into two types:
half adder and full adder. The half adder circuit has two inputs: A and B, which add two input digits and generate a carry
and sum. The full adder circuit has three inputs: A ,B and C, which add the three input numbers and generate a carry and
sum.

first look at the addition of single bits.

0+0 = 0

0+1 = 1

1+0 = 1

1+1 = 10

These are the least possible single-bit combinations. But the result for 1+1 is 10. Though this problem can be
solved with the help of an XOR Gate, if you do care about the output, the sum result must be re-written as a 2-bit
output.

Thus the above equations can be written as

0+0 = 00

0+1 = 01

1+0 = 01

1+1 = 10

Here the output ‘1’of ‘10’ becomes the carry-out.

Eng. Noora Banaga 1

Practical of Half Adder :
There are two inputs and two outputs in a Half Adder. Inputs are named as A and B, and the outputs are named as Sum
(S) and Carry (C).

Block diagram of half adder

Now complete the truth table of half adder where SUM is the normal output and the CARRY is the carry-out .

Inputs Outputs
A (S1) B (S2) Sum (LP1) Carry (LP2)
0 0
0 1
1 0
1 1
Truth table

The sum output of the binary addition carried out above is similar to that of an XOR operation while the carry output is
similar to that of an AND operation.

Now write the Boolean function of half adder for SUM and Carry ( you can use Karnaugh Map to verify your Boolean
function) then draw logic circuit of Boolean function to represent Half adder after that draw it in Logic Tutor LT345 K2
to represent these Half Adder circuit where the inputs - A represent switch S1 , B as switch S2 - and the Outputs – SUM
represent LP1 and Carry represent LP2.

Eng. Noora Banaga 2

Eng. Noora Banaga 3
Practical of Full Adder :
the full adder has three inputs and two outputs. The two inputs are A and B, and the third input is a carry input CIN (The
additional third bit is carry bit from the previous stage and is called Carry -- in generally represented by CIN.) The output
is the sum of three bits along with the carry. The output carry is called Carry – out and is represented by Carry out is
designated as COUT, and the normal SUM output is designated as S.

Block diagram of Full adder

Now complete the truth table of Full adder where SUM is the normal output and the Cout is the carry-out .

Inputs Outputs
A (S1) B (S2) CIN (S3) Sum (LP1) COUT (LP2)
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Truth table

Now after complete truth table write the Boolean function of full adder for SUM and Cout ( you can use Karnaugh Map
to verify your Boolean function) then draw logic circuit of Boolean function to represent Full adder after that draw it in
Logic Tutor LT345 K2 to represent these full Adder circuit where the inputs - A represent switch S1 , B as switch S2 and
Cin as switch S3 - and the Outputs – SUM represent LP1 and Cout represent LP2.

Eng. Noora Banaga 4

Eng. Noora Banaga 5
Exercise:

Determine the truth table of the output X ,Y and Z

Eng. Noora Banaga 6