F(A,B,C,D) = Σm(0,5,7,8,9,10,11,14,15) — Quine–McCluskey

core5 prime implicants, 4 essential

Answer

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

Why this example is worth doing

Minterm 0 has no adjacent 1 anywhere on the map, so it never combines with anything and survives the tabulation as a full four-literal prime implicant. It is trivially essential, being the only thing that covers its own column. The page uses it to make the point that the tabulation is exhaustive rather than greedy: an isolated minterm is not a sign of an error in the working, and a minimal expression can legitimately contain a term with every variable in it.

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 · D
3B · C · D
4A · B′
5A · C
Minimum cover — Quine–McCluskey
#Cover
1B′ · C′ · D′ + A′ · B · D + A · B′ + A · C
Warning:

4 term(s), 10 literal(s); 4 essential prime implicant(s).

Truth table

Truth table — columns #, A, B, C, D, F
#ABCDF
000001
100010
200100
300110
401000
501011
601100
701111
810001
910011
1010101
1110111
1211000
1311010
1411101
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)