Related Concepts: 12 Mathematical Conversions & Expansion of SOP and POS | 07 Boolean Algebra Foundations & Duality Principle | 08 Boolean Algebra Significance & Circuit Minimization

11 SOP, POS, Canonical & Standard Forms

Introduction to Boolean Logic Forms

Any Boolean function, regardless of its underlying complexity, can be expressed in either of two standard algebraic structures: Sum of Products (SOP) or Product of Sums (POS).

Standardizing Boolean functions into these forms enables systematic logic simplification, K-map tabular plotting, and direct implementation using 2-level gate architectures.

---

1. Fundamental Definitions: SOP vs. 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]

Sum of Products (SOP)

A Sum of Products (SOP) is a Boolean expression in which two or more AND terms {product terms} are combined using the OR operation {summation}.

• Syntax Constraint: A single overbar {inversion bar} cannot extend over more than one variable. For instance, $\bar{A}\bar{B}C$ is a valid SOP term, whereas $\overline{ABC}$ is invalid.
• Hardware Realization: Implemented via a 2-level AND-OR logic network {outputs of multiple AND gates feed into a single OR gate}, or an equivalent 2-level NAND-NAND network.
• Example (SOP): $F(A,B,C)=AB+\bar{A}C+BC$

Product of Sums (POS)

A Product of Sums (POS) is a Boolean expression in which two or more OR terms {sum terms} are combined using the AND operation {multiplication}.

• Syntax Constraint: Similar to SOP, a single overbar cannot extend over more than one variable in any sum term.
• Hardware Realization: Implemented via a 2-level OR-AND logic network, or an equivalent 2-level NOR-NOR network.
• Example (POS): $F(A,B,C)=(A+B)(\bar{A}+C)(B+C)$

---

2. Canonical Forms vs. Standard Forms

Understanding the distinction between Canonical and Standard logic forms is one of the most frequently examined theoretical topics in ECE 2103.

A. The Canonical Form (Strictly Unique)

Definition: Canonical Form

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

The Canonical form of a Boolean function is strictly unique—two logic circuits implementing the exact same truth table will share identical canonical expressions.

Minterms and Maxterms:

• Minterm ($m_j$): A canonical product term (AND term) containing all $n$ variables of the function. A minterm evaluates to 1 for exactly one specific combination of inputs in the truth table. Used to construct Canonical SOP (CSOP).
• Maxterm ($M_j$): A canonical sum term (OR term) containing all $n$ variables of the function. A maxterm evaluates to 0 for exactly one specific combination of inputs in the truth table. Used to construct Canonical POS (CPOS).

Examples of Canonical Forms:

• Canonical SOP (CSOP / Sum of Minterms): $F(A,B,C)=\bar{A}BC+A\bar{B}C+ABC=\sum m(3,5,7)$
• Canonical POS (CPOS / Product of Maxterms): $F(A,B,C)=(A+B+C)(A+\bar{B}+C)(\bar{A}+B+\bar{C})=\prod M(0,2,5)$

---

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

Definition: Standard Form

A Boolean expression is in Standard Form if it is written in SOP or POS structure, but each term does not necessarily contain all variables of the function.

Standard forms represent the simplified version of canonical expressions. They contain fewer literals and terms, reducing hardware gate count, but are not unique representations.

Examples of Standard Forms:

• Standard SOP (SSOP): $F(A,B,C)=AB+BC+\bar{A}C$
• Standard POS (SPOS): $F(A,B,C)=(A+B)(B+C)(\bar{A}+C)$

---

3. Similarities & Differences: SOP vs. POS

According to your class test syllabus, you must master the structural comparison between SOP and POS forms.

Five Key Similarities:

1. Algebraic Functionality: Both are standard Boolean algebraic structures capable of representing any binary function.
2. Equivalence: Both forms can be synthesized to represent the exact same truth table.
3. Design Purpose: Both are used to design, evaluate, and minimize 2-level digital logic gate networks.
4. Minimization Tools: Both can be simplified using Boolean algebra postulates or Karnaugh maps (K-maps).
5. Form Representation: Both can be expressed in either Canonical form or Standard form.

Comparison Table of Differences:

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 Derivation	Derived from truth table rows where output $F=1$.	Derived from truth table rows where output $F=0$.
Canonical Component	Canonical SOP is the Sum of Minterms.	Canonical POS is the Product of Maxterms.
Shorthand Notation	Represented using the Sigma symbol ($\Sigma m$).	Represented using the Pi symbol ($\Pi M$).
Term Evaluation	A minterm evaluates to 1 for its specific input combination.	A maxterm evaluates to 0 for its specific input combination.
Native 2-Level Gate Logic	Implemented natively using AND-OR or NAND-NAND logic.	Implemented natively using OR-AND or NOR-NOR logic.

---

Past Year Questions (PYQs)

Theoretical definitions distinguishing Canonical and Standard forms appear regularly in term finals:

• 2015, 2016 (10 Marks Partial): Define: (ii) Canonical form, (iii) Standard form.
• 2019, 2022 (06 to 08 Marks Partial): Define Canonical form and Standard form.
• 2021, 2022 (10 Marks Partial): Distinguish between canonical form and standard form of a Boolean function.
• 2024 (09 Marks Partial): What is meant by canonical and standard form?
  • Solution: Write the definitions in Section 2, explain minterms ($m_j$) vs maxterms ($M_j$), highlight that Canonical forms are strictly unique whereas Standard forms are simplified and non-unique, and provide the equation examples.