DocumentCode :
2971648
Title :
Properties and hardware implementation of new fastest linearly independent ternary arithmetic transforms
Author :
Lozano, Cicilia C. ; Falkowski, Bogdan J.
Author_Institution :
Nanyang Technol. Univ., Singapore
fYear :
2007
fDate :
10-13 Dec. 2007
Firstpage :
1
Lastpage :
5
Abstract :
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.
Keywords :
polynomials; transforms; computational complexity; forward transformation; hardware implementation; linearly independent ternary arithmetic transforms; modular tree structure; polynomial expansion; reverse transformation; Algebra; Arithmetic; Computational complexity; Fault detection; Galois fields; Hardware; Logic testing; Polynomials; Stochastic processes; Tree data structures;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information, Communications & Signal Processing, 2007 6th International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-0982-2
Electronic_ISBN :
978-1-4244-0983-9
Type :
conf
DOI :
10.1109/ICICS.2007.4449581
Filename :
4449581
Link To Document :
بازگشت