DE Notes
Learn canonical forms in Boolean algebra including minterms, maxterms, Sum of Minterms (SOM), Product of Maxterms (POM), and conversion between canonical and standard forms with examples.
Canonical forms provide a unique, standardized way to represent any Boolean function. Every Boolean function has exactly one canonical SOP (Sum of Products) and one canonical POS (Product of Sums) form, making them essential for systematic circuit design and comparison.
What are Canonical Forms?
A canonical form is a Boolean expression where:
- Every term contains ALL variables of the function (either complemented or uncomplemented)
- The expression is in either pure SOP or pure POS format
Maxterms (Sum Terms)
A maxterm is a sum (OR) term that contains every variable exactly once.
Maxterms for 3 Variables (A, B, C)
| Maxterm | Designation | A | B | C | Evaluates to 0 when |
|---|---|---|---|---|---|
| A+B+C | M₀ | 0 | 0 | 0 | A=0, B=0, C=0 |
| A+B+C\' | M₁ | 0 | 0 | 1 | A=0, B=0, C=1 |
| A+B\'+C | M₂ | 0 | 1 | 0 | A=0, B=1, C=0 |
| A+B\'+C\' | M₃ | 0 | 1 | 1 | A=0, B=1, C=1 |
| A\'+B+C | M₄ | 1 | 0 | 0 | A=1, B=0, C=0 |
| A\'+B+C\' | M₅ | 1 | 0 | 1 | A=1, B=0, C=1 |
| A\'+B\'+C | M₆ | 1 | 1 | 0 | A=1, B=1, C=0 |
| A\'+B\'+C\' | M₇ | 1 | 1 | 1 | A=1, B=1, C=1 |
Key insight: Each maxterm equals 0 for exactly ONE input combination.
How to Write a Maxterm
For maxterm Mᵢ, write the binary equivalent of i:
- If bit = 1 → variable is complemented (opposite of minterms!)
- If bit = 0 → variable is uncomplemented
Example: M₅ for variables A,B,C:
- 5 in binary = 101
- A=1→A\', B=0→B, C=1→C\' → A\'+B+C\'
Relationship Between Minterms and Maxterms
Also: Σm(i,j,k...) = ΠM(remaining indices)
Canonical SOP (Sum of Minterms)
Express a function as the OR of all minterms where F=1.
Example: Given truth table:
| A | B | C | F |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 |
F = 1 at rows 1, 3, 4, 6, 7
Canonical SOP: F = Σm(1, 3, 4, 6, 7) = A\'B\'C + A\'BC + AB\'C\' + ABC\' + ABC
Canonical POS (Product of Maxterms)
Express a function as the AND of all maxterms where F=0.
From the same truth table, F = 0 at rows 0, 2, 5
Canonical POS: F = ΠM(0, 2, 5) = (A+B+C)(A+B\'+C)(A\'+B+C\')
Converting Between Canonical Forms
SOP to POS Conversion
If F = Σm(1, 3, 4, 6, 7), the POS uses the remaining indices: F = ΠM(0, 2, 5)
For n variables, total minterms = 2ⁿ. Use indices NOT in the SOP list.
Finding Complement
If F = Σm(1, 3, 4, 6, 7), then: F\' = Σm(0, 2, 5) F\' = ΠM(1, 3, 4, 6, 7)
Converting Standard Form to Canonical Form
SOP → Canonical SOP (Expand missing variables)
Example: Convert F = AB + C to canonical form (3 variables A, B, C)
POS → Canonical POS (Expand missing variables)
Example: Convert F = (A+B)(B+C) to canonical form
Shorthand Notation
| Notation | Meaning |
|---|---|
| Σm(1,3,5) | Sum of minterms 1, 3, 5 (canonical SOP) |
| ΠM(0,2,4) | Product of maxterms 0, 2, 4 (canonical POS) |
| Σ(1,3,5) | Shorthand for Σm |
| Π(0,2,4) | Shorthand for ΠM |
Standard vs Canonical Forms
| Feature | Standard Form | Canonical Form |
|---|---|---|
| Variables per term | May be incomplete | All variables present |
| Unique? | No | Yes (unique for each function) |
| Example (SOP) | AB + C | A\'B\'C + A\'BC + AB\'C + ABC\' + ABC |
| Use case | Simplified circuits | Analysis and comparison |
Practical Example: 2-Variable Function
For F(A,B) = A + B:
Truth table:
| A | B | F |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
- Canonical SOP: F = Σm(1,2,3) = A\'B + AB\' + AB
- Canonical POS: F = ΠM(0) = (A+B)
- Simplified: F = A + B
Interview Questions
Q1: What is the difference between a minterm and a maxterm?
A minterm is a product (AND) term containing all variables that equals 1 for exactly one input combination. A maxterm is a sum (OR) term containing all variables that equals 0 for exactly one input combination. They are complements: mᵢ\' = Mᵢ.
Q2: How do you convert a canonical SOP to canonical POS?
List all minterm indices not present in the SOP. Those become the maxterm indices for POS. For n variables with 2ⁿ total minterms, if SOP = Σm(list), then POS = ΠM(complement of list).
Q3: Why are canonical forms useful if they\'re not minimized?
Canonical forms are unique — two functions are equivalent if and only if they have the same canonical form. This makes them ideal for comparison, verification, and as starting points for systematic minimization (K-maps, Quine-McCluskey).
Q4: Convert F = A\' + B to canonical SOP for 2 variables.
A\' = A\'(B+B\') = A\'B + A\'B\'. B = B(A+A\') = AB + A\'B. F = A\'B + A\'B\' + AB + A\'B = A\'B\' + A\'B + AB = Σm(0,1,3).
Q5: What is the relationship between a function and its complement in canonical forms?
If F = Σm(a,b,c...), then F\' = Σm(remaining indices) = ΠM(a,b,c...). The minterm indices of F become the maxterm indices of F\' and vice versa.
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Canonical Forms – Minterms, Maxterms, and Standard Forms.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Digital Electronics topic.
Search Terms
digital-electronics, digital electronics, digital, electronics, boolean, algebra, canonical, forms
Related Digital Electronics Topics