Changes between Version 9 and Version 10 of Examples/Fft2dHighpass
 Timestamp:
 May 17, 2010, 8:06:59 AM (10 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Examples/Fft2dHighpass
v9 v10 46 46  Using FFTW on Estimate mode  0.09  [http://code.haskell.org/repa/repahead/repaexamples/FFT/HighPass/legacy/c/FFTW.c FFTW.c]  47 47 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. 49 50 Jones's version also uses a 1d radix2 DIT FFT kernel, but it first reorders the values then performs a inplace transform using three nested loops. 51 52 FFTW contains deep magic, and is comparable with vendor optimised versions. 48 53 49 54 50