In Search of a Better Heuristic Algorithm for Simplification of Switching Function - A Challenge to ESPRESSO

Authors

  • Subhajit Guha B.R.S College, Barrackpore
  • Uma Mitra B.R.S College, Barrackpore
  • Pinki Dey B.R.S College, Barrackpore
  • Samar Sen Sarma University of Calcutta

DOI:

https://doi.org/10.24297/ijct.v3i1b.2752

Keywords:

Minimization, Two-level logic, Prime implicant, greedy-heuristic, Arrange

Abstract

Finding minimum cost switching function is a n intractable problem. The number of prime implicant of a typical switching function is of the order of 3n [5][13]. When fitness function with respect to cost is the only goal, the existing algorithms require faces combinatorial explosion [20]. The allurement of approximation and heuristic algorithms in this area has already generated ESPRESSO algorithm. We find that our algorithm presented here is at least equal or more cost effective than the ESPRESSO algorithm. The paper shows a new approach for attainment of our claim. We hope the algorithm presented here is a new attachment to the existing state of the art technology.

Downloads

Download data is not yet available.

Author Biographies

Subhajit Guha, B.R.S College, Barrackpore

Assistant Professor, Dept. of Computer Science

Uma Mitra, B.R.S College, Barrackpore

Student, M.Sc in Computer Science, Dept. of Computer Science

Pinki Dey, B.R.S College, Barrackpore

Student, M.Sc in Computer Science, Dept. of Computer Science

Samar Sen Sarma, University of Calcutta

Professor, Dept. of Computer Science and Engg.

Downloads

Published

2012-08-01

How to Cite

Guha, S., Mitra, U., Dey, P., & Sen Sarma, S. (2012). In Search of a Better Heuristic Algorithm for Simplification of Switching Function - A Challenge to ESPRESSO. INTERNATIONAL JOURNAL OF COMPUTERS &Amp; TECHNOLOGY, 3(1), 121–126. https://doi.org/10.24297/ijct.v3i1b.2752

Issue

Section

Research Articles