Cubical CAMP for minimization of Boolean functions

Biswas, Nripendra Nath; Srikanth, Ch.; Jacob, J.

doi:10.1109/icvd.1996.489608

Cited by 2 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We employ effective heuristics *This work was done during the author's ME program to handle those classes of functions which ESPRESSO finds difficult to minimize. These heuristics are totally different from those reported earlier [6] and achieve far better results compared to previous work.…”

Section: Introductionmentioning

confidence: 48%

A fast two-level logic minimizer

Rao¹,

Jacob²

Proceedings Eleventh International Conference on VLSI Design

Self Cite

View full text Add to dashboard Cite

We present NEWMIN, an efficient cube-based algorith,m for minzmzzation of szngle Boolean functions. The salient features of the algorithm are that it does not generate all the prime cubes, and highly efficient heurastics are used to obtain a mznamal SPC cover. This leads to savzngs in computation tame and reduces the cost of the solution as well for some classes of funciions. The performance of a prototype implementation of MEIFMIN zs compared to that of ESPRESSO, the best known logic minzmizer currently available. Our algorathm efficiently handles Achilles' heel functions which ESPRESSO finds difficult. Further, as is evident from the results, XEWMIiV exhzbits better performance on several classes of functions such as parity junctions, cyclzc functions and most randomly generated functions.

show abstract

Section: Introductionmentioning

confidence: 48%