CFP last date
20 December 2024
Reseach Article

C – Minimizer Algorithm: A New Technique for Data Minimization

by Divya Nasa, Udayan Ghose
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 44 - Number 17
Year of Publication: 2012
Authors: Divya Nasa, Udayan Ghose
10.5120/6355-8776

Divya Nasa, Udayan Ghose . C – Minimizer Algorithm: A New Technique for Data Minimization. International Journal of Computer Applications. 44, 17 ( April 2012), 15-19. DOI=10.5120/6355-8776

@article{ 10.5120/6355-8776,
author = { Divya Nasa, Udayan Ghose },
title = { C – Minimizer Algorithm: A New Technique for Data Minimization },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 44 },
number = { 17 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 15-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume44/number17/6355-8776/ },
doi = { 10.5120/6355-8776 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:35:48.711162+05:30
%A Divya Nasa
%A Udayan Ghose
%T C – Minimizer Algorithm: A New Technique for Data Minimization
%J International Journal of Computer Applications
%@ 0975-8887
%V 44
%N 17
%P 15-19
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Digital gates are the basic components of the digital circuits. To reduce the cost of the circuit, number of these gates must be reduced, and hence a method is needed to do the desired. There are some methods such as Karnaugh maps, in which visualization becomes difficult when number of variables become more than five, and Quine McCluskey method, which overcomes the drawback of Karnaugh maps but it becomes complex when large number of variables are used. Here, in this paper, an approach, Consummate minimizer(C-minimizer) has been proposed which overcomes the limitations of such conventional methods and produces a minimized expression containing minimizing elements. The same can be used in minimizing the patterns in large data sets

References
  1. E. W. Veith, "A Chart Method for Simplifiying Truth Functions. " , Proc. of the ACM, pp. 127-133, 1952.
  2. M. Karnaugh, 'A Map Method for Synthesis of Combinational Logic Circuits', Trans. AIEE, Comm. And Electronics, Vol. 72(1), pp. 593-99, 1953.
  3. K. J. Dean, "An Extension of the use of Karnaugh Maps in the minimization of logical functions", IEEE in Radio and Electronic Engineer , vol. 35, pp 294-296, may 1968. J. Clerk Maxwell, A Treatise on Electricity and Magnetism, 3rd ed. , vol. 2. Oxford: Clarendon, 1892, pp. 68–73.
  4. W. V. Quine, "The problem of simplifiying Truth Functions", Am. Math. Montly, vol. 59(8), pp. 521-31,1952.
  5. P. W. Chandana Prasad, A. Beg, A. K. Singh," Effect of Quine-McCluskey simplification on boolean space complexity", Conference on Innovative Technologies in Intelligent Systems and Industrial Applications (CITISIA ) Monash University, Sunway campus, Malaysia, July 2009.
  6. E. J. McCluskey, "Minimization of Boolean Functions," Bell System Technical Journal, vol. 35, no. 5, pp. 1417-1444,1956.
  7. M. E. Holder," A Modi?ed Karnaugh Map Technique" IEEE Transactions on Education, vol. 48, No. 1, February 2005.
  8. Z. Yi-Shun," Determining all candidate keys based on Karnaugh Map", International Conference on information management, innovation management and industrial engineering, 2009.
  9. T. K. Jain , D. S. Kushwaha and A. K. Misra," Optimization of the Quine-McCluskey Method for the Minimization of the Boolean Expressions" Fourth International Conference on Autonomic and Autonomous Systems.
Index Terms

Computer Science
Information Sciences

Keywords

Minimization C-minimizer Algorithm Karnaugh Map Quine Mccluskey Method