Family of Fast Linearly Independent Ternary Arithmetic Transforms
B.J. Falkowski, Cheng Fu · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · 2004
In this paper, the family of fast linearly independent ternary arithmetic (LITA) transforms, which possesses fast forward and inverse butterfly diagrams, has been identified. This family is recursively defined and has consistent formulas relating forward and inverse transform matrices. The LITA transforms, which require horizontal or vertical permutations to have fast transforms are also discussed. Computational costs of the calculation for presented transforms are also discussed and compared with multipolarity ternary arithmetic transform for ternary benchmark functions.