Effective implementations of multi-dimensional radix-2 FFT

Computer Physics Communications

Volumn 125, Issue 1, 2000, Pages 1-7

  Yamamoto, Susumu ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER WORKSTATIONS; REDUCED INSTRUCTION SET COMPUTING; SUPERCOMPUTERS;

VECTOR SUPERCOMPUTERS;

FAST FOURIER TRANSFORMS;

EID: 0034159014     PISSN: 00104655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4655(99)00456-7     Document Type: Article

References (10)

1. J.W. Cooley, J.W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comp. 19 (1965) 297-301.
2. M. Frigo, S.G. Johnson, The fastest Fourier Transform in the West, MIT-LCS-TR-728 (MIT Technical Report) (1997).
3. http://www.fftw.org/benchfft/.
4. http://www.fftw.org/.
5. C. Temperton, Self-sorting mixed-radix Fast Fourier Transforms, J. Comput. Phys. 52 (1983) 1-23.
6. C. Temperton, Implementation of a self-sorting in-place prime factor FFT algorithm, J. Comput. Phys. 58 (1985) 283-299.
7. C. Temperton, Self-sorting in-place Fast Fourier Transforms, SIAM J. Sci. Stat. Comput. 12 (1991) 808-823.
8. r, SIAM J. Sci. Stat. Comput. 13 (1992) 676-686.
9. A. Nobile, V. Roberto, Efficient implementation of multidimensional Fast Fourier Transforms on a cray X-MP, discreat Fourier transforms, Comput. Phys. Commun. 40 (1986) 189-201.
10. A. nobile, V. Roberto, MFFT: A package for two- and three-dimensional vectorized discrete Fourier Transforms, Comput. Phys. Commun. 42 (1986) 233-247.