ForSyDe.Deep.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 :: forall s. Nat s => FSVec s (Complex Double) -> FSVec s (Complex Double)

The function dft performs a standard Discrete Fourier Transformation

fft :: (Nat s, IsPowOf D2 s) => FSVec s (Complex Double) -> FSVec s (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.