Scribd
Upload
108 views

Chapter 11 - Digital Logic

This chapter discusses digital logic and covers Boolean algebra, logic gates, and combinational circuits. It describes how Boolean algebra can be used to analyze and design digital circuitry. The chapter also explains logic gates, how to minimize Boolean functions using Karnaugh maps and the Quine-McCluskey method, and how to design combinational circuits. The overall objectives are to understand Boolean algebra and how it can be applied to simplify digital logic implementations.

Uploaded by

Trần Thái Sơn
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
108 views

Chapter 11 - Digital Logic

This chapter discusses digital logic and covers Boolean algebra, logic gates, and combinational circuits. It describes how Boolean algebra can be used to analyze and design digital circuitry. The chapter also explains logic gates, how to minimize Boolean functions using Karnaugh maps and the Quine-McCluskey method, and how to design combinational circuits. The overall objectives are to understand Boolean algebra and how it can be applied to simplify digital logic implementations.

Uploaded by

Trần Thái Sơn
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

+

Chapter 11 Digital Logic


William Stallings, Computer Organization and Architecture, 9th Edition
+
Objectives
 What are the basis of digital circuits?
 What are the basic electronic components?
 How can minimize a combinational circuits?
 Afterstudying this chapter, you should be
able to:
 Understand the basic operations of Boolean
algebra.
 Use a Karnaugh map to simplify a Boolean
expression.
+
Contents

 11.1- Boolean Algebra


 11.2-Gates

 11.3- Combinational Circuit


+ 11.1- Boolean Algebra
 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
 Investigated Set:
B = { False, True } = { F, T} = {0,1}
 Basic Operator: AND (.), OR (+), NOT
 Other operators: NAND (Not And), NOR
(Not Or), XOR ( Exclusive OR)
 Representation:
+
Boolean Variables and Operations
 Makes use of variables and operations
 Are logical
 A variable may take on the value 1 (TRUE) or 0 (FALSE)
 Basic logical operations are AND, OR, and NOT

 AND
 Yields true (binary value 1) if and only if both of its operands are true
 In the absence of parentheses the AND operation takes precedence
over the OR operation
 When no ambiguity will occur the AND operation is represented by
simple concatenation instead of the dot operator

 OR
 Yields true if either or both of its operands are true

 NOT
 Inverts the value of its operand
Table 11.1- Boolean Operators
Table 11.2: Basic Identities of
Boolean Algebra
+
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
11.3- Combinational
An interconnected set of
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
Boolean Function of Three Variables
Sum of product (SOP)

Product of Sum (POS)


+
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
Algebraic Simplification

+
Karnaugh Map

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


number (up to four) of variables
Example

Karnaugh
Maps

+
good Overlapping

No good
Groups

+
+ Table 11.4- Truth Table for the One-Digit
Packed Decimal Incrementer
Figure

11.10

+
Table 11.5: First Stage of
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
Quine-McCluskey Method

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

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


+
Exercises
+
Summary
+ Summary
Digital Logic
Chapter 11

 Boolean Algebra
 Gates

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

You might also like