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,FREEMAIL_FROM autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,101749b7bab4e562 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!postnews.google.com!not-for-mail From: gautier_niouzes@hotmail.com (Gautier) Newsgroups: comp.lang.ada Subject: Re: FFT Date: 14 Apr 2005 02:11:47 -0700 Organization: http://groups.google.com Message-ID: <17cd177c.0504140111.771a2045@posting.google.com> References: NNTP-Posting-Host: 213.173.163.2 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Trace: posting.google.com 1113469908 27674 127.0.0.1 (14 Apr 2005 09:11:48 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Thu, 14 Apr 2005 09:11:48 +0000 (UTC) Xref: g2news1.google.com comp.lang.ada:10453 Date: 2005-04-14T02:11:47-07:00 List-Id: # 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!