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
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...
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?
Also, I think you forgot to include 0 and 14 in your list of minterms...?
Actually, I think I made a mistake. Is it B'C'D' + ABC' + BC'D + A'BC + ACD' + AB'C ?
ya i forgot to put in there there wud be 5 min term B'C'D'+ABC'+A'BD+BCD'+AB'C
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)
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?
does ur answer match |dw:1349874605579:dw| check the grouping..
Join our real-time social learning platform and learn together with your friends!