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.

124 lines
3.5KB

  1. /*
  2. * Various fixed-point math operations
  3. *
  4. * Copyright (c) 2008 Vladimir Voroshilov
  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 <inttypes.h>
  23. #include <limits.h>
  24. #include <assert.h>
  25. #include "avcodec.h"
  26. #include "celp_math.h"
  27. /**
  28. * Cosine table: base_cos[i] = (1<<15) * cos(i*PI/64)
  29. */
  30. static const int16_t tab_cos[65] =
  31. {
  32. 32767, 32738, 32617, 32421, 32145, 31793, 31364, 30860,
  33. 30280, 29629, 28905, 28113, 27252, 26326, 25336, 24285,
  34. 23176, 22011, 20793, 19525, 18210, 16851, 15451, 14014,
  35. 12543, 11043, 9515, 7965, 6395, 4810, 3214, 1609,
  36. 1, -1607, -3211, -4808, -6393, -7962, -9513, -11040,
  37. -12541, -14012, -15449, -16848, -18207, -19523, -20791, -22009,
  38. -23174, -24283, -25334, -26324, -27250, -28111, -28904, -29627,
  39. -30279, -30858, -31363, -31792, -32144, -32419, -32616, -32736, -32768,
  40. };
  41. static const uint16_t exp2a[]=
  42. {
  43. 0, 1435, 2901, 4400, 5931, 7496, 9096, 10730,
  44. 12400, 14106, 15850, 17632, 19454, 21315, 23216, 25160,
  45. 27146, 29175, 31249, 33368, 35534, 37747, 40009, 42320,
  46. 44682, 47095, 49562, 52082, 54657, 57289, 59979, 62727,
  47. };
  48. static const uint16_t exp2b[]=
  49. {
  50. 3, 712, 1424, 2134, 2845, 3557, 4270, 4982,
  51. 5696, 6409, 7124, 7839, 8554, 9270, 9986, 10704,
  52. 11421, 12138, 12857, 13576, 14295, 15014, 15734, 16455,
  53. 17176, 17898, 18620, 19343, 20066, 20790, 21514, 22238,
  54. };
  55. int16_t ff_cos(uint16_t arg)
  56. {
  57. uint8_t offset= arg;
  58. uint8_t ind = arg >> 8;
  59. assert(arg <= 0x3fff);
  60. return tab_cos[ind] + (offset * (tab_cos[ind+1] - tab_cos[ind]) >> 8);
  61. }
  62. int ff_exp2(uint16_t power)
  63. {
  64. unsigned int result= exp2a[power>>10] + 0x10000;
  65. assert(power <= 0x7fff);
  66. result= (result<<3) + ((result*exp2b[(power>>5)&31])>>17);
  67. return result + ((result*(power&31)*89)>>22);
  68. }
  69. /**
  70. * Table used to compute log2(x)
  71. *
  72. * tab_log2[i] = (1<<15) * log2(1 + i/32), i=0..32
  73. */
  74. static const uint16_t tab_log2[33] =
  75. {
  76. 4, 1459, 2870, 4240, 5572, 6867, 8127, 9355,
  77. 10552, 11719, 12858, 13971, 15057, 16120, 17158, 18175,
  78. 19170, 20145, 21100, 22036, 22954, 23854, 24738, 25605,
  79. 26457, 27294, 28116, 28924, 29719, 30500, 31269, 32025, 32769,
  80. };
  81. int ff_log2(uint32_t value)
  82. {
  83. uint8_t power_int;
  84. uint8_t frac_x0;
  85. uint16_t frac_dx;
  86. // Stripping zeros from beginning
  87. power_int = av_log2(value);
  88. value <<= (31 - power_int);
  89. // b31 is always non-zero now
  90. frac_x0 = (value & 0x7c000000) >> 26; // b26-b31 and [32..63] -> [0..31]
  91. frac_dx = (value & 0x03fff800) >> 11;
  92. value = tab_log2[frac_x0];
  93. value += (frac_dx * (tab_log2[frac_x0+1] - tab_log2[frac_x0])) >> 15;
  94. return (power_int << 15) + value;
  95. }
  96. float ff_dot_productf(const float* a, const float* b, int length)
  97. {
  98. float sum = 0;
  99. int i;
  100. for(i=0; i<length; i++)
  101. sum += a[i] * b[i];
  102. return sum;
  103. }