Second Semester_Digital Logic_Canonical Expression
🔹 Canonical Expression
A canonical expression is a Boolean expression written in a form where each term contains all the variables in the system, either complemented or uncomplemented.
-
Two types:
-
Canonical Sum of Products (SOP) → Each product term (AND) has all the variables.
Example: For variables :is not canonical, but
(expanded so each term has all variables) → canonical SOP.
-
Canonical Product of Sums (POS) → Each sum term (OR) has all the variables.
-
✅ Key point: Every canonical form corresponds directly to a truth table row (minterm for SOP, maxterm for POS).
which also means;
👉 Every term must contain all variables, either normal or complemented.
✅ Example (2 variables ):
-
Canonical SOP:
(both terms have A and B) -
Canonical POS:
(each sum has A and B)
🔹 Standard Form
👉 Just means the expression is written as SOP (Sum of Products) or POS (Product of Sums).
-
SOP = OR of AND terms
-
POS = AND of OR terms
✅ Example (2 variables ):
-
Standard SOP:
-
Standard POS:
⚠️ In standard form, not all variables need to appear in every term.
or We can Tell also as;
A standard form is a Boolean expression written as either:
-
Sum of Products (SOP): OR of product terms.
-
Product of Sums (POS): AND of sum terms.
⚠️ The difference is:
-
In standard SOP/POS, not all variables need to appear in each term.
-
In canonical SOP/POS, every term must include all variables.
✅ Example (3 variables: A, B, C)
-
Standard SOP:
(terms don’t include all variables)
-
Canonical SOP:
(every product has all variables: A, B, and C)
-
Standard POS:
(not all variables in each sum)
-
Canonical POS:
(every sum includes all variables)
🌟 In short:
-
Standard form = SOP or POS (not necessarily all variables in each term).
-
Canonical expression = Special standard form where each term has all variables.
Comments
Post a Comment