By Topic

Self-sorting in-place FFT algorithm with minimum working space

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

4 Author(s)
Qian, Z. ; Aware Inc., Cambridge, MA, USA ; Lu, C. ; An, M. ; Tolimieri, R.

Presents a modification of Temperton's (1991) self-sorting, in-place radix-p FFT algorithm. This modification reduces the required temporary working space from order of p2 to p+1, providing a better match to the limited number of registers in a CPU

Published in:

Signal Processing, IEEE Transactions on  (Volume:42 ,  Issue: 10 )