Title :
TPL extension of Sande-Tucky FFT
Author_Institution :
Supercomput. Center of Comput. Network Inf. Center, Acad. Sinica, Beijing, China
Abstract :
In this paper we use a new language - TPL (tensor product language) to compute the fast Fourier transform. It can provide good performance and portability. We detail the method and application to the FFT of TPL, and extend to Sande-Tucky FFT algorithm.
Keywords :
fast Fourier transforms; program compilers; Sande-Tucky FFT; TPL extension; performance; portability; tensor product language; Computer architecture; Concurrent computing; Fast Fourier transforms; Fourier transforms; Grid computing; Natural languages; Optimizing compilers; Packaging; Tensile stress; Thin film transistors;
Conference_Titel :
Algorithms and Architectures for Parallel Processing, 2002. Proceedings. Fifth International Conference on
Conference_Location :
Beijing, China
Print_ISBN :
0-7695-1512-6
DOI :
10.1109/ICAPP.2002.1173606
