Polarization of Functions when Minimizing of Boolean Nets

The results of an experimental study of a program for technologically Independent minimization of multilevel representations of systems of fully defined functions in the form of Boolean nets, which are based on Shannon expansions of systems of disjunctive normal forms (DNF) of Boolean functions, are described. The main attention is paid to the effectiveness of using the choice of the best (in terms of the number of literals of Boolean variables) function polarization option when minimizing of Boolean nets. Polarization refers to the choice of an inverse or conventional form of assignment of each of the system functions. For minimized polarized Boolean nets, logic circuits are synthesized in the design library of digital ASIC (Application-Specific Integrated Circuits). The obtained results are compared in terms of crystal area and speed (time delay) with the synthesis results for minimized unpolarized Boolean nets and for jointly and separately minimized Boolean nets built using polarized DNF systems.