Direct Discrete Fourier Transform.
Algorithm computational order: O(N^2).
Returns the complex spectrum of the given complex input signal.
Quickly becomes slower than the FFT if the length of the input
block is greater than about 100.
Direct Inverse Discrete Fourier Transform.
Algorithm computational order: O(N^2).
Returns the complex spectrum of the given complex input signal.
Quickly becomes slower than the IFFT if the length of the input
block is greater than about 100.
Block<type>
DirectMDCT(Block<type>& inputSignal);
Modified Discrete Cosine Transform.
Algorithm computational order: O(N^2).
Can handle Block<float> and Block<double> as input.
Fast Fourier Transform.
Algorithm computational order: O(N Log N).
Returns the complex spectrum of the given complex input signal.
Length of Block must be a power of 2.
Inverse Fast Fourier Transform.
Algorithm computational order: O(N Log N).
Returns the complex signal of the given complex input spectrum.
Length of Block must be a power of 2.
Calculates the complex spectrum of a real signal.
Uses a N/2 length FFT and therfore more efficient
than the plain FFT for purely real signals. Can accept
Block<float> or Block<double>. Input signal length
must be a power of 2.