[SciPy-dev] fft

Pearu Peterson pearu at cens.ioc.ee
Thu May 8 16:27:41 CDT 2003


On Thu, 8 May 2003, Chuck Harris wrote:

> 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

See
  scipy/Lib/fftpack/tests/test_basic.py

The test_*fft classes define bench_* methods that
measure the efficiency of various fft implementations.

To run fftpack tests without building the whole scipy, do

  cd scipy/Lib/fftpack/
  python setup_fftpack.py build
  python tests/test_basic.py 10

Pearu




More information about the Scipy-dev mailing list