A radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method

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

Volumn 2, Issue , 2003, Pages 665-668

  Takahashi, Daisuke ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIGITAL ARITHMETIC; FAST FOURIER TRANSFORMS;

FLOATING POINT INSTRUCTIONS;

PROGRAM PROCESSORS;

EID: 0141676637     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comput., vol. 19, pp. 297-301, Apr. 1965.
2. G. D. Bergland, "A fast Fourier transform algorithm using base 8 iterations," Math. Comput., vol. 22, pp. 275-279, Apr. 1968.
3. P. Duhamel and H. Hollmann, "Split radix FFT algorithm," Electron. Lett., vol. 20, pp. 14-16, Jan. 1984.
4. 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.
5. D. Takahashi, "An extended split-radix FFT algorithm," IEEE Signal Processing Lett., vol. 8, pp. 145-147, May 2001.
6. S. Winograd, "On computing the discrete Fourier transform," Math. Comput., vol. 32, pp. 175-199, Jan. 1978.
7. 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.
8. 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.
9. E. Linzer and E. Feig, "Implementation of efficient FFT algorithms on fused multiply-add architectures," IEEE Trans. Signal Processing, vol. 41, pp. 93-107, Jan. 1993.
10. S. Goedecker, "Fast radix 2, 3, 4, and 5 kernels for fast Fourier transformations on computers with overlapping multiply-add instructions," SIAM J. Sci. Comput., vol. 18, pp. 1605-1611, Nov. 1997.
11. H. Karner, M. Auer, and C. W. Ueberhuber, "Multiply-add optimized FFT kernels," Math. Models. Methods Appl. Sci., vol. 11, pp. 105-117, Feb. 2001.
12. M. Frigo and S. G. Johnson, "FFTW: An adaptive software architecture for the FFT," in Proc. 1998 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP98), Apr. 1998, pp. 1381-1384.
13. Intel Corporation, Intel Itanium Architecture Software Developer's Manual Volume 1: Application Architecture Revision 2.0 (245317-003), Dec. 2001.
14. C. Van Loan, Computational Frameworks for the Fast Fourier Transform, SIAM Press, Philadelphia, PA, 1992.
15. H. J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms, Springer-Verlag, New York, second corrected and updated edition, 1982.