On the minimization of SOPs for bi-decomposition functions
説明
A function f is AND bi-decomposable if it can be written as f(X/sub 1/,X/sub 2/)=h/sub 1/(X/sub 1/)h/sub 2/(X/sub 2/). In this case, a sum-of-products expression (SOP) for f is obtained from minimum SOPs (MSOP) for h/sub 1/ and h/sub 2/ by applying the law of distributivity. If the result is an MSOP, then the complexity of minimization is reduced. However, the application of the law of distributivity to MSOPs for h/sub 1/ and h/sub 2/ does not always produce an MSOP for f. We show an incompletely specified function of n(n-1) variables that requires at most n products in an MSOP, while 2/sup n-1/ products are required by minimizing the component functions separately. We introduce a new class of logic functions, called orthodox functions, where the application of the law of distributivity to MSOPs for component functions of f always produces an MSOP for f. We show that orthodox functions include all functions with three of fewer variables, all symmetric functions, all unate functions, many benchmark functions, and few random functions with many variables.
収録刊行物
-
- Proceedings of the 2001 conference on Asia South Pacific design automation - ASP-DAC '01
-
Proceedings of the 2001 conference on Asia South Pacific design automation - ASP-DAC '01 219-224, 2001-01-01
ACM Press