You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

1490 lines
50KB

  1. /*
  2. * Copyright (c) 2013, The WebRTC project authors. All rights reserved.
  3. *
  4. * Redistribution and use in source and binary forms, with or without
  5. * modification, are permitted provided that the following conditions are
  6. * met:
  7. *
  8. * * Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. *
  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
  14. * distribution.
  15. *
  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.
  19. *
  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.
  31. */
  32. #include "avcodec.h"
  33. #include "internal.h"
  34. #include "get_bits.h"
  35. #include "ilbcdata.h"
  36. #define LPC_N_20MS 1
  37. #define LPC_N_30MS 2
  38. #define LPC_N_MAX 2
  39. #define LSF_NSPLIT 3
  40. #define NASUB_MAX 4
  41. #define LPC_FILTERORDER 10
  42. #define NSUB_MAX 6
  43. #define SUBL 40
  44. #define ST_MEM_L_TBL 85
  45. #define MEM_LF_TBL 147
  46. #define STATE_SHORT_LEN_20MS 57
  47. #define STATE_SHORT_LEN_30MS 58
  48. #define BLOCKL_MAX 240
  49. #define CB_MEML 147
  50. #define CB_NSTAGES 3
  51. #define CB_HALFFILTERLEN 4
  52. #define CB_FILTERLEN 8
  53. #define ENH_NBLOCKS_TOT 8
  54. #define ENH_BLOCKL 80
  55. #define ENH_BUFL (ENH_NBLOCKS_TOT)*ENH_BLOCKL
  56. #define ENH_BUFL_FILTEROVERHEAD 3
  57. #define BLOCKL_MAX 240
  58. #define NSUB_20MS 4
  59. #define NSUB_30MS 6
  60. #define NSUB_MAX 6
  61. #define NASUB_20MS 2
  62. #define NASUB_30MS 4
  63. #define NASUB_MAX 4
  64. #define STATE_LEN 80
  65. #define STATE_SHORT_LEN_30MS 58
  66. #define STATE_SHORT_LEN_20MS 57
  67. #define SPL_MUL_16_16(a, b) ((int32_t) (((int16_t)(a)) * ((int16_t)(b))))
  68. #define SPL_MUL_16_16_RSFT(a, b, c) (SPL_MUL_16_16(a, b) >> (c))
  69. typedef struct ILBCFrame {
  70. int16_t lsf[LSF_NSPLIT*LPC_N_MAX];
  71. int16_t cb_index[CB_NSTAGES*(NASUB_MAX + 1)];
  72. int16_t gain_index[CB_NSTAGES*(NASUB_MAX + 1)];
  73. int16_t ifm;
  74. int16_t state_first;
  75. int16_t idx[STATE_SHORT_LEN_30MS];
  76. int16_t firstbits;
  77. int16_t start;
  78. } ILBCFrame;
  79. typedef struct ILBCContext {
  80. AVClass *class;
  81. int enhancer;
  82. int mode;
  83. GetBitContext gb;
  84. ILBCFrame frame;
  85. int prev_enh_pl;
  86. int consPLICount;
  87. int last_lag;
  88. int state_short_len;
  89. int lpc_n;
  90. int16_t nasub;
  91. int16_t nsub;
  92. int block_samples;
  93. int16_t no_of_words;
  94. int16_t no_of_bytes;
  95. int16_t lsfdeq[LPC_FILTERORDER*LPC_N_MAX];
  96. int16_t lsfold[LPC_FILTERORDER];
  97. int16_t syntMem[LPC_FILTERORDER];
  98. int16_t lsfdeqold[LPC_FILTERORDER];
  99. int16_t weightdenum[(LPC_FILTERORDER + 1) * NSUB_MAX];
  100. int16_t syntdenum[NSUB_MAX * (LPC_FILTERORDER + 1)];
  101. int16_t old_syntdenum[NSUB_MAX * (LPC_FILTERORDER + 1)];
  102. int16_t enh_buf[ENH_BUFL+ENH_BUFL_FILTEROVERHEAD];
  103. int16_t enh_period[ENH_NBLOCKS_TOT];
  104. int16_t prevResidual[NSUB_MAX*SUBL];
  105. int16_t decresidual[BLOCKL_MAX];
  106. int16_t plc_residual[BLOCKL_MAX + LPC_FILTERORDER];
  107. int16_t seed;
  108. int16_t prevPLI;
  109. int16_t prevScale;
  110. int16_t prevLag;
  111. int16_t per_square;
  112. int16_t prev_lpc[LPC_FILTERORDER + 1];
  113. int16_t plc_lpc[LPC_FILTERORDER + 1];
  114. int16_t hpimemx[2];
  115. int16_t hpimemy[4];
  116. } ILBCContext;
  117. static int unpack_frame(ILBCContext *s)
  118. {
  119. ILBCFrame *frame = &s->frame;
  120. GetBitContext *gb = &s->gb;
  121. int j;
  122. frame->lsf[0] = get_bits(gb, 6);
  123. frame->lsf[1] = get_bits(gb, 7);
  124. frame->lsf[2] = get_bits(gb, 7);
  125. if (s->mode == 20) {
  126. frame->start = get_bits(gb, 2);
  127. frame->state_first = get_bits1(gb);
  128. frame->ifm = get_bits(gb, 6);
  129. frame->cb_index[0] = get_bits(gb, 6) << 1;
  130. frame->gain_index[0] = get_bits(gb, 2) << 3;
  131. frame->gain_index[1] = get_bits1(gb) << 3;
  132. frame->cb_index[3] = get_bits(gb, 7) << 1;
  133. frame->gain_index[3] = get_bits1(gb) << 4;
  134. frame->gain_index[4] = get_bits1(gb) << 3;
  135. frame->gain_index[6] = get_bits1(gb) << 4;
  136. } else {
  137. frame->lsf[3] = get_bits(gb, 6);
  138. frame->lsf[4] = get_bits(gb, 7);
  139. frame->lsf[5] = get_bits(gb, 7);
  140. frame->start = get_bits(gb, 3);
  141. frame->state_first = get_bits1(gb);
  142. frame->ifm = get_bits(gb, 6);
  143. frame->cb_index[0] = get_bits(gb, 4) << 3;
  144. frame->gain_index[0] = get_bits1(gb) << 4;
  145. frame->gain_index[1] = get_bits1(gb) << 3;
  146. frame->cb_index[3] = get_bits(gb, 6) << 2;
  147. frame->gain_index[3] = get_bits1(gb) << 4;
  148. frame->gain_index[4] = get_bits1(gb) << 3;
  149. }
  150. for (j = 0; j < 48; j++)
  151. frame->idx[j] = get_bits1(gb) << 2;
  152. if (s->mode == 20) {
  153. for (; j < 57; j++)
  154. frame->idx[j] = get_bits1(gb) << 2;
  155. frame->gain_index[1] |= get_bits1(gb) << 2;
  156. frame->gain_index[3] |= get_bits(gb, 2) << 2;
  157. frame->gain_index[4] |= get_bits1(gb) << 2;
  158. frame->gain_index[6] |= get_bits1(gb) << 3;
  159. frame->gain_index[7] = get_bits(gb, 2) << 2;
  160. } else {
  161. for (; j < 58; j++)
  162. frame->idx[j] = get_bits1(gb) << 2;
  163. frame->cb_index[0] |= get_bits(gb, 2) << 1;
  164. frame->gain_index[0] |= get_bits1(gb) << 3;
  165. frame->gain_index[1] |= get_bits1(gb) << 2;
  166. frame->cb_index[3] |= get_bits1(gb) << 1;
  167. frame->cb_index[6] = get_bits1(gb) << 7;
  168. frame->cb_index[6] |= get_bits(gb, 6) << 1;
  169. frame->cb_index[9] = get_bits(gb, 7) << 1;
  170. frame->cb_index[12] = get_bits(gb, 3) << 5;
  171. frame->cb_index[12] |= get_bits(gb, 4) << 1;
  172. frame->gain_index[3] |= get_bits(gb, 2) << 2;
  173. frame->gain_index[4] |= get_bits(gb, 2) << 1;
  174. frame->gain_index[6] = get_bits(gb, 2) << 3;
  175. frame->gain_index[7] = get_bits(gb, 2) << 2;
  176. frame->gain_index[9] = get_bits1(gb) << 4;
  177. frame->gain_index[10] = get_bits1(gb) << 3;
  178. frame->gain_index[12] = get_bits1(gb) << 4;
  179. frame->gain_index[13] = get_bits1(gb) << 3;
  180. }
  181. for (j = 0; j < 56; j++)
  182. frame->idx[j] |= get_bits(gb, 2);
  183. if (s->mode == 20) {
  184. frame->idx[56] |= get_bits(gb, 2);
  185. frame->cb_index[0] |= get_bits1(gb);
  186. frame->cb_index[1] = get_bits(gb, 7);
  187. frame->cb_index[2] = get_bits(gb, 6) << 1;
  188. frame->cb_index[2] |= get_bits1(gb);
  189. frame->gain_index[0] |= get_bits(gb, 3);
  190. frame->gain_index[1] |= get_bits(gb, 2);
  191. frame->gain_index[2] = get_bits(gb, 3);
  192. frame->cb_index[3] |= get_bits1(gb);
  193. frame->cb_index[4] = get_bits(gb, 6) << 1;
  194. frame->cb_index[4] |= get_bits1(gb);
  195. frame->cb_index[5] = get_bits(gb, 7);
  196. frame->cb_index[6] = get_bits(gb, 8);
  197. frame->cb_index[7] = get_bits(gb, 8);
  198. frame->cb_index[8] = get_bits(gb, 8);
  199. frame->gain_index[3] |= get_bits(gb, 2);
  200. frame->gain_index[4] |= get_bits(gb, 2);
  201. frame->gain_index[5] = get_bits(gb, 3);
  202. frame->gain_index[6] |= get_bits(gb, 3);
  203. frame->gain_index[7] |= get_bits(gb, 2);
  204. frame->gain_index[8] = get_bits(gb, 3);
  205. } else {
  206. frame->idx[56] |= get_bits(gb, 2);
  207. frame->idx[57] |= get_bits(gb, 2);
  208. frame->cb_index[0] |= get_bits1(gb);
  209. frame->cb_index[1] = get_bits(gb, 7);
  210. frame->cb_index[2] = get_bits(gb, 4) << 3;
  211. frame->cb_index[2] |= get_bits(gb, 3);
  212. frame->gain_index[0] |= get_bits(gb, 3);
  213. frame->gain_index[1] |= get_bits(gb, 2);
  214. frame->gain_index[2] = get_bits(gb, 3);
  215. frame->cb_index[3] |= get_bits1(gb);
  216. frame->cb_index[4] = get_bits(gb, 4) << 3;
  217. frame->cb_index[4] |= get_bits(gb, 3);
  218. frame->cb_index[5] = get_bits(gb, 7);
  219. frame->cb_index[6] |= get_bits1(gb);
  220. frame->cb_index[7] = get_bits(gb, 5) << 3;
  221. frame->cb_index[7] |= get_bits(gb, 3);
  222. frame->cb_index[8] = get_bits(gb, 8);
  223. frame->cb_index[9] |= get_bits1(gb);
  224. frame->cb_index[10] = get_bits(gb, 4) << 4;
  225. frame->cb_index[10] |= get_bits(gb, 4);
  226. frame->cb_index[11] = get_bits(gb, 8);
  227. frame->cb_index[12] |= get_bits1(gb);
  228. frame->cb_index[13] = get_bits(gb, 3) << 5;
  229. frame->cb_index[13] |= get_bits(gb, 5);
  230. frame->cb_index[14] = get_bits(gb, 8);
  231. frame->gain_index[3] |= get_bits(gb, 2);
  232. frame->gain_index[4] |= get_bits1(gb);
  233. frame->gain_index[5] = get_bits(gb, 3);
  234. frame->gain_index[6] |= get_bits(gb, 3);
  235. frame->gain_index[7] |= get_bits(gb, 2);
  236. frame->gain_index[8] = get_bits(gb, 3);
  237. frame->gain_index[9] |= get_bits(gb, 4);
  238. frame->gain_index[10] |= get_bits1(gb) << 2;
  239. frame->gain_index[10] |= get_bits(gb, 2);
  240. frame->gain_index[11] = get_bits(gb, 3);
  241. frame->gain_index[12] |= get_bits(gb, 4);
  242. frame->gain_index[13] |= get_bits(gb, 3);
  243. frame->gain_index[14] = get_bits(gb, 3);
  244. }
  245. return get_bits1(gb);
  246. }
  247. static void index_conv(int16_t *index)
  248. {
  249. int k;
  250. for (k = 4; k < 6; k++) {
  251. if (index[k] >= 44 && index[k] < 108) {
  252. index[k] += 64;
  253. } else if (index[k] >= 108 && index[k] < 128) {
  254. index[k] += 128;
  255. }
  256. }
  257. }
  258. static void lsf_dequantization(int16_t *lsfdeq, int16_t *index, int16_t lpc_n)
  259. {
  260. int i, j, pos = 0, cb_pos = 0;
  261. for (i = 0; i < LSF_NSPLIT; i++) {
  262. for (j = 0; j < lsf_dim_codebook[i]; j++) {
  263. lsfdeq[pos + j] = lsf_codebook[cb_pos + index[i] * lsf_dim_codebook[i] + j];
  264. }
  265. pos += lsf_dim_codebook[i];
  266. cb_pos += lsf_size_codebook[i] * lsf_dim_codebook[i];
  267. }
  268. if (lpc_n > 1) {
  269. pos = 0;
  270. cb_pos = 0;
  271. for (i = 0; i < LSF_NSPLIT; i++) {
  272. for (j = 0; j < lsf_dim_codebook[i]; j++) {
  273. lsfdeq[LPC_FILTERORDER + pos + j] = lsf_codebook[cb_pos +
  274. index[LSF_NSPLIT + i] * lsf_dim_codebook[i] + j];
  275. }
  276. pos += lsf_dim_codebook[i];
  277. cb_pos += lsf_size_codebook[i] * lsf_dim_codebook[i];
  278. }
  279. }
  280. }
  281. static void lsf_check_stability(int16_t *lsf, int dim, int nb_vectors)
  282. {
  283. for (int n = 0; n < 2; n++) {
  284. for (int m = 0; m < nb_vectors; m++) {
  285. for (int k = 0; k < dim - 1; k++) {
  286. int i = m * dim + k;
  287. if ((lsf[i + 1] - lsf[i]) < 319) {
  288. if (lsf[i + 1] < lsf[i]) {
  289. lsf[i + 1] = lsf[i] + 160;
  290. lsf[i] = lsf[i + 1] - 160;
  291. } else {
  292. lsf[i] -= 160;
  293. lsf[i + 1] += 160;
  294. }
  295. }
  296. lsf[i] = av_clip(lsf[i], 82, 25723);
  297. }
  298. }
  299. }
  300. }
  301. static void lsf_interpolate(int16_t *out, int16_t *in1,
  302. int16_t *in2, int16_t coef,
  303. int size)
  304. {
  305. int invcoef = 16384 - coef, i;
  306. for (i = 0; i < size; i++)
  307. out[i] = (coef * in1[i] + invcoef * in2[i] + 8192) >> 14;
  308. }
  309. static void lsf2lsp(int16_t *lsf, int16_t *lsp, int order)
  310. {
  311. int16_t diff, freq;
  312. int32_t tmp;
  313. int i, k;
  314. for (i = 0; i < order; i++) {
  315. freq = (lsf[i] * 20861) >> 15;
  316. /* 20861: 1.0/(2.0*PI) in Q17 */
  317. /*
  318. Upper 8 bits give the index k and
  319. Lower 8 bits give the difference, which needs
  320. to be approximated linearly
  321. */
  322. k = FFMIN(freq >> 8, 63);
  323. diff = freq & 0xFF;
  324. /* Calculate linear approximation */
  325. tmp = cos_derivative_tbl[k] * diff;
  326. lsp[i] = cos_tbl[k] + (tmp >> 12);
  327. }
  328. }
  329. static void get_lsp_poly(int16_t *lsp, int32_t *f)
  330. {
  331. int16_t high, low;
  332. int i, j, k, l;
  333. int32_t tmp;
  334. f[0] = 16777216;
  335. f[1] = lsp[0] * -1024;
  336. for (i = 2, k = 2, l = 2; i <= 5; i++, k += 2) {
  337. f[l] = f[l - 2];
  338. for (j = i; j > 1; j--, l--) {
  339. high = f[l - 1] >> 16;
  340. low = (f[l - 1] - (high * (1 << 16))) >> 1;
  341. tmp = ((high * lsp[k]) * 4) + (((low * lsp[k]) >> 15) * 4);
  342. f[l] += f[l - 2];
  343. f[l] -= (unsigned)tmp;
  344. }
  345. f[l] -= lsp[k] * (1 << 10);
  346. l += i;
  347. }
  348. }
  349. static void lsf2poly(int16_t *a, int16_t *lsf)
  350. {
  351. int32_t f[2][6];
  352. int16_t lsp[10];
  353. int32_t tmp;
  354. int i;
  355. lsf2lsp(lsf, lsp, LPC_FILTERORDER);
  356. get_lsp_poly(&lsp[0], f[0]);
  357. get_lsp_poly(&lsp[1], f[1]);
  358. for (i = 5; i > 0; i--) {
  359. f[0][i] += (unsigned)f[0][i - 1];
  360. f[1][i] -= (unsigned)f[1][i - 1];
  361. }
  362. a[0] = 4096;
  363. for (i = 5; i > 0; i--) {
  364. tmp = f[0][6 - i] + (unsigned)f[1][6 - i];
  365. a[6 - i] = (tmp + 4096) >> 13;
  366. tmp = f[0][6 - i] - (unsigned)f[1][6 - i];
  367. a[5 + i] = (tmp + 4096) >> 13;
  368. }
  369. }
  370. static void lsp_interpolate2polydec(int16_t *a, int16_t *lsf1,
  371. int16_t *lsf2, int coef, int length)
  372. {
  373. int16_t lsftmp[LPC_FILTERORDER];
  374. lsf_interpolate(lsftmp, lsf1, lsf2, coef, length);
  375. lsf2poly(a, lsftmp);
  376. }
  377. static void bw_expand(int16_t *out, const int16_t *in, const int16_t *coef, int length)
  378. {
  379. int i;
  380. out[0] = in[0];
  381. for (i = 1; i < length; i++)
  382. out[i] = (coef[i] * in[i] + 16384) >> 15;
  383. }
  384. static void lsp_interpolate(int16_t *syntdenum, int16_t *weightdenum,
  385. int16_t *lsfdeq, int16_t length,
  386. ILBCContext *s)
  387. {
  388. int16_t lp[LPC_FILTERORDER + 1], *lsfdeq2;
  389. int i, pos, lp_length;
  390. lsfdeq2 = lsfdeq + length;
  391. lp_length = length + 1;
  392. if (s->mode == 30) {
  393. lsp_interpolate2polydec(lp, (*s).lsfdeqold, lsfdeq, lsf_weight_30ms[0], length);
  394. memcpy(syntdenum, lp, lp_length * 2);
  395. bw_expand(weightdenum, lp, kLpcChirpSyntDenum, lp_length);
  396. pos = lp_length;
  397. for (i = 1; i < 6; i++) {
  398. lsp_interpolate2polydec(lp, lsfdeq, lsfdeq2,
  399. lsf_weight_30ms[i],
  400. length);
  401. memcpy(syntdenum + pos, lp, lp_length * 2);
  402. bw_expand(weightdenum + pos, lp, kLpcChirpSyntDenum, lp_length);
  403. pos += lp_length;
  404. }
  405. } else {
  406. pos = 0;
  407. for (i = 0; i < s->nsub; i++) {
  408. lsp_interpolate2polydec(lp, s->lsfdeqold, lsfdeq,
  409. lsf_weight_20ms[i], length);
  410. memcpy(syntdenum + pos, lp, lp_length * 2);
  411. bw_expand(weightdenum + pos, lp, kLpcChirpSyntDenum, lp_length);
  412. pos += lp_length;
  413. }
  414. }
  415. if (s->mode == 30) {
  416. memcpy(s->lsfdeqold, lsfdeq2, length * 2);
  417. } else {
  418. memcpy(s->lsfdeqold, lsfdeq, length * 2);
  419. }
  420. }
  421. static void filter_mafq12(int16_t *in_ptr, int16_t *out_ptr,
  422. int16_t *B, int16_t B_length,
  423. int16_t length)
  424. {
  425. int o, i, j;
  426. for (i = 0; i < length; i++) {
  427. const int16_t *b_ptr = &B[0];
  428. const int16_t *x_ptr = &in_ptr[i];
  429. o = 0;
  430. for (j = 0; j < B_length; j++)
  431. o += b_ptr[j] * *x_ptr--;
  432. o = av_clip(o, -134217728, 134215679);
  433. out_ptr[i] = ((o + 2048) >> 12);
  434. }
  435. }
  436. static void filter_arfq12(const int16_t *data_in,
  437. int16_t *data_out,
  438. const int16_t *coefficients,
  439. int coefficients_length,
  440. int data_length)
  441. {
  442. int i, j;
  443. for (i = 0; i < data_length; i++) {
  444. int output = 0, sum = 0;
  445. for (j = coefficients_length - 1; j > 0; j--) {
  446. sum += (unsigned)(coefficients[j] * data_out[i - j]);
  447. }
  448. output = coefficients[0] * data_in[i] - (unsigned)sum;
  449. output = av_clip(output, -134217728, 134215679);
  450. data_out[i] = (output + 2048) >> 12;
  451. }
  452. }
  453. static void state_construct(int16_t ifm, int16_t *idx,
  454. int16_t *synt_denum, int16_t *Out_fix,
  455. int16_t len)
  456. {
  457. int k;
  458. int16_t maxVal;
  459. int16_t *tmp1, *tmp2, *tmp3;
  460. /* Stack based */
  461. int16_t numerator[1 + LPC_FILTERORDER];
  462. int16_t sampleValVec[2 * STATE_SHORT_LEN_30MS + LPC_FILTERORDER];
  463. int16_t sampleMaVec[2 * STATE_SHORT_LEN_30MS + LPC_FILTERORDER];
  464. int16_t *sampleVal = &sampleValVec[LPC_FILTERORDER];
  465. int16_t *sampleMa = &sampleMaVec[LPC_FILTERORDER];
  466. int16_t *sampleAr = &sampleValVec[LPC_FILTERORDER];
  467. /* initialization of coefficients */
  468. for (k = 0; k < LPC_FILTERORDER + 1; k++) {
  469. numerator[k] = synt_denum[LPC_FILTERORDER - k];
  470. }
  471. /* decoding of the maximum value */
  472. maxVal = frg_quant_mod[ifm];
  473. /* decoding of the sample values */
  474. tmp1 = sampleVal;
  475. tmp2 = &idx[len - 1];
  476. if (ifm < 37) {
  477. for (k = 0; k < len; k++) {
  478. /*the shifting is due to the Q13 in sq4_fixQ13[i], also the adding of 2097152 (= 0.5 << 22)
  479. maxVal is in Q8 and result is in Q(-1) */
  480. (*tmp1) = (int16_t) ((SPL_MUL_16_16(maxVal, ilbc_state[(*tmp2)]) + 2097152) >> 22);
  481. tmp1++;
  482. tmp2--;
  483. }
  484. } else if (ifm < 59) {
  485. for (k = 0; k < len; k++) {
  486. /*the shifting is due to the Q13 in sq4_fixQ13[i], also the adding of 262144 (= 0.5 << 19)
  487. maxVal is in Q5 and result is in Q(-1) */
  488. (*tmp1) = (int16_t) ((SPL_MUL_16_16(maxVal, ilbc_state[(*tmp2)]) + 262144) >> 19);
  489. tmp1++;
  490. tmp2--;
  491. }
  492. } else {
  493. for (k = 0; k < len; k++) {
  494. /*the shifting is due to the Q13 in sq4_fixQ13[i], also the adding of 65536 (= 0.5 << 17)
  495. maxVal is in Q3 and result is in Q(-1) */
  496. (*tmp1) = (int16_t) ((SPL_MUL_16_16(maxVal, ilbc_state[(*tmp2)]) + 65536) >> 17);
  497. tmp1++;
  498. tmp2--;
  499. }
  500. }
  501. /* Set the rest of the data to zero */
  502. memset(&sampleVal[len], 0, len * 2);
  503. /* circular convolution with all-pass filter */
  504. /* Set the state to zero */
  505. memset(sampleValVec, 0, LPC_FILTERORDER * 2);
  506. /* Run MA filter + AR filter */
  507. filter_mafq12(sampleVal, sampleMa, numerator, LPC_FILTERORDER + 1, len + LPC_FILTERORDER);
  508. memset(&sampleMa[len + LPC_FILTERORDER], 0, (len - LPC_FILTERORDER) * 2);
  509. filter_arfq12(sampleMa, sampleAr, synt_denum, LPC_FILTERORDER + 1, 2 * len);
  510. tmp1 = &sampleAr[len - 1];
  511. tmp2 = &sampleAr[2 * len - 1];
  512. tmp3 = Out_fix;
  513. for (k = 0; k < len; k++) {
  514. (*tmp3) = (*tmp1) + (*tmp2);
  515. tmp1--;
  516. tmp2--;
  517. tmp3++;
  518. }
  519. }
  520. static int16_t gain_dequantization(int index, int max_in, int stage)
  521. {
  522. int16_t scale = FFMAX(1638, FFABS(max_in));
  523. return ((scale * ilbc_gain[stage][index]) + 8192) >> 14;
  524. }
  525. static void vector_rmultiplication(int16_t *out, const int16_t *in,
  526. const int16_t *win,
  527. int length, int shift)
  528. {
  529. for (int i = 0; i < length; i++)
  530. out[i] = (in[i] * win[-i]) >> shift;
  531. }
  532. static void vector_multiplication(int16_t *out, const int16_t *in,
  533. const int16_t *win, int length,
  534. int shift)
  535. {
  536. for (int i = 0; i < length; i++)
  537. out[i] = (in[i] * win[i]) >> shift;
  538. }
  539. static void add_vector_and_shift(int16_t *out, const int16_t *in1,
  540. const int16_t *in2, int length,
  541. int shift)
  542. {
  543. for (int i = 0; i < length; i++)
  544. out[i] = (in1[i] + in2[i]) >> shift;
  545. }
  546. static void create_augmented_vector(int index, int16_t *buffer, int16_t *cbVec)
  547. {
  548. int16_t cbVecTmp[4];
  549. int interpolation_length = FFMIN(4, index);
  550. int16_t ilow = index - interpolation_length;
  551. memcpy(cbVec, buffer - index, index * 2);
  552. vector_multiplication(&cbVec[ilow], buffer - index - interpolation_length, alpha, interpolation_length, 15);
  553. vector_rmultiplication(cbVecTmp, buffer - interpolation_length, &alpha[interpolation_length - 1], interpolation_length, 15);
  554. add_vector_and_shift(&cbVec[ilow], &cbVec[ilow], cbVecTmp, interpolation_length, 0);
  555. memcpy(cbVec + index, buffer - index, FFMIN(SUBL - index, index) * sizeof(*cbVec));
  556. }
  557. static void get_codebook(int16_t * cbvec, /* (o) Constructed codebook vector */
  558. int16_t * mem, /* (i) Codebook buffer */
  559. int16_t index, /* (i) Codebook index */
  560. int16_t lMem, /* (i) Length of codebook buffer */
  561. int16_t cbveclen /* (i) Codebook vector length */
  562. )
  563. {
  564. int16_t k, base_size;
  565. int16_t lag;
  566. /* Stack based */
  567. int16_t tempbuff2[SUBL + 5];
  568. /* Determine size of codebook sections */
  569. base_size = lMem - cbveclen + 1;
  570. if (cbveclen == SUBL) {
  571. base_size += cbveclen / 2;
  572. }
  573. /* No filter -> First codebook section */
  574. if (index < lMem - cbveclen + 1) {
  575. /* first non-interpolated vectors */
  576. k = index + cbveclen;
  577. /* get vector */
  578. memcpy(cbvec, mem + lMem - k, cbveclen * 2);
  579. } else if (index < base_size) {
  580. /* Calculate lag */
  581. k = (int16_t) SPL_MUL_16_16(2, (index - (lMem - cbveclen + 1))) + cbveclen;
  582. lag = k / 2;
  583. create_augmented_vector(lag, mem + lMem, cbvec);
  584. } else {
  585. int16_t memIndTest;
  586. /* first non-interpolated vectors */
  587. if (index - base_size < lMem - cbveclen + 1) {
  588. /* Set up filter memory, stuff zeros outside memory buffer */
  589. memIndTest = lMem - (index - base_size + cbveclen);
  590. memset(mem - CB_HALFFILTERLEN, 0, CB_HALFFILTERLEN * 2);
  591. memset(mem + lMem, 0, CB_HALFFILTERLEN * 2);
  592. /* do filtering to get the codebook vector */
  593. filter_mafq12(&mem[memIndTest + 4], cbvec, (int16_t *) kCbFiltersRev, CB_FILTERLEN, cbveclen);
  594. } else {
  595. /* interpolated vectors */
  596. /* Stuff zeros outside memory buffer */
  597. memIndTest = lMem - cbveclen - CB_FILTERLEN;
  598. memset(mem + lMem, 0, CB_HALFFILTERLEN * 2);
  599. /* do filtering */
  600. filter_mafq12(&mem[memIndTest + 7], tempbuff2, (int16_t *) kCbFiltersRev, CB_FILTERLEN, (int16_t) (cbveclen + 5));
  601. /* Calculate lag index */
  602. lag = (cbveclen << 1) - 20 + index - base_size - lMem - 1;
  603. create_augmented_vector(lag, tempbuff2 + SUBL + 5, cbvec);
  604. }
  605. }
  606. }
  607. static void construct_vector (
  608. int16_t *decvector, /* (o) Decoded vector */
  609. int16_t *index, /* (i) Codebook indices */
  610. int16_t *gain_index, /* (i) Gain quantization indices */
  611. int16_t *mem, /* (i) Buffer for codevector construction */
  612. int16_t lMem, /* (i) Length of buffer */
  613. int16_t veclen)
  614. {
  615. int16_t gain[CB_NSTAGES];
  616. int16_t cbvec0[SUBL];
  617. int16_t cbvec1[SUBL];
  618. int16_t cbvec2[SUBL];
  619. int32_t a32;
  620. int16_t *gainPtr;
  621. int j;
  622. /* gain de-quantization */
  623. gain[0] = gain_dequantization(gain_index[0], 16384, 0);
  624. gain[1] = gain_dequantization(gain_index[1], gain[0], 1);
  625. gain[2] = gain_dequantization(gain_index[2], gain[1], 2);
  626. /* codebook vector construction and construction of total vector */
  627. /* Stack based */
  628. get_codebook(cbvec0, mem, index[0], lMem, veclen);
  629. get_codebook(cbvec1, mem, index[1], lMem, veclen);
  630. get_codebook(cbvec2, mem, index[2], lMem, veclen);
  631. gainPtr = &gain[0];
  632. for (j = 0; j < veclen; j++) {
  633. a32 = SPL_MUL_16_16(*gainPtr++, cbvec0[j]);
  634. a32 += SPL_MUL_16_16(*gainPtr++, cbvec1[j]);
  635. a32 += (unsigned)SPL_MUL_16_16(*gainPtr, cbvec2[j]);
  636. gainPtr -= 2;
  637. decvector[j] = (a32 + 8192) >> 14;
  638. }
  639. }
  640. static void reverse_memcpy(int16_t *dest, int16_t *source, int length)
  641. {
  642. int16_t* destPtr = dest;
  643. int16_t* sourcePtr = source;
  644. int j;
  645. for (j = 0; j < length; j++)
  646. *destPtr-- = *sourcePtr++;
  647. }
  648. static void decode_residual(ILBCContext *s,
  649. ILBCFrame *encbits,
  650. int16_t *decresidual,
  651. int16_t *syntdenum)
  652. {
  653. int16_t meml_gotten, Nfor, Nback, diff, start_pos;
  654. int16_t subcount, subframe;
  655. int16_t *reverseDecresidual = s->enh_buf; /* Reversed decoded data, used for decoding backwards in time (reuse memory in state) */
  656. int16_t *memVec = s->prevResidual;
  657. int16_t *mem = &memVec[CB_HALFFILTERLEN]; /* Memory for codebook */
  658. diff = STATE_LEN - s->state_short_len;
  659. if (encbits->state_first == 1) {
  660. start_pos = (encbits->start - 1) * SUBL;
  661. } else {
  662. start_pos = (encbits->start - 1) * SUBL + diff;
  663. }
  664. /* decode scalar part of start state */
  665. state_construct(encbits->ifm, encbits->idx, &syntdenum[(encbits->start - 1) * (LPC_FILTERORDER + 1)], &decresidual[start_pos], s->state_short_len);
  666. if (encbits->state_first) { /* put adaptive part in the end */
  667. /* setup memory */
  668. memset(mem, 0, (int16_t) (CB_MEML - s->state_short_len) * 2);
  669. memcpy(mem + CB_MEML - s->state_short_len, decresidual + start_pos, s->state_short_len * 2);
  670. /* construct decoded vector */
  671. 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);
  672. } else { /* put adaptive part in the beginning */
  673. /* setup memory */
  674. meml_gotten = s->state_short_len;
  675. reverse_memcpy(mem + CB_MEML - 1, decresidual + start_pos, meml_gotten);
  676. memset(mem, 0, (int16_t) (CB_MEML - meml_gotten) * 2);
  677. /* construct decoded vector */
  678. construct_vector(reverseDecresidual, encbits->cb_index, encbits->gain_index, mem + CB_MEML - ST_MEM_L_TBL, ST_MEM_L_TBL, diff);
  679. /* get decoded residual from reversed vector */
  680. reverse_memcpy(&decresidual[start_pos - 1], reverseDecresidual, diff);
  681. }
  682. /* counter for predicted subframes */
  683. subcount = 1;
  684. /* forward prediction of subframes */
  685. Nfor = s->nsub - encbits->start - 1;
  686. if (Nfor > 0) {
  687. /* setup memory */
  688. memset(mem, 0, (CB_MEML - STATE_LEN) * 2);
  689. memcpy(mem + CB_MEML - STATE_LEN, decresidual + (encbits->start - 1) * SUBL, STATE_LEN * 2);
  690. /* loop over subframes to encode */
  691. for (subframe = 0; subframe < Nfor; subframe++) {
  692. /* construct decoded vector */
  693. 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);
  694. /* update memory */
  695. memmove(mem, mem + SUBL, (CB_MEML - SUBL) * sizeof(*mem));
  696. memcpy(mem + CB_MEML - SUBL, &decresidual[(encbits->start + 1 + subframe) * SUBL], SUBL * 2);
  697. subcount++;
  698. }
  699. }
  700. /* backward prediction of subframes */
  701. Nback = encbits->start - 1;
  702. if (Nback > 0) {
  703. /* setup memory */
  704. meml_gotten = SUBL * (s->nsub + 1 - encbits->start);
  705. if (meml_gotten > CB_MEML) {
  706. meml_gotten = CB_MEML;
  707. }
  708. reverse_memcpy(mem + CB_MEML - 1, decresidual + (encbits->start - 1) * SUBL, meml_gotten);
  709. memset(mem, 0, (int16_t) (CB_MEML - meml_gotten) * 2);
  710. /* loop over subframes to decode */
  711. for (subframe = 0; subframe < Nback; subframe++) {
  712. /* construct decoded vector */
  713. construct_vector(&reverseDecresidual[subframe * SUBL], encbits->cb_index + subcount * CB_NSTAGES,
  714. encbits->gain_index + subcount * CB_NSTAGES, mem, MEM_LF_TBL, SUBL);
  715. /* update memory */
  716. memmove(mem, mem + SUBL, (CB_MEML - SUBL) * sizeof(*mem));
  717. memcpy(mem + CB_MEML - SUBL, &reverseDecresidual[subframe * SUBL], SUBL * 2);
  718. subcount++;
  719. }
  720. /* get decoded residual from reversed vector */
  721. reverse_memcpy(decresidual + SUBL * Nback - 1, reverseDecresidual, SUBL * Nback);
  722. }
  723. }
  724. static int16_t max_abs_value_w16(const int16_t* vector, int length)
  725. {
  726. int i = 0, absolute = 0, maximum = 0;
  727. if (vector == NULL || length <= 0) {
  728. return -1;
  729. }
  730. for (i = 0; i < length; i++) {
  731. absolute = FFABS(vector[i]);
  732. if (absolute > maximum)
  733. maximum = absolute;
  734. }
  735. // Guard the case for abs(-32768).
  736. return FFMIN(maximum, INT16_MAX);
  737. }
  738. static int16_t get_size_in_bits(uint32_t n)
  739. {
  740. int16_t bits;
  741. if (0xFFFF0000 & n) {
  742. bits = 16;
  743. } else {
  744. bits = 0;
  745. }
  746. if (0x0000FF00 & (n >> bits)) bits += 8;
  747. if (0x000000F0 & (n >> bits)) bits += 4;
  748. if (0x0000000C & (n >> bits)) bits += 2;
  749. if (0x00000002 & (n >> bits)) bits += 1;
  750. if (0x00000001 & (n >> bits)) bits += 1;
  751. return bits;
  752. }
  753. static int32_t scale_dot_product(const int16_t *v1, const int16_t *v2, int length, int scaling)
  754. {
  755. int64_t sum = 0;
  756. for (int i = 0; i < length; i++)
  757. sum += (v1[i] * v2[i]) >> scaling;
  758. return av_clipl_int32(sum);
  759. }
  760. static void correlation(int32_t *corr, int32_t *ener, int16_t *buffer,
  761. int16_t lag, int16_t blen, int16_t srange, int16_t scale)
  762. {
  763. int16_t *w16ptr;
  764. w16ptr = &buffer[blen - srange - lag];
  765. *corr = scale_dot_product(&buffer[blen - srange], w16ptr, srange, scale);
  766. *ener = scale_dot_product(w16ptr, w16ptr, srange, scale);
  767. if (*ener == 0) {
  768. *corr = 0;
  769. *ener = 1;
  770. }
  771. }
  772. #define SPL_SHIFT_W32(x, c) (((c) >= 0) ? ((x) << (c)) : ((x) >> (-(c))))
  773. static int16_t norm_w32(int32_t a)
  774. {
  775. if (a == 0) {
  776. return 0;
  777. } else if (a < 0) {
  778. a = ~a;
  779. }
  780. return ff_clz(a);
  781. }
  782. static int32_t div_w32_w16(int32_t num, int16_t den)
  783. {
  784. if (den != 0)
  785. return num / den;
  786. else
  787. return 0x7FFFFFFF;
  788. }
  789. static void do_plc(int16_t *plc_residual, /* (o) concealed residual */
  790. int16_t *plc_lpc, /* (o) concealed LP parameters */
  791. int16_t PLI, /* (i) packet loss indicator
  792. 0 - no PL, 1 = PL */
  793. int16_t *decresidual, /* (i) decoded residual */
  794. int16_t *lpc, /* (i) decoded LPC (only used for no PL) */
  795. int16_t inlag, /* (i) pitch lag */
  796. ILBCContext *s) /* (i/o) decoder instance */
  797. {
  798. int16_t i, pick;
  799. int32_t cross, ener, cross_comp, ener_comp = 0;
  800. int32_t measure, max_measure, energy;
  801. int16_t max, cross_square_max, cross_square;
  802. int16_t j, lag, tmp1, tmp2, randlag;
  803. int16_t shift1, shift2, shift3, shift_max;
  804. int16_t scale3;
  805. int16_t corrLen;
  806. int32_t tmpW32, tmp2W32;
  807. int16_t use_gain;
  808. int16_t tot_gain;
  809. int16_t max_perSquare;
  810. int16_t scale1, scale2;
  811. int16_t totscale;
  812. int32_t nom;
  813. int16_t denom;
  814. int16_t pitchfact;
  815. int16_t use_lag;
  816. int ind;
  817. int16_t randvec[BLOCKL_MAX];
  818. /* Packet Loss */
  819. if (PLI == 1) {
  820. s->consPLICount += 1;
  821. /* if previous frame not lost,
  822. determine pitch pred. gain */
  823. if (s->prevPLI != 1) {
  824. /* Maximum 60 samples are correlated, preserve as high accuracy
  825. as possible without getting overflow */
  826. max = max_abs_value_w16(s->prevResidual, s->block_samples);
  827. scale3 = (get_size_in_bits(max) << 1) - 25;
  828. if (scale3 < 0) {
  829. scale3 = 0;
  830. }
  831. /* Store scale for use when interpolating between the
  832. * concealment and the received packet */
  833. s->prevScale = scale3;
  834. /* Search around the previous lag +/-3 to find the
  835. best pitch period */
  836. lag = inlag - 3;
  837. /* Guard against getting outside the frame */
  838. corrLen = FFMIN(60, s->block_samples - (inlag + 3));
  839. correlation(&cross, &ener, s->prevResidual, lag, s->block_samples, corrLen, scale3);
  840. /* Normalize and store cross^2 and the number of shifts */
  841. shift_max = get_size_in_bits(FFABS(cross)) - 15;
  842. cross_square_max = (int16_t) SPL_MUL_16_16_RSFT(SPL_SHIFT_W32(cross, -shift_max), SPL_SHIFT_W32(cross, -shift_max), 15);
  843. for (j = inlag - 2; j <= inlag + 3; j++) {
  844. correlation(&cross_comp, &ener_comp, s->prevResidual, j, s->block_samples, corrLen, scale3);
  845. /* Use the criteria (corr*corr)/energy to compare if
  846. this lag is better or not. To avoid the division,
  847. do a cross multiplication */
  848. shift1 = get_size_in_bits(FFABS(cross_comp)) - 15;
  849. cross_square = (int16_t) SPL_MUL_16_16_RSFT(SPL_SHIFT_W32(cross_comp, -shift1), SPL_SHIFT_W32(cross_comp, -shift1), 15);
  850. shift2 = get_size_in_bits(ener) - 15;
  851. measure = SPL_MUL_16_16(SPL_SHIFT_W32(ener, -shift2), cross_square);
  852. shift3 = get_size_in_bits(ener_comp) - 15;
  853. max_measure = SPL_MUL_16_16(SPL_SHIFT_W32(ener_comp, -shift3), cross_square_max);
  854. /* Calculate shift value, so that the two measures can
  855. be put in the same Q domain */
  856. if (((shift_max << 1) + shift3) > ((shift1 << 1) + shift2)) {
  857. tmp1 = FFMIN(31, (shift_max << 1) + shift3 - (shift1 << 1) - shift2);
  858. tmp2 = 0;
  859. } else {
  860. tmp1 = 0;
  861. tmp2 = FFMIN(31, (shift1 << 1) + shift2 - (shift_max << 1) - shift3);
  862. }
  863. if ((measure >> tmp1) > (max_measure >> tmp2)) {
  864. /* New lag is better => record lag, measure and domain */
  865. lag = j;
  866. cross_square_max = cross_square;
  867. cross = cross_comp;
  868. shift_max = shift1;
  869. ener = ener_comp;
  870. }
  871. }
  872. /* Calculate the periodicity for the lag with the maximum correlation.
  873. Definition of the periodicity:
  874. abs(corr(vec1, vec2))/(sqrt(energy(vec1))*sqrt(energy(vec2)))
  875. Work in the Square domain to simplify the calculations
  876. max_perSquare is less than 1 (in Q15)
  877. */
  878. tmp2W32 = scale_dot_product(&s->prevResidual[s->block_samples - corrLen], &s->prevResidual[s->block_samples - corrLen], corrLen, scale3);
  879. if ((tmp2W32 > 0) && (ener_comp > 0)) {
  880. /* norm energies to int16_t, compute the product of the energies and
  881. use the upper int16_t as the denominator */
  882. scale1 = norm_w32(tmp2W32) - 16;
  883. tmp1 = SPL_SHIFT_W32(tmp2W32, scale1);
  884. scale2 = norm_w32(ener) - 16;
  885. tmp2 = SPL_SHIFT_W32(ener, scale2);
  886. denom = SPL_MUL_16_16_RSFT(tmp1, tmp2, 16); /* denom in Q(scale1+scale2-16) */
  887. /* Square the cross correlation and norm it such that max_perSquare
  888. will be in Q15 after the division */
  889. totscale = scale1 + scale2 - 1;
  890. tmp1 = SPL_SHIFT_W32(cross, (totscale >> 1));
  891. tmp2 = SPL_SHIFT_W32(cross, totscale - (totscale >> 1));
  892. nom = SPL_MUL_16_16(tmp1, tmp2);
  893. max_perSquare = div_w32_w16(nom, denom);
  894. } else {
  895. max_perSquare = 0;
  896. }
  897. } else {
  898. /* previous frame lost, use recorded lag and gain */
  899. lag = s->prevLag;
  900. max_perSquare = s->per_square;
  901. }
  902. /* Attenuate signal and scale down pitch pred gain if
  903. several frames lost consecutively */
  904. use_gain = 32767; /* 1.0 in Q15 */
  905. if (s->consPLICount * s->block_samples > 320) {
  906. use_gain = 29491; /* 0.9 in Q15 */
  907. } else if (s->consPLICount * s->block_samples > 640) {
  908. use_gain = 22938; /* 0.7 in Q15 */
  909. } else if (s->consPLICount * s->block_samples > 960) {
  910. use_gain = 16384; /* 0.5 in Q15 */
  911. } else if (s->consPLICount * s->block_samples > 1280) {
  912. use_gain = 0; /* 0.0 in Q15 */
  913. }
  914. /* Compute mixing factor of picth repeatition and noise:
  915. for max_per>0.7 set periodicity to 1.0
  916. 0.4<max_per<0.7 set periodicity to (maxper-0.4)/0.7-0.4)
  917. max_per<0.4 set periodicity to 0.0
  918. */
  919. if (max_perSquare > 7868) { /* periodicity > 0.7 (0.7^4=0.2401 in Q15) */
  920. pitchfact = 32767;
  921. } else if (max_perSquare > 839) { /* 0.4 < periodicity < 0.7 (0.4^4=0.0256 in Q15) */
  922. /* find best index and interpolate from that */
  923. ind = 5;
  924. while ((max_perSquare < kPlcPerSqr[ind]) && (ind > 0)) {
  925. ind--;
  926. }
  927. /* pitch fact is approximated by first order */
  928. tmpW32 = kPlcPitchFact[ind] + SPL_MUL_16_16_RSFT(kPlcPfSlope[ind], (max_perSquare - kPlcPerSqr[ind]), 11);
  929. pitchfact = FFMIN(tmpW32, 32767); /* guard against overflow */
  930. } else { /* periodicity < 0.4 */
  931. pitchfact = 0;
  932. }
  933. /* avoid repetition of same pitch cycle (buzzyness) */
  934. use_lag = lag;
  935. if (lag < 80) {
  936. use_lag = 2 * lag;
  937. }
  938. /* compute concealed residual */
  939. energy = 0;
  940. for (i = 0; i < s->block_samples; i++) {
  941. /* noise component - 52 < randlagFIX < 117 */
  942. s->seed = SPL_MUL_16_16(s->seed, 31821) + 13849;
  943. randlag = 53 + (s->seed & 63);
  944. pick = i - randlag;
  945. if (pick < 0) {
  946. randvec[i] = s->prevResidual[s->block_samples + pick];
  947. } else {
  948. randvec[i] = s->prevResidual[pick];
  949. }
  950. /* pitch repeatition component */
  951. pick = i - use_lag;
  952. if (pick < 0) {
  953. plc_residual[i] = s->prevResidual[s->block_samples + pick];
  954. } else {
  955. plc_residual[i] = plc_residual[pick];
  956. }
  957. /* Attinuate total gain for each 10 ms */
  958. if (i < 80) {
  959. tot_gain = use_gain;
  960. } else if (i < 160) {
  961. tot_gain = SPL_MUL_16_16_RSFT(31130, use_gain, 15); /* 0.95*use_gain */
  962. } else {
  963. tot_gain = SPL_MUL_16_16_RSFT(29491, use_gain, 15); /* 0.9*use_gain */
  964. }
  965. /* mix noise and pitch repeatition */
  966. plc_residual[i] = SPL_MUL_16_16_RSFT(tot_gain, (pitchfact * plc_residual[i] + (32767 - pitchfact) * randvec[i] + 16384) >> 15, 15);
  967. /* Shifting down the result one step extra to ensure that no overflow
  968. will occur */
  969. energy += SPL_MUL_16_16_RSFT(plc_residual[i], plc_residual[i], (s->prevScale + 1));
  970. }
  971. /* less than 30 dB, use only noise */
  972. if (energy < SPL_SHIFT_W32(s->block_samples * 900, -s->prevScale - 1)) {
  973. energy = 0;
  974. for (i = 0; i < s->block_samples; i++) {
  975. plc_residual[i] = randvec[i];
  976. }
  977. }
  978. /* use the old LPC */
  979. memcpy(plc_lpc, (*s).prev_lpc, (LPC_FILTERORDER + 1) * 2);
  980. /* Update state in case there are multiple frame losses */
  981. s->prevLag = lag;
  982. s->per_square = max_perSquare;
  983. } else { /* no packet loss, copy input */
  984. memcpy(plc_residual, decresidual, s->block_samples * 2);
  985. memcpy(plc_lpc, lpc, (LPC_FILTERORDER + 1) * 2);
  986. s->consPLICount = 0;
  987. }
  988. /* update state */
  989. s->prevPLI = PLI;
  990. memcpy(s->prev_lpc, plc_lpc, (LPC_FILTERORDER + 1) * 2);
  991. memcpy(s->prevResidual, plc_residual, s->block_samples * 2);
  992. return;
  993. }
  994. static int xcorr_coeff(int16_t *target, int16_t *regressor,
  995. int16_t subl, int16_t searchLen,
  996. int16_t offset, int16_t step)
  997. {
  998. int16_t maxlag;
  999. int16_t pos;
  1000. int16_t max;
  1001. int16_t cross_corr_scale, energy_scale;
  1002. int16_t cross_corr_sg_mod, cross_corr_sg_mod_max;
  1003. int32_t cross_corr, energy;
  1004. int16_t cross_corr_mod, energy_mod, enery_mod_max;
  1005. int16_t *tp, *rp;
  1006. int16_t *rp_beg, *rp_end;
  1007. int16_t totscale, totscale_max;
  1008. int16_t scalediff;
  1009. int32_t new_crit, max_crit;
  1010. int shifts;
  1011. int k;
  1012. /* Initializations, to make sure that the first one is selected */
  1013. cross_corr_sg_mod_max = 0;
  1014. enery_mod_max = INT16_MAX;
  1015. totscale_max = -500;
  1016. maxlag = 0;
  1017. pos = 0;
  1018. /* Find scale value and start position */
  1019. if (step == 1) {
  1020. max = max_abs_value_w16(regressor, (int16_t) (subl + searchLen - 1));
  1021. rp_beg = regressor;
  1022. rp_end = &regressor[subl];
  1023. } else { /* step== -1 */
  1024. max = max_abs_value_w16(&regressor[-searchLen], (int16_t) (subl + searchLen - 1));
  1025. rp_beg = &regressor[-1];
  1026. rp_end = &regressor[subl - 1];
  1027. }
  1028. /* Introduce a scale factor on the energy in int32_t in
  1029. order to make sure that the calculation does not
  1030. overflow */
  1031. if (max > 5000) {
  1032. shifts = 2;
  1033. } else {
  1034. shifts = 0;
  1035. }
  1036. /* Calculate the first energy, then do a +/- to get the other energies */
  1037. energy = scale_dot_product(regressor, regressor, subl, shifts);
  1038. for (k = 0; k < searchLen; k++) {
  1039. tp = target;
  1040. rp = &regressor[pos];
  1041. cross_corr = scale_dot_product(tp, rp, subl, shifts);
  1042. if ((energy > 0) && (cross_corr > 0)) {
  1043. /* Put cross correlation and energy on 16 bit word */
  1044. cross_corr_scale = norm_w32(cross_corr) - 16;
  1045. cross_corr_mod = (int16_t) SPL_SHIFT_W32(cross_corr, cross_corr_scale);
  1046. energy_scale = norm_w32(energy) - 16;
  1047. energy_mod = (int16_t) SPL_SHIFT_W32(energy, energy_scale);
  1048. /* Square cross correlation and store upper int16_t */
  1049. cross_corr_sg_mod = (int16_t) SPL_MUL_16_16_RSFT(cross_corr_mod, cross_corr_mod, 16);
  1050. /* Calculate the total number of (dynamic) right shifts that have
  1051. been performed on (cross_corr*cross_corr)/energy
  1052. */
  1053. totscale = energy_scale - (cross_corr_scale * 2);
  1054. /* Calculate the shift difference in order to be able to compare the two
  1055. (cross_corr*cross_corr)/energy in the same domain
  1056. */
  1057. scalediff = totscale - totscale_max;
  1058. scalediff = FFMIN(scalediff, 31);
  1059. scalediff = FFMAX(scalediff, -31);
  1060. /* Compute the cross multiplication between the old best criteria
  1061. and the new one to be able to compare them without using a
  1062. division */
  1063. if (scalediff < 0) {
  1064. new_crit = ((int32_t) cross_corr_sg_mod * enery_mod_max) >> (-scalediff);
  1065. max_crit = ((int32_t) cross_corr_sg_mod_max * energy_mod);
  1066. } else {
  1067. new_crit = ((int32_t) cross_corr_sg_mod * enery_mod_max);
  1068. max_crit = ((int32_t) cross_corr_sg_mod_max * energy_mod) >> scalediff;
  1069. }
  1070. /* Store the new lag value if the new criteria is larger
  1071. than previous largest criteria */
  1072. if (new_crit > max_crit) {
  1073. cross_corr_sg_mod_max = cross_corr_sg_mod;
  1074. enery_mod_max = energy_mod;
  1075. totscale_max = totscale;
  1076. maxlag = k;
  1077. }
  1078. }
  1079. pos += step;
  1080. /* Do a +/- to get the next energy */
  1081. energy += (unsigned)step * ((*rp_end * *rp_end - *rp_beg * *rp_beg) >> shifts);
  1082. rp_beg += step;
  1083. rp_end += step;
  1084. }
  1085. return maxlag + offset;
  1086. }
  1087. static void hp_output(int16_t *signal, const int16_t *ba, int16_t *y,
  1088. int16_t *x, int16_t len)
  1089. {
  1090. int32_t tmp;
  1091. for (int i = 0; i < len; i++) {
  1092. tmp = SPL_MUL_16_16(y[1], ba[3]); /* (-a[1])*y[i-1] (low part) */
  1093. tmp += SPL_MUL_16_16(y[3], ba[4]); /* (-a[2])*y[i-2] (low part) */
  1094. tmp = (tmp >> 15);
  1095. tmp += SPL_MUL_16_16(y[0], ba[3]); /* (-a[1])*y[i-1] (high part) */
  1096. tmp += SPL_MUL_16_16(y[2], ba[4]); /* (-a[2])*y[i-2] (high part) */
  1097. tmp = (tmp * 2);
  1098. tmp += SPL_MUL_16_16(signal[i], ba[0]); /* b[0]*x[0] */
  1099. tmp += SPL_MUL_16_16(x[0], ba[1]); /* b[1]*x[i-1] */
  1100. tmp += SPL_MUL_16_16(x[1], ba[2]); /* b[2]*x[i-2] */
  1101. /* Update state (input part) */
  1102. x[1] = x[0];
  1103. x[0] = signal[i];
  1104. /* Convert back to Q0 and multiply with 2 */
  1105. signal[i] = av_clip_intp2(tmp + 1024, 26) >> 11;
  1106. /* Update state (filtered part) */
  1107. y[2] = y[0];
  1108. y[3] = y[1];
  1109. /* upshift tmp by 3 with saturation */
  1110. if (tmp > 268435455) {
  1111. tmp = INT32_MAX;
  1112. } else if (tmp < -268435456) {
  1113. tmp = INT32_MIN;
  1114. } else {
  1115. tmp = tmp * 8;
  1116. }
  1117. y[0] = tmp >> 16;
  1118. y[1] = (tmp - (y[0] * (1 << 16))) >> 1;
  1119. }
  1120. }
  1121. static int ilbc_decode_frame(AVCodecContext *avctx, void *data,
  1122. int *got_frame_ptr, AVPacket *avpkt)
  1123. {
  1124. const uint8_t *buf = avpkt->data;
  1125. AVFrame *frame = data;
  1126. ILBCContext *s = avctx->priv_data;
  1127. int mode = s->mode, ret;
  1128. int16_t *plc_data = &s->plc_residual[LPC_FILTERORDER];
  1129. if ((ret = init_get_bits8(&s->gb, buf, avpkt->size)) < 0)
  1130. return ret;
  1131. memset(&s->frame, 0, sizeof(ILBCFrame));
  1132. frame->nb_samples = s->block_samples;
  1133. if ((ret = ff_get_buffer(avctx, frame, 0)) < 0)
  1134. return ret;
  1135. if (unpack_frame(s))
  1136. mode = 0;
  1137. if (s->frame.start < 1 || s->frame.start > 5)
  1138. mode = 0;
  1139. if (mode) {
  1140. index_conv(s->frame.cb_index);
  1141. lsf_dequantization(s->lsfdeq, s->frame.lsf, s->lpc_n);
  1142. lsf_check_stability(s->lsfdeq, LPC_FILTERORDER, s->lpc_n);
  1143. lsp_interpolate(s->syntdenum, s->weightdenum,
  1144. s->lsfdeq, LPC_FILTERORDER, s);
  1145. decode_residual(s, &s->frame, s->decresidual, s->syntdenum);
  1146. do_plc(s->plc_residual, s->plc_lpc, 0,
  1147. s->decresidual, s->syntdenum + (LPC_FILTERORDER + 1) * (s->nsub - 1),
  1148. s->last_lag, s);
  1149. memcpy(s->decresidual, s->plc_residual, s->block_samples * 2);
  1150. }
  1151. if (s->enhancer) {
  1152. /* TODO */
  1153. } else {
  1154. int16_t lag, i;
  1155. /* Find last lag (since the enhancer is not called to give this info) */
  1156. if (s->mode == 20) {
  1157. lag = xcorr_coeff(&s->decresidual[s->block_samples-60], &s->decresidual[s->block_samples-80],
  1158. 60, 80, 20, -1);
  1159. } else {
  1160. lag = xcorr_coeff(&s->decresidual[s->block_samples-ENH_BLOCKL],
  1161. &s->decresidual[s->block_samples-ENH_BLOCKL-20],
  1162. ENH_BLOCKL, 100, 20, -1);
  1163. }
  1164. /* Store lag (it is needed if next packet is lost) */
  1165. s->last_lag = lag;
  1166. /* copy data and run synthesis filter */
  1167. memcpy(plc_data, s->decresidual, s->block_samples * 2);
  1168. /* Set up the filter state */
  1169. memcpy(&plc_data[-LPC_FILTERORDER], s->syntMem, LPC_FILTERORDER * 2);
  1170. for (i = 0; i < s->nsub; i++) {
  1171. filter_arfq12(plc_data+i*SUBL, plc_data+i*SUBL,
  1172. s->syntdenum + i*(LPC_FILTERORDER + 1),
  1173. LPC_FILTERORDER + 1, SUBL);
  1174. }
  1175. /* Save the filter state */
  1176. memcpy(s->syntMem, &plc_data[s->block_samples-LPC_FILTERORDER], LPC_FILTERORDER * 2);
  1177. }
  1178. memcpy(frame->data[0], plc_data, s->block_samples * 2);
  1179. hp_output((int16_t *)frame->data[0], hp_out_coeffs,
  1180. s->hpimemy, s->hpimemx, s->block_samples);
  1181. memcpy(s->old_syntdenum, s->syntdenum, s->nsub*(LPC_FILTERORDER + 1) * 2);
  1182. s->prev_enh_pl = 0;
  1183. if (mode == 0)
  1184. s->prev_enh_pl = 1;
  1185. *got_frame_ptr = 1;
  1186. return avpkt->size;
  1187. }
  1188. static av_cold int ilbc_decode_init(AVCodecContext *avctx)
  1189. {
  1190. ILBCContext *s = avctx->priv_data;
  1191. if (avctx->block_align == 38)
  1192. s->mode = 20;
  1193. else if (avctx->block_align == 50)
  1194. s->mode = 30;
  1195. else if (avctx->bit_rate > 0)
  1196. s->mode = avctx->bit_rate <= 14000 ? 30 : 20;
  1197. else
  1198. return AVERROR_INVALIDDATA;
  1199. avctx->channels = 1;
  1200. avctx->channel_layout = AV_CH_LAYOUT_MONO;
  1201. avctx->sample_rate = 8000;
  1202. avctx->sample_fmt = AV_SAMPLE_FMT_S16;
  1203. if (s->mode == 30) {
  1204. s->block_samples = 240;
  1205. s->nsub = NSUB_30MS;
  1206. s->nasub = NASUB_30MS;
  1207. s->lpc_n = LPC_N_30MS;
  1208. s->state_short_len = STATE_SHORT_LEN_30MS;
  1209. } else {
  1210. s->block_samples = 160;
  1211. s->nsub = NSUB_20MS;
  1212. s->nasub = NASUB_20MS;
  1213. s->lpc_n = LPC_N_20MS;
  1214. s->state_short_len = STATE_SHORT_LEN_20MS;
  1215. }
  1216. return 0;
  1217. }
  1218. AVCodec ff_ilbc_decoder = {
  1219. .name = "ilbc",
  1220. .long_name = NULL_IF_CONFIG_SMALL("iLBC (Internet Low Bitrate Codec)"),
  1221. .type = AVMEDIA_TYPE_AUDIO,
  1222. .id = AV_CODEC_ID_ILBC,
  1223. .init = ilbc_decode_init,
  1224. .decode = ilbc_decode_frame,
  1225. .capabilities = AV_CODEC_CAP_DR1,
  1226. .priv_data_size = sizeof(ILBCContext),
  1227. };