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.

151 lines
4.6KB

  1. /*
  2. * gsm 06.10 decoder
  3. * Copyright (c) 2010 Reimar Döffinger <Reimar.Doeffinger@gmx.de>
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file
  23. * GSM decoder
  24. */
  25. #include "get_bits.h"
  26. #include "gsmdec_data.h"
  27. static void apcm_dequant_add(GetBitContext *gb, int16_t *dst)
  28. {
  29. int i;
  30. int maxidx = get_bits(gb, 6);
  31. const int16_t *tab = ff_gsm_dequant_tab[maxidx];
  32. for (i = 0; i < 13; i++)
  33. dst[3*i] += tab[get_bits(gb, 3)];
  34. }
  35. static inline int gsm_mult(int a, int b)
  36. {
  37. return (a * b + (1 << 14)) >> 15;
  38. }
  39. static void long_term_synth(int16_t *dst, int lag, int gain_idx)
  40. {
  41. int i;
  42. const int16_t *src = dst - lag;
  43. uint16_t gain = ff_gsm_long_term_gain_tab[gain_idx];
  44. for (i = 0; i < 40; i++)
  45. dst[i] = gsm_mult(gain, src[i]);
  46. }
  47. static inline int decode_log_area(int coded, int factor, int offset)
  48. {
  49. coded <<= 10;
  50. coded -= offset;
  51. return gsm_mult(coded, factor) << 1;
  52. }
  53. static av_noinline int get_rrp(int filtered)
  54. {
  55. int abs = FFABS(filtered);
  56. if (abs < 11059) abs <<= 1;
  57. else if (abs < 20070) abs += 11059;
  58. else abs = (abs >> 2) + 26112;
  59. return filtered < 0 ? -abs : abs;
  60. }
  61. static int filter_value(int in, int rrp[8], int v[9])
  62. {
  63. int i;
  64. for (i = 7; i >= 0; i--) {
  65. in -= gsm_mult(rrp[i], v[i]);
  66. v[i + 1] = v[i] + gsm_mult(rrp[i], in);
  67. }
  68. v[0] = in;
  69. return in;
  70. }
  71. static void short_term_synth(GSMContext *ctx, int16_t *dst, const int16_t *src)
  72. {
  73. int i;
  74. int rrp[8];
  75. int *lar = ctx->lar[ctx->lar_idx];
  76. int *lar_prev = ctx->lar[ctx->lar_idx ^ 1];
  77. for (i = 0; i < 8; i++)
  78. rrp[i] = get_rrp((lar_prev[i] >> 2) + (lar_prev[i] >> 1) + (lar[i] >> 2));
  79. for (i = 0; i < 13; i++)
  80. dst[i] = filter_value(src[i], rrp, ctx->v);
  81. for (i = 0; i < 8; i++)
  82. rrp[i] = get_rrp((lar_prev[i] >> 1) + (lar [i] >> 1));
  83. for (i = 13; i < 27; i++)
  84. dst[i] = filter_value(src[i], rrp, ctx->v);
  85. for (i = 0; i < 8; i++)
  86. rrp[i] = get_rrp((lar_prev[i] >> 2) + (lar [i] >> 1) + (lar[i] >> 2));
  87. for (i = 27; i < 40; i++)
  88. dst[i] = filter_value(src[i], rrp, ctx->v);
  89. for (i = 0; i < 8; i++)
  90. rrp[i] = get_rrp(lar[i]);
  91. for (i = 40; i < 160; i++)
  92. dst[i] = filter_value(src[i], rrp, ctx->v);
  93. ctx->lar_idx ^= 1;
  94. }
  95. static int postprocess(int16_t *data, int msr)
  96. {
  97. int i;
  98. for (i = 0; i < 160; i++) {
  99. msr = av_clip_int16(data[i] + gsm_mult(msr, 28180));
  100. data[i] = av_clip_int16(msr << 1) & ~7;
  101. }
  102. return msr;
  103. }
  104. static int gsm_decode_block(AVCodecContext *avctx, int16_t *samples,
  105. GetBitContext *gb)
  106. {
  107. GSMContext *ctx = avctx->priv_data;
  108. int i;
  109. int16_t *ref_dst = ctx->ref_buf + 120;
  110. int *lar = ctx->lar[ctx->lar_idx];
  111. lar[0] = decode_log_area(get_bits(gb, 6), 13107, 1 << 15);
  112. lar[1] = decode_log_area(get_bits(gb, 6), 13107, 1 << 15);
  113. lar[2] = decode_log_area(get_bits(gb, 5), 13107, (1 << 14) + 2048*2);
  114. lar[3] = decode_log_area(get_bits(gb, 5), 13107, (1 << 14) - 2560*2);
  115. lar[4] = decode_log_area(get_bits(gb, 4), 19223, (1 << 13) + 94*2);
  116. lar[5] = decode_log_area(get_bits(gb, 4), 17476, (1 << 13) - 1792*2);
  117. lar[6] = decode_log_area(get_bits(gb, 3), 31454, (1 << 12) - 341*2);
  118. lar[7] = decode_log_area(get_bits(gb, 3), 29708, (1 << 12) - 1144*2);
  119. for (i = 0; i < 4; i++) {
  120. int lag = get_bits(gb, 7);
  121. int gain_idx = get_bits(gb, 2);
  122. int offset = get_bits(gb, 2);
  123. lag = av_clip(lag, 40, 120);
  124. long_term_synth(ref_dst, lag, gain_idx);
  125. apcm_dequant_add(gb, ref_dst + offset);
  126. ref_dst += 40;
  127. }
  128. memcpy(ctx->ref_buf, ctx->ref_buf + 160, 120 * sizeof(*ctx->ref_buf));
  129. short_term_synth(ctx, samples, ctx->ref_buf + 120);
  130. // for optimal speed this could be merged with short_term_synth,
  131. // not done yet because it is a bit ugly
  132. ctx->msr = postprocess(samples, ctx->msr);
  133. return 0;
  134. }