s*****k
发帖数: 3 | 1 i am trying to write code for fft myself. of cause i think it is ok if it can
run. someone can tell me some references on fft algorithm.
thanks! |
m****n
发帖数: 51 | 2 nRC
can
【在 s*****k 的大作中提到】
: i am trying to write code for fft myself. of cause i think it is ok if it can
: run. someone can tell me some references on fft algorithm.
: thanks!
|
w**f
发帖数: 7794 | 3 google.
【在 s*****k 的大作中提到】
: i am trying to write code for fft myself. of cause i think it is ok if it can
: run. someone can tell me some references on fft algorithm.
: thanks!
|
d*****w
发帖数: 124 | 4 waste time. r u sure u can beat FFTW?
can
【在 s*****k 的大作中提到】
: i am trying to write code for fft myself. of cause i think it is ok if it can
: run. someone can tell me some references on fft algorithm.
: thanks!
|
t*****o
发帖数: 74 | 5 why bother to write it by youself?
there are many very good standard fft routines
very fast and stable
already developed tens year by supercomputer center |
S***y
发帖数: 186 | 6 I think the problem is that the best algorithms are usually not
well documented.
【在 d*****w 的大作中提到】
: waste time. r u sure u can beat FFTW?
:
: can
|
X****r
发帖数: 3557 | 7 IMHO, the documentation of fftw is good enough.
【在 S***y 的大作中提到】
: I think the problem is that the best algorithms are usually not
: well documented.
|
s*****k
发帖数: 3 | 8 I ever tried two different formulas of Fourier transform. One worked well, but
the other didn't. To know them more clearly, I try to write the code myself.
I don't expect that it will be nice to work on every machine or in any code,
but I hope it works well when I test it.
From www.google.com, it seems not easy to find some useful algorithm except
the private codes. Here somebody can show me the FFT algorithm.
Thanks!
it
【在 t*****o 的大作中提到】
: why bother to write it by youself?
: there are many very good standard fft routines
: very fast and stable
: already developed tens year by supercomputer center
|
