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.

150 lines
4.1KB

  1. /*
  2. * AAC encoder utilities
  3. * Copyright (C) 2015 Rostislav Pehlivanov
  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. /**
  22. * @file
  23. * AAC encoder utilities
  24. * @author Rostislav Pehlivanov ( atomnuker gmail com )
  25. */
  26. #ifndef AVCODEC_AACENC_UTILS_H
  27. #define AVCODEC_AACENC_UTILS_H
  28. #include "aac.h"
  29. #include "aac_tablegen_decl.h"
  30. #include "aacenctab.h"
  31. #define ROUND_STANDARD 0.4054f
  32. #define ROUND_TO_ZERO 0.1054f
  33. #define C_QUANT 0.4054f
  34. static inline void abs_pow34_v(float *out, const float *in, const int size)
  35. {
  36. int i;
  37. for (i = 0; i < size; i++) {
  38. float a = fabsf(in[i]);
  39. out[i] = sqrtf(a * sqrtf(a));
  40. }
  41. }
  42. /**
  43. * Quantize one coefficient.
  44. * @return absolute value of the quantized coefficient
  45. * @see 3GPP TS26.403 5.6.2 "Scalefactor determination"
  46. */
  47. static inline int quant(float coef, const float Q, const float rounding)
  48. {
  49. float a = coef * Q;
  50. return sqrtf(a * sqrtf(a)) + rounding;
  51. }
  52. static inline void quantize_bands(int *out, const float *in, const float *scaled,
  53. int size, float Q34, int is_signed, int maxval,
  54. const float rounding)
  55. {
  56. int i;
  57. double qc;
  58. for (i = 0; i < size; i++) {
  59. qc = scaled[i] * Q34;
  60. out[i] = (int)FFMIN(qc + rounding, (double)maxval);
  61. if (is_signed && in[i] < 0.0f) {
  62. out[i] = -out[i];
  63. }
  64. }
  65. }
  66. static inline float find_max_val(int group_len, int swb_size, const float *scaled)
  67. {
  68. float maxval = 0.0f;
  69. int w2, i;
  70. for (w2 = 0; w2 < group_len; w2++) {
  71. for (i = 0; i < swb_size; i++) {
  72. maxval = FFMAX(maxval, scaled[w2*128+i]);
  73. }
  74. }
  75. return maxval;
  76. }
  77. static inline int find_min_book(float maxval, int sf)
  78. {
  79. float Q = ff_aac_pow2sf_tab[POW_SF2_ZERO - sf + SCALE_ONE_POS - SCALE_DIV_512];
  80. float Q34 = sqrtf(Q * sqrtf(Q));
  81. int qmaxval, cb;
  82. qmaxval = maxval * Q34 + C_QUANT;
  83. if (qmaxval >= (FF_ARRAY_ELEMS(aac_maxval_cb)))
  84. cb = 11;
  85. else
  86. cb = aac_maxval_cb[qmaxval];
  87. return cb;
  88. }
  89. /** Return the minimum scalefactor where the quantized coef does not clip. */
  90. static inline uint8_t coef2minsf(float coef)
  91. {
  92. return av_clip_uint8(log2f(coef)*4 - 69 + SCALE_ONE_POS - SCALE_DIV_512);
  93. }
  94. /** Return the maximum scalefactor where the quantized coef is not zero. */
  95. static inline uint8_t coef2maxsf(float coef)
  96. {
  97. return av_clip_uint8(log2f(coef)*4 + 6 + SCALE_ONE_POS - SCALE_DIV_512);
  98. }
  99. /*
  100. * Returns the closest possible index to an array of float values, given a value.
  101. */
  102. static inline int quant_array_idx(const float val, const float *arr, const int num)
  103. {
  104. int i, index = 0;
  105. float quant_min_err = INFINITY;
  106. for (i = 0; i < num; i++) {
  107. float error = (val - arr[i])*(val - arr[i]);
  108. if (error < quant_min_err) {
  109. quant_min_err = error;
  110. index = i;
  111. }
  112. }
  113. return index;
  114. }
  115. /*
  116. * linear congruential pseudorandom number generator, copied from the decoder
  117. */
  118. static inline int lcg_random(unsigned previous_val)
  119. {
  120. union { unsigned u; int s; } v = { previous_val * 1664525u + 1013904223 };
  121. return v.s;
  122. }
  123. #define ERROR_IF(cond, ...) \
  124. if (cond) { \
  125. av_log(avctx, AV_LOG_ERROR, __VA_ARGS__); \
  126. return AVERROR(EINVAL); \
  127. }
  128. #define WARN_IF(cond, ...) \
  129. if (cond) { \
  130. av_log(avctx, AV_LOG_WARNING, __VA_ARGS__); \
  131. }
  132. #endif /* AVCODEC_AACENC_UTILS_H */