+ +

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
Chapter 11 Digital Logic expression.

William Stallings, Computer Organization and Architecture, 9th Edition

1 2

+ + 11.1- Boolean Algebra

Contents
 Mathematical discipline (môn) used to design and analyze
the behavior of the digital circuitry in digital computers and
other digital systems
 11.1- Boolean Algebra  Named after George Boole
 English mathematician
 11.2-Gates  Proposed basic principles of the algebra in 1854

 11.3- Combinational Circuit  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

3 4
 + Boolean Algebra +
Boolean Variables and Operations
 Investigated (xem xét/nghiên cứu) Set:  Makes use of variables and operations
 Are logical
B = { False, True } = { F, T} = {0,1}  A variable may take on the value 1 (TRUE) or 0 (FALSE)
 Basic logical operations are AND, OR, and NOT
 Basic Operator: AND (.), OR (+), NOT
 AND
Yields true (binary value 1) if and only if both of its operands are true
 Other opertors: NAND (Not And), NOR (Not 
 In the absence of parentheses the AND operation takes precedence
Or), XOR ( Exclusive OR) over the OR operation
 When no ambiguity will occur the AND operation is represented by
simple concatenation instead of the dot operator
 Representation:
 OR
 Yields true if either or both of its operands are true

 NOT
 Inverts the value of its operand

5 6

Table 11.1- Boolean Operators Table 11.2: Basic Identities of

Boolean Algebra

Không thể hiển thị ảnh.

7 8
 + +
11.2- Basic
Logic Gates Uses of
NAND 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 Uses of
operation of Boolean logic,
such as AND, OR, or NOT
NOR Gates
(Microsoft Computer
Dictionary)

9 10

11.3- Combinational
An interconnected set of
gates whose output at any +
Circuit
time is a function only of the
input at that time Example: Using 3 ways for a
The appearance of the input
is followed almost
Boolean Function of Three Variables
immediately by the
appearance of the output,
with only gate delays
Sum of product (SOP)
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 Product of Sum (POS)

11 12
 + Algebraic Simplification
Algebraic Simplication
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

13 14

Karnaugh Map
Example

Karnaugh
Maps

+ +

 A convenient way of representing a Boolean function of a small

number (up to four) of variables

15 16
 + Table 11.4- Truth Table for the One-Digit
Overlapping Packed Decimal Incrementer
good

No good
Groups

17 18

Table 11.5: First Stage of

Figure Quine-McCluskey Method

Không thể hiển thị ảnh.

0001
11.10 0101
0110
1100
0111
1011
+ 1101
1111

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

19 20
 Table 11.6: Last Stage of +
Exercises
Quine-McCluskey Method

Không thể hiển thị ảnh.

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

11-1+ 01-1  -1-1  BD

21 22

+ + Summary
Summary
Digital Logic
Chapter 11

 Boolean Algebra
 Gates

 Combinational Circuit
 Algebraic Simplification
 Karnaugh Map
 Quine-McCluskey Method

23 24