Académique Documents
Professionnel Documents
Culture Documents
GHADIR AL JARO
Objectives:
1. To study adder and subtractor circuits using logic gates.
Theory:
Adders:
Adder circuit is a combinational digital circuit that is used for adding two numbers.
A typical adder circuit produces a sum bit (denoted by S) and a carry bit (denoted
by C) as the output. Typically adders are realized for adding binary numbers but
they can be also realized for adding other formats like BCD (binary coded decimal).
1. Half Adder:
Half adder is a combinational arithmetic circuit that adds two numbers and
produces a sum bit (S) and carry bit (C) as the output. If A and B are the input
bits, then sum bit (S) is the X-OR of A and B and the carry bit (C) will be the
AND of A and B. From this it is clear that a half adder circuit can be easily
constructed using one X-OR gate and one AND gate. Half adder is the simplest
Digital Design Lab ENG. GHADIR AL JARO
of all adder circuit, but it has a major disadvantage, the half adder can add only
two input bits (A and B) and has nothing to do with the carry if there is any in
the input, So if the input to a half adder have a carry, then it will be neglected it
and adds only the A and B bits. That means the binary addition process is not
complete and that’s why it is called a half adder. The truth table, schematic
representation and XOR/AND realization of a half adder are shown in the figure
below.
2. Full Adder:
Full adder is a logic circuit that adds two input operand bits plus a Carry in bit and
outputs a Carry out bit and a sum bit. The Sum out (Sout) of a full adder is the XOR
of input operand bits A, B and the Carry in (Cin) bit. Truth table and schematic of a
A Full adder can be made by combining two half adder circuits together (a half
adder is a circuit that adds two input bits and outputs a sum bit and a carry bit).
Digital Design Lab ENG. GHADIR AL JARO
Subtractors:
1. Half Subtractor:
2. Full Subtractor:
Parallel Addition:
Multiple full adder circuits can be cascaded in parallel to add an N-bit number. For
an N- bit parallel adder, there must be N numbers of full adder circuits. A ripple
carry adder is a logic circuit in which the carry-out of each full adder is the carry in
of the succeeding next most significant full adder. It is called a ripple carry adder
because each carry bit gets rippled into the next stage. In a ripple carry adder the
sum and carry out bits of any half adder stage is not valid until the carry in of that
stage occurs.
Note that the first (and only the first) full adder may be replaced by a half adder.
Adder-Subtractor:
Lab Work:
Part 1:
a) Construct the circuit of HA using module KL-33004 block a, connect inputs A and
B to data switches and outputs F1 (carry) and F2 (sum) to LEDs then find the
truth table.
Digital Design Lab ENG. GHADIR AL JARO
Part 2:
Connect inputs A1A4, B0B3 to DIP Switches DIP2: O3 and DIP1:03 respectively.
Connect Σ1, Σ2, Σ3, Σ4 , C4 to LEDs L1L5. Follow input sequences in the table
Y X Σ F1 (carry)
0 0
0 1
0 6
0 9
0 F
1 3
1 6
1 8
3 6
4 8
4 F
8 7
9 9
A B
C E
F F
Exercises:
a) Implement the 4-bit Borrow Ripple Subtractor using Full Subtractor.
b) Implement the 4-bit Borrow Ripple Subtractor using Full Adder.
c) Connect two 7483 ICs to add two binary numbers each of 8 bit. Show schematic
diagram.