I have a boolean expression and I need to get to the canonical forms of it (sum of minterms and product of maxterms).

In order to get an expression for the first canonical form, I need to multiply every term by (x + ~x), where x is the missing variable. Is there a similar algorithm to get to the second canonical form?


1 Answer 1


Look here, page 7: sop-pos-conversion

You can also derive them separately from the truth table. It might be easier than converting from one to the other, depending on how large the expression is.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.