HomeSort by relevance Sort by last modified time
    Searched refs:Fft (Results 1 - 6 of 6) sorted by null

  /cts/apps/CtsVerifier/jni/audioquality/
Fft.h 20 class Fft {
22 Fft(void);
24 virtual ~Fft(void);
26 // Prepare for radix-2 FFT's of size (1<<pow2)
29 // Forward fft. Real time-domain components in x, imaginary in y
30 void fft(float *x, float *y);
32 // Inverse fft. Real frequency-domain components in x, imaginary in y
56 // Create the sine/cosine basis tables and return the size of the FFT
GlitchTest.h 20 class Fft;
62 /* Do a real FFT on the n_input samples in data, and return n_output
82 Fft* mFt;
Fft.cpp 17 #include "Fft.h"
22 Fft::Fft(void) : mCosine(0), mSine(0), mFftSize(0), mFftTableSize(0) { }
24 Fft::~Fft(void) {
28 /* Construct a FFT table suitable to perform a DFT of size 2^power. */
29 void Fft::fftInit(int power) {
34 void Fft::fftCleanup() {
44 int Fft::fftLogMag(float *x, float *y, float *z, int n) {
60 int Fft::fftMakeTable(int pow2)
85 void Fft::fft( float *x, float *y ) { function in class:Fft
    [all...]
Android.mk 26 LOCAL_SRC_FILES := Fft.cpp Window.cpp GlitchTest.cpp MeasureRms.cpp \
CompareSpectra.cpp 19 #include "Fft.h"
73 NULL on failure. Use 50% overlap on the spectra. An FFT of
89 Fft ft;
98 ft.fft(re,im);
GlitchTest.cpp 19 #include "Fft.h"
39 mFt = new Fft;
160 mFt->fft(mRe, mIm);

Completed in 227 milliseconds