Scribd
Upload
10 views14 pages

Sum of Products Product of Sums

The document explains the concepts of Sum of Products (SOP) and Products of Sums (POS) in Boolean algebra, detailing their definitions, forms (canonical and non-canonical), and how to derive them from truth tables. It provides examples of both SOP and POS forms, including the process of simplification using Boolean algebra. Additionally, it introduces minterms and maxterms, which are essential for understanding these forms.

Uploaded by

yashkumar.sonani24mca
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views14 pages

Sum of Products Product of Sums

The document explains the concepts of Sum of Products (SOP) and Products of Sums (POS) in Boolean algebra, detailing their definitions, forms (canonical and non-canonical), and how to derive them from truth tables. It provides examples of both SOP and POS forms, including the process of simplification using Boolean algebra. Additionally, it introduces minterms and maxterms, which are essential for understanding these forms.

Uploaded by

yashkumar.sonani24mca
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Sum of Products

Product of Sums
What is Sum of Products (SOP)?

■ Sum of Product is the abbreviated form of SOP.


■ Sum of product form is a form of expression in Boolean algebra in which
different product terms of inputs are being summed together.
■ This product is not arithmetical multiply but it is Boolean logical AND and the
Sum is Boolean logical OR.
■ To understand better about SOP, we need to know about min term.
What is Sum of Products (SOP)?

■ The SOP form can be in either canonical form or non-canonical form.


1. Non-Canonical SOP Form
• In this form each product term between may or may not contain all the variables of the
function.
• Example:
• F(A,B,C)=A+𝐵 ⋅ 𝐶 +A.C
• As we can see in above example the function have variables A, B, C but we are not
including each variable in each product term.
• in first product term (A) we have not included B & C. In second product term we (B̅.C)
have not included A. While in last product term we have not included B.
What is Sum of Products (SOP)?
2. Canonical SOP Form

• In canonical SOP form each product term contains all the variables of the function,
where variables in each product term can be in true form or complemented form.
• Example:
• F(A,B)=𝐴 ⋅ 𝐵 + 𝐵 ⋅ 𝐴
• As we can see in above example each product term contain all the variables which are
present in function.
• In first one(Ā.B) A is present in complementary form while B is in true form. In second
one A is present in true form while B is in complementary form.
What is Sum of Products (SOP)?

■ Suppose following is the truth table for an electronic circuit:

A B C F

0 0 0 0

0 0 1 0

0 1 0 1

0 1 1 0

1 0 0 1

1 0 1 1

1 1 0 0

1 1 1 1
What is Sum of Products (SOP)?

■ The SOP form is written when the function if high. i.e we will take conditions only in which
the output is one.
■ In given truth table the columns with F = 1 are the rows with high output.
■ Now we will write function in the form of given variables which are A, B and C.
■ If we have 1 in the cell of given variable we will write it as it is , and if we have 0 in the
given cell then we will write it’s complement.
■ F=𝐴 ⋅ 𝐵 ⋅ 𝐶 + 𝐴 ⋅ 𝐵 ⋅ 𝐶 + 𝐴 ⋅ 𝐵 ⋅ 𝐶 + 𝐴 ⋅ 𝐵 ⋅ 𝐶
■ This is the POS in canonical form for the given truth table.
Min Term

■ The product of all literals, either with complement or without complement, is


known as minterm..
■ Therefore we can also write it as,
■ F(A,B,C)= 𝑚 (2,4,5,7)
SOP

■ we can further reduce it to non-canonical SOP form by using Boolean algebra.


■ 𝐴⋅𝐵⋅𝐶+ 𝐴⋅𝐵⋅𝐶+𝐴⋅𝐵⋅𝐶+𝐴⋅𝐵⋅𝐶
■ Thus, the simplified (non-canonical) form is:
What is Products of Sum (POS)?

■ the POS form is the product of all the sums.


■ Here, the sum does not mean traditional addition, the sum here refers to the
‘OR’ operation, and the product here refers to the ‘AND’ operation.
■ Thus, in POS form, we perform the OR of multiple variables and then perform
the AND operation between them.
■ This form is exactly opposite to the SOP (Sum Of Product) form.
■ POS form is also referred to as conjunctive normal form.
Maxterm

■ In maxterm, each variable whose value is assigned to 1 is represented in the


complemented form.
■ The variable whose value is assigned to 0 is represented in the un-complimented form.
■ We have two types of POS form:
• Canonical POS form
• Minimal POS form.
■ In canonical POS form, we have all the variables present in a complimented or un-
complimented form in each maxterm.
■ In contrast, in minimal POS form, we do not have all the variables in the complimented or
uncomplimented form in each maxterm.
Example: For the given truth table, find and
then minimize the POS form.

X Y Z F

0 0 0 0

0 0 1 0

0 1 0 1

0 1 1 0

1 0 0 1

1 0 1 1

1 1 0 1

1 1 1 1
Example: For the given truth table, find and
then minimize the POS form.

■ In POS form , we consider those outputs which are low or 0.


■ We follow the convention of maxterms in POS form i.e., 0 represents un-
complimented form and 1 represents complimented form.
■ F = (X + Y + Z) . (X + Y + Z’) . (X + Y’ + Z’)
Example: For the given truth table, find and
then minimize the POS form.

■ Now , applying several laws of Boolean Algebra we will minimize the POS form.
■ F = (X + Y + Z) . (X + Y + Z’) . (X + Y’ + Z’)
■ F = ((X + Y) + (Z.Z’)) . (X + Y’ + Z’) [ Distributive law -> (X + Y) . (X + Z) = X + YZ
]
■ F = (X + Y) . (X + Y’ + Z’) [ Z.Z’ = 0 ]
■ F = X + Y.(Y’ + Z’) [ Distributive law -> (X + Y) . (X + Z) = X + YZ ]
■ F = X + Y.Y’ +Y.Z’
■ F = X + Y.Z’ [ Y.Y’ = 0 ]
■ F = (X + Y) . (X + Z’) [ Distributive law -> (X + Y) . (X + Z) = X + YZ ]
Example: For the given truth table, find and
then minimize the POS form.

■ F = (X + Y) . (X + Z’) This is the minimal POS form.

You might also like