Scribd
Upload
12 views14 pages

Mid Lecture 2

Uploaded by

johashahriarahsan
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
12 views14 pages

Mid Lecture 2

Uploaded by

johashahriarahsan
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

Lecture -2

Sum-of-Products, Product-of-Sum
Prepared By: Asif Mahfuz
Standardization
• All Boolean expression, regardless of their form, can be converted into either of the two
standard forms.
• The two standard forms are: Sum-of-Products (SOP) and Product-of-Sum (POS).
• Standardization makes evaluation, simplification and implementation of Boolean
expression much more systematic and easier.

Domain of a Boolean Expression


• The domain of a general Boolean expression is the set of variable contained in the
Boolean expression in either complemented or uncomplemented form.
• For example, the domain of the expression AB ഥ is the set of variable A,B and C.
ഥ + AC
• And for example, the domain of the expression AB ത +A
ഥC + CE ഥDഥ is the set of variables
A,B,C,D and E.
Sum-of-Product (SOP)
• Sum of Products: A Product is defined as a term consisting of products of the literals.
When two or more products are summed in a Boolean expression, it is called the Sum-of-
Products (SOP).
ഥ 𝐁 + 𝐁𝐂
𝐀+𝐀
• Standard SOP: It is an expression where all the variables are present in each product
terms. The products in a SSOP are called min terms (𝐦𝐢 ) .
𝐀𝐁𝐂 + 𝐀𝐁𝐂 + 𝐀𝐁𝐂
• Conversion of SOP to Standard SOP
• Step1: Multiply each of the non-standard terms with a term made up of the sum of
the missing variable and its complement. This do not change the function as we are
just multiplying by 1.
• Step2: Repeat step 1 until all the non-standard terms become standard terms.
• Sum-of-Products is used to describe when the function is 1.
Product-of-Sum (POS)
• Product of Sum: A Sum is defined as a term consisting of sum of the literals. When two
or more sum terms are multiplied in a Boolean Expression, it is called the Product-of-
Sum (POS).
(𝐁 + 𝐂)(𝐀 + 𝐁)
• Standard POS: It is an expression where all the variables are present in each sum terms.
Each sum terms are called max terms (𝐌𝐢 ) .
(𝐀 + 𝐁 + 𝐂)(𝐀 + 𝐁 + 𝐂)
• Conversion of POS to Standard POS
• Step1: Add to each non-standard product terms a term made up of the product of the
missing variable and its complement. This does not change the expression as we are
just adding a 0.
• Step2: Apply rule 12: 𝐀 + 𝐁𝐂 = (𝐀 + 𝐁)(𝐀 + 𝐂)
• Step3: Repeat step 1 until all the sum terms contain all the variable in the domain.
• Product-of-Sum is used to describe when the function is 0.
SOP & POS
Min Terms and Max Terms
• Each variable in a Boolean expression is a literal.
• Boolean variable can appear in normal (A) or complemented (A ഥ) form.
• Each product of all variables in the domain is called Min-Term.
• Each sum of all variables in the domain is called Max-Term.

For Min-Terms: For Max-Terms:


When 0→ Complemented Form When 1→ Complemented Form
When 1→ Normal Form When 0→ Normal Form
Boolean Expression(SOP) to Truth-Table
• Truth-table can be formed for any Boolean expression.
• Converting a Boolean Expression to SSOP can make this task a lot easier.
• Find the truth-table for the following Boolean expression:
ഥ 𝐂ത
𝐅 𝐀, 𝐁, 𝐂 = 𝐀𝐁 + 𝐁
𝐅 𝐀, 𝐁, 𝐂 = 𝐀𝐁 𝐂 + 𝐂ത + 𝐀 + 𝐀 ഥ 𝐂ത
ഥ 𝐁
𝐅 𝐀, 𝐁, 𝐂 = 𝐀𝐁𝐂 + 𝐀𝐁𝐂ത + 𝐀𝐁 ഥ 𝐂ത + 𝐀
ഥ𝐁ഥ 𝐂ത
Truth-Table to Function Implementation
• Find and implement the function from the following truth-table.

