[Numpy-discussion] Enhancements for NumPy's FFTs

[Charles R Harris]

On Sat, Mar 14, 2009 at 3:58 PM, Sturla Molden <sturla at molden.no> wrote:

> > On Sat, Mar 14, 2009 at 2:24 PM, Charles R Harris
>
> >> Give it a shot. Note that the fft transforms also use int instead of
> >> intp,
> >> which limits the maximum transform size to 32 bits. Fixing that is
> >> somewhere
> >> on my todo list but I would be happy to leave it to you ;) Although I
> >> expect
> >> transforms > 2GB aren't all that common.
> >>
> >
> > On the reentrant bit, IIRC fftpack builds a table of sin/cos. It might be
> > worth checking/making that thread safe.
>
> Thanks, I'll take a careful look at it.
>

There is also a ticket (#579) to add an implementation of the Bluestein
algorithm for doing prime order fft's.  This could also be used for zoom
type fft's. There is lots of fft stuff to be done. I wonder if some of it
shouldn't go in Scipy? I think David added some dcts to Scipy.

Chuck
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/numpy-discussion/attachments/20090314/9a706f86/attachment.html>