comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » FFTs in IDL
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
FFTs in IDL [message #5760] Thu, 15 February 1996 00:00 Go to previous message
tom is currently offline  tom
Messages: 28
Registered: April 1995
Junior Member
Newsgroups: comp.lang.idl-pvwave
Expires:
Sender:
Followup-To: tom@quake.stanford.edu
Distribution:
Organization: Stanford University, CA USA
Cc:
Subject: IDL FFT Efficiency and Alternatives
Summary:

Does anyone know which algorithm the FFT.PRO routine uses? The manual
implies that it is the Cooley-Tukey with "convert-to-complex" algorithm.
This should be very much slower than the algorithms tailored for real
data (especially for large 2-D images like the ones I'm trying to filter).

Numerical Recipes lists some but they are the old "N = factor of 2 or die"
variety and zero padding a 1300x1024 array to 2048x1200 just seems like
a really stupid thing to do. The Winograd algorithms would be ideal here.

A related question: if I end up having to not be lazy and type in a book
algorithm, would it be faster to implement as a CALL_EXTERNAL or a native
IDL routine? I have no experience with external calls; someone told me they
can be slow due to translation (?).

Replies by email please.

Tom Berger
Center for Space Science and Astrophysics
Stanford University

tom@quake.stanford.edu
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: For IDL and vgrind users: sample vgrindefs
Next Topic: polar surface plots

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Wed Oct 08 15:33:31 PDT 2025

Total time taken to generate the page: 0.00418 seconds