HomeSort by relevance Sort by last modified time
    Searched refs:mdct (Results 1 - 14 of 14) sorted by null

  /external/libopus/celt/dump_modes/
dump_modes_arm_ne10.c 81 for(k=0;k<=mode->mdct.maxshift;k++) {
83 cfg = (NE10_FFT_CFG_TYPE_T)mode->mdct.kfft[k]->arch_fft->priv;
87 mode->mdct.kfft[k]->nfft, (NE10_MAXFACTORS * 2));
95 for(k=0;k<=mode->mdct.maxshift;k++) {
97 cfg = (NE10_FFT_CFG_TYPE_T)mode->mdct.kfft[k]->arch_fft->priv;
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++) {
115 for(k=0;k<=mode->mdct.maxshift;k++) {
117 cfg = (NE10_FFT_CFG_TYPE_T)mode->mdct.kfft[k]->arch_fft->priv
    [all...]
dump_modes.c 152 mode->Fs, mdctSize, mode->mdct.kfft[0]->nfft);
153 for (j=0;j<mode->mdct.kfft[0]->nfft;j++)
154 fprintf (file, "{" WORD16 ", " WORD16 "},%c", mode->mdct.kfft[0]->twiddles[j].r, mode->mdct.kfft[0]->twiddles[j].i,(j+3)%2==0?'\n':' ');
161 for (k=0;k<=mode->mdct.maxshift;k++)
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++
    [all...]
Makefile 13 ../mdct.c \
  /external/libopus/celt/
modes.h 36 #include "mdct.h"
70 mdct_lookup mdct; member in struct:OpusCustomMode
modes.c 393 if (clt_mdct_init(&mode->mdct, 2*mode->shortMdctSize*mode->nbShortMdcts,
438 clt_mdct_clear(&mode->mdct, arch);
celt_decoder.c 38 #include "mdct.h"
366 clt_mdct_backward(&mode->mdct, &freq2[b], out_syn[0]+NB*b, mode->window, overlap, shift, B, arch);
368 clt_mdct_backward(&mode->mdct, &freq[b], out_syn[1]+NB*b, mode->window, overlap, shift, B, arch);
382 clt_mdct_backward(&mode->mdct, &freq[b], out_syn[0]+NB*b, mode->window, overlap, shift, B, arch);
389 clt_mdct_backward(&mode->mdct, &freq[b], out_syn[c]+NB*b, mode->window, overlap, shift, B, arch);
681 /* We need to extrapolate enough samples to cover a complete MDCT
759 /* Apply the pre-filter to the MDCT overlap for the next frame because
760 the post-filter will be re-applied in the decoder after the MDCT
768 MDCT of the next frame. */
    [all...]
celt_encoder.c 38 #include "mdct.h"
442 /** Apply window and compute the MDCT for all sub-frames and
467 clt_mdct_forward(&mode->mdct, in+c*(B*N+overlap)+b*N,
    [all...]
  /external/libopus/
celt_sources.mk 12 celt/mdct.c \
celt_headers.mk 21 celt/mdct.h \
  /external/libopus/celt/tests/
test_unit_dft.c 103 cfg = mode->mdct.kfft[id];
test_unit_mdct.c 34 #include "mdct.h"
37 #include "mdct.h"
130 cfg = &mode->mdct;
  /external/libopus/src/
analysis.c 377 kfft = celt_mode->mdct.kfft[0];
    [all...]
opus_multistream_encoder.c 40 #include "mdct.h"
318 clt_mdct_forward(&celt_mode->mdct, in+960*frame, freq, celt_mode->window,
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
cor.h     [all...]

Completed in 180 milliseconds