DocumentCode
2296172
Title
Efficient algorithm for the generation of fixed polarity quaternary Reed-Muller expansions
Author
Falkowski, Bogdan J. ; Rahardia, S.
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore
fYear
1995
fDate
23-25 May 1995
Firstpage
158
Lastpage
163
Abstract
An efficient algorithm for the generation of fixed polarity Reed-Muller expansions over Galois field GF(4) has been introduced. The polarity coefficient matrices of quaternary switching functions in Reed-Muller expansions are generated by means of recursive square matrices. The number of required addition and multiplication operations has been found advantageous in comparison to the known D.H. Green´s (199) algorithm. Fast flow diagram allowing implementation of the new algorithm in hardware has also been presented
Keywords
Galois fields; Reed-Muller codes; matrix algebra; switching functions; Galois field; fast flow diagram; fixed polarity quaternary Reed-Muller expansions; multiplication operations; polarity coefficient matrices; quaternary switching functions; recursive square matrices; CMOS logic circuits; Computational efficiency; Costs; Flow graphs; Galois fields; Hardware; Matrix converters; Minimization; Polynomials; Reflective binary codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 1995. Proceedings., 25th International Symposium on
Conference_Location
Bloomington, IN
ISSN
0195-623X
Print_ISBN
0-8186-7118-1
Type
conf
DOI
10.1109/ISMVL.1995.513525
Filename
513525
Link To Document