|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object spec.benchmarks.scimark.fft.FFT
public class FFT
Computes FFT's of complex, double precision data where n is an integer power of 2. This appears to be slower than the Radix2 method, but the code is smaller and simpler, and it requires no extra storage.
Constructor Summary | |
---|---|
FFT(int id)
|
Method Summary | |
---|---|
protected void |
bitreverse(double[] data)
|
long |
inst_main(java.lang.String[] argv)
|
void |
inverse(double[] data)
Compute Inverse Fast Fourier Transform of (complex) data, in place. |
protected int |
log2(int n)
|
static void |
main(int id)
Simple Test routine. |
double[] |
makeRandom(int n)
Make a random array of n (complex) elements. |
double |
measureFFT(int N,
double mintime,
Random R)
|
double |
num_flops(int N)
|
void |
run()
|
double |
test(double[] data)
Accuracy check on FFT of data. |
protected void |
transform_internal(double[] data,
int direction)
|
void |
transform(double[] data)
Compute Fast Fourier Transform of (complex) data, in place. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public FFT(int id)
Method Detail |
---|
public final double num_flops(int N)
public long inst_main(java.lang.String[] argv)
public void transform(double[] data)
public void inverse(double[] data)
public double test(double[] data)
public double[] makeRandom(int n)
public static void main(int id)
protected int log2(int n)
protected void transform_internal(double[] data, int direction)
protected void bitreverse(double[] data)
public double measureFFT(int N, double mintime, Random R)
public void run()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |