cannam@154
|
1 /***********************************************************************
|
cannam@154
|
2 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
|
cannam@154
|
3 Redistribution and use in source and binary forms, with or without
|
cannam@154
|
4 modification, are permitted provided that the following conditions
|
cannam@154
|
5 are met:
|
cannam@154
|
6 - Redistributions of source code must retain the above copyright notice,
|
cannam@154
|
7 this list of conditions and the following disclaimer.
|
cannam@154
|
8 - Redistributions in binary form must reproduce the above copyright
|
cannam@154
|
9 notice, this list of conditions and the following disclaimer in the
|
cannam@154
|
10 documentation and/or other materials provided with the distribution.
|
cannam@154
|
11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
|
cannam@154
|
12 names of specific contributors, may be used to endorse or promote
|
cannam@154
|
13 products derived from this software without specific prior written
|
cannam@154
|
14 permission.
|
cannam@154
|
15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
cannam@154
|
16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
cannam@154
|
17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
cannam@154
|
18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
cannam@154
|
19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
cannam@154
|
20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
cannam@154
|
21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
cannam@154
|
22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
cannam@154
|
23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
cannam@154
|
24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
cannam@154
|
25 POSSIBILITY OF SUCH DAMAGE.
|
cannam@154
|
26 ***********************************************************************/
|
cannam@154
|
27
|
cannam@154
|
28 #ifdef HAVE_CONFIG_H
|
cannam@154
|
29 #include "config.h"
|
cannam@154
|
30 #endif
|
cannam@154
|
31
|
cannam@154
|
32 #include "SigProc_FIX.h"
|
cannam@154
|
33
|
cannam@154
|
34 /* Faster than schur64(), but much less accurate. */
|
cannam@154
|
35 /* uses SMLAWB(), requiring armv5E and higher. */
|
cannam@154
|
36 opus_int32 silk_schur( /* O Returns residual energy */
|
cannam@154
|
37 opus_int16 *rc_Q15, /* O reflection coefficients [order] Q15 */
|
cannam@154
|
38 const opus_int32 *c, /* I correlations [order+1] */
|
cannam@154
|
39 const opus_int32 order /* I prediction order */
|
cannam@154
|
40 )
|
cannam@154
|
41 {
|
cannam@154
|
42 opus_int k, n, lz;
|
cannam@154
|
43 opus_int32 C[ SILK_MAX_ORDER_LPC + 1 ][ 2 ];
|
cannam@154
|
44 opus_int32 Ctmp1, Ctmp2, rc_tmp_Q15;
|
cannam@154
|
45
|
cannam@154
|
46 celt_assert( order >= 0 && order <= SILK_MAX_ORDER_LPC );
|
cannam@154
|
47
|
cannam@154
|
48 /* Get number of leading zeros */
|
cannam@154
|
49 lz = silk_CLZ32( c[ 0 ] );
|
cannam@154
|
50
|
cannam@154
|
51 /* Copy correlations and adjust level to Q30 */
|
cannam@154
|
52 k = 0;
|
cannam@154
|
53 if( lz < 2 ) {
|
cannam@154
|
54 /* lz must be 1, so shift one to the right */
|
cannam@154
|
55 do {
|
cannam@154
|
56 C[ k ][ 0 ] = C[ k ][ 1 ] = silk_RSHIFT( c[ k ], 1 );
|
cannam@154
|
57 } while( ++k <= order );
|
cannam@154
|
58 } else if( lz > 2 ) {
|
cannam@154
|
59 /* Shift to the left */
|
cannam@154
|
60 lz -= 2;
|
cannam@154
|
61 do {
|
cannam@154
|
62 C[ k ][ 0 ] = C[ k ][ 1 ] = silk_LSHIFT( c[ k ], lz );
|
cannam@154
|
63 } while( ++k <= order );
|
cannam@154
|
64 } else {
|
cannam@154
|
65 /* No need to shift */
|
cannam@154
|
66 do {
|
cannam@154
|
67 C[ k ][ 0 ] = C[ k ][ 1 ] = c[ k ];
|
cannam@154
|
68 } while( ++k <= order );
|
cannam@154
|
69 }
|
cannam@154
|
70
|
cannam@154
|
71 for( k = 0; k < order; k++ ) {
|
cannam@154
|
72 /* Check that we won't be getting an unstable rc, otherwise stop here. */
|
cannam@154
|
73 if (silk_abs_int32(C[ k + 1 ][ 0 ]) >= C[ 0 ][ 1 ]) {
|
cannam@154
|
74 if ( C[ k + 1 ][ 0 ] > 0 ) {
|
cannam@154
|
75 rc_Q15[ k ] = -SILK_FIX_CONST( .99f, 15 );
|
cannam@154
|
76 } else {
|
cannam@154
|
77 rc_Q15[ k ] = SILK_FIX_CONST( .99f, 15 );
|
cannam@154
|
78 }
|
cannam@154
|
79 k++;
|
cannam@154
|
80 break;
|
cannam@154
|
81 }
|
cannam@154
|
82
|
cannam@154
|
83 /* Get reflection coefficient */
|
cannam@154
|
84 rc_tmp_Q15 = -silk_DIV32_16( C[ k + 1 ][ 0 ], silk_max_32( silk_RSHIFT( C[ 0 ][ 1 ], 15 ), 1 ) );
|
cannam@154
|
85
|
cannam@154
|
86 /* Clip (shouldn't happen for properly conditioned inputs) */
|
cannam@154
|
87 rc_tmp_Q15 = silk_SAT16( rc_tmp_Q15 );
|
cannam@154
|
88
|
cannam@154
|
89 /* Store */
|
cannam@154
|
90 rc_Q15[ k ] = (opus_int16)rc_tmp_Q15;
|
cannam@154
|
91
|
cannam@154
|
92 /* Update correlations */
|
cannam@154
|
93 for( n = 0; n < order - k; n++ ) {
|
cannam@154
|
94 Ctmp1 = C[ n + k + 1 ][ 0 ];
|
cannam@154
|
95 Ctmp2 = C[ n ][ 1 ];
|
cannam@154
|
96 C[ n + k + 1 ][ 0 ] = silk_SMLAWB( Ctmp1, silk_LSHIFT( Ctmp2, 1 ), rc_tmp_Q15 );
|
cannam@154
|
97 C[ n ][ 1 ] = silk_SMLAWB( Ctmp2, silk_LSHIFT( Ctmp1, 1 ), rc_tmp_Q15 );
|
cannam@154
|
98 }
|
cannam@154
|
99 }
|
cannam@154
|
100
|
cannam@154
|
101 for(; k < order; k++ ) {
|
cannam@154
|
102 rc_Q15[ k ] = 0;
|
cannam@154
|
103 }
|
cannam@154
|
104
|
cannam@154
|
105 /* return residual energy */
|
cannam@154
|
106 return silk_max_32( 1, C[ 0 ][ 1 ] );
|
cannam@154
|
107 }
|