Liang Gu
ABSTRACT
Fast Fourier Transform in the West(FFTW) is one of the most successful adaptive Discrete Fourier Transform(DFT) libraries. The high-performance of FFTW mostly derives from its empirical search engine that includes all major DFT algorithms. We propose an adaptive model-driven FT performance prediction technique to replace the empirical search engine in FFTW. Our model achieves over 94% of the DFT performance and uses less than 5% of the search time compared with FFTW Exhaustive search on four test platforms.
- M. Frigo and S. G. Johnson. The design and implementation of fftw3. Proceeding of the IEEE, 93(2):216--231, February 2005.Google Scholar
Cross Ref
- M. Püschel and J. M. F. M. etc. SPIRAL: Code generation for DSP transforms. Proceedings of the IEEE, 93(2):232--275, 2005.Google ScholarCross Ref
- R. Saavedra and A. Smith. Analysis of benchmark characteristics and benchmark performance prediction. ACM Transactions on Computer Systems (TOCS), 14(4):344--384, 1996. Google ScholarDigital Library
Index Terms
- Performance modeling for DFT algorithms in FFTW
Recommendations
DFT performance prediction in FFTW
LCPC'09: Proceedings of the 22nd international conference on Languages and Compilers for Parallel ComputingFastest Fourier Transform in the West (FFTW) is an adaptive FFT library that generates highly efficient Discrete Fourier Transform (DFT) implementations. It is one of the fastest FFT libraries available and it outperforms many adaptive or hand-tuned DFT ...
Generalising the simultaneous computation of the DFTs of two real sequences using a single N-point DFT
A general approach to the problem of simultaneous computation of the discrete Fourier transform (DFT) of two sequences of length N, which may be real, imaginary, conjugated symmetric or conjugated anti-symmetric, using a single N-point DFT of a complex ...
Index Mapping Approach of Deriving the PM DFT Algorithms
Recently, it has been shown that radix-2 DFT algorithms can be designed based on vector representation of data providing several advantages [6], [7], [8]. In this paper, an index mapping approach is used to derive these algorithms. This approach makes ...
Comments