Modulestatistics-0.16.5.0Haskell2010

Statistics.Transform

Fourier-related transformations of mathematical functions.

These functions are written for simplicity and correctness, not speed. If you need a fast FFT implementation for your application, you should strongly consider using a library of FFTW bindings instead.

Contents

Type synonyms
Discrete cosine transform
Fast Fourier transform

Synopsis

type CD
value dct
value dct_
value idct
value idct_
value fft
value ifft

Packagestatistics-0.16.5.0
Exports7
LanguageHaskell2010
LicenceBSD-2-Clause
SourceTransform.hs

Type synonyms

typetype CD = Complex Double

Discrete cosine transform

valuedct :: (Vector v CD, Vector v Double, Vector v Int) => v Double -> v Double

Source#

Discrete cosine transform (DCT-II).

valuedct_ :: (Vector v CD, Vector v Double, Vector v Int) => v CD -> v Double

Source#

Discrete cosine transform (DCT-II). Only real part of vector is transformed, imaginary part is ignored.

valueidct :: (Vector v CD, Vector v Double) => v Double -> v Double

Source#

Inverse discrete cosine transform (DCT-III). It's inverse of dct only up to scale parameter:

(idct . dct) x = (* length x)

valueidct_ :: (Vector v CD, Vector v Double) => v CD -> v Double

Source#

Inverse discrete cosine transform (DCT-III). Only real part of vector is transformed, imaginary part is ignored.

Fast Fourier transform

valuefft :: Vector v CD => v CD -> v CD

Source#

Radix-2 decimation-in-time fast Fourier transform.

valueifft :: Vector v CD => v CD -> v CD

Source#

Inverse fast Fourier transform.