Find the minimum-cost Sum of Products and Product of Sums forms for the function: f(x1,x2,x3( = m(1,2,3,5)
I know how to get the truth table etc. But they want me to use a karnaugh map to get the answer. How?
Find the minimum-cost Sum of Products and Product of Sums forms for the function: f(x1,x2,x3( = m(1,2,3,5)
I know how to get the truth table etc. But they want me to use a karnaugh map to get the answer. How?
How do you measure the cost of a Boolean expression? There are several ways to do it. Also, there is no way around learning how to use Karnaugh maps. If you need a reference or have concrete questions about how they work, feel free to ask, but we can't learn Karnaugh maps for you.