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 performance benchmarks on different platforms.
標(biāo)簽：
implementation
Cooley-Tukey
describes
efficient
上傳時(shí)間：
2013-12-23
上傳用戶：netwolf
