Saturday, 11 February 2012

Quine - McClusky (Tabular) method

  • It is a systematic method, so it can be implemented on a computer
  • It can be used to handle large number of variables.
Process:
  • Represent all min terms in binary representation and group them according to index. Index means no. of min terms in binary representation.
  • Identify adjacent min terms in neighboring groups and list them in a separate column and indicate differing bit position by ‘-‘ (adjacent min terms differ in one bit position). Check off the min terms that are covered. Repeat the same procedure until no further implicants can be covered.  All non check off terms are prime implicants.
  • Construct PI (prime implicant) chart, with min terms along horizontal row and PI’s along vertical column, with ‘x’ entry placed when a PI covers a min term.
  • Select minimum number of PIs that cover all min terms.
Ex: minimize f= ∑ (3, 4, 5, 6, 7, 11, 12, 13, 15)
PI Chart:

Back                                             Contents                                          Next

No comments:

Post a Comment