Logical optimization efficiency in the synthesis of combinational circuits

Abstract

The results of the experimental comparison of minimization programs for various forms of representations of the systems of completely specified Boolean functions are described. The experiments show that the minimization programs of multilevel representations based on the Shannon expansion and decomposition are preferential when synthesizing combinational logic circuits from library elements compared to the minimization programs in a class of disjunctive normal forms.