cannam@154: /*********************************************************************** cannam@154: Copyright (c) 2006-2011, Skype Limited. All rights reserved. cannam@154: Redistribution and use in source and binary forms, with or without cannam@154: modification, are permitted provided that the following conditions cannam@154: are met: cannam@154: - Redistributions of source code must retain the above copyright notice, cannam@154: this list of conditions and the following disclaimer. cannam@154: - Redistributions in binary form must reproduce the above copyright cannam@154: notice, this list of conditions and the following disclaimer in the cannam@154: documentation and/or other materials provided with the distribution. cannam@154: - Neither the name of Internet Society, IETF or IETF Trust, nor the cannam@154: names of specific contributors, may be used to endorse or promote cannam@154: products derived from this software without specific prior written cannam@154: permission. cannam@154: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" cannam@154: AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE cannam@154: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE cannam@154: ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE cannam@154: LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR cannam@154: CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF cannam@154: SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS cannam@154: INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN cannam@154: CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) cannam@154: ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE cannam@154: POSSIBILITY OF SUCH DAMAGE. cannam@154: ***********************************************************************/ cannam@154: cannam@154: #ifdef HAVE_CONFIG_H cannam@154: #include "config.h" cannam@154: #endif cannam@154: cannam@154: #include "main_FIX.h" cannam@154: cannam@154: /* Residual energy: nrg = wxx - 2 * wXx * c + c' * wXX * c */ cannam@154: opus_int32 silk_residual_energy16_covar_FIX( cannam@154: const opus_int16 *c, /* I Prediction vector */ cannam@154: const opus_int32 *wXX, /* I Correlation matrix */ cannam@154: const opus_int32 *wXx, /* I Correlation vector */ cannam@154: opus_int32 wxx, /* I Signal energy */ cannam@154: opus_int D, /* I Dimension */ cannam@154: opus_int cQ /* I Q value for c vector 0 - 15 */ cannam@154: ) cannam@154: { cannam@154: opus_int i, j, lshifts, Qxtra; cannam@154: opus_int32 c_max, w_max, tmp, tmp2, nrg; cannam@154: opus_int cn[ MAX_MATRIX_SIZE ]; cannam@154: const opus_int32 *pRow; cannam@154: cannam@154: /* Safety checks */ cannam@154: celt_assert( D >= 0 ); cannam@154: celt_assert( D <= 16 ); cannam@154: celt_assert( cQ > 0 ); cannam@154: celt_assert( cQ < 16 ); cannam@154: cannam@154: lshifts = 16 - cQ; cannam@154: Qxtra = lshifts; cannam@154: cannam@154: c_max = 0; cannam@154: for( i = 0; i < D; i++ ) { cannam@154: c_max = silk_max_32( c_max, silk_abs( (opus_int32)c[ i ] ) ); cannam@154: } cannam@154: Qxtra = silk_min_int( Qxtra, silk_CLZ32( c_max ) - 17 ); cannam@154: cannam@154: w_max = silk_max_32( wXX[ 0 ], wXX[ D * D - 1 ] ); cannam@154: Qxtra = silk_min_int( Qxtra, silk_CLZ32( silk_MUL( D, silk_RSHIFT( silk_SMULWB( w_max, c_max ), 4 ) ) ) - 5 ); cannam@154: Qxtra = silk_max_int( Qxtra, 0 ); cannam@154: for( i = 0; i < D; i++ ) { cannam@154: cn[ i ] = silk_LSHIFT( ( opus_int )c[ i ], Qxtra ); cannam@154: silk_assert( silk_abs(cn[i]) <= ( silk_int16_MAX + 1 ) ); /* Check that silk_SMLAWB can be used */ cannam@154: } cannam@154: lshifts -= Qxtra; cannam@154: cannam@154: /* Compute wxx - 2 * wXx * c */ cannam@154: tmp = 0; cannam@154: for( i = 0; i < D; i++ ) { cannam@154: tmp = silk_SMLAWB( tmp, wXx[ i ], cn[ i ] ); cannam@154: } cannam@154: nrg = silk_RSHIFT( wxx, 1 + lshifts ) - tmp; /* Q: -lshifts - 1 */ cannam@154: cannam@154: /* Add c' * wXX * c, assuming wXX is symmetric */ cannam@154: tmp2 = 0; cannam@154: for( i = 0; i < D; i++ ) { cannam@154: tmp = 0; cannam@154: pRow = &wXX[ i * D ]; cannam@154: for( j = i + 1; j < D; j++ ) { cannam@154: tmp = silk_SMLAWB( tmp, pRow[ j ], cn[ j ] ); cannam@154: } cannam@154: tmp = silk_SMLAWB( tmp, silk_RSHIFT( pRow[ i ], 1 ), cn[ i ] ); cannam@154: tmp2 = silk_SMLAWB( tmp2, tmp, cn[ i ] ); cannam@154: } cannam@154: nrg = silk_ADD_LSHIFT32( nrg, tmp2, lshifts ); /* Q: -lshifts - 1 */ cannam@154: cannam@154: /* Keep one bit free always, because we add them for LSF interpolation */ cannam@154: if( nrg < 1 ) { cannam@154: nrg = 1; cannam@154: } else if( nrg > silk_RSHIFT( silk_int32_MAX, lshifts + 2 ) ) { cannam@154: nrg = silk_int32_MAX >> 1; cannam@154: } else { cannam@154: nrg = silk_LSHIFT( nrg, lshifts + 1 ); /* Q0 */ cannam@154: } cannam@154: return nrg; cannam@154: cannam@154: }