Optimal polarity for dual Reed-Muller expressions

Authors:
Khalid Faraj;A. E. A. Almaini
Affiliations:
Computer Science, Wajdi Institute of Technology, Jerusalem, Palestine;School of Engineering, Napier University, Edinburgh, Scotland
Venue:
EHAC'07 Proceedings of the 6th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Year:
2007

Citing 3
Cited 0

Electronic logic systems (3rd ed.)

Electronic logic systems (3rd ed.)
Easily Testable Realizations for Generalized Reed-Muller Expressions

IEEE Transactions on Computers
Improving the memory-system performance of sparse-matrix vector multiplication

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present two algorithms, which can be used in converting between product of sum (POS) and fixed polarity dual Reed_Muller (FPDRM) and find the optimal polarity for large number of variables. The first algorithm is used to compute the coefficients of FPDRM directly from the truth table of POS. This algorithm is also used to compute the coefficients of POS from FPDRM. The second algorithm will find the optimal polarity among the 2n 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.