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.

224 lines
7.8KB

  1. /*
  2. * Common code between Nellymoser encoder and decoder
  3. * Copyright (c) 2007 a840bda5870ba11f19698ff6eb9581dfb0f95fa5,
  4. * 539459aeb7d425140b62a3ec7dbf6dc8e408a306, and
  5. * 520e17cd55896441042b14df2566a6eb610ed444
  6. * Copyright (c) 2007 Loic Minier <lool at dooz.org>
  7. * Benjamin Larsson
  8. *
  9. * Permission is hereby granted, free of charge, to any person obtaining a
  10. * copy of this software and associated documentation files (the "Software"),
  11. * to deal in the Software without restriction, including without limitation
  12. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  13. * and/or sell copies of the Software, and to permit persons to whom the
  14. * Software is furnished to do so, subject to the following conditions:
  15. *
  16. * The above copyright notice and this permission notice shall be included in
  17. * all copies or substantial portions of the Software.
  18. *
  19. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  22. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  24. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  25. * DEALINGS IN THE SOFTWARE.
  26. */
  27. /**
  28. * @file nellymoser.c
  29. * The 3 alphanumeric copyright notices are md5summed they are from the original
  30. * implementors. The original code is available from http://code.google.com/p/nelly2pcm/
  31. */
  32. #include "nellymoser.h"
  33. #include "libavutil/random.h"
  34. #include "avcodec.h"
  35. #include "dsputil.h"
  36. #define ALT_BITSTREAM_READER_LE
  37. #include "bitstream.h"
  38. const float ff_nelly_dequantization_table[127] = {
  39. 0.0000000000,-0.8472560048, 0.7224709988, -1.5247479677, -0.4531480074, 0.3753609955, 1.4717899561,
  40. -1.9822579622, -1.1929379702, -0.5829370022, -0.0693780035, 0.3909569979,0.9069200158, 1.4862740040,
  41. 2.2215409279, -2.3887870312, -1.8067539930, -1.4105420113, -1.0773609877, -0.7995010018,-0.5558109879,
  42. -0.3334020078, -0.1324490011, 0.0568020009, 0.2548770010, 0.4773550034, 0.7386850119, 1.0443060398,
  43. 1.3954459429, 1.8098750114, 2.3918759823,-2.3893830776, -1.9884680510, -1.7514040470, -1.5643119812,
  44. -1.3922129869,-1.2164649963, -1.0469499826, -0.8905100226, -0.7645580173, -0.6454579830, -0.5259280205,
  45. -0.4059549868, -0.3029719889, -0.2096900046, -0.1239869967, -0.0479229987, 0.0257730000, 0.1001340002,
  46. 0.1737180054, 0.2585540116, 0.3522900045, 0.4569880068, 0.5767750144, 0.7003160119, 0.8425520062,
  47. 1.0093879700, 1.1821349859, 1.3534560204, 1.5320819616, 1.7332619429, 1.9722349644, 2.3978140354,
  48. -2.5756309032, -2.0573320389, -1.8984919786, -1.7727810144, -1.6662600040, -1.5742180347, -1.4993319511,
  49. -1.4316639900, -1.3652280569, -1.3000990152, -1.2280930281, -1.1588579416, -1.0921250582, -1.0135740042,
  50. -0.9202849865, -0.8287050128, -0.7374889851, -0.6447759867, -0.5590940118, -0.4857139885, -0.4110319912,
  51. -0.3459700048, -0.2851159871, -0.2341620028, -0.1870580018, -0.1442500055, -0.1107169986, -0.0739680007,
  52. -0.0365610011, -0.0073290002, 0.0203610007, 0.0479039997, 0.0751969963, 0.0980999991, 0.1220389977,
  53. 0.1458999962, 0.1694349945, 0.1970459968, 0.2252430022, 0.2556869984, 0.2870100141, 0.3197099864,
  54. 0.3525829911, 0.3889069855, 0.4334920049, 0.4769459963, 0.5204820037, 0.5644530058, 0.6122040153,
  55. 0.6685929894, 0.7341650128, 0.8032159805, 0.8784040213, 0.9566209912, 1.0397069454, 1.1293770075,
  56. 1.2211159468, 1.3080279827, 1.4024800062, 1.5056819916, 1.6227730513, 1.7724959850, 1.9430880547,
  57. 2.2903931141
  58. };
  59. const uint8_t ff_nelly_band_sizes_table[NELLY_BANDS] = {
  60. 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 9, 10, 12, 14, 15
  61. };
  62. const uint16_t ff_nelly_init_table[64] = {
  63. 3134, 5342, 6870, 7792, 8569, 9185, 9744, 10191, 10631, 11061, 11434, 11770,
  64. 12116, 12513, 12925, 13300, 13674, 14027, 14352, 14716, 15117, 15477, 15824,
  65. 16157, 16513, 16804, 17090, 17401, 17679, 17948, 18238, 18520, 18764, 19078,
  66. 19381, 19640, 19921, 20205, 20500, 20813, 21162, 21465, 21794, 22137, 22453,
  67. 22756, 23067, 23350, 23636, 23926, 24227, 24521, 24819, 25107, 25414, 25730,
  68. 26120, 26497, 26895, 27344, 27877, 28463, 29426, 31355
  69. };
  70. const int16_t ff_nelly_delta_table[32] = {
  71. -11725, -9420, -7910, -6801, -5948, -5233, -4599, -4039, -3507, -3030, -2596,
  72. -2170, -1774, -1383, -1016, -660, -329, -1, 337, 696, 1085, 1512, 1962, 2433,
  73. 2968, 3569, 4314, 5279, 6622, 8154, 10076, 12975
  74. };
  75. static inline int signed_shift(int i, int shift) {
  76. if (shift > 0)
  77. return i << shift;
  78. return i >> -shift;
  79. }
  80. static int sum_bits(short *buf, short shift, short off)
  81. {
  82. int i, ret = 0;
  83. for (i = 0; i < NELLY_FILL_LEN; i++) {
  84. int b = buf[i]-off;
  85. b = ((b>>(shift-1))+1)>>1;
  86. ret += av_clip(b, 0, NELLY_BIT_CAP);
  87. }
  88. return ret;
  89. }
  90. static int headroom(int *la)
  91. {
  92. int l;
  93. if (*la == 0) {
  94. return 31;
  95. }
  96. l = 30 - av_log2(FFABS(*la));
  97. *la <<= l;
  98. return l;
  99. }
  100. void ff_nelly_get_sample_bits(const float *buf, int *bits)
  101. {
  102. int i, j;
  103. short sbuf[128];
  104. int bitsum = 0, last_bitsum, small_bitsum, big_bitsum;
  105. short shift, shift_saved;
  106. int max, sum, last_off, tmp;
  107. int big_off, small_off;
  108. int off;
  109. max = 0;
  110. for (i = 0; i < NELLY_FILL_LEN; i++) {
  111. max = FFMAX(max, buf[i]);
  112. }
  113. shift = -16;
  114. shift += headroom(&max);
  115. sum = 0;
  116. for (i = 0; i < NELLY_FILL_LEN; i++) {
  117. sbuf[i] = signed_shift(buf[i], shift);
  118. sbuf[i] = (3*sbuf[i])>>2;
  119. sum += sbuf[i];
  120. }
  121. shift += 11;
  122. shift_saved = shift;
  123. sum -= NELLY_DETAIL_BITS << shift;
  124. shift += headroom(&sum);
  125. small_off = (NELLY_BASE_OFF * (sum>>16)) >> 15;
  126. shift = shift_saved - (NELLY_BASE_SHIFT+shift-31);
  127. small_off = signed_shift(small_off, shift);
  128. bitsum = sum_bits(sbuf, shift_saved, small_off);
  129. if (bitsum != NELLY_DETAIL_BITS) {
  130. shift = 0;
  131. off = bitsum - NELLY_DETAIL_BITS;
  132. for(shift=0; FFABS(off) <= 16383; shift++)
  133. off *= 2;
  134. off = (off * NELLY_BASE_OFF) >> 15;
  135. shift = shift_saved-(NELLY_BASE_SHIFT+shift-15);
  136. off = signed_shift(off, shift);
  137. for (j = 1; j < 20; j++) {
  138. last_off = small_off;
  139. small_off += off;
  140. last_bitsum = bitsum;
  141. bitsum = sum_bits(sbuf, shift_saved, small_off);
  142. if ((bitsum-NELLY_DETAIL_BITS) * (last_bitsum-NELLY_DETAIL_BITS) <= 0)
  143. break;
  144. }
  145. if (bitsum > NELLY_DETAIL_BITS) {
  146. big_off = small_off;
  147. small_off = last_off;
  148. big_bitsum=bitsum;
  149. small_bitsum=last_bitsum;
  150. } else {
  151. big_off = last_off;
  152. big_bitsum=last_bitsum;
  153. small_bitsum=bitsum;
  154. }
  155. while (bitsum != NELLY_DETAIL_BITS && j <= 19) {
  156. off = (big_off+small_off)>>1;
  157. bitsum = sum_bits(sbuf, shift_saved, off);
  158. if (bitsum > NELLY_DETAIL_BITS) {
  159. big_off=off;
  160. big_bitsum=bitsum;
  161. } else {
  162. small_off = off;
  163. small_bitsum=bitsum;
  164. }
  165. j++;
  166. }
  167. if (abs(big_bitsum-NELLY_DETAIL_BITS) >=
  168. abs(small_bitsum-NELLY_DETAIL_BITS)) {
  169. bitsum = small_bitsum;
  170. } else {
  171. small_off = big_off;
  172. bitsum = big_bitsum;
  173. }
  174. }
  175. for (i = 0; i < NELLY_FILL_LEN; i++) {
  176. tmp = sbuf[i]-small_off;
  177. tmp = ((tmp>>(shift_saved-1))+1)>>1;
  178. bits[i] = av_clip(tmp, 0, NELLY_BIT_CAP);
  179. }
  180. if (bitsum > NELLY_DETAIL_BITS) {
  181. tmp = i = 0;
  182. while (tmp < NELLY_DETAIL_BITS) {
  183. tmp += bits[i];
  184. i++;
  185. }
  186. bits[i-1] -= tmp - NELLY_DETAIL_BITS;
  187. for(; i < NELLY_FILL_LEN; i++)
  188. bits[i] = 0;
  189. }
  190. }