Title :
Computing the inverse DFT with the in-place, in-order prime factor FFT algorithm
Author :
Lam, Kin-Man ; Yan, Hong
Author_Institution :
Dept. of Electr. Eng., Sydney Univ., NSW, Australia
fDate :
9/1/1995 12:00:00 AM
Abstract :
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
Keywords :
computational complexity; discrete Fourier transforms; fast Fourier transforms; inverse problems; signal processing; IDFT; computational time; in-order prime factor FFT algorithm; in-place prime factor FFT algorithm; input index mapping equations; inverse DFT; inverse discrete Fourier transform; output index mapping equations; program length; signal procesing; Costs; Digital signal processing; Discrete Fourier transforms; Equations; Indexing; Multidimensional systems; Signal processing algorithms;
Journal_Title :
Signal Processing, IEEE Transactions on
