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. |
(...skipping 23 matching lines...) Expand all Loading... |
49 if( c[ 0 ] <= 0 ) { | 49 if( c[ 0 ] <= 0 ) { |
50 silk_memset( rc_Q16, 0, order * sizeof( opus_int32 ) ); | 50 silk_memset( rc_Q16, 0, order * sizeof( opus_int32 ) ); |
51 return 0; | 51 return 0; |
52 } | 52 } |
53 | 53 |
54 for( k = 0; k < order + 1; k++ ) { | 54 for( k = 0; k < order + 1; k++ ) { |
55 C[ k ][ 0 ] = C[ k ][ 1 ] = c[ k ]; | 55 C[ k ][ 0 ] = C[ k ][ 1 ] = c[ k ]; |
56 } | 56 } |
57 | 57 |
58 for( k = 0; k < order; k++ ) { | 58 for( k = 0; k < order; k++ ) { |
| 59 /* Check that we won't be getting an unstable rc, otherwise stop here. *
/ |
| 60 if (silk_abs_int32(C[ k + 1 ][ 0 ]) >= C[ 0 ][ 1 ]) { |
| 61 if ( C[ k + 1 ][ 0 ] > 0 ) { |
| 62 rc_Q16[ k ] = -SILK_FIX_CONST( .99f, 16 ); |
| 63 } else { |
| 64 rc_Q16[ k ] = SILK_FIX_CONST( .99f, 16 ); |
| 65 } |
| 66 k++; |
| 67 break; |
| 68 } |
| 69 |
59 /* Get reflection coefficient: divide two Q30 values and get result in Q
31 */ | 70 /* Get reflection coefficient: divide two Q30 values and get result in Q
31 */ |
60 rc_tmp_Q31 = silk_DIV32_varQ( -C[ k + 1 ][ 0 ], C[ 0 ][ 1 ], 31 ); | 71 rc_tmp_Q31 = silk_DIV32_varQ( -C[ k + 1 ][ 0 ], C[ 0 ][ 1 ], 31 ); |
61 | 72 |
62 /* Save the output */ | 73 /* Save the output */ |
63 rc_Q16[ k ] = silk_RSHIFT_ROUND( rc_tmp_Q31, 15 ); | 74 rc_Q16[ k ] = silk_RSHIFT_ROUND( rc_tmp_Q31, 15 ); |
64 | 75 |
65 /* Update correlations */ | 76 /* Update correlations */ |
66 for( n = 0; n < order - k; n++ ) { | 77 for( n = 0; n < order - k; n++ ) { |
67 Ctmp1_Q30 = C[ n + k + 1 ][ 0 ]; | 78 Ctmp1_Q30 = C[ n + k + 1 ][ 0 ]; |
68 Ctmp2_Q30 = C[ n ][ 1 ]; | 79 Ctmp2_Q30 = C[ n ][ 1 ]; |
69 | 80 |
70 /* Multiply and add the highest int32 */ | 81 /* Multiply and add the highest int32 */ |
71 C[ n + k + 1 ][ 0 ] = Ctmp1_Q30 + silk_SMMUL( silk_LSHIFT( Ctmp2_Q30
, 1 ), rc_tmp_Q31 ); | 82 C[ n + k + 1 ][ 0 ] = Ctmp1_Q30 + silk_SMMUL( silk_LSHIFT( Ctmp2_Q30
, 1 ), rc_tmp_Q31 ); |
72 C[ n ][ 1 ] = Ctmp2_Q30 + silk_SMMUL( silk_LSHIFT( Ctmp1_Q30
, 1 ), rc_tmp_Q31 ); | 83 C[ n ][ 1 ] = Ctmp2_Q30 + silk_SMMUL( silk_LSHIFT( Ctmp1_Q30
, 1 ), rc_tmp_Q31 ); |
73 } | 84 } |
74 } | 85 } |
75 | 86 |
76 return( C[ 0 ][ 1 ] ); | 87 for(; k < order; k++ ) { |
| 88 rc_Q16[ k ] = 0; |
| 89 } |
| 90 |
| 91 return silk_max_32( 1, C[ 0 ][ 1 ] ); |
77 } | 92 } |
OLD | NEW |