Functional decomposition for universal logic cells using substitution

Known synthesis tools with a strong relationship to a library of gates lead to poor results for target architectures based on universal logic cells as basic elements. The authors present an algorithm which uses function substitution in-order to minimize the costs of the decomposed function. Experimental results show an high degree of improvement over other existing synthesis programs.<
>