Searched defs:nfft (Results 1 - 4 of 4) sorted by relevance

/system/chre/external/kiss_fft/
H A D_kiss_fft_guts.h29 int nfft; member in struct:kiss_fft_state
H A Dkiss_fftr.c27 kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem) argument
33 if (nfft & 1) {
37 nfft >>= 1;
39 kiss_fft_alloc (nfft, inverse_fft, NULL, &subsize);
40 memneeded = sizeof(struct kiss_fftr_state) + subsize + sizeof(kiss_fft_cpx) * (size_t)( nfft * 3 / 2);
54 st->super_twiddles = st->tmpbuf + nfft;
55 kiss_fft_alloc(nfft, inverse_fft, st->substate, &subsize);
57 for (i = 0; i < nfft/2; ++i) {
59 -3.14159265358979323846264338327 * ((double) (i+1) / nfft + .5);
78 ncfft = st->substate->nfft;
[all...]
H A Dkiss_fft.c209 int Norig = st->nfft;
339 kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem ) argument
343 + sizeof(kiss_fft_cpx)*(size_t)(nfft-1); /* twiddle factors*/
354 st->nfft=nfft;
357 for (i=0;i<nfft;++i) {
359 double phase = -2*pi*i / nfft;
365 kf_factor(nfft,st->factors);
376 kiss_fft_cpx * tmpbuf = (kiss_fft_cpx*)KISS_FFT_TMP_ALLOC( sizeof(kiss_fft_cpx)*(size_t)st->nfft);
378 memcpy(fout,tmpbuf,sizeof(kiss_fft_cpx)*(size_t)(st->nfft));
[all...]
H A Dkissfft.hh12 void fill_twiddles( std::complex<T_scalar> * dst ,int nfft,bool inverse) argument
14 T_scalar phinc = (inverse?2:-2)* acos( (T_scalar) -1) / nfft;
15 for (int i=0;i<nfft;++i)
21 int nfft,bool inverse,
25 _twiddles.resize(nfft);
26 fill_twiddles( &_twiddles[0],nfft,inverse);
31 int n= nfft;
66 kissfft(int nfft,bool inverse,const traits_type & traits=traits_type() ) argument
67 :_nfft(nfft),_inverse(inverse),_traits(traits)
19 prepare( std::vector< std::complex<T_scalar> > & dst, int nfft,bool inverse, std::vector<int> & stageRadix, std::vector<int> & stageRemainder ) argument

Completed in 8 milliseconds