media/libopus/silk/NLSF_decode.c@b8a032363ba2 (annotated)
media/libopus/silk/NLSF_decode.c
Thu, 22 Jan 2015 13:21:57 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Thu, 22 Jan 2015 13:21:57 +0100
- branch
- TOR_BUG_9701
- changeset 15
- b8a032363ba2
- permissions
- -rw-r--r--
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.h" |
| michael@0 | 33 | |
| michael@0 | 34 | /* Predictive dequantizer for NLSF residuals */ |
| michael@0 | 35 | static OPUS_INLINE void silk_NLSF_residual_dequant( /* O Returns RD value in Q30 */ |
| michael@0 | 36 | opus_int16 x_Q10[], /* O Output [ order ] */ |
| michael@0 | 37 | const opus_int8 indices[], /* I Quantization indices [ order ] */ |
| michael@0 | 38 | const opus_uint8 pred_coef_Q8[], /* I Backward predictor coefs [ order ] */ |
| michael@0 | 39 | const opus_int quant_step_size_Q16, /* I Quantization step size */ |
| michael@0 | 40 | const opus_int16 order /* I Number of input values */ |
| michael@0 | 41 | ) |
| michael@0 | 42 | { |
| michael@0 | 43 | opus_int i, out_Q10, pred_Q10; |
| michael@0 | 44 | |
| michael@0 | 45 | out_Q10 = 0; |
| michael@0 | 46 | for( i = order-1; i >= 0; i-- ) { |
| michael@0 | 47 | pred_Q10 = silk_RSHIFT( silk_SMULBB( out_Q10, (opus_int16)pred_coef_Q8[ i ] ), 8 ); |
| michael@0 | 48 | out_Q10 = silk_LSHIFT( indices[ i ], 10 ); |
| michael@0 | 49 | if( out_Q10 > 0 ) { |
| michael@0 | 50 | out_Q10 = silk_SUB16( out_Q10, SILK_FIX_CONST( NLSF_QUANT_LEVEL_ADJ, 10 ) ); |
| michael@0 | 51 | } else if( out_Q10 < 0 ) { |
| michael@0 | 52 | out_Q10 = silk_ADD16( out_Q10, SILK_FIX_CONST( NLSF_QUANT_LEVEL_ADJ, 10 ) ); |
| michael@0 | 53 | } |
| michael@0 | 54 | out_Q10 = silk_SMLAWB( pred_Q10, (opus_int32)out_Q10, quant_step_size_Q16 ); |
| michael@0 | 55 | x_Q10[ i ] = out_Q10; |
| michael@0 | 56 | } |
| michael@0 | 57 | } |
| michael@0 | 58 | |
| michael@0 | 59 | |
| michael@0 | 60 | /***********************/ |
| michael@0 | 61 | /* NLSF vector decoder */ |
| michael@0 | 62 | /***********************/ |
| michael@0 | 63 | void silk_NLSF_decode( |
| michael@0 | 64 | opus_int16 *pNLSF_Q15, /* O Quantized NLSF vector [ LPC_ORDER ] */ |
| michael@0 | 65 | opus_int8 *NLSFIndices, /* I Codebook path vector [ LPC_ORDER + 1 ] */ |
| michael@0 | 66 | const silk_NLSF_CB_struct *psNLSF_CB /* I Codebook object */ |
| michael@0 | 67 | ) |
| michael@0 | 68 | { |
| michael@0 | 69 | opus_int i; |
| michael@0 | 70 | opus_uint8 pred_Q8[ MAX_LPC_ORDER ]; |
| michael@0 | 71 | opus_int16 ec_ix[ MAX_LPC_ORDER ]; |
| michael@0 | 72 | opus_int16 res_Q10[ MAX_LPC_ORDER ]; |
| michael@0 | 73 | opus_int16 W_tmp_QW[ MAX_LPC_ORDER ]; |
| michael@0 | 74 | opus_int32 W_tmp_Q9, NLSF_Q15_tmp; |
| michael@0 | 75 | const opus_uint8 *pCB_element; |
| michael@0 | 76 | |
| michael@0 | 77 | /* Decode first stage */ |
| michael@0 | 78 | pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ NLSFIndices[ 0 ] * psNLSF_CB->order ]; |
| michael@0 | 79 | for( i = 0; i < psNLSF_CB->order; i++ ) { |
| michael@0 | 80 | pNLSF_Q15[ i ] = silk_LSHIFT( (opus_int16)pCB_element[ i ], 7 ); |
| michael@0 | 81 | } |
| michael@0 | 82 | |
| michael@0 | 83 | /* Unpack entropy table indices and predictor for current CB1 index */ |
| michael@0 | 84 | silk_NLSF_unpack( ec_ix, pred_Q8, psNLSF_CB, NLSFIndices[ 0 ] ); |
| michael@0 | 85 | |
| michael@0 | 86 | /* Predictive residual dequantizer */ |
| michael@0 | 87 | silk_NLSF_residual_dequant( res_Q10, &NLSFIndices[ 1 ], pred_Q8, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->order ); |
| michael@0 | 88 | |
| michael@0 | 89 | /* Weights from codebook vector */ |
| michael@0 | 90 | silk_NLSF_VQ_weights_laroia( W_tmp_QW, pNLSF_Q15, psNLSF_CB->order ); |
| michael@0 | 91 | |
| michael@0 | 92 | /* Apply inverse square-rooted weights and add to output */ |
| michael@0 | 93 | for( i = 0; i < psNLSF_CB->order; i++ ) { |
| michael@0 | 94 | W_tmp_Q9 = silk_SQRT_APPROX( silk_LSHIFT( (opus_int32)W_tmp_QW[ i ], 18 - NLSF_W_Q ) ); |
| michael@0 | 95 | NLSF_Q15_tmp = silk_ADD32( pNLSF_Q15[ i ], silk_DIV32_16( silk_LSHIFT( (opus_int32)res_Q10[ i ], 14 ), W_tmp_Q9 ) ); |
| michael@0 | 96 | pNLSF_Q15[ i ] = (opus_int16)silk_LIMIT( NLSF_Q15_tmp, 0, 32767 ); |
| michael@0 | 97 | } |
| michael@0 | 98 | |
| michael@0 | 99 | /* NLSF stabilization */ |
| michael@0 | 100 | silk_NLSF_stabilize( pNLSF_Q15, psNLSF_CB->deltaMin_Q15, psNLSF_CB->order ); |
| michael@0 | 101 | } |
