Generation of Fixed Polarity Arithmetic Spectra for Ternary Functions
C.C. Lozano, B.J. Falkowski · 2006
A new efficient algorithm for generating polarity matrix elements of ternary fixed polarity arithmetic transform is presented. The algorithm directly operates on the truth vector of a ternary function and it calculates the spectral coefficients of all or selected fixed polarity arithmetic expansions for the function. It is simple and works in a recursive manner. Computational cost for the new algorithm has been derived and it is shown that the new algorithm has low computational costs