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.

177 lines
5.6KB

  1. /*
  2. * gain code, gain pitch and pitch delay decoding
  3. *
  4. * Copyright (c) 2008 Vladimir Voroshilov
  5. *
  6. * This file is part of Libav.
  7. *
  8. * Libav is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU Lesser General Public
  10. * License as published by the Free Software Foundation; either
  11. * version 2.1 of the License, or (at your option) any later version.
  12. *
  13. * Libav is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * Lesser General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU Lesser General Public
  19. * License along with Libav; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. #include "libavutil/mathematics.h"
  23. #include "avcodec.h"
  24. #include "dsputil.h"
  25. #include "acelp_pitch_delay.h"
  26. #include "celp_math.h"
  27. int ff_acelp_decode_8bit_to_1st_delay3(int ac_index)
  28. {
  29. ac_index += 58;
  30. if(ac_index > 254)
  31. ac_index = 3 * ac_index - 510;
  32. return ac_index;
  33. }
  34. int ff_acelp_decode_4bit_to_2nd_delay3(
  35. int ac_index,
  36. int pitch_delay_min)
  37. {
  38. if(ac_index < 4)
  39. return 3 * (ac_index + pitch_delay_min);
  40. else if(ac_index < 12)
  41. return 3 * pitch_delay_min + ac_index + 6;
  42. else
  43. return 3 * (ac_index + pitch_delay_min) - 18;
  44. }
  45. int ff_acelp_decode_5_6_bit_to_2nd_delay3(
  46. int ac_index,
  47. int pitch_delay_min)
  48. {
  49. return 3 * pitch_delay_min + ac_index - 2;
  50. }
  51. int ff_acelp_decode_9bit_to_1st_delay6(int ac_index)
  52. {
  53. if(ac_index < 463)
  54. return ac_index + 105;
  55. else
  56. return 6 * (ac_index - 368);
  57. }
  58. int ff_acelp_decode_6bit_to_2nd_delay6(
  59. int ac_index,
  60. int pitch_delay_min)
  61. {
  62. return 6 * pitch_delay_min + ac_index - 3;
  63. }
  64. void ff_acelp_update_past_gain(
  65. int16_t* quant_energy,
  66. int gain_corr_factor,
  67. int log2_ma_pred_order,
  68. int erasure)
  69. {
  70. int i;
  71. int avg_gain=quant_energy[(1 << log2_ma_pred_order) - 1]; // (5.10)
  72. for(i=(1 << log2_ma_pred_order) - 1; i>0; i--)
  73. {
  74. avg_gain += quant_energy[i-1];
  75. quant_energy[i] = quant_energy[i-1];
  76. }
  77. if(erasure)
  78. quant_energy[0] = FFMAX(avg_gain >> log2_ma_pred_order, -10240) - 4096; // -10 and -4 in (5.10)
  79. else
  80. quant_energy[0] = (6165 * ((ff_log2(gain_corr_factor) >> 2) - (13 << 13))) >> 13;
  81. }
  82. int16_t ff_acelp_decode_gain_code(
  83. DSPContext *dsp,
  84. int gain_corr_factor,
  85. const int16_t* fc_v,
  86. int mr_energy,
  87. const int16_t* quant_energy,
  88. const int16_t* ma_prediction_coeff,
  89. int subframe_size,
  90. int ma_pred_order)
  91. {
  92. int i;
  93. mr_energy <<= 10;
  94. for(i=0; i<ma_pred_order; i++)
  95. mr_energy += quant_energy[i] * ma_prediction_coeff[i];
  96. mr_energy = gain_corr_factor * exp(M_LN10 / (20 << 23) * mr_energy) /
  97. sqrt(dsp->scalarproduct_int16(fc_v, fc_v, subframe_size));
  98. return mr_energy >> 12;
  99. }
  100. float ff_amr_set_fixed_gain(float fixed_gain_factor, float fixed_mean_energy,
  101. float *prediction_error, float energy_mean,
  102. const float *pred_table)
  103. {
  104. // Equations 66-69:
  105. // ^g_c = ^gamma_gc * 100.05 (predicted dB + mean dB - dB of fixed vector)
  106. // Note 10^(0.05 * -10log(average x2)) = 1/sqrt((average x2)).
  107. float val = fixed_gain_factor *
  108. exp2f(M_LOG2_10 * 0.05 *
  109. (ff_dot_productf(pred_table, prediction_error, 4) +
  110. energy_mean)) /
  111. sqrtf(fixed_mean_energy);
  112. // update quantified prediction error energy history
  113. memmove(&prediction_error[0], &prediction_error[1],
  114. 3 * sizeof(prediction_error[0]));
  115. prediction_error[3] = 20.0 * log10f(fixed_gain_factor);
  116. return val;
  117. }
  118. void ff_decode_pitch_lag(int *lag_int, int *lag_frac, int pitch_index,
  119. const int prev_lag_int, const int subframe,
  120. int third_as_first, int resolution)
  121. {
  122. /* Note n * 10923 >> 15 is floor(x/3) for 0 <= n <= 32767 */
  123. if (subframe == 0 || (subframe == 2 && third_as_first)) {
  124. if (pitch_index < 197)
  125. pitch_index += 59;
  126. else
  127. pitch_index = 3 * pitch_index - 335;
  128. } else {
  129. if (resolution == 4) {
  130. int search_range_min = av_clip(prev_lag_int - 5, PITCH_DELAY_MIN,
  131. PITCH_DELAY_MAX - 9);
  132. // decoding with 4-bit resolution
  133. if (pitch_index < 4) {
  134. // integer only precision for [search_range_min, search_range_min+3]
  135. pitch_index = 3 * (pitch_index + search_range_min) + 1;
  136. } else if (pitch_index < 12) {
  137. // 1/3 fractional precision for [search_range_min+3 1/3, search_range_min+5 2/3]
  138. pitch_index += 3 * search_range_min + 7;
  139. } else {
  140. // integer only precision for [search_range_min+6, search_range_min+9]
  141. pitch_index = 3 * (pitch_index + search_range_min - 6) + 1;
  142. }
  143. } else {
  144. // decoding with 5 or 6 bit resolution, 1/3 fractional precision
  145. pitch_index--;
  146. if (resolution == 5) {
  147. pitch_index += 3 * av_clip(prev_lag_int - 10, PITCH_DELAY_MIN,
  148. PITCH_DELAY_MAX - 19);
  149. } else
  150. pitch_index += 3 * av_clip(prev_lag_int - 5, PITCH_DELAY_MIN,
  151. PITCH_DELAY_MAX - 9);
  152. }
  153. }
  154. *lag_int = pitch_index * 10923 >> 15;
  155. *lag_frac = pitch_index - 3 * *lag_int - 1;
  156. }