Show simple item record

dc.contributor.authorHoyer, Elmer. A.en_US
dc.contributor.authorBerry, W.en_US
dc.date.accessioned2011-12-21T20:17:34Z
dc.date.available2011-12-21T20:17:34Z
dc.date.issued1977-05-01en_US
dc.identifier.citationHoyer, 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.1170190en_US
dc.identifier.urihttp://dx.doi.org/10.1109/ICASSP.1977.1170190en_US
dc.identifier.urihttp://hdl.handle.net/10057/4104
dc.descriptionClick on the DOI link to access the article (may not be free)en_US
dc.description.abstractConventional 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.en_US
dc.language.isoen_USen_US
dc.publisherIEEEen_US
dc.relation.ispartofseriesAcoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '77. , vol.2, no., pp. 552- 555en_US
dc.subjectAlgorithm design and analysisen_US
dc.subjectApplication softwareen_US
dc.subjectDigital filtersen_US
dc.subjectDigital imagesen_US
dc.subjectDiscrete Fourier transformsen_US
dc.subjectDiscrete transformsen_US
dc.subjectFast Fourier transformsen_US
dc.subjectFilteringen_US
dc.subjectImage storageen_US
dc.subjectMatrix decompositionen_US
dc.titleAn algorithm for the two dimensional FFTen_US
dc.typeConference paperen_US
dc.description.versionPeer reviewed articleen_US
dc.rights.holder© IEEE,1977en_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record