DocumentCode :
2832017
Title :
On the calculation of generalized Reed-Muller canonical expansions from disjoint cube representation of Boolean functions
Author :
Falkowski, Bogdan J. ; Perkowski, Marek A.
Author_Institution :
Dept. of Electr. Eng., Portland State Univ., OR, USA
fYear :
1990
fDate :
12-14 Aug 1990
Firstpage :
1131
Abstract :
An algorithm that converts disjoint cube representation of Boolean functions into fixed-polarity generalized Reed-Muller expansions (GRME) is presented. Since the known fast algorithm that generates the GRME based on the factorization of the Reed-Muller transform matrix always start from the truth table (minterm) of Boolean function, then the described method has an advantage due to smaller required computer memory. Moreover, for the Boolean functions described by only a few disjoint cubes the method is much more efficient than the fast algorithm
Keywords :
Boolean functions; matrix algebra; Boolean functions; disjoint cube representation; fixed-polarity expansions; generalized Reed-Muller canonical expansions; transform matrix; Boolean algebra; Boolean functions; Circuit faults; Circuit testing; Digital signal processing; Galois fields; Input variables; Logic design; Matrix converters; Signal processing algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1990., Proceedings of the 33rd Midwest Symposium on
Conference_Location :
Calgary, Alta.
Print_ISBN :
0-7803-0081-5
Type :
conf
DOI :
10.1109/MWSCAS.1990.140925
Filename :
140925
Link To Document :
بازگشت