Check out my first novel, midnight's simulacra!

Bluestein's FFT

From dankwiki
Revision as of 13:11, 13 March 2013 by Dank (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.

Retrieved from "https://nick-black.com/dankwiki/index.php?title=Bluestein%27s_FFT&oldid=5245"