From: gautier_niouzes@hotmail.com (Gautier)
Subject: Re: FFT
Date: 14 Apr 2005 02:11:47 -0700
Date: 2005-04-14T02:11:47-07:00 [thread overview]
Message-ID: <17cd177c.0504140111.771a2045@posting.google.com> (raw)
In-Reply-To: gN-dnVfOWI-J_8DfRVn-1Q@comcast.com
# 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.
Speaking of Numerical Recipes, you can pass the Pascal version,
available on the Web, through P2Ada which was improved for
that purpose.
-> http://www.mysunrise.ch/users/gdm/gsoft.htm#p2ada
HTH
______________________________________________________________
Gautier -- http://www.mysunrise.ch/users/gdm/index.htm
Ada programming -- http://www.mysunrise.ch/users/gdm/gsoft.htm
NB: For a direct answer, e-mail address on the Web site!
next prev parent reply other threads:[~2005-04-14 9:11 UTC|newest]
Thread overview: 7+ messages / expand[flat|nested] mbox.gz Atom feed top
2005-04-13 8:29 FFT Pascal Obry
2005-04-13 11:22 ` FFT Jeff C
2005-04-13 18:02 ` FFT Pascal Obry
2005-04-13 18:16 ` FFT tmoran
2005-04-14 9:11 ` Gautier [this message]
2005-04-14 18:20 ` FFT Pascal Obry
2005-04-14 18:19 ` FFT Pascal Obry
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox