Notes
Slide Show
Outline
1
The Quine-McCluskey
(or Tabular) Method
  • The Quine-McCluskey, or Tabular, method is an algorithmic method that finds prime implicants, necessary prime implicants, and minimum sum-of-products expressions for digital systems with any number of variables
  • The Quine-McCluskey method can be implemented as a computer program
2
Steps in the Tabular method
  • 1)  Represent the minterms and the don’t cares by the values of the input variables
    • --  For example, in a 5-variable system minterm 7 would be represented by 00111
  • Arrange the minterms and don’t cares in groups according to the number of 1’s
  • -- Group with no 1’s
  •   -- Group with a single “1”
  •     -- Group with two “1”s
  • -- …



3
Steps in the Tabular method
  • Compare each member of a group to each member of the adjacent group
    • --  If two terms differ in a single position, then record the reduced expression and mark the two items as having been used
    • For example
4
Continue this process
  • As you compare minterms and don’t cares, keep the reduced expressions in groups
  • For example
  • Group from combining no “1”s with a single “1”
  • --------------------------------
  • Group from combining a single “1” with two “1”s
  • --------------------------------
  • Group from combining two “1”s with three “1”s
  • …
5
Combine groups of two
  • 5) Check each group of two expression against each expression in the adjacent group
  • Comparison is easier at this step and subsequent steps, because simplification is only possible if the groups of two have eliminated the same variable
6
Continue
  • Continue comparing group to adjacent group and separating the simpler expressions that result  until no more simplifications can be achieved.
  • This is the set of prime implicants
  • Make a chart of which minterms are in which prime implicants
    • The prime implicants define the rows
    • The minterms define the columns
    • The don’t cares are excluded at this point
7
An example
8
An example
9
The prime implicants
10
Table of Choice
11
Row Information in the Table of Choice
12
Row Information in the Table of Choice
13
Column Information in the Table of Choice
14
Necessary Prime Implicants from the Table of Choice
15
Necessary Prime Implicants from the Table of Choice
16
Necessary Prime Implicants from the Table of Choice
17
A Reduced Table of Choice
18
All minterms covered
  • If all minterms are not covered after the removal of dominated rows and choice of prime implicants that are the only way to cover the remaining minterms, then
    • Either chose a set to complete the expression by inspection, or
    • Apply the Petrick algorithm, a structured method for making the choice
19
Petrick Algorithm