F(A,B,C,D) = Σm(4,8,10,11,12,15) + d(9,14) — Quine–McCluskey

core4 prime implicants, 2 essential, 2 minimal covers

Answer

B · C′ · D′ + A · B′ + A · C | B · C′ · D′ + A · D′ + A · C

Note:

2 equally minimal forms exist, all of the same cost: B · C′ · D′ + A · B′ + A · C | B · C′ · D′ + A · D′ + A · C.

Why this example is worth doing

Don't-cares behave asymmetrically in Quine–McCluskey and this is the example that shows it. They take part in the combining rounds, so they can enlarge implicants exactly as they enlarge K-map groups — but they get no column in the prime-implicant chart, because nothing obliges you to cover them. The consequence is a rule with teeth: a prime implicant covering only don't-cares must be dropped before the chart is built. Leaving it in yields covers that are not minimal, and that is the known defect in several popular library implementations.

Try your own input in the Quine–McCluskey solver. Minimise past the K-map limit with the full tabular method and Petrick’s step.

How the answer is reached

Quine–McCluskey

Prime implicants — Quine–McCluskey
#Term
1B · C′ · D′
2A · B′
3A · D′
4A · C
Every minimum cover — Quine–McCluskey
#Cover
1B · C′ · D′ + A · B′ + A · C
2B · C′ · D′ + A · D′ + A · C
Warning:

3 term(s), 7 literal(s); 2 essential prime implicant(s).

Truth table

Truth table — columns #, A, B, C, D, F
#ABCDF
000000
100010
200100
300110
401001
501010
601100
701110
810001
91001X
1010101
1110111
1211001
1311010
141110X
1511111

Compare with

Open this example in the Quine–McCluskey solver

The field arrives filled in with this example’s input.

Note:

Notation this page assumes

  • Symbols: · is AND, + is OR, ⊕ is XOR, a prime or an overline is NOT. The field also takes ∧ ∨ ¬ ~ ! & | and the words.
  • Operator precedence, tightest first: NOT, then AND (including juxtaposition), then XOR/XNOR, then NAND/NOR, then OR, then IMPLIES, then IFF.
  • In a minterm index the first variable is the most significant bit, so over [A, B, C] minterm 5 is A·B̄·C.

Sources

  • Quine, “The Problem of Simplifying Truth Functions” (1952)
  • McCluskey, “Minimization of Boolean Functions” (1956)
  • Petrick, “A Direct Determination of the Irredundant Forms” (1956)