1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/media/libopus/silk/VQ_WMat_EC.c Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,120 @@
1.4 +/***********************************************************************
1.5 +Copyright (c) 2006-2011, Skype Limited. All rights reserved.
1.6 +Redistribution and use in source and binary forms, with or without
1.7 +modification, are permitted provided that the following conditions
1.8 +are met:
1.9 +- Redistributions of source code must retain the above copyright notice,
1.10 +this list of conditions and the following disclaimer.
1.11 +- Redistributions in binary form must reproduce the above copyright
1.12 +notice, this list of conditions and the following disclaimer in the
1.13 +documentation and/or other materials provided with the distribution.
1.14 +- Neither the name of Internet Society, IETF or IETF Trust, nor the
1.15 +names of specific contributors, may be used to endorse or promote
1.16 +products derived from this software without specific prior written
1.17 +permission.
1.18 +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
1.19 +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.20 +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.21 +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
1.22 +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
1.23 +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
1.24 +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
1.25 +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
1.26 +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
1.27 +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1.28 +POSSIBILITY OF SUCH DAMAGE.
1.29 +***********************************************************************/
1.30 +
1.31 +#ifdef HAVE_CONFIG_H
1.32 +#include "config.h"
1.33 +#endif
1.34 +
1.35 +#include "main.h"
1.36 +
1.37 +/* Entropy constrained matrix-weighted VQ, hard-coded to 5-element vectors, for a single input data vector */
1.38 +void silk_VQ_WMat_EC(
1.39 + opus_int8 *ind, /* O index of best codebook vector */
1.40 + opus_int32 *rate_dist_Q14, /* O best weighted quant error + mu * rate */
1.41 + opus_int *gain_Q7, /* O sum of absolute LTP coefficients */
1.42 + const opus_int16 *in_Q14, /* I input vector to be quantized */
1.43 + const opus_int32 *W_Q18, /* I weighting matrix */
1.44 + const opus_int8 *cb_Q7, /* I codebook */
1.45 + const opus_uint8 *cb_gain_Q7, /* I codebook effective gain */
1.46 + const opus_uint8 *cl_Q5, /* I code length for each codebook vector */
1.47 + const opus_int mu_Q9, /* I tradeoff betw. weighted error and rate */
1.48 + const opus_int32 max_gain_Q7, /* I maximum sum of absolute LTP coefficients */
1.49 + opus_int L /* I number of vectors in codebook */
1.50 +)
1.51 +{
1.52 + opus_int k, gain_tmp_Q7;
1.53 + const opus_int8 *cb_row_Q7;
1.54 + opus_int16 diff_Q14[ 5 ];
1.55 + opus_int32 sum1_Q14, sum2_Q16;
1.56 +
1.57 + /* Loop over codebook */
1.58 + *rate_dist_Q14 = silk_int32_MAX;
1.59 + cb_row_Q7 = cb_Q7;
1.60 + for( k = 0; k < L; k++ ) {
1.61 + gain_tmp_Q7 = cb_gain_Q7[k];
1.62 +
1.63 + diff_Q14[ 0 ] = in_Q14[ 0 ] - silk_LSHIFT( cb_row_Q7[ 0 ], 7 );
1.64 + diff_Q14[ 1 ] = in_Q14[ 1 ] - silk_LSHIFT( cb_row_Q7[ 1 ], 7 );
1.65 + diff_Q14[ 2 ] = in_Q14[ 2 ] - silk_LSHIFT( cb_row_Q7[ 2 ], 7 );
1.66 + diff_Q14[ 3 ] = in_Q14[ 3 ] - silk_LSHIFT( cb_row_Q7[ 3 ], 7 );
1.67 + diff_Q14[ 4 ] = in_Q14[ 4 ] - silk_LSHIFT( cb_row_Q7[ 4 ], 7 );
1.68 +
1.69 + /* Weighted rate */
1.70 + sum1_Q14 = silk_SMULBB( mu_Q9, cl_Q5[ k ] );
1.71 +
1.72 + /* Penalty for too large gain */
1.73 + sum1_Q14 = silk_ADD_LSHIFT32( sum1_Q14, silk_max( silk_SUB32( gain_tmp_Q7, max_gain_Q7 ), 0 ), 10 );
1.74 +
1.75 + silk_assert( sum1_Q14 >= 0 );
1.76 +
1.77 + /* first row of W_Q18 */
1.78 + sum2_Q16 = silk_SMULWB( W_Q18[ 1 ], diff_Q14[ 1 ] );
1.79 + sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 2 ], diff_Q14[ 2 ] );
1.80 + sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 3 ], diff_Q14[ 3 ] );
1.81 + sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 4 ], diff_Q14[ 4 ] );
1.82 + sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 );
1.83 + sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 0 ], diff_Q14[ 0 ] );
1.84 + sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 0 ] );
1.85 +
1.86 + /* second row of W_Q18 */
1.87 + sum2_Q16 = silk_SMULWB( W_Q18[ 7 ], diff_Q14[ 2 ] );
1.88 + sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 8 ], diff_Q14[ 3 ] );
1.89 + sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 9 ], diff_Q14[ 4 ] );
1.90 + sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 );
1.91 + sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 6 ], diff_Q14[ 1 ] );
1.92 + sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 1 ] );
1.93 +
1.94 + /* third row of W_Q18 */
1.95 + sum2_Q16 = silk_SMULWB( W_Q18[ 13 ], diff_Q14[ 3 ] );
1.96 + sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 14 ], diff_Q14[ 4 ] );
1.97 + sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 );
1.98 + sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 12 ], diff_Q14[ 2 ] );
1.99 + sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 2 ] );
1.100 +
1.101 + /* fourth row of W_Q18 */
1.102 + sum2_Q16 = silk_SMULWB( W_Q18[ 19 ], diff_Q14[ 4 ] );
1.103 + sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 );
1.104 + sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 18 ], diff_Q14[ 3 ] );
1.105 + sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 3 ] );
1.106 +
1.107 + /* last row of W_Q18 */
1.108 + sum2_Q16 = silk_SMULWB( W_Q18[ 24 ], diff_Q14[ 4 ] );
1.109 + sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 4 ] );
1.110 +
1.111 + silk_assert( sum1_Q14 >= 0 );
1.112 +
1.113 + /* find best */
1.114 + if( sum1_Q14 < *rate_dist_Q14 ) {
1.115 + *rate_dist_Q14 = sum1_Q14;
1.116 + *ind = (opus_int8)k;
1.117 + *gain_Q7 = gain_tmp_Q7;
1.118 + }
1.119 +
1.120 + /* Go to next cbk vector */
1.121 + cb_row_Q7 += LTP_ORDER;
1.122 + }
1.123 +}
