Source
Adapted from my own handwritten and hand-typed notes from Year 1 to Year 3 of my EEE degree
Definitions
The canonical sum of a logic function is the sum of the minterms for the truth table rows where the function is 1.
The canonical product is the product of the maxterms for the rows where the function is 0.
Example truth table with on rows 0, 3, 4, 6, 7:
Reading a Function From a Truth Table
Two ways:
- OR together the minterms of all 1 rows to get the canonical sum
- write as the OR of the 0 rows, then apply DeMorgan to get the canonical product
Example with for :
Converting an SOP to Minterms
If a product term is missing a variable , multiply it by and expand. Repeat until every term has all variables, then drop duplicates.
Example: .
Converting to Maxterms
Use the distribution law to reach a product of sums, then add any missing variable as and distribute again.
Example: .
Algebraic Simplification
Canonical forms are easy to write but usually not minimal. Boolean algebra keeps the same function while reducing literals, which means fewer gates.
Example:
Two more:
- by DeMorgan and idempotency
Minimised SOP and POS forms map neatly onto Two-Level NAND and NOR Circuits.