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_FIX.h" michael@0: #include "stack_alloc.h" michael@0: michael@0: void silk_find_pred_coefs_FIX( michael@0: silk_encoder_state_FIX *psEnc, /* I/O encoder state */ michael@0: silk_encoder_control_FIX *psEncCtrl, /* I/O encoder control */ michael@0: const opus_int16 res_pitch[], /* I Residual from pitch analysis */ michael@0: const opus_int16 x[], /* I Speech signal */ michael@0: opus_int condCoding /* I The type of conditional coding to use */ michael@0: ) michael@0: { michael@0: opus_int i; michael@0: opus_int32 invGains_Q16[ MAX_NB_SUBFR ], local_gains[ MAX_NB_SUBFR ], Wght_Q15[ MAX_NB_SUBFR ]; michael@0: opus_int16 NLSF_Q15[ MAX_LPC_ORDER ]; michael@0: const opus_int16 *x_ptr; michael@0: opus_int16 *x_pre_ptr; michael@0: VARDECL( opus_int16, LPC_in_pre ); michael@0: opus_int32 tmp, min_gain_Q16, minInvGain_Q30; michael@0: opus_int LTP_corrs_rshift[ MAX_NB_SUBFR ]; michael@0: SAVE_STACK; michael@0: michael@0: /* weighting for weighted least squares */ michael@0: min_gain_Q16 = silk_int32_MAX >> 6; michael@0: for( i = 0; i < psEnc->sCmn.nb_subfr; i++ ) { michael@0: min_gain_Q16 = silk_min( min_gain_Q16, psEncCtrl->Gains_Q16[ i ] ); michael@0: } michael@0: for( i = 0; i < psEnc->sCmn.nb_subfr; i++ ) { michael@0: /* Divide to Q16 */ michael@0: silk_assert( psEncCtrl->Gains_Q16[ i ] > 0 ); michael@0: /* Invert and normalize gains, and ensure that maximum invGains_Q16 is within range of a 16 bit int */ michael@0: invGains_Q16[ i ] = silk_DIV32_varQ( min_gain_Q16, psEncCtrl->Gains_Q16[ i ], 16 - 2 ); michael@0: michael@0: /* Ensure Wght_Q15 a minimum value 1 */ michael@0: invGains_Q16[ i ] = silk_max( invGains_Q16[ i ], 363 ); michael@0: michael@0: /* Square the inverted gains */ michael@0: silk_assert( invGains_Q16[ i ] == silk_SAT16( invGains_Q16[ i ] ) ); michael@0: tmp = silk_SMULWB( invGains_Q16[ i ], invGains_Q16[ i ] ); michael@0: Wght_Q15[ i ] = silk_RSHIFT( tmp, 1 ); michael@0: michael@0: /* Invert the inverted and normalized gains */ michael@0: local_gains[ i ] = silk_DIV32( ( (opus_int32)1 << 16 ), invGains_Q16[ i ] ); michael@0: } michael@0: michael@0: ALLOC( LPC_in_pre, michael@0: psEnc->sCmn.nb_subfr * psEnc->sCmn.predictLPCOrder michael@0: + psEnc->sCmn.frame_length, opus_int16 ); michael@0: if( psEnc->sCmn.indices.signalType == TYPE_VOICED ) { michael@0: VARDECL( opus_int32, WLTP ); michael@0: michael@0: /**********/ michael@0: /* VOICED */ michael@0: /**********/ michael@0: silk_assert( psEnc->sCmn.ltp_mem_length - psEnc->sCmn.predictLPCOrder >= psEncCtrl->pitchL[ 0 ] + LTP_ORDER / 2 ); michael@0: michael@0: ALLOC( WLTP, psEnc->sCmn.nb_subfr * LTP_ORDER * LTP_ORDER, opus_int32 ); michael@0: michael@0: /* LTP analysis */ michael@0: silk_find_LTP_FIX( psEncCtrl->LTPCoef_Q14, WLTP, &psEncCtrl->LTPredCodGain_Q7, michael@0: res_pitch, psEncCtrl->pitchL, Wght_Q15, psEnc->sCmn.subfr_length, michael@0: psEnc->sCmn.nb_subfr, psEnc->sCmn.ltp_mem_length, LTP_corrs_rshift ); michael@0: michael@0: /* Quantize LTP gain parameters */ michael@0: silk_quant_LTP_gains( psEncCtrl->LTPCoef_Q14, psEnc->sCmn.indices.LTPIndex, &psEnc->sCmn.indices.PERIndex, michael@0: &psEnc->sCmn.sum_log_gain_Q7, WLTP, psEnc->sCmn.mu_LTP_Q9, psEnc->sCmn.LTPQuantLowComplexity, psEnc->sCmn.nb_subfr); michael@0: michael@0: /* Control LTP scaling */ michael@0: silk_LTP_scale_ctrl_FIX( psEnc, psEncCtrl, condCoding ); michael@0: michael@0: /* Create LTP residual */ michael@0: silk_LTP_analysis_filter_FIX( LPC_in_pre, x - psEnc->sCmn.predictLPCOrder, psEncCtrl->LTPCoef_Q14, michael@0: psEncCtrl->pitchL, invGains_Q16, psEnc->sCmn.subfr_length, psEnc->sCmn.nb_subfr, psEnc->sCmn.predictLPCOrder ); michael@0: michael@0: } else { michael@0: /************/ michael@0: /* UNVOICED */ michael@0: /************/ michael@0: /* Create signal with prepended subframes, scaled by inverse gains */ michael@0: x_ptr = x - psEnc->sCmn.predictLPCOrder; michael@0: x_pre_ptr = LPC_in_pre; michael@0: for( i = 0; i < psEnc->sCmn.nb_subfr; i++ ) { michael@0: silk_scale_copy_vector16( x_pre_ptr, x_ptr, invGains_Q16[ i ], michael@0: psEnc->sCmn.subfr_length + psEnc->sCmn.predictLPCOrder ); michael@0: x_pre_ptr += psEnc->sCmn.subfr_length + psEnc->sCmn.predictLPCOrder; michael@0: x_ptr += psEnc->sCmn.subfr_length; michael@0: } michael@0: michael@0: silk_memset( psEncCtrl->LTPCoef_Q14, 0, psEnc->sCmn.nb_subfr * LTP_ORDER * sizeof( opus_int16 ) ); michael@0: psEncCtrl->LTPredCodGain_Q7 = 0; michael@0: psEnc->sCmn.sum_log_gain_Q7 = 0; michael@0: } michael@0: michael@0: /* Limit on total predictive coding gain */ michael@0: if( psEnc->sCmn.first_frame_after_reset ) { michael@0: minInvGain_Q30 = SILK_FIX_CONST( 1.0f / MAX_PREDICTION_POWER_GAIN_AFTER_RESET, 30 ); michael@0: } else { michael@0: minInvGain_Q30 = silk_log2lin( silk_SMLAWB( 16 << 7, (opus_int32)psEncCtrl->LTPredCodGain_Q7, SILK_FIX_CONST( 1.0 / 3, 16 ) ) ); /* Q16 */ michael@0: minInvGain_Q30 = silk_DIV32_varQ( minInvGain_Q30, michael@0: silk_SMULWW( SILK_FIX_CONST( MAX_PREDICTION_POWER_GAIN, 0 ), michael@0: silk_SMLAWB( SILK_FIX_CONST( 0.25, 18 ), SILK_FIX_CONST( 0.75, 18 ), psEncCtrl->coding_quality_Q14 ) ), 14 ); michael@0: } michael@0: michael@0: /* LPC_in_pre contains the LTP-filtered input for voiced, and the unfiltered input for unvoiced */ michael@0: silk_find_LPC_FIX( &psEnc->sCmn, NLSF_Q15, LPC_in_pre, minInvGain_Q30 ); michael@0: michael@0: /* Quantize LSFs */ michael@0: silk_process_NLSFs( &psEnc->sCmn, psEncCtrl->PredCoef_Q12, NLSF_Q15, psEnc->sCmn.prev_NLSFq_Q15 ); michael@0: michael@0: /* Calculate residual energy using quantized LPC coefficients */ michael@0: silk_residual_energy_FIX( psEncCtrl->ResNrg, psEncCtrl->ResNrgQ, LPC_in_pre, psEncCtrl->PredCoef_Q12, local_gains, michael@0: psEnc->sCmn.subfr_length, psEnc->sCmn.nb_subfr, psEnc->sCmn.predictLPCOrder ); michael@0: michael@0: /* Copy to prediction struct for use in next frame for interpolation */ michael@0: silk_memcpy( psEnc->sCmn.prev_NLSFq_Q15, NLSF_Q15, sizeof( psEnc->sCmn.prev_NLSFq_Q15 ) ); michael@0: RESTORE_STACK; michael@0: }