Twiddle-factor-based FFT algorithm with reduced memory access

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 653-660

  Jiang, Yingtao ^a   Zhou, Ting ^b   Tang, Yiyan ^c   Wang, Yuke ^c  

^a University of Nevada Las Vegas   (United States)

^b Gennum Corporation   (Canada)

^c The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966593359     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1015572     Document Type: Conference Paper

References (20)

1. D. H. Bailey, "FFTs in External or Hierarchical Memory," NASA Tech. Report RNR-89-004, 1989.
2. G. D. Bergland, "A Raidx-Eight Fast-Fourier Transform Subroutine for Real-Valued Series," IEEE Trans. Audio Electroacoust. vol. 17, no. 2, pp. 138-144, June 1969.
3. C. S. Burrus and T. W. Parks, DFT/FFT and Convolution Algorithms and Implementation, NY: John Wiley & Sons, 1985.
4. J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Computat., vol. 19, pp. 297-301, 1965.
5. P. Duhamel, and H. Hollmann, "Split Radix FFT Algorithm," Electronics Letters, vol. 20, pp.14-16, Jan. 5, 1984.
6. P. Duhamel, "Implementation of 'Split-Radix' FFT Algorithms for Complex, Real, and Real-Symmetric Data," IEEE Acoustics, Speech, and Signal Processing Magazine, vol. 34, pp. 285-295, Apr. 1986.
7. M. Frigo and S. G. Johnson, "The fastest Fourier transform in the west," Tech. Rep. MIT-LCS-TR-728, Laboratory for Computer Science, MIT, Cambridge, MA, Sept. 1997.
8. M. T. Heideman, D. H. Johnson, and C. S. Burrus, "Gauss and the History of the FFT," IEEE Acoustics, Speech, and Signal Processing Magazine, vol. 1, pp. 14-21, Oct. 1984.
9. D. Pl. Kolba and T. W. Parks, "A Prime Factor FFT Algorithm Using High-Speed Convolution," IEEE Trans. Acoust., Speech, Signal Processing, vol. 25, no. 4, pp. 281-294, Aug. 1977.
10. K.-S. Lin, ed., Digital Signal Processing Applications with the TMS 320 Family, vol. 1. Englewood Cliffs, N.J.: Prentice Hall, 1987.
11. A. R. Omondi, The Microachitecture of Pipelined and Superscalar Computers. Boston: Kluwer Academic Publishers, 1999.
12. nd ed., Discrete-Time Signal Processing. Upper Saddle River, NJ: Prentice-Hall, 1989.
13. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes: The Art of Scientic Computing. Cambridge University Press, 1986.
14. A. Saidi, "Decimation-in-Time-Frequency FFT Algorithm," Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. III:453-456, April 19-22 1994.
15. R. C. Singleton, "An Algorithm for Computing the Mixed Radix Fast Fourier Transform," IEEE Trans. Audio Electroacoust. vol. 1, no. 2, pp. 93-103, June 1969.
16. H. V. Sorensen and C. S. Burrus, "A New Efficient Algorithm for Computing a Few DFT Points," IEEE Trans. Acoust., Speech, Signal Processing, vol. 35, no. 6, pp. 849-863, June 1987.
17. D. Takahashi, "An Extended Split-Radix FFT Algorithm," IEEE Signal Processing Letters, vol. 8, no. 5, pp. 145-147, May 2001.
18. Texas Instrument, TMS320C62x DSP Library Programmer' s References, SPRU402.
19. A. R. Varkonyi-Koczy, "A Recursive Fast Fourier Transform Algorithm," IEEE Trans. Circuits and Systems, II, vol. 42, pp. 614-616, Sep. 1995.
20. S. Winograd, "On Computing the Discrete Fourier Transform," Math. Comput., vol. 32, no. 141, pp. 175-199, Jan. 1978.