|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.ObjectFFT
public class FFT
class FFT computes the fft of a set of samples passed
Field Summary | |
---|---|
static double |
ISIP_INV_SQRT2
|
static double |
ISIP_TWOPI
|
Method Summary | |
---|---|
boolean |
isPower(int exponent,
int base)
this method computes exponent = log (base) of order; it returns false if order of the fourier transform requested for is not a power of base. |
boolean |
srComplex(double[] output,
double[] input)
This method computes the fourier transform using the split-radix algorithm. |
boolean |
srfft(double[] output,
double[] input)
Routine used to compute the real split-radix fft. |
boolean |
srInit()
creates lookup tables for sin and cosine terms. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
public static final double ISIP_INV_SQRT2
public static final double ISIP_TWOPI
Method Detail |
---|
public boolean srInit()
public boolean isPower(int exponent, int base)
exponent
- (output) the required exponentbase
- (input) base provided by the user
public boolean srComplex(double[] output, double[] input)
output
- (output) output data array
length of output array will always be 2*N
memory is allocated internally, not by the calling
program.input
- (input) input data array
length of input array is 2*N
memory is allocated by the calling
program.
public boolean srfft(double[] output, double[] input)
output
- (output) output data array
length of output array will always be 2*N
memory is allocated internally, not by the calling
program.input
- (input) input data array
length of input array is 2*N
memory is allocated by the calling
program.
|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |