Optimization of the Quine-McCluskey Method for the Minimization of the Boolean Expressions

The basic principle in designing digital circuit hovers around reducing the required hardware thus reducing the cost too. To achieve this, we use Boolean expression that helps in obtaining minimum number of terms and does not contain any redundant pairs. The conventional methods for the minimization of the Boolean expressions are K-Map method and the . The minimized expressions are used to design digital circuits. Since K-Map method gets exceedingly complex when the number of the variable exceed six, hence Quine-McCluskey tabulation method scores over this and is widely used .In the following paper we present optimized Quine- McCluskey method that reduces the run time complexity of the algorithm by proposing an efficient algorithm for determination of Prime Implicants.