anonymous
  • anonymous
Find the minimum sum-of-products expression f(a, b, c, d) = (maxterm numbers)(1, 2, 3, 4, 9, 15) When I made a Karnaugh map for the maxterms, I came up with (B+C+D')(A+B +C')(A+B'+C+D)(A'+B'+C'+D') a) I think that's incorrect, perhaps due to my groupings of the 0's. b) If my answer is in fact correct, I can't figure out how to put it into a product of sums form. I just applied DeMorgan laws on it, but I'm not sure that's correct either. Please help? This is basically a maxterm expansion from a Karnaugh map (which I may or may not have grouped incorrectly) that I need in SOP
Engineering
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions.

anonymous
  • anonymous
Find the minimum sum-of-products expression f(a, b, c, d) = (maxterm numbers)(1, 2, 3, 4, 9, 15) When I made a Karnaugh map for the maxterms, I came up with (B+C+D')(A+B +C')(A+B'+C+D)(A'+B'+C'+D') a) I think that's incorrect, perhaps due to my groupings of the 0's. b) If my answer is in fact correct, I can't figure out how to put it into a product of sums form. I just applied DeMorgan laws on it, but I'm not sure that's correct either. Please help? This is basically a maxterm expansion from a Karnaugh map (which I may or may not have grouped incorrectly) that I need in SOP
Engineering
jamiebookeater
  • jamiebookeater
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

anonymous
  • anonymous
Maxterm(1,2,3,4,9,15)=Minterm(5,6,7,8,10,11,12,13) so as u solve POS(Maxterm) for logic zero in K map , just solve SOP(Minterm) for logic 1 for the above stated equation to get the result in SOP or get the POS form in minimized form and get its dual relation that would convert the POS to the SOP...
anonymous
  • anonymous
Okay, so are you saying to map the ones out, and take the minterm off of them? Doing that, I got B'C'D' + ABC' + BC'D + A'BC + ABC' + AB'C. Is that the correct answer to the problem?
anonymous
  • anonymous
Also, I think you forgot to include 0 and 14 in your list of minterms...?

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
Actually, I think I made a mistake. Is it B'C'D' + ABC' + BC'D + A'BC + ACD' + AB'C ?
anonymous
  • anonymous
ya i forgot to put in there there wud be 5 min term B'C'D'+ABC'+A'BD+BCD'+AB'C
anonymous
  • anonymous
also the dual is not going to give us the correct expression we can find out the SOP by the same relation Maxterm(1,2,3,4,9,15)=Minterm(0,5,6,7,8,10,11,12,13,14)
anonymous
  • anonymous
I don't think I see where A'BD would be. But I think I can see BCD' as a pair of ones. Can there be more than one correct answer?
anonymous
  • anonymous
does ur answer match |dw:1349874605579:dw| check the grouping..
anonymous
  • anonymous
Oh, I mapped it so that AB is on the top and CD is on the side. Lemme compare...
anonymous
  • anonymous
I'm still not sure how you got those pairings. I don't even have ones listed in some of those areas. We're mapping the minterms, right?
anonymous
  • anonymous
yup...the min terms (0,5,6,7,8,10,11,12,13,14)
anonymous
  • anonymous
|dw:1349875400799:dw|
anonymous
  • anonymous
That's the map I came up with. In a case like the bottom right horizontal grouping in the lowest row across, would it matter whether I grouped that one with the one on its left or right? Since it's in the middle of two 1s.
anonymous
  • anonymous
|dw:1349875843305:dw| I numbered my rows/columns.
anonymous
  • anonymous
thats why u r getting wrong answer this should be done like this .....|dw:1349875916540:dw|
anonymous
  • anonymous
So you want to avoid overlapping groups if you can?
anonymous
  • anonymous
ya if there wud be overlapping the expression obtained is not in its minimized form ....and there wud be more number of minterms in the expressions..
anonymous
  • anonymous
Okay, so the final answer is B'C'D' + ABC' + A'BD + BCD' + AB'C?
anonymous
  • anonymous
Ohhh, I see. I had that backward. That overlapping was minimizing the expression.
anonymous
  • anonymous
Yeah, that makes sense. Thank you very much for your help. I wasn't sure if I was mapping correctly or not. Makes a huge difference, lol. :)

Looking for something else?

Not the answer you are looking for? Search for more explanations.