LPC_analysis_filter.c 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111
  1. /***********************************************************************
  2. Copyright (c) 2006-2011, Skype Limited. All rights reserved.
  3. Redistribution and use in source and binary forms, with or without
  4. modification, are permitted provided that the following conditions
  5. are met:
  6. - Redistributions of source code must retain the above copyright notice,
  7. this list of conditions and the following disclaimer.
  8. - Redistributions in binary form must reproduce the above copyright
  9. notice, this list of conditions and the following disclaimer in the
  10. documentation and/or other materials provided with the distribution.
  11. - Neither the name of Internet Society, IETF or IETF Trust, nor the
  12. names of specific contributors, may be used to endorse or promote
  13. products derived from this software without specific prior written
  14. permission.
  15. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  18. ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  19. LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  20. CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  21. SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  22. INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  23. CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  24. ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  25. POSSIBILITY OF SUCH DAMAGE.
  26. ***********************************************************************/
  27. #ifdef HAVE_CONFIG_H
  28. #include "config.h"
  29. #endif
  30. #include "SigProc_FIX.h"
  31. #include "celt_lpc.h"
  32. /*******************************************/
  33. /* LPC analysis filter */
  34. /* NB! State is kept internally and the */
  35. /* filter always starts with zero state */
  36. /* first d output samples are set to zero */
  37. /*******************************************/
  38. /* OPT: Using celt_fir() for this function should be faster, but it may cause
  39. integer overflows in intermediate values (not final results), which the
  40. current implementation silences by casting to unsigned. Enabling
  41. this should be safe in pretty much all cases, even though it is not technically
  42. C89-compliant. */
  43. #define USE_CELT_FIR 0
  44. void silk_LPC_analysis_filter(
  45. opus_int16 *out, /* O Output signal */
  46. const opus_int16 *in, /* I Input signal */
  47. const opus_int16 *B, /* I MA prediction coefficients, Q12 [order] */
  48. const opus_int32 len, /* I Signal length */
  49. const opus_int32 d, /* I Filter order */
  50. int arch /* I Run-time architecture */
  51. )
  52. {
  53. opus_int j;
  54. #if defined(FIXED_POINT) && USE_CELT_FIR
  55. opus_int16 num[SILK_MAX_ORDER_LPC];
  56. #else
  57. int ix;
  58. opus_int32 out32_Q12, out32;
  59. const opus_int16 *in_ptr;
  60. #endif
  61. celt_assert( d >= 6 );
  62. celt_assert( (d & 1) == 0 );
  63. celt_assert( d <= len );
  64. #if defined(FIXED_POINT) && USE_CELT_FIR
  65. celt_assert( d <= SILK_MAX_ORDER_LPC );
  66. for ( j = 0; j < d; j++ ) {
  67. num[ j ] = -B[ j ];
  68. }
  69. celt_fir( in + d, num, out + d, len - d, d, arch );
  70. for ( j = 0; j < d; j++ ) {
  71. out[ j ] = 0;
  72. }
  73. #else
  74. (void)arch;
  75. for( ix = d; ix < len; ix++ ) {
  76. in_ptr = &in[ ix - 1 ];
  77. out32_Q12 = silk_SMULBB( in_ptr[ 0 ], B[ 0 ] );
  78. /* Allowing wrap around so that two wraps can cancel each other. The rare
  79. cases where the result wraps around can only be triggered by invalid streams*/
  80. out32_Q12 = silk_SMLABB_ovflw( out32_Q12, in_ptr[ -1 ], B[ 1 ] );
  81. out32_Q12 = silk_SMLABB_ovflw( out32_Q12, in_ptr[ -2 ], B[ 2 ] );
  82. out32_Q12 = silk_SMLABB_ovflw( out32_Q12, in_ptr[ -3 ], B[ 3 ] );
  83. out32_Q12 = silk_SMLABB_ovflw( out32_Q12, in_ptr[ -4 ], B[ 4 ] );
  84. out32_Q12 = silk_SMLABB_ovflw( out32_Q12, in_ptr[ -5 ], B[ 5 ] );
  85. for( j = 6; j < d; j += 2 ) {
  86. out32_Q12 = silk_SMLABB_ovflw( out32_Q12, in_ptr[ -j ], B[ j ] );
  87. out32_Q12 = silk_SMLABB_ovflw( out32_Q12, in_ptr[ -j - 1 ], B[ j + 1 ] );
  88. }
  89. /* Subtract prediction */
  90. out32_Q12 = silk_SUB32_ovflw( silk_LSHIFT( (opus_int32)in_ptr[ 1 ], 12 ), out32_Q12 );
  91. /* Scale to Q0 */
  92. out32 = silk_RSHIFT_ROUND( out32_Q12, 12 );
  93. /* Saturate output */
  94. out[ ix ] = (opus_int16)silk_SAT16( out32 );
  95. }
  96. /* Set first d output samples to zero */
  97. silk_memset( out, 0, d * sizeof( opus_int16 ) );
  98. #endif
  99. }