One-dimensional complex fast Fourier transform. More...
#include <FFT.h>
| Public Member Functions | |
| CFFT (int size=0) | |
| int | size () const | 
| Get size of transform. | |
| void | forward (T *buf, bool normalize=true) | 
| Perform forward transform in-place. | |
| void | inverse (T *buf) | 
| Perform inverse transform in-place. | |
| void | resize (int n) | 
| Set size of transform. | |
One-dimensional complex fast Fourier transform.
The complex sequence format for forward and inverse transforms is [r0, i0, r1, i1, ... , r(n-1), i(n-1)]
| CFFT | ( | int | size = 0 | ) | 
| [in] | size | size of complex input sequence; most efficient when a product of small primes | 
| void forward | ( | T * | buf, | 
| bool | normalize = true | ||
| ) | 
Perform forward transform in-place.
| [in,out] | buf | input/output buffer | 
| [in] | normalize | whether to scale magnitudes by 1/N |