Summary
In this paper fundamental theorems are proved for computing the so called index transforms which mapm-dimensional discrete Fourier transform operator (DFT) ton-dimensional one. These transforms are based on mapping indexes of input and output sequences of DFT operators. The general form of these transforms is found and the necessary and sufficient conditions of their existence are described.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cooley, J.W., Tukey, J.W.: An Algorithm for Machine Calculation of Complex Fourier Series. Math. Comput.19, 297–301 (1965)
Elliot, D.F., Rao, K.R.: Fast tranforms, Algorithms, Analyses, Applications. New York, London, Paris, San Diego, Sao Paulo, Sydney, Tokyo, Toronto: Academic Press 1982
Nussbaumer, H.J., Quandalle, P.: Fast computation of discrete Fourier transforms using polynomial transforms. IEEE Trans., ASSP-27.2, 169–181 (1979)
Winograd, S.: On computing the discrete Fourier transform. Proc. Natl. Acad. Sci. USA73, 1005–1006 (1976)
Zohar, S.: Winograd's Discrete Fourier Transform Algorithm. Chapter 4. In: Book Topics in Applied Physics, Two-dimensional Digital Signal Processing II, Vol. 43. Huang, T.S., ed.), pp. 88–160. Berlin, Heidelberg, New York: Springer 1981
Burrus, C.S.: Index Mappings for Multidimensional Formulation of the DFT and Convolution. IEEE Trans. ASSP-25.3, 239–242 (1977)
Hekrdla, J.: Index Transforms of Multidimensional Cyclic Convolutions and Discrete Fourier Transforms. IEEE Trans. ASSP-34.4, 996–997 (1986)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hekrdla, J. Index transforms forn-dimensional DFT's. Numer. Math. 51, 469–480 (1987). https://doi.org/10.1007/BF01397548
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01397548