Digital Electronics Chapter 5

Chapter 5
Combinational Logic Circuits
Dr Abdelaziz Yousif
Ahmed 22-03-23
Ext: 7845
Digital Fundamentals, Eleventh Edition, Global Edition Copyright © 2016 by Pearson Education, Ltd.
Thomas L. Floyd All Rights Reserved
Course Outcome
1. Explain number systems, codes, digital arithmetic operation
and circuits.
2. Use Boolean algebra and Karnaugh Maps to minimize
Boolean expressions for the design of digital logic circuits.
3. Explain and use flip-flops, latches, counters, multiplexers and
de-multiplexers.
4. Design and construct combinational digital logic
circuits using appropriate logic design techniques.
5. Design and construct synchronous sequential digital
logic circuits using appropriate logic design techniques.
Learning Outcome
1. Analyze basic combinational logic circuits, such as AND-OR, AND-OR-
Invert, exclusive-OR, and exclusive-NOR
2. Use AND-OR and AND-OR-Invert circuits to implement
sum-of- products (SOP) and product-of sums (POS) expressions
3. Write the Boolean output expression for any combinational logic circuit
4. Develop a truth table from the output expression for a combinational
logic circuit
5. Use the Karnaugh map to expand an output expression containing terms
with missing variables into a full SOP form
6. Design a combinational logic circuit for a given Boolean
output expression
7. Design a combinational logic circuit for a given truth table
8. Simplify a combinational logic circuit to its minimum form
9. Use NAND gates to implement any combinational logic function
10. Use NOR gates to implement any combinational logic function
11. Analyze the operation of logic circuits with pulse inputs
Outline
1. Basic Combinational Logic Circuits
2. Implementing Combinational Logic
3. The Universal Property of NAND and NOR Gates
4. Combinational Logic Using NAND and NOR Gates
5. Pulse Waveform Operation
In Sum-of-Products (SOP) form, basic combinational
circuits can be directly implemented with AND-OR
combinations if the necessary complement terms are
available.
Product terms
A
AB
B
CD
C
AB + CD + . . . + JK
D
J Sum-of-products
JK
K
Product term
An example of an SOP implementation is shown. The
SOP expression is an AND-OR combination of the
input variables and the appropriate complements.
A
ABC
B X = ABC + DE SOP
C
D
DE
When the output of a SOP form is inverted, the circuit is
called an AND-OR-Invert circuit. The AOI configuration
lends itself to product-of-sums (POS) implementation.
An example of an AOI implementation is shown. The

output expression can be changed to a POS
expression by applying DeMorgan’s theorem twice.
A
ABC
B X = ABC + DE X = ABC + DE AOI
C
D X = (ABC)(DE) DeMorgan
DE X = (A + B + C)(D + E) POS
E
Exclusive-OR Logic
The truth table for an exclusive-OR gate is Inputs Output
A B X
Notice that the output is HIGH whenever 0 0 0
0 1 1
A and B disagree. 1 0 1
1 1 0
The Boolean expression is X = AB +

AB
The circuit
A can be drawn as
Symbols:
X =1
Distinctive shape Rectangular

B outline
Exclusive-NOR Logic
The truth table for an exclusive-NOR gate is Inputs Output
A B X
Notice that the output is HIGH whenever 0 0 1
0 1 0
A and B agree. 1 0 0
1 1 1
The Boolean expression is X = AB + AB
The circuit can be drawn as
A Symbols:
X
B
=1
Distinctive shape Rectangular

outline
Exclusive-NOR Logic
For each circuit, determine if the LED should be on or off.

+5.0 V
+5.0 V
+5.0 V +5.0 V
+5.0 V
+5.0 V
330 
330 
330 
LED B
B LED B LED
A
A A
(a) (b) (c)
Circuit (a): XOR, inputs agree, output is LOW, LED is ON.

Circuit (b): XNOR, inputs disagree, output is LOW, LED is
ON. Circuit (c): XOR, inputs disagree, output is HIGH, LED is
OFF.
Implementing Combinational Logic
Implementing a SOP expression is done by first forming
the AND terms; then the terms are ORed together.
Show the circuit that will implement the
Boolean expression X = ABC + ABD + BDE. (Assume that
the variables and their complements are available.)
Start by forming the terms using three 3-input AND gates.
Then combine the three terms using a 3-input OR gate.

A
C X = ABC + ABD + BDE

A
D
B
D
Karnaugh Map Implementation
For basic combinational logic circuits, the Karnaugh map
can be read and the circuit drawn as a minimum SOP.
A Karnaugh map is drawn from a truth table. Read
the minimum SOP expression and draw the circuit.
C C
1. Group the 1’s into two overlapping
AB 1C
B groups as indicated.
changes AB 1AB 11 2. Read each group by eliminating any
across variable that changes across a boundary.
this AB AB 1 3. The vertical group is read AC.
boundary 1
C 4. The horizontal group is read AB.
AB changes
A
across The circuit is on the next
this slide:
boundary
B
continued…
Circuit: A
X= AC + A
C B
A
B
The result is shown as a sum of products.
It is a simple matter to implement this form using

only NAND gates as shown in the text and following
example.
Convert the circuit in the previous example

to one that uses only NAND gates.
Recall from Boolean algebra that double inversion

