Minimization of Logic Networks Under a Generalized Cost Function.

摘要

Based on the intuitive observation that smaller numbers of gates and connections would usually lead to a more compact network on an integrated circuit, a monotonically increasing function of gate count and connection count is concluded to be a reasonable cost function to be minimized in logical design of a network implemented in IC. Then it is shown that all minimal solutions of such a cost function can be always found among the following:minimal networks with a minimal number of gates as the first objective and a minimal number of connections as the second objective;minimal networks with a minimal number of connections as the first objective and a minimal number of gates as the second objective;and minimal networks which are associated to the above two types of minimal networks.