Abstract: The Quine-McCluskey method is one of the popular method and is particularly used when both karnaugh method and variable entrant map (VEM) approach fails, it is useful in minimizing logic expressions for larger number of variables when compared with minimization by Karnaugh Map or Boolean algebra. It was developed in 1956 by Edward J.MC Cluskey. Karnaugh map could solve only for smaller variables whereas Quine Mc- Cluskey can solve for higher variables. Compared to other techniques, QM method is more executable and can handle more variables. The digital gates are basic electronic component of any digital circuit. Digital circuit should be simplified to reduce its cost by reducing number of digital gates required to implement it. To achieve this, we use Boolean expression that helps in obtaining minimum number of terms and does not contain any redundant pair. Karnaugh map (K-map) and Quine-McCluskey(QM) methods are well known methods to simplify Boolean expression. K-map method becomes complex beyond five variable Boolean expression. Minimization of Boolean function is able to optimize the algorithms and circuits. Optimization to Quine-McCluskey Method increases its performance by reducing number of comparisons between minterm list in determination of prime implicants. Modified Quine-McCluskey method (MQM) can be implemented to any number of variables. The concept that runs behind Quine McCluskey is the combining method approach. It has easy algorithm than Karnaugh, so it is efficient and can be easily implemented in computer algorithms.

Keywords: Quine mc-cluskeey algoritm, Xilinx ISE software, Filed programmable gate array FPGA, Karnaugh map, higher or larger variables.

| DOI: 10.17148/IARJSET.2021.8760