Computing the inverse DFT with the in-place, in-order prime factor FFT algorithm
Kin‐Man Lam, Hong Yan · IEEE Transactions on Signal Processing · 1995
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.>