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.

260 lines
7.2KB

  1. /*
  2. * RealAudio 2.0 (28.8K)
  3. * Copyright (c) 2003 the ffmpeg project
  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. #include "avcodec.h"
  22. #define ALT_BITSTREAM_READER_LE
  23. #include "bitstream.h"
  24. #include "ra288.h"
  25. typedef struct {
  26. float history[8];
  27. float output[40];
  28. float pr1[36];
  29. float pr2[10];
  30. int phase;
  31. float st1a[111], st1b[37], st1[37];
  32. float st2a[38], st2b[11], st2[11];
  33. float sb[41];
  34. float lhist[10];
  35. } RA288Context;
  36. static inline float scalar_product_float(const float * v1, const float * v2,
  37. int size)
  38. {
  39. float res = 0.;
  40. while (size--)
  41. res += *v1++ * *v2++;
  42. return res;
  43. }
  44. static void colmult(float *tgt, const float *m1, const float *m2, int n)
  45. {
  46. while (n--)
  47. *(tgt++) = (*(m1++)) * (*(m2++));
  48. }
  49. /* Decode and produce output */
  50. static void decode(RA288Context *ractx, float gain, int cb_coef)
  51. {
  52. int x, y;
  53. double sumsum;
  54. float sum, buffer[5];
  55. memmove(ractx->sb + 5, ractx->sb, 36 * sizeof(*ractx->sb));
  56. for (x=4; x >= 0; x--)
  57. ractx->sb[x] = -scalar_product_float(ractx->sb + x + 1, ractx->pr1, 36);
  58. /* convert log and do rms */
  59. sum = 32. - scalar_product_float(ractx->pr2, ractx->lhist, 10);
  60. sum = av_clipf(sum, 0, 60);
  61. sumsum = exp(sum * 0.1151292546497) * gain; /* pow(10.0,sum/20)*f */
  62. for (x=0; x < 5; x++)
  63. buffer[x] = codetable[cb_coef][x] * sumsum;
  64. sum = scalar_product_float(buffer, buffer, 5) / 5;
  65. sum = FFMAX(sum, 1);
  66. /* shift and store */
  67. memmove(ractx->lhist, ractx->lhist - 1, 10 * sizeof(*ractx->lhist));
  68. *ractx->lhist = ractx->history[ractx->phase] = 10 * log10(sum) - 32;
  69. for (x=1; x < 5; x++)
  70. for (y=x-1; y >= 0; y--)
  71. buffer[x] -= ractx->pr1[x-y-1] * buffer[y];
  72. /* output */
  73. for (x=0; x < 5; x++) {
  74. ractx->output[ractx->phase*5+x] = ractx->sb[4-x] =
  75. av_clipf(ractx->sb[4-x] + buffer[x], -4095, 4095);
  76. }
  77. }
  78. /**
  79. * Converts autocorrelation coefficients to LPC coefficients using the
  80. * Levinson-Durbin algorithm. See blocks 37 and 50 of the G.728 specification.
  81. *
  82. * @return 0 if success, -1 if fail
  83. */
  84. static int eval_lpc_coeffs(const float *in, float *tgt, int n)
  85. {
  86. int x, y;
  87. double f0, f1, f2;
  88. if (in[n] == 0)
  89. return -1;
  90. if ((f0 = *in) <= 0)
  91. return -1;
  92. in--; // To avoid a -1 subtraction in the inner loop
  93. for (x=1; x <= n; x++) {
  94. f1 = in[x+1];
  95. for (y=0; y < x - 1; y++)
  96. f1 += in[x-y]*tgt[y];
  97. tgt[x-1] = f2 = -f1/f0;
  98. for (y=0; y < x >> 1; y++) {
  99. float temp = tgt[y] + tgt[x-y-2]*f2;
  100. tgt[x-y-2] += tgt[y]*f2;
  101. tgt[y] = temp;
  102. }
  103. if ((f0 += f1*f2) < 0)
  104. return -1;
  105. }
  106. return 0;
  107. }
  108. static void prodsum(float *tgt, const float *src, int len, int n)
  109. {
  110. for (; n >= 0; n--)
  111. tgt[n] = scalar_product_float(src, src - n, len);
  112. }
  113. /**
  114. * Hybrid window filtering. See blocks 36 and 49 of the G.728 specification.
  115. *
  116. * @param order the order of the filter
  117. * @param n the length of the input
  118. * @param non_rec the number of non-recursive samples
  119. * @param out the filter output
  120. * @param in pointer to the input of the filter
  121. * @param hist pointer to the input history of the filter. It is updated by
  122. * this function.
  123. * @param out pointer to the non-recursive part of the output
  124. * @param out2 pointer to the recursive part of the output
  125. * @param window pointer to the windowing function table
  126. */
  127. static void do_hybrid_window(int order, int n, int non_rec, const float *in,
  128. float *out, float *hist, float *out2,
  129. const float *window)
  130. {
  131. unsigned int x;
  132. float buffer1[37];
  133. float buffer2[37];
  134. float work[111];
  135. /* update history */
  136. memmove(hist , hist + n, (order + non_rec)*sizeof(*hist));
  137. memcpy (hist + order + non_rec, in , n *sizeof(*hist));
  138. colmult(work, window, hist, order + n + non_rec);
  139. prodsum(buffer1, work + order , n , order);
  140. prodsum(buffer2, work + order + n, non_rec, order);
  141. for (x=0; x <= order; x++) {
  142. out2[x] = out2[x] * 0.5625 + buffer1[x];
  143. out [x] = out2[x] + buffer2[x];
  144. }
  145. /* Multiply by the white noise correcting factor (WNCF) */
  146. *out *= 257./256.;
  147. }
  148. /**
  149. * Backward synthesis filter. Find the LPC coefficients from past speech data.
  150. */
  151. static void backward_filter(RA288Context *ractx)
  152. {
  153. float buffer1[40], temp1[37];
  154. float buffer2[8], temp2[11];
  155. memcpy(buffer1 , ractx->output + 20, 20*sizeof(*buffer1));
  156. memcpy(buffer1 + 20, ractx->output , 20*sizeof(*buffer1));
  157. do_hybrid_window(36, 40, 35, buffer1, temp1, ractx->st1a, ractx->st1b,
  158. syn_window);
  159. if (!eval_lpc_coeffs(temp1, ractx->st1, 36))
  160. colmult(ractx->pr1, ractx->st1, syn_bw_tab, 36);
  161. memcpy(buffer2 , ractx->history + 4, 4*sizeof(*buffer2));
  162. memcpy(buffer2 + 4, ractx->history , 4*sizeof(*buffer2));
  163. do_hybrid_window(10, 8, 20, buffer2, temp2, ractx->st2a, ractx->st2b,
  164. gain_window);
  165. if (!eval_lpc_coeffs(temp2, ractx->st2, 10))
  166. colmult(ractx->pr2, ractx->st2, gain_bw_tab, 10);
  167. }
  168. /* Decode a block (celp) */
  169. static int ra288_decode_frame(AVCodecContext * avctx, void *data,
  170. int *data_size, const uint8_t * buf,
  171. int buf_size)
  172. {
  173. int16_t *out = data;
  174. int x, y;
  175. RA288Context *ractx = avctx->priv_data;
  176. GetBitContext gb;
  177. if (buf_size < avctx->block_align) {
  178. av_log(avctx, AV_LOG_ERROR,
  179. "Error! Input buffer is too small [%d<%d]\n",
  180. buf_size, avctx->block_align);
  181. return 0;
  182. }
  183. init_get_bits(&gb, buf, avctx->block_align * 8);
  184. for (x=0; x < 32; x++) {
  185. float gain = amptable[get_bits(&gb, 3)];
  186. int cb_coef = get_bits(&gb, 6 + (x&1));
  187. ractx->phase = x & 7;
  188. decode(ractx, gain, cb_coef);
  189. for (y=0; y < 5; y++)
  190. *(out++) = 8 * ractx->output[ractx->phase*5 + y];
  191. if (ractx->phase == 3)
  192. backward_filter(ractx);
  193. }
  194. *data_size = (char *)out - (char *)data;
  195. return avctx->block_align;
  196. }
  197. AVCodec ra_288_decoder =
  198. {
  199. "real_288",
  200. CODEC_TYPE_AUDIO,
  201. CODEC_ID_RA_288,
  202. sizeof(RA288Context),
  203. NULL,
  204. NULL,
  205. NULL,
  206. ra288_decode_frame,
  207. .long_name = NULL_IF_CONFIG_SMALL("RealAudio 2.0 (28.8K)"),
  208. };