Thu, 22 Jan 2015 13:21:57 +0100
Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6
michael@0 | 1 | /*********************************************************************** |
michael@0 | 2 | Copyright (c) 2006-2011, Skype Limited. All rights reserved. |
michael@0 | 3 | Redistribution and use in source and binary forms, with or without |
michael@0 | 4 | modification, are permitted provided that the following conditions |
michael@0 | 5 | are met: |
michael@0 | 6 | - Redistributions of source code must retain the above copyright notice, |
michael@0 | 7 | this list of conditions and the following disclaimer. |
michael@0 | 8 | - Redistributions in binary form must reproduce the above copyright |
michael@0 | 9 | notice, this list of conditions and the following disclaimer in the |
michael@0 | 10 | documentation and/or other materials provided with the distribution. |
michael@0 | 11 | - Neither the name of Internet Society, IETF or IETF Trust, nor the |
michael@0 | 12 | names of specific contributors, may be used to endorse or promote |
michael@0 | 13 | products derived from this software without specific prior written |
michael@0 | 14 | permission. |
michael@0 | 15 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
michael@0 | 16 | AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
michael@0 | 17 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
michael@0 | 18 | ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
michael@0 | 19 | LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
michael@0 | 20 | CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
michael@0 | 21 | SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
michael@0 | 22 | INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
michael@0 | 23 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
michael@0 | 24 | ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
michael@0 | 25 | POSSIBILITY OF SUCH DAMAGE. |
michael@0 | 26 | ***********************************************************************/ |
michael@0 | 27 | |
michael@0 | 28 | #ifdef HAVE_CONFIG_H |
michael@0 | 29 | #include "config.h" |
michael@0 | 30 | #endif |
michael@0 | 31 | |
michael@0 | 32 | #include "main_FIX.h" |
michael@0 | 33 | |
michael@0 | 34 | /* Residual energy: nrg = wxx - 2 * wXx * c + c' * wXX * c */ |
michael@0 | 35 | opus_int32 silk_residual_energy16_covar_FIX( |
michael@0 | 36 | const opus_int16 *c, /* I Prediction vector */ |
michael@0 | 37 | const opus_int32 *wXX, /* I Correlation matrix */ |
michael@0 | 38 | const opus_int32 *wXx, /* I Correlation vector */ |
michael@0 | 39 | opus_int32 wxx, /* I Signal energy */ |
michael@0 | 40 | opus_int D, /* I Dimension */ |
michael@0 | 41 | opus_int cQ /* I Q value for c vector 0 - 15 */ |
michael@0 | 42 | ) |
michael@0 | 43 | { |
michael@0 | 44 | opus_int i, j, lshifts, Qxtra; |
michael@0 | 45 | opus_int32 c_max, w_max, tmp, tmp2, nrg; |
michael@0 | 46 | opus_int cn[ MAX_MATRIX_SIZE ]; |
michael@0 | 47 | const opus_int32 *pRow; |
michael@0 | 48 | |
michael@0 | 49 | /* Safety checks */ |
michael@0 | 50 | silk_assert( D >= 0 ); |
michael@0 | 51 | silk_assert( D <= 16 ); |
michael@0 | 52 | silk_assert( cQ > 0 ); |
michael@0 | 53 | silk_assert( cQ < 16 ); |
michael@0 | 54 | |
michael@0 | 55 | lshifts = 16 - cQ; |
michael@0 | 56 | Qxtra = lshifts; |
michael@0 | 57 | |
michael@0 | 58 | c_max = 0; |
michael@0 | 59 | for( i = 0; i < D; i++ ) { |
michael@0 | 60 | c_max = silk_max_32( c_max, silk_abs( (opus_int32)c[ i ] ) ); |
michael@0 | 61 | } |
michael@0 | 62 | Qxtra = silk_min_int( Qxtra, silk_CLZ32( c_max ) - 17 ); |
michael@0 | 63 | |
michael@0 | 64 | w_max = silk_max_32( wXX[ 0 ], wXX[ D * D - 1 ] ); |
michael@0 | 65 | Qxtra = silk_min_int( Qxtra, silk_CLZ32( silk_MUL( D, silk_RSHIFT( silk_SMULWB( w_max, c_max ), 4 ) ) ) - 5 ); |
michael@0 | 66 | Qxtra = silk_max_int( Qxtra, 0 ); |
michael@0 | 67 | for( i = 0; i < D; i++ ) { |
michael@0 | 68 | cn[ i ] = silk_LSHIFT( ( opus_int )c[ i ], Qxtra ); |
michael@0 | 69 | silk_assert( silk_abs(cn[i]) <= ( silk_int16_MAX + 1 ) ); /* Check that silk_SMLAWB can be used */ |
michael@0 | 70 | } |
michael@0 | 71 | lshifts -= Qxtra; |
michael@0 | 72 | |
michael@0 | 73 | /* Compute wxx - 2 * wXx * c */ |
michael@0 | 74 | tmp = 0; |
michael@0 | 75 | for( i = 0; i < D; i++ ) { |
michael@0 | 76 | tmp = silk_SMLAWB( tmp, wXx[ i ], cn[ i ] ); |
michael@0 | 77 | } |
michael@0 | 78 | nrg = silk_RSHIFT( wxx, 1 + lshifts ) - tmp; /* Q: -lshifts - 1 */ |
michael@0 | 79 | |
michael@0 | 80 | /* Add c' * wXX * c, assuming wXX is symmetric */ |
michael@0 | 81 | tmp2 = 0; |
michael@0 | 82 | for( i = 0; i < D; i++ ) { |
michael@0 | 83 | tmp = 0; |
michael@0 | 84 | pRow = &wXX[ i * D ]; |
michael@0 | 85 | for( j = i + 1; j < D; j++ ) { |
michael@0 | 86 | tmp = silk_SMLAWB( tmp, pRow[ j ], cn[ j ] ); |
michael@0 | 87 | } |
michael@0 | 88 | tmp = silk_SMLAWB( tmp, silk_RSHIFT( pRow[ i ], 1 ), cn[ i ] ); |
michael@0 | 89 | tmp2 = silk_SMLAWB( tmp2, tmp, cn[ i ] ); |
michael@0 | 90 | } |
michael@0 | 91 | nrg = silk_ADD_LSHIFT32( nrg, tmp2, lshifts ); /* Q: -lshifts - 1 */ |
michael@0 | 92 | |
michael@0 | 93 | /* Keep one bit free always, because we add them for LSF interpolation */ |
michael@0 | 94 | if( nrg < 1 ) { |
michael@0 | 95 | nrg = 1; |
michael@0 | 96 | } else if( nrg > silk_RSHIFT( silk_int32_MAX, lshifts + 2 ) ) { |
michael@0 | 97 | nrg = silk_int32_MAX >> 1; |
michael@0 | 98 | } else { |
michael@0 | 99 | nrg = silk_LSHIFT( nrg, lshifts + 1 ); /* Q0 */ |
michael@0 | 100 | } |
michael@0 | 101 | return nrg; |
michael@0 | 102 | |
michael@0 | 103 | } |