cancels. By adding inverting bubbles to above circuit,
it is easily converted to NAND gates:
A
X= AC + A
C B
A
Universal application of NAND gates
NAND gates are sometimes called universal gates
because they can be used to produce the other
basic Boolean functions.
A A A AB
B
Inverter AND gate
A A
A+B A+B
B B
OR gate NOR gate
Universal application of NOR gates
NOR gates are also universal gates and can form
all of the basic gates.
A A A A+ B
B
Inverter OR gate
A A
AB AB
B B
AND gate NAND gate
Pulsed Waveforms
For combinational circuits with pulsed inputs, the output
can be predicted by developing intermediate outputs
and combining the result. For example, the circuit
shown can be analyzed at the outputs of the OR gates:
A
A
B B G1
C
C G3
D G2
G1 D
G2
G3
Pulsed Waveforms
Alternatively, you can develop the truth table for
Inputs Output
the circuit and enter 0’s and 1’s on the
waveforms. Then read the output from the table. A B C D X
0 0 0 0 0
0 0 0 1 1
0 0 1 0 1
A 0 0 1 1 1
G1
0 1 0 0 0
B G3 0 1 0 1 1
C 0 1 1 0 1
G2
0 1 1 1 1
1 0 0 0 0
AD 0 1 0 1 0 1 0 1 0 1 1 0 0 1 0
1 0 1 0 0
B 0 1 1 0 0 1 0 0 0 1 0 1 1 0
1 1 1 0 0 0
0 0 0 1 1 1 1 0 0 0
1 1 0 1 1
C 0 0 0 0 0 0 0 1 1 1 1 1 0 1
0 1 1 1 1 1
D3 0 0 0 0 1 1 1 0 1 0
G
Quiz
1.Assume an AOI expression is AB + CD. The

equivalent POS expression is
a. (A + B)(C + D)
b. (A + B)(C + D)
c. (A + B)(C + D)
d. none of the above
Quiz
2. The truth table shown is for

a. a NAND gate Inputs Output
A B X
b. a NOR gate 0 0 1
0 1 0
c. an exclusive-OR gate 1 0 0
1 1 1
d. an exclusive-NOR gate
Quiz
3. An LED that should be ON is +5.0 V

+5.0 V
a. LED-1 330 
B LED-1
b. LED-2
A
c. neither
+5.0 V
d. both +5.0 V
330 
B LED-2
Quiz
2. To implement the SOP expression X = ABC + ABD + BDE

, the type of gate that is needed is a
a. 3-input AND gate A
b. 3-input NAND gate B
C
c. 3-input OR gate A
B
d. 3-input NOR gate
D
B
Quiz
5. Reading the Karnaugh map, the logic expression is

a. AC + AB
C C
b. AB + AC 1
AB
c. AB + BC 1 1
AB
d. AB + A
AB
C
AB
Quiz
6. The circuit shown will have identical logic out if all

gates are changed to
a. AND gates A
b. OR gates
B
C
c. NAND gates
D
d. NOR gates
Quiz
7.The two types of gates which are called universal

gates are
a. AND/OR
b. NAND/NOR
c. AND/NAND
d. OR/NOR
Quiz
8. The circuit shown is equivalent to an

a. AND gate
A
b. XOR gate
B
c. OR gate
Quiz
9. The circuit shown is equivalent to

a. an AND gate
A
b. an XOR gate
B
c. an OR gate
Quiz
10.During the first three intervals for the pulsed
circuit shown, the output of
a. G1 is LOW and G2 is LOW
b. G1 is LOW and G2 is HIGH
c. G1 is HIGH and G2 is LOW
d. G1 is HIGH and G2 is HIGH
A
A G1
B
B
C G3
G2
C D
D Digital Fundamentals, Eleventh Edition, Global Edition

Thomas L. Floyd
Copyright © 2016 by Pearson Education, Ltd.
All Rights Reserved
Quiz
Answers:
1. b 6. c
2. d 7. b
3. a 8. c
4. c 9. a
5. d 10. c
Cooperative Learning
Functions of Combinational Logic
Topics No
Half, Full Adders and Parallel Binary Adders 1
Comparators 2
Decoders and Encoders 3
Code Converters 4
Multiplexers (Data Selectors) and Demultiplexers 5

Digital Electronics Chapter 5

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Digital Electronics Chapter 5

Uploaded by

Copyright:

Available Formats

Chapter 5

Combinational Logic Circuits

An example of an AOI implementation is shown. The

The Boolean expression is X = AB +

Distinctive shape Rectangular

The Boolean expression is X = AB + AB

The circuit can be drawn as

Distinctive shape Rectangular

For each circuit, determine if the LED should be on or off.

(a) (b) (c)

Circuit (a): XOR, inputs agree, output is LOW, LED is ON.

Start by forming the terms using three 3-input AND gates.

Then combine the three terms using a 3-input OR gate.

C X = ABC + ABD + BDE

It is a simple matter to implement this form using

Convert the circuit in the previous example

Recall from Boolean algebra that double inversion

OR gate NOR gate

AND gate NAND gate

1.Assume an AOI expression is AB + CD. The

2. The truth table shown is for

3. An LED that should be ON is +5.0 V

2. To implement the SOP expression X = ABC + ABD + BDE

5. Reading the Karnaugh map, the logic expression is

6. The circuit shown will have identical logic out if all

7.The two types of gates which are called universal

8. The circuit shown is equivalent to an

9. The circuit shown is equivalent to

D Digital Fundamentals, Eleventh Edition, Global Edition

You might also like