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 classical implementation. The efficiency is proved by pe ...
/dl/486330.html
标签：
implementation
Cooley-Tukey
describes
efficient
上传时间：
2013-12-23
上传用户：netwolf
