Canonical Forms of Boolean Expressions

You will transform any logical function into standard Sum-of-Products and Product-of-Sums forms to prepare them for systematic simplification.

Mastering Canonical Forms

In this lesson, you will learn how to represent any logic function in a rigid, standardized format to ensure your digital circuits are predictable and easy to simplify.

The Logic of Consistency

When designing hardware, we often start with a truth table. However, a truth table can be written in many different algebraic ways. Canonical forms act as a universal "standard" so that no matter how you write a function, you can always compare it against another.

There are two primary ways to do this:

Sum-of-Products (SOP): You look at every row in your truth table where the output is 1. For each of those rows, you create an AND term (a product) of all inputs. Finally, you OR all those terms together.
Product-of-Sums (POS): You look at every row where the output is 0. You create an OR term (a sum) for those inputs and then AND them all together.

A Quick Example

Imagine a function with two inputs, A and B, where the output is 1 only when A is 1 and B is 0.

To write this in Canonical SOP, we look for the row where the output is 1:

The term is A AND (NOT B).
In Boolean notation: F = A · B'

If the truth table had multiple 1s, we would simply add them: F = (A' · B) + (A · B'). Each of these individual pieces is called a minterm.

Why bother?

In digital architecture, these forms are the starting line for minimization. By breaking a complex function down into its fundamental minterms (for SOP) or maxterms (for POS), we gain a clear "blueprint" of the logic. This makes it much easier to apply Boolean theorems to remove redundant gates, saving power and physical space on your silicon chip.

Key Takeaway: Canonical forms ensure every Boolean function has a unique "standard" signature based on its truth table, providing a reliable starting point for circuit optimization.