References: Unit 6 — Quine-McCluskey Method

  1. Quine–McCluskey algorithm — Wikipedia — Comprehensive coverage of the QM algorithm including tabular method, prime implicant identification, and minimum cover selection. Essential reference for systematic Boolean minimization.
  2. Petrick's method — Wikipedia — Detailed explanation of Petrick's method for finding all minimum covers when cyclic prime implicant charts occur. Critical for handling cases where essential prime implicants don't cover all minterms.
  3. Boolean satisfiability problem — Wikipedia — Overview of computational complexity in Boolean optimization, providing context for why QM has exponential worst-case complexity and motivating heuristic approaches.
  4. Digital Design (6th Edition) — M. Morris Mano, Michael D. Ciletti — Pearson — Chapter 4 includes QM coverage with step-by-step examples of the tabular method and prime implicant chart construction.
  5. Switching and Finite Automata Theory (3rd Edition) — Zvi Kohavi, Niraj K. Jha — Cambridge University Press — Chapter 4 provides rigorous treatment of QM algorithm with proofs of optimality and complexity analysis.
  6. Quine-McCluskey Tutorial — All About Circuits — Step-by-step walkthrough of the QM algorithm with worked examples showing grouping, combination, and prime implicant selection.
  7. QM Method Examples — GeeksforGeeks — Multiple worked examples of QM algorithm including don't care handling and prime implicant chart construction with detailed explanations.
  8. Prime Implicant Charts — TutorialsPoint — Tutorial covering prime implicant chart construction, essential PI identification, and row/column dominance techniques for chart reduction.
  9. QM vs K-map Comparison — ElProCus — Practical comparison of K-maps and QM method discussing when to use each approach based on number of variables and automation requirements.
  10. Boolean Expression Minimizer — University of Marburg — Online QM algorithm implementation that shows all intermediate steps, useful for verifying manual calculations and understanding the algorithm's progression.