Scribd
Upload
97 views17 pages

Slot16 CH11 Digital Logic 24 Slides

This document summarizes key concepts about digital logic and Boolean algebra. It discusses Boolean variables and operations like AND, OR, and NOT. Common logic gates are introduced, including how NAND and NOR gates can be used to represent all Boolean functions. Methods for minimizing Boolean functions are covered, specifically Karnaugh maps and the Quine-McCluskey method. The document provides examples of representing Boolean functions in sum of products and product of sum form.

Uploaded by

tuan luu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
97 views17 pages

Slot16 CH11 Digital Logic 24 Slides

This document summarizes key concepts about digital logic and Boolean algebra. It discusses Boolean variables and operations like AND, OR, and NOT. Common logic gates are introduced, including how NAND and NOR gates can be used to represent all Boolean functions. Methods for minimizing Boolean functions are covered, specifically Karnaugh maps and the Quine-McCluskey method. The document provides examples of representing Boolean functions in sum of products and product of sum form.

Uploaded by

tuan luu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

+

Chapter 11 Digital Logic


William Stallings, Computer Organization and Architecture, 9 th Edition
+ 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
+
Example: Using 3 ways for a
Boolean Function of Three Variables
Sum of product (SOP)

Product of Sum (POS)


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

+
Figure

11.10

+
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

You might also like