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.

1131 lines
36KB

  1. /*
  2. * TwinVQ decoder
  3. * Copyright (c) 2009 Vitor Sessak
  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 "get_bits.h"
  23. #include "dsputil.h"
  24. #include "fft.h"
  25. #include "lsp.h"
  26. #include <math.h>
  27. #include <stdint.h>
  28. #include "twinvq_data.h"
  29. enum FrameType {
  30. FT_SHORT = 0, ///< Short frame (divided in n sub-blocks)
  31. FT_MEDIUM, ///< Medium frame (divided in m<n sub-blocks)
  32. FT_LONG, ///< Long frame (single sub-block + PPC)
  33. FT_PPC, ///< Periodic Peak Component (part of the long frame)
  34. };
  35. /**
  36. * Parameters and tables that are different for each frame type
  37. */
  38. struct FrameMode {
  39. uint8_t sub; ///< Number subblocks in each frame
  40. const uint16_t *bark_tab;
  41. /** number of distinct bark scale envelope values */
  42. uint8_t bark_env_size;
  43. const int16_t *bark_cb; ///< codebook for the bark scale envelope (BSE)
  44. uint8_t bark_n_coef;///< number of BSE CB coefficients to read
  45. uint8_t bark_n_bit; ///< number of bits of the BSE coefs
  46. //@{
  47. /** main codebooks for spectrum data */
  48. const int16_t *cb0;
  49. const int16_t *cb1;
  50. //@}
  51. uint8_t cb_len_read; ///< number of spectrum coefficients to read
  52. };
  53. /**
  54. * Parameters and tables that are different for every combination of
  55. * bitrate/sample rate
  56. */
  57. typedef struct {
  58. struct FrameMode fmode[3]; ///< frame type-dependant parameters
  59. uint16_t size; ///< frame size in samples
  60. uint8_t n_lsp; ///< number of lsp coefficients
  61. const float *lspcodebook;
  62. /* number of bits of the different LSP CB coefficients */
  63. uint8_t lsp_bit0;
  64. uint8_t lsp_bit1;
  65. uint8_t lsp_bit2;
  66. uint8_t lsp_split; ///< number of CB entries for the LSP decoding
  67. const int16_t *ppc_shape_cb; ///< PPC shape CB
  68. /** number of the bits for the PPC period value */
  69. uint8_t ppc_period_bit;
  70. uint8_t ppc_shape_bit; ///< number of bits of the PPC shape CB coeffs
  71. uint8_t ppc_shape_len; ///< size of PPC shape CB
  72. uint8_t pgain_bit; ///< bits for PPC gain
  73. /** constant for peak period to peak width conversion */
  74. uint16_t peak_per2wid;
  75. } ModeTab;
  76. static const ModeTab mode_08_08 = {
  77. {
  78. { 8, bark_tab_s08_64, 10, tab.fcb08s , 1, 5, tab.cb0808s0, tab.cb0808s1, 18},
  79. { 2, bark_tab_m08_256, 20, tab.fcb08m , 2, 5, tab.cb0808m0, tab.cb0808m1, 16},
  80. { 1, bark_tab_l08_512, 30, tab.fcb08l , 3, 6, tab.cb0808l0, tab.cb0808l1, 17}
  81. },
  82. 512 , 12, tab.lsp08, 1, 5, 3, 3, tab.shape08 , 8, 28, 20, 6, 40
  83. };
  84. static const ModeTab mode_11_08 = {
  85. {
  86. { 8, bark_tab_s11_64, 10, tab.fcb11s , 1, 5, tab.cb1108s0, tab.cb1108s1, 29},
  87. { 2, bark_tab_m11_256, 20, tab.fcb11m , 2, 5, tab.cb1108m0, tab.cb1108m1, 24},
  88. { 1, bark_tab_l11_512, 30, tab.fcb11l , 3, 6, tab.cb1108l0, tab.cb1108l1, 27}
  89. },
  90. 512 , 16, tab.lsp11, 1, 6, 4, 3, tab.shape11 , 9, 36, 30, 7, 90
  91. };
  92. static const ModeTab mode_11_10 = {
  93. {
  94. { 8, bark_tab_s11_64, 10, tab.fcb11s , 1, 5, tab.cb1110s0, tab.cb1110s1, 21},
  95. { 2, bark_tab_m11_256, 20, tab.fcb11m , 2, 5, tab.cb1110m0, tab.cb1110m1, 18},
  96. { 1, bark_tab_l11_512, 30, tab.fcb11l , 3, 6, tab.cb1110l0, tab.cb1110l1, 20}
  97. },
  98. 512 , 16, tab.lsp11, 1, 6, 4, 3, tab.shape11 , 9, 36, 30, 7, 90
  99. };
  100. static const ModeTab mode_16_16 = {
  101. {
  102. { 8, bark_tab_s16_128, 10, tab.fcb16s , 1, 5, tab.cb1616s0, tab.cb1616s1, 16},
  103. { 2, bark_tab_m16_512, 20, tab.fcb16m , 2, 5, tab.cb1616m0, tab.cb1616m1, 15},
  104. { 1, bark_tab_l16_1024,30, tab.fcb16l , 3, 6, tab.cb1616l0, tab.cb1616l1, 16}
  105. },
  106. 1024, 16, tab.lsp16, 1, 6, 4, 3, tab.shape16 , 9, 56, 60, 7, 180
  107. };
  108. static const ModeTab mode_22_20 = {
  109. {
  110. { 8, bark_tab_s22_128, 10, tab.fcb22s_1, 1, 6, tab.cb2220s0, tab.cb2220s1, 18},
  111. { 2, bark_tab_m22_512, 20, tab.fcb22m_1, 2, 6, tab.cb2220m0, tab.cb2220m1, 17},
  112. { 1, bark_tab_l22_1024,32, tab.fcb22l_1, 4, 6, tab.cb2220l0, tab.cb2220l1, 18}
  113. },
  114. 1024, 16, tab.lsp22_1, 1, 6, 4, 3, tab.shape22_1, 9, 56, 36, 7, 144
  115. };
  116. static const ModeTab mode_22_24 = {
  117. {
  118. { 8, bark_tab_s22_128, 10, tab.fcb22s_1, 1, 6, tab.cb2224s0, tab.cb2224s1, 15},
  119. { 2, bark_tab_m22_512, 20, tab.fcb22m_1, 2, 6, tab.cb2224m0, tab.cb2224m1, 14},
  120. { 1, bark_tab_l22_1024,32, tab.fcb22l_1, 4, 6, tab.cb2224l0, tab.cb2224l1, 15}
  121. },
  122. 1024, 16, tab.lsp22_1, 1, 6, 4, 3, tab.shape22_1, 9, 56, 36, 7, 144
  123. };
  124. static const ModeTab mode_22_32 = {
  125. {
  126. { 4, bark_tab_s22_128, 10, tab.fcb22s_2, 1, 6, tab.cb2232s0, tab.cb2232s1, 11},
  127. { 2, bark_tab_m22_256, 20, tab.fcb22m_2, 2, 6, tab.cb2232m0, tab.cb2232m1, 11},
  128. { 1, bark_tab_l22_512, 32, tab.fcb22l_2, 4, 6, tab.cb2232l0, tab.cb2232l1, 12}
  129. },
  130. 512 , 16, tab.lsp22_2, 1, 6, 4, 4, tab.shape22_2, 9, 56, 36, 7, 72
  131. };
  132. static const ModeTab mode_44_40 = {
  133. {
  134. {16, bark_tab_s44_128, 10, tab.fcb44s , 1, 6, tab.cb4440s0, tab.cb4440s1, 18},
  135. { 4, bark_tab_m44_512, 20, tab.fcb44m , 2, 6, tab.cb4440m0, tab.cb4440m1, 17},
  136. { 1, bark_tab_l44_2048,40, tab.fcb44l , 4, 6, tab.cb4440l0, tab.cb4440l1, 17}
  137. },
  138. 2048, 20, tab.lsp44, 1, 6, 4, 4, tab.shape44 , 9, 84, 54, 7, 432
  139. };
  140. static const ModeTab mode_44_48 = {
  141. {
  142. {16, bark_tab_s44_128, 10, tab.fcb44s , 1, 6, tab.cb4448s0, tab.cb4448s1, 15},
  143. { 4, bark_tab_m44_512, 20, tab.fcb44m , 2, 6, tab.cb4448m0, tab.cb4448m1, 14},
  144. { 1, bark_tab_l44_2048,40, tab.fcb44l , 4, 6, tab.cb4448l0, tab.cb4448l1, 14}
  145. },
  146. 2048, 20, tab.lsp44, 1, 6, 4, 4, tab.shape44 , 9, 84, 54, 7, 432
  147. };
  148. typedef struct TwinContext {
  149. AVCodecContext *avctx;
  150. DSPContext dsp;
  151. FFTContext mdct_ctx[3];
  152. const ModeTab *mtab;
  153. // history
  154. float lsp_hist[2][20]; ///< LSP coefficients of the last frame
  155. float bark_hist[3][2][40]; ///< BSE coefficients of last frame
  156. // bitstream parameters
  157. int16_t permut[4][4096];
  158. uint8_t length[4][2]; ///< main codebook stride
  159. uint8_t length_change[4];
  160. uint8_t bits_main_spec[2][4][2]; ///< bits for the main codebook
  161. int bits_main_spec_change[4];
  162. int n_div[4];
  163. float *spectrum;
  164. float *curr_frame; ///< non-interleaved output
  165. float *prev_frame; ///< non-interleaved previous frame
  166. int last_block_pos[2];
  167. float *cos_tabs[3];
  168. // scratch buffers
  169. float *tmp_buf;
  170. } TwinContext;
  171. #define PPC_SHAPE_CB_SIZE 64
  172. #define SUB_AMP_MAX 4500.0
  173. #define MULAW_MU 100.0
  174. #define GAIN_BITS 8
  175. #define AMP_MAX 13000.0
  176. #define SUB_GAIN_BITS 5
  177. #define WINDOW_TYPE_BITS 4
  178. #define PGAIN_MU 200
  179. /** @note not speed critical, hence not optimized */
  180. static void memset_float(float *buf, float val, int size)
  181. {
  182. while (size--)
  183. *buf++ = val;
  184. }
  185. /**
  186. * Evaluate a single LPC amplitude spectrum envelope coefficient from the line
  187. * spectrum pairs.
  188. *
  189. * @param lsp a vector of the cosinus of the LSP values
  190. * @param cos_val cos(PI*i/N) where i is the index of the LPC amplitude
  191. * @param order the order of the LSP (and the size of the *lsp buffer). Must
  192. * be a multiple of four.
  193. * @return the LPC value
  194. *
  195. * @todo reuse code from vorbis_dec.c: vorbis_floor0_decode
  196. */
  197. static float eval_lpc_spectrum(const float *lsp, float cos_val, int order)
  198. {
  199. int j;
  200. float p = 0.5f;
  201. float q = 0.5f;
  202. float two_cos_w = 2.0f*cos_val;
  203. for (j = 0; j + 1 < order; j += 2*2) {
  204. // Unroll the loop once since order is a multiple of four
  205. q *= lsp[j ] - two_cos_w;
  206. p *= lsp[j+1] - two_cos_w;
  207. q *= lsp[j+2] - two_cos_w;
  208. p *= lsp[j+3] - two_cos_w;
  209. }
  210. p *= p * (2.0f - two_cos_w);
  211. q *= q * (2.0f + two_cos_w);
  212. return 0.5 / (p + q);
  213. }
  214. /**
  215. * Evaluates the LPC amplitude spectrum envelope from the line spectrum pairs.
  216. */
  217. static void eval_lpcenv(TwinContext *tctx, const float *cos_vals, float *lpc)
  218. {
  219. int i;
  220. const ModeTab *mtab = tctx->mtab;
  221. int size_s = mtab->size / mtab->fmode[FT_SHORT].sub;
  222. for (i = 0; i < size_s/2; i++) {
  223. float cos_i = tctx->cos_tabs[0][i];
  224. lpc[i] = eval_lpc_spectrum(cos_vals, cos_i, mtab->n_lsp);
  225. lpc[size_s-i-1] = eval_lpc_spectrum(cos_vals, -cos_i, mtab->n_lsp);
  226. }
  227. }
  228. static void interpolate(float *out, float v1, float v2, int size)
  229. {
  230. int i;
  231. float step = (v1 - v2)/(size + 1);
  232. for (i = 0; i < size; i++) {
  233. v2 += step;
  234. out[i] = v2;
  235. }
  236. }
  237. static inline float get_cos(int idx, int part, const float *cos_tab, int size)
  238. {
  239. return part ? -cos_tab[size - idx - 1] :
  240. cos_tab[ idx ];
  241. }
  242. /**
  243. * Evaluates the LPC amplitude spectrum envelope from the line spectrum pairs.
  244. * Probably for speed reasons, the coefficients are evaluated as
  245. * siiiibiiiisiiiibiiiisiiiibiiiisiiiibiiiis ...
  246. * where s is an evaluated value, i is a value interpolated from the others
  247. * and b might be either calculated or interpolated, depending on an
  248. * unexplained condition.
  249. *
  250. * @param step the size of a block "siiiibiiii"
  251. * @param in the cosinus of the LSP data
  252. * @param part is 0 for 0...PI (positive cossinus values) and 1 for PI...2PI
  253. (negative cossinus values)
  254. * @param size the size of the whole output
  255. */
  256. static inline void eval_lpcenv_or_interp(TwinContext *tctx,
  257. enum FrameType ftype,
  258. float *out, const float *in,
  259. int size, int step, int part)
  260. {
  261. int i;
  262. const ModeTab *mtab = tctx->mtab;
  263. const float *cos_tab = tctx->cos_tabs[ftype];
  264. // Fill the 's'
  265. for (i = 0; i < size; i += step)
  266. out[i] =
  267. eval_lpc_spectrum(in,
  268. get_cos(i, part, cos_tab, size),
  269. mtab->n_lsp);
  270. // Fill the 'iiiibiiii'
  271. for (i = step; i <= size - 2*step; i += step) {
  272. if (out[i + step] + out[i - step] > 1.95*out[i] ||
  273. out[i + step] >= out[i - step]) {
  274. interpolate(out + i - step + 1, out[i], out[i-step], step - 1);
  275. } else {
  276. out[i - step/2] =
  277. eval_lpc_spectrum(in,
  278. get_cos(i-step/2, part, cos_tab, size),
  279. mtab->n_lsp);
  280. interpolate(out + i - step + 1, out[i-step/2], out[i-step ], step/2 - 1);
  281. interpolate(out + i - step/2 + 1, out[i ], out[i-step/2], step/2 - 1);
  282. }
  283. }
  284. interpolate(out + size - 2*step + 1, out[size-step], out[size - 2*step], step - 1);
  285. }
  286. static void eval_lpcenv_2parts(TwinContext *tctx, enum FrameType ftype,
  287. const float *buf, float *lpc,
  288. int size, int step)
  289. {
  290. eval_lpcenv_or_interp(tctx, ftype, lpc , buf, size/2, step, 0);
  291. eval_lpcenv_or_interp(tctx, ftype, lpc + size/2, buf, size/2, 2*step, 1);
  292. interpolate(lpc+size/2-step+1, lpc[size/2], lpc[size/2-step], step);
  293. memset_float(lpc + size - 2*step + 1, lpc[size - 2*step], 2*step - 1);
  294. }
  295. /**
  296. * Inverse quantization. Read CB coefficients for cb1 and cb2 from the
  297. * bitstream, sum the corresponding vectors and write the result to *out
  298. * after permutation.
  299. */
  300. static void dequant(TwinContext *tctx, GetBitContext *gb, float *out,
  301. enum FrameType ftype,
  302. const int16_t *cb0, const int16_t *cb1, int cb_len)
  303. {
  304. int pos = 0;
  305. int i, j;
  306. for (i = 0; i < tctx->n_div[ftype]; i++) {
  307. int tmp0, tmp1;
  308. int sign0 = 1;
  309. int sign1 = 1;
  310. const int16_t *tab0, *tab1;
  311. int length = tctx->length[ftype][i >= tctx->length_change[ftype]];
  312. int bitstream_second_part = (i >= tctx->bits_main_spec_change[ftype]);
  313. int bits = tctx->bits_main_spec[0][ftype][bitstream_second_part];
  314. if (bits == 7) {
  315. if (get_bits1(gb))
  316. sign0 = -1;
  317. bits = 6;
  318. }
  319. tmp0 = get_bits(gb, bits);
  320. bits = tctx->bits_main_spec[1][ftype][bitstream_second_part];
  321. if (bits == 7) {
  322. if (get_bits1(gb))
  323. sign1 = -1;
  324. bits = 6;
  325. }
  326. tmp1 = get_bits(gb, bits);
  327. tab0 = cb0 + tmp0*cb_len;
  328. tab1 = cb1 + tmp1*cb_len;
  329. for (j = 0; j < length; j++)
  330. out[tctx->permut[ftype][pos+j]] = sign0*tab0[j] + sign1*tab1[j];
  331. pos += length;
  332. }
  333. }
  334. static inline float mulawinv(float y, float clip, float mu)
  335. {
  336. y = av_clipf(y/clip, -1, 1);
  337. return clip * FFSIGN(y) * (exp(log(1+mu) * fabs(y)) - 1) / mu;
  338. }
  339. /**
  340. * Evaluate a*b/400 rounded to the nearest integer. When, for example,
  341. * a*b == 200 and the nearest integer is ill-defined, use a table to emulate
  342. * the following broken float-based implementation used by the binary decoder:
  343. *
  344. * \code
  345. * static int very_broken_op(int a, int b)
  346. * {
  347. * static float test; // Ugh, force gcc to do the division first...
  348. *
  349. * test = a/400.;
  350. * return b * test + 0.5;
  351. * }
  352. * \endcode
  353. *
  354. * @note if this function is replaced by just ROUNDED_DIV(a*b,400.), the stddev
  355. * between the original file (before encoding with Yamaha encoder) and the
  356. * decoded output increases, which leads one to believe that the encoder expects
  357. * exactly this broken calculation.
  358. */
  359. static int very_broken_op(int a, int b)
  360. {
  361. int x = a*b + 200;
  362. int size;
  363. const uint8_t *rtab;
  364. if (x%400 || b%5)
  365. return x/400;
  366. x /= 400;
  367. size = tabs[b/5].size;
  368. rtab = tabs[b/5].tab;
  369. return x - rtab[size*av_log2(2*(x - 1)/size)+(x - 1)%size];
  370. }
  371. /**
  372. * Sum to data a periodic peak of a given period, width and shape.
  373. *
  374. * @param period the period of the peak divised by 400.0
  375. */
  376. static void add_peak(int period, int width, const float *shape,
  377. float ppc_gain, float *speech, int len)
  378. {
  379. int i, j;
  380. const float *shape_end = shape + len;
  381. int center;
  382. // First peak centered around zero
  383. for (i = 0; i < width/2; i++)
  384. speech[i] += ppc_gain * *shape++;
  385. for (i = 1; i < ROUNDED_DIV(len,width) ; i++) {
  386. center = very_broken_op(period, i);
  387. for (j = -width/2; j < (width+1)/2; j++)
  388. speech[j+center] += ppc_gain * *shape++;
  389. }
  390. // For the last block, be careful not to go beyond the end of the buffer
  391. center = very_broken_op(period, i);
  392. for (j = -width/2; j < (width + 1)/2 && shape < shape_end; j++)
  393. speech[j+center] += ppc_gain * *shape++;
  394. }
  395. static void decode_ppc(TwinContext *tctx, int period_coef, const float *shape,
  396. float ppc_gain, float *speech)
  397. {
  398. const ModeTab *mtab = tctx->mtab;
  399. int isampf = tctx->avctx->sample_rate/1000;
  400. int ibps = tctx->avctx->bit_rate/(1000 * tctx->avctx->channels);
  401. int min_period = ROUNDED_DIV( 40*2*mtab->size, isampf);
  402. int max_period = ROUNDED_DIV(6*40*2*mtab->size, isampf);
  403. int period_range = max_period - min_period;
  404. // This is actually the period multiplied by 400. It is just linearly coded
  405. // between its maximum and minimum value.
  406. int period = min_period +
  407. ROUNDED_DIV(period_coef*period_range, (1 << mtab->ppc_period_bit) - 1);
  408. int width;
  409. if (isampf == 22 && ibps == 32) {
  410. // For some unknown reason, NTT decided to code this case differently...
  411. width = ROUNDED_DIV((period + 800)* mtab->peak_per2wid, 400*mtab->size);
  412. } else
  413. width = (period )* mtab->peak_per2wid/(400*mtab->size);
  414. add_peak(period, width, shape, ppc_gain, speech, mtab->ppc_shape_len);
  415. }
  416. static void dec_gain(TwinContext *tctx, GetBitContext *gb, enum FrameType ftype,
  417. float *out)
  418. {
  419. const ModeTab *mtab = tctx->mtab;
  420. int i, j;
  421. int sub = mtab->fmode[ftype].sub;
  422. float step = AMP_MAX / ((1 << GAIN_BITS) - 1);
  423. float sub_step = SUB_AMP_MAX / ((1 << SUB_GAIN_BITS) - 1);
  424. if (ftype == FT_LONG) {
  425. for (i = 0; i < tctx->avctx->channels; i++)
  426. out[i] = (1./(1<<13)) *
  427. mulawinv(step * 0.5 + step * get_bits(gb, GAIN_BITS),
  428. AMP_MAX, MULAW_MU);
  429. } else {
  430. for (i = 0; i < tctx->avctx->channels; i++) {
  431. float val = (1./(1<<23)) *
  432. mulawinv(step * 0.5 + step * get_bits(gb, GAIN_BITS),
  433. AMP_MAX, MULAW_MU);
  434. for (j = 0; j < sub; j++) {
  435. out[i*sub + j] =
  436. val*mulawinv(sub_step* 0.5 +
  437. sub_step* get_bits(gb, SUB_GAIN_BITS),
  438. SUB_AMP_MAX, MULAW_MU);
  439. }
  440. }
  441. }
  442. }
  443. /**
  444. * Rearrange the LSP coefficients so that they have a minimum distance of
  445. * min_dist. This function does it exactly as described in section of 3.2.4
  446. * of the G.729 specification (but interestingly is different from what the
  447. * reference decoder actually does).
  448. */
  449. static void rearrange_lsp(int order, float *lsp, float min_dist)
  450. {
  451. int i;
  452. float min_dist2 = min_dist * 0.5;
  453. for (i = 1; i < order; i++)
  454. if (lsp[i] - lsp[i-1] < min_dist) {
  455. float avg = (lsp[i] + lsp[i-1]) * 0.5;
  456. lsp[i-1] = avg - min_dist2;
  457. lsp[i ] = avg + min_dist2;
  458. }
  459. }
  460. static void decode_lsp(TwinContext *tctx, int lpc_idx1, uint8_t *lpc_idx2,
  461. int lpc_hist_idx, float *lsp, float *hist)
  462. {
  463. const ModeTab *mtab = tctx->mtab;
  464. int i, j;
  465. const float *cb = mtab->lspcodebook;
  466. const float *cb2 = cb + (1 << mtab->lsp_bit1)*mtab->n_lsp;
  467. const float *cb3 = cb2 + (1 << mtab->lsp_bit2)*mtab->n_lsp;
  468. const int8_t funny_rounding[4] = {
  469. -2,
  470. mtab->lsp_split == 4 ? -2 : 1,
  471. mtab->lsp_split == 4 ? -2 : 1,
  472. 0
  473. };
  474. j = 0;
  475. for (i = 0; i < mtab->lsp_split; i++) {
  476. int chunk_end = ((i + 1)*mtab->n_lsp + funny_rounding[i])/mtab->lsp_split;
  477. for (; j < chunk_end; j++)
  478. lsp[j] = cb [lpc_idx1 * mtab->n_lsp + j] +
  479. cb2[lpc_idx2[i] * mtab->n_lsp + j];
  480. }
  481. rearrange_lsp(mtab->n_lsp, lsp, 0.0001);
  482. for (i = 0; i < mtab->n_lsp; i++) {
  483. float tmp1 = 1. - cb3[lpc_hist_idx*mtab->n_lsp + i];
  484. float tmp2 = hist[i] * cb3[lpc_hist_idx*mtab->n_lsp + i];
  485. hist[i] = lsp[i];
  486. lsp[i] = lsp[i] * tmp1 + tmp2;
  487. }
  488. rearrange_lsp(mtab->n_lsp, lsp, 0.0001);
  489. rearrange_lsp(mtab->n_lsp, lsp, 0.000095);
  490. ff_sort_nearly_sorted_floats(lsp, mtab->n_lsp);
  491. }
  492. static void dec_lpc_spectrum_inv(TwinContext *tctx, float *lsp,
  493. enum FrameType ftype, float *lpc)
  494. {
  495. int i;
  496. int size = tctx->mtab->size / tctx->mtab->fmode[ftype].sub;
  497. for (i = 0; i < tctx->mtab->n_lsp; i++)
  498. lsp[i] = 2*cos(lsp[i]);
  499. switch (ftype) {
  500. case FT_LONG:
  501. eval_lpcenv_2parts(tctx, ftype, lsp, lpc, size, 8);
  502. break;
  503. case FT_MEDIUM:
  504. eval_lpcenv_2parts(tctx, ftype, lsp, lpc, size, 2);
  505. break;
  506. case FT_SHORT:
  507. eval_lpcenv(tctx, lsp, lpc);
  508. break;
  509. }
  510. }
  511. static void imdct_and_window(TwinContext *tctx, enum FrameType ftype, int wtype,
  512. float *in, float *prev, int ch)
  513. {
  514. const ModeTab *mtab = tctx->mtab;
  515. int bsize = mtab->size / mtab->fmode[ftype].sub;
  516. int size = mtab->size;
  517. float *buf1 = tctx->tmp_buf;
  518. int j;
  519. int wsize; // Window size
  520. float *out = tctx->curr_frame + 2*ch*mtab->size;
  521. float *out2 = out;
  522. float *prev_buf;
  523. int first_wsize;
  524. static const uint8_t wtype_to_wsize[] = {0, 0, 2, 2, 2, 1, 0, 1, 1};
  525. int types_sizes[] = {
  526. mtab->size / mtab->fmode[FT_LONG ].sub,
  527. mtab->size / mtab->fmode[FT_MEDIUM].sub,
  528. mtab->size / (2*mtab->fmode[FT_SHORT ].sub),
  529. };
  530. wsize = types_sizes[wtype_to_wsize[wtype]];
  531. first_wsize = wsize;
  532. prev_buf = prev + (size - bsize)/2;
  533. for (j = 0; j < mtab->fmode[ftype].sub; j++) {
  534. int sub_wtype = ftype == FT_MEDIUM ? 8 : wtype;
  535. if (!j && wtype == 4)
  536. sub_wtype = 4;
  537. else if (j == mtab->fmode[ftype].sub-1 && wtype == 7)
  538. sub_wtype = 7;
  539. wsize = types_sizes[wtype_to_wsize[sub_wtype]];
  540. ff_imdct_half(&tctx->mdct_ctx[ftype], buf1 + bsize*j, in + bsize*j);
  541. tctx->dsp.vector_fmul_window(out2,
  542. prev_buf + (bsize-wsize)/2,
  543. buf1 + bsize*j,
  544. ff_sine_windows[av_log2(wsize)],
  545. 0.0,
  546. wsize/2);
  547. out2 += wsize;
  548. memcpy(out2, buf1 + bsize*j + wsize/2, (bsize - wsize/2)*sizeof(float));
  549. out2 += ftype == FT_MEDIUM ? (bsize-wsize)/2 : bsize - wsize;
  550. prev_buf = buf1 + bsize*j + bsize/2;
  551. }
  552. tctx->last_block_pos[ch] = (size + first_wsize)/2;
  553. }
  554. static void imdct_output(TwinContext *tctx, enum FrameType ftype, int wtype,
  555. float *out)
  556. {
  557. const ModeTab *mtab = tctx->mtab;
  558. float *prev_buf = tctx->prev_frame + tctx->last_block_pos[0];
  559. int i, j;
  560. for (i = 0; i < tctx->avctx->channels; i++) {
  561. imdct_and_window(tctx, ftype, wtype,
  562. tctx->spectrum + i*mtab->size,
  563. prev_buf + 2*i*mtab->size,
  564. i);
  565. }
  566. if (tctx->avctx->channels == 2) {
  567. for (i = 0; i < mtab->size - tctx->last_block_pos[0]; i++) {
  568. float f1 = prev_buf[ i];
  569. float f2 = prev_buf[2*mtab->size + i];
  570. out[2*i ] = f1 + f2;
  571. out[2*i + 1] = f1 - f2;
  572. }
  573. for (j = 0; i < mtab->size; j++,i++) {
  574. float f1 = tctx->curr_frame[ j];
  575. float f2 = tctx->curr_frame[2*mtab->size + j];
  576. out[2*i ] = f1 + f2;
  577. out[2*i + 1] = f1 - f2;
  578. }
  579. } else {
  580. memcpy(out, prev_buf,
  581. (mtab->size - tctx->last_block_pos[0]) * sizeof(*out));
  582. out += mtab->size - tctx->last_block_pos[0];
  583. memcpy(out, tctx->curr_frame,
  584. (tctx->last_block_pos[0]) * sizeof(*out));
  585. }
  586. }
  587. static void dec_bark_env(TwinContext *tctx, const uint8_t *in, int use_hist,
  588. int ch, float *out, float gain, enum FrameType ftype)
  589. {
  590. const ModeTab *mtab = tctx->mtab;
  591. int i,j;
  592. float *hist = tctx->bark_hist[ftype][ch];
  593. float val = ((const float []) {0.4, 0.35, 0.28})[ftype];
  594. int bark_n_coef = mtab->fmode[ftype].bark_n_coef;
  595. int fw_cb_len = mtab->fmode[ftype].bark_env_size / bark_n_coef;
  596. int idx = 0;
  597. for (i = 0; i < fw_cb_len; i++)
  598. for (j = 0; j < bark_n_coef; j++, idx++) {
  599. float tmp2 =
  600. mtab->fmode[ftype].bark_cb[fw_cb_len*in[j] + i] * (1./4096);
  601. float st = use_hist ?
  602. (1. - val) * tmp2 + val*hist[idx] + 1. : tmp2 + 1.;
  603. hist[idx] = tmp2;
  604. if (st < -1.) st = 1.;
  605. memset_float(out, st * gain, mtab->fmode[ftype].bark_tab[idx]);
  606. out += mtab->fmode[ftype].bark_tab[idx];
  607. }
  608. }
  609. static void read_and_decode_spectrum(TwinContext *tctx, GetBitContext *gb,
  610. float *out, enum FrameType ftype)
  611. {
  612. const ModeTab *mtab = tctx->mtab;
  613. int channels = tctx->avctx->channels;
  614. int sub = mtab->fmode[ftype].sub;
  615. int block_size = mtab->size / sub;
  616. float gain[channels*sub];
  617. float ppc_shape[mtab->ppc_shape_len * channels * 4];
  618. uint8_t bark1[channels][sub][mtab->fmode[ftype].bark_n_coef];
  619. uint8_t bark_use_hist[channels][sub];
  620. uint8_t lpc_idx1[channels];
  621. uint8_t lpc_idx2[channels][tctx->mtab->lsp_split];
  622. uint8_t lpc_hist_idx[channels];
  623. int i, j, k;
  624. dequant(tctx, gb, out, ftype,
  625. mtab->fmode[ftype].cb0, mtab->fmode[ftype].cb1,
  626. mtab->fmode[ftype].cb_len_read);
  627. for (i = 0; i < channels; i++)
  628. for (j = 0; j < sub; j++)
  629. for (k = 0; k < mtab->fmode[ftype].bark_n_coef; k++)
  630. bark1[i][j][k] =
  631. get_bits(gb, mtab->fmode[ftype].bark_n_bit);
  632. for (i = 0; i < channels; i++)
  633. for (j = 0; j < sub; j++)
  634. bark_use_hist[i][j] = get_bits1(gb);
  635. dec_gain(tctx, gb, ftype, gain);
  636. for (i = 0; i < channels; i++) {
  637. lpc_hist_idx[i] = get_bits(gb, tctx->mtab->lsp_bit0);
  638. lpc_idx1 [i] = get_bits(gb, tctx->mtab->lsp_bit1);
  639. for (j = 0; j < tctx->mtab->lsp_split; j++)
  640. lpc_idx2[i][j] = get_bits(gb, tctx->mtab->lsp_bit2);
  641. }
  642. if (ftype == FT_LONG) {
  643. int cb_len_p = (tctx->n_div[3] + mtab->ppc_shape_len*channels - 1)/
  644. tctx->n_div[3];
  645. dequant(tctx, gb, ppc_shape, FT_PPC, mtab->ppc_shape_cb,
  646. mtab->ppc_shape_cb + cb_len_p*PPC_SHAPE_CB_SIZE, cb_len_p);
  647. }
  648. for (i = 0; i < channels; i++) {
  649. float *chunk = out + mtab->size * i;
  650. float lsp[tctx->mtab->n_lsp];
  651. for (j = 0; j < sub; j++) {
  652. dec_bark_env(tctx, bark1[i][j], bark_use_hist[i][j], i,
  653. tctx->tmp_buf, gain[sub*i+j], ftype);
  654. tctx->dsp.vector_fmul(chunk + block_size*j, tctx->tmp_buf,
  655. block_size);
  656. }
  657. if (ftype == FT_LONG) {
  658. float pgain_step = 25000. / ((1 << mtab->pgain_bit) - 1);
  659. int p_coef = get_bits(gb, tctx->mtab->ppc_period_bit);
  660. int g_coef = get_bits(gb, tctx->mtab->pgain_bit);
  661. float v = 1./8192*
  662. mulawinv(pgain_step*g_coef+ pgain_step/2, 25000., PGAIN_MU);
  663. decode_ppc(tctx, p_coef, ppc_shape + i*mtab->ppc_shape_len, v,
  664. chunk);
  665. }
  666. decode_lsp(tctx, lpc_idx1[i], lpc_idx2[i], lpc_hist_idx[i], lsp,
  667. tctx->lsp_hist[i]);
  668. dec_lpc_spectrum_inv(tctx, lsp, ftype, tctx->tmp_buf);
  669. for (j = 0; j < mtab->fmode[ftype].sub; j++) {
  670. tctx->dsp.vector_fmul(chunk, tctx->tmp_buf, block_size);
  671. chunk += block_size;
  672. }
  673. }
  674. }
  675. static int twin_decode_frame(AVCodecContext * avctx, void *data,
  676. int *data_size, AVPacket *avpkt)
  677. {
  678. const uint8_t *buf = avpkt->data;
  679. int buf_size = avpkt->size;
  680. TwinContext *tctx = avctx->priv_data;
  681. GetBitContext gb;
  682. const ModeTab *mtab = tctx->mtab;
  683. float *out = data;
  684. enum FrameType ftype;
  685. int window_type;
  686. static const enum FrameType wtype_to_ftype_table[] = {
  687. FT_LONG, FT_LONG, FT_SHORT, FT_LONG,
  688. FT_MEDIUM, FT_LONG, FT_LONG, FT_MEDIUM, FT_MEDIUM
  689. };
  690. if (buf_size*8 < avctx->bit_rate*mtab->size/avctx->sample_rate + 8) {
  691. av_log(avctx, AV_LOG_ERROR,
  692. "Frame too small (%d bytes). Truncated file?\n", buf_size);
  693. *data_size = 0;
  694. return buf_size;
  695. }
  696. init_get_bits(&gb, buf, buf_size * 8);
  697. skip_bits(&gb, get_bits(&gb, 8));
  698. window_type = get_bits(&gb, WINDOW_TYPE_BITS);
  699. if (window_type > 8) {
  700. av_log(avctx, AV_LOG_ERROR, "Invalid window type, broken sample?\n");
  701. return -1;
  702. }
  703. ftype = wtype_to_ftype_table[window_type];
  704. read_and_decode_spectrum(tctx, &gb, tctx->spectrum, ftype);
  705. imdct_output(tctx, ftype, window_type, out);
  706. FFSWAP(float*, tctx->curr_frame, tctx->prev_frame);
  707. if (tctx->avctx->frame_number < 2) {
  708. *data_size=0;
  709. return buf_size;
  710. }
  711. tctx->dsp.vector_clipf(out, out, -32700./(1<<15), 32700./(1<<15),
  712. avctx->channels * mtab->size);
  713. *data_size = mtab->size*avctx->channels*4;
  714. return buf_size;
  715. }
  716. /**
  717. * Init IMDCT and windowing tables
  718. */
  719. static av_cold void init_mdct_win(TwinContext *tctx)
  720. {
  721. int i,j;
  722. const ModeTab *mtab = tctx->mtab;
  723. int size_s = mtab->size / mtab->fmode[FT_SHORT].sub;
  724. int size_m = mtab->size / mtab->fmode[FT_MEDIUM].sub;
  725. int channels = tctx->avctx->channels;
  726. float norm = channels == 1 ? 2. : 1.;
  727. for (i = 0; i < 3; i++) {
  728. int bsize = tctx->mtab->size/tctx->mtab->fmode[i].sub;
  729. ff_mdct_init(&tctx->mdct_ctx[i], av_log2(bsize) + 1, 1,
  730. -sqrt(norm/bsize) / (1<<15));
  731. }
  732. tctx->tmp_buf = av_malloc(mtab->size * sizeof(*tctx->tmp_buf));
  733. tctx->spectrum = av_malloc(2*mtab->size*channels*sizeof(float));
  734. tctx->curr_frame = av_malloc(2*mtab->size*channels*sizeof(float));
  735. tctx->prev_frame = av_malloc(2*mtab->size*channels*sizeof(float));
  736. for (i = 0; i < 3; i++) {
  737. int m = 4*mtab->size/mtab->fmode[i].sub;
  738. double freq = 2*M_PI/m;
  739. tctx->cos_tabs[i] = av_malloc((m/4)*sizeof(*tctx->cos_tabs));
  740. for (j = 0; j <= m/8; j++)
  741. tctx->cos_tabs[i][j] = cos((2*j + 1)*freq);
  742. for (j = 1; j < m/8; j++)
  743. tctx->cos_tabs[i][m/4-j] = tctx->cos_tabs[i][j];
  744. }
  745. ff_init_ff_sine_windows(av_log2(size_m));
  746. ff_init_ff_sine_windows(av_log2(size_s/2));
  747. ff_init_ff_sine_windows(av_log2(mtab->size));
  748. }
  749. /**
  750. * Interpret the data as if it were a num_blocks x line_len[0] matrix and for
  751. * each line do a cyclic permutation, i.e.
  752. * abcdefghijklm -> defghijklmabc
  753. * where the amount to be shifted is evaluated depending on the column.
  754. */
  755. static void permutate_in_line(int16_t *tab, int num_vect, int num_blocks,
  756. int block_size,
  757. const uint8_t line_len[2], int length_div,
  758. enum FrameType ftype)
  759. {
  760. int i,j;
  761. for (i = 0; i < line_len[0]; i++) {
  762. int shift;
  763. if (num_blocks == 1 ||
  764. (ftype == FT_LONG && num_vect % num_blocks) ||
  765. (ftype != FT_LONG && num_vect & 1 ) ||
  766. i == line_len[1]) {
  767. shift = 0;
  768. } else if (ftype == FT_LONG) {
  769. shift = i;
  770. } else
  771. shift = i*i;
  772. for (j = 0; j < num_vect && (j+num_vect*i < block_size*num_blocks); j++)
  773. tab[i*num_vect+j] = i*num_vect + (j + shift) % num_vect;
  774. }
  775. }
  776. /**
  777. * Interpret the input data as in the following table:
  778. *
  779. * \verbatim
  780. *
  781. * abcdefgh
  782. * ijklmnop
  783. * qrstuvw
  784. * x123456
  785. *
  786. * \endverbatim
  787. *
  788. * and transpose it, giving the output
  789. * aiqxbjr1cks2dlt3emu4fvn5gow6hp
  790. */
  791. static void transpose_perm(int16_t *out, int16_t *in, int num_vect,
  792. const uint8_t line_len[2], int length_div)
  793. {
  794. int i,j;
  795. int cont= 0;
  796. for (i = 0; i < num_vect; i++)
  797. for (j = 0; j < line_len[i >= length_div]; j++)
  798. out[cont++] = in[j*num_vect + i];
  799. }
  800. static void linear_perm(int16_t *out, int16_t *in, int n_blocks, int size)
  801. {
  802. int block_size = size/n_blocks;
  803. int i;
  804. for (i = 0; i < size; i++)
  805. out[i] = block_size * (in[i] % n_blocks) + in[i] / n_blocks;
  806. }
  807. static av_cold void construct_perm_table(TwinContext *tctx,enum FrameType ftype)
  808. {
  809. int block_size;
  810. const ModeTab *mtab = tctx->mtab;
  811. int size = tctx->avctx->channels*mtab->fmode[ftype].sub;
  812. int16_t *tmp_perm = (int16_t *) tctx->tmp_buf;
  813. if (ftype == FT_PPC) {
  814. size = tctx->avctx->channels;
  815. block_size = mtab->ppc_shape_len;
  816. } else
  817. block_size = mtab->size / mtab->fmode[ftype].sub;
  818. permutate_in_line(tmp_perm, tctx->n_div[ftype], size,
  819. block_size, tctx->length[ftype],
  820. tctx->length_change[ftype], ftype);
  821. transpose_perm(tctx->permut[ftype], tmp_perm, tctx->n_div[ftype],
  822. tctx->length[ftype], tctx->length_change[ftype]);
  823. linear_perm(tctx->permut[ftype], tctx->permut[ftype], size,
  824. size*block_size);
  825. }
  826. static av_cold void init_bitstream_params(TwinContext *tctx)
  827. {
  828. const ModeTab *mtab = tctx->mtab;
  829. int n_ch = tctx->avctx->channels;
  830. int total_fr_bits = tctx->avctx->bit_rate*mtab->size/
  831. tctx->avctx->sample_rate;
  832. int lsp_bits_per_block = n_ch*(mtab->lsp_bit0 + mtab->lsp_bit1 +
  833. mtab->lsp_split*mtab->lsp_bit2);
  834. int ppc_bits = n_ch*(mtab->pgain_bit + mtab->ppc_shape_bit +
  835. mtab->ppc_period_bit);
  836. int bsize_no_main_cb[3];
  837. int bse_bits[3];
  838. int i;
  839. enum FrameType frametype;
  840. for (i = 0; i < 3; i++)
  841. // +1 for history usage switch
  842. bse_bits[i] = n_ch *
  843. (mtab->fmode[i].bark_n_coef * mtab->fmode[i].bark_n_bit + 1);
  844. bsize_no_main_cb[2] = bse_bits[2] + lsp_bits_per_block + ppc_bits +
  845. WINDOW_TYPE_BITS + n_ch*GAIN_BITS;
  846. for (i = 0; i < 2; i++)
  847. bsize_no_main_cb[i] =
  848. lsp_bits_per_block + n_ch*GAIN_BITS + WINDOW_TYPE_BITS +
  849. mtab->fmode[i].sub*(bse_bits[i] + n_ch*SUB_GAIN_BITS);
  850. // The remaining bits are all used for the main spectrum coefficients
  851. for (i = 0; i < 4; i++) {
  852. int bit_size;
  853. int vect_size;
  854. int rounded_up, rounded_down, num_rounded_down, num_rounded_up;
  855. if (i == 3) {
  856. bit_size = n_ch * mtab->ppc_shape_bit;
  857. vect_size = n_ch * mtab->ppc_shape_len;
  858. } else {
  859. bit_size = total_fr_bits - bsize_no_main_cb[i];
  860. vect_size = n_ch * mtab->size;
  861. }
  862. tctx->n_div[i] = (bit_size + 13) / 14;
  863. rounded_up = (bit_size + tctx->n_div[i] - 1)/tctx->n_div[i];
  864. rounded_down = (bit_size )/tctx->n_div[i];
  865. num_rounded_down = rounded_up * tctx->n_div[i] - bit_size;
  866. num_rounded_up = tctx->n_div[i] - num_rounded_down;
  867. tctx->bits_main_spec[0][i][0] = (rounded_up + 1)/2;
  868. tctx->bits_main_spec[1][i][0] = (rounded_up )/2;
  869. tctx->bits_main_spec[0][i][1] = (rounded_down + 1)/2;
  870. tctx->bits_main_spec[1][i][1] = (rounded_down )/2;
  871. tctx->bits_main_spec_change[i] = num_rounded_up;
  872. rounded_up = (vect_size + tctx->n_div[i] - 1)/tctx->n_div[i];
  873. rounded_down = (vect_size )/tctx->n_div[i];
  874. num_rounded_down = rounded_up * tctx->n_div[i] - vect_size;
  875. num_rounded_up = tctx->n_div[i] - num_rounded_down;
  876. tctx->length[i][0] = rounded_up;
  877. tctx->length[i][1] = rounded_down;
  878. tctx->length_change[i] = num_rounded_up;
  879. }
  880. for (frametype = FT_SHORT; frametype <= FT_PPC; frametype++)
  881. construct_perm_table(tctx, frametype);
  882. }
  883. static av_cold int twin_decode_init(AVCodecContext *avctx)
  884. {
  885. TwinContext *tctx = avctx->priv_data;
  886. int isampf = avctx->sample_rate/1000;
  887. int ibps = avctx->bit_rate/(1000 * avctx->channels);
  888. tctx->avctx = avctx;
  889. avctx->sample_fmt = SAMPLE_FMT_FLT;
  890. if (avctx->channels > 2) {
  891. av_log(avctx, AV_LOG_ERROR, "Unsupported number of channels: %i\n",
  892. avctx->channels);
  893. return -1;
  894. }
  895. switch ((isampf << 8) + ibps) {
  896. case (8 <<8) + 8: tctx->mtab = &mode_08_08; break;
  897. case (11<<8) + 8: tctx->mtab = &mode_11_08; break;
  898. case (11<<8) + 10: tctx->mtab = &mode_11_10; break;
  899. case (16<<8) + 16: tctx->mtab = &mode_16_16; break;
  900. case (22<<8) + 20: tctx->mtab = &mode_22_20; break;
  901. case (22<<8) + 24: tctx->mtab = &mode_22_24; break;
  902. case (22<<8) + 32: tctx->mtab = &mode_22_32; break;
  903. case (44<<8) + 40: tctx->mtab = &mode_44_40; break;
  904. case (44<<8) + 48: tctx->mtab = &mode_44_48; break;
  905. default:
  906. av_log(avctx, AV_LOG_ERROR, "This version does not support %d kHz - %d kbit/s/ch mode.\n", isampf, isampf);
  907. return -1;
  908. }
  909. dsputil_init(&tctx->dsp, avctx);
  910. init_mdct_win(tctx);
  911. init_bitstream_params(tctx);
  912. memset_float(tctx->bark_hist[0][0], 0.1, FF_ARRAY_ELEMS(tctx->bark_hist));
  913. return 0;
  914. }
  915. static av_cold int twin_decode_close(AVCodecContext *avctx)
  916. {
  917. TwinContext *tctx = avctx->priv_data;
  918. int i;
  919. for (i = 0; i < 3; i++) {
  920. ff_mdct_end(&tctx->mdct_ctx[i]);
  921. av_free(tctx->cos_tabs[i]);
  922. }
  923. av_free(tctx->curr_frame);
  924. av_free(tctx->spectrum);
  925. av_free(tctx->prev_frame);
  926. av_free(tctx->tmp_buf);
  927. return 0;
  928. }
  929. AVCodec twinvq_decoder =
  930. {
  931. "twinvq",
  932. CODEC_TYPE_AUDIO,
  933. CODEC_ID_TWINVQ,
  934. sizeof(TwinContext),
  935. twin_decode_init,
  936. NULL,
  937. twin_decode_close,
  938. twin_decode_frame,
  939. .long_name = NULL_IF_CONFIG_SMALL("VQF TwinVQ"),
  940. };