Transforms
Routines
6.1. Real Trigonometric FFT
Computes the Discrete Fourier Transform
of a rank-1 complex array,
x.
FAST_DFTComputes the Discrete Fourier Transform (2DFT)
of a rank-2 complex array,
x FAST_2DFTComputes the Discrete Fourier Transform 2DFT)
of a rank-3 complex array,
x FAST_3DFTBackward or inverse transform
FFTRBInitialization routine for FFTR*
FFTRI6.2. Complex Exponential FFT
Backward or inverse transform
FFTCBInitialization routine for FFTC*
FFTCI6.3. Real Sine and Cosine FFTs
Forward and inverse sine transform
FSINTInitialization routine for FSINT
FSINIForward and inverse cosine transform
FCOSTInitialization routine for FCOST
FCOSI6.4. Real Quarter Sine and Quarter Cosine FFTs
Forward quarter sine transform
QSINFBackward or inverse transform
QSINBInitialization routine for QSIN*
QSINIForward quarter cosine transform
QCOSFBackward or inverse transform
QCOSBInitialization routine for QCOS*
QCOSI6.5. Two- and Three-Dimensional Complex FFTs
Backward or inverse transform
FFT2BBackward or inverse transform
FFT3B6.6. Convolutions and Correlations
Complex convolution
CCONVComplex correlation
CCORL6.7. Laplace Transform
Inverse Laplace transform
INLAPInverse Laplace transform for smooth functions
SINLPPublished date: 03/19/2020
Last modified date: 03/19/2020