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 "main.h"
33*a58d3d2aSXin Li
34*a58d3d2aSXin Li /* Decode parameters from payload */
silk_decode_parameters(silk_decoder_state * psDec,silk_decoder_control * psDecCtrl,opus_int condCoding)35*a58d3d2aSXin Li void silk_decode_parameters(
36*a58d3d2aSXin Li silk_decoder_state *psDec, /* I/O State */
37*a58d3d2aSXin Li silk_decoder_control *psDecCtrl, /* I/O Decoder control */
38*a58d3d2aSXin Li opus_int condCoding /* I The type of conditional coding to use */
39*a58d3d2aSXin Li )
40*a58d3d2aSXin Li {
41*a58d3d2aSXin Li opus_int i, k, Ix;
42*a58d3d2aSXin Li opus_int16 pNLSF_Q15[ MAX_LPC_ORDER ], pNLSF0_Q15[ MAX_LPC_ORDER ];
43*a58d3d2aSXin Li const opus_int8 *cbk_ptr_Q7;
44*a58d3d2aSXin Li
45*a58d3d2aSXin Li /* Dequant Gains */
46*a58d3d2aSXin Li silk_gains_dequant( psDecCtrl->Gains_Q16, psDec->indices.GainsIndices,
47*a58d3d2aSXin Li &psDec->LastGainIndex, condCoding == CODE_CONDITIONALLY, psDec->nb_subfr );
48*a58d3d2aSXin Li
49*a58d3d2aSXin Li /****************/
50*a58d3d2aSXin Li /* Decode NLSFs */
51*a58d3d2aSXin Li /****************/
52*a58d3d2aSXin Li silk_NLSF_decode( pNLSF_Q15, psDec->indices.NLSFIndices, psDec->psNLSF_CB );
53*a58d3d2aSXin Li
54*a58d3d2aSXin Li /* Convert NLSF parameters to AR prediction filter coefficients */
55*a58d3d2aSXin Li silk_NLSF2A( psDecCtrl->PredCoef_Q12[ 1 ], pNLSF_Q15, psDec->LPC_order, psDec->arch );
56*a58d3d2aSXin Li
57*a58d3d2aSXin Li /* If just reset, e.g., because internal Fs changed, do not allow interpolation */
58*a58d3d2aSXin Li /* improves the case of packet loss in the first frame after a switch */
59*a58d3d2aSXin Li if( psDec->first_frame_after_reset == 1 ) {
60*a58d3d2aSXin Li psDec->indices.NLSFInterpCoef_Q2 = 4;
61*a58d3d2aSXin Li }
62*a58d3d2aSXin Li
63*a58d3d2aSXin Li if( psDec->indices.NLSFInterpCoef_Q2 < 4 ) {
64*a58d3d2aSXin Li /* Calculation of the interpolated NLSF0 vector from the interpolation factor, */
65*a58d3d2aSXin Li /* the previous NLSF1, and the current NLSF1 */
66*a58d3d2aSXin Li for( i = 0; i < psDec->LPC_order; i++ ) {
67*a58d3d2aSXin Li pNLSF0_Q15[ i ] = psDec->prevNLSF_Q15[ i ] + silk_RSHIFT( silk_MUL( psDec->indices.NLSFInterpCoef_Q2,
68*a58d3d2aSXin Li pNLSF_Q15[ i ] - psDec->prevNLSF_Q15[ i ] ), 2 );
69*a58d3d2aSXin Li }
70*a58d3d2aSXin Li
71*a58d3d2aSXin Li /* Convert NLSF parameters to AR prediction filter coefficients */
72*a58d3d2aSXin Li silk_NLSF2A( psDecCtrl->PredCoef_Q12[ 0 ], pNLSF0_Q15, psDec->LPC_order, psDec->arch );
73*a58d3d2aSXin Li } else {
74*a58d3d2aSXin Li /* Copy LPC coefficients for first half from second half */
75*a58d3d2aSXin Li silk_memcpy( psDecCtrl->PredCoef_Q12[ 0 ], psDecCtrl->PredCoef_Q12[ 1 ], psDec->LPC_order * sizeof( opus_int16 ) );
76*a58d3d2aSXin Li }
77*a58d3d2aSXin Li
78*a58d3d2aSXin Li silk_memcpy( psDec->prevNLSF_Q15, pNLSF_Q15, psDec->LPC_order * sizeof( opus_int16 ) );
79*a58d3d2aSXin Li
80*a58d3d2aSXin Li /* After a packet loss do BWE of LPC coefs */
81*a58d3d2aSXin Li if( psDec->lossCnt ) {
82*a58d3d2aSXin Li silk_bwexpander( psDecCtrl->PredCoef_Q12[ 0 ], psDec->LPC_order, BWE_AFTER_LOSS_Q16 );
83*a58d3d2aSXin Li silk_bwexpander( psDecCtrl->PredCoef_Q12[ 1 ], psDec->LPC_order, BWE_AFTER_LOSS_Q16 );
84*a58d3d2aSXin Li }
85*a58d3d2aSXin Li
86*a58d3d2aSXin Li if( psDec->indices.signalType == TYPE_VOICED ) {
87*a58d3d2aSXin Li /*********************/
88*a58d3d2aSXin Li /* Decode pitch lags */
89*a58d3d2aSXin Li /*********************/
90*a58d3d2aSXin Li
91*a58d3d2aSXin Li /* Decode pitch values */
92*a58d3d2aSXin Li silk_decode_pitch( psDec->indices.lagIndex, psDec->indices.contourIndex, psDecCtrl->pitchL, psDec->fs_kHz, psDec->nb_subfr );
93*a58d3d2aSXin Li
94*a58d3d2aSXin Li /* Decode Codebook Index */
95*a58d3d2aSXin Li cbk_ptr_Q7 = silk_LTP_vq_ptrs_Q7[ psDec->indices.PERIndex ]; /* set pointer to start of codebook */
96*a58d3d2aSXin Li
97*a58d3d2aSXin Li for( k = 0; k < psDec->nb_subfr; k++ ) {
98*a58d3d2aSXin Li Ix = psDec->indices.LTPIndex[ k ];
99*a58d3d2aSXin Li for( i = 0; i < LTP_ORDER; i++ ) {
100*a58d3d2aSXin Li psDecCtrl->LTPCoef_Q14[ k * LTP_ORDER + i ] = silk_LSHIFT( cbk_ptr_Q7[ Ix * LTP_ORDER + i ], 7 );
101*a58d3d2aSXin Li }
102*a58d3d2aSXin Li }
103*a58d3d2aSXin Li
104*a58d3d2aSXin Li /**********************/
105*a58d3d2aSXin Li /* Decode LTP scaling */
106*a58d3d2aSXin Li /**********************/
107*a58d3d2aSXin Li Ix = psDec->indices.LTP_scaleIndex;
108*a58d3d2aSXin Li psDecCtrl->LTP_scale_Q14 = silk_LTPScales_table_Q14[ Ix ];
109*a58d3d2aSXin Li } else {
110*a58d3d2aSXin Li silk_memset( psDecCtrl->pitchL, 0, psDec->nb_subfr * sizeof( opus_int ) );
111*a58d3d2aSXin Li silk_memset( psDecCtrl->LTPCoef_Q14, 0, LTP_ORDER * psDec->nb_subfr * sizeof( opus_int16 ) );
112*a58d3d2aSXin Li psDec->indices.PERIndex = 0;
113*a58d3d2aSXin Li psDecCtrl->LTP_scale_Q14 = 0;
114*a58d3d2aSXin Li }
115*a58d3d2aSXin Li }
116