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

Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2012, Vol 3, Issue 1

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.

Authors and Affiliations

Subhajit Guha, Uma Mitra, Pinki Dey, Samar Sen Sarma

Keywords

Related Articles

STABILITY OF VISCOUS FLOW IN A CURVED CHANNEL WITH RADIAL TEMPERATURE GRADIENT

In this paper, the stability of Dean’s problem in the presence of a radial temperature gradient is studied for narrow gap case. The analytical solution of the eigen value problem is obtained by using the Galerkin’s m...

DEFINING QUALITY CRITERIA IN SITUATIONAL METHOD ENGINEERING

Method engineering is a field of engineering that has been created a need expressed by engineers. These engineers faced problems in using conventional methods such as SSADM, DSDM, OOAD...In this way, Method engineering w...

Cloud based Cost Effective Resource Allocation Model for Software-as-a-service Deployments

The Cloud Computing (CC) provides access to the resources with usage based payments model. The application service providers can seamlessly scale the services. In CC infrastructure, a different number of virtual machine...

Knn And Steerable Pyramid Based Enhanced Content Based Image Retrieval Mechanism

Recently, digital content has become a significant and inevitable asset of or any enterprise and the need for visual content management is on the rise as well. There has been an increase in attention towards the automate...

The Optimal q-Homotopy Analysis Method (Oq-HAM)

In this paper, an optimal q-homotopy analysis method (Oq-HAM) is proposed. We present some examples to show the reliability and efficiency of the method. It is compared with the one-step optimal homotopy analysis method....

Download PDF file
  • EP ID EP649889
  • DOI 10.24297/ijct.v3i1b.2752
  • Views 99
  • Downloads 0

How To Cite

Subhajit Guha, Uma Mitra, Pinki Dey, Samar Sen Sarma (2012). In Search of a Better Heuristic Algorithm for Simplification of Switching Function - A Challenge to ESPRESSO. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 3(1), 121-126. https://europub.co.uk/articles/-A-649889