Abstract
An efficient algorithm for optimization of fixed-polarity Reed-Muller (FPRM) expansions over GF(5) is developed in this paper. The new algorithm operates on FPRM expansion in polarity zero of a five-valued function and completely generates its FPRM polarity matrix to obtain its best FPRM expansion. Due to the simplicity and recursive nature of the algorithm, it can be implemented efficiently using fast parallel programming. This, together with low computational cost, enhances the effectiveness of this algorithm, as shown by the presented experimental results. The proposed algorithm can also be utilized to derive FPRM expansions in specific polarities without first constructing the complete polarity matrix.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
