FFT using the Accelerate library https://github.com/AccelerateHS/accelerate-fft
|Latest on Hackage:||184.108.40.206|
This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.
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, but must be explicitly enabled.
Refer to the main Accelerate package for more information: http://hackage.haskell.org/package/accelerate