Combinational Circuits

Chapter 4
Combinational
Circuits
Types of Logic Circuits
1. Combinational logic circuits (circuits without a memory):

Outputs depend only on the current inputs e.g. half adder.
2. Sequential logic circuits (circuits with memory):
Outputs depend on the current inputs and the previous inputs.
These networks employ storage elements and logic gates. E.g.
Counter.
COMBINATIONAL CIRCUITS
Each input and output variable exists physically as an analog signal

whose values are interpreted to be a binary signal (logic 1 or logic 0)
Most important standard combinational circuits are:

• Adders
• Subtractors
• Comparators Available in IC’s as MSI and used as
• Decoders standard cells in complex VLSI
• Encoders
• Multiplexers
Analysing a Combinational
Circuit
 The analysis of a combinational circuit requires that we
determine the function that the circuit implements.
 Start with a given logic diagram and find set of Boolean
functions, a truth table, or possibly explanation of the
circuit operation.
 Steps:
 Determine the function that circuit implements
 Ensure that circuit is combinational and not sequential
 No memory elements or feedback (Output of one

circuit as a input to another)
 Logic diagram
 Obtain the Boolean function or truth table

Analysing a Combinational Circuit
 ABC
T3  T2
A  B  C
F2 'T1
 AB  AC  BC
Analysing a Combinational Circuit
Note that the circuit has three binary inputs— A , B , and C —and
two binary outputs— F1 and F2
From diagram, Inputs Outputs

F2  AB  AC  BC
A B C F1 F2
F1 T3  T2 F2 ' T1  ABC 0 0 0 0 0
( AB  AC  BC )' ( A  B  C )  ABC 0 0 1 1 0
0 1 0 1 0
( A' B ' )( A'C ' )( B 'C ' )( A  B  C )  ABC 0 1 1 0 1
1 0 0 1 0
( A' B ' C ' )( AB' AC ' BC ' B ' C )  ABC 1 0 1 0 1
 A' BC ' A' B ' C  AB' C ' ABC 1 1 0 0 1
1 1 1 1 1
From the truth table can you tell the function of the circuit?
Designing a Combinational Circuit
Designing a Combinational
Circuit
 The design of combinational circuits starts from the
specification of the design objective and culminates
in a logic circuit diagram or a set of Boolean
functions from which the logic diagram can be
obtained.
 Steps:
 From the Specification of the circuit, determine
the number of inputs and outputs. Assign a

symbol to each
 Derive the Truth Table that defines required
relationship between inputs and outputs

 Obtain Boolean function for each output as a
Circuit
A practical design must consider following constraints
 Number of gates,
 Number of inputs to a gate,
 Propagation time of the signal through the gates,
 Number of interconnections, etc.

DESIGNING A COMBINATIONAL CIRCUIT
Example 1: Design a combinational circuit with three inputs and
one output. The output is 1 when the binary value (from inputs) is
less than three. The output is 0 otherwise.
y
yz
x y z F 00 01 11 10
0 0 0 1 1 1 1
0 F  x' y ' x' z '
0 0 1 1
x 1
0 1 0 1
0 1 1 0 z
1 0 0 0
1 0 1 0 x
1 1 0 0 y
F
1 1 1 0
z
Circuit
 Example 2: Design a code converter that converts BCD  Excess 3
Code.
 This means we will have 4 inputs and 4 outputs
Note: The six bit

combinations not
listed for the
input
variables are
don’t-care
combinations.
Circuit
Circuit
Circuit
Not counting input inverters, the implementation in
sum-of-products form requires seven AND gates
and three OR gates.
The simplified implementation requires four AND

gates, four OR gates, and one inverter
Circuit
Binary Adder
Binary Adder
 Most Basic arithmetic function is Addition of two
binary digits
 0+0=0,
 1+0=1,
 0+1=1,
 1+1=10 (Carry is added to the next higher order
pair of significant values)
 A combinational circuit that performs addition of

two bits is called Half Adder
 A combinational circuit that performs addition of

three bits is called Full Adder (Adding two half
adder)
Half Adder
X Y S C
• Adds two one-bit binary numbers
0 0 0 0
(A and B) and outputs a sum (S)
1 0 1 0
and a carry (C). 0 1 1 0
1 1 0 1
XO AND
R
Full Adder
Inputs
INPUTS Outputs
OUTPUTS
• Adds three one-bit binary
x y z S C
numbers (A, B, C) and outputs
two one-bit binary numbers, a 0 0 0 0 0
0 0 1 1 0
sum (S) and a carry (C1). 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
C
S z  ( x  y)
Full Adder
S z  ( x  y) C = XY + YZ + XZ
Implementing Full Adder with two half Adders
C = XY + YZ + XZ
= XY + XY’Z + X’YZ
= XY + Z(X + Y)

Combinational Circuits

Uploaded by

Combinational Circuits

Uploaded by

Chapter 4

1. Combinational logic circuits (circuits without a memory):

Each input and output variable exists physically as an analog signal

Most important standard combinational circuits are:

 Ensure that circuit is combinational and not sequential

 No memory elements or feedback (Output of one

 Obtain the Boolean function or truth table

From diagram, Inputs Outputs

the number of inputs and outputs. Assign a

relationship between inputs and outputs

 Number of inputs to a gate,

 Propagation time of the signal through the gates,

 Number of interconnections, etc.

Note: The six bit

The simplified implementation requires four AND

 A combinational circuit that performs addition of

 A combinational circuit that performs addition of

You might also like