Mail Archives: djgpp/1997/02/06/16:35:44
Jason Stratos Papadopoulos wrote:
>
> PS: How *do* you make an FFT that's cache friendly? It could probably
> help me a lot.
There is an algorithm for memory local FFT (fft of data which do not fit
in memory) in Numerical Recipes in C 2nd edition (Cambridge University
Pres), paragraph 12.6.
Also, for FFT of numbers close to the size of your machine memory, beware
of malloc() : it rounds the data it needs *plus some small header size*
to the higher power of two : so malloc'ing 2^N bytes always uses 2^(N+1)
bytes...
Francois
- Raw text -