One dimensional fast fourier transform. More...
Functions | |
void | itpp::fft (const cvec &in, cvec &out) |
Fast Fourier Transform. | |
cvec | itpp::fft (const cvec &in) |
Fast Fourier Transform. | |
cvec | itpp::fft (const cvec &in, const int N) |
Fast Fourier Transform, with zero-padding up to size N. | |
void | itpp::ifft (const cvec &in, cvec &out) |
Inverse Fast Fourier Transform. | |
cvec | itpp::ifft (const cvec &in) |
Inverse Fast Fourier Transform. | |
cvec | itpp::ifft (const cvec &in, const int N) |
Inverse Fast Fourier Transform, with zero-padding up to size N. | |
void | itpp::fft_real (const vec &in, cvec &out) |
Real Fast Fourier Transform. | |
cvec | itpp::fft_real (const vec &in) |
Real Fast Fourier Transform. | |
cvec | itpp::fft_real (const vec &in, const int N) |
Real Fast Fourier Transform, with zero-padding up to size N. | |
void | itpp::ifft_real (const cvec &in, vec &out) |
Inverse Real Fast Fourier Transform. Assumes even size. | |
vec | itpp::ifft_real (const cvec &in) |
Inverse Real Fast Fourier Transform. Assumes even size. | |
vec | itpp::ifft_real (const cvec &in, const int N) |
Inverse Real Fast Fourier Transform, with zero-padding up to size N. |
One dimensional fast fourier transform.
The functions
X = fft(x)
and
x = ifft(X)
are the fourier and inverse fourier transforms of size N defined as:
Y = fft(X, N)
performs zero-padding up to size N and then performs an N-size fft.
The implementation is built upon one of the following libraries:
Generated on Wed Feb 9 2011 13:47:26 for IT++ by Doxygen 1.7.3