Abstract
A new method for obtaining a two-level collective minimal cover for a set of incompletely-specified switching functions $S=\{f_1,f_2,\ldots,f_n\}$ is presented. The method relies on the introduction of a single auxiliary function F whose subfunctions (restrictions) with respect to some additional auxiliary variables $y_1,y_2,\ldots,y_{n-1}$ are certain members of S . The complete sum of F has full information on the multiple-output prime implicants (MOPIs) of the set of functions S . A particularly constrained minimal cover for F contains only labeled versions of some paramount prime implicants (PPIs) of S and can be used to construct a multiple-output minimal cover for S . The present method can proceed by map, algebraic or tabular techniques, though only the map version is presented herein. This version employs a single map whose construction avoids the ANDing operations needed in the classical method, and whose size is almost one half the total size of the maps used by the classical method, and whose entries can be variable as well as constant. The minimization process is a direct two-step technique that avoids constructing the set of all PPIs as it produces only these PPIs needed in the minimal cover. Details of the method are carefully explained and illustrated via a typical example.