Re: Fourier transform
- To: mathgroup at smc.vnet.net
- Subject: [mg13954] Re: Fourier transform
- From: David Annetts <dannetts at laurel.ocs.mq.edu.au>
- Date: Fri, 11 Sep 1998 15:06:44 -0400
- Organization: CRCAMET/Macquarie University
- References: <6t2k48$41j@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Hi Jens-Peer > Fourier[] implements a numerical fast fourier transform. That means that > the data passed to Fourier[] are the function values f(t) on the > interval t in [0,2Pi) with constant increment. The data are assumed to > be periodic in t with period 2Pi. My understanding was that Fourier implemented a Discrete Fourier Transform as a general case, and a Fast Fourier Transform if your data length an integer power of 2. -- ================================================================== David Annetts _____________ http://www.ocs.mq.edu.au/~dannetts/ |C R C A M E T| |-------------| |_____ | CRC for Australian Mineral |````` \ | Exploration Technologies |`````/$\ | Earth Sciences |````/$$$\____| Macquarie University, NSW 2109 |```/$$$/.....| AUSTRALIA |``/$$$/......| phone: +(1-61-2) 9850 9280, fax (1-61-2) 9850 8366 ------------- ==================================================================