Implementation of A 4-Bit Binary Full Adder
Implementation of A 4-Bit Binary Full Adder
Group Members:
Submitted to:
Dr. Md Mehedi Hasan,
Lecturer,
Department of Robotics and Mechatronics Engineering,
University of Dhaka.
Theory:
Binary adder is one of the basic combinational circuits. The output of the
combinational circuits depend on the present inputs only. It does not require any
memory component. The outputs of these circuits do not depend upon any previous
applied inputs.
Full adder is a conditional circuit which performs full binary addition that means it
adds two bits along with a carry and gives a carry and a sum output. All the possible
combinations for full adder are shown in the following truth table below:
A full adder can perform an addition between only two bits of two different binary
numbers and gives an output sum and a carry. It cannot perform the addition of
more binary numbers instantly. This can be done by connecting many full adders
parallelly. This parallel combination of full adders is called the binary parallel adder.
This binary parallel adder can perform the addition of specific bits.
To implement the circuit of 4-bit binary full adder, we can use IC 7483.
Apparatus:
To complete this experiment we need IC 7483, Jumper Wire, Digital Trainer Board.
IC 7483
Fig: Apparatus.
Procedure:
To conduct the experiment, we follow the following procedure:
1. At first we set the 7483 IC in the breadboard or in the Digital Trainer Board.
2. The circuit will be like the picture shown below.
3. Then we connect all the input pins (A0,A1,A2,A3,B0,B1,B2,B3) and c-in with
the toggle switches and connect all the output pin (S0,S1,S2,S3,S4,C-OUT) with
the LED light of digital trainer board.
Result:
From the different inputs we get various outputs. If we make a truth table using the
data:
INPUT OUTPUT
Cin A3 A2 A1 A0 B3 B2 B1 B0 Cout C3 C2 C1 C0
0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0 1 0 0 0 1 0
0 0 0 1 0 0 0 1 0 0 0 1 0 0
0 0 0 1 1 0 0 1 1 0 0 1 1 0
0 0 1 0 0 0 1 0 0 0 1 0 0 0
0 0 1 0 1 0 1 0 1 0 1 0 1 0
0 0 1 1 0 0 1 1 0 0 1 1 0 0
0 0 1 1 1 0 1 1 1 0 1 1 1 0
0 1 0 0 0 1 0 0 0 1 0 0 0 0
0 1 0 0 1 1 0 0 1 1 0 0 1 0
0 1 0 1 0 1 0 1 0 1 0 1 0 0
0 1 0 1 1 1 0 1 1 1 0 1 1 0
0 1 1 0 0 1 1 0 0 1 1 0 0 0
0 1 1 0 1 1 1 0 1 1 1 0 1 0
0 1 1 1 0 1 1 1 0 1 1 1 0 0
0 1 1 1 1 1 1 1 1 1 1 1 1 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1
If we want to see the decimal form of A,B,A+B and C we get:
THEORITICAL
INPUT SUM OUTPUT
A B A+B C
0 0 0 0
1 1 2 2
2 2 4 4
3 3 6 6
4 4 8 8
5 5 10 10
6 6 12 12
7 7 14 14
8 8 16 16
9 9 18 18
10 10 20 20
11 11 22 22
12 12 24 24
13 13 26 26
14 14 28 28
15 15 30 30
31 15 46 31 OVERFLOW
So, we can see that our theoretical output matches the expected output. So, we can
say that our experiment is correct.
Note:
We got A by converting A0,A1,A2,A3 to decimal and in the same way we got B and
output C. Using excel we easily calculated A+B and compared with our circuit output
and as we can see, they matched properly.
Discussion:
The result shows that the implemented circuit performs as expected. We input the
Binary (4bit) of A and another binary (4bit) B and got their sum as C. We can’t get
decimals from digital circuits, nor can we give input in decimals. so, we give binary
forms of A (A0,A1,A2,A3) and B (B0,B1,B2,B3), Cin and get C (C0,C1,C2,C3) , Cout as
output. The data from this experiment properly matches with the theoretical adding
process of binary addition. So, we can say our experiment is done properly.
Conclusion:
In this experiment we wanted to implement a 4-bit binary full adder circuit and verify
its function. We completed this experiment with maintaining proper safety measures.
We verified the result from the set up by calculating the addition using a calculator
and Microsoft Excel. So, we can say that our experiment is perfect and accurate.
References:
https://www.etechnog.com/2019/10/ic-7483-pin-diagram-truth-table.html
https://datasheetspdf.com/datasheet/7483.html
www.electrical4u.com/binary-adder-half-and-full-adder/