COLUMN POLARITY MATRIX ALGORITHM FOR TERNARY FIXED POLARITY REED-MULLER EXPANSIONS

摘要

A new algorithm that efficiently calculates fixed polarity Reed-Muller (FPRM) expansions for ternary functions is presented in this paper. The algorithm starts from the truth vector representation of a ternary function and recursively generates all elements of the input function's polarity matrix. Computational costs for this algorithm are derived and they are smaller than in other existing methods for generating the complete polarity matrix when n ≤ 3.