HomeSort by relevance Sort by last modified time
    Searched refs:fft (Results 1 - 25 of 35) sorted by null

1 2

  /external/srec/srec/include/
fft.h 2 * fft.h *
29 /* These are the data objects associated with the FFT and IFFT
36 int fft_perform_and_magsq(fft_info *fft);
37 void do_magsq(fft_info *fft);
39 void configure_fft(fft_info *fft, int size);
40 int place_sample_data(fft_info *fft, fftdata *seq, fftdata *smooth, int num);
41 void unconfigure_fft(fft_info *fft);
front.h 36 #include "fft.h"
161 int *spectrum_filter; /* List of FFT taps to filter */
172 fft_info fft; member in struct:__anon11335
281 ** fft 0
  /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
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);
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...]
  /external/srec/srec/cfront/
spec_anl.c 79 ** The "NEW" fft performs shifting operations in fixed point, to maximise
83 channel->shift += place_sample_data(&freqobj->fft, channel->prebuff,
89 write_scaled_frames(freqobj->fft.size, 1, freqobj->fft.real, D_FIXED, (float)(0x01 << channel->shift));
90 write_scaled_frames(freqobj->fft.size, 1, freqobj->fft.imag, D_FIXED, (float)(0x01 << channel->shift));
94 write_scaled_frames(freqobj->fft.size, 1, freqobj->fft.real, D_FIXED, (float)1 / (0x01 << -channel->shift));
95 write_scaled_frames(freqobj->fft.size, 1, freqobj->fft.imag, D_FIXED, (float)1 / (0x01 << -channel->shift))
    [all...]
sp_fft.c 27 ** DESCRIPTION: Split-Radix FFT
140 /* cannot do smaller than 4 point FFT */
356 Compute a four point FFT that requires no multiplications
404 Compute a two point FFT that requires no multiplications
596 /* do a complex FFT of half size using the even indexed data
655 ** FFT will grow data log2Length. In order to avoid data overflow,
682 /* compute the real input fft, the real valued first and last component of
688 /* After fft, we now have the data,
692 ** to get fft data, we then need to reverse-shift the fixed data by the
706 ** = fftdata magnitude/FFT lengt
    [all...]
frontobj.c 383 freqobj->np = 1 << freqobj->lognp; /* fft sizing */
405 configure_fft(&freqobj->fft, freqobj->np);
472 /* Sine tables for FFT */
516 unconfigure_fft(&freqobj->fft);
  /external/webrtc/src/modules/audio_processing/aec/main/source/
aec_core.c 258 static void FilterAdaptation(aec_t *aec, float *fft, float ef[2][PART_LEN1]) {
282 fft[2 * j] = MulRe(aec->xfBuf[0][xPos + j],
285 fft[2 * j + 1] = MulIm(aec->xfBuf[0][xPos + j],
289 fft[1] = MulRe(aec->xfBuf[0][xPos + PART_LEN],
293 aec_rdft_inverse_128(fft);
294 memset(fft + PART_LEN, 0, sizeof(float) * PART_LEN);
296 // fft scaling
300 fft[j] *= scale;
303 aec_rdft_forward_128(fft);
305 aec->wfBuf[0][pos] += fft[0]
572 float fft[PART_LEN2]; local
779 float fft[PART_LEN2]; local
    [all...]
aec_core_sse2.c 129 static void FilterAdaptationSSE2(aec_t *aec, float *fft, float ef[2][PART_LEN1]) {
169 _mm_storeu_ps(&fft[2*j + 0], g);
170 _mm_storeu_ps(&fft[2*j + 4], h);
173 fft[1] = MulRe(aec->xfBuf[0][xPos + PART_LEN],
177 aec_rdft_inverse_128(fft);
178 memset(fft + PART_LEN, 0, sizeof(float)*PART_LEN);
180 // fft scaling
185 const __m128 fft_ps = _mm_loadu_ps(&fft[j]);
187 _mm_storeu_ps(&fft[j], fft_scale);
190 aec_rdft_forward_128(fft);
    [all...]
aec_core.h 28 #define PART_LEN1 (PART_LEN + 1) // Unique fft coefficients
104 float xfBuf[2][NR_PART * PART_LEN1]; // farend fft buffer
105 float wfBuf[2][NR_PART * PART_LEN1]; // filter fft
108 complex_t xfwBuf[NR_PART * PART_LEN1]; // farend windowed fft buffer
175 (aec_t *aec, float *fft, float ef[2][PART_LEN1]);
  /frameworks/base/media/libmedia/
Visualizer.cpp 186 status_t Visualizer::getFft(uint8_t *fft)
188 if (fft == NULL) {
200 status = doFft(fft, buf);
203 memset(fft, 0, mCaptureSize);
208 status_t Visualizer::doFft(uint8_t *fft, uint8_t *waveform)
226 fft[i] = tmp;
230 fft[i + 1] = tmp;
249 uint8_t fft[mCaptureSize]; local
251 status = doFft(fft, waveform);
265 fftPtr = fft;
    [all...]
  /frameworks/base/include/media/
Visualizer.h 36 * - Frequency data: 8-bit magnitude FFT by using the getFft() method
39 * getCaptureSize() and setCaptureSize() methods. Note that the size of the FFT
84 // callback used to return periodic PCM or FFT captures to the application. Either one or both
85 // types of data are returned (PCM and FFT) according to flags indicated when installing the
92 uint8_t *fft,
115 // return a capture in FFT 8 bit signed format. The size of the capture is equal to
116 // getCaptureSize() but the length of the FFT is half of the size (both parts of the spectrum
118 status_t getFft(uint8_t *fft);
142 status_t doFft(uint8_t *fft, uint8_t *waveform);
  /frameworks/base/media/java/android/media/audiofx/
Visualizer.java 43 * <li>Frequency data: 8-bit magnitude FFT by using the {@link #getFft(byte[])} method</li>
147 * PCM and FFT capture listener registered by client
336 * <p>The capture is an 8-bit magnitude FFT, the frequency range covered being 0 (DC) to half of
371 * @param fft array of bytes where the FFT should be returned
377 public int getFft(byte[] fft)
383 return native_getFft(fft);
408 * @param fft array of bytes containing the frequency representation.
411 void onFftDataCapture(Visualizer visualizer, byte[] fft, int samplingRate);
422 * @param fft true if a frequency capture is requested: the onFftDataCapture() method will b
    [all...]
  /external/webrtc/src/modules/audio_processing/aecm/main/source/
aecm_core.c 474 // - xfaQ : normalization factor, i.e., Q-domain before FFT
1535 WebRtc_Word16 fft[PART_LEN4]; local
    [all...]
  /frameworks/base/media/libstagefright/codecs/aacdec/
s_tdec_int_file.h 225 Int32 fft[LONG_WINDOW]; /* 1024, as needed by the FFT */ member in union:__anon15048::scratch_memory
pvmp4audiodecoderframe.cpp     [all...]
  /external/speex/libspeex/
fftwrap.c 104 speex_warning("FFT should not be done in-place");
120 speex_warning("FFT should not be done in-place");
175 fftwf_plan fft; member in struct:fftw_config
186 table->fft = fftwf_plan_dft_r2c_1d(size, table->in, (fftwf_complex *) table->out, FFTW_PATIENT);
196 fftwf_destroy_plan(t->fft);
215 fftwf_execute(t->fft);
306 #error No other FFT implemented
  /cts/tests/tests/media/src/android/media/cts/
VisualizerTest.java 280 Log.e(TAG, "Capture FFT: wait was interrupted.");
283 assertNotNull("FFT capture failed", mFft);
378 Visualizer visualizer, byte[] fft, int samplingRate) {
382 mFft = fft;
  /frameworks/base/media/jni/audioeffect/
android_media_Visualizer.cpp 100 uint8_t *fft,
138 if (fftSize != 0 && fft != NULL) {
142 memcpy(nArray, fft, fftSize);
  /external/webrtc/src/modules/audio_processing/aecm/main/matlab/
compsup.m 29 support=64; %512 % fft support (frequency resolution; at low
164 temp=fft(win .* TheFarEnd(sb:se));
171 temp=fft(win .* microphone(sb:se));
  /frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/functional/audio/
MediaVisualizerTest.java 332 Log.e(TAG, "Capture FFT: wait was interrupted.");
335 assertNotNull(msg +": FFT capture failed", mFft);
365 Log.e(TAG, "Capture FFT: wait was interrupted.");
368 assertNotNull(msg +": FFT capture failed", mFft);
474 Visualizer visualizer, byte[] fft, int samplingRate) {
478 mFft = fft;
  /development/ndk/platforms/android-14/include/SLES/
OpenSLES.h     [all...]
  /development/ndk/platforms/android-9/include/SLES/
OpenSLES.h     [all...]

Completed in 1989 milliseconds

1 2