Using variable-entered karnaugh maps to solve boolean equations

Abstract

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 is superior in efficiency and simplicity to methods employing Marquand diagrams or Conventional Karnaugh maps; it requires the construction of significantly smaller maps and produces such maps in a minimization-ready form. Moreover, the method is applicable to general Boolean equations and is not restricted to the two-valued case. Details of the method are carefully explained and then illustrated via a classical example.

Keywords:

• Boolean equations
• Subsumptive solution
• Minimal covers for Boolean functions
• Successive elimination
• Variable-entered Karnaugh maps
• Map folding

C.R. Categories:

• B6.3