Chris@69: /*********************************************************************** Chris@69: Copyright (c) 2006-2011, Skype Limited. All rights reserved. Chris@69: Redistribution and use in source and binary forms, with or without Chris@69: modification, are permitted provided that the following conditions Chris@69: are met: Chris@69: - Redistributions of source code must retain the above copyright notice, Chris@69: this list of conditions and the following disclaimer. Chris@69: - Redistributions in binary form must reproduce the above copyright Chris@69: notice, this list of conditions and the following disclaimer in the Chris@69: documentation and/or other materials provided with the distribution. Chris@69: - Neither the name of Internet Society, IETF or IETF Trust, nor the Chris@69: names of specific contributors, may be used to endorse or promote Chris@69: products derived from this software without specific prior written Chris@69: permission. Chris@69: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" Chris@69: AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE Chris@69: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE Chris@69: ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE Chris@69: LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR Chris@69: CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF Chris@69: SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS Chris@69: INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN Chris@69: CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) Chris@69: ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE Chris@69: POSSIBILITY OF SUCH DAMAGE. Chris@69: ***********************************************************************/ Chris@69: Chris@69: #ifdef HAVE_CONFIG_H Chris@69: #include "config.h" Chris@69: #endif Chris@69: Chris@69: #include "main.h" Chris@69: Chris@69: /* Entropy constrained matrix-weighted VQ, hard-coded to 5-element vectors, for a single input data vector */ Chris@69: void silk_VQ_WMat_EC_c( Chris@69: opus_int8 *ind, /* O index of best codebook vector */ Chris@69: opus_int32 *res_nrg_Q15, /* O best residual energy */ Chris@69: opus_int32 *rate_dist_Q8, /* O best total bitrate */ Chris@69: opus_int *gain_Q7, /* O sum of absolute LTP coefficients */ Chris@69: const opus_int32 *XX_Q17, /* I correlation matrix */ Chris@69: const opus_int32 *xX_Q17, /* I correlation vector */ Chris@69: const opus_int8 *cb_Q7, /* I codebook */ Chris@69: const opus_uint8 *cb_gain_Q7, /* I codebook effective gain */ Chris@69: const opus_uint8 *cl_Q5, /* I code length for each codebook vector */ Chris@69: const opus_int subfr_len, /* I number of samples per subframe */ Chris@69: const opus_int32 max_gain_Q7, /* I maximum sum of absolute LTP coefficients */ Chris@69: const opus_int L /* I number of vectors in codebook */ Chris@69: ) Chris@69: { Chris@69: opus_int k, gain_tmp_Q7; Chris@69: const opus_int8 *cb_row_Q7; Chris@69: opus_int32 neg_xX_Q24[ 5 ]; Chris@69: opus_int32 sum1_Q15, sum2_Q24; Chris@69: opus_int32 bits_res_Q8, bits_tot_Q8; Chris@69: Chris@69: /* Negate and convert to new Q domain */ Chris@69: neg_xX_Q24[ 0 ] = -silk_LSHIFT32( xX_Q17[ 0 ], 7 ); Chris@69: neg_xX_Q24[ 1 ] = -silk_LSHIFT32( xX_Q17[ 1 ], 7 ); Chris@69: neg_xX_Q24[ 2 ] = -silk_LSHIFT32( xX_Q17[ 2 ], 7 ); Chris@69: neg_xX_Q24[ 3 ] = -silk_LSHIFT32( xX_Q17[ 3 ], 7 ); Chris@69: neg_xX_Q24[ 4 ] = -silk_LSHIFT32( xX_Q17[ 4 ], 7 ); Chris@69: Chris@69: /* Loop over codebook */ Chris@69: *rate_dist_Q8 = silk_int32_MAX; Chris@69: *res_nrg_Q15 = silk_int32_MAX; Chris@69: cb_row_Q7 = cb_Q7; Chris@69: /* In things go really bad, at least *ind is set to something safe. */ Chris@69: *ind = 0; Chris@69: for( k = 0; k < L; k++ ) { Chris@69: opus_int32 penalty; Chris@69: gain_tmp_Q7 = cb_gain_Q7[k]; Chris@69: /* Weighted rate */ Chris@69: /* Quantization error: 1 - 2 * xX * cb + cb' * XX * cb */ Chris@69: sum1_Q15 = SILK_FIX_CONST( 1.001, 15 ); Chris@69: Chris@69: /* Penalty for too large gain */ Chris@69: penalty = silk_LSHIFT32( silk_max( silk_SUB32( gain_tmp_Q7, max_gain_Q7 ), 0 ), 11 ); Chris@69: Chris@69: /* first row of XX_Q17 */ Chris@69: sum2_Q24 = silk_MLA( neg_xX_Q24[ 0 ], XX_Q17[ 1 ], cb_row_Q7[ 1 ] ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 2 ], cb_row_Q7[ 2 ] ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 3 ], cb_row_Q7[ 3 ] ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 4 ], cb_row_Q7[ 4 ] ); Chris@69: sum2_Q24 = silk_LSHIFT32( sum2_Q24, 1 ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 0 ], cb_row_Q7[ 0 ] ); Chris@69: sum1_Q15 = silk_SMLAWB( sum1_Q15, sum2_Q24, cb_row_Q7[ 0 ] ); Chris@69: Chris@69: /* second row of XX_Q17 */ Chris@69: sum2_Q24 = silk_MLA( neg_xX_Q24[ 1 ], XX_Q17[ 7 ], cb_row_Q7[ 2 ] ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 8 ], cb_row_Q7[ 3 ] ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 9 ], cb_row_Q7[ 4 ] ); Chris@69: sum2_Q24 = silk_LSHIFT32( sum2_Q24, 1 ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 6 ], cb_row_Q7[ 1 ] ); Chris@69: sum1_Q15 = silk_SMLAWB( sum1_Q15, sum2_Q24, cb_row_Q7[ 1 ] ); Chris@69: Chris@69: /* third row of XX_Q17 */ Chris@69: sum2_Q24 = silk_MLA( neg_xX_Q24[ 2 ], XX_Q17[ 13 ], cb_row_Q7[ 3 ] ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 14 ], cb_row_Q7[ 4 ] ); Chris@69: sum2_Q24 = silk_LSHIFT32( sum2_Q24, 1 ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 12 ], cb_row_Q7[ 2 ] ); Chris@69: sum1_Q15 = silk_SMLAWB( sum1_Q15, sum2_Q24, cb_row_Q7[ 2 ] ); Chris@69: Chris@69: /* fourth row of XX_Q17 */ Chris@69: sum2_Q24 = silk_MLA( neg_xX_Q24[ 3 ], XX_Q17[ 19 ], cb_row_Q7[ 4 ] ); Chris@69: sum2_Q24 = silk_LSHIFT32( sum2_Q24, 1 ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 18 ], cb_row_Q7[ 3 ] ); Chris@69: sum1_Q15 = silk_SMLAWB( sum1_Q15, sum2_Q24, cb_row_Q7[ 3 ] ); Chris@69: Chris@69: /* last row of XX_Q17 */ Chris@69: sum2_Q24 = silk_LSHIFT32( neg_xX_Q24[ 4 ], 1 ); Chris@69: sum2_Q24 = silk_MLA( sum2_Q24, XX_Q17[ 24 ], cb_row_Q7[ 4 ] ); Chris@69: sum1_Q15 = silk_SMLAWB( sum1_Q15, sum2_Q24, cb_row_Q7[ 4 ] ); Chris@69: Chris@69: /* find best */ Chris@69: if( sum1_Q15 >= 0 ) { Chris@69: /* Translate residual energy to bits using high-rate assumption (6 dB ==> 1 bit/sample) */ Chris@69: bits_res_Q8 = silk_SMULBB( subfr_len, silk_lin2log( sum1_Q15 + penalty) - (15 << 7) ); Chris@69: /* In the following line we reduce the codelength component by half ("-1"); seems to slghtly improve quality */ Chris@69: bits_tot_Q8 = silk_ADD_LSHIFT32( bits_res_Q8, cl_Q5[ k ], 3-1 ); Chris@69: if( bits_tot_Q8 <= *rate_dist_Q8 ) { Chris@69: *rate_dist_Q8 = bits_tot_Q8; Chris@69: *res_nrg_Q15 = sum1_Q15 + penalty; Chris@69: *ind = (opus_int8)k; Chris@69: *gain_Q7 = gain_tmp_Q7; Chris@69: } Chris@69: } Chris@69: Chris@69: /* Go to next cbk vector */ Chris@69: cb_row_Q7 += LTP_ORDER; Chris@69: } Chris@69: }