Optimal expression for fixed polarity dual Reed-Muller forms.

Faraj, Khalid; Almaini, A E A

Abstract

An algorithm for converting between products of sum (POS) and fixed polarity dual Reed-Muller (FPDRM) is proposed in this paper. This algorithm is used to compute the coefficients of POS from FPDRM directly from the truth table of POS. This algorithm is also used to compute the coefficients of POS from FPDRM. Another algorithm is presented in this paper to find the optimal polarity.The most popular minimization criterion of the dual Reed-Muller form is obtained by exhaustive search of all the polarity vectors. Another exhaustive method for dual Reed-Muller expressions is presented. This algorithm will find the optimal polarity among the 2" different polarities for large n-variable functions, without generating all of the polarity sets. This algorithm is based on separating the truth vector of POS and the use of sparse techniques, which will lead to the optimal polarity. Time efficiency and computing speed are thus achieved in this technique.

Citation

Faraj, K., & Almaini, A. E. A. (2007). Optimal expression for fixed polarity dual Reed-Muller forms. WSEAS Transactions on Circuits and Systems, 6, 364-371

• Journal Article Type: Article
• Publication Date: 2007-03
• Deposit Date: May 1, 2009
• Print ISSN: 11092734
• Publisher: World Scientific and Engineering Academy and Society
• Peer Reviewed: Peer Reviewed
• Volume: 6
• Pages: 364-371
• Keywords: Computer algorithms; Logic; Switching theory; Optimization; Reed-Muller forms; Fixed polarity; Polarity vectors
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/2556