Fast coding for Dual Reed-Muller Expressions

In this paper, we introduced a fast transformation equations for computing the code of the Dual Reed-Muller forms from the code of the product of sums. The code of Dual Reed-Muller terms are derived without the need to generate or store the transformation matrix of the Dual Reed-Muller terms. To derive Fixed Polarity Dual Reed-Muller (FPDRM) coefficients from POS coefficients using the transformation matrix would be very costly in terms of memory and CPU time. The transformation matrix requires the construction and storing of the matrix TM" which has a size of 2" by 2" for n-variables. The experimental results for this algorithm reflect the advantages of the algorithm in terms of speed, efficiency, and storage requirement.