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 (
Published in:
Multiple-Valued Logic, 1992. Proceedings., Twenty-Second International Symposium on
Date of Conference: 27-29 May 1992