Home
last modified time | relevance | path

Searched refs:nfft (Results 1 – 12 of 12) sorted by relevance

/external/eigen/unsupported/Eigen/src/FFT/
Dei_fftw_impl.h60 void fwd(complex_type * dst,complex_type * src,int nfft) {
61 …if (m_plan==NULL) m_plan = fftwf_plan_dft_1d(nfft,src,dst, FFTW_FORWARD, FFTW_ESTIMATE|FFTW_PRESER…
65 void inv(complex_type * dst,complex_type * src,int nfft) {
66 …if (m_plan==NULL) m_plan = fftwf_plan_dft_1d(nfft,src,dst, FFTW_BACKWARD , FFTW_ESTIMATE|FFTW_PRES…
70 void fwd(complex_type * dst,scalar_type * src,int nfft) {
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) {
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) {
104 …if (m_plan==NULL) m_plan = fftw_plan_dft_1d(nfft,src,dst, FFTW_FORWARD, FFTW_ESTIMATE|FFTW_PRESERV…
[all …]
Dei_kissfft_impl.h29 void make_twiddles(int nfft,bool inverse) in make_twiddles()
32 m_twiddles.resize(nfft); in make_twiddles()
33 Scalar phinc = (inverse?2:-2)* acos( (Scalar) -1) / nfft; in make_twiddles()
34 for (int i=0;i<nfft;++i) in make_twiddles()
38 void factorize(int nfft) in factorize()
41 int n= nfft; in factorize()
276 void fwd( Complex * dst,const Complex *src,int nfft) in fwd()
278 get_plan(nfft,false).work(0, dst, src, 1,1); in fwd()
304 void fwd( Complex * dst,const Scalar * src,int nfft) in fwd()
306 if ( nfft&3 ) { in fwd()
[all …]
/external/eigen/unsupported/Eigen/
DFFT122 …ft_fwd_proxy(const T_SrcMat& src,T_FftIfc & fft, Index nfft) : m_src(src),m_ifc(fft), m_nfft(nfft)…
142 …ft_inv_proxy(const T_SrcMat& src,T_FftIfc & fft, Index nfft) : m_src(src),m_ifc(fft), m_nfft(nfft)…
187 void fwd( Complex * dst, const Scalar * src, Index nfft)
189 m_impl.fwd(dst,src,static_cast<int>(nfft));
191 ReflectSpectrum(dst,nfft);
195 void fwd( Complex * dst, const Complex * src, Index nfft)
197 m_impl.fwd(dst,src,static_cast<int>(nfft));
221 void fwd( MatrixBase<ComplexDerived> & dst, const MatrixBase<InputDerived> & src, Index nfft=-1)
233 if (nfft<1)
234 nfft = src.size();
[all …]
/external/eigen/unsupported/test/
DFFTW.cpp81 void test_scalar_generic(int nfft) in test_scalar_generic() argument
89 ScalarVector tbuf(nfft); in test_scalar_generic()
91 for (int k=0;k<nfft;++k) in test_scalar_generic()
98 VERIFY((size_t)freqBuf.size() == (size_t)( (nfft>>1)+1) ); in test_scalar_generic()
103 VERIFY( (size_t)freqBuf.size() == (size_t)nfft); in test_scalar_generic()
106 if (nfft&1) in test_scalar_generic()
120 for (int k=0;k<nfft;++k) in test_scalar_generic()
121 tbuf3[k] *= T(1./nfft); in test_scalar_generic()
136 void test_scalar(int nfft) in test_scalar() argument
138 test_scalar_generic<StdVectorContainer,T>(nfft); in test_scalar()
[all …]
/external/eigen/unsupported/doc/examples/
DFFT.cpp75 void fwd_inv(size_t nfft) in fwd_inv() argument
78 vector<T_time> timebuf(nfft); in fwd_inv()
93 void two_demos(int nfft) in two_demos() argument
96 fwd_inv<T_scalar,std::complex<T_scalar> >(nfft); in two_demos()
98 fwd_inv<std::complex<T_scalar>,std::complex<T_scalar> >(nfft); in two_demos()
101 void demo_all_types(int nfft) in demo_all_types() argument
103 cout << "nfft=" << nfft << endl; in demo_all_types()
105 two_demos<float>(nfft); in demo_all_types()
107 two_demos<double>(nfft); in demo_all_types()
109 two_demos<long double>(nfft); in demo_all_types()
/external/eigen/bench/
DbenchFFT.cpp44 void bench(int nfft,bool fwd,bool unscaled=false, bool halfspec=false) in bench() argument
48 int nits = NDATA/nfft; in bench()
49 vector<T> inbuf(nfft); in bench()
50 vector<Complex > outbuf(nfft); in bench()
80 double mflops = 5.*nfft*log2((double)nfft) / (1e6 * timer.value() / (double)nits ); in bench()
94 …cout << " NFFT=" << nfft << " " << (double(1e-6*nfft*nits)/timer.value()) << " MS/s " << mflops … in bench()
/external/speex/libspeex/
Dkiss_fftr.c32 kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem) in kiss_fftr_alloc() argument
38 if (nfft & 1) { in kiss_fftr_alloc()
42 nfft >>= 1; in kiss_fftr_alloc()
44 kiss_fft_alloc (nfft, inverse_fft, NULL, &subsize); in kiss_fftr_alloc()
45 memneeded = sizeof(struct kiss_fftr_state) + subsize + sizeof(kiss_fft_cpx) * ( nfft * 2); in kiss_fftr_alloc()
59 st->super_twiddles = st->tmpbuf + nfft; in kiss_fftr_alloc()
60 kiss_fft_alloc(nfft, inverse_fft, st->substate, &subsize); in kiss_fftr_alloc()
63 for (i=0;i<nfft;++i) { in kiss_fftr_alloc()
64 spx_word32_t phase = i+(nfft>>1); in kiss_fftr_alloc()
67 kf_cexp2(st->super_twiddles+i, DIV32(SHL32(phase,16),nfft)); in kiss_fftr_alloc()
[all …]
Dkiss_fft.c290 int Norig = st->nfft; in kf_bfly_generic()
464 kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem ) in kiss_fft_alloc() argument
468 + sizeof(kiss_fft_cpx)*(nfft-1); /* twiddle factors*/ in kiss_fft_alloc()
479 st->nfft=nfft; in kiss_fft_alloc()
482 for (i=0;i<nfft;++i) { in kiss_fft_alloc()
486 kf_cexp2(st->twiddles+i, DIV32(SHL32(phase,17),nfft)); in kiss_fft_alloc()
489 for (i=0;i<nfft;++i) { in kiss_fft_alloc()
491 double phase = ( -2*pi /nfft ) * i; in kiss_fft_alloc()
497 kf_factor(nfft,st->factors); in kiss_fft_alloc()
Dkiss_fftr.h21 kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem, size_t * lenmem);
Dkiss_fft.h74 kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem);
D_kiss_fft_guts.h32 int nfft; member
/external/llvm/test/CodeGen/X86/
D2007-11-30-LoadFolding-Bug.ll7 …qrt(i32 %n, i32 %radix, i32* %in, i32* %out, i32* %tmp1, i32* %tmp2, i32 %nfft, double* %tmp1fft, …