FFT
JavaScript is disabled on your browser.
br.usp.ime.dspbenchmarking.algorithms
Class FFT
- java.lang.Object
-
- br.usp.ime.dspbenchmarking.algorithms.FFT
-
public class FFT extends java.lang.Object
-
-
Field Summary
Fields Modifier and Type Field and Description private int[]
bitreverse
private int
bits
private static int
LOG2_MAXFFTSIZE
private static int
MAXFFTSIZE
private static double
TWOPI
A Java implementation of the fast Fourier transform written by Jef Poskanzer.
-
Constructor Summary
Constructors Constructor and Description FFT(int bits)
FFT class constructor Initializes code for doing a fast Fourier transform
-
-
-
Field Detail
-
TWOPI
private static final double TWOPI
A Java implementation of the fast Fourier transform written by Jef Poskanzer. The copyright appears above.- See Also:
- Constant Field Values
-
LOG2_MAXFFTSIZE
private static final int LOG2_MAXFFTSIZE
- See Also:
- Constant Field Values
-
MAXFFTSIZE
private static final int MAXFFTSIZE
- See Also:
- Constant Field Values
-
bits
private int bits
-
bitreverse
private int[] bitreverse
-
-
Constructor Detail
-
FFT
public FFT(int bits)
FFT class constructor Initializes code for doing a fast Fourier transform- Parameters:
int
- bits is a power of two such that 2^b is the number of samples.
-
-
Method Detail
-
setBits
public void setBits(int bits)
- Parameters:
bits
-
-
doFFT
public void doFFT(double[] xr, double[] xi, boolean invFlag)
A fast Fourier transform routine- Parameters:
double
- [] xr is the real part of the data to be transformeddouble
- [] xi is the imaginary part of the data to be transformed (normally zero unless inverse transofrm is effect).boolean
- invFlag which is true if inverse transform is being applied. false for a forward transform.
-
-