An Extensive Karnaugh Mapping Tool for Boolean Expression Simplification

The fundamental concept in the design of digital circuits is to reduce the complexity of hardware, make a circuit as simple as possible, which also reduces costs. For obtaining this, we use boolean expression to achieve a lowest possible number of terms and do not encompass any obsolete couple. Karnaugh Map (K-map) and Quine-McCluskey (QM) approach are the most popular specific methods to simplify the Boolean expressions. In this research paper, we have developed an extensive Karnaugh mapping tool which overcomes the existing research's limitation in this related area. We have simultaneously considered to ensure that, our extensive K mapping tool is made easier for primary level digital logic design learners where they can operate with a big number of variables, and run time is optimal. We have implemented the algorithm and the performance evaluation results carried out by making a comparison with C-Minimizer Algorithm and shows that, our extensive K mapping tool outperforms existing approaches in terms of computation time and the percentage of relative error is much lower(2 %) which is fulfilled the satisfactory level.