Boolean Expression Converter
Convert truth tables to boolean expressions in Sum of Products (SOP) or Product of Sums (POS) form, or vice versa.
What are SOP and POS?
Sum of Products (SOP): A boolean expression in OR of AND terms. Each term corresponds to a row where the output is true.
Product of Sums (POS): A boolean expression in AND of OR terms. Each term corresponds to a row where the output is false.
For more details on these forms, see All About Circuits guide.
Example Conversion
Truth Table:
| A | B | Output |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
SOP Form: ¬A ∧ B ∨ A ∧ ¬B
POS Form: (A ∨ B) ∧ (¬A ∨ ¬B)
Canonical Forms
Canonical forms are standardized representations of boolean functions. SOP is also called minterm canonical form, POS is maxterm canonical form. Learn more about Boolean algebra in MIT's Computation Structures course.