Changes between Version 8 and Version 9 of Examples/Fft2dHighpass


Ignore:
Timestamp:
May 17, 2010, 7:57:42 AM (15 years ago)
Author:
Ben Lippmeier
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • Examples/Fft2dHighpass

    v8 v9  
    1111== Code ==
    1212
    13 The main algorithm is at http://code.haskell.org/repa/repa-stable/repa-algorithms/Data/Array/Repa/Algorithms/FFT.hs
     13The main algorithm is at [http://code.haskell.org/repa/repa-stable/repa-algorithms/Data/Array/Repa/Algorithms/FFT.hs FFT.hs]
    1414
    15 The wrapper is at http://code.haskell.org/repa/repa-stable/repa-examples/FFT/src/HighPass/Main.hs
     15The wrapper is at [http://code.haskell.org/repa/repa-stable/repa-examples/FFT/src/HighPass/Main.hs Main.hs]
    1616
    1717== Test Data ==
    … …  
    3939|| 8 || 3.39 ||
    4040
     41=== Comparisons ===
    4142
     43|| Version || Time(s) || Source ||
     44|| Using Data.Vector.Unboxed || 2.88 || [http://code.haskell.org/repa/repa-head/repa-examples/FFT/HighPass/legacy/vector/ FFT.hs] ||
     45|| 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] ||
     47
     48
     49
     50