Professional Documents
Culture Documents
Lecture 12 Binary Adder-Subtractor
Lecture 12 Binary Adder-Subtractor
1.
2.
3.
4.
5.
Half Adder.
Full Adder.
Binary Adder.
Binary Subtractor.
Binary Adder-Subtractor.
1. Half Adder
Half Adder: is a combinational circuit that performs the addition of two bits,
this circuit needs two binary inputs and two binary outputs.
Inputs Outputs
0
0
1
1
0
0
0
1
0
1
0
0
1
1
1
0
Truth table
is the carry.
(Using XOR and AND Gates)
X Y
Outputs
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
Truth table for the full adder
YCin
00
01
11
10
YCin
00
01
11
10
C out XY XC in YC in
(Sum of products)
C out
It can also be implemented using two half adders and one OR gate
(using XOR gates).
Proof:
The sum:
Y C in
X Y C
X Y
in
X Y C
XY
in
XY
Cout
Implementation of Full Adder with two Half Adders and an OR gate
C4
S3
B1
A2
B2
A3
C1
C2
A0
B0
A1
S1
C0
S0
Example:
and
Subscript
Input Carry
+
Sum
Output Carry
3
0
2
1
1
1
0
0
0
1
0
0
1
0
1
1
1
1
0
1
Carry Propagation
The addition of
binary numbers in parallel implies that all the
bits of and are available for computation at the same time.
As in any combinational circuit, the signal must propagate through the
gates before the correct output sum is available.
The output will not be correct unless the signals are given enough time
to propagate through the gates connected form the input to the output.
The longest propagation delay time in an adder is the time it takes
the carry to propagate through the full adders.
Ai
Pi Ci
Si
Bi
Pi C i Gi
Ci1
Ci
and
and
and .
to propagate, in fact
is
C 0 P 0 G 0 P 1 G1 P 2 G2
C3
C2
A3
P3
B3
P3
G3
A2
B2
B1
G1
A
S3
3
P2
G2
A1
C4
Carry C 2
Lookahead
Generator
S2
P1
S1
C1
P0
G0
C0
C0
S0
4. Binary Subtractor
To perform the subtraction
, we can use the 2's complements, so
the subtraction can be converted to addition.
2's complement can be obtained by talking the 1s complement and
adding 1 to the LSD bit.
1) 1s complement can be implemented with inventors.
2) 1 can be added to the sum through the input carry.
The circuit for subtracting
consists of an adder with inverters placed
between each data input and the corresponding input of the full adder.
The input carry
must be equal to 1.
5. Binary AdderSubtractor
The addition and subtraction operations can be combined into one circuit
with one common binary adder by including an exclusive-OR gate with
each full-adder.
adder.
subtractor.
Each XOR gate receives signal and
o When
then
and the carry = 0, then the circuit
performs the operation
.
o When
then
and the carry = 1, then the circuit
performs the operation
.
The exclusive-OR with output is for detecting an overflow.
o (
o