Abstract
In this paper the Cooley-Tukey fast Fourier transform (FFT) algorithm is generalized to the multi-dimensional case in a natural way that incorporates the standard row-column and vector-radix algorithms as special cases. It can be used for the evaluation of discrete Fourier transforms of rectangularly or hexagonally sampled signals or signals which are arbitrarily sampled in either the spatial or Fourier domain. These fast Fourier transform algorithms are shown to result from the factorization of an integer matrix; different algorithms correspond to different factorizations. This paper will first derive a generalized discrete Fourier transform, then derive the general Cooley-Tukey algorithm, and conclude by interpreting existing multi-dimensional FFT algorithms in terms of the generalized one.
This work was supported, in part, by the National Science Foundation under grant ECS-7817201 and by the Joint Services Electronics Program under Contract DAAG29-76-G-0226.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D.B. Harris, J.H. McClellan, D.S.K. Chan, and H.W. Schuessler, "Vector radix fast Fourier transform," 1977 IEEE Int. Conf. on ASSP Record, pp. 548–551, 1977.
G.E. Rivard, "Direct fast Fourier transform of bivariate functions," IEEE Trans. Acoust. Speech, and Signal Processing, vol. ASSP-25, pp. 250–252, 1977.
E.A. Hoyer and W.R. Berry, "An algorithm for the two-dimensional FFT," 1977 IEEE Int. Conf. on ASSP Record, pp. 552–555, 1977.
B. Arambepola, "Fast computation of multi-dimensional discrete Fourier transforms," IEEE Proc., Vol. 127, pp. 49–52, 1980.
G.L. Anderson, "A stepwise approach to computing the multidimensional fast Fourier transform of large arrays," IEEE Trans. Acoust, Speech, and Signal Processing, Vol. ASSP-28, pp. 280–284, 1980.
J.W. Cooley and J.W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comput., Vol. 19, pp. 296–301, 1965.
R.M. Mersereau, "The processing of hexagonally sampled two-dimensional signals," Proc. IEEE, Vol. 67, pp. 930–949, 1979.
R.M. Mersereau and D.E. Dudgeon, "The representation of two-dimensional sequences as one-dimensional sequences," IEEE Trans. Acoustics, Speech, and Signal Processing, Vol. ASSP-22, pp. 320–325, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Veralg
About this paper
Cite this paper
Mersereau, R.M., Speake, T.C. (1980). Generalized cooley-tukey algorithms for evaluation of multi-dimensional discrete fourier transforms. In: Bensoussan, A., Lions, J.L. (eds) Analysis and Optimization of Systems. Lecture Notes in Control and Information Sciences, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0004076
Download citation
DOI: https://doi.org/10.1007/BFb0004076
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10472-8
Online ISBN: 978-3-540-38489-2
eBook Packages: Springer Book Archive