‘Split radix’ FFT algorithm

Electronics Letters

Volumn 20, Issue 1, 1984, Pages 14-16

  Duhamel, P ^a   Hollmann, H ^a  

^a ORANGE LABS   (France)

Author keywords

Fast Fourier transforms; Signal processing

Indexed keywords

SIGNAL PROCESSING - ANALYSIS;

MATHEMATICAL TRANSFORMATIONS;

EID: 0021755317     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19840012     Document Type: Article

References (9)

1. COOLEY, J. W., and TUKEY, J. W.: ‘An algorithm for machine computation of complex Fourier series’, Math. Comput., 1965, 19, pp. 297-301
2. RADER, C. M., and BRENNER, N. M.: ‘A new principle for fast Fourier transformation’, IEEE Trans., 1976, ASSP-24, pp. 264-265
3. CHO, K. M., and TEMES, G. C : ‘Real-factor FFT algorithms’. Proceedings 1978 IEEE ICASSP, pp. 634-637
4. PREUSS, R. D.: ‘Very fast computation of the radix-2, discrete Fourier transform’, IEEE Trans., 1982, ASSP-30, pp. 595-607
5. NUSSBAUMER, H. J. : ‘Fast Fourier transform and convolution algorithm’ (Springer Verlag, 1981)
6. JOHNSON, H., and BURRUS, C. S.: Twiddle factors in the radix-2 FFT’. Proceedings 1982 Asilomar Conference on circuits, systems and computers, pp. 413-416
7. WINOGRAD, S.: ‘On the multiplicative complexity of the discrete Fourier transform’ in ‘Advances in mathematics Vol. 32’, 1979, pp. 83-117
8. BURRUS, C. S., and ESCHENBACHER, P. W.: ‘An in-place, in-order prime factor FFT algorithm’, IEEE Trans., 1981, ASSP-29, pp. 806-817
9. MORRIS, L. R. : ‘Automatic generation of time efficient digital signal processing software’, IEEE Trans., 1977, ASSP-25, pp. 74-79