An Efficient Method of Computing Generalized Reed-Muller Expansions from Binary Decision Diagram

Authors:
Suman Purwar
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1991

Citing 0
Cited 6

Forward and Inverse Transformations Between Haar Spectra and Ordered Binary Decision Diagrams of Boolean Functions

IEEE Transactions on Computers
Expert System Hardware for Fault Detection

Applied Intelligence
Generation of all Reed-Muller Expansions of a Switching Function

IEEE Transactions on Computers
Novel synthesis and optimization of multi-level mixed polarity Reed-Muller functions

Journal of Computer Science and Technology
A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields

IEEE Transactions on Computers
New considerations for spectral classification of boolean switching functions

VLSI Design

Quantified Score

Hi-index	14.99

Visualization

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.