6 Transform Functions

Function	Description
BitReverseComplex	Reorganizes, in place, the elements of a complex vector in bit-reverse order.
CosFactorInit	Generates the first half of the set of cosine factors required by a Type II Discrete Cosine Transform and places the result in the complex destination vector.
DCT	Computes the Discrete Cosine Transform of a source vector and stores the results in the destination vector.
DCTIP	Computes the Discrete Cosine Transform of a source vector in place.
FFTComplex	Computes the Fast Fourier Transform of a source complex vector and stores the results in the destination complex vector.
FFTComplexIP	Computes the Fast Fourier Transform of a source complex vector in place.
IFFTComplex	Computes the Inverse Fast Fourier Transform of a source complex vector and stores the results in the destination complex vector.
IFFTComplexIP	Computes the Inverse Fast Fourier Transform of a source complex vector in place.
FFTRealIP	Performs an in-place Fast Fourier Transform (FFT) on a real-valued source vector. It utilizes an efficient algorithm that computes the FFT of a 2N-point real vector by leveraging an N-point complex FFT, supplemented with additional operations known as split functions.
FFTReal	Performs Fast Fourier Transform (FFT) on a real-valued source vector and stores the result in a complex destination vector. It utilizes an efficient algorithm that computes the FFT of a 2N-point real vector by leveraging an N-point complex FFT, supplemented with additional operations known as split functions.
IFFTRealIP	Computes, in place, the inverse Fast Fourier Transform of a source complex vector, which was derived out a real-vector using the FFTReal function. The algorithm to compute IFFT is based on the efficient computation of IFFT of a 2N point complex vector using the N point complex FFT with additional computations called split functions.
IFFTReal	Computes the inverse Fast Fourier Transform of a source complex vector, which was derived out of a real-vector using the FFTReal function. The algorithm to compute IFFT is based on the efficient computation of IFFT of a 2N point complex vector using the N point complex FFT with additional computations called split functions.
SquareMagnitudeComplex	Computes the squared magnitude of each element in a complex source vector.
TwidFactorInit	Generates the first half of the set of twiddle factors required by a Discrete Fourier Transform or Discrete Cosine Transform, and places the result in the complex destination vector.

BitReverseComplex

Reorganizes, in place, the elements of a complex vector in bit-reverse order.

CosFactorInit

Generates the first half of the set of cosine factors required by a Type II Discrete Cosine Transform and places the result in the complex destination vector.

DCT

Computes the Discrete Cosine Transform of a source vector and stores the results in the destination vector.

DCTIP

Computes the Discrete Cosine Transform of a source vector in place.

FFTComplex

Computes the Fast Fourier Transform of a source complex vector and stores the results in the destination complex vector.

FFTComplexIP

Computes the Fast Fourier Transform of a source complex vector in place.

IFFTComplex

Computes the Inverse Fast Fourier Transform of a source complex vector and stores the results in the destination complex vector.

IFFTComplexIP

Computes the Inverse Fast Fourier Transform of a source complex vector in place.

FFTRealIP

Performs an in-place Fast Fourier Transform (FFT) on a real-valued source vector. It utilizes an efficient algorithm that computes the FFT of a 2N-point real vector by leveraging an N-point complex FFT, supplemented with additional operations known as split functions.

FFTReal

Performs Fast Fourier Transform (FFT) on a real-valued source vector and stores the result in a complex destination vector. It utilizes an efficient algorithm that computes the FFT of a 2N-point real vector by leveraging an N-point complex FFT, supplemented with additional operations known as split functions.

IFFTRealIP

Computes, in place, the inverse Fast Fourier Transform of a source complex vector, which was derived out a real-vector using the FFTReal function. The algorithm to compute IFFT is based on the efficient computation of IFFT of a 2N point complex vector using the N point complex FFT with additional computations called split functions.

IFFTReal

Computes the inverse Fast Fourier Transform of a source complex vector, which was derived out of a real-vector using the FFTReal function. The algorithm to compute IFFT is based on the efficient computation of IFFT of a 2N point complex vector using the N point complex FFT with additional computations called split functions.

SquareMagnitudeComplex

Computes the squared magnitude of each element in a complex source vector.

TwidFactorInit

Generates the first half of the set of twiddle factors required by a Discrete Fourier Transform or Discrete Cosine Transform, and places the result in the complex destination vector.