利用经典的Cooley-Tukey基2算法求复序列的DFT-Use of the classic Cooley-Tukey radix-2 algorithm for complex sequence of DFT

This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. Thank to the recursive nature of the FFT, the source code is more readable and faster than the classi

twiddle factor - a part of cooley-tukey algorithm

Algorithm Cooley Tukey (FFT).