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 "main.h"
|
cannam@154
|
33 #include "stack_alloc.h"
|
cannam@154
|
34
|
cannam@154
|
35 /**********************************************************/
|
cannam@154
|
36 /* Core decoder. Performs inverse NSQ operation LTP + LPC */
|
cannam@154
|
37 /**********************************************************/
|
cannam@154
|
38 void silk_decode_core(
|
cannam@154
|
39 silk_decoder_state *psDec, /* I/O Decoder state */
|
cannam@154
|
40 silk_decoder_control *psDecCtrl, /* I Decoder control */
|
cannam@154
|
41 opus_int16 xq[], /* O Decoded speech */
|
cannam@154
|
42 const opus_int16 pulses[ MAX_FRAME_LENGTH ], /* I Pulse signal */
|
cannam@154
|
43 int arch /* I Run-time architecture */
|
cannam@154
|
44 )
|
cannam@154
|
45 {
|
cannam@154
|
46 opus_int i, k, lag = 0, start_idx, sLTP_buf_idx, NLSF_interpolation_flag, signalType;
|
cannam@154
|
47 opus_int16 *A_Q12, *B_Q14, *pxq, A_Q12_tmp[ MAX_LPC_ORDER ];
|
cannam@154
|
48 VARDECL( opus_int16, sLTP );
|
cannam@154
|
49 VARDECL( opus_int32, sLTP_Q15 );
|
cannam@154
|
50 opus_int32 LTP_pred_Q13, LPC_pred_Q10, Gain_Q10, inv_gain_Q31, gain_adj_Q16, rand_seed, offset_Q10;
|
cannam@154
|
51 opus_int32 *pred_lag_ptr, *pexc_Q14, *pres_Q14;
|
cannam@154
|
52 VARDECL( opus_int32, res_Q14 );
|
cannam@154
|
53 VARDECL( opus_int32, sLPC_Q14 );
|
cannam@154
|
54 SAVE_STACK;
|
cannam@154
|
55
|
cannam@154
|
56 silk_assert( psDec->prev_gain_Q16 != 0 );
|
cannam@154
|
57
|
cannam@154
|
58 ALLOC( sLTP, psDec->ltp_mem_length, opus_int16 );
|
cannam@154
|
59 ALLOC( sLTP_Q15, psDec->ltp_mem_length + psDec->frame_length, opus_int32 );
|
cannam@154
|
60 ALLOC( res_Q14, psDec->subfr_length, opus_int32 );
|
cannam@154
|
61 ALLOC( sLPC_Q14, psDec->subfr_length + MAX_LPC_ORDER, opus_int32 );
|
cannam@154
|
62
|
cannam@154
|
63 offset_Q10 = silk_Quantization_Offsets_Q10[ psDec->indices.signalType >> 1 ][ psDec->indices.quantOffsetType ];
|
cannam@154
|
64
|
cannam@154
|
65 if( psDec->indices.NLSFInterpCoef_Q2 < 1 << 2 ) {
|
cannam@154
|
66 NLSF_interpolation_flag = 1;
|
cannam@154
|
67 } else {
|
cannam@154
|
68 NLSF_interpolation_flag = 0;
|
cannam@154
|
69 }
|
cannam@154
|
70
|
cannam@154
|
71 /* Decode excitation */
|
cannam@154
|
72 rand_seed = psDec->indices.Seed;
|
cannam@154
|
73 for( i = 0; i < psDec->frame_length; i++ ) {
|
cannam@154
|
74 rand_seed = silk_RAND( rand_seed );
|
cannam@154
|
75 psDec->exc_Q14[ i ] = silk_LSHIFT( (opus_int32)pulses[ i ], 14 );
|
cannam@154
|
76 if( psDec->exc_Q14[ i ] > 0 ) {
|
cannam@154
|
77 psDec->exc_Q14[ i ] -= QUANT_LEVEL_ADJUST_Q10 << 4;
|
cannam@154
|
78 } else
|
cannam@154
|
79 if( psDec->exc_Q14[ i ] < 0 ) {
|
cannam@154
|
80 psDec->exc_Q14[ i ] += QUANT_LEVEL_ADJUST_Q10 << 4;
|
cannam@154
|
81 }
|
cannam@154
|
82 psDec->exc_Q14[ i ] += offset_Q10 << 4;
|
cannam@154
|
83 if( rand_seed < 0 ) {
|
cannam@154
|
84 psDec->exc_Q14[ i ] = -psDec->exc_Q14[ i ];
|
cannam@154
|
85 }
|
cannam@154
|
86
|
cannam@154
|
87 rand_seed = silk_ADD32_ovflw( rand_seed, pulses[ i ] );
|
cannam@154
|
88 }
|
cannam@154
|
89
|
cannam@154
|
90 /* Copy LPC state */
|
cannam@154
|
91 silk_memcpy( sLPC_Q14, psDec->sLPC_Q14_buf, MAX_LPC_ORDER * sizeof( opus_int32 ) );
|
cannam@154
|
92
|
cannam@154
|
93 pexc_Q14 = psDec->exc_Q14;
|
cannam@154
|
94 pxq = xq;
|
cannam@154
|
95 sLTP_buf_idx = psDec->ltp_mem_length;
|
cannam@154
|
96 /* Loop over subframes */
|
cannam@154
|
97 for( k = 0; k < psDec->nb_subfr; k++ ) {
|
cannam@154
|
98 pres_Q14 = res_Q14;
|
cannam@154
|
99 A_Q12 = psDecCtrl->PredCoef_Q12[ k >> 1 ];
|
cannam@154
|
100
|
cannam@154
|
101 /* Preload LPC coeficients to array on stack. Gives small performance gain */
|
cannam@154
|
102 silk_memcpy( A_Q12_tmp, A_Q12, psDec->LPC_order * sizeof( opus_int16 ) );
|
cannam@154
|
103 B_Q14 = &psDecCtrl->LTPCoef_Q14[ k * LTP_ORDER ];
|
cannam@154
|
104 signalType = psDec->indices.signalType;
|
cannam@154
|
105
|
cannam@154
|
106 Gain_Q10 = silk_RSHIFT( psDecCtrl->Gains_Q16[ k ], 6 );
|
cannam@154
|
107 inv_gain_Q31 = silk_INVERSE32_varQ( psDecCtrl->Gains_Q16[ k ], 47 );
|
cannam@154
|
108
|
cannam@154
|
109 /* Calculate gain adjustment factor */
|
cannam@154
|
110 if( psDecCtrl->Gains_Q16[ k ] != psDec->prev_gain_Q16 ) {
|
cannam@154
|
111 gain_adj_Q16 = silk_DIV32_varQ( psDec->prev_gain_Q16, psDecCtrl->Gains_Q16[ k ], 16 );
|
cannam@154
|
112
|
cannam@154
|
113 /* Scale short term state */
|
cannam@154
|
114 for( i = 0; i < MAX_LPC_ORDER; i++ ) {
|
cannam@154
|
115 sLPC_Q14[ i ] = silk_SMULWW( gain_adj_Q16, sLPC_Q14[ i ] );
|
cannam@154
|
116 }
|
cannam@154
|
117 } else {
|
cannam@154
|
118 gain_adj_Q16 = (opus_int32)1 << 16;
|
cannam@154
|
119 }
|
cannam@154
|
120
|
cannam@154
|
121 /* Save inv_gain */
|
cannam@154
|
122 silk_assert( inv_gain_Q31 != 0 );
|
cannam@154
|
123 psDec->prev_gain_Q16 = psDecCtrl->Gains_Q16[ k ];
|
cannam@154
|
124
|
cannam@154
|
125 /* Avoid abrupt transition from voiced PLC to unvoiced normal decoding */
|
cannam@154
|
126 if( psDec->lossCnt && psDec->prevSignalType == TYPE_VOICED &&
|
cannam@154
|
127 psDec->indices.signalType != TYPE_VOICED && k < MAX_NB_SUBFR/2 ) {
|
cannam@154
|
128
|
cannam@154
|
129 silk_memset( B_Q14, 0, LTP_ORDER * sizeof( opus_int16 ) );
|
cannam@154
|
130 B_Q14[ LTP_ORDER/2 ] = SILK_FIX_CONST( 0.25, 14 );
|
cannam@154
|
131
|
cannam@154
|
132 signalType = TYPE_VOICED;
|
cannam@154
|
133 psDecCtrl->pitchL[ k ] = psDec->lagPrev;
|
cannam@154
|
134 }
|
cannam@154
|
135
|
cannam@154
|
136 if( signalType == TYPE_VOICED ) {
|
cannam@154
|
137 /* Voiced */
|
cannam@154
|
138 lag = psDecCtrl->pitchL[ k ];
|
cannam@154
|
139
|
cannam@154
|
140 /* Re-whitening */
|
cannam@154
|
141 if( k == 0 || ( k == 2 && NLSF_interpolation_flag ) ) {
|
cannam@154
|
142 /* Rewhiten with new A coefs */
|
cannam@154
|
143 start_idx = psDec->ltp_mem_length - lag - psDec->LPC_order - LTP_ORDER / 2;
|
cannam@154
|
144 celt_assert( start_idx > 0 );
|
cannam@154
|
145
|
cannam@154
|
146 if( k == 2 ) {
|
cannam@154
|
147 silk_memcpy( &psDec->outBuf[ psDec->ltp_mem_length ], xq, 2 * psDec->subfr_length * sizeof( opus_int16 ) );
|
cannam@154
|
148 }
|
cannam@154
|
149
|
cannam@154
|
150 silk_LPC_analysis_filter( &sLTP[ start_idx ], &psDec->outBuf[ start_idx + k * psDec->subfr_length ],
|
cannam@154
|
151 A_Q12, psDec->ltp_mem_length - start_idx, psDec->LPC_order, arch );
|
cannam@154
|
152
|
cannam@154
|
153 /* After rewhitening the LTP state is unscaled */
|
cannam@154
|
154 if( k == 0 ) {
|
cannam@154
|
155 /* Do LTP downscaling to reduce inter-packet dependency */
|
cannam@154
|
156 inv_gain_Q31 = silk_LSHIFT( silk_SMULWB( inv_gain_Q31, psDecCtrl->LTP_scale_Q14 ), 2 );
|
cannam@154
|
157 }
|
cannam@154
|
158 for( i = 0; i < lag + LTP_ORDER/2; i++ ) {
|
cannam@154
|
159 sLTP_Q15[ sLTP_buf_idx - i - 1 ] = silk_SMULWB( inv_gain_Q31, sLTP[ psDec->ltp_mem_length - i - 1 ] );
|
cannam@154
|
160 }
|
cannam@154
|
161 } else {
|
cannam@154
|
162 /* Update LTP state when Gain changes */
|
cannam@154
|
163 if( gain_adj_Q16 != (opus_int32)1 << 16 ) {
|
cannam@154
|
164 for( i = 0; i < lag + LTP_ORDER/2; i++ ) {
|
cannam@154
|
165 sLTP_Q15[ sLTP_buf_idx - i - 1 ] = silk_SMULWW( gain_adj_Q16, sLTP_Q15[ sLTP_buf_idx - i - 1 ] );
|
cannam@154
|
166 }
|
cannam@154
|
167 }
|
cannam@154
|
168 }
|
cannam@154
|
169 }
|
cannam@154
|
170
|
cannam@154
|
171 /* Long-term prediction */
|
cannam@154
|
172 if( signalType == TYPE_VOICED ) {
|
cannam@154
|
173 /* Set up pointer */
|
cannam@154
|
174 pred_lag_ptr = &sLTP_Q15[ sLTP_buf_idx - lag + LTP_ORDER / 2 ];
|
cannam@154
|
175 for( i = 0; i < psDec->subfr_length; i++ ) {
|
cannam@154
|
176 /* Unrolled loop */
|
cannam@154
|
177 /* Avoids introducing a bias because silk_SMLAWB() always rounds to -inf */
|
cannam@154
|
178 LTP_pred_Q13 = 2;
|
cannam@154
|
179 LTP_pred_Q13 = silk_SMLAWB( LTP_pred_Q13, pred_lag_ptr[ 0 ], B_Q14[ 0 ] );
|
cannam@154
|
180 LTP_pred_Q13 = silk_SMLAWB( LTP_pred_Q13, pred_lag_ptr[ -1 ], B_Q14[ 1 ] );
|
cannam@154
|
181 LTP_pred_Q13 = silk_SMLAWB( LTP_pred_Q13, pred_lag_ptr[ -2 ], B_Q14[ 2 ] );
|
cannam@154
|
182 LTP_pred_Q13 = silk_SMLAWB( LTP_pred_Q13, pred_lag_ptr[ -3 ], B_Q14[ 3 ] );
|
cannam@154
|
183 LTP_pred_Q13 = silk_SMLAWB( LTP_pred_Q13, pred_lag_ptr[ -4 ], B_Q14[ 4 ] );
|
cannam@154
|
184 pred_lag_ptr++;
|
cannam@154
|
185
|
cannam@154
|
186 /* Generate LPC excitation */
|
cannam@154
|
187 pres_Q14[ i ] = silk_ADD_LSHIFT32( pexc_Q14[ i ], LTP_pred_Q13, 1 );
|
cannam@154
|
188
|
cannam@154
|
189 /* Update states */
|
cannam@154
|
190 sLTP_Q15[ sLTP_buf_idx ] = silk_LSHIFT( pres_Q14[ i ], 1 );
|
cannam@154
|
191 sLTP_buf_idx++;
|
cannam@154
|
192 }
|
cannam@154
|
193 } else {
|
cannam@154
|
194 pres_Q14 = pexc_Q14;
|
cannam@154
|
195 }
|
cannam@154
|
196
|
cannam@154
|
197 for( i = 0; i < psDec->subfr_length; i++ ) {
|
cannam@154
|
198 /* Short-term prediction */
|
cannam@154
|
199 celt_assert( psDec->LPC_order == 10 || psDec->LPC_order == 16 );
|
cannam@154
|
200 /* Avoids introducing a bias because silk_SMLAWB() always rounds to -inf */
|
cannam@154
|
201 LPC_pred_Q10 = silk_RSHIFT( psDec->LPC_order, 1 );
|
cannam@154
|
202 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 1 ], A_Q12_tmp[ 0 ] );
|
cannam@154
|
203 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 2 ], A_Q12_tmp[ 1 ] );
|
cannam@154
|
204 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 3 ], A_Q12_tmp[ 2 ] );
|
cannam@154
|
205 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 4 ], A_Q12_tmp[ 3 ] );
|
cannam@154
|
206 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 5 ], A_Q12_tmp[ 4 ] );
|
cannam@154
|
207 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 6 ], A_Q12_tmp[ 5 ] );
|
cannam@154
|
208 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 7 ], A_Q12_tmp[ 6 ] );
|
cannam@154
|
209 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 8 ], A_Q12_tmp[ 7 ] );
|
cannam@154
|
210 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 9 ], A_Q12_tmp[ 8 ] );
|
cannam@154
|
211 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 10 ], A_Q12_tmp[ 9 ] );
|
cannam@154
|
212 if( psDec->LPC_order == 16 ) {
|
cannam@154
|
213 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 11 ], A_Q12_tmp[ 10 ] );
|
cannam@154
|
214 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 12 ], A_Q12_tmp[ 11 ] );
|
cannam@154
|
215 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 13 ], A_Q12_tmp[ 12 ] );
|
cannam@154
|
216 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 14 ], A_Q12_tmp[ 13 ] );
|
cannam@154
|
217 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 15 ], A_Q12_tmp[ 14 ] );
|
cannam@154
|
218 LPC_pred_Q10 = silk_SMLAWB( LPC_pred_Q10, sLPC_Q14[ MAX_LPC_ORDER + i - 16 ], A_Q12_tmp[ 15 ] );
|
cannam@154
|
219 }
|
cannam@154
|
220
|
cannam@154
|
221 /* Add prediction to LPC excitation */
|
cannam@154
|
222 sLPC_Q14[ MAX_LPC_ORDER + i ] = silk_ADD_SAT32( pres_Q14[ i ], silk_LSHIFT_SAT32( LPC_pred_Q10, 4 ) );
|
cannam@154
|
223
|
cannam@154
|
224 /* Scale with gain */
|
cannam@154
|
225 pxq[ i ] = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( silk_SMULWW( sLPC_Q14[ MAX_LPC_ORDER + i ], Gain_Q10 ), 8 ) );
|
cannam@154
|
226 }
|
cannam@154
|
227
|
cannam@154
|
228 /* Update LPC filter state */
|
cannam@154
|
229 silk_memcpy( sLPC_Q14, &sLPC_Q14[ psDec->subfr_length ], MAX_LPC_ORDER * sizeof( opus_int32 ) );
|
cannam@154
|
230 pexc_Q14 += psDec->subfr_length;
|
cannam@154
|
231 pxq += psDec->subfr_length;
|
cannam@154
|
232 }
|
cannam@154
|
233
|
cannam@154
|
234 /* Save LPC state */
|
cannam@154
|
235 silk_memcpy( psDec->sLPC_Q14_buf, sLPC_Q14, MAX_LPC_ORDER * sizeof( opus_int32 ) );
|
cannam@154
|
236 RESTORE_STACK;
|
cannam@154
|
237 }
|