Namespaces

Types in MathNet.Numerics.IntegralTransforms.Algorithms

Type DiscreteFourierTransform

Namespace MathNet.Numerics.IntegralTransforms.Algorithms

Complex Fast (FFT) Implementation of the Discrete Fourier Transform (DFT).

Methods

Public instance methods

void BluesteinForward(Complex[] samples, FourierOptions options)

Bluestein forward FFT for arbitrary sized sample vectors.
Parameters
Complex[] samples

Sample vector, where the FFT is evaluated in place.

FourierOptions options

Fourier Transform Convention Options.

void BluesteinInverse(Complex[] samples, FourierOptions options)

Bluestein inverse FFT for arbitrary sized sample vectors.
Parameters
Complex[] samples

Sample vector, where the FFT is evaluated in place.

FourierOptions options

Fourier Transform Convention Options.

Complex[] NaiveForward(Complex[] timeSpace, FourierOptions options)

Naive forward DFT, useful e.g. to verify faster algorithms.
Parameters
Complex[] timeSpace

Time-space sample vector.

FourierOptions options

Fourier Transform Convention Options.

Return
Complex[]

Corresponding frequency-space vector.

Complex[] NaiveInverse(Complex[] frequencySpace, FourierOptions options)

Naive inverse DFT, useful e.g. to verify faster algorithms.
Parameters
Complex[] frequencySpace

Frequency-space sample vector.

FourierOptions options

Fourier Transform Convention Options.

Return
Complex[]

Corresponding time-space vector.

void Radix2Forward(Complex[] samples, FourierOptions options)

Radix-2 forward FFT for power-of-two sized sample vectors.
Parameters
Complex[] samples

Sample vector, where the FFT is evaluated in place.

FourierOptions options

Fourier Transform Convention Options.

void Radix2Inverse(Complex[] samples, FourierOptions options)

Radix-2 inverse FFT for power-of-two sized sample vectors.
Parameters
Complex[] samples

Sample vector, where the FFT is evaluated in place.

FourierOptions options

Fourier Transform Convention Options.