Converting between Sums of Products & Products of Sums

  • Thread starter Thread starter bphysics
  • Start date Start date
  • Tags Tags
    Sums
bphysics
Messages
33
Reaction score
0

Homework Statement



Translate the following equation into canonical S of P form:
F = (xyz' + x'w)(yz + x'z')

Homework Equations


DeMorgan's theorem?
(x + y)' = x'y'
(xy)' = x' + y'

The Attempt at a Solution


Converting from Sum of Products to Products of Sums requires the following:
Since I utilize a truth table, I locate the false cases. Then I write the maxterms out for these false cases. The resulting equation is then negated and DeMorgan's theorem is utilized to solve for the new equation, which represents the product of sums.

I've tried to perform this process in reverse to determine the sum of products for this equation. However, I get stuck, as the equation itself is not a "perfect" product of sums -- there are products within the sums (such as xyz').

How do I handle this? Am I just confused by something here? Some examples I see involve expansion (almost like FOILing it out). Also, its my understanding that canonical form is an unsimplified representation of the equation. Is this correct?
 
Physics news on Phys.org
bphysics said:

Homework Statement



Translate the following equation into canonical S of P form:
F = (xyz' + x'w)(yz + x'z')

Homework Equations


DeMorgan's theorem?
(x + y)' = x'y'
(xy)' = x' + y'

The Attempt at a Solution


Converting from Sum of Products to Products of Sums requires the following:
Since I utilize a truth table, I locate the false cases. Then I write the maxterms out for these false cases. The resulting equation is then negated and DeMorgan's theorem is utilized to solve for the new equation, which represents the product of sums.

I've tried to perform this process in reverse to determine the sum of products for this equation. However, I get stuck, as the equation itself is not a "perfect" product of sums -- there are products within the sums (such as xyz').

How do I handle this? Am I just confused by something here? Some examples I see involve expansion (almost like FOILing it out). Also, its my understanding that canonical form is an unsimplified representation of the equation. Is this correct?

Here's a few more rules that you can use:
1. (a+b)(c+d) = ac + ad + bc + bd
2. xx'=0
3. xx=x
4. x0=0
5. yz+z'=y+z'

Note that rule 1 converts the mix of products and sums to a sum-product.

With these you don't need truth tables.:)
 
I like Serena said:
Here's a few more rules that you can use:
1. (a+b)(c+d) = ac + ad + bc + bd
2. xx'=0
3. xx=x
4. x0=0
5. yz+z'=y+z'

Note that rule 1 converts the mix of products and sums to a sum-product.

With these you don't need truth tables.:)

So why is such a "complex" method required to convert from sums of products to products of sums? Why do I need to utilize DeMorgan's theorem for this conversion?
 
bphysics said:
So why is such a "complex" method required to convert from sums of products to products of sums? Why do I need to utilize DeMorgan's theorem for this conversion?

I can't answer why - it just is.
Btw, the rules are not just abstract rules - they have meaning.
For instance, rule 2 that I gave (xx' = 0) simply says that x cannot both be true and false.

In this particular problem I do not see how you would use the laws of DeMorgan.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top