📞 +91-7667918914 | ✉️ iarjset@gmail.com
International Advanced Research Journal in Science, Engineering and Technology
International Advanced Research Journal in Science, Engineering and Technology A Monthly Peer-Reviewed Multidisciplinary Journal
ISSN Online 2393-8021ISSN Print 2394-1588Since 2014
IARJSET aligns to the suggestive parameters by the latest University Grants Commission (UGC) for peer-reviewed journals, committed to promoting research excellence, ethical publishing practices, and a global scholarly impact.
← Back to VOLUME 8, ISSUE 5, MAY 2021

Implementation of Quine Mc-Cluskey Method on FPGA

Sunil Kumar G R, Ayesha Rosheen, Bindu J, Chaithra V M

👁 1 view📥 0 downloads
Share: 𝕏 f in

Abstract: In this paper the Quine Mc-Cluskey method is used for minimization of Boolean functions. The Quine-Mc-Cluskey 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. The concept that runs behind Quine Mc-Cluskey is the combaining method approach. It has easy algorithm than Karnaugh, so it is efficient and can be easily implemented in computer algorithms.

Keywords: Quine Mc-Cluskey, FPGA, Hardware implementation, Karnaugh map

How to Cite:

[1] Sunil Kumar G R, Ayesha Rosheen, Bindu J, Chaithra V M, “Implementation of Quine Mc-Cluskey Method on FPGA,” International Advanced Research Journal in Science, Engineering and Technology (IARJSET), DOI: 10.17148/IARJSET.2021.8533

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License.