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.h" cannam@154: #include "stack_alloc.h" cannam@154: cannam@154: /***********************/ cannam@154: /* NLSF vector encoder */ cannam@154: /***********************/ cannam@154: opus_int32 silk_NLSF_encode( /* O Returns RD value in Q25 */ cannam@154: opus_int8 *NLSFIndices, /* I Codebook path vector [ LPC_ORDER + 1 ] */ cannam@154: opus_int16 *pNLSF_Q15, /* I/O (Un)quantized NLSF vector [ LPC_ORDER ] */ cannam@154: const silk_NLSF_CB_struct *psNLSF_CB, /* I Codebook object */ cannam@154: const opus_int16 *pW_Q2, /* I NLSF weight vector [ LPC_ORDER ] */ cannam@154: const opus_int NLSF_mu_Q20, /* I Rate weight for the RD optimization */ cannam@154: const opus_int nSurvivors, /* I Max survivors after first stage */ cannam@154: const opus_int signalType /* I Signal type: 0/1/2 */ cannam@154: ) cannam@154: { cannam@154: opus_int i, s, ind1, bestIndex, prob_Q8, bits_q7; cannam@154: opus_int32 W_tmp_Q9, ret; cannam@154: VARDECL( opus_int32, err_Q24 ); cannam@154: VARDECL( opus_int32, RD_Q25 ); cannam@154: VARDECL( opus_int, tempIndices1 ); cannam@154: VARDECL( opus_int8, tempIndices2 ); cannam@154: opus_int16 res_Q10[ MAX_LPC_ORDER ]; cannam@154: opus_int16 NLSF_tmp_Q15[ MAX_LPC_ORDER ]; cannam@154: opus_int16 W_adj_Q5[ MAX_LPC_ORDER ]; cannam@154: opus_uint8 pred_Q8[ MAX_LPC_ORDER ]; cannam@154: opus_int16 ec_ix[ MAX_LPC_ORDER ]; cannam@154: const opus_uint8 *pCB_element, *iCDF_ptr; cannam@154: const opus_int16 *pCB_Wght_Q9; cannam@154: SAVE_STACK; cannam@154: cannam@154: celt_assert( signalType >= 0 && signalType <= 2 ); cannam@154: silk_assert( NLSF_mu_Q20 <= 32767 && NLSF_mu_Q20 >= 0 ); cannam@154: cannam@154: /* NLSF stabilization */ cannam@154: silk_NLSF_stabilize( pNLSF_Q15, psNLSF_CB->deltaMin_Q15, psNLSF_CB->order ); cannam@154: cannam@154: /* First stage: VQ */ cannam@154: ALLOC( err_Q24, psNLSF_CB->nVectors, opus_int32 ); cannam@154: silk_NLSF_VQ( err_Q24, pNLSF_Q15, psNLSF_CB->CB1_NLSF_Q8, psNLSF_CB->CB1_Wght_Q9, psNLSF_CB->nVectors, psNLSF_CB->order ); cannam@154: cannam@154: /* Sort the quantization errors */ cannam@154: ALLOC( tempIndices1, nSurvivors, opus_int ); cannam@154: silk_insertion_sort_increasing( err_Q24, tempIndices1, psNLSF_CB->nVectors, nSurvivors ); cannam@154: cannam@154: ALLOC( RD_Q25, nSurvivors, opus_int32 ); cannam@154: ALLOC( tempIndices2, nSurvivors * MAX_LPC_ORDER, opus_int8 ); cannam@154: cannam@154: /* Loop over survivors */ cannam@154: for( s = 0; s < nSurvivors; s++ ) { cannam@154: ind1 = tempIndices1[ s ]; cannam@154: cannam@154: /* Residual after first stage */ cannam@154: pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ ind1 * psNLSF_CB->order ]; cannam@154: pCB_Wght_Q9 = &psNLSF_CB->CB1_Wght_Q9[ ind1 * psNLSF_CB->order ]; cannam@154: for( i = 0; i < psNLSF_CB->order; i++ ) { cannam@154: NLSF_tmp_Q15[ i ] = silk_LSHIFT16( (opus_int16)pCB_element[ i ], 7 ); cannam@154: W_tmp_Q9 = pCB_Wght_Q9[ i ]; cannam@154: res_Q10[ i ] = (opus_int16)silk_RSHIFT( silk_SMULBB( pNLSF_Q15[ i ] - NLSF_tmp_Q15[ i ], W_tmp_Q9 ), 14 ); cannam@154: W_adj_Q5[ i ] = silk_DIV32_varQ( (opus_int32)pW_Q2[ i ], silk_SMULBB( W_tmp_Q9, W_tmp_Q9 ), 21 ); cannam@154: } cannam@154: cannam@154: /* Unpack entropy table indices and predictor for current CB1 index */ cannam@154: silk_NLSF_unpack( ec_ix, pred_Q8, psNLSF_CB, ind1 ); cannam@154: cannam@154: /* Trellis quantizer */ cannam@154: RD_Q25[ s ] = silk_NLSF_del_dec_quant( &tempIndices2[ s * MAX_LPC_ORDER ], res_Q10, W_adj_Q5, pred_Q8, ec_ix, cannam@154: psNLSF_CB->ec_Rates_Q5, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->invQuantStepSize_Q6, NLSF_mu_Q20, psNLSF_CB->order ); cannam@154: cannam@154: /* Add rate for first stage */ cannam@154: iCDF_ptr = &psNLSF_CB->CB1_iCDF[ ( signalType >> 1 ) * psNLSF_CB->nVectors ]; cannam@154: if( ind1 == 0 ) { cannam@154: prob_Q8 = 256 - iCDF_ptr[ ind1 ]; cannam@154: } else { cannam@154: prob_Q8 = iCDF_ptr[ ind1 - 1 ] - iCDF_ptr[ ind1 ]; cannam@154: } cannam@154: bits_q7 = ( 8 << 7 ) - silk_lin2log( prob_Q8 ); cannam@154: RD_Q25[ s ] = silk_SMLABB( RD_Q25[ s ], bits_q7, silk_RSHIFT( NLSF_mu_Q20, 2 ) ); cannam@154: } cannam@154: cannam@154: /* Find the lowest rate-distortion error */ cannam@154: silk_insertion_sort_increasing( RD_Q25, &bestIndex, nSurvivors, 1 ); cannam@154: cannam@154: NLSFIndices[ 0 ] = (opus_int8)tempIndices1[ bestIndex ]; cannam@154: silk_memcpy( &NLSFIndices[ 1 ], &tempIndices2[ bestIndex * MAX_LPC_ORDER ], psNLSF_CB->order * sizeof( opus_int8 ) ); cannam@154: cannam@154: /* Decode */ cannam@154: silk_NLSF_decode( pNLSF_Q15, NLSFIndices, psNLSF_CB ); cannam@154: cannam@154: ret = RD_Q25[ 0 ]; cannam@154: RESTORE_STACK; cannam@154: return ret; cannam@154: }