• DocumentCode
    2000929
  • Title

    On computing multidimensional discrete Fourier transform

  • Author

    Gertner, I. ; Tolimieri, R.

  • Author_Institution
    Center for Large Scale Comput., City Univ. of New York, NY, USA
  • fYear
    1989
  • fDate
    6-8 Sep 1989
  • Firstpage
    168
  • Abstract
    Summary form only given. An algorithm has been developed for computing an N-dimensional discrete Fourier transform of size PR×PR×. . .× pRr, where P is a prime number and R is a positive integer. The algorithm is based on grouping the input data on hyperplanes orthogonal to some chosen direction and then taking a one-dimensional discrete Fourier transform. An interesting feature of the algorithm is its inherent suitability for parallel/pipelined implementation in hardware
  • Keywords
    fast Fourier transforms; parallel algorithms; picture processing; signal processing; 1D DFT; FFT; hyperplanes; image processing; input data grouping; multidimensional discrete Fourier transform; parallel/pipelined implementation; Discrete Fourier transforms; Hardware; Large-scale systems; Multidimensional systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multidimensional Signal Processing Workshop, 1989., Sixth
  • Conference_Location
    Pacific Grove, CA
  • Type

    conf

  • DOI
    10.1109/MDSP.1989.97098
  • Filename
    97098
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2000929