A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm
2011
International Journal of Computer Applications
It is well known that the Karnaugh-map technique is an elegant teaching resource for academics and a systematic and powerful tool for a digital designer in minimizing low order Boolean functions. Why is the minimization of the Boolean expression needed? By simplifying the logic function, we can reduce the original number of digital components (gates) required to implement digital circuits. Therefore, by reducing the number of gates, the chip size and the cost will be reduced and the computing
doi:10.5120/1959-2621
fatcat:w3j3hsk3qjaunaoqoz65i2q6yu