Changes between Version 12 and Version 13 of Examples/Fft2dHighpass
 Timestamp:
 05/17/10 09:12:44 (5 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Examples/Fft2dHighpass
v12 v13 44 44  Using Data.Vector.Unboxed  2.88  [http://code.haskell.org/repa/repahead/repaexamples/FFT/HighPass/legacy/vector/FFT.hs FFT.hs]  45 45  Using Jones's inplace C implementation  0.24  [http://code.haskell.org/repa/repahead/repaexamples/FFT/HighPass/legacy/c/Jones.c Jones.c]  46  Using FFTW onEstimate mode  0.09  [http://code.haskell.org/repa/repahead/repaexamples/FFT/HighPass/legacy/c/FFTW.c FFTW.c] 46  Using FFTW using Estimate mode  0.09  [http://code.haskell.org/repa/repahead/repaexamples/FFT/HighPass/legacy/c/FFTW.c FFTW.c]  47 47 48 48 The vector version uses the same radix2 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.