F(A,B,C,D) = Σm(0,2,8,10) — Karnaugh map

corefour-corner wrap group

Answer

B′ · D′

Why this example is worth doing

The four corners of the map, which are all adjacent to each other because the map is a torus: the left edge wraps to the right and the top to the bottom. They form one legal quad giving B̄·D̄. This is the grouping students miss most often, because on paper the corners look maximally far apart. The tool draws the group as four segments of one rectangle rather than four separate boxes, so the wrap is visible, and the grading rule accepts the selection as a single group rather than four singletons.

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
1B′ · D′
Minimum cover — Quine–McCluskey
#Cover
1B′ · D′
Warning:

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

Truth table

Truth table — columns #, A, B, C, D, F
#ABCDF
000001
100010
200101
300110
401000
501010
601100
701110
810001
910010
1010101
1110110
1211000
1311010
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)