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.

195 lines
5.7KB

  1. /*
  2. * LPC utility code
  3. * Copyright (c) 2006 Justin Ruggles <justin.ruggles@gmail.com>
  4. *
  5. * This file is part of Libav.
  6. *
  7. * Libav 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. * Libav 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 Libav; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. #ifndef AVCODEC_LPC_H
  22. #define AVCODEC_LPC_H
  23. #include <stdint.h>
  24. #define ORDER_METHOD_EST 0
  25. #define ORDER_METHOD_2LEVEL 1
  26. #define ORDER_METHOD_4LEVEL 2
  27. #define ORDER_METHOD_8LEVEL 3
  28. #define ORDER_METHOD_SEARCH 4
  29. #define ORDER_METHOD_LOG 5
  30. #define MIN_LPC_ORDER 1
  31. #define MAX_LPC_ORDER 32
  32. /**
  33. * LPC analysis type
  34. */
  35. enum FFLPCType {
  36. FF_LPC_TYPE_DEFAULT = -1, ///< use the codec default LPC type
  37. FF_LPC_TYPE_NONE = 0, ///< do not use LPC prediction or use all zero coefficients
  38. FF_LPC_TYPE_FIXED = 1, ///< fixed LPC coefficients
  39. FF_LPC_TYPE_LEVINSON = 2, ///< Levinson-Durbin recursion
  40. FF_LPC_TYPE_CHOLESKY = 3, ///< Cholesky factorization
  41. FF_LPC_TYPE_NB , ///< Not part of ABI
  42. };
  43. typedef struct LPCContext {
  44. int blocksize;
  45. int max_order;
  46. enum FFLPCType lpc_type;
  47. double *windowed_buffer;
  48. double *windowed_samples;
  49. /**
  50. * Apply a Welch window to an array of input samples.
  51. * The output samples have the same scale as the input, but are in double
  52. * sample format.
  53. * @param data input samples
  54. * @param len number of input samples
  55. * @param w_data output samples
  56. */
  57. void (*lpc_apply_welch_window)(const int32_t *data, int len,
  58. double *w_data);
  59. /**
  60. * Perform autocorrelation on input samples with delay of 0 to lag.
  61. * @param data input samples.
  62. * constraints: no alignment needed, but must have have at
  63. * least lag*sizeof(double) valid bytes preceding it, and
  64. * size must be at least (len+1)*sizeof(double) if data is
  65. * 16-byte aligned or (len+2)*sizeof(double) if data is
  66. * unaligned.
  67. * @param len number of input samples to process
  68. * @param lag maximum delay to calculate
  69. * @param autoc output autocorrelation coefficients.
  70. * constraints: array size must be at least lag+1.
  71. */
  72. void (*lpc_compute_autocorr)(const double *data, int len, int lag,
  73. double *autoc);
  74. } LPCContext;
  75. /**
  76. * Calculate LPC coefficients for multiple orders
  77. */
  78. int ff_lpc_calc_coefs(LPCContext *s,
  79. const int32_t *samples, int blocksize, int min_order,
  80. int max_order, int precision,
  81. int32_t coefs[][MAX_LPC_ORDER], int *shift,
  82. enum FFLPCType lpc_type, int lpc_passes,
  83. int omethod, int max_shift, int zero_shift);
  84. int ff_lpc_calc_ref_coefs(LPCContext *s,
  85. const int32_t *samples, int order, double *ref);
  86. /**
  87. * Initialize LPCContext.
  88. */
  89. int ff_lpc_init(LPCContext *s, int blocksize, int max_order,
  90. enum FFLPCType lpc_type);
  91. void ff_lpc_init_x86(LPCContext *s);
  92. /**
  93. * Uninitialize LPCContext.
  94. */
  95. void ff_lpc_end(LPCContext *s);
  96. #ifdef LPC_USE_DOUBLE
  97. #define LPC_TYPE double
  98. #else
  99. #define LPC_TYPE float
  100. #endif
  101. /**
  102. * Schur recursion.
  103. * Produces reflection coefficients from autocorrelation data.
  104. */
  105. static inline void compute_ref_coefs(const LPC_TYPE *autoc, int max_order,
  106. LPC_TYPE *ref, LPC_TYPE *error)
  107. {
  108. int i, j;
  109. LPC_TYPE err;
  110. LPC_TYPE gen0[MAX_LPC_ORDER], gen1[MAX_LPC_ORDER];
  111. for (i = 0; i < max_order; i++)
  112. gen0[i] = gen1[i] = autoc[i + 1];
  113. err = autoc[0];
  114. ref[0] = -gen1[0] / err;
  115. err += gen1[0] * ref[0];
  116. if (error)
  117. error[0] = err;
  118. for (i = 1; i < max_order; i++) {
  119. for (j = 0; j < max_order - i; j++) {
  120. gen1[j] = gen1[j + 1] + ref[i - 1] * gen0[j];
  121. gen0[j] = gen1[j + 1] * ref[i - 1] + gen0[j];
  122. }
  123. ref[i] = -gen1[0] / err;
  124. err += gen1[0] * ref[i];
  125. if (error)
  126. error[i] = err;
  127. }
  128. }
  129. /**
  130. * Levinson-Durbin recursion.
  131. * Produce LPC coefficients from autocorrelation data.
  132. */
  133. static inline int compute_lpc_coefs(const LPC_TYPE *autoc, int max_order,
  134. LPC_TYPE *lpc, int lpc_stride, int fail,
  135. int normalize)
  136. {
  137. int i, j;
  138. LPC_TYPE err = 0;
  139. LPC_TYPE *lpc_last = lpc;
  140. if (normalize)
  141. err = *autoc++;
  142. if (fail && (autoc[max_order - 1] == 0 || err <= 0))
  143. return -1;
  144. for(i=0; i<max_order; i++) {
  145. LPC_TYPE r = -autoc[i];
  146. if (normalize) {
  147. for(j=0; j<i; j++)
  148. r -= lpc_last[j] * autoc[i-j-1];
  149. r /= err;
  150. err *= 1.0 - (r * r);
  151. }
  152. lpc[i] = r;
  153. for(j=0; j < (i+1)>>1; j++) {
  154. LPC_TYPE f = lpc_last[ j];
  155. LPC_TYPE b = lpc_last[i-1-j];
  156. lpc[ j] = f + r * b;
  157. lpc[i-1-j] = b + r * f;
  158. }
  159. if (fail && err < 0)
  160. return -1;
  161. lpc_last = lpc;
  162. lpc += lpc_stride;
  163. }
  164. return 0;
  165. }
  166. #endif /* AVCODEC_LPC_H */