Changes between Version 9 and Version 10 of Examples/Fft2dHighpass


Ignore:
Timestamp:
May 17, 2010, 8:06:59 AM (14 years ago)
Author:
Ben Lippmeier
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • Examples/Fft2dHighpass

    v9 v10  
    4646|| Using FFTW on Estimate mode || 0.09 || [http://code.haskell.org/repa/repa-head/repa-examples/FFT/HighPass/legacy/c/FFTW.c FFTW.c] ||
    4747
     48The 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.
     49
     50Jones's version also uses a 1d radix-2 DIT FFT kernel, but it first reorders the values then performs a in-place transform using three nested loops.
     51
     52FFTW contains deep magic, and is comparable with vendor optimised versions.
    4853
    4954
    50