Matrix Fourier Transforms

The Matrix Fouriter Transform interface. More...

The Matrix Fouriter Transform interface.

The Matrix Fourier Transform is the matrix-multiplication implementation of the Discrete Fourier Transform. It is slower than the FFT given the same size matrix, e.g. in 2D \(O(N^3)\) vs \(O(N^2\ln(N))\). However, compared to zero-padding, it can provide advantages in both speed and memory required for problems where oversampling is needed but only over a small region of the output.

Classes
class	mx::math::ft::mftT< _inputT, _outputT, _rank, 0 >
	Matrix Fourier Transforms. More...