Searched refs:nfft (Results 1 - 17 of 17) sorted by relevance

/external/libopus/celt/tests/
H A Dtest_unit_mdct.c45 void check(kiss_fft_scalar * in,kiss_fft_scalar * out,int nfft,int isinverse) argument
50 for (bin=0;bin<nfft/2;++bin) {
54 for (k=0;k<nfft;++k) {
55 double phase = 2*M_PI*(k+.5+.25*nfft)*(bin+.5)/nfft;
58 re /= nfft/4;
68 printf("nfft=%d inverse=%d,snr = %f\n",nfft,isinverse,snr );
75 void check_inv(kiss_fft_scalar * in,kiss_fft_scalar * out,int nfft,int isinverse) argument
80 for (bin=0;bin<nfft;
106 test1d(int nfft,int isinverse,int arch) argument
[all...]
H A Dtest_unit_dft.c45 void check(kiss_fft_cpx * in,kiss_fft_cpx * out,int nfft,int isinverse) argument
50 for (bin=0;bin<nfft;++bin) {
56 for (k=0;k<nfft;++k) {
57 double phase = -2*M_PI*bin*k/nfft;
65 re /= nfft;
66 im /= nfft;
79 printf("nfft=%d inverse=%d,snr = %f\n",nfft,isinverse,snr );
86 void test1d(int nfft,int isinverse,int arch) argument
88 size_t buflen = sizeof(kiss_fft_cpx)*nfft;
[all...]
/external/eigen/unsupported/Eigen/src/FFT/
H A Dei_fftw_impl.h60 void fwd(complex_type * dst,complex_type * src,int nfft) { argument
61 if (m_plan==NULL) m_plan = fftwf_plan_dft_1d(nfft,src,dst, FFTW_FORWARD, FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
65 void inv(complex_type * dst,complex_type * src,int nfft) { argument
66 if (m_plan==NULL) m_plan = fftwf_plan_dft_1d(nfft,src,dst, FFTW_BACKWARD , FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
70 void fwd(complex_type * dst,scalar_type * src,int nfft) { argument
71 if (m_plan==NULL) m_plan = fftwf_plan_dft_r2c_1d(nfft,src,dst,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
75 void inv(scalar_type * dst,complex_type * src,int nfft) { argument
77 m_plan = fftwf_plan_dft_c2r_1d(nfft,src,dst,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
103 void fwd(complex_type * dst,complex_type * src,int nfft) { argument
104 if (m_plan==NULL) m_plan = fftw_plan_dft_1d(nfft,sr
108 inv(complex_type * dst,complex_type * src,int nfft) argument
113 fwd(complex_type * dst,scalar_type * src,int nfft) argument
118 inv(scalar_type * dst,complex_type * src,int nfft) argument
144 fwd(complex_type * dst,complex_type * src,int nfft) argument
149 inv(complex_type * dst,complex_type * src,int nfft) argument
154 fwd(complex_type * dst,scalar_type * src,int nfft) argument
159 inv(scalar_type * dst,complex_type * src,int nfft) argument
190 fwd( Complex * dst,const Complex *src,int nfft) argument
192 get_plan(nfft,false,dst,src).fwd(fftw_cast(dst), fftw_cast(src),nfft ); local
197 fwd( Complex * dst,const Scalar * src,int nfft) argument
199 get_plan(nfft,false,dst,src).fwd(fftw_cast(dst), fftw_cast(src) ,nfft); local
211 inv(Complex * dst,const Complex *src,int nfft) argument
213 get_plan(nfft,true,dst,src).inv(fftw_cast(dst), fftw_cast(src),nfft ); local
218 inv( Scalar * dst,const Complex * src,int nfft) argument
220 get_plan(nfft,true,dst,src).inv(fftw_cast(dst), fftw_cast(src),nfft ); local
239 get_plan(int nfft,bool inverse,void * dst,const void * src) argument
[all...]
H A Dei_kissfft_impl.h29 void make_twiddles(int nfft,bool inverse) argument
33 m_twiddles.resize(nfft);
34 Scalar phinc = (inverse?2:-2)* acos( (Scalar) -1) / nfft;
35 for (int i=0;i<nfft;++i)
39 void factorize(int nfft) argument
42 int n= nfft;
277 void fwd( Complex * dst,const Complex *src,int nfft) argument
279 get_plan(nfft,false).work(0, dst, src, 1,1);
305 void fwd( Complex * dst,const Scalar * src,int nfft) argument
307 if ( nfft
338 inv(Complex * dst,const Complex *src,int nfft) argument
345 inv( Scalar * dst,const Complex * src,int nfft) argument
386 PlanKey(int nfft, bool isinverse) const argument
389 get_plan(int nfft, bool inverse) argument
[all...]
/external/eigen/unsupported/doc/examples/
H A DFFT.cpp75 void fwd_inv(size_t nfft) argument
78 vector<T_time> timebuf(nfft);
93 void two_demos(int nfft) argument
96 fwd_inv<T_scalar,std::complex<T_scalar> >(nfft);
98 fwd_inv<std::complex<T_scalar>,std::complex<T_scalar> >(nfft);
101 void demo_all_types(int nfft) argument
103 cout << "nfft=" << nfft << endl;
105 two_demos<float>(nfft);
107 two_demos<double>(nfft);
[all...]
/external/libopus/celt/dump_modes/
H A Ddump_modes_arm_ne10.c87 mode->mdct.kfft[k]->nfft, (NE10_MAXFACTORS * 2));
101 NE10_FFT_CPX_TYPE_T_STR, mode->mdct.kfft[k]->nfft,
102 mode->mdct.kfft[k]->nfft);
103 for(j=0;j<mode->mdct.kfft[k]->nfft;j++) {
120 mode->mdct.kfft[k]->nfft);
121 fprintf(file, "static const arch_fft_state cfg_arch_%d = {\n", mode->mdct.kfft[k]->nfft);
128 NE10_FFT_STATE_TYPE_T_STR, mode->mdct.kfft[k]->nfft);
129 fprintf(file, "%d,\n", cfg->nfft);
130 fprintf(file, "(ne10_int32_t *)ne10_factors_%d,\n", mode->mdct.kfft[k]->nfft);
132 NE10_FFT_CPX_TYPE_T_STR, mode->mdct.kfft[k]->nfft);
[all...]
H A Ddump_modes.c152 mode->Fs, mdctSize, mode->mdct.kfft[0]->nfft);
153 for (j=0;j<mode->mdct.kfft[0]->nfft;j++)
163 fprintf(file, "#ifndef FFT_BITREV%d\n", mode->mdct.kfft[k]->nfft);
164 fprintf(file, "#define FFT_BITREV%d\n", mode->mdct.kfft[k]->nfft);
166 mode->mdct.kfft[k]->nfft, mode->mdct.kfft[k]->nfft);
167 for (j=0;j<mode->mdct.kfft[k]->nfft;j++)
182 fprintf (file, "%d, /* nfft */\n", mode->mdct.kfft[k]->nfft);
192 fprintf (file, "fft_bitrev%d, /* bitrev */\n", mode->mdct.kfft[k]->nfft);
[all...]
/external/eigen/bench/
H A DbenchFFT.cpp44 void bench(int nfft,bool fwd,bool unscaled=false, bool halfspec=false) argument
48 int nits = NDATA/nfft;
49 vector<T> inbuf(nfft);
50 vector<Complex > outbuf(nfft);
80 double mflops = 5.*nfft*log2((double)nfft) / (1e6 * timer.value() / (double)nits );
94 cout << " NFFT=" << nfft << " " << (double(1e-6*nfft*nits)/timer.value()) << " MS/s " << mflops << "MFLOPS\n";
/external/eigen/unsupported/test/
H A DFFTW.cpp78 void test_scalar_generic(int nfft) argument
86 ScalarVector tbuf(nfft);
88 for (int k=0;k<nfft;++k)
95 VERIFY((size_t)freqBuf.size() == (size_t)( (nfft>>1)+1) );
100 VERIFY( (size_t)freqBuf.size() == (size_t)nfft);
103 if (nfft&1)
117 for (int k=0;k<nfft;++k)
118 tbuf3[k] *= T(1./nfft);
133 void test_scalar(int nfft) argument
135 test_scalar_generic<StdVectorContainer,T>(nfft);
141 test_complex_generic(int nfft) argument
175 test_complex(int nfft) argument
[all...]
/external/libopus/celt/arm/
H A Dcelt_ne10_fft.c52 # define NE10_FFT_ALLOC_C2C_TYPE_NEON(nfft) ne10_fft_alloc_c2c_int32_neon(nfft)
63 /* nfft lengths in NE10 that support scaled fft */
79 if(st->nfft == ne10_fft_scaled_support[i])
83 /* This nfft length (scaled fft) is not supported in NE10 */
89 st->arch_fft->priv = (void *)NE10_FFT_ALLOC_C2C_TYPE_NEON(st->nfft);
119 ALLOC(buffer, st->nfft, NE10_FFT_CPX_TYPE_T);
122 /* This nfft length (scaled fft) not supported in NE10 */
151 ALLOC(buffer, st->nfft, NE10_FFT_CPX_TYPE_T);
154 /* This nfft lengt
[all...]
/external/libopus/celt/
H A Dkiss_fft.c409 static void compute_twiddles(kiss_twiddle_cpx *twiddles, int nfft) argument
413 for (i=0;i<nfft;++i) {
415 kf_cexp2(twiddles+i, DIV32(SHL32(phase,17),nfft));
418 for (i=0;i<nfft;++i) {
420 double phase = ( -2*pi /nfft ) * i;
437 kiss_fft_state *opus_fft_alloc_twiddles(int nfft,void * mem,size_t * lenmem, argument
454 st->nfft=nfft;
456 st->scale_shift = celt_ilog2(st->nfft);
457 if (st->nfft
498 opus_fft_alloc(int nfft,void * mem,size_t * lenmem, int arch) argument
[all...]
H A Dkiss_fft.h87 int nfft; member in struct:kiss_fft_state
128 kiss_fft_state *opus_fft_alloc_twiddles(int nfft,void * mem,size_t * lenmem, const kiss_fft_state *base, int arch);
130 kiss_fft_state *opus_fft_alloc(int nfft,void * mem,size_t * lenmem, int arch);
137 * fin should be f[0] , f[1] , ... ,f[nfft-1]
138 * fout will be F[0] , F[1] , ... ,F[nfft-1]
/external/speex/libspeex/
H A Dkiss_fft.h74 kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem);
81 * fin should be f[0] , f[1] , ... ,f[nfft-1]
82 * fout will be F[0] , F[1] , ... ,F[nfft-1]
H A Dkiss_fftr.c32 kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem) argument
38 if (nfft & 1) {
42 nfft >>= 1;
44 kiss_fft_alloc (nfft, inverse_fft, NULL, &subsize);
45 memneeded = sizeof(struct kiss_fftr_state) + subsize + sizeof(kiss_fft_cpx) * ( nfft * 2);
59 st->super_twiddles = st->tmpbuf + nfft;
60 kiss_fft_alloc(nfft, inverse_fft, st->substate, &subsize);
63 for (i=0;i<nfft;++i) {
64 spx_word32_t phase = i+(nfft>>1);
67 kf_cexp2(st->super_twiddles+i, DIV32(SHL32(phase,16),nfft));
[all...]
H A Dkiss_fftr.h21 kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem, size_t * lenmem);
23 nfft must be even
31 input timedata has nfft scalar points
32 output freqdata has nfft/2+1 complex points
42 input freqdata has nfft/2+1 complex points
43 output timedata has nfft scalar points
H A Dkiss_fft.c290 int Norig = st->nfft;
464 kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem ) argument
468 + sizeof(kiss_fft_cpx)*(nfft-1); /* twiddle factors*/
479 st->nfft=nfft;
482 for (i=0;i<nfft;++i) {
486 kf_cexp2(st->twiddles+i, DIV32(SHL32(phase,17),nfft));
489 for (i=0;i<nfft;++i) {
491 double phase = ( -2*pi /nfft ) * i;
497 kf_factor(nfft,s
[all...]
H A D_kiss_fft_guts.h32 int nfft; member in struct:kiss_fft_state

Completed in 301 milliseconds