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

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.