TPL extension of sande-tucky FFT

Hai Huang · 2003

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.

Read the paper · More papers on PaperTik