2 * Copyright (c) 2013, The WebRTC project authors. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
11 * * Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in
13 * the documentation and/or other materials provided with the
16 * * Neither the name of Google nor the names of its contributors may
17 * be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
23 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
24 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
25 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
26 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
30 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
43 #define LPC_FILTERORDER 10
47 #define ST_MEM_L_TBL 85
48 #define MEM_LF_TBL 147
49 #define STATE_SHORT_LEN_20MS 57
50 #define STATE_SHORT_LEN_30MS 58
52 #define BLOCKL_MAX 240
55 #define CB_HALFFILTERLEN 4
56 #define CB_FILTERLEN 8
58 #define ENH_NBLOCKS_TOT 8
60 #define ENH_BUFL (ENH_NBLOCKS_TOT)*ENH_BLOCKL
61 #define ENH_BUFL_FILTEROVERHEAD 3
62 #define BLOCKL_MAX 240
70 #define STATE_SHORT_LEN_30MS 58
71 #define STATE_SHORT_LEN_20MS 57
73 #define SPL_MUL_16_16(a, b) ((int32_t) (((int16_t)(a)) * ((int16_t)(b))))
74 #define SPL_MUL_16_16_RSFT(a, b, c) (SPL_MUL_16_16(a, b) >> (c))
76 typedef struct ILBCFrame {
77 int16_t lsf[LSF_NSPLIT*LPC_N_MAX];
78 int16_t cb_index[CB_NSTAGES*(NASUB_MAX + 1)];
79 int16_t gain_index[CB_NSTAGES*(NASUB_MAX + 1)];
82 int16_t idx[STATE_SHORT_LEN_30MS];
87 typedef struct ILBCContext {
105 int16_t lsfdeq[LPC_FILTERORDER*LPC_N_MAX];
106 int16_t lsfold[LPC_FILTERORDER];
107 int16_t syntMem[LPC_FILTERORDER];
108 int16_t lsfdeqold[LPC_FILTERORDER];
109 int16_t weightdenum[(LPC_FILTERORDER + 1) * NSUB_MAX];
110 int16_t syntdenum[NSUB_MAX * (LPC_FILTERORDER + 1)];
111 int16_t old_syntdenum[NSUB_MAX * (LPC_FILTERORDER + 1)];
112 int16_t enh_buf[ENH_BUFL+ENH_BUFL_FILTEROVERHEAD];
113 int16_t enh_period[ENH_NBLOCKS_TOT];
114 int16_t prevResidual[NSUB_MAX*SUBL];
115 int16_t decresidual[BLOCKL_MAX];
116 int16_t plc_residual[BLOCKL_MAX + LPC_FILTERORDER];
122 int16_t prev_lpc[LPC_FILTERORDER + 1];
123 int16_t plc_lpc[LPC_FILTERORDER + 1];
128 static int unpack_frame(ILBCContext *s)
130 ILBCFrame *frame = &s->frame;
131 GetBitContext *gb = &s->gb;
134 frame->lsf[0] = get_bits(gb, 6);
135 frame->lsf[1] = get_bits(gb, 7);
136 frame->lsf[2] = get_bits(gb, 7);
139 frame->start = get_bits(gb, 2);
140 frame->state_first = get_bits1(gb);
141 frame->ifm = get_bits(gb, 6);
142 frame->cb_index[0] = get_bits(gb, 6) << 1;
143 frame->gain_index[0] = get_bits(gb, 2) << 3;
144 frame->gain_index[1] = get_bits1(gb) << 3;
145 frame->cb_index[3] = get_bits(gb, 7) << 1;
146 frame->gain_index[3] = get_bits1(gb) << 4;
147 frame->gain_index[4] = get_bits1(gb) << 3;
148 frame->gain_index[6] = get_bits1(gb) << 4;
150 frame->lsf[3] = get_bits(gb, 6);
151 frame->lsf[4] = get_bits(gb, 7);
152 frame->lsf[5] = get_bits(gb, 7);
153 frame->start = get_bits(gb, 3);
154 frame->state_first = get_bits1(gb);
155 frame->ifm = get_bits(gb, 6);
156 frame->cb_index[0] = get_bits(gb, 4) << 3;
157 frame->gain_index[0] = get_bits1(gb) << 4;
158 frame->gain_index[1] = get_bits1(gb) << 3;
159 frame->cb_index[3] = get_bits(gb, 6) << 2;
160 frame->gain_index[3] = get_bits1(gb) << 4;
161 frame->gain_index[4] = get_bits1(gb) << 3;
164 for (j = 0; j < 48; j++)
165 frame->idx[j] = get_bits1(gb) << 2;
169 frame->idx[j] = get_bits1(gb) << 2;
171 frame->gain_index[1] |= get_bits1(gb) << 2;
172 frame->gain_index[3] |= get_bits(gb, 2) << 2;
173 frame->gain_index[4] |= get_bits1(gb) << 2;
174 frame->gain_index[6] |= get_bits1(gb) << 3;
175 frame->gain_index[7] = get_bits(gb, 2) << 2;
178 frame->idx[j] = get_bits1(gb) << 2;
180 frame->cb_index[0] |= get_bits(gb, 2) << 1;
181 frame->gain_index[0] |= get_bits1(gb) << 3;
182 frame->gain_index[1] |= get_bits1(gb) << 2;
183 frame->cb_index[3] |= get_bits1(gb) << 1;
184 frame->cb_index[6] = get_bits1(gb) << 7;
185 frame->cb_index[6] |= get_bits(gb, 6) << 1;
186 frame->cb_index[9] = get_bits(gb, 7) << 1;
187 frame->cb_index[12] = get_bits(gb, 3) << 5;
188 frame->cb_index[12] |= get_bits(gb, 4) << 1;
189 frame->gain_index[3] |= get_bits(gb, 2) << 2;
190 frame->gain_index[4] |= get_bits(gb, 2) << 1;
191 frame->gain_index[6] = get_bits(gb, 2) << 3;
192 frame->gain_index[7] = get_bits(gb, 2) << 2;
193 frame->gain_index[9] = get_bits1(gb) << 4;
194 frame->gain_index[10] = get_bits1(gb) << 3;
195 frame->gain_index[12] = get_bits1(gb) << 4;
196 frame->gain_index[13] = get_bits1(gb) << 3;
199 for (j = 0; j < 56; j++)
200 frame->idx[j] |= get_bits(gb, 2);
203 frame->idx[56] |= get_bits(gb, 2);
204 frame->cb_index[0] |= get_bits1(gb);
205 frame->cb_index[1] = get_bits(gb, 7);
206 frame->cb_index[2] = get_bits(gb, 6) << 1;
207 frame->cb_index[2] |= get_bits1(gb);
208 frame->gain_index[0] |= get_bits(gb, 3);
209 frame->gain_index[1] |= get_bits(gb, 2);
210 frame->gain_index[2] = get_bits(gb, 3);
211 frame->cb_index[3] |= get_bits1(gb);
212 frame->cb_index[4] = get_bits(gb, 6) << 1;
213 frame->cb_index[4] |= get_bits1(gb);
214 frame->cb_index[5] = get_bits(gb, 7);
215 frame->cb_index[6] = get_bits(gb, 8);
216 frame->cb_index[7] = get_bits(gb, 8);
217 frame->cb_index[8] = get_bits(gb, 8);
218 frame->gain_index[3] |= get_bits(gb, 2);
219 frame->gain_index[4] |= get_bits(gb, 2);
220 frame->gain_index[5] = get_bits(gb, 3);
221 frame->gain_index[6] |= get_bits(gb, 3);
222 frame->gain_index[7] |= get_bits(gb, 2);
223 frame->gain_index[8] = get_bits(gb, 3);
225 frame->idx[56] |= get_bits(gb, 2);
226 frame->idx[57] |= get_bits(gb, 2);
227 frame->cb_index[0] |= get_bits1(gb);
228 frame->cb_index[1] = get_bits(gb, 7);
229 frame->cb_index[2] = get_bits(gb, 4) << 3;
230 frame->cb_index[2] |= get_bits(gb, 3);
231 frame->gain_index[0] |= get_bits(gb, 3);
232 frame->gain_index[1] |= get_bits(gb, 2);
233 frame->gain_index[2] = get_bits(gb, 3);
234 frame->cb_index[3] |= get_bits1(gb);
235 frame->cb_index[4] = get_bits(gb, 4) << 3;
236 frame->cb_index[4] |= get_bits(gb, 3);
237 frame->cb_index[5] = get_bits(gb, 7);
238 frame->cb_index[6] |= get_bits1(gb);
239 frame->cb_index[7] = get_bits(gb, 5) << 3;
240 frame->cb_index[7] |= get_bits(gb, 3);
241 frame->cb_index[8] = get_bits(gb, 8);
242 frame->cb_index[9] |= get_bits1(gb);
243 frame->cb_index[10] = get_bits(gb, 4) << 4;
244 frame->cb_index[10] |= get_bits(gb, 4);
245 frame->cb_index[11] = get_bits(gb, 8);
246 frame->cb_index[12] |= get_bits1(gb);
247 frame->cb_index[13] = get_bits(gb, 3) << 5;
248 frame->cb_index[13] |= get_bits(gb, 5);
249 frame->cb_index[14] = get_bits(gb, 8);
250 frame->gain_index[3] |= get_bits(gb, 2);
251 frame->gain_index[4] |= get_bits1(gb);
252 frame->gain_index[5] = get_bits(gb, 3);
253 frame->gain_index[6] |= get_bits(gb, 3);
254 frame->gain_index[7] |= get_bits(gb, 2);
255 frame->gain_index[8] = get_bits(gb, 3);
256 frame->gain_index[9] |= get_bits(gb, 4);
257 frame->gain_index[10] |= get_bits1(gb) << 2;
258 frame->gain_index[10] |= get_bits(gb, 2);
259 frame->gain_index[11] = get_bits(gb, 3);
260 frame->gain_index[12] |= get_bits(gb, 4);
261 frame->gain_index[13] |= get_bits(gb, 3);
262 frame->gain_index[14] = get_bits(gb, 3);
265 return get_bits1(gb);
268 static void index_conv(int16_t *index)
272 for (k = 4; k < 6; k++) {
273 if (index[k] >= 44 && index[k] < 108) {
275 } else if (index[k] >= 108 && index[k] < 128) {
281 static void lsf_dequantization(int16_t *lsfdeq, int16_t *index, int16_t lpc_n)
283 int i, j, pos = 0, cb_pos = 0;
285 for (i = 0; i < LSF_NSPLIT; i++) {
286 for (j = 0; j < lsf_dim_codebook[i]; j++) {
287 lsfdeq[pos + j] = lsf_codebook[cb_pos + index[i] * lsf_dim_codebook[i] + j];
290 pos += lsf_dim_codebook[i];
291 cb_pos += lsf_size_codebook[i] * lsf_dim_codebook[i];
297 for (i = 0; i < LSF_NSPLIT; i++) {
298 for (j = 0; j < lsf_dim_codebook[i]; j++) {
299 lsfdeq[LPC_FILTERORDER + pos + j] = lsf_codebook[cb_pos +
300 index[LSF_NSPLIT + i] * lsf_dim_codebook[i] + j];
303 pos += lsf_dim_codebook[i];
304 cb_pos += lsf_size_codebook[i] * lsf_dim_codebook[i];
309 static void lsf_check_stability(int16_t *lsf, int dim, int nb_vectors)
311 for (int n = 0; n < 2; n++) {
312 for (int m = 0; m < nb_vectors; m++) {
313 for (int k = 0; k < dim - 1; k++) {
316 if ((lsf[i + 1] - lsf[i]) < 319) {
317 if (lsf[i + 1] < lsf[i]) {
318 lsf[i + 1] = lsf[i] + 160;
319 lsf[i] = lsf[i + 1] - 160;
326 lsf[i] = av_clip(lsf[i], 82, 25723);
332 static void lsf_interpolate(int16_t *out, int16_t *in1,
333 int16_t *in2, int16_t coef,
336 int invcoef = 16384 - coef, i;
338 for (i = 0; i < size; i++)
339 out[i] = (coef * in1[i] + invcoef * in2[i] + 8192) >> 14;
342 static void lsf2lsp(int16_t *lsf, int16_t *lsp, int order)
348 for (i = 0; i < order; i++) {
349 freq = (lsf[i] * 20861) >> 15;
350 /* 20861: 1.0/(2.0*PI) in Q17 */
352 Upper 8 bits give the index k and
353 Lower 8 bits give the difference, which needs
354 to be approximated linearly
356 k = FFMIN(freq >> 8, 63);
359 /* Calculate linear approximation */
360 tmp = cos_derivative_tbl[k] * diff;
361 lsp[i] = cos_tbl[k] + (tmp >> 12);
365 static void get_lsp_poly(int16_t *lsp, int32_t *f)
372 f[1] = lsp[0] * -1024;
374 for (i = 2, k = 2, l = 2; i <= 5; i++, k += 2) {
377 for (j = i; j > 1; j--, l--) {
378 high = f[l - 1] >> 16;
379 low = (f[l - 1] - (high << 16)) >> 1;
381 tmp = ((high * lsp[k]) << 2) + (((low * lsp[k]) >> 15) << 2);
387 f[l] -= lsp[k] << 10;
392 static void lsf2poly(int16_t *a, int16_t *lsf)
399 lsf2lsp(lsf, lsp, LPC_FILTERORDER);
401 get_lsp_poly(&lsp[0], f[0]);
402 get_lsp_poly(&lsp[1], f[1]);
404 for (i = 5; i > 0; i--) {
405 f[0][i] += f[0][i - 1];
406 f[1][i] -= f[1][i - 1];
410 for (i = 5; i > 0; i--) {
411 tmp = f[0][6 - i] + f[1][6 - i];
412 a[6 - i] = (tmp + 4096) >> 13;
414 tmp = f[0][6 - i] - f[1][6 - i];
415 a[5 + i] = (tmp + 4096) >> 13;
419 static void lsp_interpolate2polydec(int16_t *a, int16_t *lsf1,
420 int16_t *lsf2, int coef, int length)
422 int16_t lsftmp[LPC_FILTERORDER];
424 lsf_interpolate(lsftmp, lsf1, lsf2, coef, length);
428 static void bw_expand(int16_t *out, const int16_t *in, const int16_t *coef, int length)
433 for (i = 1; i < length; i++)
434 out[i] = (coef[i] * in[i] + 16384) >> 15;
437 static void lsp_interpolate(int16_t *syntdenum, int16_t *weightdenum,
438 int16_t *lsfdeq, int16_t length,
441 int16_t lp[LPC_FILTERORDER + 1], *lsfdeq2;
442 int i, pos, lp_length;
444 lsfdeq2 = lsfdeq + length;
445 lp_length = length + 1;
448 lsp_interpolate2polydec(lp, (*s).lsfdeqold, lsfdeq, lsf_weight_30ms[0], length);
449 memcpy(syntdenum, lp, lp_length * 2);
450 bw_expand(weightdenum, lp, kLpcChirpSyntDenum, lp_length);
453 for (i = 1; i < 6; i++) {
454 lsp_interpolate2polydec(lp, lsfdeq, lsfdeq2,
457 memcpy(syntdenum + pos, lp, lp_length * 2);
458 bw_expand(weightdenum + pos, lp, kLpcChirpSyntDenum, lp_length);
463 for (i = 0; i < s->nsub; i++) {
464 lsp_interpolate2polydec(lp, s->lsfdeqold, lsfdeq,
465 lsf_weight_20ms[i], length);
466 memcpy(syntdenum + pos, lp, lp_length * 2);
467 bw_expand(weightdenum + pos, lp, kLpcChirpSyntDenum, lp_length);
473 memcpy(s->lsfdeqold, lsfdeq2, length * 2);
475 memcpy(s->lsfdeqold, lsfdeq, length * 2);
479 static void filter_mafq12(int16_t *in_ptr, int16_t *out_ptr,
480 int16_t *B, int16_t B_length,
485 for (i = 0; i < length; i++) {
486 const int16_t *b_ptr = &B[0];
487 const int16_t *x_ptr = &in_ptr[i];
490 for (j = 0; j < B_length; j++)
491 o += b_ptr[j] * *x_ptr--;
493 o = av_clip(o, -134217728, 134215679);
495 out_ptr[i] = ((o + 2048) >> 12);
499 static void filter_arfq12(const int16_t *data_in,
501 const int16_t *coefficients,
502 int coefficients_length,
507 for (i = 0; i < data_length; i++) {
508 int output = 0, sum = 0;
510 for (j = coefficients_length - 1; j > 0; j--) {
511 sum += coefficients[j] * data_out[i - j];
514 output = coefficients[0] * data_in[i] - sum;
515 output = av_clip(output, -134217728, 134215679);
517 data_out[i] = (output + 2048) >> 12;
521 static void state_construct(int16_t ifm, int16_t *idx,
522 int16_t *synt_denum, int16_t *Out_fix,
527 int16_t *tmp1, *tmp2, *tmp3;
529 int16_t numerator[1 + LPC_FILTERORDER];
530 int16_t sampleValVec[2 * STATE_SHORT_LEN_30MS + LPC_FILTERORDER];
531 int16_t sampleMaVec[2 * STATE_SHORT_LEN_30MS + LPC_FILTERORDER];
532 int16_t *sampleVal = &sampleValVec[LPC_FILTERORDER];
533 int16_t *sampleMa = &sampleMaVec[LPC_FILTERORDER];
534 int16_t *sampleAr = &sampleValVec[LPC_FILTERORDER];
536 /* initialization of coefficients */
538 for (k = 0; k < LPC_FILTERORDER + 1; k++) {
539 numerator[k] = synt_denum[LPC_FILTERORDER - k];
542 /* decoding of the maximum value */
544 maxVal = frg_quant_mod[ifm];
546 /* decoding of the sample values */
548 tmp2 = &idx[len - 1];
551 for (k = 0; k < len; k++) {
552 /*the shifting is due to the Q13 in sq4_fixQ13[i], also the adding of 2097152 (= 0.5 << 22)
553 maxVal is in Q8 and result is in Q(-1) */
554 (*tmp1) = (int16_t) ((SPL_MUL_16_16(maxVal, ilbc_state[(*tmp2)]) + 2097152) >> 22);
558 } else if (ifm < 59) {
559 for (k = 0; k < len; k++) {
560 /*the shifting is due to the Q13 in sq4_fixQ13[i], also the adding of 262144 (= 0.5 << 19)
561 maxVal is in Q5 and result is in Q(-1) */
562 (*tmp1) = (int16_t) ((SPL_MUL_16_16(maxVal, ilbc_state[(*tmp2)]) + 262144) >> 19);
567 for (k = 0; k < len; k++) {
568 /*the shifting is due to the Q13 in sq4_fixQ13[i], also the adding of 65536 (= 0.5 << 17)
569 maxVal is in Q3 and result is in Q(-1) */
570 (*tmp1) = (int16_t) ((SPL_MUL_16_16(maxVal, ilbc_state[(*tmp2)]) + 65536) >> 17);
576 /* Set the rest of the data to zero */
577 memset(&sampleVal[len], 0, len * 2);
579 /* circular convolution with all-pass filter */
581 /* Set the state to zero */
582 memset(sampleValVec, 0, LPC_FILTERORDER * 2);
584 /* Run MA filter + AR filter */
585 filter_mafq12(sampleVal, sampleMa, numerator, LPC_FILTERORDER + 1, len + LPC_FILTERORDER);
586 memset(&sampleMa[len + LPC_FILTERORDER], 0, (len - LPC_FILTERORDER) * 2);
587 filter_arfq12(sampleMa, sampleAr, synt_denum, LPC_FILTERORDER + 1, 2 * len);
589 tmp1 = &sampleAr[len - 1];
590 tmp2 = &sampleAr[2 * len - 1];
592 for (k = 0; k < len; k++) {
593 (*tmp3) = (*tmp1) + (*tmp2);
600 static int16_t gain_dequantization(int index, int max_in, int stage)
602 int16_t scale = FFMAX(1638, FFABS(max_in));
604 return ((scale * ilbc_gain[stage][index]) + 8192) >> 14;
607 static void vector_rmultiplication(int16_t *out, const int16_t *in,
609 int length, int shift)
611 for (int i = 0; i < length; i++)
612 out[i] = (in[i] * win[-i]) >> shift;
615 static void vector_multiplication(int16_t *out, const int16_t *in,
616 const int16_t *win, int length,
619 for (int i = 0; i < length; i++)
620 out[i] = (in[i] * win[i]) >> shift;
623 static void add_vector_and_shift(int16_t *out, const int16_t *in1,
624 const int16_t *in2, int length,
627 for (int i = 0; i < length; i++)
628 out[i] = (in1[i] + in2[i]) >> shift;
631 static void create_augmented_vector(int index, int16_t *buffer, int16_t *cbVec)
634 int16_t ilow = index - 4;
636 memcpy(cbVec, buffer - index, index * 2);
638 vector_multiplication(&cbVec[ilow], buffer - index - 4, alpha, 4, 15);
639 vector_rmultiplication(cbVecTmp, buffer - 4, &alpha[3], 4, 15);
640 add_vector_and_shift(&cbVec[ilow], &cbVec[ilow], cbVecTmp, 4, 0);
642 memcpy(cbVec + index, buffer - index, (SUBL - index) * sizeof(*cbVec));
645 static void get_codebook(int16_t * cbvec, /* (o) Constructed codebook vector */
646 int16_t * mem, /* (i) Codebook buffer */
647 int16_t index, /* (i) Codebook index */
648 int16_t lMem, /* (i) Length of codebook buffer */
649 int16_t cbveclen /* (i) Codebook vector length */
652 int16_t k, base_size;
655 int16_t tempbuff2[SUBL + 5];
657 /* Determine size of codebook sections */
658 base_size = lMem - cbveclen + 1;
660 if (cbveclen == SUBL) {
661 base_size += cbveclen / 2;
664 /* No filter -> First codebook section */
665 if (index < lMem - cbveclen + 1) {
666 /* first non-interpolated vectors */
668 k = index + cbveclen;
670 memcpy(cbvec, mem + lMem - k, cbveclen * 2);
671 } else if (index < base_size) {
675 k = (int16_t) SPL_MUL_16_16(2, (index - (lMem - cbveclen + 1))) + cbveclen;
679 create_augmented_vector(lag, mem + lMem, cbvec);
683 /* first non-interpolated vectors */
685 if (index - base_size < lMem - cbveclen + 1) {
687 /* Set up filter memory, stuff zeros outside memory buffer */
689 memIndTest = lMem - (index - base_size + cbveclen);
691 memset(mem - CB_HALFFILTERLEN, 0, CB_HALFFILTERLEN * 2);
692 memset(mem + lMem, 0, CB_HALFFILTERLEN * 2);
694 /* do filtering to get the codebook vector */
696 filter_mafq12(&mem[memIndTest + 4], cbvec, (int16_t *) kCbFiltersRev, CB_FILTERLEN, cbveclen);
698 /* interpolated vectors */
699 /* Stuff zeros outside memory buffer */
700 memIndTest = lMem - cbveclen - CB_FILTERLEN;
701 memset(mem + lMem, 0, CB_HALFFILTERLEN * 2);
704 filter_mafq12(&mem[memIndTest + 7], tempbuff2, (int16_t *) kCbFiltersRev, CB_FILTERLEN, (int16_t) (cbveclen + 5));
706 /* Calculate lag index */
707 lag = (cbveclen << 1) - 20 + index - base_size - lMem - 1;
709 create_augmented_vector(lag, tempbuff2 + SUBL + 5, cbvec);
714 static void construct_vector (
715 int16_t *decvector, /* (o) Decoded vector */
716 int16_t *index, /* (i) Codebook indices */
717 int16_t *gain_index, /* (i) Gain quantization indices */
718 int16_t *mem, /* (i) Buffer for codevector construction */
719 int16_t lMem, /* (i) Length of buffer */
722 int16_t gain[CB_NSTAGES];
723 int16_t cbvec0[SUBL];
724 int16_t cbvec1[SUBL];
725 int16_t cbvec2[SUBL];
730 /* gain de-quantization */
732 gain[0] = gain_dequantization(gain_index[0], 16384, 0);
733 gain[1] = gain_dequantization(gain_index[1], gain[0], 1);
734 gain[2] = gain_dequantization(gain_index[2], gain[1], 2);
736 /* codebook vector construction and construction of total vector */
739 get_codebook(cbvec0, mem, index[0], lMem, veclen);
740 get_codebook(cbvec1, mem, index[1], lMem, veclen);
741 get_codebook(cbvec2, mem, index[2], lMem, veclen);
744 for (j = 0; j < veclen; j++) {
745 a32 = SPL_MUL_16_16(*gainPtr++, cbvec0[j]);
746 a32 += SPL_MUL_16_16(*gainPtr++, cbvec1[j]);
747 a32 += SPL_MUL_16_16(*gainPtr, cbvec2[j]);
749 decvector[j] = (a32 + 8192) >> 14;
753 static void reverse_memcpy(int16_t *dest, int16_t *source, int length)
755 int16_t* destPtr = dest;
756 int16_t* sourcePtr = source;
759 for (j = 0; j < length; j++)
760 *destPtr-- = *sourcePtr++;
763 static void decode_residual(ILBCContext *s,
765 int16_t *decresidual,
768 int16_t meml_gotten, Nfor, Nback, diff, start_pos;
769 int16_t subcount, subframe;
770 int16_t *reverseDecresidual = s->enh_buf; /* Reversed decoded data, used for decoding backwards in time (reuse memory in state) */
771 int16_t *memVec = s->prevResidual;
772 int16_t *mem = &memVec[CB_HALFFILTERLEN]; /* Memory for codebook */
774 diff = STATE_LEN - s->state_short_len;
776 if (encbits->state_first == 1) {
777 start_pos = (encbits->start - 1) * SUBL;
779 start_pos = (encbits->start - 1) * SUBL + diff;
782 /* decode scalar part of start state */
784 state_construct(encbits->ifm, encbits->idx, &syntdenum[(encbits->start - 1) * (LPC_FILTERORDER + 1)], &decresidual[start_pos], s->state_short_len);
786 if (encbits->state_first) { /* put adaptive part in the end */
788 memset(mem, 0, (int16_t) (CB_MEML - s->state_short_len) * 2);
789 memcpy(mem + CB_MEML - s->state_short_len, decresidual + start_pos, s->state_short_len * 2);
791 /* construct decoded vector */
793 construct_vector(&decresidual[start_pos + s->state_short_len], encbits->cb_index, encbits->gain_index, mem + CB_MEML - ST_MEM_L_TBL, ST_MEM_L_TBL, (int16_t) diff);
795 } else { /* put adaptive part in the beginning */
797 meml_gotten = s->state_short_len;
798 reverse_memcpy(mem + CB_MEML - 1, decresidual + start_pos, meml_gotten);
799 memset(mem, 0, (int16_t) (CB_MEML - meml_gotten) * 2);
801 /* construct decoded vector */
802 construct_vector(reverseDecresidual, encbits->cb_index, encbits->gain_index, mem + CB_MEML - ST_MEM_L_TBL, ST_MEM_L_TBL, diff);
804 /* get decoded residual from reversed vector */
805 reverse_memcpy(&decresidual[start_pos - 1], reverseDecresidual, diff);
808 /* counter for predicted subframes */
811 /* forward prediction of subframes */
812 Nfor = s->nsub - encbits->start - 1;
816 memset(mem, 0, (CB_MEML - STATE_LEN) * 2);
817 memcpy(mem + CB_MEML - STATE_LEN, decresidual + (encbits->start - 1) * SUBL, STATE_LEN * 2);
819 /* loop over subframes to encode */
820 for (subframe = 0; subframe < Nfor; subframe++) {
821 /* construct decoded vector */
822 construct_vector(&decresidual[(encbits->start + 1 + subframe) * SUBL], encbits->cb_index + subcount * CB_NSTAGES, encbits->gain_index + subcount * CB_NSTAGES, mem, MEM_LF_TBL, SUBL);
825 memmove(mem, mem + SUBL, (CB_MEML - SUBL) * sizeof(*mem));
826 memcpy(mem + CB_MEML - SUBL, &decresidual[(encbits->start + 1 + subframe) * SUBL], SUBL * 2);
833 /* backward prediction of subframes */
834 Nback = encbits->start - 1;
838 meml_gotten = SUBL * (s->nsub + 1 - encbits->start);
839 if (meml_gotten > CB_MEML) {
840 meml_gotten = CB_MEML;
843 reverse_memcpy(mem + CB_MEML - 1, decresidual + (encbits->start - 1) * SUBL, meml_gotten);
844 memset(mem, 0, (int16_t) (CB_MEML - meml_gotten) * 2);
846 /* loop over subframes to decode */
847 for (subframe = 0; subframe < Nback; subframe++) {
848 /* construct decoded vector */
849 construct_vector(&reverseDecresidual[subframe * SUBL], encbits->cb_index + subcount * CB_NSTAGES,
850 encbits->gain_index + subcount * CB_NSTAGES, mem, MEM_LF_TBL, SUBL);
853 memmove(mem, mem + SUBL, (CB_MEML - SUBL) * sizeof(*mem));
854 memcpy(mem + CB_MEML - SUBL, &reverseDecresidual[subframe * SUBL], SUBL * 2);
859 /* get decoded residual from reversed vector */
860 reverse_memcpy(decresidual + SUBL * Nback - 1, reverseDecresidual, SUBL * Nback);
864 static int16_t max_abs_value_w16(const int16_t* vector, int length)
866 int i = 0, absolute = 0, maximum = 0;
868 if (vector == NULL || length <= 0) {
872 for (i = 0; i < length; i++) {
873 absolute = FFABS(vector[i]);
874 if (absolute > maximum)
878 // Guard the case for abs(-32768).
879 return FFMIN(maximum, INT16_MAX);
882 static int16_t get_size_in_bits(uint32_t n)
886 if (0xFFFF0000 & n) {
892 if (0x0000FF00 & (n >> bits)) bits += 8;
893 if (0x000000F0 & (n >> bits)) bits += 4;
894 if (0x0000000C & (n >> bits)) bits += 2;
895 if (0x00000002 & (n >> bits)) bits += 1;
896 if (0x00000001 & (n >> bits)) bits += 1;
901 static int32_t scale_dot_product(const int16_t *v1, const int16_t *v2, int length, int scaling)
905 for (int i = 0; i < length; i++)
906 sum += (v1[i] * v2[i]) >> scaling;
911 static void correlation(int32_t *corr, int32_t *ener, int16_t *buffer,
912 int16_t lag, int16_t blen, int16_t srange, int16_t scale)
916 w16ptr = &buffer[blen - srange - lag];
918 *corr = scale_dot_product(&buffer[blen - srange], w16ptr, srange, scale);
919 *ener = scale_dot_product(w16ptr, w16ptr, srange, scale);
927 #define SPL_SHIFT_W32(x, c) (((c) >= 0) ? ((x) << (c)) : ((x) >> (-(c))))
929 static int16_t norm_w32(int32_t a)
940 static int32_t div_w32_w16(int32_t num, int16_t den)
948 static void do_plc(int16_t *plc_residual, /* (o) concealed residual */
949 int16_t *plc_lpc, /* (o) concealed LP parameters */
950 int16_t PLI, /* (i) packet loss indicator
952 int16_t *decresidual, /* (i) decoded residual */
953 int16_t *lpc, /* (i) decoded LPC (only used for no PL) */
954 int16_t inlag, /* (i) pitch lag */
955 ILBCContext *s) /* (i/o) decoder instance */
958 int32_t cross, ener, cross_comp, ener_comp = 0;
959 int32_t measure, max_measure, energy;
960 int16_t max, cross_square_max, cross_square;
961 int16_t j, lag, tmp1, tmp2, randlag;
962 int16_t shift1, shift2, shift3, shift_max;
965 int32_t tmpW32, tmp2W32;
968 int16_t max_perSquare;
969 int16_t scale1, scale2;
976 int16_t randvec[BLOCKL_MAX];
981 s->consPLICount += 1;
983 /* if previous frame not lost,
984 determine pitch pred. gain */
986 if (s->prevPLI != 1) {
988 /* Maximum 60 samples are correlated, preserve as high accuracy
989 as possible without getting overflow */
990 max = max_abs_value_w16(s->prevResidual, s->block_samples);
991 scale3 = (get_size_in_bits(max) << 1) - 25;
996 /* Store scale for use when interpolating between the
997 * concealment and the received packet */
998 s->prevScale = scale3;
1000 /* Search around the previous lag +/-3 to find the
1001 best pitch period */
1004 /* Guard against getting outside the frame */
1005 corrLen = FFMIN(60, s->block_samples - (inlag + 3));
1007 correlation(&cross, &ener, s->prevResidual, lag, s->block_samples, corrLen, scale3);
1009 /* Normalize and store cross^2 and the number of shifts */
1010 shift_max = get_size_in_bits(FFABS(cross)) - 15;
1011 cross_square_max = (int16_t) SPL_MUL_16_16_RSFT(SPL_SHIFT_W32(cross, -shift_max), SPL_SHIFT_W32(cross, -shift_max), 15);
1013 for (j = inlag - 2; j <= inlag + 3; j++) {
1014 correlation(&cross_comp, &ener_comp, s->prevResidual, j, s->block_samples, corrLen, scale3);
1016 /* Use the criteria (corr*corr)/energy to compare if
1017 this lag is better or not. To avoid the division,
1018 do a cross multiplication */
1019 shift1 = get_size_in_bits(FFABS(cross_comp)) - 15;
1020 cross_square = (int16_t) SPL_MUL_16_16_RSFT(SPL_SHIFT_W32(cross_comp, -shift1), SPL_SHIFT_W32(cross_comp, -shift1), 15);
1022 shift2 = get_size_in_bits(ener) - 15;
1023 measure = SPL_MUL_16_16(SPL_SHIFT_W32(ener, -shift2), cross_square);
1025 shift3 = get_size_in_bits(ener_comp) - 15;
1026 max_measure = SPL_MUL_16_16(SPL_SHIFT_W32(ener_comp, -shift3), cross_square_max);
1028 /* Calculate shift value, so that the two measures can
1029 be put in the same Q domain */
1030 if (((shift_max << 1) + shift3) > ((shift1 << 1) + shift2)) {
1031 tmp1 = FFMIN(31, (shift_max << 1) + shift3 - (shift1 << 1) - shift2);
1035 tmp2 = FFMIN(31, (shift1 << 1) + shift2 - (shift_max << 1) - shift3);
1038 if ((measure >> tmp1) > (max_measure >> tmp2)) {
1039 /* New lag is better => record lag, measure and domain */
1041 cross_square_max = cross_square;
1048 /* Calculate the periodicity for the lag with the maximum correlation.
1050 Definition of the periodicity:
1051 abs(corr(vec1, vec2))/(sqrt(energy(vec1))*sqrt(energy(vec2)))
1053 Work in the Square domain to simplify the calculations
1054 max_perSquare is less than 1 (in Q15)
1056 tmp2W32 = scale_dot_product(&s->prevResidual[s->block_samples - corrLen], &s->prevResidual[s->block_samples - corrLen], corrLen, scale3);
1058 if ((tmp2W32 > 0) && (ener_comp > 0)) {
1059 /* norm energies to int16_t, compute the product of the energies and
1060 use the upper int16_t as the denominator */
1062 scale1 = norm_w32(tmp2W32) - 16;
1063 tmp1 = SPL_SHIFT_W32(tmp2W32, scale1);
1065 scale2 = norm_w32(ener) - 16;
1066 tmp2 = SPL_SHIFT_W32(ener, scale2);
1067 denom = SPL_MUL_16_16_RSFT(tmp1, tmp2, 16); /* denom in Q(scale1+scale2-16) */
1069 /* Square the cross correlation and norm it such that max_perSquare
1070 will be in Q15 after the division */
1072 totscale = scale1 + scale2 - 1;
1073 tmp1 = SPL_SHIFT_W32(cross, (totscale >> 1));
1074 tmp2 = SPL_SHIFT_W32(cross, totscale - (totscale >> 1));
1076 nom = SPL_MUL_16_16(tmp1, tmp2);
1077 max_perSquare = div_w32_w16(nom, denom);
1082 /* previous frame lost, use recorded lag and gain */
1084 max_perSquare = s->per_square;
1087 /* Attenuate signal and scale down pitch pred gain if
1088 several frames lost consecutively */
1090 use_gain = 32767; /* 1.0 in Q15 */
1092 if (s->consPLICount * s->block_samples > 320) {
1093 use_gain = 29491; /* 0.9 in Q15 */
1094 } else if (s->consPLICount * s->block_samples > 640) {
1095 use_gain = 22938; /* 0.7 in Q15 */
1096 } else if (s->consPLICount * s->block_samples > 960) {
1097 use_gain = 16384; /* 0.5 in Q15 */
1098 } else if (s->consPLICount * s->block_samples > 1280) {
1099 use_gain = 0; /* 0.0 in Q15 */
1102 /* Compute mixing factor of picth repeatition and noise:
1103 for max_per>0.7 set periodicity to 1.0
1104 0.4<max_per<0.7 set periodicity to (maxper-0.4)/0.7-0.4)
1105 max_per<0.4 set periodicity to 0.0
1108 if (max_perSquare > 7868) { /* periodicity > 0.7 (0.7^4=0.2401 in Q15) */
1110 } else if (max_perSquare > 839) { /* 0.4 < periodicity < 0.7 (0.4^4=0.0256 in Q15) */
1111 /* find best index and interpolate from that */
1113 while ((max_perSquare < kPlcPerSqr[ind]) && (ind > 0)) {
1116 /* pitch fact is approximated by first order */
1117 tmpW32 = kPlcPitchFact[ind] + SPL_MUL_16_16_RSFT(kPlcPfSlope[ind], (max_perSquare - kPlcPerSqr[ind]), 11);
1119 pitchfact = FFMIN(tmpW32, 32767); /* guard against overflow */
1121 } else { /* periodicity < 0.4 */
1125 /* avoid repetition of same pitch cycle (buzzyness) */
1131 /* compute concealed residual */
1134 for (i = 0; i < s->block_samples; i++) {
1135 /* noise component - 52 < randlagFIX < 117 */
1136 s->seed = SPL_MUL_16_16(s->seed, 31821) + 13849;
1137 randlag = 53 + (s->seed & 63);
1142 randvec[i] = s->prevResidual[s->block_samples + pick];
1144 randvec[i] = s->prevResidual[pick];
1147 /* pitch repeatition component */
1151 plc_residual[i] = s->prevResidual[s->block_samples + pick];
1153 plc_residual[i] = plc_residual[pick];
1156 /* Attinuate total gain for each 10 ms */
1158 tot_gain = use_gain;
1159 } else if (i < 160) {
1160 tot_gain = SPL_MUL_16_16_RSFT(31130, use_gain, 15); /* 0.95*use_gain */
1162 tot_gain = SPL_MUL_16_16_RSFT(29491, use_gain, 15); /* 0.9*use_gain */
1165 /* mix noise and pitch repeatition */
1166 plc_residual[i] = SPL_MUL_16_16_RSFT(tot_gain, (pitchfact * plc_residual[i] + (32767 - pitchfact) * randvec[i] + 16384) >> 15, 15);
1168 /* Shifting down the result one step extra to ensure that no overflow
1170 energy += SPL_MUL_16_16_RSFT(plc_residual[i], plc_residual[i], (s->prevScale + 1));
1174 /* less than 30 dB, use only noise */
1175 if (energy < SPL_SHIFT_W32(s->block_samples * 900, -s->prevScale - 1)) {
1177 for (i = 0; i < s->block_samples; i++) {
1178 plc_residual[i] = randvec[i];
1182 /* use the old LPC */
1183 memcpy(plc_lpc, (*s).prev_lpc, (LPC_FILTERORDER + 1) * 2);
1185 /* Update state in case there are multiple frame losses */
1187 s->per_square = max_perSquare;
1188 } else { /* no packet loss, copy input */
1189 memcpy(plc_residual, decresidual, s->block_samples * 2);
1190 memcpy(plc_lpc, lpc, (LPC_FILTERORDER + 1) * 2);
1191 s->consPLICount = 0;
1196 memcpy(s->prev_lpc, plc_lpc, (LPC_FILTERORDER + 1) * 2);
1197 memcpy(s->prevResidual, plc_residual, s->block_samples * 2);
1202 static int xcorr_coeff(int16_t *target, int16_t *regressor,
1203 int16_t subl, int16_t searchLen,
1204 int16_t offset, int16_t step)
1209 int16_t cross_corr_scale, energy_scale;
1210 int16_t cross_corr_sg_mod, cross_corr_sg_mod_max;
1211 int32_t cross_corr, energy;
1212 int16_t cross_corr_mod, energy_mod, enery_mod_max;
1214 int16_t *rp_beg, *rp_end;
1215 int16_t totscale, totscale_max;
1217 int32_t new_crit, max_crit;
1221 /* Initializations, to make sure that the first one is selected */
1222 cross_corr_sg_mod_max = 0;
1223 enery_mod_max = INT16_MAX;
1224 totscale_max = -500;
1228 /* Find scale value and start position */
1230 max = max_abs_value_w16(regressor, (int16_t) (subl + searchLen - 1));
1232 rp_end = ®ressor[subl];
1233 } else { /* step== -1 */
1234 max = max_abs_value_w16(®ressor[-searchLen], (int16_t) (subl + searchLen - 1));
1235 rp_beg = ®ressor[-1];
1236 rp_end = ®ressor[subl - 1];
1239 /* Introduce a scale factor on the energy in int32_t in
1240 order to make sure that the calculation does not
1249 /* Calculate the first energy, then do a +/- to get the other energies */
1250 energy = scale_dot_product(regressor, regressor, subl, shifts);
1252 for (k = 0; k < searchLen; k++) {
1254 rp = ®ressor[pos];
1256 cross_corr = scale_dot_product(tp, rp, subl, shifts);
1258 if ((energy > 0) && (cross_corr > 0)) {
1259 /* Put cross correlation and energy on 16 bit word */
1260 cross_corr_scale = norm_w32(cross_corr) - 16;
1261 cross_corr_mod = (int16_t) SPL_SHIFT_W32(cross_corr, cross_corr_scale);
1262 energy_scale = norm_w32(energy) - 16;
1263 energy_mod = (int16_t) SPL_SHIFT_W32(energy, energy_scale);
1265 /* Square cross correlation and store upper int16_t */
1266 cross_corr_sg_mod = (int16_t) SPL_MUL_16_16_RSFT(cross_corr_mod, cross_corr_mod, 16);
1268 /* Calculate the total number of (dynamic) right shifts that have
1269 been performed on (cross_corr*cross_corr)/energy
1271 totscale = energy_scale - (cross_corr_scale << 1);
1273 /* Calculate the shift difference in order to be able to compare the two
1274 (cross_corr*cross_corr)/energy in the same domain
1276 scalediff = totscale - totscale_max;
1277 scalediff = FFMIN(scalediff, 31);
1278 scalediff = FFMAX(scalediff, -31);
1280 /* Compute the cross multiplication between the old best criteria
1281 and the new one to be able to compare them without using a
1284 if (scalediff < 0) {
1285 new_crit = ((int32_t) cross_corr_sg_mod * enery_mod_max) >> (-scalediff);
1286 max_crit = ((int32_t) cross_corr_sg_mod_max * energy_mod);
1288 new_crit = ((int32_t) cross_corr_sg_mod * enery_mod_max);
1289 max_crit = ((int32_t) cross_corr_sg_mod_max * energy_mod) >> scalediff;
1292 /* Store the new lag value if the new criteria is larger
1293 than previous largest criteria */
1295 if (new_crit > max_crit) {
1296 cross_corr_sg_mod_max = cross_corr_sg_mod;
1297 enery_mod_max = energy_mod;
1298 totscale_max = totscale;
1304 /* Do a +/- to get the next energy */
1305 energy += step * ((*rp_end * *rp_end - *rp_beg * *rp_beg) >> shifts);
1310 return maxlag + offset;
1313 static void hp_output(int16_t *signal, const int16_t *ba, int16_t *y,
1314 int16_t *x, int16_t len)
1318 for (int i = 0; i < len; i++) {
1319 tmp = SPL_MUL_16_16(y[1], ba[3]); /* (-a[1])*y[i-1] (low part) */
1320 tmp += SPL_MUL_16_16(y[3], ba[4]); /* (-a[2])*y[i-2] (low part) */
1322 tmp += SPL_MUL_16_16(y[0], ba[3]); /* (-a[1])*y[i-1] (high part) */
1323 tmp += SPL_MUL_16_16(y[2], ba[4]); /* (-a[2])*y[i-2] (high part) */
1326 tmp += SPL_MUL_16_16(signal[i], ba[0]); /* b[0]*x[0] */
1327 tmp += SPL_MUL_16_16(x[0], ba[1]); /* b[1]*x[i-1] */
1328 tmp += SPL_MUL_16_16(x[1], ba[2]); /* b[2]*x[i-2] */
1330 /* Update state (input part) */
1334 /* Convert back to Q0 and multiply with 2 */
1335 signal[i] = av_clip_intp2(tmp + 1024, 26) >> 11;
1337 /* Update state (filtered part) */
1341 /* upshift tmp by 3 with saturation */
1342 if (tmp > 268435455) {
1344 } else if (tmp < -268435456) {
1351 y[1] = (tmp - (y[0] << 16)) >> 1;
1355 static int ilbc_decode_frame(AVCodecContext *avctx, void *data,
1356 int *got_frame_ptr, AVPacket *avpkt)
1358 const uint8_t *buf = avpkt->data;
1359 AVFrame *frame = data;
1360 ILBCContext *s = avctx->priv_data;
1361 int mode = s->mode, ret;
1362 int16_t *plc_data = &s->plc_residual[LPC_FILTERORDER];
1364 if ((ret = init_get_bits8(&s->gb, buf, avpkt->size)) < 0)
1366 memset(&s->frame, 0, sizeof(ILBCFrame));
1368 frame->nb_samples = s->block_samples;
1369 if ((ret = ff_get_buffer(avctx, frame, 0)) < 0)
1372 if (unpack_frame(s))
1374 if (s->frame.start < 1)
1378 index_conv(s->frame.cb_index);
1380 lsf_dequantization(s->lsfdeq, s->frame.lsf, s->lpc_n);
1381 lsf_check_stability(s->lsfdeq, LPC_FILTERORDER, s->lpc_n);
1382 lsp_interpolate(s->syntdenum, s->weightdenum,
1383 s->lsfdeq, LPC_FILTERORDER, s);
1384 decode_residual(s, &s->frame, s->decresidual, s->syntdenum);
1386 do_plc(s->plc_residual, s->plc_lpc, 0,
1387 s->decresidual, s->syntdenum + (LPC_FILTERORDER + 1) * (s->nsub - 1),
1390 memcpy(s->decresidual, s->plc_residual, s->block_samples * 2);
1398 /* Find last lag (since the enhancer is not called to give this info) */
1399 if (s->mode == 20) {
1400 lag = xcorr_coeff(&s->decresidual[s->block_samples-60], &s->decresidual[s->block_samples-80],
1403 lag = xcorr_coeff(&s->decresidual[s->block_samples-ENH_BLOCKL],
1404 &s->decresidual[s->block_samples-ENH_BLOCKL-20],
1405 ENH_BLOCKL, 100, 20, -1);
1408 /* Store lag (it is needed if next packet is lost) */
1411 /* copy data and run synthesis filter */
1412 memcpy(plc_data, s->decresidual, s->block_samples * 2);
1414 /* Set up the filter state */
1415 memcpy(&plc_data[-LPC_FILTERORDER], s->syntMem, LPC_FILTERORDER * 2);
1417 for (i = 0; i < s->nsub; i++) {
1418 filter_arfq12(plc_data+i*SUBL, plc_data+i*SUBL,
1419 s->syntdenum + i*(LPC_FILTERORDER + 1),
1420 LPC_FILTERORDER + 1, SUBL);
1423 /* Save the filter state */
1424 memcpy(s->syntMem, &plc_data[s->block_samples-LPC_FILTERORDER], LPC_FILTERORDER * 2);
1427 memcpy(frame->data[0], plc_data, s->block_samples * 2);
1429 hp_output((int16_t *)frame->data[0], hp_out_coeffs,
1430 s->hpimemy, s->hpimemx, s->block_samples);
1432 memcpy(s->old_syntdenum, s->syntdenum, s->nsub*(LPC_FILTERORDER + 1) * 2);
1443 static av_cold int ilbc_decode_init(AVCodecContext *avctx)
1445 ILBCContext *s = avctx->priv_data;
1447 if (avctx->block_align == 38)
1449 else if (avctx->block_align == 50)
1451 else if (avctx->bit_rate > 0)
1452 s->mode = avctx->bit_rate <= 14000 ? 30 : 20;
1454 return AVERROR_INVALIDDATA;
1456 avctx->channels = 1;
1457 avctx->channel_layout = AV_CH_LAYOUT_MONO;
1458 avctx->sample_rate = 8000;
1459 avctx->sample_fmt = AV_SAMPLE_FMT_S16;
1461 if (s->mode == 30) {
1462 s->block_samples = 240;
1463 s->nsub = NSUB_30MS;
1464 s->nasub = NASUB_30MS;
1465 s->lpc_n = LPC_N_30MS;
1466 s->state_short_len = STATE_SHORT_LEN_30MS;
1468 s->block_samples = 160;
1469 s->nsub = NSUB_20MS;
1470 s->nasub = NASUB_20MS;
1471 s->lpc_n = LPC_N_20MS;
1472 s->state_short_len = STATE_SHORT_LEN_20MS;
1478 AVCodec ff_ilbc_decoder = {
1480 .long_name = NULL_IF_CONFIG_SMALL("iLBC (Internet Low Bitrate Codec)"),
1481 .type = AVMEDIA_TYPE_AUDIO,
1482 .id = AV_CODEC_ID_ILBC,
1483 .init = ilbc_decode_init,
1484 .decode = ilbc_decode_frame,
1485 .capabilities = AV_CODEC_CAP_DR1,
1486 .priv_data_size = sizeof(ILBCContext),