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 /* NLSF vector encoder */
|
cannam@154
|
37 /***********************/
|
cannam@154
|
38 opus_int32 silk_NLSF_encode( /* O Returns RD value in Q25 */
|
cannam@154
|
39 opus_int8 *NLSFIndices, /* I Codebook path vector [ LPC_ORDER + 1 ] */
|
cannam@154
|
40 opus_int16 *pNLSF_Q15, /* I/O (Un)quantized NLSF vector [ LPC_ORDER ] */
|
cannam@154
|
41 const silk_NLSF_CB_struct *psNLSF_CB, /* I Codebook object */
|
cannam@154
|
42 const opus_int16 *pW_Q2, /* I NLSF weight vector [ LPC_ORDER ] */
|
cannam@154
|
43 const opus_int NLSF_mu_Q20, /* I Rate weight for the RD optimization */
|
cannam@154
|
44 const opus_int nSurvivors, /* I Max survivors after first stage */
|
cannam@154
|
45 const opus_int signalType /* I Signal type: 0/1/2 */
|
cannam@154
|
46 )
|
cannam@154
|
47 {
|
cannam@154
|
48 opus_int i, s, ind1, bestIndex, prob_Q8, bits_q7;
|
cannam@154
|
49 opus_int32 W_tmp_Q9, ret;
|
cannam@154
|
50 VARDECL( opus_int32, err_Q24 );
|
cannam@154
|
51 VARDECL( opus_int32, RD_Q25 );
|
cannam@154
|
52 VARDECL( opus_int, tempIndices1 );
|
cannam@154
|
53 VARDECL( opus_int8, tempIndices2 );
|
cannam@154
|
54 opus_int16 res_Q10[ MAX_LPC_ORDER ];
|
cannam@154
|
55 opus_int16 NLSF_tmp_Q15[ MAX_LPC_ORDER ];
|
cannam@154
|
56 opus_int16 W_adj_Q5[ MAX_LPC_ORDER ];
|
cannam@154
|
57 opus_uint8 pred_Q8[ MAX_LPC_ORDER ];
|
cannam@154
|
58 opus_int16 ec_ix[ MAX_LPC_ORDER ];
|
cannam@154
|
59 const opus_uint8 *pCB_element, *iCDF_ptr;
|
cannam@154
|
60 const opus_int16 *pCB_Wght_Q9;
|
cannam@154
|
61 SAVE_STACK;
|
cannam@154
|
62
|
cannam@154
|
63 celt_assert( signalType >= 0 && signalType <= 2 );
|
cannam@154
|
64 silk_assert( NLSF_mu_Q20 <= 32767 && NLSF_mu_Q20 >= 0 );
|
cannam@154
|
65
|
cannam@154
|
66 /* NLSF stabilization */
|
cannam@154
|
67 silk_NLSF_stabilize( pNLSF_Q15, psNLSF_CB->deltaMin_Q15, psNLSF_CB->order );
|
cannam@154
|
68
|
cannam@154
|
69 /* First stage: VQ */
|
cannam@154
|
70 ALLOC( err_Q24, psNLSF_CB->nVectors, opus_int32 );
|
cannam@154
|
71 silk_NLSF_VQ( err_Q24, pNLSF_Q15, psNLSF_CB->CB1_NLSF_Q8, psNLSF_CB->CB1_Wght_Q9, psNLSF_CB->nVectors, psNLSF_CB->order );
|
cannam@154
|
72
|
cannam@154
|
73 /* Sort the quantization errors */
|
cannam@154
|
74 ALLOC( tempIndices1, nSurvivors, opus_int );
|
cannam@154
|
75 silk_insertion_sort_increasing( err_Q24, tempIndices1, psNLSF_CB->nVectors, nSurvivors );
|
cannam@154
|
76
|
cannam@154
|
77 ALLOC( RD_Q25, nSurvivors, opus_int32 );
|
cannam@154
|
78 ALLOC( tempIndices2, nSurvivors * MAX_LPC_ORDER, opus_int8 );
|
cannam@154
|
79
|
cannam@154
|
80 /* Loop over survivors */
|
cannam@154
|
81 for( s = 0; s < nSurvivors; s++ ) {
|
cannam@154
|
82 ind1 = tempIndices1[ s ];
|
cannam@154
|
83
|
cannam@154
|
84 /* Residual after first stage */
|
cannam@154
|
85 pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ ind1 * psNLSF_CB->order ];
|
cannam@154
|
86 pCB_Wght_Q9 = &psNLSF_CB->CB1_Wght_Q9[ ind1 * psNLSF_CB->order ];
|
cannam@154
|
87 for( i = 0; i < psNLSF_CB->order; i++ ) {
|
cannam@154
|
88 NLSF_tmp_Q15[ i ] = silk_LSHIFT16( (opus_int16)pCB_element[ i ], 7 );
|
cannam@154
|
89 W_tmp_Q9 = pCB_Wght_Q9[ i ];
|
cannam@154
|
90 res_Q10[ i ] = (opus_int16)silk_RSHIFT( silk_SMULBB( pNLSF_Q15[ i ] - NLSF_tmp_Q15[ i ], W_tmp_Q9 ), 14 );
|
cannam@154
|
91 W_adj_Q5[ i ] = silk_DIV32_varQ( (opus_int32)pW_Q2[ i ], silk_SMULBB( W_tmp_Q9, W_tmp_Q9 ), 21 );
|
cannam@154
|
92 }
|
cannam@154
|
93
|
cannam@154
|
94 /* Unpack entropy table indices and predictor for current CB1 index */
|
cannam@154
|
95 silk_NLSF_unpack( ec_ix, pred_Q8, psNLSF_CB, ind1 );
|
cannam@154
|
96
|
cannam@154
|
97 /* Trellis quantizer */
|
cannam@154
|
98 RD_Q25[ s ] = silk_NLSF_del_dec_quant( &tempIndices2[ s * MAX_LPC_ORDER ], res_Q10, W_adj_Q5, pred_Q8, ec_ix,
|
cannam@154
|
99 psNLSF_CB->ec_Rates_Q5, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->invQuantStepSize_Q6, NLSF_mu_Q20, psNLSF_CB->order );
|
cannam@154
|
100
|
cannam@154
|
101 /* Add rate for first stage */
|
cannam@154
|
102 iCDF_ptr = &psNLSF_CB->CB1_iCDF[ ( signalType >> 1 ) * psNLSF_CB->nVectors ];
|
cannam@154
|
103 if( ind1 == 0 ) {
|
cannam@154
|
104 prob_Q8 = 256 - iCDF_ptr[ ind1 ];
|
cannam@154
|
105 } else {
|
cannam@154
|
106 prob_Q8 = iCDF_ptr[ ind1 - 1 ] - iCDF_ptr[ ind1 ];
|
cannam@154
|
107 }
|
cannam@154
|
108 bits_q7 = ( 8 << 7 ) - silk_lin2log( prob_Q8 );
|
cannam@154
|
109 RD_Q25[ s ] = silk_SMLABB( RD_Q25[ s ], bits_q7, silk_RSHIFT( NLSF_mu_Q20, 2 ) );
|
cannam@154
|
110 }
|
cannam@154
|
111
|
cannam@154
|
112 /* Find the lowest rate-distortion error */
|
cannam@154
|
113 silk_insertion_sort_increasing( RD_Q25, &bestIndex, nSurvivors, 1 );
|
cannam@154
|
114
|
cannam@154
|
115 NLSFIndices[ 0 ] = (opus_int8)tempIndices1[ bestIndex ];
|
cannam@154
|
116 silk_memcpy( &NLSFIndices[ 1 ], &tempIndices2[ bestIndex * MAX_LPC_ORDER ], psNLSF_CB->order * sizeof( opus_int8 ) );
|
cannam@154
|
117
|
cannam@154
|
118 /* Decode */
|
cannam@154
|
119 silk_NLSF_decode( pNLSF_Q15, NLSFIndices, psNLSF_CB );
|
cannam@154
|
120
|
cannam@154
|
121 ret = RD_Q25[ 0 ];
|
cannam@154
|
122 RESTORE_STACK;
|
cannam@154
|
123 return ret;
|
cannam@154
|
124 }
|