Five-step FFT algorithm with reduced computational complexity
暂无分享,去创建一个
[1] William H. Press,et al. Numerical recipes in C , 2002 .
[2] Martin Vetterli,et al. Fast Fourier transforms: a tutorial review and a state of the art , 1990 .
[3] Abderrezak Guessoum,et al. Fast algorithms for the multidimensional discrete Fourier transform , 1986, IEEE Trans. Acoust. Speech Signal Process..
[4] Matteo Frigo. A Fast Fourier Transform Compiler , 1999, PLDI.
[5] Z. Cvetanovic,et al. Performance Analysis of the FFT Algorithm on a Shared-Memory Parallel Architecture , 1987, IBM J. Res. Dev..
[6] Riccardo Bernardini,et al. A new technique for twiddle-factor elimination in multidimensional FFT's , 1994, IEEE Trans. Signal Process..
[7] David H. Bailey,et al. FFTs in external or hierarchical memory , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).
[8] Paul N. Swarztrauber,et al. Multiprocessor FFTs , 1987, Parallel Comput..
[9] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[10] Paul N. Swarztrauber,et al. A comparison of optimal FFTs on torus and hypercube multicomputers , 2001, Parallel Comput..
[11] D. Sundararajan,et al. Index mapping approach of deriving the PM DFT algorithms , 1995, Proceedings 1995 Canadian Conference on Electrical and Computer Engineering.
[12] Sanjit K. Mitra,et al. Digital Signal Processing: A Computer-Based Approach , 1997 .
[13] Daisuke Takahashi. A parallel 1-D FFT algorithm for the Hitachi SR8000 , 2003, Parallel Comput..
[14] Steven G. Johnson,et al. The Fastest Fourier Transform in the West , 1997 .
[15] James S. Walker. Fast Fourier Transforms , 1991 .
[16] Steven G. Johnson,et al. The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.