ForSyDe.Shallow.DFT

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.

Documentation

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

The function dft performs a standard Discrete Fourier Transformation

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

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