| /external/libopus/celt/tests/ |
| test_unit_mdct.c | 54 void check(kiss_fft_scalar * in,kiss_fft_scalar * out,int nfft,int isinverse)
59 for (bin=0;bin<nfft/2;++bin) {
63 for (k=0;k<nfft;++k) {
64 double phase = 2*M_PI*(k+.5+.25*nfft)*(bin+.5)/nfft;
67 re /= nfft/4;
77 printf("nfft=%d inverse=%d,snr = %f\n",nfft,isinverse,snr );
84 void check_inv(kiss_fft_scalar * in,kiss_fft_scalar * out,int nfft,int isinverse)
89 for (bin=0;bin<nfft;++bin)
[all...] |
| test_unit_dft.c | 54 void check(kiss_fft_cpx * in,kiss_fft_cpx * out,int nfft,int isinverse)
59 for (bin=0;bin<nfft;++bin) {
65 for (k=0;k<nfft;++k) {
66 double phase = -2*M_PI*bin*k/nfft;
74 re /= nfft;
75 im /= nfft;
88 printf("nfft=%d inverse=%d,snr = %f\n",nfft,isinverse,snr );
95 void test1d(int nfft,int isinverse)
97 size_t buflen = sizeof(kiss_fft_cpx)*nfft;
[all...] |
| /external/eigen/unsupported/Eigen/src/FFT/ |
| ei_fftw_impl.h | 60 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_PRESERVE_INPUT);
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_PRESERVE_INPUT);
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_PRESERVE_INPUT)
192 get_plan(nfft,false,dst,src).fwd(fftw_cast(dst), fftw_cast(src),nfft ); local
199 get_plan(nfft,false,dst,src).fwd(fftw_cast(dst), fftw_cast(src) ,nfft); local
213 get_plan(nfft,true,dst,src).inv(fftw_cast(dst), fftw_cast(src),nfft ); local
220 get_plan(nfft,true,dst,src).inv(fftw_cast(dst), fftw_cast(src),nfft ); local
[all...] |
| ei_kissfft_impl.h | 29 void make_twiddles(int nfft,bool inverse)
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)
42 int n= nfft;
277 void fwd( Complex * dst,const Complex *src,int nfft)
279 get_plan(nfft,false).work(0, dst, src, 1,1);
305 void fwd( Complex * dst,const Scalar * src,int nfft)
307 if ( nfft&3 )
[all...] |
| /external/eigen/bench/ |
| benchFFT.cpp | 34 #ifndef NFFT
35 #define NFFT 1024
44 void bench(int nfft,bool fwd,bool unscaled=false, bool halfspec=false)
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"
[all...] |
| /external/eigen/unsupported/doc/examples/ |
| FFT.cpp | 75 void fwd_inv(size_t nfft)
78 vector<T_time> timebuf(nfft);
93 void two_demos(int nfft)
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)
103 cout << "nfft=" << nfft << endl;
105 two_demos<float>(nfft);
107 two_demos<double>(nfft);
[all...] |
| /external/eigen/unsupported/test/ |
| FFTW.cpp | 78 void test_scalar_generic(int nfft)
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)
135 test_scalar_generic<StdVectorContainer,T>(nfft);
[all...] |
| /external/libopus/celt/ |
| kiss_fft.h | 81 int nfft; member in struct:kiss_fft_state
116 kiss_fft_state *opus_fft_alloc_twiddles(int nfft,void * mem,size_t * lenmem, const kiss_fft_state *base);
118 kiss_fft_state *opus_fft_alloc(int nfft,void * mem,size_t * lenmem);
125 * fin should be f[0] , f[1] , ... ,f[nfft-1]
126 * fout will be F[0] , F[1] , ... ,F[nfft-1]
|
| kiss_fft.c | 518 static void compute_twiddles(kiss_twiddle_cpx *twiddles, int nfft)
522 for (i=0;i<nfft;++i) {
524 kf_cexp2(twiddles+i, DIV32(SHL32(phase,17),nfft));
527 for (i=0;i<nfft;++i) {
529 double phase = ( -2*pi /nfft ) * i;
541 kiss_fft_state *opus_fft_alloc_twiddles(int nfft,void * mem,size_t * lenmem, const kiss_fft_state *base)
557 st->nfft=nfft;
559 st->scale = 1.f/nfft;
565 while (nfft<<st->shift != base->nfft && st->shift < 32
[all...] |
| /external/speex/libspeex/ |
| kiss_fft.h | 74 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]
|
| kiss_fftr.c | 32 kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem)
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...] |
| kiss_fftr.h | 21 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
|
| kiss_fft.c | 290 int Norig = st->nfft;
464 kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem )
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,st->factors)
[all...] |
| _kiss_fft_guts.h | 32 int nfft; member in struct:kiss_fft_state
|
