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: 
Chris@69: /* Delayed-decision quantizer for NLSF residuals */
Chris@69: opus_int32 silk_NLSF_del_dec_quant(                             /* O    Returns RD value in Q25                     */
Chris@69:     opus_int8                   indices[],                      /* O    Quantization indices [ order ]              */
Chris@69:     const opus_int16            x_Q10[],                        /* I    Input [ order ]                             */
Chris@69:     const opus_int16            w_Q5[],                         /* I    Weights [ order ]                           */
Chris@69:     const opus_uint8            pred_coef_Q8[],                 /* I    Backward predictor coefs [ order ]          */
Chris@69:     const opus_int16            ec_ix[],                        /* I    Indices to entropy coding tables [ order ]  */
Chris@69:     const opus_uint8            ec_rates_Q5[],                  /* I    Rates []                                    */
Chris@69:     const opus_int              quant_step_size_Q16,            /* I    Quantization step size                      */
Chris@69:     const opus_int16            inv_quant_step_size_Q6,         /* I    Inverse quantization step size              */
Chris@69:     const opus_int32            mu_Q20,                         /* I    R/D tradeoff                                */
Chris@69:     const opus_int16            order                           /* I    Number of input values                      */
Chris@69: )
Chris@69: {
Chris@69:     opus_int         i, j, nStates, ind_tmp, ind_min_max, ind_max_min, in_Q10, res_Q10;
Chris@69:     opus_int         pred_Q10, diff_Q10, rate0_Q5, rate1_Q5;
Chris@69:     opus_int16       out0_Q10, out1_Q10;
Chris@69:     opus_int32       RD_tmp_Q25, min_Q25, min_max_Q25, max_min_Q25;
Chris@69:     opus_int         ind_sort[         NLSF_QUANT_DEL_DEC_STATES ];
Chris@69:     opus_int8        ind[              NLSF_QUANT_DEL_DEC_STATES ][ MAX_LPC_ORDER ];
Chris@69:     opus_int16       prev_out_Q10[ 2 * NLSF_QUANT_DEL_DEC_STATES ];
Chris@69:     opus_int32       RD_Q25[       2 * NLSF_QUANT_DEL_DEC_STATES ];
Chris@69:     opus_int32       RD_min_Q25[       NLSF_QUANT_DEL_DEC_STATES ];
Chris@69:     opus_int32       RD_max_Q25[       NLSF_QUANT_DEL_DEC_STATES ];
Chris@69:     const opus_uint8 *rates_Q5;
Chris@69: 
Chris@69:     opus_int out0_Q10_table[2 * NLSF_QUANT_MAX_AMPLITUDE_EXT];
Chris@69:     opus_int out1_Q10_table[2 * NLSF_QUANT_MAX_AMPLITUDE_EXT];
Chris@69: 
Chris@69:     for (i = -NLSF_QUANT_MAX_AMPLITUDE_EXT; i <= NLSF_QUANT_MAX_AMPLITUDE_EXT-1; i++)
Chris@69:     {
Chris@69:         out0_Q10 = silk_LSHIFT( i, 10 );
Chris@69:         out1_Q10 = silk_ADD16( out0_Q10, 1024 );
Chris@69:         if( i > 0 ) {
Chris@69:             out0_Q10 = silk_SUB16( out0_Q10, SILK_FIX_CONST( NLSF_QUANT_LEVEL_ADJ, 10 ) );
Chris@69:             out1_Q10 = silk_SUB16( out1_Q10, SILK_FIX_CONST( NLSF_QUANT_LEVEL_ADJ, 10 ) );
Chris@69:         } else if( i == 0 ) {
Chris@69:             out1_Q10 = silk_SUB16( out1_Q10, SILK_FIX_CONST( NLSF_QUANT_LEVEL_ADJ, 10 ) );
Chris@69:         } else if( i == -1 ) {
Chris@69:             out0_Q10 = silk_ADD16( out0_Q10, SILK_FIX_CONST( NLSF_QUANT_LEVEL_ADJ, 10 ) );
Chris@69:         } else {
Chris@69:             out0_Q10 = silk_ADD16( out0_Q10, SILK_FIX_CONST( NLSF_QUANT_LEVEL_ADJ, 10 ) );
Chris@69:             out1_Q10 = silk_ADD16( out1_Q10, SILK_FIX_CONST( NLSF_QUANT_LEVEL_ADJ, 10 ) );
Chris@69:         }
Chris@69:         out0_Q10_table[ i + NLSF_QUANT_MAX_AMPLITUDE_EXT ] = silk_RSHIFT( silk_SMULBB( out0_Q10, quant_step_size_Q16 ), 16 );
Chris@69:         out1_Q10_table[ i + NLSF_QUANT_MAX_AMPLITUDE_EXT ] = silk_RSHIFT( silk_SMULBB( out1_Q10, quant_step_size_Q16 ), 16 );
Chris@69:     }
Chris@69: 
Chris@69:     silk_assert( (NLSF_QUANT_DEL_DEC_STATES & (NLSF_QUANT_DEL_DEC_STATES-1)) == 0 );     /* must be power of two */
Chris@69: 
Chris@69:     nStates = 1;
Chris@69:     RD_Q25[ 0 ] = 0;
Chris@69:     prev_out_Q10[ 0 ] = 0;
Chris@69:     for( i = order - 1; i >= 0; i-- ) {
Chris@69:         rates_Q5 = &ec_rates_Q5[ ec_ix[ i ] ];
Chris@69:         in_Q10 = x_Q10[ i ];
Chris@69:         for( j = 0; j < nStates; j++ ) {
Chris@69:             pred_Q10 = silk_RSHIFT( silk_SMULBB( (opus_int16)pred_coef_Q8[ i ], prev_out_Q10[ j ] ), 8 );
Chris@69:             res_Q10  = silk_SUB16( in_Q10, pred_Q10 );
Chris@69:             ind_tmp  = silk_RSHIFT( silk_SMULBB( inv_quant_step_size_Q6, res_Q10 ), 16 );
Chris@69:             ind_tmp  = silk_LIMIT( ind_tmp, -NLSF_QUANT_MAX_AMPLITUDE_EXT, NLSF_QUANT_MAX_AMPLITUDE_EXT-1 );
Chris@69:             ind[ j ][ i ] = (opus_int8)ind_tmp;
Chris@69: 
Chris@69:             /* compute outputs for ind_tmp and ind_tmp + 1 */
Chris@69:             out0_Q10 = out0_Q10_table[ ind_tmp + NLSF_QUANT_MAX_AMPLITUDE_EXT ];
Chris@69:             out1_Q10 = out1_Q10_table[ ind_tmp + NLSF_QUANT_MAX_AMPLITUDE_EXT ];
Chris@69: 
Chris@69:             out0_Q10  = silk_ADD16( out0_Q10, pred_Q10 );
Chris@69:             out1_Q10  = silk_ADD16( out1_Q10, pred_Q10 );
Chris@69:             prev_out_Q10[ j           ] = out0_Q10;
Chris@69:             prev_out_Q10[ j + nStates ] = out1_Q10;
Chris@69: 
Chris@69:             /* compute RD for ind_tmp and ind_tmp + 1 */
Chris@69:             if( ind_tmp + 1 >= NLSF_QUANT_MAX_AMPLITUDE ) {
Chris@69:                 if( ind_tmp + 1 == NLSF_QUANT_MAX_AMPLITUDE ) {
Chris@69:                     rate0_Q5 = rates_Q5[ ind_tmp + NLSF_QUANT_MAX_AMPLITUDE ];
Chris@69:                     rate1_Q5 = 280;
Chris@69:                 } else {
Chris@69:                     rate0_Q5 = silk_SMLABB( 280 - 43 * NLSF_QUANT_MAX_AMPLITUDE, 43, ind_tmp );
Chris@69:                     rate1_Q5 = silk_ADD16( rate0_Q5, 43 );
Chris@69:                 }
Chris@69:             } else if( ind_tmp <= -NLSF_QUANT_MAX_AMPLITUDE ) {
Chris@69:                 if( ind_tmp == -NLSF_QUANT_MAX_AMPLITUDE ) {
Chris@69:                     rate0_Q5 = 280;
Chris@69:                     rate1_Q5 = rates_Q5[ ind_tmp + 1 + NLSF_QUANT_MAX_AMPLITUDE ];
Chris@69:                 } else {
Chris@69:                     rate0_Q5 = silk_SMLABB( 280 - 43 * NLSF_QUANT_MAX_AMPLITUDE, -43, ind_tmp );
Chris@69:                     rate1_Q5 = silk_SUB16( rate0_Q5, 43 );
Chris@69:                 }
Chris@69:             } else {
Chris@69:                 rate0_Q5 = rates_Q5[ ind_tmp +     NLSF_QUANT_MAX_AMPLITUDE ];
Chris@69:                 rate1_Q5 = rates_Q5[ ind_tmp + 1 + NLSF_QUANT_MAX_AMPLITUDE ];
Chris@69:             }
Chris@69:             RD_tmp_Q25            = RD_Q25[ j ];
Chris@69:             diff_Q10              = silk_SUB16( in_Q10, out0_Q10 );
Chris@69:             RD_Q25[ j ]           = silk_SMLABB( silk_MLA( RD_tmp_Q25, silk_SMULBB( diff_Q10, diff_Q10 ), w_Q5[ i ] ), mu_Q20, rate0_Q5 );
Chris@69:             diff_Q10              = silk_SUB16( in_Q10, out1_Q10 );
Chris@69:             RD_Q25[ j + nStates ] = silk_SMLABB( silk_MLA( RD_tmp_Q25, silk_SMULBB( diff_Q10, diff_Q10 ), w_Q5[ i ] ), mu_Q20, rate1_Q5 );
Chris@69:         }
Chris@69: 
Chris@69:         if( nStates <= NLSF_QUANT_DEL_DEC_STATES/2 ) {
Chris@69:             /* double number of states and copy */
Chris@69:             for( j = 0; j < nStates; j++ ) {
Chris@69:                 ind[ j + nStates ][ i ] = ind[ j ][ i ] + 1;
Chris@69:             }
Chris@69:             nStates = silk_LSHIFT( nStates, 1 );
Chris@69:             for( j = nStates; j < NLSF_QUANT_DEL_DEC_STATES; j++ ) {
Chris@69:                 ind[ j ][ i ] = ind[ j - nStates ][ i ];
Chris@69:             }
Chris@69:         } else {
Chris@69:             /* sort lower and upper half of RD_Q25, pairwise */
Chris@69:             for( j = 0; j < NLSF_QUANT_DEL_DEC_STATES; j++ ) {
Chris@69:                 if( RD_Q25[ j ] > RD_Q25[ j + NLSF_QUANT_DEL_DEC_STATES ] ) {
Chris@69:                     RD_max_Q25[ j ]                         = RD_Q25[ j ];
Chris@69:                     RD_min_Q25[ j ]                         = RD_Q25[ j + NLSF_QUANT_DEL_DEC_STATES ];
Chris@69:                     RD_Q25[ j ]                             = RD_min_Q25[ j ];
Chris@69:                     RD_Q25[ j + NLSF_QUANT_DEL_DEC_STATES ] = RD_max_Q25[ j ];
Chris@69:                     /* swap prev_out values */
Chris@69:                     out0_Q10 = prev_out_Q10[ j ];
Chris@69:                     prev_out_Q10[ j ] = prev_out_Q10[ j + NLSF_QUANT_DEL_DEC_STATES ];
Chris@69:                     prev_out_Q10[ j + NLSF_QUANT_DEL_DEC_STATES ] = out0_Q10;
Chris@69:                     ind_sort[ j ] = j + NLSF_QUANT_DEL_DEC_STATES;
Chris@69:                 } else {
Chris@69:                     RD_min_Q25[ j ] = RD_Q25[ j ];
Chris@69:                     RD_max_Q25[ j ] = RD_Q25[ j + NLSF_QUANT_DEL_DEC_STATES ];
Chris@69:                     ind_sort[ j ] = j;
Chris@69:                 }
Chris@69:             }
Chris@69:             /* compare the highest RD values of the winning half with the lowest one in the losing half, and copy if necessary */
Chris@69:             /* afterwards ind_sort[] will contain the indices of the NLSF_QUANT_DEL_DEC_STATES winning RD values */
Chris@69:             while( 1 ) {
Chris@69:                 min_max_Q25 = silk_int32_MAX;
Chris@69:                 max_min_Q25 = 0;
Chris@69:                 ind_min_max = 0;
Chris@69:                 ind_max_min = 0;
Chris@69:                 for( j = 0; j < NLSF_QUANT_DEL_DEC_STATES; j++ ) {
Chris@69:                     if( min_max_Q25 > RD_max_Q25[ j ] ) {
Chris@69:                         min_max_Q25 = RD_max_Q25[ j ];
Chris@69:                         ind_min_max = j;
Chris@69:                     }
Chris@69:                     if( max_min_Q25 < RD_min_Q25[ j ] ) {
Chris@69:                         max_min_Q25 = RD_min_Q25[ j ];
Chris@69:                         ind_max_min = j;
Chris@69:                     }
Chris@69:                 }
Chris@69:                 if( min_max_Q25 >= max_min_Q25 ) {
Chris@69:                     break;
Chris@69:                 }
Chris@69:                 /* copy ind_min_max to ind_max_min */
Chris@69:                 ind_sort[     ind_max_min ] = ind_sort[     ind_min_max ] ^ NLSF_QUANT_DEL_DEC_STATES;
Chris@69:                 RD_Q25[       ind_max_min ] = RD_Q25[       ind_min_max + NLSF_QUANT_DEL_DEC_STATES ];
Chris@69:                 prev_out_Q10[ ind_max_min ] = prev_out_Q10[ ind_min_max + NLSF_QUANT_DEL_DEC_STATES ];
Chris@69:                 RD_min_Q25[   ind_max_min ] = 0;
Chris@69:                 RD_max_Q25[   ind_min_max ] = silk_int32_MAX;
Chris@69:                 silk_memcpy( ind[ ind_max_min ], ind[ ind_min_max ], MAX_LPC_ORDER * sizeof( opus_int8 ) );
Chris@69:             }
Chris@69:             /* increment index if it comes from the upper half */
Chris@69:             for( j = 0; j < NLSF_QUANT_DEL_DEC_STATES; j++ ) {
Chris@69:                 ind[ j ][ i ] += silk_RSHIFT( ind_sort[ j ], NLSF_QUANT_DEL_DEC_STATES_LOG2 );
Chris@69:             }
Chris@69:         }
Chris@69:     }
Chris@69: 
Chris@69:     /* last sample: find winner, copy indices and return RD value */
Chris@69:     ind_tmp = 0;
Chris@69:     min_Q25 = silk_int32_MAX;
Chris@69:     for( j = 0; j < 2 * NLSF_QUANT_DEL_DEC_STATES; j++ ) {
Chris@69:         if( min_Q25 > RD_Q25[ j ] ) {
Chris@69:             min_Q25 = RD_Q25[ j ];
Chris@69:             ind_tmp = j;
Chris@69:         }
Chris@69:     }
Chris@69:     for( j = 0; j < order; j++ ) {
Chris@69:         indices[ j ] = ind[ ind_tmp & ( NLSF_QUANT_DEL_DEC_STATES - 1 ) ][ j ];
Chris@69:         silk_assert( indices[ j ] >= -NLSF_QUANT_MAX_AMPLITUDE_EXT );
Chris@69:         silk_assert( indices[ j ] <=  NLSF_QUANT_MAX_AMPLITUDE_EXT );
Chris@69:     }
Chris@69:     indices[ 0 ] += silk_RSHIFT( ind_tmp, NLSF_QUANT_DEL_DEC_STATES_LOG2 );
Chris@69:     silk_assert( indices[ 0 ] <= NLSF_QUANT_MAX_AMPLITUDE_EXT );
Chris@69:     silk_assert( min_Q25 >= 0 );
Chris@69:     return min_Q25;
Chris@69: }