87

Sum of product(SOP)

A canonical sum of products is a boolean expression that entirely consists of minterms. The Boolean function F is defined on two variables X and Y. The X and Y are the inputs of the boolean function F whose output is true when any one of the inputs is set to true. The truth table for Boolean expression F is as follows:

Inputs		Output
X	Y	F
0	0	0
0	1	1
1	0	1
1	1	1

In our previous section, we learned about how we can form the minterm from the variable’s value. Now, a column will be added for the minterm in the above table. The complement of the variables is taken whose value is 0, and the variables whose value is 1 will remain the same.

Inputs		Output

Minterm X Y F M 0 0 0 X’Y’ 0 1 1 X’Y 1 0 1 XY’ 1 1 1 XY