Efficient algorithm for canonical Reed-Muller expansions of Boolean functions
B. Harking · IEE Proceedings E Computers and Digital Techniques · 1990
The paper presents a new method for computing all 2n canonical Reed-Muller forms (RMC forms) of a Boolean function. The method constructs the coefficients directly and no matrix-multiplication is needed. It is also usable for incompletely specified functions and for calculating a single RMC form. The method exhibits a high degree of parallelism.