Related Concepts: 3.01 Boolean Algebra Foundations & Duality Principle | 3.04 Mathematical Conversions & Expansion of SOP and POS | 4.02 Universal Logic Gates & 2-Level Implementations

3.03 SOP, POS, Canonical & Standard Forms

Introduction to Boolean Logic Forms

Any Boolean function can be expressed in two standard algebraic structures: Sum of Products (SOP) or Product of Sums (POS).

graph TD
    BF[Boolean Expressions] --> SOP[Sum of Products SOP]
    BF --> POS[Product of Sums POS]
    
    SOP -->|OR-ing AND terms| CSOP[Canonical SOP / Sum of Minterms Σm]
    SOP -->|Simplified| SSOP[Standard SOP e.g. AB + BC]
    
    POS -->|AND-ing OR terms| CPOS[Canonical POS / Product of Maxterms ΠM]
    POS -->|Simplified| SPOS[Standard POS e.g. A+B B+C]

---

1. Canonical Forms vs. Standard Forms

A. The Canonical Form (Strictly Unique)

Definition: Canonical Form

A Boolean expression is in Canonical Form if every term contains all domain variables of the function exactly once, in either complemented or uncomplemented form. Canonical forms are strictly unique.

• Minterm ($m_j$): An AND product term containing all $n$ domain variables. Evaluates to 1 for exactly one input state. Used in Canonical SOP ($\Sigma m$).
• Maxterm ($M_j$): An OR sum term containing all $n$ domain variables. Evaluates to 0 for exactly one input state. Used in Canonical POS ($\Pi M$).

B. The Standard Form (Simplified / Non-Unique)

Definition: Standard Form

A Boolean expression is in Standard Form if it follows SOP or POS structure, but terms are simplified and do not need to contain all domain variables. Standard forms are non-unique.

C. Comparison: Canonical Forms vs. Standard Forms

Parameter	Canonical Form	Standard Form
Domain Variables	Every term MUST contain all domain variables exactly once.	Terms are simplified and do not need to contain all variables.
Uniqueness	Uniquely represents a Boolean function. (Only one canonical form exists).	Non-unique representation. (Multiple simplified standard forms exist).
Direct Mapping	Directly maps to the truth table rows (minterms = 1, maxterms = 0).	Does not map directly to rows without variable expansion.
Boolean Terms	Minterms (for SOP) and Maxterms (for POS).	Standard product terms and standard sum terms.
Algebraic Length	Usually long and redundant.	Minimized and compact.
Gate Efficiency	Highly inefficient to implement directly.	Optimal for hardware implementation (uses fewer gates).

---

2. Comparison Table: SOP vs. POS

Parameter	Sum of Products (SOP)	Product of Sums (POS)
Basic Structure	Formed by OR-ing multiple AND product terms.	Formed by AND-ing multiple OR sum terms.
Truth Table Source	Derived from rows where output $F=1$.	Derived from rows where output $F=0$.
Canonical Component	Sum of Minterms ($\Sigma m$).	Product of Maxterms ($\Pi M$).
Native Gate Realization	2-level AND-OR or NAND-NAND logic.	2-level OR-AND or NOR-NOR logic.

---

3. PYQ Master Problem: POS Canonical Extraction

PYQ Master Problem (PYQ 2016 — 12 marks)

Question (verbatim): Given the function $f(A,B,C)=(A+B+C^{\prime })(A+B^{\prime }+C^{\prime })(A^{\prime }+B+C^{\prime })(A^{\prime }+B^{\prime }+C^{\prime })$, let construct the truth table and express the function in both maxterm and minterm forms.

Step 1: Identify the Maxterms The function is given in canonical Product of Sums (POS) form. A maxterm evaluates to 0 when its uncomplemented variables are 0 and its complemented variables are 1:

• $(A+B+C^{\prime })\to 001_2\to {\mathbf{M}}_1$
• $(A+B^{\prime }+C^{\prime })\to 011_2\to {\mathbf{M}}_3$
• $(A^{\prime }+B+C^{\prime })\to 101_2\to {\mathbf{M}}_5$
• $(A^{\prime }+B^{\prime }+C^{\prime })\to 111_2\to {\mathbf{M}}_7$

Maxterm Form: $\mathbf{f}(\mathbf{A},\mathbf{B},\mathbf{C})=\mathbf{\Pi M}(1,3,5,7)$

Step 2: Identify the Minterms Minterms are the remaining decimal states (0 through 7) not present in the maxterm list: Minterm Form: $\mathbf{f}(\mathbf{A},\mathbf{B},\mathbf{C})=\mathbf{\Sigma m}(0,2,4,6)$

Step 3: Construct the Truth Table

A B C	f(A,B,C)
0 0 0	1
0 0 1	0
0 1 0	1
0 1 1	0
1 0 0	1
1 0 1	0
1 1 0	1
1 1 1	0

(Notice $f(A,B,C)$ simplifies to $f=C^{\prime }$). $■$

---

Exam Hack: the one-line distinction that scores

If you only write one sentence, write this: “In canonical form every term contains all $n$ variables and the representation is unique; in standard form terms are simplified, may omit variables, and the representation is not unique.” Then give a two-line example of the same function in both forms — e.g. $F=\Sigma m(1,3)=A^{\prime }{B}^{\prime }C+A^{\prime }BC$ (canonical) versus $F=A^{\prime }C$ (standard). Definition plus example is what earns full marks; definition alone typically earns half.

---

Past Year Questions (PYQs)

Question (as asked)	Years	Marks	Solved in
Define the following terms: (i) Duality principle, (ii) Canonical form, (iii) Standard form, (iv) Positive and negative logic, (v) IC logic families	2015, 2016	10	§1 (items i, iv in 3.01 Boolean Algebra Foundations & Duality Principle and 4.07 Logic Analysis, Switching Circuits & Positive-Negative Logic)
Define the following terms: (i) Duality principle, (ii) Standard form	2019, 2022	6–8	§1
Define universal gate. Distinguish between canonical form and standard form of a Boolean function	2021, 2022	10	§1 (universal gate in 4.02 Universal Logic Gates & 2-Level Implementations)
What is meant by canonical and standard form? Express $F=xy+xz$ in a product of maxterm form	2024	9	§1, and 3.04 Mathematical Conversions & Expansion of SOP and POS §3.2
Given $f(A,B,C)=(A+B+C^{\prime })(A+B^{\prime }+C^{\prime })(A^{\prime }+B+C^{\prime })(A^{\prime }+B^{\prime }+C^{\prime })$, construct the truth table and express in maxterm and minterm forms	2016	12	§3

Pattern to notice: the canonical-vs-standard definition appears in six of the last ten papers and is never a standalone question — it is always bundled with either the duality principle (2015, 2016, 2019, 2022) or the universal gate definition (2021, 2022). Revise those three definitions as one block and you cover all six appearances.

Watch for the tail: from 2024 onward the examiner attaches a conversion task to the definition (“…express $F=xy+xz$ in product of maxterm form”). Defining the terms without doing the conversion leaves marks on the table.