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
Path: 
 g2news2.google.com!news4.google.com!proxad.net!feeder1-2.proxad.net!news.cs.univ-paris8.fr!gegeweb.org!aioe.org!not-for-mail
From: tmoran@acm.org
Newsgroups: comp.lang.ada
Subject: Re: Fourier
Date: Fri, 17 Jul 2009 07:37:25 +0000 (UTC)
Organization: Aioe.org NNTP Server
Message-ID: <h3p9nl$vcg$1@aioe.org>
References: <9pvft0a87qq$.11jq55zbrc49c$.dlg@40tude.net>
NNTP-Posting-Host: jsj6/wjO/cHSAHkcGxcp1Q.user.aioe.org
X-Complaints-To: abuse@aioe.org
X-Notice: Filtered by postfilter v. 0.7.9
X-Newsreader: Tom's custom newsreader
Cancel-Lock: sha1:vSbZu72WtJHf8+/InJzWxMZLVZg=
Xref: g2news2.google.com comp.lang.ada:7101
Date: 2009-07-17T07:37:25+00:00
List-Id: <comp.lang.ada>

> One implementation of FFT is mentioned at AdaIC:
  There are many around - do you want an FFT for general (composite)
N, or just powers of two.  Do you want to link in highly optimized
routines for particular sizes, or just something simple to use.