+
Chapter Digital
11: Logic
William Stallings, Computer Organization and Architecture, 9 th Edition
+ 2
Introduction to
Digital Logic
Input Output
0
1 1
0 Circuit 0
1 0
1
CLK VCC
Read note
+ CLO6: Be able to apply
3
ObjectivesBoolean algebra and digital
logic to design and interpret
complex digital circuits;
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.
+ 4
Contents
11.1- Boolean Algebra – Đại số Bool
11.2-Gates – Cổng điện tử
11.3- Combinational Circuit – Mạch tổ
hợp
+ 5
11 Exercises
Read note
+ 6
Exercises
Read note
+Exercises : Minimize Boolean 7
Functions
Ex: 9 Ex: 10 Ex: 11
+ 11.1- Boolean Algebra 8
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
Is a convenient tool: Applications of Boolean Algebra
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
Read note
+ Boolean Algebra 9
Investigated Set:
B = { False, True } = { F, T } =
{ 0,1}
Basic Operations: AND (.), OR (+), NOT
Others : NAND (Not And), NOR (Not
Or), XOR ( Exclusive OR)
Representation:
+ Boolean Variables and 10
Operators
Boolean variable: A variable may take on the value
1 (TRUE) or 0 (FALSE).
11
Basic Identities of Boolean
Algebra
(công thức cơ bản)
12
+
11.2- Basic
Logic Gates
Read note
13
+
Uses of
NAND Gates
Uses of
NOR Gates
Read note
14
An interconnected set of
11.3- gates whose output at any
time is a function only of
Combinational the input at that time
The appearance of the
Circuit 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
• Boolean equations
• Each output signal is expressed
as a Boolean function of its
input signals
• Graphical symbols
• The interconnected layout of
gates is depicted
Read note
+Example: Using 3 ways for a 15
Boolean Function of Three Variables
Sum of product (SOP)
Step 3
Step 2
Step 1
Product of Sum (POS) Step 2
Read note
+ 16
Algebraic Simplication
Minimize a Boolean
Function
A Boolean function is complex means that it
contains more gates.
More gates complex network, high power
needed, high cost, high resistance, lower
operation.
How to minimize a Boolean function?
Methods:
Karnaugh Map Do it on paper.
Quine-McCluskey Method A computer algorithm is
applied in digital design software.
Algebraic Simplification
17
Read note
Karnaugh Map 18
A
convenient
way of
representing
a Boolean
function of a
small
number (up
+
to four) of
variables
Read note
19
Example
Karnaugh
Maps
Read note
20
good Overlapping
Excessive
Groups
Read note
+ Table 11.4- Truth Table for the One-
21
Digit Packed Decimal Incrementer
Don’t Care
Conditions
Read note
22
Figure
11.10
Read note
Table 11.5: First Stage of 23
Quine-McCluskey Method
000
1
010
1
011
0
110
0
011
1
101
1
110
1 ABCD 1111
111 A 1, Not A 0
Index=15
1
Read note Read by yourself
24
Table 11.6: Last Stage of
Quine-McCluskey Method
1111 + 1101 11-1 0111 + 0101 01-1
11-1+ 01-1 -1-1 BD
Read by yourself
+ Summary
25
Digital Logic
Chapter 11
Boolean Algebra
Gates
Combinational Circuit
Algebraic Simplification
Karnaugh Map
Quine-McCluskey Method
