An algorithm for the two dimensional FFT
MetadataShow full item record
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
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.
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