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 #ifndef __NSQ_DEL_DEC_MIPSR1_H__
|
cannam@154
|
29 #define __NSQ_DEL_DEC_MIPSR1_H__
|
cannam@154
|
30
|
cannam@154
|
31 #ifdef HAVE_CONFIG_H
|
cannam@154
|
32 #include "config.h"
|
cannam@154
|
33 #endif
|
cannam@154
|
34
|
cannam@154
|
35 #include "main.h"
|
cannam@154
|
36 #include "stack_alloc.h"
|
cannam@154
|
37
|
cannam@154
|
38 #define OVERRIDE_silk_noise_shape_quantizer_del_dec
|
cannam@154
|
39 static inline void silk_noise_shape_quantizer_del_dec(
|
cannam@154
|
40 silk_nsq_state *NSQ, /* I/O NSQ state */
|
cannam@154
|
41 NSQ_del_dec_struct psDelDec[], /* I/O Delayed decision states */
|
cannam@154
|
42 opus_int signalType, /* I Signal type */
|
cannam@154
|
43 const opus_int32 x_Q10[], /* I */
|
cannam@154
|
44 opus_int8 pulses[], /* O */
|
cannam@154
|
45 opus_int16 xq[], /* O */
|
cannam@154
|
46 opus_int32 sLTP_Q15[], /* I/O LTP filter state */
|
cannam@154
|
47 opus_int32 delayedGain_Q10[], /* I/O Gain delay buffer */
|
cannam@154
|
48 const opus_int16 a_Q12[], /* I Short term prediction coefs */
|
cannam@154
|
49 const opus_int16 b_Q14[], /* I Long term prediction coefs */
|
cannam@154
|
50 const opus_int16 AR_shp_Q13[], /* I Noise shaping coefs */
|
cannam@154
|
51 opus_int lag, /* I Pitch lag */
|
cannam@154
|
52 opus_int32 HarmShapeFIRPacked_Q14, /* I */
|
cannam@154
|
53 opus_int Tilt_Q14, /* I Spectral tilt */
|
cannam@154
|
54 opus_int32 LF_shp_Q14, /* I */
|
cannam@154
|
55 opus_int32 Gain_Q16, /* I */
|
cannam@154
|
56 opus_int Lambda_Q10, /* I */
|
cannam@154
|
57 opus_int offset_Q10, /* I */
|
cannam@154
|
58 opus_int length, /* I Input length */
|
cannam@154
|
59 opus_int subfr, /* I Subframe number */
|
cannam@154
|
60 opus_int shapingLPCOrder, /* I Shaping LPC filter order */
|
cannam@154
|
61 opus_int predictLPCOrder, /* I Prediction filter order */
|
cannam@154
|
62 opus_int warping_Q16, /* I */
|
cannam@154
|
63 opus_int nStatesDelayedDecision, /* I Number of states in decision tree */
|
cannam@154
|
64 opus_int *smpl_buf_idx, /* I/O Index to newest samples in buffers */
|
cannam@154
|
65 opus_int decisionDelay, /* I */
|
cannam@154
|
66 int arch /* I */
|
cannam@154
|
67 )
|
cannam@154
|
68 {
|
cannam@154
|
69 opus_int i, j, k, Winner_ind, RDmin_ind, RDmax_ind, last_smple_idx;
|
cannam@154
|
70 opus_int32 Winner_rand_state;
|
cannam@154
|
71 opus_int32 LTP_pred_Q14, LPC_pred_Q14, n_AR_Q14, n_LTP_Q14;
|
cannam@154
|
72 opus_int32 n_LF_Q14, r_Q10, rr_Q10, rd1_Q10, rd2_Q10, RDmin_Q10, RDmax_Q10;
|
cannam@154
|
73 opus_int32 q1_Q0, q1_Q10, q2_Q10, exc_Q14, LPC_exc_Q14, xq_Q14, Gain_Q10;
|
cannam@154
|
74 opus_int32 tmp1, tmp2, sLF_AR_shp_Q14;
|
cannam@154
|
75 opus_int32 *pred_lag_ptr, *shp_lag_ptr, *psLPC_Q14;
|
cannam@154
|
76 NSQ_sample_struct psSampleState[ MAX_DEL_DEC_STATES ][ 2 ];
|
cannam@154
|
77 NSQ_del_dec_struct *psDD;
|
cannam@154
|
78 NSQ_sample_struct *psSS;
|
cannam@154
|
79 opus_int16 b_Q14_0, b_Q14_1, b_Q14_2, b_Q14_3, b_Q14_4;
|
cannam@154
|
80 opus_int16 a_Q12_0, a_Q12_1, a_Q12_2, a_Q12_3, a_Q12_4, a_Q12_5, a_Q12_6;
|
cannam@154
|
81 opus_int16 a_Q12_7, a_Q12_8, a_Q12_9, a_Q12_10, a_Q12_11, a_Q12_12, a_Q12_13;
|
cannam@154
|
82 opus_int16 a_Q12_14, a_Q12_15;
|
cannam@154
|
83
|
cannam@154
|
84 opus_int32 cur, prev, next;
|
cannam@154
|
85
|
cannam@154
|
86 /*Unused.*/
|
cannam@154
|
87 (void)arch;
|
cannam@154
|
88
|
cannam@154
|
89 //Intialize b_Q14 variables
|
cannam@154
|
90 b_Q14_0 = b_Q14[ 0 ];
|
cannam@154
|
91 b_Q14_1 = b_Q14[ 1 ];
|
cannam@154
|
92 b_Q14_2 = b_Q14[ 2 ];
|
cannam@154
|
93 b_Q14_3 = b_Q14[ 3 ];
|
cannam@154
|
94 b_Q14_4 = b_Q14[ 4 ];
|
cannam@154
|
95
|
cannam@154
|
96 //Intialize a_Q12 variables
|
cannam@154
|
97 a_Q12_0 = a_Q12[0];
|
cannam@154
|
98 a_Q12_1 = a_Q12[1];
|
cannam@154
|
99 a_Q12_2 = a_Q12[2];
|
cannam@154
|
100 a_Q12_3 = a_Q12[3];
|
cannam@154
|
101 a_Q12_4 = a_Q12[4];
|
cannam@154
|
102 a_Q12_5 = a_Q12[5];
|
cannam@154
|
103 a_Q12_6 = a_Q12[6];
|
cannam@154
|
104 a_Q12_7 = a_Q12[7];
|
cannam@154
|
105 a_Q12_8 = a_Q12[8];
|
cannam@154
|
106 a_Q12_9 = a_Q12[9];
|
cannam@154
|
107 a_Q12_10 = a_Q12[10];
|
cannam@154
|
108 a_Q12_11 = a_Q12[11];
|
cannam@154
|
109 a_Q12_12 = a_Q12[12];
|
cannam@154
|
110 a_Q12_13 = a_Q12[13];
|
cannam@154
|
111 a_Q12_14 = a_Q12[14];
|
cannam@154
|
112 a_Q12_15 = a_Q12[15];
|
cannam@154
|
113
|
cannam@154
|
114 long long temp64;
|
cannam@154
|
115
|
cannam@154
|
116 silk_assert( nStatesDelayedDecision > 0 );
|
cannam@154
|
117
|
cannam@154
|
118 shp_lag_ptr = &NSQ->sLTP_shp_Q14[ NSQ->sLTP_shp_buf_idx - lag + HARM_SHAPE_FIR_TAPS / 2 ];
|
cannam@154
|
119 pred_lag_ptr = &sLTP_Q15[ NSQ->sLTP_buf_idx - lag + LTP_ORDER / 2 ];
|
cannam@154
|
120 Gain_Q10 = silk_RSHIFT( Gain_Q16, 6 );
|
cannam@154
|
121
|
cannam@154
|
122 for( i = 0; i < length; i++ ) {
|
cannam@154
|
123 /* Perform common calculations used in all states */
|
cannam@154
|
124
|
cannam@154
|
125 /* Long-term prediction */
|
cannam@154
|
126 if( signalType == TYPE_VOICED ) {
|
cannam@154
|
127 /* Unrolled loop */
|
cannam@154
|
128 /* Avoids introducing a bias because silk_SMLAWB() always rounds to -inf */
|
cannam@154
|
129 temp64 = __builtin_mips_mult(pred_lag_ptr[ 0 ], b_Q14_0 );
|
cannam@154
|
130 temp64 = __builtin_mips_madd( temp64, pred_lag_ptr[ -1 ], b_Q14_1 );
|
cannam@154
|
131 temp64 = __builtin_mips_madd( temp64, pred_lag_ptr[ -2 ], b_Q14_2 );
|
cannam@154
|
132 temp64 = __builtin_mips_madd( temp64, pred_lag_ptr[ -3 ], b_Q14_3 );
|
cannam@154
|
133 temp64 = __builtin_mips_madd( temp64, pred_lag_ptr[ -4 ], b_Q14_4 );
|
cannam@154
|
134 temp64 += 32768;
|
cannam@154
|
135 LTP_pred_Q14 = __builtin_mips_extr_w(temp64, 16);
|
cannam@154
|
136 LTP_pred_Q14 = silk_LSHIFT( LTP_pred_Q14, 1 ); /* Q13 -> Q14 */
|
cannam@154
|
137 pred_lag_ptr++;
|
cannam@154
|
138 } else {
|
cannam@154
|
139 LTP_pred_Q14 = 0;
|
cannam@154
|
140 }
|
cannam@154
|
141
|
cannam@154
|
142 /* Long-term shaping */
|
cannam@154
|
143 if( lag > 0 ) {
|
cannam@154
|
144 /* Symmetric, packed FIR coefficients */
|
cannam@154
|
145 n_LTP_Q14 = silk_SMULWB( silk_ADD32( shp_lag_ptr[ 0 ], shp_lag_ptr[ -2 ] ), HarmShapeFIRPacked_Q14 );
|
cannam@154
|
146 n_LTP_Q14 = silk_SMLAWT( n_LTP_Q14, shp_lag_ptr[ -1 ], HarmShapeFIRPacked_Q14 );
|
cannam@154
|
147 n_LTP_Q14 = silk_SUB_LSHIFT32( LTP_pred_Q14, n_LTP_Q14, 2 ); /* Q12 -> Q14 */
|
cannam@154
|
148 shp_lag_ptr++;
|
cannam@154
|
149 } else {
|
cannam@154
|
150 n_LTP_Q14 = 0;
|
cannam@154
|
151 }
|
cannam@154
|
152
|
cannam@154
|
153 for( k = 0; k < nStatesDelayedDecision; k++ ) {
|
cannam@154
|
154 /* Delayed decision state */
|
cannam@154
|
155 psDD = &psDelDec[ k ];
|
cannam@154
|
156
|
cannam@154
|
157 /* Sample state */
|
cannam@154
|
158 psSS = psSampleState[ k ];
|
cannam@154
|
159
|
cannam@154
|
160 /* Generate dither */
|
cannam@154
|
161 psDD->Seed = silk_RAND( psDD->Seed );
|
cannam@154
|
162
|
cannam@154
|
163 /* Pointer used in short term prediction and shaping */
|
cannam@154
|
164 psLPC_Q14 = &psDD->sLPC_Q14[ NSQ_LPC_BUF_LENGTH - 1 + i ];
|
cannam@154
|
165 /* Short-term prediction */
|
cannam@154
|
166 silk_assert( predictLPCOrder == 10 || predictLPCOrder == 16 );
|
cannam@154
|
167 temp64 = __builtin_mips_mult(psLPC_Q14[ 0 ], a_Q12_0 );
|
cannam@154
|
168 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -1 ], a_Q12_1 );
|
cannam@154
|
169 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -2 ], a_Q12_2 );
|
cannam@154
|
170 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -3 ], a_Q12_3 );
|
cannam@154
|
171 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -4 ], a_Q12_4 );
|
cannam@154
|
172 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -5 ], a_Q12_5 );
|
cannam@154
|
173 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -6 ], a_Q12_6 );
|
cannam@154
|
174 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -7 ], a_Q12_7 );
|
cannam@154
|
175 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -8 ], a_Q12_8 );
|
cannam@154
|
176 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -9 ], a_Q12_9 );
|
cannam@154
|
177 if( predictLPCOrder == 16 ) {
|
cannam@154
|
178 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -10 ], a_Q12_10 );
|
cannam@154
|
179 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -11 ], a_Q12_11 );
|
cannam@154
|
180 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -12 ], a_Q12_12 );
|
cannam@154
|
181 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -13 ], a_Q12_13 );
|
cannam@154
|
182 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -14 ], a_Q12_14 );
|
cannam@154
|
183 temp64 = __builtin_mips_madd( temp64, psLPC_Q14[ -15 ], a_Q12_15 );
|
cannam@154
|
184 }
|
cannam@154
|
185 temp64 += 32768;
|
cannam@154
|
186 LPC_pred_Q14 = __builtin_mips_extr_w(temp64, 16);
|
cannam@154
|
187
|
cannam@154
|
188 LPC_pred_Q14 = silk_LSHIFT( LPC_pred_Q14, 4 ); /* Q10 -> Q14 */
|
cannam@154
|
189
|
cannam@154
|
190 /* Noise shape feedback */
|
cannam@154
|
191 silk_assert( ( shapingLPCOrder & 1 ) == 0 ); /* check that order is even */
|
cannam@154
|
192 /* Output of lowpass section */
|
cannam@154
|
193 tmp2 = silk_SMLAWB( psLPC_Q14[ 0 ], psDD->sAR2_Q14[ 0 ], warping_Q16 );
|
cannam@154
|
194 /* Output of allpass section */
|
cannam@154
|
195 tmp1 = silk_SMLAWB( psDD->sAR2_Q14[ 0 ], psDD->sAR2_Q14[ 1 ] - tmp2, warping_Q16 );
|
cannam@154
|
196 psDD->sAR2_Q14[ 0 ] = tmp2;
|
cannam@154
|
197
|
cannam@154
|
198 temp64 = __builtin_mips_mult(tmp2, AR_shp_Q13[ 0 ] );
|
cannam@154
|
199
|
cannam@154
|
200 prev = psDD->sAR2_Q14[ 1 ];
|
cannam@154
|
201
|
cannam@154
|
202 /* Loop over allpass sections */
|
cannam@154
|
203 for( j = 2; j < shapingLPCOrder; j += 2 ) {
|
cannam@154
|
204 cur = psDD->sAR2_Q14[ j ];
|
cannam@154
|
205 next = psDD->sAR2_Q14[ j+1 ];
|
cannam@154
|
206 /* Output of allpass section */
|
cannam@154
|
207 tmp2 = silk_SMLAWB( prev, cur - tmp1, warping_Q16 );
|
cannam@154
|
208 psDD->sAR2_Q14[ j - 1 ] = tmp1;
|
cannam@154
|
209 temp64 = __builtin_mips_madd( temp64, tmp1, AR_shp_Q13[ j - 1 ] );
|
cannam@154
|
210 temp64 = __builtin_mips_madd( temp64, tmp2, AR_shp_Q13[ j ] );
|
cannam@154
|
211 /* Output of allpass section */
|
cannam@154
|
212 tmp1 = silk_SMLAWB( cur, next - tmp2, warping_Q16 );
|
cannam@154
|
213 psDD->sAR2_Q14[ j + 0 ] = tmp2;
|
cannam@154
|
214 prev = next;
|
cannam@154
|
215 }
|
cannam@154
|
216 psDD->sAR2_Q14[ shapingLPCOrder - 1 ] = tmp1;
|
cannam@154
|
217 temp64 = __builtin_mips_madd( temp64, tmp1, AR_shp_Q13[ shapingLPCOrder - 1 ] );
|
cannam@154
|
218 temp64 += 32768;
|
cannam@154
|
219 n_AR_Q14 = __builtin_mips_extr_w(temp64, 16);
|
cannam@154
|
220 n_AR_Q14 = silk_LSHIFT( n_AR_Q14, 1 ); /* Q11 -> Q12 */
|
cannam@154
|
221 n_AR_Q14 = silk_SMLAWB( n_AR_Q14, psDD->LF_AR_Q14, Tilt_Q14 ); /* Q12 */
|
cannam@154
|
222 n_AR_Q14 = silk_LSHIFT( n_AR_Q14, 2 ); /* Q12 -> Q14 */
|
cannam@154
|
223
|
cannam@154
|
224 n_LF_Q14 = silk_SMULWB( psDD->Shape_Q14[ *smpl_buf_idx ], LF_shp_Q14 ); /* Q12 */
|
cannam@154
|
225 n_LF_Q14 = silk_SMLAWT( n_LF_Q14, psDD->LF_AR_Q14, LF_shp_Q14 ); /* Q12 */
|
cannam@154
|
226 n_LF_Q14 = silk_LSHIFT( n_LF_Q14, 2 ); /* Q12 -> Q14 */
|
cannam@154
|
227
|
cannam@154
|
228 /* Input minus prediction plus noise feedback */
|
cannam@154
|
229 /* r = x[ i ] - LTP_pred - LPC_pred + n_AR + n_Tilt + n_LF + n_LTP */
|
cannam@154
|
230 tmp1 = silk_ADD32( n_AR_Q14, n_LF_Q14 ); /* Q14 */
|
cannam@154
|
231 tmp2 = silk_ADD32( n_LTP_Q14, LPC_pred_Q14 ); /* Q13 */
|
cannam@154
|
232 tmp1 = silk_SUB32( tmp2, tmp1 ); /* Q13 */
|
cannam@154
|
233 tmp1 = silk_RSHIFT_ROUND( tmp1, 4 ); /* Q10 */
|
cannam@154
|
234
|
cannam@154
|
235 r_Q10 = silk_SUB32( x_Q10[ i ], tmp1 ); /* residual error Q10 */
|
cannam@154
|
236
|
cannam@154
|
237 /* Flip sign depending on dither */
|
cannam@154
|
238 if ( psDD->Seed < 0 ) {
|
cannam@154
|
239 r_Q10 = -r_Q10;
|
cannam@154
|
240 }
|
cannam@154
|
241 r_Q10 = silk_LIMIT_32( r_Q10, -(31 << 10), 30 << 10 );
|
cannam@154
|
242
|
cannam@154
|
243 /* Find two quantization level candidates and measure their rate-distortion */
|
cannam@154
|
244 q1_Q10 = silk_SUB32( r_Q10, offset_Q10 );
|
cannam@154
|
245 q1_Q0 = silk_RSHIFT( q1_Q10, 10 );
|
cannam@154
|
246 if( q1_Q0 > 0 ) {
|
cannam@154
|
247 q1_Q10 = silk_SUB32( silk_LSHIFT( q1_Q0, 10 ), QUANT_LEVEL_ADJUST_Q10 );
|
cannam@154
|
248 q1_Q10 = silk_ADD32( q1_Q10, offset_Q10 );
|
cannam@154
|
249 q2_Q10 = silk_ADD32( q1_Q10, 1024 );
|
cannam@154
|
250 rd1_Q10 = silk_SMULBB( q1_Q10, Lambda_Q10 );
|
cannam@154
|
251 rd2_Q10 = silk_SMULBB( q2_Q10, Lambda_Q10 );
|
cannam@154
|
252 } else if( q1_Q0 == 0 ) {
|
cannam@154
|
253 q1_Q10 = offset_Q10;
|
cannam@154
|
254 q2_Q10 = silk_ADD32( q1_Q10, 1024 - QUANT_LEVEL_ADJUST_Q10 );
|
cannam@154
|
255 rd1_Q10 = silk_SMULBB( q1_Q10, Lambda_Q10 );
|
cannam@154
|
256 rd2_Q10 = silk_SMULBB( q2_Q10, Lambda_Q10 );
|
cannam@154
|
257 } else if( q1_Q0 == -1 ) {
|
cannam@154
|
258 q2_Q10 = offset_Q10;
|
cannam@154
|
259 q1_Q10 = silk_SUB32( q2_Q10, 1024 - QUANT_LEVEL_ADJUST_Q10 );
|
cannam@154
|
260 rd1_Q10 = silk_SMULBB( -q1_Q10, Lambda_Q10 );
|
cannam@154
|
261 rd2_Q10 = silk_SMULBB( q2_Q10, Lambda_Q10 );
|
cannam@154
|
262 } else { /* q1_Q0 < -1 */
|
cannam@154
|
263 q1_Q10 = silk_ADD32( silk_LSHIFT( q1_Q0, 10 ), QUANT_LEVEL_ADJUST_Q10 );
|
cannam@154
|
264 q1_Q10 = silk_ADD32( q1_Q10, offset_Q10 );
|
cannam@154
|
265 q2_Q10 = silk_ADD32( q1_Q10, 1024 );
|
cannam@154
|
266 rd1_Q10 = silk_SMULBB( -q1_Q10, Lambda_Q10 );
|
cannam@154
|
267 rd2_Q10 = silk_SMULBB( -q2_Q10, Lambda_Q10 );
|
cannam@154
|
268 }
|
cannam@154
|
269 rr_Q10 = silk_SUB32( r_Q10, q1_Q10 );
|
cannam@154
|
270 rd1_Q10 = silk_RSHIFT( silk_SMLABB( rd1_Q10, rr_Q10, rr_Q10 ), 10 );
|
cannam@154
|
271 rr_Q10 = silk_SUB32( r_Q10, q2_Q10 );
|
cannam@154
|
272 rd2_Q10 = silk_RSHIFT( silk_SMLABB( rd2_Q10, rr_Q10, rr_Q10 ), 10 );
|
cannam@154
|
273
|
cannam@154
|
274 if( rd1_Q10 < rd2_Q10 ) {
|
cannam@154
|
275 psSS[ 0 ].RD_Q10 = silk_ADD32( psDD->RD_Q10, rd1_Q10 );
|
cannam@154
|
276 psSS[ 1 ].RD_Q10 = silk_ADD32( psDD->RD_Q10, rd2_Q10 );
|
cannam@154
|
277 psSS[ 0 ].Q_Q10 = q1_Q10;
|
cannam@154
|
278 psSS[ 1 ].Q_Q10 = q2_Q10;
|
cannam@154
|
279 } else {
|
cannam@154
|
280 psSS[ 0 ].RD_Q10 = silk_ADD32( psDD->RD_Q10, rd2_Q10 );
|
cannam@154
|
281 psSS[ 1 ].RD_Q10 = silk_ADD32( psDD->RD_Q10, rd1_Q10 );
|
cannam@154
|
282 psSS[ 0 ].Q_Q10 = q2_Q10;
|
cannam@154
|
283 psSS[ 1 ].Q_Q10 = q1_Q10;
|
cannam@154
|
284 }
|
cannam@154
|
285
|
cannam@154
|
286 /* Update states for best quantization */
|
cannam@154
|
287
|
cannam@154
|
288 /* Quantized excitation */
|
cannam@154
|
289 exc_Q14 = silk_LSHIFT32( psSS[ 0 ].Q_Q10, 4 );
|
cannam@154
|
290 if ( psDD->Seed < 0 ) {
|
cannam@154
|
291 exc_Q14 = -exc_Q14;
|
cannam@154
|
292 }
|
cannam@154
|
293
|
cannam@154
|
294 /* Add predictions */
|
cannam@154
|
295 LPC_exc_Q14 = silk_ADD32( exc_Q14, LTP_pred_Q14 );
|
cannam@154
|
296 xq_Q14 = silk_ADD32( LPC_exc_Q14, LPC_pred_Q14 );
|
cannam@154
|
297
|
cannam@154
|
298 /* Update states */
|
cannam@154
|
299 sLF_AR_shp_Q14 = silk_SUB32( xq_Q14, n_AR_Q14 );
|
cannam@154
|
300 psSS[ 0 ].sLTP_shp_Q14 = silk_SUB32( sLF_AR_shp_Q14, n_LF_Q14 );
|
cannam@154
|
301 psSS[ 0 ].LF_AR_Q14 = sLF_AR_shp_Q14;
|
cannam@154
|
302 psSS[ 0 ].LPC_exc_Q14 = LPC_exc_Q14;
|
cannam@154
|
303 psSS[ 0 ].xq_Q14 = xq_Q14;
|
cannam@154
|
304
|
cannam@154
|
305 /* Update states for second best quantization */
|
cannam@154
|
306
|
cannam@154
|
307 /* Quantized excitation */
|
cannam@154
|
308 exc_Q14 = silk_LSHIFT32( psSS[ 1 ].Q_Q10, 4 );
|
cannam@154
|
309 if ( psDD->Seed < 0 ) {
|
cannam@154
|
310 exc_Q14 = -exc_Q14;
|
cannam@154
|
311 }
|
cannam@154
|
312
|
cannam@154
|
313
|
cannam@154
|
314 /* Add predictions */
|
cannam@154
|
315 LPC_exc_Q14 = silk_ADD32( exc_Q14, LTP_pred_Q14 );
|
cannam@154
|
316 xq_Q14 = silk_ADD32( LPC_exc_Q14, LPC_pred_Q14 );
|
cannam@154
|
317
|
cannam@154
|
318 /* Update states */
|
cannam@154
|
319 sLF_AR_shp_Q14 = silk_SUB32( xq_Q14, n_AR_Q14 );
|
cannam@154
|
320 psSS[ 1 ].sLTP_shp_Q14 = silk_SUB32( sLF_AR_shp_Q14, n_LF_Q14 );
|
cannam@154
|
321 psSS[ 1 ].LF_AR_Q14 = sLF_AR_shp_Q14;
|
cannam@154
|
322 psSS[ 1 ].LPC_exc_Q14 = LPC_exc_Q14;
|
cannam@154
|
323 psSS[ 1 ].xq_Q14 = xq_Q14;
|
cannam@154
|
324 }
|
cannam@154
|
325
|
cannam@154
|
326 *smpl_buf_idx = ( *smpl_buf_idx - 1 ) % DECISION_DELAY;
|
cannam@154
|
327 if( *smpl_buf_idx < 0 ) *smpl_buf_idx += DECISION_DELAY;
|
cannam@154
|
328 last_smple_idx = ( *smpl_buf_idx + decisionDelay ) % DECISION_DELAY;
|
cannam@154
|
329
|
cannam@154
|
330 /* Find winner */
|
cannam@154
|
331 RDmin_Q10 = psSampleState[ 0 ][ 0 ].RD_Q10;
|
cannam@154
|
332 Winner_ind = 0;
|
cannam@154
|
333 for( k = 1; k < nStatesDelayedDecision; k++ ) {
|
cannam@154
|
334 if( psSampleState[ k ][ 0 ].RD_Q10 < RDmin_Q10 ) {
|
cannam@154
|
335 RDmin_Q10 = psSampleState[ k ][ 0 ].RD_Q10;
|
cannam@154
|
336 Winner_ind = k;
|
cannam@154
|
337 }
|
cannam@154
|
338 }
|
cannam@154
|
339
|
cannam@154
|
340 /* Increase RD values of expired states */
|
cannam@154
|
341 Winner_rand_state = psDelDec[ Winner_ind ].RandState[ last_smple_idx ];
|
cannam@154
|
342 for( k = 0; k < nStatesDelayedDecision; k++ ) {
|
cannam@154
|
343 if( psDelDec[ k ].RandState[ last_smple_idx ] != Winner_rand_state ) {
|
cannam@154
|
344 psSampleState[ k ][ 0 ].RD_Q10 = silk_ADD32( psSampleState[ k ][ 0 ].RD_Q10, silk_int32_MAX >> 4 );
|
cannam@154
|
345 psSampleState[ k ][ 1 ].RD_Q10 = silk_ADD32( psSampleState[ k ][ 1 ].RD_Q10, silk_int32_MAX >> 4 );
|
cannam@154
|
346 silk_assert( psSampleState[ k ][ 0 ].RD_Q10 >= 0 );
|
cannam@154
|
347 }
|
cannam@154
|
348 }
|
cannam@154
|
349
|
cannam@154
|
350 /* Find worst in first set and best in second set */
|
cannam@154
|
351 RDmax_Q10 = psSampleState[ 0 ][ 0 ].RD_Q10;
|
cannam@154
|
352 RDmin_Q10 = psSampleState[ 0 ][ 1 ].RD_Q10;
|
cannam@154
|
353 RDmax_ind = 0;
|
cannam@154
|
354 RDmin_ind = 0;
|
cannam@154
|
355 for( k = 1; k < nStatesDelayedDecision; k++ ) {
|
cannam@154
|
356 /* find worst in first set */
|
cannam@154
|
357 if( psSampleState[ k ][ 0 ].RD_Q10 > RDmax_Q10 ) {
|
cannam@154
|
358 RDmax_Q10 = psSampleState[ k ][ 0 ].RD_Q10;
|
cannam@154
|
359 RDmax_ind = k;
|
cannam@154
|
360 }
|
cannam@154
|
361 /* find best in second set */
|
cannam@154
|
362 if( psSampleState[ k ][ 1 ].RD_Q10 < RDmin_Q10 ) {
|
cannam@154
|
363 RDmin_Q10 = psSampleState[ k ][ 1 ].RD_Q10;
|
cannam@154
|
364 RDmin_ind = k;
|
cannam@154
|
365 }
|
cannam@154
|
366 }
|
cannam@154
|
367
|
cannam@154
|
368 /* Replace a state if best from second set outperforms worst in first set */
|
cannam@154
|
369 if( RDmin_Q10 < RDmax_Q10 ) {
|
cannam@154
|
370 silk_memcpy( ( (opus_int32 *)&psDelDec[ RDmax_ind ] ) + i,
|
cannam@154
|
371 ( (opus_int32 *)&psDelDec[ RDmin_ind ] ) + i, sizeof( NSQ_del_dec_struct ) - i * sizeof( opus_int32) );
|
cannam@154
|
372 silk_memcpy( &psSampleState[ RDmax_ind ][ 0 ], &psSampleState[ RDmin_ind ][ 1 ], sizeof( NSQ_sample_struct ) );
|
cannam@154
|
373 }
|
cannam@154
|
374
|
cannam@154
|
375 /* Write samples from winner to output and long-term filter states */
|
cannam@154
|
376 psDD = &psDelDec[ Winner_ind ];
|
cannam@154
|
377 if( subfr > 0 || i >= decisionDelay ) {
|
cannam@154
|
378 pulses[ i - decisionDelay ] = (opus_int8)silk_RSHIFT_ROUND( psDD->Q_Q10[ last_smple_idx ], 10 );
|
cannam@154
|
379 xq[ i - decisionDelay ] = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND(
|
cannam@154
|
380 silk_SMULWW( psDD->Xq_Q14[ last_smple_idx ], delayedGain_Q10[ last_smple_idx ] ), 8 ) );
|
cannam@154
|
381 NSQ->sLTP_shp_Q14[ NSQ->sLTP_shp_buf_idx - decisionDelay ] = psDD->Shape_Q14[ last_smple_idx ];
|
cannam@154
|
382 sLTP_Q15[ NSQ->sLTP_buf_idx - decisionDelay ] = psDD->Pred_Q15[ last_smple_idx ];
|
cannam@154
|
383 }
|
cannam@154
|
384 NSQ->sLTP_shp_buf_idx++;
|
cannam@154
|
385 NSQ->sLTP_buf_idx++;
|
cannam@154
|
386
|
cannam@154
|
387 /* Update states */
|
cannam@154
|
388 for( k = 0; k < nStatesDelayedDecision; k++ ) {
|
cannam@154
|
389 psDD = &psDelDec[ k ];
|
cannam@154
|
390 psSS = &psSampleState[ k ][ 0 ];
|
cannam@154
|
391 psDD->LF_AR_Q14 = psSS->LF_AR_Q14;
|
cannam@154
|
392 psDD->sLPC_Q14[ NSQ_LPC_BUF_LENGTH + i ] = psSS->xq_Q14;
|
cannam@154
|
393 psDD->Xq_Q14[ *smpl_buf_idx ] = psSS->xq_Q14;
|
cannam@154
|
394 psDD->Q_Q10[ *smpl_buf_idx ] = psSS->Q_Q10;
|
cannam@154
|
395 psDD->Pred_Q15[ *smpl_buf_idx ] = silk_LSHIFT32( psSS->LPC_exc_Q14, 1 );
|
cannam@154
|
396 psDD->Shape_Q14[ *smpl_buf_idx ] = psSS->sLTP_shp_Q14;
|
cannam@154
|
397 psDD->Seed = silk_ADD32_ovflw( psDD->Seed, silk_RSHIFT_ROUND( psSS->Q_Q10, 10 ) );
|
cannam@154
|
398 psDD->RandState[ *smpl_buf_idx ] = psDD->Seed;
|
cannam@154
|
399 psDD->RD_Q10 = psSS->RD_Q10;
|
cannam@154
|
400 }
|
cannam@154
|
401 delayedGain_Q10[ *smpl_buf_idx ] = Gain_Q10;
|
cannam@154
|
402 }
|
cannam@154
|
403 /* Update LPC states */
|
cannam@154
|
404 for( k = 0; k < nStatesDelayedDecision; k++ ) {
|
cannam@154
|
405 psDD = &psDelDec[ k ];
|
cannam@154
|
406 silk_memcpy( psDD->sLPC_Q14, &psDD->sLPC_Q14[ length ], NSQ_LPC_BUF_LENGTH * sizeof( opus_int32 ) );
|
cannam@154
|
407 }
|
cannam@154
|
408 }
|
cannam@154
|
409
|
cannam@154
|
410 #endif /* __NSQ_DEL_DEC_MIPSR1_H__ */
|