|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectca.uol.aig.fftpack.ComplexDoubleFFT_Mixed
ca.uol.aig.fftpack.ComplexDoubleFFT
FFT transform of a complex periodic sequence.
Field Summary | |
double |
norm_factor
norm_factor can be used to normalize this FFT transform. |
Constructor Summary | |
ComplexDoubleFFT(int n)
Construct a wavenumber table with size n for Complex FFT. |
Method Summary | |
void |
bt(Complex1D x)
Backward complex FFT transform. |
void |
bt(double[] x)
Backward complex FFT transform. |
void |
ft(Complex1D x)
Forward complex FFT transform. |
void |
ft(double[] x)
Forward complex FFT transform. |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
public double norm_factor
Constructor Detail |
public ComplexDoubleFFT(int n)
n
- the size of a complex data sequence. When n is a multiplication of small
numbers (4, 2, 3, 5), this FFT transform is very efficient.Method Detail |
public void ft(double[] x)
x
- 2*n real double data representing n complex double data.
As an input parameter, x is an array of 2*n real
data representing n complex data. As an output parameter, x represents n
FFT'd complex data. Their relation as follows:
public void ft(Complex1D x)
x
- an array of n Complex datapublic void bt(double[] x)
x
- 2*n real double data representing n complex double data.
As an input parameter, x is an array of 2*n
real data representing n complex data. As an output parameter, x represents
n FFT'd complex data. Their relation as follows:
public void bt(Complex1D x)
x
- an array of n Complex data
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |