CREATE OWN LIBRARY

SOP and POS

 

Sum of Product (SOP)

1. The Sum of Product (SOP) is a Boolean expression containing sum of AND (product) terms of one or more literals each complemented or uncomplemented. It is basically an OR operation of AND operated variables. 

 

Example:

 

2. Minterm: Each product terms in SOP form is called a minterm.

In minterm we assign ‘1’ to each uncomplemented variables and assign ‘0’ to each complemented variables.

 

3. SOP form is used when output of logic circuit is 1.

 

Example:

 

 

A

B

Y

0

1 →

2

3 →

0

0

1

1

0

1

0

1

1

0

1

0

 

 

Here we are taking those terms where output is 1

 

Now, we can represent it another way:

 

 

Sum of Product is also two level AND OR hierarchy.

 

 

Product of Sum (POS)

1. A Product of Sums (POS) is Boolean expression containing product of OR terms (sum terms). Where each term may have any number of literals each complemented or uncomplemented. It is basically an AND operation of OR operated variables.

 

Example:

 

2. Maxterm: Each sumterms in POS form is called a minterm.

In maxterm we assign ‘0’ to each uncomplemented variables and assign ‘1’ to each complemented variables.  (Just opposite to SOP) 

 

3. POS form is used when output of logic circuit is ‘0’.

 

Example:

 

 

A

B

Y

0 →

1

2 →

3

0

0

1

1

0

1

0

1

1

0

1

0

 

 

Here we are taking those terms where output  is 0

 

Now, we can represent it another way:

 

 

POS (Product of Sum) is also two level of OR – AND hierarchy.

 

Example of minterms and maxterms

 

A

B

minterms

maxterms

0

0

A’B’

A + B

0

1

A’B

A + B’

1

0

AB’

A’ + B

1

1

AB

A’ + B’