论文信息 - A self-sorting in-place prime factor real/half-complex FFT algorithm

A self-sorting in-place prime factor real/half-complex FFT algorithm

Abstract A new fast Fourier transform algorithm for real or half-complex (conjugate-symmetric) input data is described. Based on the decomposition of N (the length of the transform) into mutually prime factors, the algorithm performs transforms in-place and without pre- or post-reordering of the data. With large-scale scientific computing in mind, the emphasis is on reducing the number of additions required. Compared with the best available algorithm based on specializing the conventional FFT to the real/half-complex case, the number of multiplications is also reduced by about 50%. On the Cray X-MP, a transform package based on the new algorithm runs up to 20% faster than the previous fastest available routines, besides halving the storage requirements.

Clive Temperton

[1] C. Burrus,et al. An in-place, in-order prime factor FFT algorithm , 1981 .

[2] C. Temperton. Self-sorting mixed-radix fast Fourier transforms , 1983 .

[3] Clive Temperton. Implementation of a self-sorting in-place prime factor FFT algorithm , 1985 .

[4] Clive Temperton,et al. Note a note on prime factor FFT algorithms , 1983 .

[5] Joseph H. Rothweiler. Implementation of the in-order prime factor transform for variable sizes , 1982 .

[6] Ramesh C. Agarwal,et al. Fourier Transform and Convolution Subroutines for the IBM 3090 Vector Facility , 1986, IBM J. Res. Dev..

[7] Peter D. Welch,et al. The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms☆ , 1970 .

[8] C. Burrus,et al. The design of optimal DFT algorithms using dynamic programming , 1982, ICASSP.

[9] T. Parks,et al. A prime factor FFT algorithm using high-speed convolution , 1977 .

[10] Harvey F. Silverman,et al. An introduction to programming the Winograd Fourier transform algorithm (WFTA) , 1977 .

[11] C. Temperton. Fast Mixed-Radix Real Fourier Transforms , 1983 .

[12] S. Winograd. On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.