By Topic

Efficient algorithm for the generation of fixed polarity quaternary Reed-Muller expansions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Falkowski, B.J. ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore ; Rahardia, S.

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

Published in:

Multiple-Valued Logic, 1995. Proceedings., 25th International Symposium on

Date of Conference:

23-25 May 1995