F(A,B,C,D) = Σm(4,5,6,7,8,9,10,11) — Karnaugh map

coretwo octets, 2 terms

Answer

A′ · B + A · B′

Why this example is worth doing

Two blocks of eight that each reduce to a two-literal term, and a good demonstration that groups may overlap in principle but need not. The interesting property is that the function is A ⊕ B — the expression Ā·B + A·B̄ is exactly the XOR of the two most significant variables, and C and D are irrelevant. The converter bar therefore offers a one-gate diagram for a function whose map has eight 1s in it, which is the clearest argument on the site for looking at more than one representation.

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, C, D, F
#ABCDF
000000
100010
200100
300110
401001
501011
601101
701111
810001
910011
1010101
1110111
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)