FFT using the Accelerate library.

Rank-polymorphic discrete Fourier transform (DFT), computed with a fast Fourier transform (FFT) algorithm using the Accelerate library. Note that optimised implementations are available via foreign libraries (enabled by default).

Refer to the main Accelerate package for more information: http://hackage.haskell.org/package/accelerate

FFT components for the Accelerate language

FFT library for the embedded array language Accelerate. For details on Accelerate, refer to the main repository.

The following build flags control whether optimised implementations are used. Note that enabling these (which is the default) will require the corresponding Accelerate backend as a dependency:

• llvm-ptx: For NVIDIA GPUs
• llvm-cpu: For multicore CPUs

Contributions and bug reports are welcome!
Please feel free to contact me through GitHub or gitter.im.