public class ComplexDoubleFFT_Mixed extends ComplexDoubleFFT
This method appears to be faster than the Radix2 method, when both methods apply, but requires extra storage (which ComplexDoubleFFT_Mixed manages itself).
See ComplexDoubleFFT for details of data layout.
| Constructor and Description |
|---|
ComplexDoubleFFT_Mixed(int n) |
| Modifier and Type | Method and Description |
|---|---|
void |
backtransform(ComplexArray.Double data,
int i0,
int stride)
Compute the (unnomalized) inverse FFT of data, leaving it in place.
|
void |
transform(ComplexArray.Double data,
int i0,
int stride)
Compute the Fast Fourier Transform of data leaving the result in data.
|
backtransform, checkData, getInstance, inverse, normalization, transformpublic void transform(ComplexArray.Double data, int i0, int stride)
ComplexDoubleFFT
Re(d[i]) = data[i0 + stride*i]
Im(d[i]) = data[i0 + stride*i+1]
transform in class ComplexDoubleFFTpublic void backtransform(ComplexArray.Double data, int i0, int stride)
ComplexDoubleFFTbacktransform in class ComplexDoubleFFT