F(A,B,C) = Σm(0,1,2,5,6,7) — Karnaugh map

introcyclic chart, no essential prime implicants; 2 minimal covers

Answer

A′ · B′ + B · C′ + A · C | A′ · C′ + B′ · C + A · B

Note:

2 equally minimal forms exist, all of the same cost: A′ · B′ + B · C′ + A · C | A′ · C′ + B′ · C + A · B.

Why this example is worth doing

The best three-variable map in the syllabus, because it has no essential prime implicants at all. Every one of its six 1s can be covered two different ways, and the two minimal answers cost exactly the same: three terms of two literals each. A student who groups it correctly and gets a different expression from the back of the book has not made a mistake, and this page says so in as many words. It is also the standard demonstration case for Petrick's method on the Quine–McCluskey page.

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

3 term(s), 6 literal(s); 0 essential prime implicant(s).

Truth table

Truth table — columns #, A, B, C, F
#ABCF
00001
10011
20101
30110
41000
51011
61101
71111

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)