F(A,B,C) = Σm(1,3,5,7) — SOP and POS

introΣm and ΠM of the same function

Answer

Σm(1,3,5,7) = ΠM(0,2,4,6)

Why this example is worth doing

Odd minterms only, which is the set where C is 1, so the function is just C. The page uses it to nail the index convention that everything else depends on: A is the most significant bit, so minterm 5 is A=1, B=0, C=1 and reads A·B̄·C. Maxterm 5 over the same variables is (Ā + B + C̄) — the bits invert. Getting that inversion wrong is the single most common error in POS work, and it is silent, because the result still looks like a plausible expression.

Try your own input in the SOP & POS canonical forms. Expand to canonical minterms and maxterms, and convert between the two.

How the answer is reached

Canonical sum of products

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

Canonical product of sums

(A + B + C) · (A + B′ + C) · (A′ + B + C) · (A′ + B′ + C)

Truth table

Truth table — columns #, A, B, C, F
#ABCF
00000
10011
20100
30111
41000
51011
61100
71111

Compare with

Open this example in the SOP & POS canonical forms

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

  • Shannon, “A Symbolic Analysis of Relay and Switching Circuits” (1938)
  • McCluskey, “Minimization of Boolean Functions” (1956)