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,start
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2004-02-11 13:18:05 PST
Path: 
 archiver1.google.com!news2.google.com!news.maxwell.syr.edu!wn53feed!worldnet.att.net!attbi_s52.POSTED!not-for-mail
From: tmoran@acm.org
Newsgroups: comp.lang.ada
Subject: fast FFT code
X-Newsreader: Tom's custom newsreader
Message-ID: <h_wWb.9328$_44.11478@attbi_s52>
NNTP-Posting-Host: 67.161.24.134
X-Complaints-To: abuse@comcast.net
X-Trace: attbi_s52 1076534285 67.161.24.134 (Wed, 11 Feb 2004 21:18:05 GMT)
NNTP-Posting-Date: Wed, 11 Feb 2004 21:18:05 GMT
Organization: Comcast Online
Date: Wed, 11 Feb 2004 21:18:05 GMT
Xref: archiver1.google.com comp.lang.ada:5454
Date: 2004-02-11T21:18:05+00:00
List-Id: <comp.lang.ada>

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.