Answers are grounded in this paper and cite their sources.
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Qian et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: