论文信息 - A new radix-6 FFT algorithm suitable for multiply-add instruction

A new radix-6 FFT algorithm suitable for multiply-add instruction

A new radix-6 FFT algorithm suitable for multiply-add instruction is proposed. The new radix-6 FFT algorithm requires fewer floating-point instructions than the conventional radix-6 FFT algorithms on processors that have a multiply-add instruction. We use Goedecker's (1997) techniques to obtain an algorithm for computing radix-6 FFT with fewer floating-point instructions than conventional radix-6 FFT algorithms. The number of floating-point instructions for the new radix-6 FFT algorithm is compared with those of conventional radix-6 FFT algorithms on processors with multiply-add instruction.

Daisuke Takahashi

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

[2] Ken'iti Kido,et al. A new FFT algorithm of radix 3, 6, and 12 , 1986, IEEE Trans. Acoust. Speech Signal Process..

[3] G. D. Bergland,et al. A fast Fourier transform algorithm using base 8 iterations , 1968 .

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

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

[6] S. Prakash,et al. A new radix-6 FFT algorithm , 1981 .

[7] C. Sidney Burrus,et al. On computing the split-radix FFT , 1986, IEEE Trans. Acoust. Speech Signal Process..

[8] E. Dubois,et al. A new algorithm for the radix-3 FFT , 1978 .

[9] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .

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

[11] P. Duhamel,et al. `Split radix' FFT algorithm , 1984 .

[12] E. Feig,et al. Modified FFTs for fused multiply-ADD architectures , 1993 .

[13] Stefan Goedecker,et al. Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply-Add Instructions , 1997, SIAM J. Sci. Comput..