Computing the Inverse DFT with the In-Place, In-Order Prime Factor FFT Algorithm

Kin Man Lam, Hong Yan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

4 Citations (Scopus)


In this correspondence, we present a method for computing the inverse discrete Fourier transform (IDFT) by the in-place, in-order prime factor FFT algorithm (PFA). This is achieved by modifying the input and the output index mapping equations. This approach does not result in any additional cost in terms of program length and computational time.
Original languageEnglish
Pages (from-to)2193-2194
Number of pages2
JournalIEEE Transactions on Signal Processing
Issue number9
Publication statusPublished - 1 Jan 1995
Externally publishedYes

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this