public class FastFourierTransform extends Object
DoubleVector
s.
The physical layout of the mathematical data d[i] in the array data is as
follows:
d[i] = data[i0 + stride*i]The FFT (D[i]) of real data (d[i]) is complex, but restricted by symmetry:
D[n-i] = conj(D[i])
Constructor and Description |
---|
FastFourierTransform() |
Modifier and Type | Method and Description |
---|---|
static void |
backtransform(DoubleVector data)
Compute the (unnomalized) inverse FFT of data, leaving it in place.
|
static void |
bitreverse(DoubleVector data,
int i0,
int stride)
This is the Gold rader bit-reversal algorithm
|
static int |
checkFactor(int n)
Create an FFT for transforming n points of real, double precision data.
|
static void |
transform(DoubleVector data)
Compute the Fast Fourier Transform of data leaving the result in data.
|
public static int checkFactor(int n)
public static void transform(DoubleVector data)
public static void backtransform(DoubleVector data)
transform
.public static void bitreverse(DoubleVector data, int i0, int stride)
Copyright © 2012. All Rights Reserved.