michael@0: /*********************************************************************** michael@0: Copyright (c) 2006-2011, Skype Limited. All rights reserved. michael@0: Redistribution and use in source and binary forms, with or without michael@0: modification, are permitted provided that the following conditions michael@0: are met: michael@0: - Redistributions of source code must retain the above copyright notice, michael@0: this list of conditions and the following disclaimer. michael@0: - Redistributions in binary form must reproduce the above copyright michael@0: notice, this list of conditions and the following disclaimer in the michael@0: documentation and/or other materials provided with the distribution. michael@0: - Neither the name of Internet Society, IETF or IETF Trust, nor the michael@0: names of specific contributors, may be used to endorse or promote michael@0: products derived from this software without specific prior written michael@0: permission. michael@0: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" michael@0: AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE michael@0: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE michael@0: ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE michael@0: LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR michael@0: CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF michael@0: SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS michael@0: INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN michael@0: CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) michael@0: ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE michael@0: POSSIBILITY OF SUCH DAMAGE. michael@0: ***********************************************************************/ michael@0: michael@0: #ifdef HAVE_CONFIG_H michael@0: #include "config.h" michael@0: #endif michael@0: michael@0: #include "main.h" michael@0: michael@0: /* Entropy constrained matrix-weighted VQ, hard-coded to 5-element vectors, for a single input data vector */ michael@0: void silk_VQ_WMat_EC( michael@0: opus_int8 *ind, /* O index of best codebook vector */ michael@0: opus_int32 *rate_dist_Q14, /* O best weighted quant error + mu * rate */ michael@0: opus_int *gain_Q7, /* O sum of absolute LTP coefficients */ michael@0: const opus_int16 *in_Q14, /* I input vector to be quantized */ michael@0: const opus_int32 *W_Q18, /* I weighting matrix */ michael@0: const opus_int8 *cb_Q7, /* I codebook */ michael@0: const opus_uint8 *cb_gain_Q7, /* I codebook effective gain */ michael@0: const opus_uint8 *cl_Q5, /* I code length for each codebook vector */ michael@0: const opus_int mu_Q9, /* I tradeoff betw. weighted error and rate */ michael@0: const opus_int32 max_gain_Q7, /* I maximum sum of absolute LTP coefficients */ michael@0: opus_int L /* I number of vectors in codebook */ michael@0: ) michael@0: { michael@0: opus_int k, gain_tmp_Q7; michael@0: const opus_int8 *cb_row_Q7; michael@0: opus_int16 diff_Q14[ 5 ]; michael@0: opus_int32 sum1_Q14, sum2_Q16; michael@0: michael@0: /* Loop over codebook */ michael@0: *rate_dist_Q14 = silk_int32_MAX; michael@0: cb_row_Q7 = cb_Q7; michael@0: for( k = 0; k < L; k++ ) { michael@0: gain_tmp_Q7 = cb_gain_Q7[k]; michael@0: michael@0: diff_Q14[ 0 ] = in_Q14[ 0 ] - silk_LSHIFT( cb_row_Q7[ 0 ], 7 ); michael@0: diff_Q14[ 1 ] = in_Q14[ 1 ] - silk_LSHIFT( cb_row_Q7[ 1 ], 7 ); michael@0: diff_Q14[ 2 ] = in_Q14[ 2 ] - silk_LSHIFT( cb_row_Q7[ 2 ], 7 ); michael@0: diff_Q14[ 3 ] = in_Q14[ 3 ] - silk_LSHIFT( cb_row_Q7[ 3 ], 7 ); michael@0: diff_Q14[ 4 ] = in_Q14[ 4 ] - silk_LSHIFT( cb_row_Q7[ 4 ], 7 ); michael@0: michael@0: /* Weighted rate */ michael@0: sum1_Q14 = silk_SMULBB( mu_Q9, cl_Q5[ k ] ); michael@0: michael@0: /* Penalty for too large gain */ michael@0: sum1_Q14 = silk_ADD_LSHIFT32( sum1_Q14, silk_max( silk_SUB32( gain_tmp_Q7, max_gain_Q7 ), 0 ), 10 ); michael@0: michael@0: silk_assert( sum1_Q14 >= 0 ); michael@0: michael@0: /* first row of W_Q18 */ michael@0: sum2_Q16 = silk_SMULWB( W_Q18[ 1 ], diff_Q14[ 1 ] ); michael@0: sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 2 ], diff_Q14[ 2 ] ); michael@0: sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 3 ], diff_Q14[ 3 ] ); michael@0: sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 4 ], diff_Q14[ 4 ] ); michael@0: sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 ); michael@0: sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 0 ], diff_Q14[ 0 ] ); michael@0: sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 0 ] ); michael@0: michael@0: /* second row of W_Q18 */ michael@0: sum2_Q16 = silk_SMULWB( W_Q18[ 7 ], diff_Q14[ 2 ] ); michael@0: sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 8 ], diff_Q14[ 3 ] ); michael@0: sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 9 ], diff_Q14[ 4 ] ); michael@0: sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 ); michael@0: sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 6 ], diff_Q14[ 1 ] ); michael@0: sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 1 ] ); michael@0: michael@0: /* third row of W_Q18 */ michael@0: sum2_Q16 = silk_SMULWB( W_Q18[ 13 ], diff_Q14[ 3 ] ); michael@0: sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 14 ], diff_Q14[ 4 ] ); michael@0: sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 ); michael@0: sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 12 ], diff_Q14[ 2 ] ); michael@0: sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 2 ] ); michael@0: michael@0: /* fourth row of W_Q18 */ michael@0: sum2_Q16 = silk_SMULWB( W_Q18[ 19 ], diff_Q14[ 4 ] ); michael@0: sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 ); michael@0: sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 18 ], diff_Q14[ 3 ] ); michael@0: sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 3 ] ); michael@0: michael@0: /* last row of W_Q18 */ michael@0: sum2_Q16 = silk_SMULWB( W_Q18[ 24 ], diff_Q14[ 4 ] ); michael@0: sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 4 ] ); michael@0: michael@0: silk_assert( sum1_Q14 >= 0 ); michael@0: michael@0: /* find best */ michael@0: if( sum1_Q14 < *rate_dist_Q14 ) { michael@0: *rate_dist_Q14 = sum1_Q14; michael@0: *ind = (opus_int8)k; michael@0: *gain_Q7 = gain_tmp_Q7; michael@0: } michael@0: michael@0: /* Go to next cbk vector */ michael@0: cb_row_Q7 += LTP_ORDER; michael@0: } michael@0: }