Efficient algorithm for canonical Reed-Muller expansions of Boolean functions

1 January 1990

journal article
Published by Institution of Engineering and Technology (IET) in IEE Proceedings E Computers and Digital Techniques

Vol. 137 (5) , 366-370
https://doi.org/10.1049/ip-e.1990.0045

Abstract

The paper presents a new method for computing all 2ⁿ 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
ALGORITHM
CANONICAL REED-MULLER EXPANSIONS

This publication has 0 references indexed in Scilit: