FNLMath : Transforms
Transforms
Routines
Real Trigonometric FFT
Computes the Discrete Fourier Transform
of a rank-1 complex array, x. FAST_DFT
Computes the Discrete Fourier Transform (2DFT)
of a rank-2 complex array, x FAST_2DFT
Computes the Discrete Fourier Transform 2DFT)
of a rank-3 complex array, x FAST_3DFT
Forward transform FFTRF
Backward or inverse transform FFTRB
Initialization routine for FFTR* FFTRI
Complex Exponential FFT
Forward transform FFTCF
Backward or inverse transform FFTCB
Initialization routine for FFTC* FFTCI
Real Sine and Cosine FFTs
Forward and inverse sine transform FSINT
Initialization routine for FSINT FSINI
Forward and inverse cosine transform FCOST
Initialization routine for FCOST FCOSI
Real Quarter Sine and Quarter Cosine FFTs
Forward quarter sine transform QSINF
Backward or inverse transform QSINB
Initialization routine for QSIN* QSINI
Forward quarter cosine transform QCOSF
Backward or inverse transform QCOSB
Initialization routine for QCOS* QCOSI
Two- and Three-Dimensional Complex FFTs
Forward transform FFT2D
Backward or inverse transform FFT2B
Forward transform FFT3F
Backward or inverse transform FFT3B
Convolutions and Correlations
Real convolution RCONV
Complex convolution CCONV
Real correlation RCORL
Complex correlation CCORL
Laplace Transform
Inverse Laplace transform INLAP
Inverse Laplace transform for smooth functions SINLP