+

Chapter 11 Digital Logic

William Stallings, Computer Organization and Architecture, 9th Edition
+ 2

Objectives
◼ What are the basis of digital circuits?
◼ What are the basic electronic components?
◼ How can minimize a combinational circuits?
◼ After studying this chapter, you should be able to:
◼ Understand the basic operations of Boolean
algebra.
◼ Use a Karnaugh map to simplify a Boolean
expression.
+ 3

Contents

◼ 11.1 - Boolean Algebra

◼ 11.2 - Gates
◼ 11.3 - Combinational Circuit
+ 11.1 - Boolean Algebra 4

◼ Mathematical discipline (môn) used to design and analyze the

behavior of the digital circuitry in digital computers and other
digital systems
◼ Named after George Boole
◼ English mathematician
◼ Proposed basic principles of the algebra in 1854

◼ Claude Shannon suggested Boolean algebra could be used to

solve problems in relay-switching circuit design
◼ Is a convenient tool:
◼ Analysis
◼ It is an economical way of describing the function of digital circuitry
◼ Design
◼ Given a desired function, Boolean algebra can be applied to
develop a simplified implementation of that function
+ Boolean Algebra 5

◼ Investigated Set:
B = {False, True} = {F, T} = {0,1}
◼ Basic Operator: AND (.), OR (+), NOT
◼ Other opertors: NAND (Not And),
NOR (Not Or), XOR (Exclusive OR)
◼ Representation:
Table 11.1 - Boolean Operators 6
 Exercises (p.433) 7

Construct a truth table for the following Boolean

expressions:

ഥ + B + C)
ഥ + C . (A
a) A + B ത

b) A + B + Cത . (A + B + C). (A
ഥ + B + C)
ത

ഥ+( B+C . B
c) A ഥ + Cത )

ഥB
d) A. B + A. ത
ഥ + (A. C)
 Basic Identities of Boolean Algebra
8

Commutative Laws A.B = B.A A+B = B+A

Distributive Laws A.(B+C) = A.B + A.C A+B.C = (A+B).(A+C)
Associative Laws (A+B)+C = A+(B+C) (A.B).C = A.(B.C)
Involution Laws ന=A
A
Identity Elements 1.A = A.1 = A 0+A = A+0 = A
Inverse Elements ഥ =0
A. A ഥ=1
A+A
Null Laws 0.A = A.0 = 0 1+A = A+1 = 1
Idempotent Laws A.A = A A+A = A
Absorption Laws A.(A+B) = A A+AB = A
DeMorgan Theorem ഥ B
A. B = A+ ഥ ഥB
A + B = A. ഥ
 Absorption Laws
9

Please prove equation A.(A+B) = A

A.(A+B) = A.1 + A.B which law?

= A.(1 + B) which law?
= A.1 which law?
=A which law?

Please prove equation A+A.B = A

 Exercise (p.434)
10

Apply DeMorgan’s theorem to the following

equations: A = M. N + O. P

Simplify the following expressions:

a) A = S. T + V. W + R. S. T

b) A = F. (E + F + G)

c) A = Y. W + X + ഥ
Y + Zത . Z

d) A = B. E + C + F . C
+
11.2 - Basic
Logic Gates

An electronic switch that is

the elementary component
of a digital circuit. It
produces an electrical
output signal that represents
a binary 1 or 0 and is
related to the states of one
or more input signals by an
operation of Boolean logic,
such as AND, OR, or NOT
(Microsoft Computer
Dictionary)
+
Uses of
NAND Gates

Uses of
NOR Gates
 Exercise (p.433)
13

Draw a logic diagram for following expressions:

ഥ + B + C)
ഥ + C . (A
a) A + B ത

ഥ+( B+C . B
b) A ഥ + Cത )

ഥ. B
c) A. B + A ഥ + (A. Cത )

Draw a logic diagram for following expressions uses

NAND gate only.

Draw a logic diagram for following expressions uses

NOR gate only.
 An interconnected set of14
11.3 - Combinational gates whose output at any
time is a function only of the
Circuit input at that time
The appearance of the input
is followed almost
immediately by the
appearance of the output,
with only gate delays

Consists of n binary inputs

and m binary outputs

Can be defined in three ways:

• Truth table
• For each of the 2n possible
combinations of input signals, the
binary value of each of the m
output signals is listed
• Graphical symbols
• The interconnected layout of
gates is depicted
• Boolean equations
• Each output signal is expressed
as a Boolean function of its input
signals
+Example: Using 3 ways for a 15

Boolean Function of Three Variables

Sum of product (SOP)

Product of Sum (POS)

+Algebraic Simplication 16

Minimize a Boolean Function

◼ A Boolean function will be implemented as a

combinational network → More complex function
will cause a more complex network
◼ How to minimize a Bollean function?
◼ Methods:
◼ Karnaugh Map
◼ Quine-McCluskey Method
Algebraic Simplification
17

+
+Karnaugh table # Create 18

A convenient way of representing a Boolean function

of a small number (up to four) of variables

The map is an array of 2n squares, representing all

possible combinations of values of n binary variables.

Create Karnaugh table for following Boolean functions:

a) A(x, y) = x. y + x. yത
b) B(x, y) = x. y + xത. y + xത . yത
c) C(x, y, z) = x. y. zത + x. yത . zത + xത. y. z + xത. y. zത + xത . yത. zത
d) D(w, x, y, z) = wxyz + wxyതz + wxതyz + wതxyതz + wതxyതz +
wത
ഥ xyz + w
ഥ xതyത z + wxത
ഥ yz
 19

Example

Karnaugh
Maps

+
 20

good Overlapping

No good Groups

+
 Exercise
21

Minimize following Boolean functions using Karnaugh

minimization technique:

a) A(x, y) = x. y + x. yത
b) B(x, y) = x. y + xത. y + xത. yത
c) C(x, y, z) = x. y. zത + x. yത . zത + xത. y. z + xത. y. zത + xത. yത. zത
d) D(w, x, y, z) = wxyz + wxyതz + wxതyz + wതxyതz + wതxyതz +
w
ഥ xതyz + w
ഥ xതyത z + w
ഥ xതyz

e) E(x, y, z, t) = xyzt + xതy + xതz + yz + xyതz + xytҧ

f) F(x, y, z, t) = yത zt + yത zതtҧ + yതztҧ + xyzt + xതztҧ

 Table 11.5: First Stage of 22

Quine-McCluskey Method

0001
0101
0110
1100
0111
1011
1101
1111

A → 1, Not A → 0 ABCD → 1111 → Index=15

 Table 11.6: Last Stage of 23

Quine-McCluskey Method

1111 + 1101 → 11-1 0111 + 0101 → 01-1

11-1+ 01-1 → -1-1 → BD

 Exercise
24

Minimize following Boolean functions using Mc.Cluskey

minimization technique:

a) f w, x, y, z = wxyz + wxyz + wxyz + wxyz + wxyz +

wxyz + wxyz
b) f w, x, y, z = wxyz + wxyz + wxyz + wxyz + wxyz +
wxyz + wxyz

c) f(A, B, C, D) = Σ(1,2,4,5,6,10,12,13,14)

d) f(A, B, C, D) = Σ(3,4,6,7,8,11,12,15)