> I'm going to be needing an FFT algorithm soon, so your advice on this
> subject is very timely. Thanks.
No problem. I was very happy when I discovered FFTW. For most
problems and most users it removes the need to think about FFT
algorithms and lets you get on to other things.
> However, are there any available routines to get an arbitrary number of
> data points into a 2 power N length set (I assume you have to do this
> to the data?)
Actually, FFTW works very well on arbitrary length arrays. Of course
it is fastest on lengths that are factorable into products of small
integers, but it will happily do prime lengths.
Cheers,
-- Paul
--
Dr. Paul S. Ray WWW : http://xweb.nrl.navy.mil/personnel/paulr/
NRL, Code 7655 E-mail: email@hidden
Washington, DC 20375 Phone : (202) 404-1619
_______________________________________________
scitech mailing list | email@hidden
Help/Unsubscribe/Archives: http://www.lists.apple.com/mailman/listinfo/scitech
Do not post admin requests to the list. They will be ignored.
