ECE 331 – Digital System Design

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

©2004 Brooks/Cole FIGURES FOR CHAPTER 5 KARNAUGH MAPS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter in the.
ECE 301 – Digital Electronics Karnaugh Maps (Lecture #7) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,
ECE 301 – Digital Electronics Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.
ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.
ECE 331 – Digital System Design
ECE 331 – Digital System Design
Chapter 3 Simplification of Switching Functions
Give qualifications of instructors: DAP
CS 140 Lecture 4 Professor CK Cheng 4/11/02. Part I. Combinational Logic Implementation K-Map Given F R D Obj: Minimize sum of products Proc: Draw K-Map.
ECE 301 – Digital Electronics Boolean Algebra and Standard Forms of Boolean Expressions (Lecture #4) The slides included herein were taken from the materials.
ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.
ECE 301 – Digital Electronics Karnaugh Maps and Determining a Minimal Cover (Lecture #8) The slides included herein were taken from the materials accompanying.
CS 140 Lecture 5 Professor CK Cheng CSE Dept. UC San Diego 1.
Simplifying Boolean Expressions Using K-Map Method
1 Chapter 5 Karnaugh Maps Mei Yang ECG Logic Design 1.
Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
ECE 331 – Digital System Design Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.
Unit 5 Karnaugh Maps Fundamentals of Logic Design by Roth and Kinney.
Converting to Minterms Form
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
Karnaugh Maps ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
Chapter 3 The Karnaugh Map
CS2100 Computer Organisation
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
1 Example: Groupings on 3-Variable K-Maps BC F(A,B,C) = A ’ B ’ A BC F(A,B,C) = B ’ A
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
Lecture # 5 University of Tehran
Karnaugh Maps (K maps).
CEC 220 Digital Circuit Design More Karnaugh Maps Monday, February 02 CEC 220 Digital Circuit Design Slide 1 of 11.
CEC 220 Digital Circuit Design Implicants Wed, Sept. 23 CEC 220 Digital Circuit Design Slide 1 of 10.
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.
©2010 Cengage Learning SLIDES FOR CHAPTER 5 KARNAUGH MAPS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter.
Lecture 6 Quine-McCluskey Method
ECE 331 – Digital System Design
ECE 301 – Digital Electronics
Minimization of Circuits
ECE 2110: Introduction to Digital Systems
Computer Organisation
Lecture #6 EGR 277 – Digital Logic
ECE 3110: Introduction to Digital Systems
ECE/CS 352 Digital Systems Fundamentals
CS 352 Introduction to Logic Design
Boolean Expressions Lecture No. 10.
ECE 2110: Introduction to Digital Systems
Optimized Implementation of Logic Function
ECE Digital logic Lecture 10: Karnaugh MAps
Optimized Implementation of Logic Function
Instructor: Alexander Stoytchev
ECE 331 – Digital System Design
EECS 465: Digital Systems Lecture Notes # 2
Digital Logic & Design Dr. Waseem Ikram Lecture 13.
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
SYEN 3330 Digital Systems Chapter 2 – Part 4 SYEN 3330 Digital Systems.
ECE 331 – Digital System Design
ECE 331 – Digital System Design
Optimization Algorithm
ECE 301 – Digital Electronics
Lecture 6 Logistics Last lecture Today’s lecture
Karnaugh Maps Introduction Venn Diagrams 2-variable K-maps
ECE 331 – Digital System Design
Chapter 3 Gate-level Minimization.
Lecture 6 Karnaugh maps (K-maps) K-maps with “don’t cares”
Optimized Implementation of Logic Function
COE 202: Digital Logic Design Combinational Logic Part 3
Minimization of Switching Functions
Instructor: Alexander Stoytchev
ECE 331 – Digital System Design
Presentation transcript:

ECE 331 – Digital System Design Karnaugh Maps, Determining a Minimal Cover, and Circuit Design and Analysis (Lecture #8) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6th Edition, by Roth and Kinney, and were used with permission from Cengage Learning.

ECE 331 - Digital System Design Four-variable K-map row # A B C D minterm m0 1 m1 2 m2 3 m3 4 m4 5 m5 … 11 m11 12 m12 13 m13 14 m14 15 m15 Spring 2011 ECE 331 - Digital System Design

ECE 331 - Digital System Design Four-variable K-map A B C D 0 0 0 1 1 1 1 0 Gray code m0 m4 m12 m8 m1 m5 m13 m9 m3 m7 m14 m11 m2 m6 m15 m10 Spring 2011 ECE 331 - Digital System Design

Minimization: Example #7 Use a Karnaugh map to determine the 1. minimum SOP expression 2. minimum POS expression For the following logic function: F(A,B,C,D) = S m(0,1,3,4,5,7,8,11,14) Specify the equivalent maxterm expansion. Spring 2011 ECE 331 - Digital System Design

Minimization: Example #8 Use a Karnaugh map to determine the 1. minimum SOP expression 2. minimum POS expression For the following logic function: F(A,B,C,D) = P M(0,2,5,7,8,11,13,15) Specify the equivalent minterm expansion. Spring 2011 ECE 331 - Digital System Design

Minimization: Example #9 Use a Karnaugh map to determine the 1. minimum SOP expression 2. minimum POS expression For the following logic function: F(A,B,C,D) = P M(0,1,2,3,6,11,14) What is the cost of each logic circuit? Spring 2011 ECE 331 - Digital System Design

ECE 331 - Digital System Design Karnaugh Maps Karnaugh maps can also be used to minimize incompletely specified functions. Spring 2011 ECE 331 - Digital System Design

Minimization: Example #10 Use a Karnaugh map to determine the 1. minimum SOP expression 2. minimum POS expression For the following logic function: F(A,B,C) = S m(0,2,4) + S d(1,6,7) Spring 2011 ECE 331 - Digital System Design

Minimization: Example #11 Use a Karnaugh map to determine the 1. minimum SOP expression 2. minimum POS expression For the following logic function: F(A,B,C,D) = P M(2,8,11,13,14,15) . P D(5,7,9,12) Spring 2011 ECE 331 - Digital System Design

Determining a Minimal Cover Spring 2011 ECE 331 - Digital System Design

Literals and Implicants Each occurrence of a variable or its complement in an expression Implicant (SOP) ← represents a product term A single 1 in the K-map A group of adjacent 1's in the K-map Implicant (POS) ← represents a sum term A single 0 in the K-map A group of adjacent 0's in the K-map Spring 2011 ECE 331 - Digital System Design

ECE 331 - Digital System Design Prime Implicants Prime Implicant (SOP) A product term implicant that cannot be combined with another product term implicant to eliminate a literal. Prime Implicant (POS) A sum term implicant that cannot be combined with another sum term implicant to eliminate a literal. Spring 2011 ECE 331 - Digital System Design

Implicants and Prime Implicants Spring 2011 ECE 331 - Digital System Design

Identifying Prime Implicants Spring 2011 ECE 331 - Digital System Design

Identifying Required Terms Is this term required? Spring 2011 ECE 331 - Digital System Design

Essential Prime Implicants If a minterm is covered by only one prime implicant, that prime implicant is said to be essential, and must be included in the minimum sum of products (SOP). Essential Prime Implicants Prime Implicants Implicants Spring 2011 ECE 331 - Digital System Design

Identifying Essential Prime Implicants Note: 1’s shaded in blue are covered by only one prime implicant. All other 1’s are covered by at least two prime implicants. Spring 2011 ECE 331 - Digital System Design

Determining a Minimal Cover Identify all prime implicants Select all essential prime implicants Select prime implicant(s) to cover remaining terms by considering all possibilities Sometimes selection is obvious Sometimes “guess” next prime implicant Continue, perhaps recursively Try all possible “guesses” Determine the Boolean expression May not be unique Spring 2011 ECE 331 - Digital System Design

Determining a Minimal Cover Shaded 1’s are covered by only one prime implicant. Essential prime implicants: A′B, AB′D′ Then AC′D covers the remaining 1’s. Spring 2011 ECE 331 - Digital System Design

ECE 331 - Digital System Design A Minimal Cover Thus … A minimal cover is an expression that consists of the fewest product terms (for a SOP expression) or sum terms (for a POS expression) and the fewest literals in each term. Spring 2011 ECE 331 - Digital System Design

ECE 331 - Digital System Design Questions? Spring 2011 ECE 331 - Digital System Design