Lab 4
Lab 4
Lab 4
2. Full adder
Full adder is a combinational arithmetic circuit that performs an addition operation on
three 1-bit binary numbers and generates a sum bit (S) and a carry bit (C) as the
output.
Truth table
Cin B A Sum 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
2.3.2 Design, simulate and implement a 4-bit Ripple Carry Adder using
IC 7483
1. 4-bit ripple carry adder
A 4-bit Ripple Carry Adder is a digital circuit designed to perform the addition of
two 4-bit binary numbers. It utilizes multiple Full Adders to add pairs of bits
sequentially, from the least significant bit to the most significant bit.
Structure
Input
Two 4-bit binary numbers: A3 A2 A1 A0 and B3 B2 B1 B0.
A carry input (C0), usually initialized to 0.
Output
A 4-bit binary sum: S3 S2 S1 S0, representing the result of the addition.
A carry-out (C4), indicating whether there was an overflow in the addition.
2. IC 7483
IC 7483 is a 4-bit binary full adder integrated circuit (IC) that can add two 4-bit
binary numbers together and produce a 4-bit sum along with a carry-out.