A method for computing Reed-Muller expansions for multivalued logic functions is presented. All coefficients are constructed directly without the use of matrix multiplication. Due to the high degree of parallelism, the complexity of the algorithm in terms of the area-time tradeoff (AT/sup 2/) yields a better result than a butterfly algorithm does. >
['Berthold Harking', 'Claudio Moraga']
Efficient derivation of Reed-Muller expansions in multiple-valued logic systems