Searched refs:fc_in (Results 1 - 4 of 4) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/
H A Dcelp_filters.h32 * @param fc_in source vector
35 * fc_out[n] = sum(i,0,len-1){ fc_in[i] * filter[(len + n - i)%len] }
37 * @note fc_in and fc_out should not overlap!
39 void ff_celp_convolve_circ(int16_t *fc_out, const int16_t *fc_in,
H A Dcelp_filters.c28 void ff_celp_convolve_circ(int16_t* fc_out, const int16_t* fc_in, argument
36 all fc_in[i] are zero) it is faster to loop over fc_in first. */
38 if (fc_in[i]) {
40 fc_out[k] += (fc_in[i] * filter[len + k - i]) >> 15;
43 fc_out[k] += (fc_in[i] * filter[ k - i]) >> 15;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/
H A Dcelp_filters.h81 * @param fc_in source vector
84 * fc_out[n] = sum(i,0,len-1){ fc_in[i] * filter[(len + n - i)%len] }
86 * @note fc_in and fc_out should not overlap!
88 void ff_celp_convolve_circ(int16_t *fc_out, const int16_t *fc_in,
H A Dcelp_filters.c30 void ff_celp_convolve_circ(int16_t* fc_out, const int16_t* fc_in, argument
38 all fc_in[i] are zero) it is faster to loop over fc_in first. */
40 if (fc_in[i]) {
42 fc_out[k] += (fc_in[i] * filter[len + k - i]) >> 15;
45 fc_out[k] += (fc_in[i] * filter[ k - i]) >> 15;

Completed in 43 milliseconds