E21 Digital Logic Design Lecture #3

Vocabulary for Minimization

5 and 6 Variable Karnaugh Maps

Tabular Methods for Minimization: Quine-McClusky

  1. Find all of the size 1-subcubes (minterms in the function)
  2. Let n = 1
  3. Group minterms according to how many 1's they have
  4. Compare minterms in adjacent groups to form (n+1)-subcubes
  5. If you can form no (n+1)-subcubes, break out of the loop
  6. Label the level n minterms as to whether they are covered by an (n+1)-subcube
  7. Increment n and loop back to step 3
  8. The minterms that are not covered form the set of prime implicants for this function

Minimal Cover Generation

Technology Mapping

Term Decomposition

Decomposition and Timing Optimization Example