ഥ𝐁
𝐅 𝐀, 𝐁, 𝐂 = 𝐀 ഥ 𝐂ത + 𝐀
ഥ 𝐁𝐂ത + 𝐀𝐁𝐂ത + 𝐀𝐁𝐂
ഥ 𝐂ത + 𝐀𝐁
𝐅 𝐀, 𝐁, 𝐂 = 𝐀
• For the function F = σ 2,3,5,7 :
a) Construct the truth table.
b) Implement the function.
Boolean Expression(POS) to Truth-Table
• Form a truth-table for the following Boolean expression.
𝐅 𝐀, 𝐁, 𝐂 = (𝐀 + 𝐁) ∙ (𝐁 ത
ഥ + 𝐂)
• In the first step, we will convert the POS to SPOS:
𝐅 𝐀, 𝐁, 𝐂 = 𝐀 + 𝐁 + 𝐂𝐂ത ∙ 𝐁 ഥ + 𝐂ത + 𝐀𝐀
ഥ
𝐅 𝐀, 𝐁, 𝐂 = (𝐀 + 𝐁 + 𝐂) ∙ (𝐀 + 𝐁 + 𝐂) ത ∙ (𝐁
ഥ + 𝐂ത + 𝐀) ∙ (𝐁
ഥ + 𝐂ത + 𝐀
ഥ)
• Once we have converted the expression to SPOS, now we can directly form the truth-table.
Function Implementation using POS
• For the function F = ς(1,2,5,6):
a) Construct the truth table.
b) Implement the function.
Solution:
Step 1 Step 2

Step 3 ഥ𝐁
𝐅 𝐀, 𝐁, 𝐂 = 𝐀 ഥ 𝐂ത + 𝐀 ഥ 𝐂ത + 𝐀𝐁𝐂
ഥ 𝐁𝐂 + 𝐀𝐁

• Now that we have the Boolean expression, we can simplify it and implement it.
Connecting the Dots between SOP and POS
• From the truth table determine the standard SOP expression and the equivalent POS
expression.
Standard SOP expression:
• Write down the sum of min terms of the
combinations for which the function is 1.
𝐅=𝐀 ഥ 𝐂ത + 𝐀𝐁
ഥ 𝐁𝐂 + 𝐀𝐁 ഥ 𝐂 + 𝐀𝐁𝐂ത + 𝐀𝐁𝐂
Equivalent POS expression:
• Write down the product of max terms of the
combinations for which the function is 0.
𝐅 = (𝐀 + 𝐁 + 𝐂) ∙ (𝐀 + 𝐁 + 𝐂)ത ∙ (𝐀 + 𝐁
ഥ + 𝐂)

HOW DOES THIS EVEN WORK!!!!!!!!


Connecting the Dots between SOP and POS

𝐅=𝐀 ഥ 𝐂ത + 𝐀𝐁
ഥ 𝐁𝐂 + 𝐀𝐁 ഥ 𝐂 + 𝐀𝐁𝐂ത + 𝐀𝐁𝐂 𝐅ത = 𝐀
ഥ𝐁ഥ 𝐂ത + 𝐀
ഥ𝐁 ഥ 𝐁𝐂ത
ഥ𝐂 + 𝐀

• Now we have the SOP expression of the complement of the function:


𝐅ത = 𝐀ഥ𝐁ഥ 𝐂ത + 𝐀
ഥ𝐁 ഥ 𝐁𝐂ത
ഥ𝐂 + 𝐀
• This means we have converted the 0s of the function 1s and vice versa.
• What if we turn the 0s back to 1, that is we convert Fത to F
Connecting the Dots between SOP and POS
𝐅ത = 𝐀
ഥ𝐁ഥ 𝐂ത + 𝐀
ഥ𝐁 ഥ 𝐁𝐂ത
ഥ𝐂 + 𝐀

• Now to convert the 0s back to 1s we complement Fത that is Fധ .


𝐅ധ = 𝐀
ഥ𝐁ഥ 𝐂ത + 𝐀ഥ𝐁ഥ𝐂 + 𝐀ഥ 𝐁𝐂ത
𝐅=𝐀 ഥ𝐁ഥ 𝐂ത ∙ 𝐀
ഥ𝐁 ഥ 𝐁𝐂ത
ഥ𝐂 ∙ 𝐀
ത ∙ (𝐀 + 𝐁
𝐅 = (𝐀 + 𝐁 + 𝐂) ∙ (𝐀 + 𝐁 + 𝐂) ഥ + 𝐂)
• So we have reached the same expression of POS as we did earlier.
• SOP is the positive logic definition of the function.
• POS is the negative logic definition of the function.

What is positive logic and what is negative logic????


References
1. Thomas L. Floyd, “Digital Fundamentals” 11th edition, Prentice Hall – Pearson Education.

You might also like