Chapter 6 Quine-McCluskey Method Mei Yang www.vustudents.ning.com ECG 100-001 Logic Design 1.

Slides:



Advertisements
Similar presentations
CSEE 4823 Advanced Logic Design Handout: Lecture #2 1/22/15
Advertisements

1 Combinational Logic Network design Chapter 4 (continued ….)
Gate-level Minimization
بهينه سازي با روش Quine-McCluskey
Chapter 3 Simplification of Switching Functions
CS 140 Lecture 6 Professor CK Cheng Tuesday 10/15/02.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
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.
CS 140 Lecture 6 Professor CK Cheng UC San Diego.
Computer Engineering (Logic Circuits) (Karnaugh Map)
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.
Simplifying Boolean Expressions Using K-Map Method
Two Level Logic Optimization. Two-Level Logic Minimization PLA Implementation Ex: F 0 = A + B’C’ F 1 = AC’ + AB F 2 = B’C’ + AB product term AB, AC’,
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.
Two-Level Simplification Approaches Algebraic Simplification: - algorithm/systematic procedure is not always possible - No method for knowing when the.
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).
Two Level Networks. Two-Level Networks Slide 2 SOPs A function has, in general many SOPs Functions can be simplified using Boolean algebra Compare the.
Unit 5 Karnaugh Maps Fundamentals of Logic Design by Roth and Kinney.
Copyright © 2004 by Miguel A. Marin Revised McGILL UNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING COURSE ECSE DIGITAL SYSTEMS.
Converting to Minterms Form
Simplification of incompletely specified functions using QM Tech.
CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 Topic 5: Quine-McCluskey Method José Nelson Amaral.
1 Quine-McCluskey Method. 2 Motivation Karnaugh maps are very effective for the minimization of expressions with up to 5 or 6 inputs. However they are.
Computer Engineering (Logic Circuits) (Karnaugh Map)
Chapter3: Gate-Level Minimization Part 1 Origionally By Reham S. Al-Majed Imam Muhammad Bin Saud University.
CS2100 Computer Organisation
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:
1 Example: Groupings on 3-Variable K-Maps BC F(A,B,C) = A ’ B ’ A BC F(A,B,C) = B ’ A
Key Observation Adjacencies in the K-Map
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
EECS 270 Lecture 10. K-map “rules” – Only circle adjacent cells (remember edges are adjacent!) – Only circle groups that are powers of 2 (1, 2,
State university of New York at New Paltz Electrical and Computer Engineering Department Logic Synthesis Optimization Lect10: Two-level Logic Minimization.
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
©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
De Morgan’s Theorem,.
Computer Organisation
Lecture #6 EGR 277 – Digital Logic
QUINE-McCLUSKEY METHOD
Plotting functions not in canonical form
CS 352 Introduction to Logic Design
CSCE 211: Digital Logic Design
ECE 331 – Digital System Design
Digital Logic and Design
Chapter 6 Quine-McCluskey Method
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
ECE 331 – Digital System Design
Digital Logic & Design Dr. Waseem Ikram Lecture 12.
Digital Logic & Design Dr. Waseem Ikram Lecture 13.
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
ECE 331 – Digital System Design
Function Minimization Algorithms
Representing Boolean Functions
CSCE 211: Digital Logic Design
COE 202: Digital Logic Design Combinational Logic Part 3
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
CHAPTER 6 QUINE-McCLUSKEY METHOD
CSCE 211: Digital Logic Design
ECE 331 – Digital System Design
Presentation transcript:

Chapter 6 Quine-McCluskey Method Mei Yang ECG Logic Design 1

2 Quine-McCluskey Method The Q-K method reduces the minterm expansion of a function to obtain a minimum SOP in two main steps: – Eliminate as many literals as possible from each term by systematically applying XY+XY’=X. The resulting terms are called prime implicants. – Use a prime implicant chart to select the minimum set of prime implicants which, when ORed together, are equal to the function being simplified and which contain a minimum number of literals.

3 Determination of Prime Implicants Use XY+XY’=X, where X represents a product of literals and Y is a single variable Two minterms will combine if they differ in exactly one variable – Example AB’CD’+AB’CD=AB’C =101- To find all the prime implicants, all possible pairs of minterms should be compared and combined whenever possible

4 Example f(a, b, c, d)=∑ m (0, 1, 2, 5, 6, 7, 8, 9, 10, 14) is represented by the following minterms group group group group

5 Comparison of terms in nonadjacent groups is unnecessary because such terms will always differ in at least two variables Comparison of terms within a group is unnecessary because two terms with the same number of 1’s must differ in at least two variables Thus, only terms in adajcent groups must be compared

6 Table 6-1

f=a’c’d + a’bd + a’bc + b’c’ + b’d’ + cd’ using consensus theorem to eliminate redundant terms yields the minimum SOP f=a’bd + b’c’ + cd’

8 Definitions Given a function F of n variables, a product term P is an implicant of F iff for every combination of values of n variables for which P=1, F is also equal to 1 Example: F(a, b, c) = a’b’c’ + ab’c’ + ab’c + abc = b’c’ + ac a’b’c’, ac, etc. are implicants of F. If F is written in SOP form, every product term is an implicant.

9 Definitions An prime implicant of a function F is a product term implicant which is no longer an implicant if any literal is deleted from it. A minimum SoP expression for a function consists of a sum of some (but not necessarily all) of the prime implicants of that function.

The Prime Implicant Chart The minterms of a function are listed across the top of the chart, and the prime implicants are listed down the side If a prime implicant covers a given minterm, a X is placed at the intersection of the corresponding row and column 10

11 The Prime Implicant Chart A minterm is covered by only one prime implicant, then that prime implicant is called an essential prime implicant and must be included in the minimum SOP. Example: in Table 6-2, b’c’ and cd’ are essential

The Prime Implicant Chart Each time a prime implicant is selected for inclusion in the minimum SOP, the corresponding row (the minterms covered) should be crossed out and the columns which correspond to all minterms covered by that prime implicant should also be crossed out. A minimum set of prime implicants must now be chosen to cover the remaining columns.

13 Table 6-3 The resulting minimum SOP f=b’c’ + cd’ + a’bd

14 Cyclic Prime Implicant Chart A prime implicant chart which has two or more X’s in every column is called cyclic prime implicant chart Example: F=∑ m (0, 1, 2, 5, 6, 7) 1. Derivation of prime implicants

15 2. Selection of prime implicants from the prime implicant chart solution 1: F=a’b’ + bc’ + ac solution 2: F=a’c’ + b’c + ab