forsyde-shallow-3.5.0.0: ForSyDe's Haskell-embedded Domain Specific Language.
Copyright(c) ForSyDe Group KTH 2007-2008
LicenseBSD-style (see the file LICENSE)
Maintainerforsyde-dev@ict.kth.se
Stabilityexperimental
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell2010

ForSyDe.Shallow.Utility.DFT

Description

This module includes the standard Discrete Fourier Transform (DFT) function, and a fast Fourier transform (FFT) algorithm, for computing the DFT, when the input vectors' length is a power of 2.

Synopsis

Documentation

dft :: Int -> Vector (Complex Double) -> Vector (Complex Double) Source #

The function dft performs a standard Discrete Fourier Transformation

fft :: Int -> Vector (Complex Double) -> Vector (Complex Double) Source #

The function fft implements a fast Fourier transform (FFT) algorithm, for computing the DFT, when the size N is a power of 2.