Bluestein's FFT

From dankwiki

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.