An efficient method of computing generalized Reed-Muller expansions from binary decision diagram
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 40 (11) , 1298-1301
- https://doi.org/10.1109/12.102837
Abstract
An efficient method for the generation of all the 2/sup n/ sets of generalized Reed-Muller (GRM) coefficients for a Boolean function f(X) of n variables using the binary decision diagram (BDD) is presented. The author describes the generation of RM coefficients from minterm values and relates them to the associated subfunctions. Examples are included to illustrate the procedure.Keywords
This publication has 8 references indexed in Scilit:
- Reed-Muller expansions of incompletely specified functionsIEE Proceedings E Computers and Digital Techniques, 1987
- Minimisation of Reed-Muller polynomials with fixed polarityIEE Proceedings E Computers and Digital Techniques, 1984
- Efficient computer method for ExOR logic designIEE Proceedings E Computers and Digital Techniques, 1983
- Mapping of Reed-Muller coefficients and the minimisation of exclusive OR-switching functionsIEE Proceedings E Computers and Digital Techniques, 1982
- Binary Decision DiagramsIEEE Transactions on Computers, 1978
- Fault Detecting Test Sets for Reed-Muller Canonic NetworksIEEE Transactions on Computers, 1975
- Easily Testable Realizations ror Logic FunctionsIEEE Transactions on Computers, 1972
- Minimization of Exclusive or and Logical Equivalence Switching CircuitsIEEE Transactions on Computers, 1970