Experimental verification of the entropy based method for minimization of switching functions on pseudo ternary decision trees

We present a new entropy based method for minimization of sum-of-product (SOP) expressions of switching functions. Unlike the recent results which utilize binary decision trees (DTs), we study the minimization procedure as a heuristic search based on information measures on the free pseudo ternary DTs. The main contribution of this paper is an experimental justification of the entropy based method that yields the extreme improvements compared to some recent results on application of information theory methods for SOP minimization of switching functions. In most cases, we obtained that the quality of minimization with our minimizer InfoMin-2 is the same as that produced by ESPRESSO package, but is often performed faster.