Processor-farm model for parallel computation of fixed-polarity Reed-Muller expansions

A Reed-Muller logic function is usually derived from a given Boolean expression by applying an appropriate conversion technique. Existing conversion algorithms are sequential in nature and are inefficient when the number of variables is large. We propose a processor-farm paradigm which allows the conversion to be performed by a few processors in a parallel and efficient manner.