Lecture 11
Combinational Circuits
Combinational Circuits
What is Combinational Circuits?
• A Combinational Circuit is a combination of
Logic gates, the output depends upon the
current value of the inputs.
Examples of Combinational
Circuits
Addition:
Half Adder (HA).
Full Adder (FA).
BCD(Decimal) Adder.
Subtraction:
Half Subtractor.
Full Subtractor.
Multiplication:
Binary Multipliers.
Comparator:
Magnitude Comparator.
Examples of Combinational
Circuits
Multiplexers
Demultiplexers
Encoders
Decoders
Converters
• Binary to Gray Code
• Gray to Binary Code
• Binary to BCD Code
Two types of questions come in the exam
based on Combinational Circuit:
[Link] of a combinational Circuit
[Link] of Combinational Circuit
Designing Combinational Circuits
In general we have to do following steps:
1. Problem description
2. Input/output of the circuit
3. Define truth table
4. Simplification for each output
5. Draw the circuit
Half Adder
Adding two single-bit binary values, X, Y produces a
sum S bit and a carry out C-out bit.
This operation is called half addition and the circuit to
realize it is called a half adder.
X Half S
Y C-OUT
Adder
Half Adder Truth Table
Inputs Outputs
X Y S C-out S(X,Y) = S (1,2)
0 0 0 0 S = X’Y + XY’
0 1 1 0 S = XY
1 0 1 0
1 1 0 1 C-out(x, y) = S (3)
C-out = XY
Full Adder
Adding two single-bit binary values, X, Y with a carry
input bit C-in produces a sum bit S and a carry out C-
out bit.
Full Adder Truth Table
Inputs Outputs
X Y
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
C-out(x, y, C-in) = S (3,5,6,7)
Y
C-out = XY + X(C-in) + Y(C-in)
Full Adder Circuit Using AND-OR
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’ XY’C-in’
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
