Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
A Remark on Minimal Polynomials of Boolean Functions
CSL '88 Proceedings of the 2nd Workshop on Computer Science Logic
Logic Synthesis and Verification
Large-scale SOP minimization using decomposition and functional properties
Proceedings of the 40th annual Design Automation Conference
A fast method to derive minimum SOPs for decomposable functions
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
| Hi-index | 0.00 |
A function f is AND bi-decomposable if it can be written as f (X1,X2) = h1(X1)h2(X2). In this case, a sum-of-products expression (SOP) for f is obtained from minimum SOPs (MSOP) for h1 and h2 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 h1 and h2 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(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 or fewer variables, all symmetric functions, all unate functions, many benchmark functions, and few random functions with many variables.