F = A·B·C·D + Ā·B̄·C̄·D̄ — SOP and POS

exam standard2 minterms, 14 maxterms

Answer

Σm(0,15) = ΠM(1,2,3,4,5,6,7,8,9,10,11,12,13,14)

Why this example is worth doing

Two minterms over four variables, so the canonical POS has fourteen factors — a lopsidedness that is itself the lesson. The canonical form's size depends on how many rows the function is true on, not on how complicated it looks, and a function with a two-term SOP can have a fourteen-term POS. The page uses it to justify the practical rule of thumb: expand toward whichever canonical form has fewer terms, and get the other by complementing the index set.

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′ · D′ + A · B · C · D

Canonical product of sums

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

Truth table

Truth table — columns #, A, B, C, D, F
#ABCDF
000001
100010
200100
300110
401000
501010
601100
701110
810000
910010
1010100
1110110
1211000
1311010
1411100
1511111

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)