From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,1064b1ab66c60577
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2004-02-13 04:36:09 PST
Path: 
 archiver1.google.com!news2.google.com!news.maxwell.syr.edu!logbridge.uoregon.edu!server3.netnews.ja.net!south.jnrs.ja.net!not-for-mail
From: Dr Steve Sangwine <sjs@essex.ac.uk>
Newsgroups: comp.lang.ada
Subject: Re: fast FFT code
Date: Fri, 13 Feb 2004 12:36:05 +0000
Organization: Janet Usenet Reading Service.
Message-ID: <cvgp2011k5c2cg9d3idobrjv47oq427dfs@4ax.com>
References: <h_wWb.9328$_44.11478@attbi_s52>
NNTP-Posting-Host: hyper4.essex.ac.uk
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Trace: south.jnrs.ja.net 1076675767 29634 155.245.41.213 (13 Feb 2004
 12:36:07 GMT)
X-Complaints-To: usenet@south.jnrs.ja.net
NNTP-Posting-Date: Fri, 13 Feb 2004 12:36:07 +0000 (UTC)
X-Newsreader: Forte Free Agent 1.93/32.576 English (American)
Xref: archiver1.google.com comp.lang.ada:5523
Date: 2004-02-13T12:36:05+00:00
List-Id: <comp.lang.ada>

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