An algorithm for the two dimensional FFT
No Thumbnail Available
Authors
Hoyer, Elmer A.
Berry, W.
Advisors
Issue Date
1977-05-01
Type
Conference paper
Keywords
Algorithm design and analysis , Application software , Digital filters , Digital images , Discrete Fourier transforms , Discrete transforms , Fast Fourier transforms , Filtering , Image storage , Matrix decomposition
Citation
Hoyer, E.; Berry, W.; , "An algorithm for the two dimensional FFT," Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '77. , vol.2, no., pp. 552- 555, May 1977
doi: 10.1109/ICASSP.1977.1170190
Abstract
Conventional two dimensional fast Fourier transforms become very slow if the size of the matrix becomes too large to be contained in memory. This is due to the transposition of the matrix that is required. This new algorithm is designed to remove the requirement for transposition, thereby, greatly increasing the speed of the process. This algorithm is extremely valuable on small disc based computers.
Table of Contents
Description
Click on the DOI link to access the article (may not be free)
Publisher
IEEE
Journal
Book Title
Series
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '77. , vol.2, no., pp. 552- 555