By Topic

Computing the inverse DFT with the in-place, in-order prime factor FFT algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kin-Man Lam ; Dept. of Electr. Eng., Sydney Univ., NSW, Australia ; Hong Yan

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

Published in:

Signal Processing, IEEE Transactions on  (Volume:43 ,  Issue: 9 )