Exact minimization of fixed polarity Reed-Muller expressions for incompletely specified functions
Debatosh Debnath, Tsutomu Sasao · 2000
This paper presents an exact minimization algorithm for fixed polarity Reed-Muller expressions (FPRMs) for incompletely specified functions.For an n-variable function with « unspecified minterms there are 2 n•« distinct FPRMs.A minimum FPRM is one with the fewest products.The minimization algorithm is based on the multi-terminal binary decision diagrams.Experimental results for a set of functions are shown.The algorithm can be extended to obtain exact minimum Kronecker expressions for incompletely specified functions.