Canonical Forms Sop Pos: Concepts, Formulas and Examples

Canonical forms are standardised ways of writing any Boolean function so that two people describing the same function always arrive at the same expression. The two canonical forms are SOP (sum of products: an OR of AND-terms) and POS (product of sums: an AND of OR-terms), and they are built directly from the truth table.

They matter because they give a mechanical recipe for going from a specification (the truth table) to an implementation (a two-level AND-OR or OR-AND circuit). Programmable logic devices literally implement SOP form in hardware, so canonical forms connect theory to real chips.

Key Concepts

• Minterm: an AND product containing every variable exactly once; it is 1 for exactly one truth-table row.
• Maxterm: an OR sum containing every variable exactly once; it is 0 for exactly one truth-table row.
• SOP (sum of products): OR of minterms, one per row where the function is 1.
• POS (product of sums): AND of maxterms, one per row where the function is 0.
• Canonical: unique for a given function — the same function always yields the same SOP and POS.

Formulas

• SOP: F is the OR of the minterms for the row numbers with output 1.
• POS: F is the AND of the maxterms for the row numbers with output 0.
• For its row, a minterm complements each variable that is 0 in that row; a maxterm complements each variable that is 1 (since a maxterm must be 0 exactly on its row).
• SOP and POS describe the same function: collect the 1-rows for SOP, the 0-rows for POS.

Worked Example

Take a 3-variable function F that is 1 on rows 0, 2 and 5. Row 0 is 000, giving minterm (not A) AND (not B) AND (not C). Row 2 is 010, giving (not A) AND B AND (not C). Row 5 is 101, giving A AND (not B) AND C. So the canonical SOP is the OR of these three minterms. For POS, use rows 1, 3, 4, 6, 7: row 1 (001) gives maxterm A OR B OR (not C), row 3 (011) gives A OR (not B) OR (not C), row 4 (100) gives (not A) OR B OR C, row 6 (110) gives (not A) OR (not B) OR C, row 7 (111) gives (not A) OR (not B) OR (not C). Spot-check row 5 (101): the minterm A AND (not B) AND C = 1 AND 1 AND 1 = 1, so F = 1 as required.

Common Misconceptions

• "A minterm is 0 on its own row." It is the opposite: a minterm is 1 only on its row and 0 everywhere else; a maxterm is 0 only on its row.
• "SOP and POS are different functions." They are two writings of the same function — convert between them with De Morgan's laws.
• "Canonical forms are the simplest forms." They are the most standard, not the simplest; Karnaugh maps and algebra usually shrink them further.

Real-World Applications

• Two-level logic implementation: AND-OR and OR-AND gate networks map directly onto SOP and POS.
• Programmable logic arrays (PLAs): hardware that realises any SOP expression by fusing connections.
• Logic synthesis: CAD tools start from canonical forms before optimising to minimal circuits.

SOP collects the rows where the function is 1 as minterms ORed together; POS collects the rows where it is 0 as maxterms ANDed together. Together they give a unique, mechanical bridge from any truth table to a working circuit.