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