F(A,B) = Σm(1,2) — Karnaugh map

core2-variable map; no groups possible

Answer

A′ · B + A · B′

Why this example is worth doing

The smallest map the tool draws, and the case where nothing groups: two isolated 1s on a diagonal. The answer is the canonical sum, and that is the correct answer rather than a failure. It is worth having explicitly because two-variable K-maps are a real exam question and most solvers start at three. The function is A ⊕ B, so it is also the shortest possible illustration of why XOR is invisible to sum-of-products minimisation — a theme the 3-variable and 4-variable XOR examples develop.

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

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

Truth table

Truth table — columns #, A, B, F
#ABF
0000
1011
2101
3110

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)