The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1991 vol.40)
pp: 1298-1301
ABSTRACT
<p>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.</p>
INDEX TERMS
generalized Reed-Muller expansions; binary decision diagram; Boolean function; variables; minterm values; Boolean functions; minimisation of switching nets.
CITATION
S. Purwar, "An Efficient Method of Computing Generalized Reed-Muller Expansions from Binary Decision Diagram", IEEE Transactions on Computers, vol.40, no. 11, pp. 1298-1301, November 1991, doi:10.1109/12.102837
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool