Sum of products
From Rice Wiki
The sum of products canonical form of boolean equation is used with truth tables and K maps to easily describe and minimize circuits.
SOP consists of many product terms added together, hence sum of products. It has two levels of logic: literals connect to a level of AND gates, which are then connected to a level of OR gates.
Procedure with truth table
First, make a truth table for an output Y. Then, for every row where Y = 1, write out the minterm of that row. Finally, add all minterms together to form a complete boolean equation for the variable.
