• Wrong document? Swap it for free
  • Written by students who passed
  • Immediately available after payment
  • Read online or as PDF
Sell
Where do you study
Your language
Document preview thumbnail
Preview 4 out of 52 pages
Presentation

Algorithmic Logic Minimization: The Quine-McCluskey Method

Document preview thumbnail
Preview 4 out of 52 pages

This lecture document covers Chapter 6 of the course, detailing the Quine-McCluskey tabular algorithm for exact Boolean function minimization, which is suitable for automated software implementation. The chapter covers Tabular Grouping & Merging, including expressing functions in canonical minterm notation, grouping binary terms by Hamming weight, and iteratively comparing and merging adjacent weight groups to find all Prime Implicants. It covers Prime Implicant Table Construction, including creating coverage tables that map prime implicants against required minterms to identify Essential Prime Implicants. It covers Table Reduction Techniques, including systematic reduction rules using row dominance to remove redundant prime implicants based on cost, and column dominance to remove duplicate or enclosing minterm columns. It covers Petrick's Method, an algebraic product-of-sums approach used to solve cyclic prime implicant tables when row and column dominance cannot further reduce the table. It covers Handling Don't Cares, including incorporating don't care conditions into the initial merging steps to maximize term reduction while excluding them from the coverage table columns to avoid unnecessary coverage constraints.

Content preview

ELE1300
Circuits
logiques
6. Méthode de
Quine-McCluskey

,Sommaire du cours

• Être capable de:
• Trouver la meilleure couverture des impliquants
• Méthode graphique
• Méthode algébrique (Petrick)
• Utiliser la méthode de Quine-McCluskey pour trouver
l’implémentation optimale en SdP
• Recherche des impliquants premiers




ELE1300 - Circuits logiques 2

,À quoi ça sert ?
• Procédure systématique garantissant une simplification maximale de
la fonction logique selon une formulation disjonctive (somme de
produits) ou conjonctive (produit de sommes).




ELE1300 - Circuits logiques 3

, 1ère étape : forme canonique
A B C D S

0 0 0 0 0
0 0 0 1 0
0 0 1 0 1
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 1 S  ABC D  ABC D  ABCD
0 1 1 1 1
1 0 0 0 0
 ABC D  ABCD  A BCD  ABCD
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 0


ELE1300 - Circuits logiques 4

Document information

Uploaded on
October 8, 2026
Number of pages
52
Written in
2026/2027
Type
Presentation
Person
Unknown
CA$8.96

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Sold
0
Followers
0
Items
6
Last sold
-



Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions