/cts/suite/audio_quality/test_description/processing/ |
calc_thd.py | 19 import scipy.fftpack as fft namespace 25 fftData = abs(fft.fft(data * np.hanning(len(data))))
|
gen_random.py | 20 import scipy.fftpack as fft namespace 34 fftData = fft.rfft(randomSignal) 47 filteredData = fft.irfft(fftData) 49 #plt.plot(freq, abs(fft.fft(filteredData)))
|
check_spectrum.py | 20 import scipy.fftpack as fft namespace 40 # reduce FFT resolution to have averaging effects
|
check_spectrum_playback.py | 20 import scipy.fftpack as fft namespace 39 # reduce FFT resolution to have averaging effects
|
/external/eigen/bench/ |
benchFFT.cpp | 17 #include <unsupported/Eigen/FFT> 51 FFT< Scalar > fft; local 54 fft.SetFlag(fft.Unscaled); 58 fft.SetFlag(fft.HalfSpectrum); 64 fft.fwd( outbuf , inbuf); 72 fft.fwd( outbuf , inbuf); 75 fft.inv(inbuf,outbuf) [all...] |
/external/eigen/unsupported/doc/examples/ |
FFT.cpp | 1 // To use the simple FFT implementation 2 // g++ -o demofft -I.. -Wall -O3 FFT.cpp 5 // g++ -o demofft -I.. -DUSE_FFTW -Wall -O3 FFT.cpp -lfftw3 -lfftw3f -lfftw3l 17 #include <unsupported/Eigen/FFT> 82 static FFT<Scalar> fft; local 83 fft.fwd(freqbuf,timebuf); 86 fft.inv(timebuf2,freqbuf);
|
/external/webrtc/webrtc/common_audio/signal_processing/ |
real_fft_unittest.cc | 20 // FFT order. 22 // Lengths for real FFT's time and frequency bufffers. 23 // For N-point FFT, the length requirements from API are N and N+2 respectively. 26 // For complex FFT's time and freq buffer. The implementation requires 45 RealFFT* fft = WebRtcSpl_CreateRealFFT(11); local 46 EXPECT_TRUE(fft == NULL); 47 fft = WebRtcSpl_CreateRealFFT(-1); 48 EXPECT_TRUE(fft == NULL); 56 // One common buffer for complex FFT's time and frequency data. 59 // Prepare the inputs to forward FFT's 67 RealFFT* fft = WebRtcSpl_CreateRealFFT(kOrder); local [all...] |
/cts/apps/CtsVerifier/src/com/android/cts/verifier/audio/wavelib/ |
DspFftServer.java | 46 throw new RuntimeException("FFT must be power of 2"); 52 public void fft(DspBufferComplex r, int sign) { method in class:DspFftServer 77 // FFT
|
/external/opencv3/modules/core/src/ |
opencl_kernels_core.cpp | 613 const struct ProgramEntry fft={"fft", member in namespace:cv::ocl::core [all...] |
/cts/apps/CtsVerifier/src/com/android/cts/verifier/audio/ |
Util.java | 64 * Calculate cross correlation using FFT with periodic boundary handling. 67 FastFourierTransformer fft = new FastFourierTransformer(); local 69 Complex[] data1Fft = fft.transform(padZeros(data1, n)); 70 Complex[] data2Fft = fft.transform(padZeros(data2, n)); 75 Complex[] resultComplex = fft.inversetransform(dottedData);
|
AudioFrequencyUnprocessedActivity.java | 150 //Init FFT stuff 647 //fft stuff 651 //for the current frame, compute FFT and send to the viewer. 656 mFftServer.fft(mC, 1);
|
AudioFrequencyLineActivity.java | 165 //Init FFT stuff 644 //fft stuff 651 //for the current frame, compute FFT and send to the viewer. 656 mFftServer.fft(mC, 1);
|
AudioFrequencyMicActivity.java | 201 //Init FFT stuff 796 //fft stuff 800 //for the current frame, compute FFT and send to the viewer. 805 mFftServer.fft(mC, 1);
|
AudioFrequencySpeakerActivity.java | 151 //Init FFT stuff 660 //fft stuff 667 //for the current frame, compute FFT and send to the viewer. 672 mFftServer.fft(mC, 1);
|
/external/eigen/unsupported/test/ |
FFTW.cpp | 11 #include <unsupported/Eigen/FFT> 80 typedef typename FFT<T>::Complex Complex; 81 typedef typename FFT<T>::Scalar Scalar; 85 FFT<T> fft; local 93 fft.SetFlag(fft.HalfSpectrum ); 94 fft.fwd( freqBuf,tbuf); 98 fft.ClearFlag(fft.HalfSpectrum ) 146 FFT<T> fft; local 217 FFT<float> fft; local [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
|
/frameworks/av/media/libmedia/ |
Visualizer.cpp | 281 status_t Visualizer::getFft(uint8_t *fft) 283 if (fft == NULL) { 295 status = doFft(fft, buf); 298 memset(fft, 0, mCaptureSize); 303 status_t Visualizer::doFft(uint8_t *fft, uint8_t *waveform) 321 fft[i] = tmp; 325 fft[i + 1] = tmp; 344 uint8_t fft[mCaptureSize]; local 346 status = doFft(fft, waveform); 360 fftPtr = fft; [all...] |
/external/libvorbis/lib/ |
psytune.c | 329 float *fft=work[i]; local 335 /* fft and mdct transforms */ 337 fft[j]=pcm[i][j]*=window[j]; 339 drft_forward(&f_look,fft); 342 fft[0]*=scale; 343 fft[0]=todB(fft); 345 float temp=scale*FAST_HYPOT(fft[j],fft[j+1]); 346 temp=fft[(j+1)>>1]=todB(&temp) 361 float *fft=work[i]; local [all...] |
/external/aac/libFDK/src/ |
FDK_hybrid.cpp | 94 #include "fft.h" 502 FIXP_DBL fft[8]; local 524 /* write to fft coefficient n' */ 525 fft[FFT_IDX_R(0)] = ( fMult(p[10], ( fMultSub(fMultDiv2(cr[ 2], pQmfReal[pReadIdx[ 2]]), ci[ 2], pQmfImag[pReadIdx[ 2]]))) + 528 fft[FFT_IDX_I(0)] = ( fMult(p[10], ( fMultAdd(fMultDiv2(ci[ 2], pQmfReal[pReadIdx[ 2]]), cr[ 2], pQmfImag[pReadIdx[ 2]]))) + 533 fft[FFT_IDX_R(1)] = ( fMult(p[ 9], ( fMultSub(fMultDiv2(cr[ 3], pQmfReal[pReadIdx[ 3]]), ci[ 3], pQmfImag[pReadIdx[ 3]]))) + 536 fft[FFT_IDX_I(1)] = ( fMult(p[ 9], ( fMultAdd(fMultDiv2(ci[ 3], pQmfReal[pReadIdx[ 3]]), cr[ 3], pQmfImag[pReadIdx[ 3]]))) + 541 fft[FFT_IDX_R(2)] = ( fMult(p[12], ( fMultSub(fMultDiv2(cr[ 0], pQmfReal[pReadIdx[ 0]]), ci[ 0], pQmfImag[pReadIdx[ 0]]))) + 545 fft[FFT_IDX_I(2)] = ( fMult(p[12], ( fMultAdd(fMultDiv2(ci[ 0], pQmfReal[pReadIdx[ 0]]), cr[ 0], pQmfImag[pReadIdx[ 0]]))) + 550 fft[FFT_IDX_R(3)] = ( fMult(p[11], ( fMultSub(fMultDiv2(cr[ 1], pQmfReal[pReadIdx[ 1]]), ci[ 1], pQmf (…) [all...] |
fft.cpp | 87 Description: Fix point FFT 91 #include "fft.h" 104 /* Performs the FFT of length 3 according to the algorithm after winograd. 138 /* performs the FFT of length 5 according to the algorithm after winograd */ 203 /* Performs the FFT of length 15. It is split into FFTs of length 3 and length 5. */ 210 /* Sort input vector for fft's of length 3 263 /* Sort input vector for fft's of length 5 1095 /* Perform dim2 times the fft of length dim1. The input samples are at the address of pSrc and the \ 1096 output samples are at the address of pDst. The input vector for the fft of length dim1 is built \ 1332 void fft(int length, FIXP_DBL *pInput, INT *pScalefactor) function [all...] |
/external/aac/libSBRdec/src/ |
psdec_hybrid.cpp | 87 #include "fft.h" 213 Implementation using a FFT of length 8 242 Try to split off FFT Modulation Term: 243 FFT(x[t], q) = sum(x[t+k]*exp(-j*2*pi/N *q * k)) 255 n m *exp(-j*2*pi) | n' fft 272 now use fft modulation coefficients 273 m[6] = = fft[0] 274 m[7] = = fft[1] 275 m[8] = m[ 0] = fft[2] 276 m[9] = m[ 1] = fft[3 383 FIXP_DBL *fft = (FIXP_DBL *)ALIGN_PTR(_fft); local [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/transform/ |
FastFourierTransformer.java | 35 * There are several conventions for the definition of FFT and inverse FFT, 41 * requirement. There are other flavors of FFT, for reference, see S. Winograd, 75 return fft(f, false); 97 return fft(data, false); 113 return fft(f); 130 return scaleArray(fft(f, false), scaling_coefficient); 154 return scaleArray(fft(data, false), scaling_coefficient); 172 return scaleArray(fft(f), scaling_coefficient); 189 return scaleArray(fft(f, true), scaling_coefficient) 301 protected Complex[] fft(double f[], boolean isInverse) method in class:FastFourierTransformer 346 protected Complex[] fft(Complex data[]) method in class:FastFourierTransformer [all...] |
/external/webrtc/webrtc/modules/audio_processing/aecm/ |
aecm_core_c.c | 66 int16_t* fft, 72 // FFT of signal 75 // transformation array |fft| 77 fft[i] = (int16_t)((scaled_time_signal * WebRtcAecm_kSqrtHanning[i]) >> 14); 79 fft[PART_LEN + i] = (int16_t)(( 83 // Do forward FFT, then take only the first PART_LEN complex samples, 85 WebRtcSpl_RealForwardFFT(aecm->real_fft, fft, (int16_t*)freq_signal); 92 int16_t* fft, 98 // Reuse |efw| for the inverse FFT output after transferring 99 // the contents to |fft| 173 int16_t *fft = (int16_t *) (((uintptr_t) fft_buf + 31) & ~31); local 308 int16_t* fft = (int16_t*) (((uintptr_t) fft_buf + 31) & ~ 31); local [all...] |
aecm_core_mips.c | 76 int16_t* fft, 88 memset(fft, 0, sizeof(int16_t) * PART_LEN4); 90 // FFT of signal 115 "addu %[store_ptr1], %[fft], %[f_coef] \n\t" 116 "addu %[store_ptr2], %[fft], %[s_coef] \n\t" 138 "addu %[store_ptr1], %[fft], %[f_coef] \n\t" 139 "addu %[store_ptr2], %[fft], %[s_coef] \n\t" 156 [hanning] "r" (WebRtcAecm_kSqrtHanning), [fft] "r" (fft) 160 WebRtcSpl_ComplexFFT(fft, PART_LEN_SHIFT, 1) 636 int16_t *fft = (int16_t *) (((uintptr_t) fft_buf + 31) & ~31); local 821 int16_t* fft = (int16_t*)(((uint32_t)fft_buf + 31) & ~ 31); local [all...] |
/external/webrtc/webrtc/modules/audio_processing/aec/ |
aec_core_mips.c | 448 float fft[PART_LEN2]; local 471 "addiu %[fft_tmp], %[fft], 0 \n\t" 525 "swc1 %[f8], 4(%[fft]) \n\t" 534 : [fft] "r" (fft) 538 aec_rdft_inverse_128(fft); 539 memset(fft + PART_LEN, 0, sizeof(float) * PART_LEN); 541 // fft scaling 547 "addiu %[fft_tmp], %[fft], 0 \n\t" 582 : [scale] "f" (scale), [fft] "r" (fft [all...] |