 |
FFT
References : Toth Laszlo
Linked file : rvfft.ps,rvfft.cpp
Notes :
A paper (postscript) and some C++ source for 4 different fft algorithms, compiled by Toth Laszlo from the Hungarian Academy of Sciences Research Group on Artificial Intelligence.
Toth says: "I've found that Sorensen's split-radix algorithm was the fastest, so I use this since then (this means that you may as well delete the other routines in my source - if you believe my results)."
|
Comments
There are no comments on this item |
Add your own comment
Comments are displayed in fixed width, no HTML code allowed! |
|
|
|
|
