From: tmoran@acm.org
Subject: Re: FFT
Date: Wed, 13 Apr 2005 13:16:52 -0500
Date: 2005-04-13T13:16:52-05:00 [thread overview]
Message-ID: <gN-dnVfOWI-J_8DfRVn-1Q@comcast.com> (raw)
In-Reply-To: jKSdnRosOqRuncDfRVn-oQ@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.
next prev parent reply other threads:[~2005-04-13 18:16 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 ` tmoran [this message]
2005-04-14 9:11 ` FFT Gautier
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