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.

401 lines
11KB

  1. /*
  2. * Real Audio 1.0 (14.4K)
  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. #include "bitstream.h"
  23. #include "ra144.h"
  24. #define NBLOCKS 4 ///< number of subblocks within a block
  25. #define BLOCKSIZE 40 ///< subblock size in 16-bit words
  26. #define BUFFERSIZE 146 ///< the size of the adaptive codebook
  27. typedef struct {
  28. unsigned int old_energy; ///< previous frame energy
  29. unsigned int lpc_tables[2][10];
  30. unsigned int *lpc_coef; ///< LPC coefficients
  31. unsigned int *lpc_coef_old; ///< previous frame LPC coefficients
  32. unsigned int lpc_refl_rms;
  33. unsigned int lpc_refl_rms_old;
  34. /** the current subblock padded by the last 10 values of the previous one*/
  35. int16_t curr_sblock[50];
  36. /** adaptive codebook. Its size is two units bigger to avoid a
  37. * buffer overflow */
  38. uint16_t adapt_cb[148];
  39. } RA144Context;
  40. static int ra144_decode_init(AVCodecContext * avctx)
  41. {
  42. RA144Context *ractx = avctx->priv_data;
  43. ractx->lpc_coef = ractx->lpc_tables[0];
  44. ractx->lpc_coef_old = ractx->lpc_tables[1];
  45. return 0;
  46. }
  47. /**
  48. * Evaluate sqrt(x << 24). x must fit in 20 bits. This value is evaluated in an
  49. * odd way to make the output identical to the binary decoder.
  50. */
  51. static int t_sqrt(unsigned int x)
  52. {
  53. int s = 2;
  54. while (x > 0xfff) {
  55. s++;
  56. x = x >> 2;
  57. }
  58. return ff_sqrt(x << 20) << s;
  59. }
  60. /**
  61. * Evaluate the LPC filter coefficients from the reflection coefficients.
  62. * Does the inverse of the eval_refl() function.
  63. */
  64. static void eval_coefs(const int *refl, int *coefs)
  65. {
  66. int buffer[10];
  67. int *b1 = buffer;
  68. int *b2 = coefs;
  69. int x, y;
  70. for (x=0; x < 10; x++) {
  71. b1[x] = refl[x] << 4;
  72. for (y=0; y < x; y++)
  73. b1[y] = ((refl[x] * b2[x-y-1]) >> 12) + b2[y];
  74. FFSWAP(int *, b1, b2);
  75. }
  76. for (x=0; x < 10; x++)
  77. coefs[x] >>= 4;
  78. }
  79. /**
  80. * Copy the last offset values of *source to *target. If those values are not
  81. * enough to fill the target buffer, fill it with another copy of those values.
  82. */
  83. static void copy_and_dup(const int16_t *source, int16_t *target, int offset)
  84. {
  85. source += BUFFERSIZE - offset;
  86. if (offset > BLOCKSIZE) {
  87. memcpy(target, source, BLOCKSIZE*sizeof(*target));
  88. } else {
  89. memcpy(target, source, offset*sizeof(*target));
  90. memcpy(target + offset, source, (BLOCKSIZE - offset)*sizeof(*target));
  91. }
  92. }
  93. /** inverse root mean square */
  94. static int irms(const int16_t *data, int factor)
  95. {
  96. unsigned int i, sum = 0;
  97. for (i=0; i < BLOCKSIZE; i++)
  98. sum += data[i] * data[i];
  99. if (sum == 0)
  100. return 0; /* OOPS - division by zero */
  101. return (0x20000000 / (t_sqrt(sum) >> 8)) * factor;
  102. }
  103. static void add_wav(int n, int skip_first, int *m, const int16_t *s1,
  104. const int8_t *s2, const int8_t *s3, int16_t *dest)
  105. {
  106. int i;
  107. int v[3];
  108. v[0] = 0;
  109. for (i=!skip_first; i<3; i++)
  110. v[i] = (gain_val_tab[n][i] * m[i]) >> (gain_exp_tab[n][i] + 1);
  111. for (i=0; i < BLOCKSIZE; i++)
  112. dest[i] = ((*(s1++))*v[0] + (*(s2++))*v[1] + (*(s3++))*v[2]) >> 12;
  113. }
  114. /**
  115. * LPC Filter. Each output value is predicted from the 10 previous computed
  116. * ones. It overwrites the input with the output.
  117. *
  118. * @param in the input of the filter. It should be an array of size len + 10.
  119. * The 10 first input values are used to evaluate the first filtered one.
  120. */
  121. static void lpc_filter(const int16_t *lpc_coefs, uint16_t *in, int len)
  122. {
  123. int x, i;
  124. int16_t *ptr = in;
  125. for (i=0; i<len; i++) {
  126. int sum = 0;
  127. int new_val;
  128. for(x=0; x<10; x++)
  129. sum += lpc_coefs[9-x] * ptr[x];
  130. sum >>= 12;
  131. new_val = ptr[10] - sum;
  132. if (new_val < -32768 || new_val > 32767) {
  133. memset(in, 0, 100);
  134. return;
  135. }
  136. ptr[10] = new_val;
  137. ptr++;
  138. }
  139. }
  140. static unsigned int rescale_rms(int rms, int energy)
  141. {
  142. return (rms * energy) >> 10;
  143. }
  144. static unsigned int rms(const int *data)
  145. {
  146. int x;
  147. unsigned int res = 0x10000;
  148. int b = 0;
  149. for (x=0; x<10; x++) {
  150. res = (((0x1000000 - (*data) * (*data)) >> 12) * res) >> 12;
  151. if (res == 0)
  152. return 0;
  153. while (res <= 0x3fff) {
  154. b++;
  155. res <<= 2;
  156. }
  157. data++;
  158. }
  159. if (res > 0)
  160. res = t_sqrt(res);
  161. res >>= (b + 10);
  162. return res;
  163. }
  164. static void do_output_subblock(RA144Context *ractx,
  165. const uint16_t *lpc_coefs, unsigned int gval,
  166. GetBitContext *gb)
  167. {
  168. uint16_t buffer_a[40];
  169. uint16_t *block;
  170. int cba_idx = get_bits(gb, 7); // index of the adaptive CB, 0 if none
  171. int gain = get_bits(gb, 8);
  172. int cb1_idx = get_bits(gb, 7);
  173. int cb2_idx = get_bits(gb, 7);
  174. int m[3];
  175. if (cba_idx) {
  176. cba_idx += BLOCKSIZE/2 - 1;
  177. copy_and_dup(ractx->adapt_cb, buffer_a, cba_idx);
  178. m[0] = irms(buffer_a, gval) >> 12;
  179. } else {
  180. m[0] = 0;
  181. }
  182. m[1] = ((cb1_base[cb1_idx] >> 4) * gval) >> 8;
  183. m[2] = ((cb2_base[cb2_idx] >> 4) * gval) >> 8;
  184. memmove(ractx->adapt_cb, ractx->adapt_cb + BLOCKSIZE,
  185. (BUFFERSIZE - BLOCKSIZE) * 2);
  186. block = ractx->adapt_cb + BUFFERSIZE - BLOCKSIZE;
  187. add_wav(gain, cba_idx, m, buffer_a, cb1_vects[cb1_idx], cb2_vects[cb2_idx],
  188. block);
  189. memcpy(ractx->curr_sblock, ractx->curr_sblock + 40,
  190. 10*sizeof(*ractx->curr_sblock));
  191. memcpy(ractx->curr_sblock + 10, block,
  192. BLOCKSIZE*sizeof(*ractx->curr_sblock));
  193. lpc_filter(lpc_coefs, ractx->curr_sblock, BLOCKSIZE);
  194. }
  195. static void int_to_int16(int16_t *out, const int *inp)
  196. {
  197. int i;
  198. for (i=0; i<30; i++)
  199. *(out++) = *(inp++);
  200. }
  201. /**
  202. * Evaluate the reflection coefficients from the filter coefficients.
  203. * Does the inverse of the eval_coefs() function.
  204. *
  205. * @return 1 if one of the reflection coefficients is of magnitude greater than
  206. * 4095, 0 if not.
  207. */
  208. static int eval_refl(const int16_t *coefs, int *refl, RA144Context *ractx)
  209. {
  210. int retval = 0;
  211. int b, c, i;
  212. unsigned int u;
  213. int buffer1[10];
  214. int buffer2[10];
  215. int *bp1 = buffer1;
  216. int *bp2 = buffer2;
  217. for (i=0; i < 10; i++)
  218. buffer2[i] = coefs[i];
  219. u = refl[9] = bp2[9];
  220. if (u + 0x1000 > 0x1fff) {
  221. av_log(ractx, AV_LOG_ERROR, "Overflow. Broken sample?\n");
  222. return 0;
  223. }
  224. for (c=8; c >= 0; c--) {
  225. if (u == 0x1000)
  226. u++;
  227. if (u == 0xfffff000)
  228. u--;
  229. b = 0x1000-((u * u) >> 12);
  230. if (b == 0)
  231. b++;
  232. for (u=0; u<=c; u++)
  233. bp1[u] = ((bp2[u] - ((refl[c+1] * bp2[c-u]) >> 12)) * (0x1000000 / b)) >> 12;
  234. refl[c] = u = bp1[c];
  235. if ((u + 0x1000) > 0x1fff)
  236. retval = 1;
  237. FFSWAP(int *, bp1, bp2);
  238. }
  239. return retval;
  240. }
  241. static int interp(RA144Context *ractx, int16_t *out, int block_num,
  242. int copynew, int energy)
  243. {
  244. int work[10];
  245. int a = block_num + 1;
  246. int b = NBLOCKS - a;
  247. int x;
  248. // Interpolate block coefficients from the this frame forth block and
  249. // last frame forth block
  250. for (x=0; x<30; x++)
  251. out[x] = (a * ractx->lpc_coef[x] + b * ractx->lpc_coef_old[x])>> 2;
  252. if (eval_refl(out, work, ractx)) {
  253. // The interpolated coefficients are unstable, copy either new or old
  254. // coefficients
  255. if (copynew) {
  256. int_to_int16(out, ractx->lpc_coef);
  257. return rescale_rms(ractx->lpc_refl_rms, energy);
  258. } else {
  259. int_to_int16(out, ractx->lpc_coef_old);
  260. return rescale_rms(ractx->lpc_refl_rms_old, energy);
  261. }
  262. } else {
  263. return rescale_rms(rms(work), energy);
  264. }
  265. }
  266. /* Uncompress one block (20 bytes -> 160*2 bytes) */
  267. static int ra144_decode_frame(AVCodecContext * avctx,
  268. void *vdata, int *data_size,
  269. const uint8_t * buf, int buf_size)
  270. {
  271. static const uint8_t sizes[10] = {6, 5, 5, 4, 4, 3, 3, 3, 3, 2};
  272. unsigned int refl_rms[4]; // RMS of the reflection coefficients
  273. uint16_t block_coefs[4][30]; // LPC coefficients of each sub-block
  274. unsigned int lpc_refl[10]; // LPC reflection coefficients of the frame
  275. int i, c;
  276. int16_t *data = vdata;
  277. unsigned int energy;
  278. RA144Context *ractx = avctx->priv_data;
  279. GetBitContext gb;
  280. if(buf_size < 20) {
  281. av_log(avctx, AV_LOG_ERROR,
  282. "Frame too small (%d bytes). Truncated file?\n", buf_size);
  283. *data_size = 0;
  284. return buf_size;
  285. }
  286. init_get_bits(&gb, buf, 20 * 8);
  287. for (i=0; i<10; i++)
  288. // "<< 1"? Doesn't this make one value out of two of the table useless?
  289. lpc_refl[i] = lpc_refl_cb[i][get_bits(&gb, sizes[i]) << 1];
  290. eval_coefs(lpc_refl, ractx->lpc_coef);
  291. ractx->lpc_refl_rms = rms(lpc_refl);
  292. energy = energy_tab[get_bits(&gb, 5) << 1]; // Useless table entries?
  293. refl_rms[0] = interp(ractx, block_coefs[0], 0, 0, ractx->old_energy);
  294. refl_rms[1] = interp(ractx, block_coefs[1], 1, energy > ractx->old_energy,
  295. t_sqrt(energy*ractx->old_energy) >> 12);
  296. refl_rms[2] = interp(ractx, block_coefs[2], 2, 1, energy);
  297. refl_rms[3] = rescale_rms(ractx->lpc_refl_rms, energy);
  298. int_to_int16(block_coefs[3], ractx->lpc_coef);
  299. for (c=0; c<4; c++) {
  300. do_output_subblock(ractx, block_coefs[c], refl_rms[c], &gb);
  301. for (i=0; i<BLOCKSIZE; i++)
  302. *data++ = av_clip_int16(ractx->curr_sblock[i + 10] << 2);
  303. }
  304. ractx->old_energy = energy;
  305. ractx->lpc_refl_rms_old = ractx->lpc_refl_rms;
  306. FFSWAP(unsigned int *, ractx->lpc_coef_old, ractx->lpc_coef);
  307. *data_size = 2*160;
  308. return 20;
  309. }
  310. AVCodec ra_144_decoder =
  311. {
  312. "real_144",
  313. CODEC_TYPE_AUDIO,
  314. CODEC_ID_RA_144,
  315. sizeof(RA144Context),
  316. ra144_decode_init,
  317. NULL,
  318. NULL,
  319. ra144_decode_frame,
  320. .long_name = NULL_IF_CONFIG_SMALL("RealAudio 1.0 (14.4K)"),
  321. };