Efficient solution of boolean equations using variable-entered karnaugh maps

Abstract EN

A new method for obtaining a compact subsumptive general solution of a system of Boolean equations is presented.

The method relies on the use of the variable-entered Karnaugh map (VEKM) to achieve successive elimination through successive map folding.

It also makes an artificial distinction between don’t-care and can’t-happen conditions.

Therefore, it is highly efficient as it requires the construction of maps that are both significantly fewer and significantly smaller than those required by classical methods.

Moreover, the method is applicable to general Boolean equations and is not restricted to the twovalued case.

Details of the method are formally justified, carefully explained and further demonstrated via an illustrative example.