[SciPy-dev] fft

Chuck Harris Chuck.Harris at sdl.usu.edu
Thu May 8 15:56:13 CDT 2003

Hi All,

I've implemented a simple - but apparently little known - variant
of the radix 2 fft that has an operation count equivalent to the
split radix 2,4,8,16,... algorithm. I have C code for both the
fft and the fht (fast hartley transform).

Anyway, I noted some while back that someone was doing timing benchmarks
on various fft implementations, and I would like to replicate this same
test suite with the new algorithms to see how they compare. Can someone
point me in the right direction? TIA


More information about the Scipy-dev mailing list