Implementation of “Split-Radix” FFT algorithms for complex real, and real-symmetric data

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 34, Issue 2, 1986, Pages 285-295

  Duhamel, Pierre ^a  

^a ORANGE LABS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - ALGORITHMS;

SPLIT RADIX ALGORITHM;

MATHEMATICAL TRANSFORMATIONS;

EID: 0022700957     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1986.1164811     Document Type: Article

References (24)

1. J. W. Cooley and J. W. Tukey, “An algorithm for machine computation of complex Fouri er series” Math Comput vol. 19, pp. 297–301, 1965.
2. C: M. Rader and N. M. Brenner, “A new principle for fast Fourier transformation,” IEEE Trans. Ac oust., Speech, Signal Processing., vol. ASSP-24, pp. 264–265, 1976.
3. K. M. Cho and G. C. Temes, “Real-factor FFT algorithms,” in Proc. IEEE ICASSP, 1978, pp. 634–637.
4. R. D. Preuss, “Very fast computation of the radix-2, discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30, pp. 595–607, 1982.
5. H. J. Nussbaumer, Fast Fourier Transform and Convolution Algorithm. Berlin, Germany: Springer-Verlag, 1981.
6. H. Johnson and C. S. Burrus, “Twiddle factors in the radix-2 FFT,” in Proc. 1982 Asilomar Conf. Circuits Syst., Comput 1982, pp. 413–416.
7. S. Winograd, “On the multiplicative complexity of the discrete Fourier transform,” Adv. Math., vol. 32, pp. 83–117, 1979.
8. C. S. Burrus and P. W. Eschenbacher, “An in-place, in-order prime factor FFT algorithm,” IEEE Trans. Acoust., Speech, Signal Processing vol. ASSP-29, pp. 806–817, 1981.
9. L. R. Morris, “Automatic generation of time efficient digital signal processing software,” IEEE Trans. Acoust., Speech, Signal Process- vol. ASSP-25, pp. 74–79, Feb. 1977.
10. S. Winograd, “On computing the discrete Fourier transform,” Math. Comput., vol. 32, pp. 175–199, Jan. 1978.
11. P. Duhamel and H. Hollmann, “Split-radix FFT algorithm,” Electron. Lett., vol. 20, pp. 14–16, Jan. 1984.
12. R, Yavne, “An economical method for calculating the discrete Fourier transform,” in AFIPS Proc., vol. 33, Fall Joint Comput. Conf., Washington, DC, 1968, pp. 115–125.
13. M. Vetterli and H. J. Nussbaumer, “Simple FFT and DCT algorithms with reduced number of operations,” Signal Processing, vol. 6, pp. 267–278, July 1984.
14. Z. Wang, “Fast algorithms for the discrete W transforms and the discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 803–816, Aug. 1984.
15. J. B. Martens, “Recursive cyclotomic factorization—A new algorithm For calculating the discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 750–761, Apr. 1984.
16. J.B.Martens, “Discrete Fourier transform algorithms for real valued sequences,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 390–396, Apr. 1984.
17. G. D. Bergland, “A fast Fourier transform algorithm for real-valued series,” Commun. ACM, vol. 11, pp. 703–710, Oct. 1968.
18. H. Ziegler, “A fast Fourier transform algorithm for symmetric real- series,” IEEE Trans. Audio Electroacoust., vol. AE-20, pp. 353–356, Dec. 1972.
19. P. Duhamel and H. Hollmann, “Existence of a 2”-FFT algorithm with a number of multiplications lower than 2 n+l,” Electron. Lett., vol. 20, pp. 690–692, Aug. 1984.
20. M. J. Narasimha and A. M. Peterson, “On the computation of the discrete cosine transform,” IEEE Trans. Commun., vol. COM-26, pp. 934–936, June 1978.
21. L. R. Morris, “Digital signal processing software,” Ottawa, Canada, DSPSW, Inc., 1982, 1983.
22. M. Vetterli, “FFT’s of signals with symmetries and application to autocorrelation computation,” submitted to MELECON 85, Madrid, Spain.
23. M.Vetterli, “Fast 2-D discrete cosine transform,” accepted for publication, ICASSP’85, Tampa, FL, Mar. 1985.
24. M. T. Heideman and C. S. Burrus, “Multiply/add tradeoff in length 2n+l FFT algorithms,” ICASSP’85, pp. 780–783, 1985.