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
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