A New Method for Boolean Function Simplification
Maher A. Nabulsi, Ahmad AA Alkatib, Fatima M. Quiam · International Journal of Control and Automation · 2017
The Karnaugh map technique is the most common technique for academic teaching and can be used by digital designers to minimize Boolean functions to simpler forms.Simplifying functions are necessary for reducing the number of used gates (digital components) in the digital circuits, which reflect the chip size, cost, power, and speed.The K-map technique was proposed by M. Karnaugh.Later, Quine and McCluskey reported tabular algorithmic techniques for Boolean function minimization.Then, many computer-aided modelling languages, such as object-oriented and design packages, were proposed.Minimization of digital switching functions is a classical problem, but certainly not a dead one.This paper provides a systematic and simple technique for the simplification of logical functions, which effectively reduces the time and unnecessary manipulation comparisons with individual Karnaugh-map minimization methods.The paper reveals that simplification can be accomplished based on the combination of minterms using only a truth table by following simple rules.