Information Technology is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

SOP and POS forms

How to write, convert and simplify Boolean functions using Sum‑of‑Products (SOP) and Product‑of‑Sums (POS) canonical and standard forms, with laws and exam-style examples.

Drafted with Aria, reviewed by the AiCanCode.org team · Updated . How we write and check our notes. Spotted an error? Use Give Feedback at the bottom of the page.

Why it matters

Engineers use Sum‑of‑Products (SOP) and Product‑of‑Sums (POS) forms to represent, simplify and implement logical functions in hardware (gates, PLA/PLD, or as part of ALU and control logic). Canonical SOP/POS are direct from truth tables (useful for analysis); simplified SOP/POS give smaller gate implementations (useful for cost, speed and power). These forms connect design steps such as truth table → Boolean expression → Karnaugh map → minimized expression → gate network.

Key ideas

Start with definitions (each bolded on first use):

  • Boolean function: a function F that maps binary inputs (0 or 1) to a binary output (0 or 1).
  • Literal: a variable or its complement (for variable A, literals are A and A').
  • Product (logical AND): operation of literals using AND; written as concatenation or ·.
  • Sum (logical OR): operation of terms using OR; written as +.
  • Minterm: a product (AND) term in which every variable of the function appears exactly once, uncomplemented if the variable value is 1 and complemented if 0. For n variables there are 2^n minterms. Example for 3 variables: m0 = A'B'C', m1 = A'B'C, … m7 = ABC.
  • Maxterm: a sum (OR) term in which every variable appears exactly once, uncomplemented if the variable value is 0 and complemented if 1. For 3 variables example: M0 = A + B + C, M1 = A + B + C', … M7 = A' + B' + C'. (Carefully label by truth table row index.)
  • Canonical SOP (sum of minterms): F = sum (OR) of minterms corresponding to rows where F = 1. This is unique for a truth table.
  • Canonical POS (product of maxterms): F = product (AND) of maxterms corresponding to rows where F = 0. Also unique for a truth table.
  • Standard SOP: sum of product terms that may not include all variables in each product (so not canonical) but each product term is a product of literals.
  • Standard POS: product of sum terms each of which is a sum of literals; again not necessarily canonical.
  • Implicant: a product term that implies the function (i.e., whenever the product is 1, F is 1). A minterm is an implicant; simplified implicants drop literals to cover multiple minterms.
  • Prime implicant: an implicant that cannot be covered by a more general implicant (i.e., cannot drop any literal without losing coverage).
  • Essential prime implicant: a prime implicant that covers a minterm not covered by any other prime implicant.

Basic Boolean laws and theorems you must state exactly (assume variables binary 0/1 and complement is logical NOT):

  • Identity laws: A + 0 = A, A · 1 = A.
  • Null laws: A + 1 = 1, A · 0 = 0.
  • Idempotent laws: A + A = A, A · A = A.
  • Complement laws: A + A' = 1, A · A' = 0.
  • Commutative: A + B = B + A, A · B = B · A.
  • Associative: (A + B) + C = A + (B + C), (A · B) · C = A · (B · C).
  • Distributive: A · (B + C) = A·B + A·C and A + (B·C) = (A + B)·(A + C).
  • Absorption: A + A·B = A, A·(A + B) = A.
  • Consensus (useful in simplification): A·B + A'·C + B·C = A·B + A'·C (the term B·C is redundant).
  • De Morgan's theorems: (A·B)' = A' + B', (A + B)' = A'·B'.

How to derive canonical forms from a truth table (step-by-step — universities ask for this):

  1. Label rows of truth table from 0 to 2^n−1 in binary (A is most significant bit if convention specified).
  2. For every row where F = 1, write the corresponding minterm: use variable if bit = 1, complemented if bit = 0. Sum (OR) all such minterms → canonical SOP.
  3. For canonical POS, for every row where F = 0, write the corresponding maxterm: use variable uncomplemented if bit = 0, complemented if bit = 1; product (AND) all such maxterms.

What to draw in diagrams (describe exactly):

  • Truth table: columns for input variables (A, B, C, ...), a column for decimal row index, and a column for F. Fill rows 0..2^n−1.
  • Minterm labeling: add a column for minterm number m_i beside each row.
  • Canonical SOP diagram: show arrow from rows with F=1 to a sum block that ORs the minterm products.
  • For Karnaugh map: draw a grid with 2^{ceil(n/2)} by 2^{floor(n/2)} cells (for 3 variables 2x4), label rows/columns in Gray code, place 1s for function=1; group 1s in powers of two to find prime implicants. If don't‑care conditions (X) exist, include them in groups to maximize group sizes, but do not list them in canonical SOP/POS.

Assumptions: variables are independent, binary, and complements are well defined; row indexing convention should be stated (MSB left). When converting expressions to hardware, assume gates implement AND, OR, NOT unless otherwise specified.

Formulas

F = Σ m(i) where Σ m(i) means logical OR of minterms m(i) for which F=1. (Σ denotes sum of minterms; each m(i) is a product of n literals.)

Explanation: F is the canonical SOP formed by ORing minterms; no SI unit; applies for any Boolean function with n variables.

F = Π M(j) where Π M(j) means logical AND of maxterms M(j) for which F=0. (Π denotes product of maxterms; each M(j) is a sum of n literals.)

Explanation: F is the canonical POS formed by ANDing maxterms; applies for any Boolean function with n variables.

(A·B)' = A' + B' — De Morgan; applies to any two (or more) variables; extend to more terms: (A·B·C)' = A' + B' + C'.

(A + B)' = A'·B' — De Morgan for OR.

A + A·B = A — Absorption.

A·(A + B) = A — Absorption.

A + A' = 1, A·A' = 0 — Complement laws.

A·(B + C) = A·B + A·C — Distributive law.

(Each symbol: A, B, C are Boolean variables taking values 0 or 1; · is logical AND; + is logical OR; ' is logical NOT or complement.)

Worked examples

Example 1 — Canonical SOP and simplified SOP (3 variables)

Problem: Given the truth table (A B C → F) with F = 1 for rows 1, 3, 4 and 7 (decimal indices), write canonical SOP, then simplify.

Step 1 — list minterms: rows are numbered with ABC as bits (A MSB):

  • row 1: 001 → m1 = A'·B'·C
  • row 3: 011 → m3 = A'·B·C
  • row 4: 100 → m4 = A·B'·C'
  • row 7: 111 → m7 = A·B·C

Step 2 — canonical SOP: F = m1 + m3 + m4 + m7 → substitute F = A'·B'·C + A'·B·C + A·B'·C' + A·B·C

Step 3 — simplify using algebra (group terms): Group m1 and m3: A'·C·(B' + B) = A'·C·1 = A'·C. Group m4 and m7: A·C'·B' + A·B·C = A·(B'·C' + B·C) — try to factor differently: combine m7 with m3? Another path: pair m1 with m7 on C? Better use Karnaugh map (describe): draw 2x4 K‑map (rows A=0/1, columns BC in Gray code 00,01,11,10). Place 1s at indices 1,3,4,7 and find groups.

K‑map grouping result: a valid grouping yields prime implicants A'·C (covers 1 and 3) and B·C (covers 3 and 7); A·C is not a valid implicant here, and index 4 (100) cannot be grouped with any other 1. Try other pairings: m3 + m7 = B·C·(A' + A) = B·C. That is valid: A'·B·C + A·B·C = B·C. So combine m3 and m7 into B·C. m1 remains A'·B'·C and m4 remains A·B'·C'. Now check m1 and m4 combine? m1 (A'·B'·C) and m4 (A·B'·C') share B' only, cannot combine. Final simplified: F = B·C + A'·B'·C + A·B'·C'. We can factor B' out of last two: B'·(A'·C + A·C'). Note A'·C + A·C' = A ⊕ C (XOR). So another form: F = B·C + B'·(A ⊕ C).

