We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Minimization of Switching Functions using Quine-McCluskey Method

by Vladislav Manojlovic
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 82 - Number 4
Year of Publication: 2013
Authors: Vladislav Manojlovic
10.5120/14103-2127

Vladislav Manojlovic . Minimization of Switching Functions using Quine-McCluskey Method. International Journal of Computer Applications. 82, 4 ( November 2013), 12-16. DOI=10.5120/14103-2127

@article{ 10.5120/14103-2127,
author = { Vladislav Manojlovic },
title = { Minimization of Switching Functions using Quine-McCluskey Method },
journal = { International Journal of Computer Applications },
issue_date = { November 2013 },
volume = { 82 },
number = { 4 },
month = { November },
year = { 2013 },
issn = { 0975-8887 },
pages = { 12-16 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume82/number4/14103-2127/ },
doi = { 10.5120/14103-2127 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:56:53.094678+05:30
%A Vladislav Manojlovic
%T Minimization of Switching Functions using Quine-McCluskey Method
%J International Journal of Computer Applications
%@ 0975-8887
%V 82
%N 4
%P 12-16
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The minimization of switching functions is important to reduce the original number of logic gates required to implement digital logic circuits. Quine-McCluskey algorithm is classical method for simplifying these functions which can handle any number of variables. This paper presents Quine-McCluskey algorithm for minimizing switching functions, with additional specific elements, such as starting part (that is decoding DNF form) and cost of circuit. An example of implementation of the algorithm is given too.

References
  1. Brown, S. and Vranesic, Z. 2000. Fundamentals of Digital Logic with VHDL Design, McGraw- Hill.
  2. Tomaszewski, S. , Celik, I. , Antoniqu, G. 2003. WWW-based Boolean function minimization, Int. J. Appl. Math. Comput. Sci. , Vol. 13, No. 4, 577-583.
  3. Manojlovic, V. 2013. Cubical Representation of Switching Functions, Simposium YU-INFO 2013, Kopaonik.
Index Terms

Computer Science
Information Sciences

Keywords

switching functions DNF form cubes minimization Quine-McCluskey algorithm

Powered by PhDFocusTM