POS Form Conversion
Uploaded image
POS reduction of
The given expression is:
Y (A, B, C) = ∑(0, 2, 3, 6, 7)
This is a Sum of Minterms (SOM) representation. To convert this into Product of
Sums (POS) form, we need to:
Step 1: Find the Maxterms
Since this is a 3-variable function (A, B, C), the possible minterms range from 0 to 7.
Given minterms are:
{0, 2, 3, 6, 7}
That means the function is 1 at these minterms. So the function is 0 at the remaining
minterms:
{1, 4, 5}
These correspond to the maxterms used in POS form.
Step 2: Write the Maxterms
We write a maxterm for each of the indices where the function is 0:
Index A B C Maxterm
1 0 0 1 A + B + ¬C
4 1 0 0 ¬A + B + C
1/11
Index A B C Maxterm
5 1 0 1 ¬A + B + ¬C
Step 3: Final POS Expression
Y (A, B, C) = (A + B + C ) ⋅ (A + B + C) ⋅ (A + B + C )
Let me know if you want it simplified further using Boolean algebra or K-map
method.
yes please
Great! Let's simplify the POS expression using Boolean algebra and then verify it
with a K-map.
🔹 Given POS Expression:
Y (A, B, C) = (A + B + C )(A + B + C)(A + B + C )
🔹 Step 1: Observe common terms
All three terms have B in common:
(A + B + C )
(A + B + C)
(A + B + C )
Each contains B , so we factor:
2/11
Y = B ⋅ (A + C ) ⋅ (A + C) ⋅ (A + C )
🔹 Step 2: Simplify the remaining part
Now simplify:
(A + C )(A + C)(A + C )
Let’s denote this part as E , i.e.
E = (A + C )(A + C)(A + C )
Step 2.1: First, multiply first two terms:
(A + C )(A + C) = AA + AC + CA + C C = 0 + AC + AC + 0 = AC + AC
Now multiply the result with the last term:
(AC + AC )(A + C )
Use distributive property:
= AC(A + C ) + AC (A + C )
First term:
AC(A + C ) = AC A + AC C = 0 + AC C = 0
Second term:
AC (A + C ) = AC
So the entire expression simplifies to:
E = AC
🔹 Final Simplified Expression:
Y =B⋅A⋅C
3/11
✅ Final Answer:
Y =B⋅A⋅C
🔍 Optional Verification via K-map?
Let me know if you'd like me to verify this with a truth table or K-map for full
confidence.
k map
Let's verify the simplification using a 3-variable K-map for the function
Y (A, B, C) = ∑(0, 2, 3, 6, 7)
🔹 Step 1: 3-variable K-map Layout
We arrange the K-map with variables A (rows), and BC (columns in Gray code order):
less
BC
00 01 11 10
A
0| 0 1 3 2
1| 4 5 7 6
Now mark 1's at the minterms:
Minterms: 0, 2, 3, 6, 7
🔹 Step 2: Fill the K-map
4/11
A \ BC 00 01 11 10
0 1 1 1 1
1 0 0 1 1
🔹 Step 3: Group the 1s
We try to form the largest possible groups of 1s in sizes of 2, 4, or 8.
Group 1: Top row all 1s → covers minterms 0, 1, 2, 3 → this is not valid because
minterm 1 is not included
Try smaller groups:
✅ Group A: minterms 2, 3 (Row A=0, columns 10 and 11)
→ A=0 → A
→ Column 10 (C=0), 11 (C=1) → C changes → not used
→ B=1 constant → B
→ Term: AB
✅ Group B: minterms 6, 7 (Row A=1, B=1, C=0 and 1)
→ A=1 → A
→ B=1 → B
→ C varies → not used
→ Term: AB
✅ Group C: minterm 0 alone (A=0, B=0, C=0)
→ Write as product of literals: A ⋅ B ⋅C
🔹 Step 4: K-map Expression from Groups
From the groups:
Y = AB + AB + ABC
This is Sum of Products (SOP) form.
5/11
Now check if this is logically equivalent to our simplified POS form:
Y =B⋅A⋅C
Let’s plug into a truth table and verify.
🔹 Step 5: Truth Table Comparison
SOP POS Output
A B C Minterm # Output (B·¬A·¬C)
0 0 0 0 1 1
0 0 1 1 0 0
0 1 0 2 1 1
0 1 1 3 1 0
1 0 0 4 0 0
1 0 1 5 0 0
1 1 0 6 1 0
1 1 1 7 1 0
✅ The simplified POS expression Y = BAC only covers minterms 0 and 2, but the
original function covers 0, 2, 3, 6, 7.
⚠️ Correction:
Earlier algebraic simplification was incomplete — we missed capturing all required
minterms. So:
POS simplified to Y = (A + B + C )(A + B + C)(A + B + C )
is already in its minimal POS form.
6/11
✅ Final Verified Answer:
Y (A, B, C) = (A + B + C ) ⋅ (A + B + C) ⋅ (A + B + C )
Let me know if you'd like a K-map diagram or LaTeX-formatted table!
i want minimal POS conical form
Thanks for the clarification! Let's walk step by step to derive the Minimal POS
Canonical Form for the function:
🔹 Given:
Y (A, B, C) = ∑ m(0, 2, 3, 6, 7)
To express this in Minimal POS (Canonical) Form, we:
1. Convert the minterms to maxterms, which are the complement minterms.
2. Write each maxterm as a sum (OR) of literals.
3. Combine all maxterms in a product (AND).
🔹 Step 1: List of Maxterms
For 3 variables, total minterms = 8
Minterms given (where Y = 1):
{0, 2, 3, 6, 7}
So, function is 0 at:
{1, 4, 5}
These are our Maxterms.
7/11
🔹 Step 2: Write Canonical Maxterms
Each maxterm is written by:
Using 1 → complemented literal
Using 0 → uncomplemented literal
Decimal A B C Maxterm (Sum of literals)
1 0 0 1 A+B+C
4 1 0 0 A+B+C
5 1 0 1 A+B+C
🔹 Step 3: Minimal POS Canonical Form
Y (A, B, C) = (A + B + C )(A + B + C)(A + B + C )
✅ This is already canonical and minimal — each term corresponds directly to a
maxterm where the function is 0.
Would you like a K-map diagram, truth table, or conversion to SOP as well?
Distributive law for both SOP and POS
Great question, Vinay! Let's clearly understand the Distributive Law for both Sum of
Products (SOP) and Product of Sums (POS) forms in Boolean Algebra.
🔹 1. Distributive Law in Boolean Algebra
8/11
There are two main forms of distributive laws:
A. For SOP:
A(B + C) = AB + AC
You distribute AND over OR (like in regular algebra).
This is the most commonly used in SOP simplification.
B. For POS:
A + (BC) = (A + B)(A + C)
You distribute OR over AND (reverse of regular algebra).
🔹 2. SOP: Distributive Law (AND over OR)
Example:
A(B + C) = AB + AC
You're distributing A over (B + C) :
A B C B+C A(B+C) AB
0 0 0 0 0 0
0 0 1 1 0 0
0 1 0 1 0 0
0 1 1 1 0 0
1 0 0 0 0 0
1 0 1 1 1 0
1 1 0 1 1 1
9/11
A B C B+C A(B+C) AB
1 1 1 1 1 1
✅ Confirmed: A(B + C) = AB + AC
🔹 3. POS: Distributive Law (OR over AND)
Example:
A + (BC) = (A + B)(A + C)
You're distributing A over (BC) :
A B C BC A + BC A+B
0 0 0 0 0 0
0 0 1 0 0 0
0 1 0 0 0 1
0 1 1 1 1 1
1 0 0 0 1 1
1 0 1 0 1 1
1 1 0 0 1 1
1 1 1 1 1 1
✅ Confirmed: A + BC = (A + B)(A + C)
🔹 4. Summary Table
10/11
Distributive Type Formula Used In
AND over OR A(B + C) = AB + AC SOP
OR over AND A + (BC) = (A + B)(A + C) POS
Let me know if you want real examples of SOP and POS using this law, or if you'd like
to practice problems with step-by-step logic gates or K-maps!
11/11