Final simplified SOPs acceptable for exam: one form is F = B·C + A'·B'·C + A·B'·C'; an equivalent with fewer literals is F = B·C + A'·C + A·B'·C'. (If allowed, present XOR form: F = B·C + B'·(A ⊕ C)).

State final answer in bold: F = B·C + A'·B'·C + A·B'·C'.

(Checked: the simplified forms are equivalent to the canonical SOP.)

Example 2 — Convert SOP to canonical POS

Problem: Given F = A·B + A'·C, convert to canonical POS (3 variables A,B,C).

Step 1 — expand F to canonical SOP (sum of minterms). Find minterms covered:

  • A·B is true for rows where A=1, B=1, C=0 or 1 → m6 (110) and m7 (111): terms A·B·C' + A·B·C.
  • A'·C is true for rows A=0, C=1, B=0 or 1 → m1 (001) and m3 (011): A'·B'·C + A'·B·C. So canonical SOP: F = m1 + m3 + m6 + m7.

Step 2 — canonical POS is product of maxterms where F=0, i.e., indices not listed: 0,2,4,5. So F = M0·M2·M4·M5 where each M_i is sum of literals for that row being 0.

If asked to expand to algebraic POS, convert sums: e.g., M0 (000) = (A + B + C), M2 (010) = (A + B' + C), etc.

Final canonical POS: F = (A + B + C)·(A + B' + C)·(A' + B + C)·(A' + B + C') (each maxterm matches row indices 0, 2, 4, 5 respectively).

Common mistakes

  • Dropping necessary literals in canonical forms — canonical minterms must include all variables.
  • Incorrect use of De Morgan (forgetting to complement both operator and operands).
  • Wrong grouping in Karnaugh maps because cells must be grouped in powers of two and using Gray code adjacency.
  • Assuming a simplified SOP is unique; there can be multiple minimal expressions with same cost.

For your exam

Question types you will see: definition and difference questions (define minterm/maxterm/canonical), derivation from truth table (write canonical SOP/POS), simplification (algebraic or K‑map), conversion between SOP and POS, and drawing K‑map groups with justification.

What a full‑marks answer includes:

  • State conventions (bit order, variable names, numbering).
  • Show truth table or list of minterm/maxterm indices explicitly.
  • Write canonical expression with correct minterms/maxterms (do not omit variables).
  • If simplification required, show grouping or algebraic steps and justify each Boolean law used (name laws when used).
  • If drawing a K‑map, draw grid with labels, place 1s/0s, show groups and list resulting prime implicants and final simplified expression.

Quick check

  1. Define a minterm.
  2. How do you get canonical POS from a truth table where F=0 for rows 0,2 and F=1 for others (3 variables)?
  3. Use De Morgan to simplify (A + B + C)'.

Answers: 1. A minterm is a product term containing every variable exactly once, complemented if the variable is 0 in that row. 2. Write maxterms for rows 0 and 2 and take their product: F = M0·M2 (with M0 = A + B + C, M2 = A + B' + C). 3. (A + B + C)' = A'·B'·C'.

Finished this topic? Mark it so your progress, study plan and readiness keep up.

Stuck on something here?