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