Intuition The one core ideaA digital circuit is just a machine that reads some on/off switches and lights up (outputs 1) for certain switch-combinations. The whole Quine–McCluskey method is one trick repeated: whenever two "recipes" for turning the light on are identical except for one switch , that switch didn't matter — so throw it away and keep the shorter recipe.
Before you touch the parent method , you need every symbol it silently assumes. This page builds them from nothing, in the order they depend on each other.
Definition Boolean variableA variable like A B C D two values: 0 1
Think of a light switch on a wall. It is either down (0) or up (1) . A A = 1
Everything in this chapter is built from switches. We need variables because a real chip has physical input pins, and each pin is exactly one such switch. See the row of switches in the figure.
A ˉ reverse position of A A A ˉ
Two operations glue switches together. They look like arithmetic but are not .
Definition AND (the dot, or just juxtaposition)A ⋅ B A B 1 only when BOTH A = 1 and B = 1
+ A + B 1 AT LEAST ONE of A B 1 0
Intuition The picture — wiring switches
AND = two switches in a row (series). Current only reaches the bulb if you pass through both .OR = two switches side by side (parallel). Current reaches the bulb if either path is open.
Look at the two circuits in the figure — series lights up only when both are up; parallel lights up when either is up.
+ 1 + 1 = 2 Why it feels right: it's the same symbol as normal addition.
The bug: here + OR . 1 + 1 = 1 Fix: whenever you see + OR ", never "plus".
Now re-read the rule from Section 2:
A + A ˉ = 1 OR A-bar is up." One of the mirror-image switches is always up, so the OR is always 1
Everything above exists so this one line makes sense. The parent note calls it the whole engine .
Intuition Why it is true — read it, don't memorise itFactor out the common A A B + A B ˉ = A ( B + B ˉ ) = A ( 1 ) = A . B + B ˉ 1 A ⋅ 1 = A A
Two recipes — "A and B A and not-B whenever A B . So B irrelevant . We erase it and keep only A - (dash) you will meet in the tables.
This is why the parent hunts for terms "differing in exactly one bit": that one bit is the B
A row like 0101 in a fixed order — here A = 0 , B = 1 , C = 0 , D = 1 position tells you which variable, the digit tells you its value.
Intuition Decoding a pattern → a termWalk the string left to right. For each position:
digit 1 plain variable (A
digit 0 bar (A ˉ
a dash - ⇒ write nothing (that switch was erased by the combining theorem)
So 0101 ⇒ A ˉ B C ˉ D 01 - 1 ⇒ A ˉ B D C
Definition "Number of 1s" (population count)Just count how many positions hold a 1 0101 two 1s; 1110 three . The parent groups minterms by this count.
Intuition Why grouping by 1-count mattersTo combine, two patterns must differ in exactly one position. Flipping one 0 → 1 always changes the 1-count by exactly one. So a valid partner must live in the neighbouring group — never in the same group, never two groups away. Grouping this way means you only ever compare adjacent piles, saving a mountain of pointless comparisons. This is SOP -friendly bookkeeping done by hand.
A minterm is a product (AND) using every variable exactly once, plain or barred. For n 2 n truth table . Each minterm is "on" for exactly one switch-combination.
∑ m f ( A , B , C , D ) = ∑ m ( 0 , 1 , 2 , … ) f 1 0 , 1 , 2 , … 010 1 2 = 5 5 1 0101
Definition Implicant / prime implicant (preview)An implicant is any product term (a partial recipe, some switches maybe erased) that forces f = 1 prime implicant is one you can't shrink any further — no more switches can be erased. These are the survivors of the combining process, the goal of the whole method. Deeper detail lives in Prime Implicants and Petrick's Method .
This is the same idea as Karnaugh Maps (visual grouping) and feeds straight into Logic Gate Minimization — QM is just K-maps done as a table so a computer can do it.
Complement A-bar and rule A OR notA = 1
Combining theorem AB + A notB = A
Binary strings and number of 1s
Minterms and sum m notation
Erase a switch dash notation
Cover the right side and test yourself. If any answer is fuzzy, re-read that section before the parent note.
What are the only two values a Boolean variable can hold? 0 1
What does A ˉ A = 0 The opposite of A A = 0 A ˉ = 1
State the rule that makes the whole method work. A + A ˉ = 1
In Boolean algebra, what is 1 + 1 1
Picture-wise, what is AND vs OR? AND = switches in series (both needed); OR = switches in parallel (either works).
Why does A B + A B ˉ = A Factor A A ( B + B ˉ ) = A ⋅ 1 = A B
Decode the pattern 01 - 1 A B C D A ˉ B D C
What does a dash - in a pattern represent? A switch that got erased by the combining theorem — irrelevant to the term.
Why group minterms by their number of 1s? A one-bit-different partner must differ in 1-count by exactly one, so it sits in the adjacent group only.
What does minterm number 5 A B C D 0101 A ˉ B C ˉ D
What does ∑ m ( 0 , 1 , 2 ) f 1
