F(A,B,C) = Σm(0,1,2,4) — SOP and POS

coreF and F′ as index sets

Answer

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

Why this example is worth doing

Four minterms chosen so that the complement is also four minterms, which makes the index arithmetic easy to check: the ON-set of F′ is the complement of the ON-set of F within 0..2^n−1, and the maxterm list of F is the minterm list of F′. Three statements of one fact. The page lays them out as a single table with a column per representation, and this is the example the converter bar uses to demonstrate carrying an index list across to the K-map and the truth table.

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
00001
10011
20101
30110
41001
51010
61100
71110

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)