Using Karnaugh maps to solve Boolean equations by successive elimination

Abstract

A novel Karnaugh map method for solving two-valued Boolean equations by successive elimination is presented. This method requires the construction of significantly fewer maps and is more direct than existing procedures. A feature of the method is that it distinguishes between 'don't care' and 'can't happen' conditions. The key concept that makes this method possible is the recognition of the importance of distinguishing between those don't care conditions where the value of a function is unimportant and those where the variables are constrained not to assume certain values.<>