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 /* Predictive dequantizer for NLSF residuals */
silk_NLSF_residual_dequant(opus_int16 x_Q10[],const opus_int8 indices[],const opus_uint8 pred_coef_Q8[],const opus_int quant_step_size_Q16,const opus_int16 order)35*a58d3d2aSXin Li static OPUS_INLINE void silk_NLSF_residual_dequant( /* O Returns RD value in Q30 */
36*a58d3d2aSXin Li opus_int16 x_Q10[], /* O Output [ order ] */
37*a58d3d2aSXin Li const opus_int8 indices[], /* I Quantization indices [ order ] */
38*a58d3d2aSXin Li const opus_uint8 pred_coef_Q8[], /* I Backward predictor coefs [ order ] */
39*a58d3d2aSXin Li const opus_int quant_step_size_Q16, /* I Quantization step size */
40*a58d3d2aSXin Li const opus_int16 order /* I Number of input values */
41*a58d3d2aSXin Li )
42*a58d3d2aSXin Li {
43*a58d3d2aSXin Li opus_int i, out_Q10, pred_Q10;
44*a58d3d2aSXin Li
45*a58d3d2aSXin Li out_Q10 = 0;
46*a58d3d2aSXin Li for( i = order-1; i >= 0; i-- ) {
47*a58d3d2aSXin Li pred_Q10 = silk_RSHIFT( silk_SMULBB( out_Q10, (opus_int16)pred_coef_Q8[ i ] ), 8 );
48*a58d3d2aSXin Li out_Q10 = silk_LSHIFT( indices[ i ], 10 );
49*a58d3d2aSXin Li if( out_Q10 > 0 ) {
50*a58d3d2aSXin Li out_Q10 = silk_SUB16( out_Q10, SILK_FIX_CONST( NLSF_QUANT_LEVEL_ADJ, 10 ) );
51*a58d3d2aSXin Li } else if( out_Q10 < 0 ) {
52*a58d3d2aSXin Li out_Q10 = silk_ADD16( out_Q10, SILK_FIX_CONST( NLSF_QUANT_LEVEL_ADJ, 10 ) );
53*a58d3d2aSXin Li }
54*a58d3d2aSXin Li out_Q10 = silk_SMLAWB( pred_Q10, (opus_int32)out_Q10, quant_step_size_Q16 );
55*a58d3d2aSXin Li x_Q10[ i ] = out_Q10;
56*a58d3d2aSXin Li }
57*a58d3d2aSXin Li }
58*a58d3d2aSXin Li
59*a58d3d2aSXin Li
60*a58d3d2aSXin Li /***********************/
61*a58d3d2aSXin Li /* NLSF vector decoder */
62*a58d3d2aSXin Li /***********************/
silk_NLSF_decode(opus_int16 * pNLSF_Q15,opus_int8 * NLSFIndices,const silk_NLSF_CB_struct * psNLSF_CB)63*a58d3d2aSXin Li void silk_NLSF_decode(
64*a58d3d2aSXin Li opus_int16 *pNLSF_Q15, /* O Quantized NLSF vector [ LPC_ORDER ] */
65*a58d3d2aSXin Li opus_int8 *NLSFIndices, /* I Codebook path vector [ LPC_ORDER + 1 ] */
66*a58d3d2aSXin Li const silk_NLSF_CB_struct *psNLSF_CB /* I Codebook object */
67*a58d3d2aSXin Li )
68*a58d3d2aSXin Li {
69*a58d3d2aSXin Li opus_int i;
70*a58d3d2aSXin Li opus_uint8 pred_Q8[ MAX_LPC_ORDER ];
71*a58d3d2aSXin Li opus_int16 ec_ix[ MAX_LPC_ORDER ];
72*a58d3d2aSXin Li opus_int16 res_Q10[ MAX_LPC_ORDER ];
73*a58d3d2aSXin Li opus_int32 NLSF_Q15_tmp;
74*a58d3d2aSXin Li const opus_uint8 *pCB_element;
75*a58d3d2aSXin Li const opus_int16 *pCB_Wght_Q9;
76*a58d3d2aSXin Li
77*a58d3d2aSXin Li /* Unpack entropy table indices and predictor for current CB1 index */
78*a58d3d2aSXin Li silk_NLSF_unpack( ec_ix, pred_Q8, psNLSF_CB, NLSFIndices[ 0 ] );
79*a58d3d2aSXin Li
80*a58d3d2aSXin Li /* Predictive residual dequantizer */
81*a58d3d2aSXin Li silk_NLSF_residual_dequant( res_Q10, &NLSFIndices[ 1 ], pred_Q8, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->order );
82*a58d3d2aSXin Li
83*a58d3d2aSXin Li /* Apply inverse square-rooted weights to first stage and add to output */
84*a58d3d2aSXin Li pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ NLSFIndices[ 0 ] * psNLSF_CB->order ];
85*a58d3d2aSXin Li pCB_Wght_Q9 = &psNLSF_CB->CB1_Wght_Q9[ NLSFIndices[ 0 ] * psNLSF_CB->order ];
86*a58d3d2aSXin Li for( i = 0; i < psNLSF_CB->order; i++ ) {
87*a58d3d2aSXin Li NLSF_Q15_tmp = silk_ADD_LSHIFT32( silk_DIV32_16( silk_LSHIFT( (opus_int32)res_Q10[ i ], 14 ), pCB_Wght_Q9[ i ] ), (opus_int16)pCB_element[ i ], 7 );
88*a58d3d2aSXin Li pNLSF_Q15[ i ] = (opus_int16)silk_LIMIT( NLSF_Q15_tmp, 0, 32767 );
89*a58d3d2aSXin Li }
90*a58d3d2aSXin Li
91*a58d3d2aSXin Li /* NLSF stabilization */
92*a58d3d2aSXin Li silk_NLSF_stabilize( pNLSF_Q15, psNLSF_CB->deltaMin_Q15, psNLSF_CB->order );
93*a58d3d2aSXin Li }
94