New Algorithms for the Multidimensional Discrete Fourier Transform

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 31, Issue 2, 1983, Pages 388-403

  Auslander, Louis ^a   Feig, Ephraim ^b   Winograd, Shmuel ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

MATHEMATICAL TRANSFORMATIONS;

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

References (7)

1. J. W. Cooley and J. W. Tukey, “An algorithm for the machine calculation of complex Fourier series,” Math. Comput., vol. 19, no. 90, pp. 297–301, 1965.
2. S. Winograd, “Arithmetic complexity of computations,” presented at CBMS-NSF Regional Conf. Series in Appl. Math., 1980.
3. S. Winograd, “On computing the discrete Fourier transform,” Math. Comput., vol. 32, pp. 175–199, 1978.
4. H. Nussbaumer and P. Quandalle, “Fast computation of discrete Fourier transforms using polynomial transforms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, pp. 169–181, Apr. 1979 ‘see p. 171, tables on p. 173, and p. 174’.
5. H. Nussbaumer, Fast Fourier Transform and Convolution Algorithm. Berlin, Heidelberg, New York: Springer-Verlag, 1981 ‘see ch. 7’.
6. L. Auslander, E. Feig, and S. Winograd, “Abelian semi-simple algebras and algorithms for the discrete Fourier transform,” IBM RC 9234 ‘#40567’ Jan. 28, 1982.
7. C. Rader, “Discrete Fourier transforms when the number of data samples is prime,” Proc. IEEE, vol. 56, pp. 1107–1108, 1968.