Boolean Equation Form

Boolean Equation Form

Boolean equation can be represented in two forms:

•         Sum of products (SOP) expression:  The logic sum (OR) of multiple product terms:

                   AB + A’C + B’ + ABC

                   AB’C  +  B’D’  + A’CD’

•         Product of sums (POS) expression: The logic product (AND) of multiple sum terms:

                   (A+B).( A’+C).B’.( A+B+C)

                   (A’ + B + C).( C’ + D)

Note:

          SOP expressions  ==> 2-level AND-OR circuit

          POS expressions ==> 2-level OR-AND circuit

SOP Example:

•         Consider the truth table :

•         Here SOP is f(X.Y) = X.Y' + X.Y

•         To derive the Sum of Products form from a truth table, OR together all of the minterms which give a value of 1.

POS Example:

•Consider the truth table :

•Here POS is F(X,Y) = (X+Y')

•To derive the Product of Sums form from a truth table, AND together all of the maxterms which give a value of 0. 

Written by

Name: Su’aidah Binti Mokhtar

No. Matrik: B031210193