• DocumentCode
    3027053
  • Title

    An algorithm for the two dimensional FFT

  • Author

    Hoyer, Elmer A. ; Berry, William R.

  • Author_Institution
    Wichita State University, Wichita, Kansas
  • Volume
    2
  • fYear
    1977
  • fDate
    28246
  • Firstpage
    552
  • Lastpage
    555
  • 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.
  • Keywords
    Algorithm design and analysis; Application software; Digital filters; Digital images; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Filtering; Image storage; Matrix decomposition;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '77.
  • Type

    conf

  • DOI
    10.1109/ICASSP.1977.1170190
  • Filename
    1170190
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3027053