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

Proceedings - IEEE International Conference on Multimedia and Expo

Volumn 2, Issue , 2003, Pages 845-848

  Takahashi, D ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC;

CONVENTIONAL POWER; FAST FOURIER TRANSFORM ALGORITHM; FFT ALGORITHM; FLOATING POINT INSTRUCTION; MULTIPLY-ADD; RADIX 2; RADIX-16 FFT;

FAST FOURIER TRANSFORMS;

EID: 77956600021     PISSN: 19457871     EISSN: 1945788X     Source Type: Conference Proceeding    
DOI: 10.1109/ICME.2003.1221749     Document Type: Conference Paper

References (15)

1. J. W. Cooley and I. W. Tukey. "An algorithm for the machinecalculation of complex Fourier series:' Marh. Compur. , vol. 19, pp. 297-301, Apr. 1965.
2. G. D. Bergland, " A fast Fourier transform algorithm usingbase 8 iterations," Marh. Compsr. , vol. 22, pp. 275-279, Apr. 1968.
3. P. Duhamel and H. Hollmann, "Split radix FIT algorithm:'Electron Lett.,20,14,Jan,1984.
4. H. V. Sorensen, M. T. Heideman, and C. S. Bums, "On computingthe split-radix FIT. " 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, May2001.
6. S. Winograd, "On computing the discrete Fourier transform,"Marh. Compsr. , vol. 32, pp. 175-199, Jan. 1978.
7. D. P. Kolba and T. W. Parks, "A prime factor FFT algorithmusing high-speed convolution," IEEE Trans. Acousr. , Speech,Signal Processing, vol. ASSP-25, pp. 281-294, Aug. 1977.
8. C. S. Bums and W. Eschenbacher. "An in-place, in-orderprime factor FIT algorithm:' IEEE Trans. Audio Eleclroa-COUSI. , vol. AU-29, pp. 806817, Aug. 1981.
9. E. Linzer and E. Feig. "Implementation of efficient FIT algorithmson 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 kemels forfast Fourier transformations on computers with overlappingmultiply-add instructions," SIAM J. Sci. Comput. , vol. 18,pp. 1605-1611, Nov. 1997.
11. H. Kamer, M. Auer, and C. W. Ueberhuber. "Multiply-addoptimized FFT kernels," Marh. Models. Merhods Appl. Sri. ,vol. 11, pp. 105-117, Feb. 2001.
12. M. Frigo and S. G. Johnson, "FFIW: An adaptive softwarearchitecture for the FIT," in Proc. I998 IEEE InfernarionalConfer" on Acousrics, Speech, and Signal Processing(ICASSP98J, Apr. 1998, pp. 1381-1384.
13. Intel Corporation, Intel lranium Archilecture Soflwore Developer'sManual Volume I : Application Arrhirecrure Revision2. 0(24. 5. 317-003), Dec. 2001.
14. C. Van Loan, Computarional Frameworks for rhe FasrFourier Transform SIAM Press. Philadelphia, PA 1992.
15. H. J. Nussbaumer, Fasr Fourier Transform and ConvolurionAlgorirhms, Springer-Verlag. New York. second correctedand updated edition, 1982.