• DocumentCode
    1108929
  • Title

    Fast algorithms for the multidimensional discrete Fourier transform

  • Author

    Guessoum, Abderrezak ; Mersereau, Russell M.

  • Author_Institution
    Jackson State University, Jackson, MS
  • Volume
    34
  • Issue
    4
  • fYear
    1986
  • fDate
    8/1/1986 12:00:00 AM
  • Firstpage
    937
  • Lastpage
    943
  • Abstract
    In this paper, the prime factor algorithm for the evaluation of a one-dimensional discrete Fourier transform is generalized to the evaluation of multidimensional discrete Fourier transforms defined on arbitrary periodic sampling lattices. It is shown that such an algorithm is equivalent in computational complexity to the evaluation of a rectangular discrete Fourier transform. As a sidelight to the derivation of the algorithm, a Chinese remainder theorem is derived for integer lattices.
  • Keywords
    Computational complexity; Discrete Fourier transforms; Fourier transforms; Image processing; Lattices; Multidimensional signal processing; Multidimensional systems; Optical design; Sampling methods; Signal processing algorithms;
  • fLanguage
    English
  • Journal_Title
    Acoustics, Speech and Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0096-3518
  • Type

    jour

  • DOI
    10.1109/TASSP.1986.1164883
  • Filename
    1164883
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1108929