HomeSort by relevance Sort by last modified time
    Searched defs:twiddles (Results 1 - 6 of 6) sorted by null

  /external/aac/libFDK/src/mips/
fft_rad2_mips.cpp 110 int32c *twiddles; local
113 case 4: twiddles = (int32c*)__twiddles_mips_fft32_16; break;
114 case 5: twiddles = (int32c*)__twiddles_mips_fft32_32; break;
115 case 6: twiddles = (int32c*)__twiddles_mips_fft32_64; break;
116 case 7: twiddles = (int32c*)__twiddles_mips_fft32_128; break;
117 case 8: twiddles = (int32c*)__twiddles_mips_fft32_256; break;
118 case 9: twiddles = (int32c*)__twiddles_mips_fft32_512; break;
119 case 10: twiddles = (int32c*)__twiddles_mips_fft32_1024; break;
120 //case 11: twiddles = (int32c*)__twiddles_mips_fft32_2048; break;
124 mips_fft32(dout, din, twiddles, scratch, ldn)
    [all...]
  /external/libopus/celt/
kiss_fft.h 95 const kiss_twiddle_cpx *twiddles; member in struct:kiss_fft_state
kiss_fft.c 117 /* Degenerate case where all the twiddles are 1. */
145 tw3 = tw2 = tw1 = st->twiddles;
197 epi3 = st->twiddles[fstride*m];
202 tw1=tw2=st->twiddles;
257 ya = st->twiddles[fstride*m];
258 yb = st->twiddles[fstride*2*m];
260 tw=st->twiddles;
409 static void compute_twiddles(kiss_twiddle_cpx *twiddles, int nfft)
415 kf_cexp2(twiddles+i, DIV32(SHL32(phase,17),nfft));
421 kf_cexp(twiddles+i, phase )
452 kiss_twiddle_cpx *twiddles; local
    [all...]
  /external/speex/libspeex/
_kiss_fft_guts.h 35 kiss_fft_cpx twiddles[1]; member in struct:kiss_fft_state
kiss_fft.c 48 tw1 = st->twiddles;
72 tw1 = st->twiddles;
107 tw3 = tw2 = tw1 = st->twiddles;
137 tw3 = tw2 = tw1 = st->twiddles;
180 epi3 = st->twiddles[fstride*m];
182 tw1=tw2=st->twiddles;
224 kiss_fft_cpx * twiddles = st->twiddles; local
227 ya = twiddles[fstride*m];
228 yb = twiddles[fstride*2*m]
287 kiss_fft_cpx * twiddles = st->twiddles; local
    [all...]
  /external/eigen/unsupported/Eigen/src/FFT/
ei_kissfft_impl.h 166 Complex * twiddles = &m_twiddles[0]; local
169 ya = twiddles[fstride*m];
170 yb = twiddles[fstride*2*m];
178 tw=twiddles;
236 Complex * twiddles = &m_twiddles[0]; local
255 t=scratchbuf[q] * twiddles[twidx];
391 // TODO look for PlanKey(nfft, ! inverse) and conjugate the twiddles

Completed in 249 milliseconds