Properties and hardware implementation of new fastest linearly independent ternary arithmetic transforms

New fastest linearly independent ternary arithmetic (LITA) transforms are presented in this paper. Fastest LITA transforms can be calculated efficiently by fast transforms and the calculation incurs low computational complexity. Formulas for the fast forward and reverse transformation of the new fastest LITA transforms are given and several of their properties are listed. A modular tree structure hardware implementation of the resulting fastest LITA polynomial expansion is also described. At the end of the paper, experimental results for the new transforms are shown.