F(A,B,C,D) = Σm(0,1,4,5,8,9,12,13) — Karnaugh map

coreone 8-cell group; answer is a single literal

Answer

C′

Why this example is worth doing

Eight 1s forming two full columns of the 4-variable map, which combine into one octet and reduce to the single literal C̄. The lesson is how to read a group's product term: a variable appears only if it holds the same value across every cell of the group, and here only C does. Students routinely under-group this, circling two quads and writing a two-term answer that is correct but not minimal. The tool marks that cover valid, complete and non-minimal, which is three separate judgements.

Try your own input in the Karnaugh map solver. Group a 2- to 6-variable map yourself and have every group marked right or wrong.

How the answer is reached

Quine–McCluskey

Prime implicants — Quine–McCluskey
#Term
1C′
Minimum cover — Quine–McCluskey
#Cover
1C′
Warning:

1 term(s), 1 literal(s); 1 essential prime implicant(s).

Truth table

Truth table — columns #, A, B, C, D, F
#ABCDF
000001
100011
200100
300110
401001
501011
601100
701110
810001
910011
1010100
1110110
1211001
1311011
1411100
1511110

Compare with

Open this example in the Karnaugh map 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

  • Karnaugh, “The Map Method for Synthesis of Combinational Logic Circuits” (1953)
  • Veitch, “A Chart Method for Simplifying Truth Functions” (1952)