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