Generalized Karnaugh Map Method for Boolean Functions of Many Variables
V.C. Prasad · IETE Journal of Education · 2017
Karnaugh map method is a popular method for minimization of Boolean functions. It is widely used for four variables. But it is hardly used beyond six variables. In this paper, a tree of Karnaugh maps called generalized Karnaugh map is proposed. This map can be constructed for any number of variables and analysed systematically to generate all prime implicants by going through only one map of 16 squares at a time. A concept called ‘K–don't cares’ is used for this purpose. K–don't cares can be simplified if we do not insist on all prime implicants. Interestingly the new method requires no more than 16 minterms at a time. A seven-variable example is solved to illustrate the method.