Safe Haskell | None |
---|---|
Language | Haskell2010 |
This module exposes functions for performing
Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT)
over Contiguous
data structures.
Synopsis
- fft :: forall arr. (Contiguous arr, Element arr (Complex Double)) => arr (Complex Double) -> arr (Complex Double)
- ifft :: forall arr. (Contiguous arr, Element arr (Complex Double)) => arr (Complex Double) -> arr (Complex Double)
- mfft :: forall arr m. (PrimMonad m, Contiguous arr, Element arr (Complex Double)) => Mutable arr (PrimState m) (Complex Double) -> m ()
Documentation
fft :: forall arr. (Contiguous arr, Element arr (Complex Double)) => arr (Complex Double) -> arr (Complex Double) Source #
Radix-2 decimation-in-time fast Fourier Transform. The given array must have a length that is a power of two.