Fastest linearly independent arithmetic transforms over GF(3)

B.J. Falkowski, Cheng Fu · 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). · 2003

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.

Read the paper · More papers on PaperTik