|
Parkinson Disease Database | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectmathutil.FFT
public class FFT
Třída počítá Fourierovu transformaci z vektoru komplexních čísel.
Copyright: Copyright (c) 2005 Jan Dolezel
Company: ČVUT FEL, Prague
Constructor Summary | |
---|---|
private |
FFT()
|
Method Summary | |
---|---|
static ComplexVector |
fft(ComplexVector data)
Vypocita Fourierovu transformaci vektoru komplexnich cisel. |
static ComplexVector |
fft(ComplexVector data,
int numSamples)
Vypocita Fourierovu transformaci vektoru komplexnich cisels danym poctem vzorku. |
static ComplexVector |
fft(ComplexVector data,
int numSamples,
boolean inverseTransform)
jadro provadejici Fourierovu tranformaci (i zpetnou) vstupem je skutecny pocet vzorku, rnumSamples o jaky typ transformace se jedna true = zpetna |
static ComplexVector |
ifft(ComplexVector data)
Vypocita inverzni Fourierovu transformaci vektoru komplexnich cisel. |
(package private) static int |
numberOfBitsNeeded(int num)
vypocita ze zadaneho vstupu, nejblizsi mocninu cisla 2 |
private static int |
reverseBits(int index,
int numBits)
vypocita nove umisteni prvku pole s urcitym indexem pouziva interne fft - (vzorky se rozmistuji na nova mista algoritmus pouziva paradigma rozdel a panuj) |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
private FFT()
Method Detail |
---|
public static ComplexVector fft(ComplexVector data)
data
- ComplexVector
public static ComplexVector fft(ComplexVector data, int numSamples)
data
- ComplexVectornumSamples
- int
public static ComplexVector ifft(ComplexVector data)
data
- ComplexVector
public static ComplexVector fft(ComplexVector data, int numSamples, boolean inverseTransform)
data
- ComplexVector vstupni datanumSamples
- int pocet vzorkuinverseTransform
- boolean urcuje jestli budeme delat FFT nebo IFFT
static int numberOfBitsNeeded(int num)
num
- int cislo jehoz nejblizsi vetsi mocninu 2 chceme zjistit
private static int reverseBits(int index, int numBits)
index
- int jaky prveknumBits
- int jaky rozsah
|
Parkinson Disease Database | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |