Re: FFT

[Pascal Obry <pascal@obry.net>]

tmoran@acm.org writes:

> In addition to FFTW, there's also http://cr.yp.to/djbfft.html which
> doesn't appear to have any restrictions.  It appears to be for very fast
> computation of powers of two FFTs.  It's in very nasty C, though.  I have
> here a package fft_pack with Glassman's algorithm for arbitrary N, but I
> can't seem to track its provenance.  If speed isn't an issue, it's quite
> convenient.  Numerical Recipes in Fortran (etc) has source and discussion
> of various FFT situations.

I don't think speed is really an issue for now. Is it standalone ? I found one
on the net (don't have the name now) but it required some other packages...
Anyway, I'll be glad to have a look. Thanks.

Pascal.

-- 

--|------------------------------------------------------
--| Pascal Obry                           Team-Ada Member
--| 45, rue Gabriel Peri - 78114 Magny Les Hameaux FRANCE
--|------------------------------------------------------
--|              http://www.obry.net
--| "The best way to travel is by means of imagination"
--|
--| gpg --keyserver wwwkeys.pgp.net --recv-key C1082595