Fast optimization of fixed-polarity Reed-Muller expansions over GF(5) [logic design applications]

Author

Falkowski, Bogdan J. ; Lozano, Cicilia C. ; Rahardja, Susanto

Author_Institution

Sch. of Electr. & Electron. Eng., Nat. Technol. Univ., Singapore, Singapore

fYear

2004

fDate

19-22 May 2004

Firstpage

162

Lastpage

167

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.

Keywords

Galois fields; circuit optimisation; logic design; multivalued logic; parallel programming; recursive functions; FPRM expansion optimization; GF(5); fixed-polarity Reed-Muller expansions; multiple-valued logic functions; parallel programming; polarity matrix; polarity zero FPRM expansion; recursive algorithm; Circuit testing; Computational efficiency; Cost function; Galois fields; Hardware; Input variables; Logic functions; Multiaccess communication; Parallel programming;

fLanguage

English

Publisher

ieee

Conference_Titel

Multiple-Valued Logic, 2004. Proceedings. 34th International Symposium on

ISSN

0195-623X

Print_ISBN

0-7695-2130-4

Type

conf

DOI

10.1109/ISMVL.2004.1319936

Filename

1319936