• DocumentCode
    1623482
  • Title

    Fast computation of the two-dimensional discrete Fourier transform

  • Author

    Sundararajan, D. ; Ahmad, M.O.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
  • Volume
    2
  • fYear
    1996
  • Firstpage
    759
  • Abstract
    In this paper, a new radix-2 2-D decimation-in-time discrete Fourier transform algorithm is presented. This algorithm uses an approach employing vectorized data to reduce the structural overhead of the algorithm compared with the Cooley-Tukey radix-2 2-D algorithm. Computational complexity and run-time comparison of the algorithm are also provided
  • Keywords
    computational complexity; discrete Fourier transforms; signal processing; 2D discrete Fourier transform; computational complexity; fast computation; radix-2 2D decimation-in-time; run-time comparison; two-dimensional DFT; vectorized data; Arithmetic; Computational complexity; Discrete Fourier transforms; Fourier transforms; Runtime; Signal processing algorithms; Time domain analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1996., IEEE 39th Midwest symposium on
  • Conference_Location
    Ames, IA
  • Print_ISBN
    0-7803-3636-4
  • Type

    conf

  • DOI
    10.1109/MWSCAS.1996.588018
  • Filename
    588018
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1623482