Changes between Version 12 and Version 13 of Examples/Fft2dHighpass


Ignore:
Timestamp:
May 17, 2010, 8:12:44 AM (10 years ago)
Author:
benl
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • Examples/Fft2dHighpass

    v12 v13  
    4444|| Using Data.Vector.Unboxed || 2.88 || [http://code.haskell.org/repa/repa-head/repa-examples/FFT/HighPass/legacy/vector/FFT.hs FFT.hs] ||
    4545|| Using Jones's inplace C implementation || 0.24 || [http://code.haskell.org/repa/repa-head/repa-examples/FFT/HighPass/legacy/c/Jones.c Jones.c] ||
    46 || Using FFTW on Estimate mode || 0.09 || [http://code.haskell.org/repa/repa-head/repa-examples/FFT/HighPass/legacy/c/FFTW.c FFTW.c] ||
     46|| Using FFTW using Estimate mode || 0.09 || [http://code.haskell.org/repa/repa-head/repa-examples/FFT/HighPass/legacy/c/FFTW.c FFTW.c] ||
    4747
    4848The vector version uses the same radix-2 decimation in time (DIT) algorithm as the Repa version, but is not rank generalised. It applies a recursive 1d FFT to each row and then transposes the matrix, twice each.