ForSyDe-3.0: ForSyDe's Haskell-embedded Domain Specific Language.Source codeContentsIndex
ForSyDe.Shallow.DFT
Portabilityportable
Stabilityexperimental
Maintainerforsyde-dev@ict.kth.se
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
dft :: Int -> Vector (Complex Double) -> Vector (Complex Double)
fft :: Int -> Vector (Complex Double) -> Vector (Complex Double)
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.
Produced by Haddock version 2.1.0