Self-sorting in-place FFT algorithm with minimum working space
IEEE Transactions on Signal Processing1994Vol. 42(10), pp. 2835–2836
Citations Over TimeTop 16% of 1994 papers
Abstract
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 p/sup 2/ to p+1, providing a better match to the limited number of registers in a CPU.>
Related Papers
- → An extended split-radix FFT algorithm(2001)86 cited
- → General FFT pruning algorithm(2002)49 cited
- → Development and Performance Analysis of a Novel Single-bin FFT Algorithm(2022)1 cited
- → Comparison of a new multiple radix fast Fourier number theoretic transform with FFT algorithms in terms of performance and hardware cost(2002)2 cited