MathGroup Archive 1999

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Fourier and FFT: Powers of 2 only?


In article <7a29pk$1pm at smc.vnet.net>, "Peltio" <pelt.ioNOS at PAMiol.it> wrote:

>Since FFT procs work best with sets of points whose number is a power of
>2, what does Fourier[] do when it's fed a set of, say, 200 points? Will
>it extend to 256 by adding zeros, or split it in subsets that are power
>of 2, or whatever?
 
Fourier[] definately works on any number of points without zero padding. 
I'm not sure how it works, but I suspect it has some kind of adaptive
algorithm that breaks up the list into the smallest number of power 2
lists as possible.  I also suspect that the speed of Fourier[] depends on
how "close" your list is to a simple integer power of 2, but I have not
tested it.  In my applicaions it has always been fast enough that I
haven't bothered to think about it.

-- 
Jim Jennings                                
Research Associate              jenningsj at mail.utexas.edu
Bureau of Economic Geology      (512) 471-4364 (voice)
University of Texas at Austin   (512) 471-0140 (fax)


  • Prev by Date: Re: List manipulation question
  • Next by Date: Re: List manipulation question
  • Previous by thread: Fourier and FFT: Powers of 2 only?
  • Next by thread: Re: Fourier and FFT: Powers of 2 only?