Boolean Equation

Boolean Equation

Boolean equation can be represented in 2 forms:

Sum of products (SOP)

i.                    Combination of input values that produce 1s is converting into equivalent variables.

ii.                  AND together then OR with other combination variables with the same output.

iii.                SOP is easier to derive in truth table compare to POS.

Product of sums (POS)

i.                    Combination of input values that produce 0s is converting into equivalent variables.

ii.                  OR together then AND with other combination variables with the same output.

iii.                POS usually use when more 1s produce in output function.

Example:

Sum of products (SOP):

Y = A’B’C + A’BC’ + AB’C’ + ABC

Product of sums (POS):

Y = A’B’C’ + A’BC + AB’C +ABC’