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: /* Limit, stabilize, convert and quantize NLSFs */ michael@0: void silk_process_NLSFs( michael@0: silk_encoder_state *psEncC, /* I/O Encoder state */ michael@0: opus_int16 PredCoef_Q12[ 2 ][ MAX_LPC_ORDER ], /* O Prediction coefficients */ michael@0: opus_int16 pNLSF_Q15[ MAX_LPC_ORDER ], /* I/O Normalized LSFs (quant out) (0 - (2^15-1)) */ michael@0: const opus_int16 prev_NLSFq_Q15[ MAX_LPC_ORDER ] /* I Previous Normalized LSFs (0 - (2^15-1)) */ michael@0: ) michael@0: { michael@0: opus_int i, doInterpolate; michael@0: opus_int NLSF_mu_Q20; michael@0: opus_int32 i_sqr_Q15; michael@0: opus_int16 pNLSF0_temp_Q15[ MAX_LPC_ORDER ]; michael@0: opus_int16 pNLSFW_QW[ MAX_LPC_ORDER ]; michael@0: opus_int16 pNLSFW0_temp_QW[ MAX_LPC_ORDER ]; michael@0: michael@0: silk_assert( psEncC->speech_activity_Q8 >= 0 ); michael@0: silk_assert( psEncC->speech_activity_Q8 <= SILK_FIX_CONST( 1.0, 8 ) ); michael@0: silk_assert( psEncC->useInterpolatedNLSFs == 1 || psEncC->indices.NLSFInterpCoef_Q2 == ( 1 << 2 ) ); michael@0: michael@0: /***********************/ michael@0: /* Calculate mu values */ michael@0: /***********************/ michael@0: /* NLSF_mu = 0.003 - 0.0015 * psEnc->speech_activity; */ michael@0: NLSF_mu_Q20 = silk_SMLAWB( SILK_FIX_CONST( 0.003, 20 ), SILK_FIX_CONST( -0.001, 28 ), psEncC->speech_activity_Q8 ); michael@0: if( psEncC->nb_subfr == 2 ) { michael@0: /* Multiply by 1.5 for 10 ms packets */ michael@0: NLSF_mu_Q20 = silk_ADD_RSHIFT( NLSF_mu_Q20, NLSF_mu_Q20, 1 ); michael@0: } michael@0: michael@0: silk_assert( NLSF_mu_Q20 > 0 ); michael@0: silk_assert( NLSF_mu_Q20 <= SILK_FIX_CONST( 0.005, 20 ) ); michael@0: michael@0: /* Calculate NLSF weights */ michael@0: silk_NLSF_VQ_weights_laroia( pNLSFW_QW, pNLSF_Q15, psEncC->predictLPCOrder ); michael@0: michael@0: /* Update NLSF weights for interpolated NLSFs */ michael@0: doInterpolate = ( psEncC->useInterpolatedNLSFs == 1 ) && ( psEncC->indices.NLSFInterpCoef_Q2 < 4 ); michael@0: if( doInterpolate ) { michael@0: /* Calculate the interpolated NLSF vector for the first half */ michael@0: silk_interpolate( pNLSF0_temp_Q15, prev_NLSFq_Q15, pNLSF_Q15, michael@0: psEncC->indices.NLSFInterpCoef_Q2, psEncC->predictLPCOrder ); michael@0: michael@0: /* Calculate first half NLSF weights for the interpolated NLSFs */ michael@0: silk_NLSF_VQ_weights_laroia( pNLSFW0_temp_QW, pNLSF0_temp_Q15, psEncC->predictLPCOrder ); michael@0: michael@0: /* Update NLSF weights with contribution from first half */ michael@0: i_sqr_Q15 = silk_LSHIFT( silk_SMULBB( psEncC->indices.NLSFInterpCoef_Q2, psEncC->indices.NLSFInterpCoef_Q2 ), 11 ); michael@0: for( i = 0; i < psEncC->predictLPCOrder; i++ ) { michael@0: pNLSFW_QW[ i ] = silk_SMLAWB( silk_RSHIFT( pNLSFW_QW[ i ], 1 ), (opus_int32)pNLSFW0_temp_QW[ i ], i_sqr_Q15 ); michael@0: silk_assert( pNLSFW_QW[ i ] >= 1 ); michael@0: } michael@0: } michael@0: michael@0: silk_NLSF_encode( psEncC->indices.NLSFIndices, pNLSF_Q15, psEncC->psNLSF_CB, pNLSFW_QW, michael@0: NLSF_mu_Q20, psEncC->NLSF_MSVQ_Survivors, psEncC->indices.signalType ); michael@0: michael@0: /* Convert quantized NLSFs back to LPC coefficients */ michael@0: silk_NLSF2A( PredCoef_Q12[ 1 ], pNLSF_Q15, psEncC->predictLPCOrder ); michael@0: michael@0: if( doInterpolate ) { michael@0: /* Calculate the interpolated, quantized LSF vector for the first half */ michael@0: silk_interpolate( pNLSF0_temp_Q15, prev_NLSFq_Q15, pNLSF_Q15, michael@0: psEncC->indices.NLSFInterpCoef_Q2, psEncC->predictLPCOrder ); michael@0: michael@0: /* Convert back to LPC coefficients */ michael@0: silk_NLSF2A( PredCoef_Q12[ 0 ], pNLSF0_temp_Q15, psEncC->predictLPCOrder ); michael@0: michael@0: } else { michael@0: /* Copy LPC coefficients for first half from second half */ michael@0: silk_memcpy( PredCoef_Q12[ 0 ], PredCoef_Q12[ 1 ], psEncC->predictLPCOrder * sizeof( opus_int16 ) ); michael@0: } michael@0: }