11 Adder
11 Adder
Combinational Circuits
Combinational Circuits
What is Combinational Circuits?
X Half S
Y C-OUT
Adder
Half Adder Truth Table
Inputs Outputs
X Y C-in S C-out
Full
0 0 0 0 0 C-out C-in
0 0 1 1 0 Adder
0 1 0 1 0
S
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
Full Adder
Sum S X
XY
C-in 00 01 11 10
X Y C-in S C-out 0 2 6 4
0 0 0 0 0 0 1 1
0 0 1 1 0 1 3 7 5
C-in
1 1 1
0 1 0 1 0
0 1 1 0 1 Y
Inputs Outputs
1 0 0 1 0
S = X’Y’(C-in) + XY’(C-in)’ + XY’(C-in)’ + XY(C-in)
1 0 1 0 1 S = X Y (C-in)
1 1 0 0 1
1 1 1 1 1 Carry C-out X
XY
C-in 00 01 11 10
Full Adder Truth Table 0 2 6 4
0 1
1 3 7 5
S(X,Y, C-in) = S (1,2,4,7) 1 1 1 1 C-in
X’ X’Y’C-in
X Y’
X X’ C-in
X’
X’YC-in’ Sum S
Y
Y C-in’
Y Y’ X
Y
C-in C-in’ X
Y
C-in’ XYC-in
X XY
Y
X
XC-in C-out
C-in
Y
C-in YC-in
Full Adder Circuit Using Ex-OR
X
Y Sum S
C-in
X
XY
X
XC-in C-out
C-in
C-in YC-in
Full Adder Circuit Using two half - Adders
Half Adder -1
Half Adder -2
Binary adder
• Binary adder that produces the arithmetic
sum of binary numbers can be constructed
with full adders connected in cascade, with
the output carry from each full adder is
connected to the input carry of the next full
adder in the chain
• Note that the input carry C0 in the least
significant position must be 0.
Binary Adder
C0= 0
Binary Adder
• For example to add A= 1011 and B= 0011
subscript i: 3 2 1 0
Input carry: 0 1 1 0 Ci
Augend: 1 0 1 1 Ai
Addend: 0 0 1 1 Bi
--------------------------------
Sum: 1 1 1 0 Si
Output carry: 0 0 1 1 Ci+1
DECIMAL/BCD ADDER