Simplification of the Covering Problem for Multiple Output Logical Networks

This paper is concerned with the problem of determining diode optimal representations for two levels of logic with multiple inputs and multiple outputs. Previous papers by the authors and others have formulated algorithms for obtaining optimal representations. However, the linear integer programming problem obtained is often prohibitively large. In the present paper, methods for reducing the size of the problem before and after expanding into the linear integer format are presented. These methods insure that at least one optimal representation for the system is retained after each reduction. Examples are given.