Computation of Reed-Muller expansions of incompletely specified Boolean functions from reduced representations

Reed-Muller canonical networks are known to be easily testable implementations of logical functions. The authors present a procedure to synthesise minimal 0th polarity Reed-Muller networks for incompletely specified Boolean functions. They also present a procedure that uses reduced representations of Boolean functions in the form of logical covers to synthesise Reed-Muller networks. The latter procedure avoids exponentially long minterm representations, and hence alleviates some of the difficulties in applying spectral synthesis procedures to large Boolean functions. Both of these procedures are suitable for automation.