Abstract:
A fast algorithm for finding minimum fixed-polarity Reed-Muller representation of Boolean functions and systems is suggested based on two simple operations over 2ⁿ -component Boolean vectors. The algorithm was implemented on PC Pentium 133, and it follows from the experiments that the time needed for minimizing FPRM of a system of m Boolean functions of n variables can be predicted by the formula T = k m 4^n-13 (sec) where 1 < k < 2.