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.

276 lines
8.7KB

  1. /*
  2. * AAC Spectral Band Replication decoding functions
  3. * Copyright (c) 2008-2009 Robert Swain ( rob opendot cl )
  4. * Copyright (c) 2009-2010 Alex Converse <alex.converse@gmail.com>
  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 "config.h"
  23. #include "libavutil/attributes.h"
  24. #include "sbrdsp.h"
  25. static void sbr_sum64x5_c(float *z)
  26. {
  27. int k;
  28. for (k = 0; k < 64; k++) {
  29. float f = z[k] + z[k + 64] + z[k + 128] + z[k + 192] + z[k + 256];
  30. z[k] = f;
  31. }
  32. }
  33. static float sbr_sum_square_c(float (*x)[2], int n)
  34. {
  35. float sum0 = 0.0f, sum1 = 0.0f;
  36. int i;
  37. for (i = 0; i < n; i += 2)
  38. {
  39. sum0 += x[i + 0][0] * x[i + 0][0];
  40. sum1 += x[i + 0][1] * x[i + 0][1];
  41. sum0 += x[i + 1][0] * x[i + 1][0];
  42. sum1 += x[i + 1][1] * x[i + 1][1];
  43. }
  44. return sum0 + sum1;
  45. }
  46. static void sbr_neg_odd_64_c(float *x)
  47. {
  48. int i;
  49. for (i = 1; i < 64; i += 2)
  50. x[i] = -x[i];
  51. }
  52. static void sbr_qmf_pre_shuffle_c(float *z)
  53. {
  54. int k;
  55. z[64] = z[0];
  56. z[65] = z[1];
  57. for (k = 1; k < 32; k++) {
  58. z[64+2*k ] = -z[64 - k];
  59. z[64+2*k+1] = z[ k + 1];
  60. }
  61. }
  62. static void sbr_qmf_post_shuffle_c(float W[32][2], const float *z)
  63. {
  64. int k;
  65. for (k = 0; k < 32; k++) {
  66. W[k][0] = -z[63-k];
  67. W[k][1] = z[k];
  68. }
  69. }
  70. static void sbr_qmf_deint_neg_c(float *v, const float *src)
  71. {
  72. int i;
  73. for (i = 0; i < 32; i++) {
  74. v[ i] = src[63 - 2*i ];
  75. v[63 - i] = -src[63 - 2*i - 1];
  76. }
  77. }
  78. static void sbr_qmf_deint_bfly_c(float *v, const float *src0, const float *src1)
  79. {
  80. int i;
  81. for (i = 0; i < 64; i++) {
  82. v[ i] = src0[i] - src1[63 - i];
  83. v[127 - i] = src0[i] + src1[63 - i];
  84. }
  85. }
  86. static av_always_inline void autocorrelate(const float x[40][2],
  87. float phi[3][2][2], int lag)
  88. {
  89. int i;
  90. float real_sum = 0.0f;
  91. float imag_sum = 0.0f;
  92. if (lag) {
  93. for (i = 1; i < 38; i++) {
  94. real_sum += x[i][0] * x[i+lag][0] + x[i][1] * x[i+lag][1];
  95. imag_sum += x[i][0] * x[i+lag][1] - x[i][1] * x[i+lag][0];
  96. }
  97. phi[2-lag][1][0] = real_sum + x[ 0][0] * x[lag][0] + x[ 0][1] * x[lag][1];
  98. phi[2-lag][1][1] = imag_sum + x[ 0][0] * x[lag][1] - x[ 0][1] * x[lag][0];
  99. if (lag == 1) {
  100. phi[0][0][0] = real_sum + x[38][0] * x[39][0] + x[38][1] * x[39][1];
  101. phi[0][0][1] = imag_sum + x[38][0] * x[39][1] - x[38][1] * x[39][0];
  102. }
  103. } else {
  104. for (i = 1; i < 38; i++) {
  105. real_sum += x[i][0] * x[i][0] + x[i][1] * x[i][1];
  106. }
  107. phi[2][1][0] = real_sum + x[ 0][0] * x[ 0][0] + x[ 0][1] * x[ 0][1];
  108. phi[1][0][0] = real_sum + x[38][0] * x[38][0] + x[38][1] * x[38][1];
  109. }
  110. }
  111. static void sbr_autocorrelate_c(const float x[40][2], float phi[3][2][2])
  112. {
  113. #if 0
  114. // This code is slower because it multiplies memory accesses.
  115. // It is left as eucational purpose and because it may offer
  116. // a better reference for writing arch-specific dsp functions.
  117. autocorrelate(x, phi, 0);
  118. autocorrelate(x, phi, 1);
  119. autocorrelate(x, phi, 2);
  120. #else
  121. float real_sum2 = x[ 0][0] * x[ 2][0] + x[ 0][1] * x[ 2][1];
  122. float imag_sum2 = x[ 0][0] * x[ 2][1] - x[ 0][1] * x[ 2][0];
  123. float real_sum1 = 0.f, imag_sum1 = 0.f, real_sum0 = 0.0f;
  124. int i;
  125. for (i = 1; i < 38; i++) {
  126. real_sum0 += x[i][0] * x[i ][0] + x[i][1] * x[i ][1];
  127. real_sum1 += x[i][0] * x[i+1][0] + x[i][1] * x[i+1][1];
  128. imag_sum1 += x[i][0] * x[i+1][1] - x[i][1] * x[i+1][0];
  129. real_sum2 += x[i][0] * x[i+2][0] + x[i][1] * x[i+2][1];
  130. imag_sum2 += x[i][0] * x[i+2][1] - x[i][1] * x[i+2][0];
  131. }
  132. phi[2-2][1][0] = real_sum2;
  133. phi[2-2][1][1] = imag_sum2;
  134. phi[2 ][1][0] = real_sum0 + x[ 0][0] * x[ 0][0] + x[ 0][1] * x[ 0][1];
  135. phi[1 ][0][0] = real_sum0 + x[38][0] * x[38][0] + x[38][1] * x[38][1];
  136. phi[2-1][1][0] = real_sum1 + x[ 0][0] * x[ 1][0] + x[ 0][1] * x[ 1][1];
  137. phi[2-1][1][1] = imag_sum1 + x[ 0][0] * x[ 1][1] - x[ 0][1] * x[ 1][0];
  138. phi[0 ][0][0] = real_sum1 + x[38][0] * x[39][0] + x[38][1] * x[39][1];
  139. phi[0 ][0][1] = imag_sum1 + x[38][0] * x[39][1] - x[38][1] * x[39][0];
  140. #endif
  141. }
  142. static void sbr_hf_gen_c(float (*X_high)[2], const float (*X_low)[2],
  143. const float alpha0[2], const float alpha1[2],
  144. float bw, int start, int end)
  145. {
  146. float alpha[4];
  147. int i;
  148. alpha[0] = alpha1[0] * bw * bw;
  149. alpha[1] = alpha1[1] * bw * bw;
  150. alpha[2] = alpha0[0] * bw;
  151. alpha[3] = alpha0[1] * bw;
  152. for (i = start; i < end; i++) {
  153. X_high[i][0] =
  154. X_low[i - 2][0] * alpha[0] -
  155. X_low[i - 2][1] * alpha[1] +
  156. X_low[i - 1][0] * alpha[2] -
  157. X_low[i - 1][1] * alpha[3] +
  158. X_low[i][0];
  159. X_high[i][1] =
  160. X_low[i - 2][1] * alpha[0] +
  161. X_low[i - 2][0] * alpha[1] +
  162. X_low[i - 1][1] * alpha[2] +
  163. X_low[i - 1][0] * alpha[3] +
  164. X_low[i][1];
  165. }
  166. }
  167. static void sbr_hf_g_filt_c(float (*Y)[2], const float (*X_high)[40][2],
  168. const float *g_filt, int m_max, intptr_t ixh)
  169. {
  170. int m;
  171. for (m = 0; m < m_max; m++) {
  172. Y[m][0] = X_high[m][ixh][0] * g_filt[m];
  173. Y[m][1] = X_high[m][ixh][1] * g_filt[m];
  174. }
  175. }
  176. static av_always_inline void sbr_hf_apply_noise(float (*Y)[2],
  177. const float *s_m,
  178. const float *q_filt,
  179. int noise,
  180. float phi_sign0,
  181. float phi_sign1,
  182. int m_max)
  183. {
  184. int m;
  185. for (m = 0; m < m_max; m++) {
  186. float y0 = Y[m][0];
  187. float y1 = Y[m][1];
  188. noise = (noise + 1) & 0x1ff;
  189. if (s_m[m]) {
  190. y0 += s_m[m] * phi_sign0;
  191. y1 += s_m[m] * phi_sign1;
  192. } else {
  193. y0 += q_filt[m] * ff_sbr_noise_table[noise][0];
  194. y1 += q_filt[m] * ff_sbr_noise_table[noise][1];
  195. }
  196. Y[m][0] = y0;
  197. Y[m][1] = y1;
  198. phi_sign1 = -phi_sign1;
  199. }
  200. }
  201. static void sbr_hf_apply_noise_0(float (*Y)[2], const float *s_m,
  202. const float *q_filt, int noise,
  203. int kx, int m_max)
  204. {
  205. sbr_hf_apply_noise(Y, s_m, q_filt, noise, 1.0, 0.0, m_max);
  206. }
  207. static void sbr_hf_apply_noise_1(float (*Y)[2], const float *s_m,
  208. const float *q_filt, int noise,
  209. int kx, int m_max)
  210. {
  211. float phi_sign = 1 - 2 * (kx & 1);
  212. sbr_hf_apply_noise(Y, s_m, q_filt, noise, 0.0, phi_sign, m_max);
  213. }
  214. static void sbr_hf_apply_noise_2(float (*Y)[2], const float *s_m,
  215. const float *q_filt, int noise,
  216. int kx, int m_max)
  217. {
  218. sbr_hf_apply_noise(Y, s_m, q_filt, noise, -1.0, 0.0, m_max);
  219. }
  220. static void sbr_hf_apply_noise_3(float (*Y)[2], const float *s_m,
  221. const float *q_filt, int noise,
  222. int kx, int m_max)
  223. {
  224. float phi_sign = 1 - 2 * (kx & 1);
  225. sbr_hf_apply_noise(Y, s_m, q_filt, noise, 0.0, -phi_sign, m_max);
  226. }
  227. av_cold void ff_sbrdsp_init(SBRDSPContext *s)
  228. {
  229. s->sum64x5 = sbr_sum64x5_c;
  230. s->sum_square = sbr_sum_square_c;
  231. s->neg_odd_64 = sbr_neg_odd_64_c;
  232. s->qmf_pre_shuffle = sbr_qmf_pre_shuffle_c;
  233. s->qmf_post_shuffle = sbr_qmf_post_shuffle_c;
  234. s->qmf_deint_neg = sbr_qmf_deint_neg_c;
  235. s->qmf_deint_bfly = sbr_qmf_deint_bfly_c;
  236. s->autocorrelate = sbr_autocorrelate_c;
  237. s->hf_gen = sbr_hf_gen_c;
  238. s->hf_g_filt = sbr_hf_g_filt_c;
  239. s->hf_apply_noise[0] = sbr_hf_apply_noise_0;
  240. s->hf_apply_noise[1] = sbr_hf_apply_noise_1;
  241. s->hf_apply_noise[2] = sbr_hf_apply_noise_2;
  242. s->hf_apply_noise[3] = sbr_hf_apply_noise_3;
  243. if (ARCH_ARM)
  244. ff_sbrdsp_init_arm(s);
  245. if (ARCH_X86)
  246. ff_sbrdsp_init_x86(s);
  247. if (ARCH_MIPS)
  248. ff_sbrdsp_init_mips(s);
  249. }