pure-fft-0.2.0: Fast Fourier Transform

Portabilityportable
Stabilityexperimental
MaintainerMatt Morrow <mjm2002@gmail.com>

Numeric.FFT

Description

A radix-2 DIT version of the Cooley-Tukey FFT algorithm.

Synopsis

Documentation

fft :: [Complex Double] -> [Complex Double]Source

O(n lg n). A radix-2 DIT (decimation-in-time) version of the Cooley-Tukey FFT algorithm. The length of the input list must be a power of two, or only the prefix of the list of length equal to the largest power of two less than the length of the list will be transformed.

ifft :: [Complex Double] -> [Complex Double]Source

dft :: [Complex Double] -> [Complex Double]Source

O(n^2). The Discrete Fourier Transform.

idft :: [Complex Double] -> [Complex Double]Source