Chris@69: /***********************************************************************
Chris@69: Copyright (c) 2006-2011, Skype Limited. All rights reserved.
Chris@69: Redistribution and use in source and binary forms, with or without
Chris@69: modification, are permitted provided that the following conditions
Chris@69: are met:
Chris@69: - Redistributions of source code must retain the above copyright notice,
Chris@69: this list of conditions and the following disclaimer.
Chris@69: - Redistributions in binary form must reproduce the above copyright
Chris@69: notice, this list of conditions and the following disclaimer in the
Chris@69: documentation and/or other materials provided with the distribution.
Chris@69: - Neither the name of Internet Society, IETF or IETF Trust, nor the
Chris@69: names of specific contributors, may be used to endorse or promote
Chris@69: products derived from this software without specific prior written
Chris@69: permission.
Chris@69: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
Chris@69: AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
Chris@69: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
Chris@69: ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
Chris@69: LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
Chris@69: CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
Chris@69: SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
Chris@69: INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
Chris@69: CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
Chris@69: ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
Chris@69: POSSIBILITY OF SUCH DAMAGE.
Chris@69: ***********************************************************************/
Chris@69: 
Chris@69: #ifdef HAVE_CONFIG_H
Chris@69: #include "config.h"
Chris@69: #endif
Chris@69: 
Chris@69: #include "main.h"
Chris@69: #include "stack_alloc.h"
Chris@69: 
Chris@69: /***********************/
Chris@69: /* NLSF vector encoder */
Chris@69: /***********************/
Chris@69: opus_int32 silk_NLSF_encode(                                    /* O    Returns RD value in Q25                     */
Chris@69:           opus_int8             *NLSFIndices,                   /* I    Codebook path vector [ LPC_ORDER + 1 ]      */
Chris@69:           opus_int16            *pNLSF_Q15,                     /* I/O  (Un)quantized NLSF vector [ LPC_ORDER ]     */
Chris@69:     const silk_NLSF_CB_struct   *psNLSF_CB,                     /* I    Codebook object                             */
Chris@69:     const opus_int16            *pW_Q2,                         /* I    NLSF weight vector [ LPC_ORDER ]            */
Chris@69:     const opus_int              NLSF_mu_Q20,                    /* I    Rate weight for the RD optimization         */
Chris@69:     const opus_int              nSurvivors,                     /* I    Max survivors after first stage             */
Chris@69:     const opus_int              signalType                      /* I    Signal type: 0/1/2                          */
Chris@69: )
Chris@69: {
Chris@69:     opus_int         i, s, ind1, bestIndex, prob_Q8, bits_q7;
Chris@69:     opus_int32       W_tmp_Q9, ret;
Chris@69:     VARDECL( opus_int32, err_Q24 );
Chris@69:     VARDECL( opus_int32, RD_Q25 );
Chris@69:     VARDECL( opus_int, tempIndices1 );
Chris@69:     VARDECL( opus_int8, tempIndices2 );
Chris@69:     opus_int16       res_Q10[      MAX_LPC_ORDER ];
Chris@69:     opus_int16       NLSF_tmp_Q15[ MAX_LPC_ORDER ];
Chris@69:     opus_int16       W_adj_Q5[     MAX_LPC_ORDER ];
Chris@69:     opus_uint8       pred_Q8[      MAX_LPC_ORDER ];
Chris@69:     opus_int16       ec_ix[        MAX_LPC_ORDER ];
Chris@69:     const opus_uint8 *pCB_element, *iCDF_ptr;
Chris@69:     const opus_int16 *pCB_Wght_Q9;
Chris@69:     SAVE_STACK;
Chris@69: 
Chris@69:     celt_assert( signalType >= 0 && signalType <= 2 );
Chris@69:     silk_assert( NLSF_mu_Q20 <= 32767 && NLSF_mu_Q20 >= 0 );
Chris@69: 
Chris@69:     /* NLSF stabilization */
Chris@69:     silk_NLSF_stabilize( pNLSF_Q15, psNLSF_CB->deltaMin_Q15, psNLSF_CB->order );
Chris@69: 
Chris@69:     /* First stage: VQ */
Chris@69:     ALLOC( err_Q24, psNLSF_CB->nVectors, opus_int32 );
Chris@69:     silk_NLSF_VQ( err_Q24, pNLSF_Q15, psNLSF_CB->CB1_NLSF_Q8, psNLSF_CB->CB1_Wght_Q9, psNLSF_CB->nVectors, psNLSF_CB->order );
Chris@69: 
Chris@69:     /* Sort the quantization errors */
Chris@69:     ALLOC( tempIndices1, nSurvivors, opus_int );
Chris@69:     silk_insertion_sort_increasing( err_Q24, tempIndices1, psNLSF_CB->nVectors, nSurvivors );
Chris@69: 
Chris@69:     ALLOC( RD_Q25, nSurvivors, opus_int32 );
Chris@69:     ALLOC( tempIndices2, nSurvivors * MAX_LPC_ORDER, opus_int8 );
Chris@69: 
Chris@69:     /* Loop over survivors */
Chris@69:     for( s = 0; s < nSurvivors; s++ ) {
Chris@69:         ind1 = tempIndices1[ s ];
Chris@69: 
Chris@69:         /* Residual after first stage */
Chris@69:         pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ ind1 * psNLSF_CB->order ];
Chris@69:         pCB_Wght_Q9 = &psNLSF_CB->CB1_Wght_Q9[ ind1 * psNLSF_CB->order ];
Chris@69:         for( i = 0; i < psNLSF_CB->order; i++ ) {
Chris@69:             NLSF_tmp_Q15[ i ] = silk_LSHIFT16( (opus_int16)pCB_element[ i ], 7 );
Chris@69:             W_tmp_Q9 = pCB_Wght_Q9[ i ];
Chris@69:             res_Q10[ i ] = (opus_int16)silk_RSHIFT( silk_SMULBB( pNLSF_Q15[ i ] - NLSF_tmp_Q15[ i ], W_tmp_Q9 ), 14 );
Chris@69:             W_adj_Q5[ i ] = silk_DIV32_varQ( (opus_int32)pW_Q2[ i ], silk_SMULBB( W_tmp_Q9, W_tmp_Q9 ), 21 );
Chris@69:         }
Chris@69: 
Chris@69:         /* Unpack entropy table indices and predictor for current CB1 index */
Chris@69:         silk_NLSF_unpack( ec_ix, pred_Q8, psNLSF_CB, ind1 );
Chris@69: 
Chris@69:         /* Trellis quantizer */
Chris@69:         RD_Q25[ s ] = silk_NLSF_del_dec_quant( &tempIndices2[ s * MAX_LPC_ORDER ], res_Q10, W_adj_Q5, pred_Q8, ec_ix,
Chris@69:             psNLSF_CB->ec_Rates_Q5, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->invQuantStepSize_Q6, NLSF_mu_Q20, psNLSF_CB->order );
Chris@69: 
Chris@69:         /* Add rate for first stage */
Chris@69:         iCDF_ptr = &psNLSF_CB->CB1_iCDF[ ( signalType >> 1 ) * psNLSF_CB->nVectors ];
Chris@69:         if( ind1 == 0 ) {
Chris@69:             prob_Q8 = 256 - iCDF_ptr[ ind1 ];
Chris@69:         } else {
Chris@69:             prob_Q8 = iCDF_ptr[ ind1 - 1 ] - iCDF_ptr[ ind1 ];
Chris@69:         }
Chris@69:         bits_q7 = ( 8 << 7 ) - silk_lin2log( prob_Q8 );
Chris@69:         RD_Q25[ s ] = silk_SMLABB( RD_Q25[ s ], bits_q7, silk_RSHIFT( NLSF_mu_Q20, 2 ) );
Chris@69:     }
Chris@69: 
Chris@69:     /* Find the lowest rate-distortion error */
Chris@69:     silk_insertion_sort_increasing( RD_Q25, &bestIndex, nSurvivors, 1 );
Chris@69: 
Chris@69:     NLSFIndices[ 0 ] = (opus_int8)tempIndices1[ bestIndex ];
Chris@69:     silk_memcpy( &NLSFIndices[ 1 ], &tempIndices2[ bestIndex * MAX_LPC_ORDER ], psNLSF_CB->order * sizeof( opus_int8 ) );
Chris@69: 
Chris@69:     /* Decode */
Chris@69:     silk_NLSF_decode( pNLSF_Q15, NLSFIndices, psNLSF_CB );
Chris@69: 
Chris@69:     ret = RD_Q25[ 0 ];
Chris@69:     RESTORE_STACK;
Chris@69:     return ret;
Chris@69: }