A New Efficient Algorithm to Compute the Two-Dimensional Discrete Fourier Transform

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 36, Issue 7, 1988, Pages 1036-1050

  Gertner, Izidor ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; MATHEMATICAL TECHNIQUES - ALGORITHMS;

2-D DATA SET; COMPUTING DFT; DISCRETE FOURIER TRANSFORM (DFT);

MATHEMATICAL TRANSFORMATIONS;

EID: 0024048453     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/29.1627     Document Type: Article

References (6)

1. L. Auslander, E. Feig, and S. Winograd, “New algonthms for the multidimensional discrete Fourier transform” IEEE Trans. Acoust., Speech, Signal Processing,vol. ASSP-31, Apr. 1983.
2. H. Nussbaumer, Fast Fourier Transforms and Convolution Algorithm. New York: Springer-Verlag, 1981.
3. H. Nussbaumer and P. Quandalle, “Fast computation of discrete Fourier transforms using polynomial transforms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, Apr. 1979.
4. R. Blahut, Fast Algorithms for Digital Signal Processing. Reading, MA: Addison-Wesley, 1985.
5. I. Gertner, “On the number of linear congruences spanning quadratic grid,” to be published.
6. H. N. Shapiro, Introduction to Theory of Numbers. New York: Wiley, 1983.