#include <IFFTComplex.h>
Public Member Functions | |
int | fftSize () const |
void | setFftSize (int size, bool callSetup=true) |
int | frameSize () const |
void | setFrameSize (int size, bool callSetup=true) |
bool | zeroPhase () const |
void | setZeroPhase (bool zeroPhase, bool callSetup=true) |
The IFFT is a fast implementation of an Inverse Discrete Fourier Transform (IDFT). The algorithm takes as input M point vectors of Complex values (M being the FFT size), and returns N point vectors of Real values (N being the frame size).
Note that N can be smaller than M. In this case the last ( M - N ) coefficients will be discarded, since it assumes that zero padding has been made at the end of the frame prior to the forward FFT transfor.
Alternatively the algorithm can undo the center zeropadding and the N/2 rotation if done durnig the FFT forward transform. This is specified by using the setZeroPhase() method.
int fftSize | ( | ) | const |
void setFftSize | ( | int | size, | |
bool | callSetup = true | |||
) |
int frameSize | ( | ) | const |
void setFrameSize | ( | int | size, | |
bool | callSetup = true | |||
) |
Specifies the size of the target frame. The given size must be higher than 0. Note that if size is a power of 2 will perform faster.
bool zeroPhase | ( | ) | const |
void setZeroPhase | ( | bool | zeroPhase, | |
bool | callSetup = true | |||
) |