Title :
Efficient algorithm for canonical Reed-Muller expansions of Boolean functions
Author_Institution :
Abteilung Inf., Dortmund Univ., West Germany
fDate :
9/1/1990 12:00:00 AM
Abstract :
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.
Keywords :
Boolean functions; Boolean functions; algorithm; canonical Reed-Muller expansions;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings E
