From owner-freebsd-hackers Mon Aug 3 06:22:14 1998 Return-Path: Received: (from majordom@localhost) by hub.freebsd.org (8.8.8/8.8.8) id GAA23617 for freebsd-hackers-outgoing; Mon, 3 Aug 1998 06:22:14 -0700 (PDT) (envelope-from owner-freebsd-hackers@FreeBSD.ORG) Received: from cyclone.degnet.baynet.de (www.degnet.baynet.de [194.95.214.129]) by hub.freebsd.org (8.8.8/8.8.8) with SMTP id GAA23611 for ; Mon, 3 Aug 1998 06:22:12 -0700 (PDT) (envelope-from malte.lance@gmx.net) Received: from neuron.webmore.de (unverified [194.95.214.177]) by cyclone.degnet.baynet.de (EMWAC SMTPRS 0.83) with SMTP id ; Mon, 03 Aug 1998 15:23:25 +0200 Received: (from malte.lance@gmx.net) by neuron.webmore.de (8.8.8/8.8.8) id PAA04096; Mon, 3 Aug 1998 15:08:11 +0200 (CEST) From: Malte Lance MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Date: Mon, 3 Aug 1998 15:08:11 +0200 (CEST) To: Luoqi Chen Cc: reilly@zeta.org.au, hackers@FreeBSD.ORG, jgrosch@mooseriver.com, shocking@prth.pgs.com Subject: Re: Fast FFT routines with source? In-Reply-To: <199808031101.HAA12632@lor.watermarkgroup.com> References: <199808031101.HAA12632@lor.watermarkgroup.com> X-Mailer: VM 6.43 under 20.4 "Emerald" XEmacs Lucid Message-ID: <13765.46057.61247.598795@neuron.webmore.de> Reply-To: malte.lance@gmx.net Sender: owner-freebsd-hackers@FreeBSD.ORG Precedence: bulk X-Loop: FreeBSD.ORG Luoqi Chen writes: > > > No, Numerical Recipes is not even a little bit optimised, and > > > although the Fortran version is OK, the C version is horrible, > > > being a translitteration from the Fortran version, for the most > > > part. The hackery to get Fortran-style offset-1 array indexing is > > > particularly nasty. > > > > Had the same feelings abouot NR. More of an recipe "how to write a > > fft (... and introduce maximal confusion by strange indexing)". > > > Code samples (yes, they are samples, I never use them as they are) in NR > are horrible, but no other book could beat NR on explaining how an > algorithm works (have you read the FFT section in Sedgewick's Algorithms? > Instead of explaining how *FFT* works, it tries to explain what are > roots of unity, does that belong to a high school Algebra book?) Don't know about US-highschools. To know "how FFT works", you have to know what this nasty numbers in the frequency-domain stand for and where they come from. Also you need to know why you are able to reuse intermediary calculation-results (bit-reversion/reordering). The answers to this questions are easy, when you have knowledge about unit-roots and exponentials. Unit-roots and exponentials are really not that hard, that they shouldn't be explained in a basic-level analysis or algebra book. Malte. > > -lq To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message