DocumentCode
2089702
Title
A new algorithm to compute quaternary Reed-Muller expansions
Author
Rahardja, Susanto ; Falkowski, Bogdan J.
Author_Institution
Centre for Signal Process., Nanyang Technol. Univ., Singapore
fYear
2000
fDate
2000
Firstpage
153
Lastpage
158
Abstract
A new algorithm to construct a full polarity matrix for n-variable quaternary Reed-Muller expansions has been introduced. The new algorithm directly utilizes the truth vector of the function to construct the polarity matrix. The computational complexity of the algorithm is analyzed and compared with other existing algorithms. It is shown that for n⩽6, the new algorithm is computationally more efficient than all existing algorithms. Finally the fast flow diagram which is useful for implementation of the algorithm in hardware has also been shown
Keywords
Reed-Muller codes; computational complexity; multivalued logic; Reed-Muller expansions; computational complexity; full polarity matrix; quaternary Reed-Muller expansions; truth vector; Algorithm design and analysis; Circuit testing; Computational complexity; Computational efficiency; Galois fields; Hardware; Logic testing; Polynomials; Switching circuits;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on
Conference_Location
Portland, OR
ISSN
0195-623X
Print_ISBN
0-7695-0692-5
Type
conf
DOI
10.1109/ISMVL.2000.848614
Filename
848614
Link To Document