Using k-map simplify the boolean function:
f(w, x, y, z) = [tex]\prod[/tex](1, 3, 4, 5, 7, 11, 12, 13, 15)
into sum of products form
product of sums form
implement using nand gates
The Attempt at a Solution
I have the k-map, I understand that part. What I don't understand is how to extract the boolean function from the k-map. The NAND gates part I'm clueless on.
I'm studying for a test and this is a random example problem. I would thoroughly appreciate a walk-through.
Also, for a different question, how do I extract a boolean function from a circuit drawing? Meaning, there are 4 XOR's, leading to 2 AND's, leading to 1 AND.How do I create a boolean function by looking at that drawing?