Fast conversion algorithm for very large Boolean functions

Fixed polarity Reed-Muller (FPRM) expressions are alternatives to the traditional sum-of-products forms (SOPs) for the representation of Boolean functions. A fast algorithm is proposed to convert from SOPs to FPRM forms without generating disjoint cube covers or functional decision diagrams (FDDs). This procedure is based on the property of input redundancy and is tailored for very large multiple output Boolean functions. Test results for benchmark examples of up to 199 inputs and 99 outputs are given