CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

Gate-Level Minimization
Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 8 – Systematic Simplification.
Chapter 3 Simplification of Switching Functions. Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.
Gate-level Minimization
©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.
Chapter 3 Simplification of Switching Functions
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Give qualifications of instructors: DAP
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 4-1 Chapter #2: Two-Level Combinational Logic Section 2.3, Switches and Tools.
ECE 301 – Digital Electronics Karnaugh Maps and Determining a Minimal Cover (Lecture #8) The slides included herein were taken from the materials accompanying.
Simplifying Boolean Expressions Using K-Map Method
1 Simplification of Boolean Functions:  An implementation of a Boolean Function requires the use of logic gates.  A smaller number of gates, with each.
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.
Department of Computer Engineering
Optimization Algorithm
Examples. Examples (1/11)  Example #1: f(A,B,C,D) =  m(2,3,4,5,7,8,10,13,15) Fill in the 1’s. 1 1 C A B CD AB D 1 1.
Combinational Logic Part 2: Karnaugh maps (quick).
Chapter 6 Quine-McCluskey Method Mei Yang ECG Logic Design 1.
Unit 5 Karnaugh Maps Fundamentals of Logic Design by Roth and Kinney.
Simplification of incompletely specified functions using QM Tech.
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
07 KM Page 1 ECEn/CS 224 Karnaugh Maps. 07 KM Page 2 ECEn/CS 224 What are Karnaugh Maps? A simpler way to handle most (but not all) jobs of manipulating.
Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.
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.
CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 Topic 4: Cost of Logic Circuits and Karnaugh Maps José Nelson Amaral.
Karnaugh Maps (K maps).
CEC 220 Digital Circuit Design Implicants Wed, Sept. 23 CEC 220 Digital Circuit Design Slide 1 of 10.
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.
1 EENG 2710 Chapter 3 Simplification of Switching Functions.
©2010 Cengage Learning SLIDES FOR CHAPTER 6 QUINE-McCLUSKEY METHOD Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
©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.
CHAPTER 6 Quine-McCluskey Method
Lecture 6 Quine-McCluskey Method
ECE 2110: Introduction to Digital Systems
Computer Organisation
ECE 3110: Introduction to Digital Systems
QUINE-McCLUSKEY METHOD
Plotting functions not in canonical form
CS 352 Introduction to Logic Design
CSCE 211: Digital Logic Design
Karnaugh Maps.
ECE 331 – Digital System Design
Chapter 6 Quine-McCluskey Method
CSCE 211: Digital Logic Design
Optimized Implementation of Logic Function
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
ECE 331 – Digital System Design
Optimization Algorithm
Karnaugh Maps Introduction Venn Diagrams 2-variable K-maps
ECE 331 – Digital System Design
Chapter 3 Gate-level Minimization.
CSCE 211: Digital Logic Design
COE 202: Digital Logic Design Combinational Logic Part 3
Minimization of Switching Functions
Overview Part 2 – Circuit Optimization
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
CHAPTER 6 QUINE-McCLUSKEY METHOD
CSCE 211: Digital Logic Design
Laws & Rules of Boolean Algebra
Simplification of Boolean Functions using K-Maps
ECE 331 – Digital System Design
Computer Architecture
Presentation transcript:

CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions 5.2 Two- and Three-Variable Karnaugh Maps 5.3 Four-Variable Karnaugh Maps 5.4 Determination of Minimum Expressions 5.5 Five-Variable Karnaugh Maps 5.6 Other Uses of Karnaugh Maps 5.7 Other Forms of Karnaugh Maps

Objectives Given a function (completely or in completely specified) of three to five variable, plot it on a Karnaugh map. The function may be given in minterm, maxterm, or algebraic form. 2. Determine the essential prime implicants of a function from a map. 3. Obtain the minimum sum-of-products or minimum product-of-sums form of a function from the map. 4. Determine all of the prime implicants of a function from a map. 5. Understand the relation between operations performed using the map and the corresponding algebraic operation.

5.1 Minimum Forms of Switching Functions Combine terms by using Do this repeatedly to eliminates as many literals as possible. A given term may be used more than once because 2. Eliminate redundant terms by using the consensus theorems.

5.1 Minimum Forms of Switching Functions Example: Find a minimum sum-of-products

5.1 Minimum Forms of Switching Functions Example: Find a minimum product-of-sums Eliminate by consensus

5.2 Two- and Three-Variable Karnaugh Maps A 2-variable Karnaugh Map

5.2 Two- and Three-Variable Karnaugh Maps Truth Table for a function F A B F 0 0 0 1 1 0 1 1 1 (a)

5.2 Two- and Three-Variable Karnaugh Maps Truth Table and Karnaugh Map for Three-Variable Function A B C F 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 1 (a)

5.2 Two- and Three-Variable Karnaugh Maps Location of Minterms on a Three-Variable Karnaugh Map

5.2 Two- and Three-Variable Karnaugh Maps Karnaugh Map of F(a, b, c) = m(1, 3, 5) = ∏(0, 2, 4, 6, 7)

5.2 Two- and Three-Variable Karnaugh Maps Karnaugh Maps for Product Terms

5.2 Two- and Three-Variable Karnaugh Maps Given Function

5.2 Two- and Three-Variable Karnaugh Maps Simplification of a Three-Variable Function

5.2 Two- and Three-Variable Karnaugh Maps Complement of Map in Figure 5-6(a)

5.2 Two- and Three-Variable Karnaugh Maps Karnaugh Maps Which Illustrate the Consensus Theorem Consensus term is redundant

5.2 Two- and Three-Variable Karnaugh Maps Function with Two Minimal Forms

5.3 Four-Variable Karnaugh Maps Location of Minterms on Four-Variable Karnaugh Map

5.3 Four-Variable Karnaugh Maps Plot of acd + a’b + d’

5.3 Four-Variable Karnaugh Maps Simplification of Four-Variable Functions

5.3 Four-Variable Karnaugh Maps Simplification of an Incompletely Specified Function Don’t care term

5.3 Four-Variable Karnaugh Maps Figure 5-14

5.4 Determination of Minimum Expressions Using Essential Prime Implicants - Implicants of F : Any single ‘1’ or any group of “1’s which can be combined together on a Map - prime Implicants of F : A product term if it can not be combined with other terms to eliminate variable It is not Prime implicants since it can be combined with other terms Prime implicants Prime implicants

5.4 Determination of Minimum Expressions Using Essential Prime Implicants Determination of All Prime Implicants

5.4 Determination of Minimum Expressions Using Essential Prime Implicants Because all of the prime implicants of a function are generally not needed in forming the minimum sum of products, selecting prime implicants is needed. - CD is not needed to cover for minimum expression B’C , AC , BD are “essential” prime implicants CD is not an “essential “ prime implicants

5.4 Determination of Minimum Expressions Using Essential Prime Implicants First, find essential prime implicants If minterms are not covered by essential prime implicants only, more prime implicants must be added to form minimum expression.

5.4 Determination of Minimum Expressions Using Essential Prime Implicants Flowchart for Determining a Minimum Sum of Products Using a Karnaugh Map

5.4 Determination of Minimum Expressions Using Essential Prime Implicants A’B covers I6 and its adjacent  essential PI AB’D’ covers I10 and its adjacent  essential PI AC’D is chosen for minimal cover  AC’D is not an essential PI

5.5 Five-Variable Karnaugh Maps

5.5 Five-Variable Karnaugh Maps Figure 5-22

5.5 Five-Variable Karnaugh Maps Figure 5-23 Resulting minimum solution

5.5 Five-Variable Karnaugh Maps Figure 5-24 Final solution

5.6 Other Uses of Karnaugh Maps same Figure 5-25

5.6 Other Uses of Karnaugh Maps Figure 5-26 ACDE

5.7 Other Forms of Karnaugh Maps Figure 5-27. Veitch Diagrams

5.7 Other Forms of Karnaugh Maps Figure 5-28. Other Forms of Five-Variable Karnaugh Maps