1*a58d3d2aSXin Li /***********************************************************************
2*a58d3d2aSXin Li Copyright (c) 2006-2011, Skype Limited. All rights reserved.
3*a58d3d2aSXin Li Redistribution and use in source and binary forms, with or without
4*a58d3d2aSXin Li modification, are permitted provided that the following conditions
5*a58d3d2aSXin Li are met:
6*a58d3d2aSXin Li - Redistributions of source code must retain the above copyright notice,
7*a58d3d2aSXin Li this list of conditions and the following disclaimer.
8*a58d3d2aSXin Li - Redistributions in binary form must reproduce the above copyright
9*a58d3d2aSXin Li notice, this list of conditions and the following disclaimer in the
10*a58d3d2aSXin Li documentation and/or other materials provided with the distribution.
11*a58d3d2aSXin Li - Neither the name of Internet Society, IETF or IETF Trust, nor the
12*a58d3d2aSXin Li names of specific contributors, may be used to endorse or promote
13*a58d3d2aSXin Li products derived from this software without specific prior written
14*a58d3d2aSXin Li permission.
15*a58d3d2aSXin Li THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
16*a58d3d2aSXin Li AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17*a58d3d2aSXin Li IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18*a58d3d2aSXin Li ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
19*a58d3d2aSXin Li LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
20*a58d3d2aSXin Li CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
21*a58d3d2aSXin Li SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
22*a58d3d2aSXin Li INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23*a58d3d2aSXin Li CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
24*a58d3d2aSXin Li ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
25*a58d3d2aSXin Li POSSIBILITY OF SUCH DAMAGE.
26*a58d3d2aSXin Li ***********************************************************************/
27*a58d3d2aSXin Li
28*a58d3d2aSXin Li #ifdef HAVE_CONFIG_H
29*a58d3d2aSXin Li #include "config.h"
30*a58d3d2aSXin Li #endif
31*a58d3d2aSXin Li
32*a58d3d2aSXin Li #include "SigProc_FIX.h"
33*a58d3d2aSXin Li #include "define.h"
34*a58d3d2aSXin Li
35*a58d3d2aSXin Li #define QA 24
36*a58d3d2aSXin Li #define A_LIMIT SILK_FIX_CONST( 0.99975, QA )
37*a58d3d2aSXin Li
38*a58d3d2aSXin Li #define MUL32_FRAC_Q(a32, b32, Q) ((opus_int32)(silk_RSHIFT_ROUND64(silk_SMULL(a32, b32), Q)))
39*a58d3d2aSXin Li
40*a58d3d2aSXin Li /* Compute inverse of LPC prediction gain, and */
41*a58d3d2aSXin Li /* test if LPC coefficients are stable (all poles within unit circle) */
LPC_inverse_pred_gain_QA_c(opus_int32 A_QA[SILK_MAX_ORDER_LPC],const opus_int order)42*a58d3d2aSXin Li static opus_int32 LPC_inverse_pred_gain_QA_c( /* O Returns inverse prediction gain in energy domain, Q30 */
43*a58d3d2aSXin Li opus_int32 A_QA[ SILK_MAX_ORDER_LPC ], /* I Prediction coefficients */
44*a58d3d2aSXin Li const opus_int order /* I Prediction order */
45*a58d3d2aSXin Li )
46*a58d3d2aSXin Li {
47*a58d3d2aSXin Li opus_int k, n, mult2Q;
48*a58d3d2aSXin Li opus_int32 invGain_Q30, rc_Q31, rc_mult1_Q30, rc_mult2, tmp1, tmp2;
49*a58d3d2aSXin Li
50*a58d3d2aSXin Li invGain_Q30 = SILK_FIX_CONST( 1, 30 );
51*a58d3d2aSXin Li for( k = order - 1; k > 0; k-- ) {
52*a58d3d2aSXin Li /* Check for stability */
53*a58d3d2aSXin Li if( ( A_QA[ k ] > A_LIMIT ) || ( A_QA[ k ] < -A_LIMIT ) ) {
54*a58d3d2aSXin Li return 0;
55*a58d3d2aSXin Li }
56*a58d3d2aSXin Li
57*a58d3d2aSXin Li /* Set RC equal to negated AR coef */
58*a58d3d2aSXin Li rc_Q31 = -silk_LSHIFT( A_QA[ k ], 31 - QA );
59*a58d3d2aSXin Li
60*a58d3d2aSXin Li /* rc_mult1_Q30 range: [ 1 : 2^30 ] */
61*a58d3d2aSXin Li rc_mult1_Q30 = silk_SUB32( SILK_FIX_CONST( 1, 30 ), silk_SMMUL( rc_Q31, rc_Q31 ) );
62*a58d3d2aSXin Li silk_assert( rc_mult1_Q30 > ( 1 << 15 ) ); /* reduce A_LIMIT if fails */
63*a58d3d2aSXin Li silk_assert( rc_mult1_Q30 <= ( 1 << 30 ) );
64*a58d3d2aSXin Li
65*a58d3d2aSXin Li /* Update inverse gain */
66*a58d3d2aSXin Li /* invGain_Q30 range: [ 0 : 2^30 ] */
67*a58d3d2aSXin Li invGain_Q30 = silk_LSHIFT( silk_SMMUL( invGain_Q30, rc_mult1_Q30 ), 2 );
68*a58d3d2aSXin Li silk_assert( invGain_Q30 >= 0 );
69*a58d3d2aSXin Li silk_assert( invGain_Q30 <= ( 1 << 30 ) );
70*a58d3d2aSXin Li if( invGain_Q30 < SILK_FIX_CONST( 1.0f / MAX_PREDICTION_POWER_GAIN, 30 ) ) {
71*a58d3d2aSXin Li return 0;
72*a58d3d2aSXin Li }
73*a58d3d2aSXin Li
74*a58d3d2aSXin Li /* rc_mult2 range: [ 2^30 : silk_int32_MAX ] */
75*a58d3d2aSXin Li mult2Q = 32 - silk_CLZ32( silk_abs( rc_mult1_Q30 ) );
76*a58d3d2aSXin Li rc_mult2 = silk_INVERSE32_varQ( rc_mult1_Q30, mult2Q + 30 );
77*a58d3d2aSXin Li
78*a58d3d2aSXin Li /* Update AR coefficient */
79*a58d3d2aSXin Li for( n = 0; n < (k + 1) >> 1; n++ ) {
80*a58d3d2aSXin Li opus_int64 tmp64;
81*a58d3d2aSXin Li tmp1 = A_QA[ n ];
82*a58d3d2aSXin Li tmp2 = A_QA[ k - n - 1 ];
83*a58d3d2aSXin Li tmp64 = silk_RSHIFT_ROUND64( silk_SMULL( silk_SUB_SAT32(tmp1,
84*a58d3d2aSXin Li MUL32_FRAC_Q( tmp2, rc_Q31, 31 ) ), rc_mult2 ), mult2Q);
85*a58d3d2aSXin Li if( tmp64 > silk_int32_MAX || tmp64 < silk_int32_MIN ) {
86*a58d3d2aSXin Li return 0;
87*a58d3d2aSXin Li }
88*a58d3d2aSXin Li A_QA[ n ] = ( opus_int32 )tmp64;
89*a58d3d2aSXin Li tmp64 = silk_RSHIFT_ROUND64( silk_SMULL( silk_SUB_SAT32(tmp2,
90*a58d3d2aSXin Li MUL32_FRAC_Q( tmp1, rc_Q31, 31 ) ), rc_mult2), mult2Q);
91*a58d3d2aSXin Li if( tmp64 > silk_int32_MAX || tmp64 < silk_int32_MIN ) {
92*a58d3d2aSXin Li return 0;
93*a58d3d2aSXin Li }
94*a58d3d2aSXin Li A_QA[ k - n - 1 ] = ( opus_int32 )tmp64;
95*a58d3d2aSXin Li }
96*a58d3d2aSXin Li }
97*a58d3d2aSXin Li
98*a58d3d2aSXin Li /* Check for stability */
99*a58d3d2aSXin Li if( ( A_QA[ k ] > A_LIMIT ) || ( A_QA[ k ] < -A_LIMIT ) ) {
100*a58d3d2aSXin Li return 0;
101*a58d3d2aSXin Li }
102*a58d3d2aSXin Li
103*a58d3d2aSXin Li /* Set RC equal to negated AR coef */
104*a58d3d2aSXin Li rc_Q31 = -silk_LSHIFT( A_QA[ 0 ], 31 - QA );
105*a58d3d2aSXin Li
106*a58d3d2aSXin Li /* Range: [ 1 : 2^30 ] */
107*a58d3d2aSXin Li rc_mult1_Q30 = silk_SUB32( SILK_FIX_CONST( 1, 30 ), silk_SMMUL( rc_Q31, rc_Q31 ) );
108*a58d3d2aSXin Li
109*a58d3d2aSXin Li /* Update inverse gain */
110*a58d3d2aSXin Li /* Range: [ 0 : 2^30 ] */
111*a58d3d2aSXin Li invGain_Q30 = silk_LSHIFT( silk_SMMUL( invGain_Q30, rc_mult1_Q30 ), 2 );
112*a58d3d2aSXin Li silk_assert( invGain_Q30 >= 0 );
113*a58d3d2aSXin Li silk_assert( invGain_Q30 <= ( 1 << 30 ) );
114*a58d3d2aSXin Li if( invGain_Q30 < SILK_FIX_CONST( 1.0f / MAX_PREDICTION_POWER_GAIN, 30 ) ) {
115*a58d3d2aSXin Li return 0;
116*a58d3d2aSXin Li }
117*a58d3d2aSXin Li
118*a58d3d2aSXin Li return invGain_Q30;
119*a58d3d2aSXin Li }
120*a58d3d2aSXin Li
121*a58d3d2aSXin Li /* For input in Q12 domain */
silk_LPC_inverse_pred_gain_c(const opus_int16 * A_Q12,const opus_int order)122*a58d3d2aSXin Li opus_int32 silk_LPC_inverse_pred_gain_c( /* O Returns inverse prediction gain in energy domain, Q30 */
123*a58d3d2aSXin Li const opus_int16 *A_Q12, /* I Prediction coefficients, Q12 [order] */
124*a58d3d2aSXin Li const opus_int order /* I Prediction order */
125*a58d3d2aSXin Li )
126*a58d3d2aSXin Li {
127*a58d3d2aSXin Li opus_int k;
128*a58d3d2aSXin Li opus_int32 Atmp_QA[ SILK_MAX_ORDER_LPC ];
129*a58d3d2aSXin Li opus_int32 DC_resp = 0;
130*a58d3d2aSXin Li
131*a58d3d2aSXin Li /* Increase Q domain of the AR coefficients */
132*a58d3d2aSXin Li for( k = 0; k < order; k++ ) {
133*a58d3d2aSXin Li DC_resp += (opus_int32)A_Q12[ k ];
134*a58d3d2aSXin Li Atmp_QA[ k ] = silk_LSHIFT32( (opus_int32)A_Q12[ k ], QA - 12 );
135*a58d3d2aSXin Li }
136*a58d3d2aSXin Li /* If the DC is unstable, we don't even need to do the full calculations */
137*a58d3d2aSXin Li if( DC_resp >= 4096 ) {
138*a58d3d2aSXin Li return 0;
139*a58d3d2aSXin Li }
140*a58d3d2aSXin Li return LPC_inverse_pred_gain_QA_c( Atmp_QA, order );
141*a58d3d2aSXin Li }
142