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 /* Entropy constrained matrix-weighted VQ, hard-coded to 5-element vectors, for a single input data vector */
silk_VQ_WMat_EC_c(opus_int8 * ind,opus_int32 * res_nrg_Q15,opus_int32 * rate_dist_Q8,opus_int * gain_Q7,const opus_int32 * XX_Q17,const opus_int32 * xX_Q17,const opus_int8 * cb_Q7,const opus_uint8 * cb_gain_Q7,const opus_uint8 * cl_Q5,const opus_int subfr_len,const opus_int32 max_gain_Q7,const opus_int L)35*a58d3d2aSXin Li void silk_VQ_WMat_EC_c(
36*a58d3d2aSXin Li opus_int8 *ind, /* O index of best codebook vector */
37*a58d3d2aSXin Li opus_int32 *res_nrg_Q15, /* O best residual energy */
38*a58d3d2aSXin Li opus_int32 *rate_dist_Q8, /* O best total bitrate */
39*a58d3d2aSXin Li opus_int *gain_Q7, /* O sum of absolute LTP coefficients */
40*a58d3d2aSXin Li const opus_int32 *XX_Q17, /* I correlation matrix */
41*a58d3d2aSXin Li const opus_int32 *xX_Q17, /* I correlation vector */
42*a58d3d2aSXin Li const opus_int8 *cb_Q7, /* I codebook */
43*a58d3d2aSXin Li const opus_uint8 *cb_gain_Q7, /* I codebook effective gain */
44*a58d3d2aSXin Li const opus_uint8 *cl_Q5, /* I code length for each codebook vector */
45*a58d3d2aSXin Li const opus_int subfr_len, /* I number of samples per subframe */
46*a58d3d2aSXin Li const opus_int32 max_gain_Q7, /* I maximum sum of absolute LTP coefficients */
47*a58d3d2aSXin Li const opus_int L /* I number of vectors in codebook */
48*a58d3d2aSXin Li )
49*a58d3d2aSXin Li {
50*a58d3d2aSXin Li opus_int k, gain_tmp_Q7;
51*a58d3d2aSXin Li const opus_int8 *cb_row_Q7;
52*a58d3d2aSXin Li opus_int32 neg_xX_Q24[ 5 ];
53*a58d3d2aSXin Li opus_int32 sum1_Q15, sum2_Q24;
54*a58d3d2aSXin Li opus_int32 bits_res_Q8, bits_tot_Q8;
55*a58d3d2aSXin Li
56*a58d3d2aSXin Li /* Negate and convert to new Q domain */
57*a58d3d2aSXin Li neg_xX_Q24[ 0 ] = -silk_LSHIFT32( xX_Q17[ 0 ], 7 );
58*a58d3d2aSXin Li neg_xX_Q24[ 1 ] = -silk_LSHIFT32( xX_Q17[ 1 ], 7 );
59*a58d3d2aSXin Li neg_xX_Q24[ 2 ] = -silk_LSHIFT32( xX_Q17[ 2 ], 7 );
60*a58d3d2aSXin Li neg_xX_Q24[ 3 ] = -silk_LSHIFT32( xX_Q17[ 3 ], 7 );
61*a58d3d2aSXin Li neg_xX_Q24[ 4 ] = -silk_LSHIFT32( xX_Q17[ 4 ], 7 );
62*a58d3d2aSXin Li
63*a58d3d2aSXin Li /* Loop over codebook */
64*a58d3d2aSXin Li *rate_dist_Q8 = silk_int32_MAX;
65*a58d3d2aSXin Li *res_nrg_Q15 = silk_int32_MAX;
66*a58d3d2aSXin Li cb_row_Q7 = cb_Q7;
67*a58d3d2aSXin Li /* If things go really bad, at least *ind is set to something safe. */
68*a58d3d2aSXin Li *ind = 0;
69*a58d3d2aSXin Li for( k = 0; k < L; k++ ) {
70*a58d3d2aSXin Li opus_int32 penalty;
71*a58d3d2aSXin Li gain_tmp_Q7 = cb_gain_Q7[k];
72*a58d3d2aSXin Li /* Weighted rate */
73*a58d3d2aSXin Li /* Quantization error: 1 - 2 * xX * cb + cb' * XX * cb */
74*a58d3d2aSXin Li sum1_Q15 = SILK_FIX_CONST( 1.001, 15 );
75*a58d3d2aSXin Li
76*a58d3d2aSXin Li /* Penalty for too large gain */
77*a58d3d2aSXin Li penalty = silk_LSHIFT32( silk_max( silk_SUB32( gain_tmp_Q7, max_gain_Q7 ), 0 ), 11 );
78*a58d3d2aSXin Li
79*a58d3d2aSXin Li /* first row of XX_Q17 */
80*a58d3d2aSXin Li sum2_Q24 = silk_MLA( neg_xX_Q24[ 0 ], XX_Q17[ 1 ], cb_row_Q7[ 1 ] );
81*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 2 ], cb_row_Q7[ 2 ] );
82*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 3 ], cb_row_Q7[ 3 ] );
83*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 4 ], cb_row_Q7[ 4 ] );
84*a58d3d2aSXin Li sum2_Q24 = silk_LSHIFT32( sum2_Q24, 1 );
85*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 0 ], cb_row_Q7[ 0 ] );
86*a58d3d2aSXin Li sum1_Q15 = silk_SMLAWB( sum1_Q15, sum2_Q24, cb_row_Q7[ 0 ] );
87*a58d3d2aSXin Li
88*a58d3d2aSXin Li /* second row of XX_Q17 */
89*a58d3d2aSXin Li sum2_Q24 = silk_MLA( neg_xX_Q24[ 1 ], XX_Q17[ 7 ], cb_row_Q7[ 2 ] );
90*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 8 ], cb_row_Q7[ 3 ] );
91*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 9 ], cb_row_Q7[ 4 ] );
92*a58d3d2aSXin Li sum2_Q24 = silk_LSHIFT32( sum2_Q24, 1 );
93*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 6 ], cb_row_Q7[ 1 ] );
94*a58d3d2aSXin Li sum1_Q15 = silk_SMLAWB( sum1_Q15, sum2_Q24, cb_row_Q7[ 1 ] );
95*a58d3d2aSXin Li
96*a58d3d2aSXin Li /* third row of XX_Q17 */
97*a58d3d2aSXin Li sum2_Q24 = silk_MLA( neg_xX_Q24[ 2 ], XX_Q17[ 13 ], cb_row_Q7[ 3 ] );
98*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 14 ], cb_row_Q7[ 4 ] );
99*a58d3d2aSXin Li sum2_Q24 = silk_LSHIFT32( sum2_Q24, 1 );
100*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 12 ], cb_row_Q7[ 2 ] );
101*a58d3d2aSXin Li sum1_Q15 = silk_SMLAWB( sum1_Q15, sum2_Q24, cb_row_Q7[ 2 ] );
102*a58d3d2aSXin Li
103*a58d3d2aSXin Li /* fourth row of XX_Q17 */
104*a58d3d2aSXin Li sum2_Q24 = silk_MLA( neg_xX_Q24[ 3 ], XX_Q17[ 19 ], cb_row_Q7[ 4 ] );
105*a58d3d2aSXin Li sum2_Q24 = silk_LSHIFT32( sum2_Q24, 1 );
106*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 18 ], cb_row_Q7[ 3 ] );
107*a58d3d2aSXin Li sum1_Q15 = silk_SMLAWB( sum1_Q15, sum2_Q24, cb_row_Q7[ 3 ] );
108*a58d3d2aSXin Li
109*a58d3d2aSXin Li /* last row of XX_Q17 */
110*a58d3d2aSXin Li sum2_Q24 = silk_LSHIFT32( neg_xX_Q24[ 4 ], 1 );
111*a58d3d2aSXin Li sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 24 ], cb_row_Q7[ 4 ] );
112*a58d3d2aSXin Li sum1_Q15 = silk_SMLAWB( sum1_Q15, sum2_Q24, cb_row_Q7[ 4 ] );
113*a58d3d2aSXin Li
114*a58d3d2aSXin Li /* find best */
115*a58d3d2aSXin Li if( sum1_Q15 >= 0 ) {
116*a58d3d2aSXin Li /* Translate residual energy to bits using high-rate assumption (6 dB ==> 1 bit/sample) */
117*a58d3d2aSXin Li bits_res_Q8 = silk_SMULBB( subfr_len, silk_lin2log( sum1_Q15 + penalty) - (15 << 7) );
118*a58d3d2aSXin Li /* In the following line we reduce the codelength component by half ("-1"); seems to slightly improve quality */
119*a58d3d2aSXin Li bits_tot_Q8 = silk_ADD_LSHIFT32( bits_res_Q8, cl_Q5[ k ], 3-1 );
120*a58d3d2aSXin Li if( bits_tot_Q8 <= *rate_dist_Q8 ) {
121*a58d3d2aSXin Li *rate_dist_Q8 = bits_tot_Q8;
122*a58d3d2aSXin Li *res_nrg_Q15 = sum1_Q15 + penalty;
123*a58d3d2aSXin Li *ind = (opus_int8)k;
124*a58d3d2aSXin Li *gain_Q7 = gain_tmp_Q7;
125*a58d3d2aSXin Li }
126*a58d3d2aSXin Li }
127*a58d3d2aSXin Li
128*a58d3d2aSXin Li /* Go to next cbk vector */
129*a58d3d2aSXin Li cb_row_Q7 += LTP_ORDER;
130*a58d3d2aSXin Li }
131*a58d3d2aSXin Li }
132