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

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn 6, Issue , 2000, Pages 3343-3346

  Takahashi, Daisuke ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; FAST FOURIER TRANSFORMS; ALGORITHMS; COMPUTATIONAL METHODS; MICROCOMPUTERS; NUMBER THEORY;

FFT ALGORITHM; FLOATING POINT INSTRUCTION; MULTIPLY-ADD;

SIGNAL PROCESSING; FAST FOURIER TRANSFORMS;

FLOATING POINT INSTRUCTION; MULTIPLY ADD INSTRUCTION; RADIX SIX FAST FOURIER TRANSFORM ALGORITHM;

EID: 0033693548     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2000.860116     Document Type: Conference Paper

References (16)

1. S. Prakash and V. V. Rao, "A new radix-6 FFT algorithm", IEEE Trans. Acoust., Speech. Signal Processing, vol. ASSP-29, pp. 939-941, Aug. 1981.
2. Y. Suzuki, T. Sone, and K. Kido, "A new FFT algorithm of radix 3, 6, and 12", IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 380-383, Apr. 1986.
3. S. Winograd, "On computing the discrete Fourier transform", Math. Comp., vol. 32, pp. 175-199, Jan. 1978.
4. D. P. Kolba and T. W. Parks, "A prime factor FFT algorithm using high-speed convolution", IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 281-294, Aug. 1977.
5. C. S. Burrus and P. W. Eschenbacher, "An in-place, in-order prime factor FFT algorithm", IEEE Trans. Audio Electroacoust., vol. AU-29, pp. 806-817, Aug. 1981.
6. C. Temperton, "Self-sorting mixed-radix fast Fourier transforms", J. Comput. Phys., vol. 52, pp. 1-23, Oct. 1983.
7. E. Linzer and E. Feig, "Modified FFTs for fused multiply-add architectures", Math. Comp., vol. 60, pp. 347-361, Jan. 1993.
8. J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series", Math. Comp., vol. 19, pp. 297-301, Apr. 1965.
9. P. Duhamel and H. Hollmann, "Split radix FFT algorithm", Electron. Lett., vol. 20, pp. 14-16, Jan. 1984.
10. H. V. Sorensen, M. T. Heideman, and C. S. Burrus, "On computing the split-radix FFT", IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 152-156, Feb. 1986.
11. S. Goedecker, "Fast radix 2, 3, 4, and 5 kernels for fast Fourier transformations on computers with overlapping multiply-add instructions", SIAM J. Sci. Cornput., vol. 18, pp. 1605-1611, Nov. 1997.
12. E. O. Brigham, The Fast Fourier Transform and its Applications. Prentice-Hall, Englewood Cliffs, NJ, 1988.
13. C. Van Loan, Computational Frameworks for the Fast Fourier Transform. SIAM Press, Philadelphia, PA, 1992.
14. II. J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms. Springer-Verlag, New York, second corrected and updated ed., 1982.
15. E. Dubois and A. N. Venetsanopoulos, "A new algorithm for the radix-3 FFT", IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-26, pp. 222-225, June 1978.
16. G. D. Bergland, "A fast Fourier transform algorithm using base 8 iterations", Math. Comp., vol. 22, pp. 275-279, Apr. 1968.