Check out my first novel, midnight's simulacra!
Bluestein's FFT: Difference between revisions
From dankwiki
(Created page with "Also known as the chirp z-transform algorithm, Bluestein's FFT implements DFT as a convolution. It achieves O(NlgN) running time for prime arguments, though its performance is...") |
(No difference)
|
Latest revision as of 13:11, 13 March 2013
Also known as the chirp z-transform algorithm, Bluestein's FFT implements DFT as a convolution. It achieves O(NlgN) running time for prime arguments, though its performance is usually inferior to Cooley-Tukey for composite arguments.
