In this paper, the family of fastest ternary linearly independent arithmetic transforms, which possesses forward and inverse butterfly diagrams with lowest computational complexity have been identified. This family is recursively defined and has consistent formulas relating forward and inverse transform matrices. Computational costs of the calculation for presented transforms are also discussed.
['Bogdan J. Falkowski', 'Cheng Fu']
Fastest linearly independent arithmetic transforms over GF(3)