* fast FFT code
@ 2004-02-11 21:18 tmoran
2004-02-13 12:36 ` Dr Steve Sangwine
0 siblings, 1 reply; 2+ messages in thread
From: tmoran @ 2004-02-11 21:18 UTC (permalink / raw)
Can someone point me to an Ada fast FFT code somewhere? In particular for
2D real correlations. I have the "fft_pack" (Glassman's algorithm) but
it's quite general and can presumably be improved on. djbfft 0.76 claims
to be the fastest around, but it's set up for Unix systems and I find it
unreadable, and thus untranslatable, C.
^ permalink raw reply [flat|nested] 2+ messages in thread
* Re: fast FFT code
2004-02-11 21:18 fast FFT code tmoran
@ 2004-02-13 12:36 ` Dr Steve Sangwine
0 siblings, 0 replies; 2+ messages in thread
From: Dr Steve Sangwine @ 2004-02-13 12:36 UTC (permalink / raw)
On Wed, 11 Feb 2004 21:18:05 GMT, tmoran@acm.org wrote:
>Can someone point me to an Ada fast FFT code somewhere? In particular for
>2D real correlations. I have the "fft_pack" (Glassman's algorithm) but
>it's quite general and can presumably be improved on. djbfft 0.76 claims
>to be the fastest around, but it's set up for Unix systems and I find it
>unreadable, and thus untranslatable, C.
Does the FFT have to be written in Ada? How about fast C code and an
Ada binding? If this would do, look at FFTW (www.fftw.org) and my
FFTW_Ada binding
(http://privatewww.essex.ac.uk/~sjs/fftw_ada/fftwa.html) (not yet
modified for the most recent release of FFTW, but it works with the
previous one).
Steve Sangwine
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2004-02-13 12:36 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2004-02-11 21:18 fast FFT code tmoran
2004-02-13 12:36 ` Dr Steve Sangwine
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox