The Tor Browser / annotate

media/libopus/silk/NLSF_encode.c@6474c204b198 (annotated)

media/libopus/silk/NLSF_encode.c

Wed, 31 Dec 2014 06:09:35 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Wed, 31 Dec 2014 06:09:35 +0100
changeset 0
6474c204b198
permissions
-rw-r--r--

Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.

michael@0 1 /***********************************************************************
michael@0 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
michael@0 3 Redistribution and use in source and binary forms, with or without
michael@0 4 modification, are permitted provided that the following conditions
michael@0 5 are met:
michael@0 6 - Redistributions of source code must retain the above copyright notice,
michael@0 7 this list of conditions and the following disclaimer.
michael@0 8 - Redistributions in binary form must reproduce the above copyright
michael@0 9 notice, this list of conditions and the following disclaimer in the
michael@0 10 documentation and/or other materials provided with the distribution.
michael@0 11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
michael@0 12 names of specific contributors, may be used to endorse or promote
michael@0 13 products derived from this software without specific prior written
michael@0 14 permission.
michael@0 15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
michael@0 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
michael@0 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
michael@0 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
michael@0 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
michael@0 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
michael@0 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
michael@0 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
michael@0 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
michael@0 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
michael@0 25 POSSIBILITY OF SUCH DAMAGE.
michael@0 26 ***********************************************************************/
michael@0 27
michael@0 28 #ifdef HAVE_CONFIG_H
michael@0 29 #include "config.h"
michael@0 30 #endif
michael@0 31
michael@0 32 #include "main.h"
michael@0 33 #include "stack_alloc.h"
michael@0 34
michael@0 35 /***********************/
michael@0 36 /* NLSF vector encoder */
michael@0 37 /***********************/
michael@0 38 opus_int32 silk_NLSF_encode( /* O Returns RD value in Q25 */
michael@0 39 opus_int8 *NLSFIndices, /* I Codebook path vector [ LPC_ORDER + 1 ] */
michael@0 40 opus_int16 *pNLSF_Q15, /* I/O Quantized NLSF vector [ LPC_ORDER ] */
michael@0 41 const silk_NLSF_CB_struct *psNLSF_CB, /* I Codebook object */
michael@0 42 const opus_int16 *pW_QW, /* I NLSF weight vector [ LPC_ORDER ] */
michael@0 43 const opus_int NLSF_mu_Q20, /* I Rate weight for the RD optimization */
michael@0 44 const opus_int nSurvivors, /* I Max survivors after first stage */
michael@0 45 const opus_int signalType /* I Signal type: 0/1/2 */
michael@0 46 )
michael@0 47 {
michael@0 48 opus_int i, s, ind1, bestIndex, prob_Q8, bits_q7;
michael@0 49 opus_int32 W_tmp_Q9;
michael@0 50 VARDECL( opus_int32, err_Q26 );
michael@0 51 VARDECL( opus_int32, RD_Q25 );
michael@0 52 VARDECL( opus_int, tempIndices1 );
michael@0 53 VARDECL( opus_int8, tempIndices2 );
michael@0 54 opus_int16 res_Q15[ MAX_LPC_ORDER ];
michael@0 55 opus_int16 res_Q10[ MAX_LPC_ORDER ];
michael@0 56 opus_int16 NLSF_tmp_Q15[ MAX_LPC_ORDER ];
michael@0 57 opus_int16 W_tmp_QW[ MAX_LPC_ORDER ];
michael@0 58 opus_int16 W_adj_Q5[ MAX_LPC_ORDER ];
michael@0 59 opus_uint8 pred_Q8[ MAX_LPC_ORDER ];
michael@0 60 opus_int16 ec_ix[ MAX_LPC_ORDER ];
michael@0 61 const opus_uint8 *pCB_element, *iCDF_ptr;
michael@0 62 SAVE_STACK;
michael@0 63
michael@0 64 silk_assert( nSurvivors <= NLSF_VQ_MAX_SURVIVORS );
michael@0 65 silk_assert( signalType >= 0 && signalType <= 2 );
michael@0 66 silk_assert( NLSF_mu_Q20 <= 32767 && NLSF_mu_Q20 >= 0 );
michael@0 67
michael@0 68 /* NLSF stabilization */
michael@0 69 silk_NLSF_stabilize( pNLSF_Q15, psNLSF_CB->deltaMin_Q15, psNLSF_CB->order );
michael@0 70
michael@0 71 /* First stage: VQ */
michael@0 72 ALLOC( err_Q26, psNLSF_CB->nVectors, opus_int32 );
michael@0 73 silk_NLSF_VQ( err_Q26, pNLSF_Q15, psNLSF_CB->CB1_NLSF_Q8, psNLSF_CB->nVectors, psNLSF_CB->order );
michael@0 74
michael@0 75 /* Sort the quantization errors */
michael@0 76 ALLOC( tempIndices1, nSurvivors, opus_int );
michael@0 77 silk_insertion_sort_increasing( err_Q26, tempIndices1, psNLSF_CB->nVectors, nSurvivors );
michael@0 78
michael@0 79 ALLOC( RD_Q25, nSurvivors, opus_int32 );
michael@0 80 ALLOC( tempIndices2, nSurvivors * MAX_LPC_ORDER, opus_int8 );
michael@0 81
michael@0 82 /* Loop over survivors */
michael@0 83 for( s = 0; s < nSurvivors; s++ ) {
michael@0 84 ind1 = tempIndices1[ s ];
michael@0 85
michael@0 86 /* Residual after first stage */
michael@0 87 pCB_element = &psNLSF_CB->CB1_NLSF_Q8[ ind1 * psNLSF_CB->order ];
michael@0 88 for( i = 0; i < psNLSF_CB->order; i++ ) {
michael@0 89 NLSF_tmp_Q15[ i ] = silk_LSHIFT16( (opus_int16)pCB_element[ i ], 7 );
michael@0 90 res_Q15[ i ] = pNLSF_Q15[ i ] - NLSF_tmp_Q15[ i ];
michael@0 91 }
michael@0 92
michael@0 93 /* Weights from codebook vector */
michael@0 94 silk_NLSF_VQ_weights_laroia( W_tmp_QW, NLSF_tmp_Q15, psNLSF_CB->order );
michael@0 95
michael@0 96 /* Apply square-rooted weights */
michael@0 97 for( i = 0; i < psNLSF_CB->order; i++ ) {
michael@0 98 W_tmp_Q9 = silk_SQRT_APPROX( silk_LSHIFT( (opus_int32)W_tmp_QW[ i ], 18 - NLSF_W_Q ) );
michael@0 99 res_Q10[ i ] = (opus_int16)silk_RSHIFT( silk_SMULBB( res_Q15[ i ], W_tmp_Q9 ), 14 );
michael@0 100 }
michael@0 101
michael@0 102 /* Modify input weights accordingly */
michael@0 103 for( i = 0; i < psNLSF_CB->order; i++ ) {
michael@0 104 W_adj_Q5[ i ] = silk_DIV32_16( silk_LSHIFT( (opus_int32)pW_QW[ i ], 5 ), W_tmp_QW[ i ] );
michael@0 105 }
michael@0 106
michael@0 107 /* Unpack entropy table indices and predictor for current CB1 index */
michael@0 108 silk_NLSF_unpack( ec_ix, pred_Q8, psNLSF_CB, ind1 );
michael@0 109
michael@0 110 /* Trellis quantizer */
michael@0 111 RD_Q25[ s ] = silk_NLSF_del_dec_quant( &tempIndices2[ s * MAX_LPC_ORDER ], res_Q10, W_adj_Q5, pred_Q8, ec_ix,
michael@0 112 psNLSF_CB->ec_Rates_Q5, psNLSF_CB->quantStepSize_Q16, psNLSF_CB->invQuantStepSize_Q6, NLSF_mu_Q20, psNLSF_CB->order );
michael@0 113
michael@0 114 /* Add rate for first stage */
michael@0 115 iCDF_ptr = &psNLSF_CB->CB1_iCDF[ ( signalType >> 1 ) * psNLSF_CB->nVectors ];
michael@0 116 if( ind1 == 0 ) {
michael@0 117 prob_Q8 = 256 - iCDF_ptr[ ind1 ];
michael@0 118 } else {
michael@0 119 prob_Q8 = iCDF_ptr[ ind1 - 1 ] - iCDF_ptr[ ind1 ];
michael@0 120 }
michael@0 121 bits_q7 = ( 8 << 7 ) - silk_lin2log( prob_Q8 );
michael@0 122 RD_Q25[ s ] = silk_SMLABB( RD_Q25[ s ], bits_q7, silk_RSHIFT( NLSF_mu_Q20, 2 ) );
michael@0 123 }
michael@0 124
michael@0 125 /* Find the lowest rate-distortion error */
michael@0 126 silk_insertion_sort_increasing( RD_Q25, &bestIndex, nSurvivors, 1 );
michael@0 127
michael@0 128 NLSFIndices[ 0 ] = (opus_int8)tempIndices1[ bestIndex ];
michael@0 129 silk_memcpy( &NLSFIndices[ 1 ], &tempIndices2[ bestIndex * MAX_LPC_ORDER ], psNLSF_CB->order * sizeof( opus_int8 ) );
michael@0 130
michael@0 131 /* Decode */
michael@0 132 silk_NLSF_decode( pNLSF_Q15, NLSFIndices, psNLSF_CB );
michael@0 133
michael@0 134 RESTORE_STACK;
michael@0 135 return RD_Q25[ 0 ];
michael@0 136 }

Mercurial Repository: The Tor Browser

Europalab SCM Repository Server

mercurial