Digital Logic Design

Digital Logic Design
Combinational Logic Analysis
CHAPTER 5
Content
Basic Combinational Logic Circuit

Implementing Combinational Logic
The Universal Property of NAND and NOR Gates
Combinational Logic Using NAND and NOR Gates
Logic Circuit Operation with Pulse Waveform Inputs
Combinational Logic Circuits
In Sum-of-Products (SOP) form, basic

combinational circuits can be directly implemented
with AND-OR.
Product terms
A
AB
B
C CD
D AB + CD + . . . + JK
Sum-of-products
J
JK
K
Product term
AND OR Logic
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
B ABC
C X = ABC + DE SOP
D
DE
E
Example 5-1
Figure 5-2
AND-OR-Invert Logic
When the output of a SOP form is inverted, the
circuit is called an AND-OR-Invert (AOI)
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
A
twice.
B ABC
C X = ABC + DE X = ABC + DE AOI
D X = (ABC)(DE) DeMorgan
E DE X = (A + B + C)(D + E) POS
Example 5-2
Exclusive-OR Logic
The truth table for an exclusive-OR
gate is: --------------------------------- Inputs Output
A B X
Notice that the output is HIGH 0 0 0
whenever A and B disagree. 0 1 1
1 0 1
The Boolean expression is 1 1 0
The circuit can be drawn as

A
Symbols:
X =1
Distinctive shape Rectangular

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

outline
Example
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 W
330 W 330 W
B LED
B LED
B LED
A
A A
(a) (b) (c)
Circuit (a): Circuit (b): Circuit (c):

XOR, inputs XNOR, inputs XOR, inputs
agree, output disagree, output disagree, output
is LOW, LED is LOW, LED is is HIGH, LED is
is ON. ON. OFF.
From Boolean Expression to Logic Circuit
Implementing Combinational Logic
Implementing a SOP expression is done by first forming the
AND terms; then the terms are ORed together.
Example 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
B
C
A X = ABC + ABD + BDE
B
D
B
D
E
From a Truth table to a Logic Circuit
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 1
B groups as indicated.
changes AB 1 1 2. Read each group by eliminating any
across variable that changes across a boundary.
this AB 3. The vertical group is read A C.
boundar
y C 4. The horizontal group is read AB.
AB changes
across
this
boundar
Circuit: A
C X= AC + AB
A
B
The result is shown as a sum of products.

Application Example
a
f b
g
e c
d
Case of numbers only
Out put a for example
NAND Logic
Universal 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

NAND Logic
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
C X= AC + AB
A
B
Universal 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

NAND Logic
Recall from DeMorgan’s theorem that AB = A + B. By
using equivalent symbols, it is simpler to read the logic of
SOP forms. The earlier example shows the idea:
A
C X= AC + AB
A
B
The logic is easy to read if you (mentally) cancel the

two connected bubbles on a line.
NOR Logic
Alternatively, DeMorgan’s theorem can be written as A + B =
A B. By using equivalent symbols, it is simpler to read the logic
of POS forms. For example,
A
B X = (A + B)(A + C)
A
C
Again, the logic is easy to read if you cancel the two

connected bubbles on a line.
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 G1
B
G3
C
C
D G2
D
G1
G2
G3
Pulsed Waveforms
Inputs Output
Alternatively, you can develop the truth table
A B C D X
for the circuit and enter 0’s and 1’s on the
waveforms. Then read the output from the 0 0 0 0 0
0 0 0 1 1
table. 0 0 1 0 1
A
G1 0 0 1 1 1
B 0 1 0 0 0
G3 0 1 0 1 1
C 0 1 1 0 1
G2 1
D 0 1 1 1
1 0 0 0 0
A 0 1 0 1 0 1 0 1 0 1 0 0 1 0
1 1 0 1 0 0
B 0 1 1 0 0 1 1 0 0 1 0 1 1 0
0 1 1 0 0 0
C 0 0 0 1 1 1 1 0 0
1 1 0 1 1
0 1 1 1 0 1
D 0 0 0 0 0 0 0 1 1
1 1 1 1 1
G3 0 0 0 0 0 1 1 1 0 1
0
References
1. T. Floyd, “Digital Fundamental”, 10th Ed., USA:

PrenticeHall, 2008
2. R.J. Tocci, “Digital Systems: Principles and
Applications”, 10th Ed., USA: Prentice-Hall, 2006
3. W. Kleitz, “Digital Electronics: A Practical
Approach”, 8th Ed., USA: Prentice-Hall, 2007
4. Begnell and Donovan, “Digital Electronics”, 5th
Ed., USA: Delmar Thomson Learning, 2006

Digital Logic Design

Uploaded by

Copyright:

Available Formats

Digital Logic Design

Uploaded by

Document Information

Original Title

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 Logic Design

Uploaded by

Copyright:

Available Formats

Digital Logic Design

Combinational Logic Analysis

Basic Combinational Logic Circuit

In Sum-of-Products (SOP) form, basic

An example of an SOP implementation is shown. The

The circuit can be drawn as

Distinctive shape Rectangular

The circuit can be drawn as

Distinctive shape Rectangular

(a) (b) (c)

Circuit (a): Circuit (b): Circuit (c):

A Karnaugh map is drawn from a truth table. Read the

The result is shown as a sum of products.

NAND gates are sometimes called universal

OR gate NOR gate

Convert the circuit in the previous example to one that

Recall from Boolean algebra that double inversion

AND gate NAND gate

The logic is easy to read if you (mentally) cancel the

Again, the logic is easy to read if you cancel the two

1. T. Floyd, “Digital Fundamental”, 10th Ed., USA:

You might also like