Two-dimensional zoom FFT
No Thumbnail Available
Authors
Stork, R.
Hoyer, Elmer A.
Advisors
Issue Date
1978-04-01
Type
Conference paper
Keywords
Application software , Computational efficiency , Convolution , Discrete Fourier transforms , Discrete transforms , Fast Fourier transforms , Frequency domain analysis , Sampling methods , Speech
Citation
Stork, R.; Hoyer, E.; , "Two-dimensional zoom FFT," Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '78. , vol.3, no., pp. 753- 756, Apr 1978
doi: 10.1109/ICASSP.1978.1170462
Abstract
The concept of the zoom FFT (a more efficient algorithm which allows zooming in on a narrow segment of the spectrum while preserving its frequency content) is extended to the two-dimensional case. The technique is further expanded to allow zooms over a specified segment within both the time and the frequency domains. Comparisons are also made as to the computational efficiency of this technique compared to the conventional two-dimensional FFT algorithms.
Table of Contents
Description
The full text of this article is not available on SOAR. WSU users can access the article via IEEE Xplore database licensed by University Libraries: http://libcat.wichita.edu/vwebv/holdingsInfo?bibId=1045954
Publisher
IEEE
Journal
Book Title
Series
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '78. , vol.3, no., pp. 753- 756