C. Sidney Burrus authored notes on the Fast Fourier transform. The treatment includes the prime-factor algorithm, which exploits coprime transform lengths to reorganize a discrete Fourier transform. A suitable index map separates the calculation into smaller transforms without the interstage twiddle multiplications required by the usual Cooley-Tukey arrangement.[ref]
New to topics? Read the docs here!