DocumentCode :
807061
Title :
An efficient method of computing generalized Reed-Muller expansions from binary decision diagram
Author :
Purwar, Suman
Author_Institution :
Dept. of Electr. Eng., MNR Eng. Coll., Allahabad, India
Volume :
40
Issue :
11
fYear :
1991
fDate :
11/1/1991 12:00:00 AM
Firstpage :
1298
Lastpage :
1301
Abstract :
An efficient method for the generation of all the 2n 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 :
Boolean functions; minimisation of switching nets; Boolean function; binary decision diagram; generalized Reed-Muller expansions; minterm values; variables; Binary decision diagrams; Boolean functions; Data structures; Testing;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.102837
Filename :
102837
Link To Document :
بازگشت