QuineMcCluskey Method - PowerPoint PPT Presentation

1 / 18
About This Presentation
Title:

QuineMcCluskey Method

Description:

A group of adjacent 1's that is not contained within any larger ... Karim-Johnson, p. 59. 12/17/09. 331_07. 8. Step 1a: Implicant Table. Minterms. Size. 15. 4 ... – PowerPoint PPT presentation

Number of Views:27
Avg rating:3.0/5.0
Slides: 19
Provided by: bass2
Category:

less

Transcript and Presenter's Notes

Title: QuineMcCluskey Method


1
Quine-McCluskey Method
  • ECE-331, Digital Design
  • Dr. Ron Hayne
  • Electrical and Computer Engineering

2
Quine-McCluskey Minimization
  • wrt to minimization, K-maps Only good for
  • Small functions (lt5variables)
  • Single output function at a time
  • Not Implementable on Computer
  • Subjective Interpretation, Different Coverings
  • Q-M (Tabular Minimization) Solves These Problems

3
Basic Definitions
  • Prime Implicant
  • A group of adjacent 1s that is not contained
    within any larger implicant
  • Essential Prime Implicant
  • A prime implicant which includes a minterm that
    is covered by only one Prime Implicant

4
Basic Definitions
  • Complete Sum
  • A representation of a function by the sum of ALL
    possible prime implicants
  • Not necessarily irredundant
  • Irredundant Sum
  • The representation of a function by A sum of PIs
    such that the removal of any one of the PIs
    changes the value of the function for some
    combination of input values

5
Basic Definitions
  • Cost Function
  • A measure of the effort or hardware associated
    with the implementation of something or the
    accomplishment of a task
  • Digital Design Cost Functions
  • Number of terms
  • Number of occurrences of a literal (not the
    number of distinct literals).

6
Quine-McCluskey Method
  • Construct the Implicant Table
  • Group minterms by number of 1s
  • Apply Adjacency Theorem to pairs of implicants
  • Mark all implicants that are used in larger groups

7
Q-M Example

Karim-Johnson, p. 59
8
Step 1a Implicant Table
9
Step 1b,c Adjacency Theorem
10
Step 1b,c Adjacency Theorem
11
Step 1b,c Adjacency Theorem
12
Quine-McCluskey Method
  • Construct the Covering Table
  • Prime Implicants and Minterms
  • Mark rows and columns
  • Identify Essential Prime Implicants
  • Construct the Reduced Covering Table
  • Secondary Prime Implicants
  • Mark rows and columns
  • Minimum cover for remaining minterms
  • Simplified Logic Expression

13
Step 2a Covering Table
14
Step 2b Covering Table
15
2c Essential Prime Implicants
16
Step 2c Covering Table
17
3a,b Reduced Covering Table
18
3c Reduced Covering Table
19
4 Simplified Logic Expression
20
Summary
  • Q-M
  • Implicant Table
  • Covering Table
  • Essential Prime Implicants
  • Simplified Logic Expression
Write a Comment
User Comments (0)
About PowerShow.com