algorithmbooleanboolean-expressiondigital-logicboolean-algebra

Boolean expression in SOP

I'm new to boolean expressions.

I've been given the task to simplify F(w,x,y,z) = xy’ + x’z’ + wxz + wx’y by using K map.

I've done it and the result is wx’+w’y’+xyz.

Now I have to "Write it in a standard SOP form. You need to provide the steps through which you get the standard SOP".

And i have no idea how to do it. I thought result after k map is sop.

Solution

  • Yes, you already have it in SOP form. But the second question is about Standard (aka canonical) SOP form. That's much simpler to find than having to use K-maps (but it's often long), it's just the sum of minterms.