Title :
Fastest linearly independent arithmetic transforms over GF(3)
Author :
Falkowski, Bogdnn J. ; Fu, Cheng
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
Abstract :
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.
Keywords :
computational complexity; digital arithmetic; matrix algebra; nonlinear filters; transforms; computational complexity; computational costs; fastest ternary linearly independent arithmetic transforms; forward butterfly diagrams; forward transform matrices; inverse butterfly diagrams; inverse transform matrices; nonlinear filtering; recursive family; Algebra; Arithmetic; Computational complexity; Computational efficiency; Filtering; Galois fields; Logic functions; Multivalued logic; Polynomials; Stochastic processes;
Conference_Titel :
Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on
Print_ISBN :
0-7803-7663-3
DOI :
10.1109/ICASSP.2003.1202455
