Estimation and Implementation of Boolean Function Using Gates, K-Map & Quine-McCluskey

An algorithm to estimation and implementation of a boolean function using a gate is an important activity in designing the digital circuits. This minimization reduces the size and cost of these systems and the performance can be improved. There are some well established methods for doing these simplifications. Two important methods are known as Karnaugh map (K-map) method and Modified Quine-McCluskey (M Q-M) method.

In the present work an object-oriented algorithm is proposed for simplification of Boolean function through Quine-McCluskey method. Also this proposed model can be implemented for more then 64 variable.