Mercurial > hg > sv-dependency-builds

annotate src/opus-1.3/silk/fixed/find_LPC_FIX.c @ 79:91c729825bca pa_catalina

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Update build for AUDIO_COMPONENT_FIX
author Chris Cannam
date Wed, 30 Oct 2019 12:40:34 +0000
parents 7aeed7906520
children
rev   line source
Chris@69 1 /***********************************************************************
Chris@69 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
Chris@69 3 Redistribution and use in source and binary forms, with or without
Chris@69 4 modification, are permitted provided that the following conditions
Chris@69 5 are met:
Chris@69 6 - Redistributions of source code must retain the above copyright notice,
Chris@69 7 this list of conditions and the following disclaimer.
Chris@69 8 - Redistributions in binary form must reproduce the above copyright
Chris@69 9 notice, this list of conditions and the following disclaimer in the
Chris@69 10 documentation and/or other materials provided with the distribution.
Chris@69 11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
Chris@69 12 names of specific contributors, may be used to endorse or promote
Chris@69 13 products derived from this software without specific prior written
Chris@69 14 permission.
Chris@69 15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
Chris@69 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
Chris@69 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
Chris@69 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
Chris@69 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
Chris@69 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
Chris@69 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
Chris@69 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
Chris@69 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
Chris@69 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
Chris@69 25 POSSIBILITY OF SUCH DAMAGE.
Chris@69 26 ***********************************************************************/
Chris@69 27
Chris@69 28 #ifdef HAVE_CONFIG_H
Chris@69 29 #include "config.h"
Chris@69 30 #endif
Chris@69 31
Chris@69 32 #include "main_FIX.h"
Chris@69 33 #include "stack_alloc.h"
Chris@69 34 #include "tuning_parameters.h"
Chris@69 35
Chris@69 36 /* Finds LPC vector from correlations, and converts to NLSF */
Chris@69 37 void silk_find_LPC_FIX(
Chris@69 38 silk_encoder_state *psEncC, /* I/O Encoder state */
Chris@69 39 opus_int16 NLSF_Q15[], /* O NLSFs */
Chris@69 40 const opus_int16 x[], /* I Input signal */
Chris@69 41 const opus_int32 minInvGain_Q30 /* I Inverse of max prediction gain */
Chris@69 42 )
Chris@69 43 {
Chris@69 44 opus_int k, subfr_length;
Chris@69 45 opus_int32 a_Q16[ MAX_LPC_ORDER ];
Chris@69 46 opus_int isInterpLower, shift;
Chris@69 47 opus_int32 res_nrg0, res_nrg1;
Chris@69 48 opus_int rshift0, rshift1;
Chris@69 49
Chris@69 50 /* Used only for LSF interpolation */
Chris@69 51 opus_int32 a_tmp_Q16[ MAX_LPC_ORDER ], res_nrg_interp, res_nrg, res_tmp_nrg;
Chris@69 52 opus_int res_nrg_interp_Q, res_nrg_Q, res_tmp_nrg_Q;
Chris@69 53 opus_int16 a_tmp_Q12[ MAX_LPC_ORDER ];
Chris@69 54 opus_int16 NLSF0_Q15[ MAX_LPC_ORDER ];
Chris@69 55 SAVE_STACK;
Chris@69 56
Chris@69 57 subfr_length = psEncC->subfr_length + psEncC->predictLPCOrder;
Chris@69 58
Chris@69 59 /* Default: no interpolation */
Chris@69 60 psEncC->indices.NLSFInterpCoef_Q2 = 4;
Chris@69 61
Chris@69 62 /* Burg AR analysis for the full frame */
Chris@69 63 silk_burg_modified( &res_nrg, &res_nrg_Q, a_Q16, x, minInvGain_Q30, subfr_length, psEncC->nb_subfr, psEncC->predictLPCOrder, psEncC->arch );
Chris@69 64
Chris@69 65 if( psEncC->useInterpolatedNLSFs && !psEncC->first_frame_after_reset && psEncC->nb_subfr == MAX_NB_SUBFR ) {
Chris@69 66 VARDECL( opus_int16, LPC_res );
Chris@69 67
Chris@69 68 /* Optimal solution for last 10 ms */
Chris@69 69 silk_burg_modified( &res_tmp_nrg, &res_tmp_nrg_Q, a_tmp_Q16, x + 2 * subfr_length, minInvGain_Q30, subfr_length, 2, psEncC->predictLPCOrder, psEncC->arch );
Chris@69 70
Chris@69 71 /* subtract residual energy here, as that's easier than adding it to the */
Chris@69 72 /* residual energy of the first 10 ms in each iteration of the search below */
Chris@69 73 shift = res_tmp_nrg_Q - res_nrg_Q;
Chris@69 74 if( shift >= 0 ) {
Chris@69 75 if( shift < 32 ) {
Chris@69 76 res_nrg = res_nrg - silk_RSHIFT( res_tmp_nrg, shift );
Chris@69 77 }
Chris@69 78 } else {
Chris@69 79 silk_assert( shift > -32 );
Chris@69 80 res_nrg = silk_RSHIFT( res_nrg, -shift ) - res_tmp_nrg;
Chris@69 81 res_nrg_Q = res_tmp_nrg_Q;
Chris@69 82 }
Chris@69 83
Chris@69 84 /* Convert to NLSFs */
Chris@69 85 silk_A2NLSF( NLSF_Q15, a_tmp_Q16, psEncC->predictLPCOrder );
Chris@69 86
Chris@69 87 ALLOC( LPC_res, 2 * subfr_length, opus_int16 );
Chris@69 88
Chris@69 89 /* Search over interpolation indices to find the one with lowest residual energy */
Chris@69 90 for( k = 3; k >= 0; k-- ) {
Chris@69 91 /* Interpolate NLSFs for first half */
Chris@69 92 silk_interpolate( NLSF0_Q15, psEncC->prev_NLSFq_Q15, NLSF_Q15, k, psEncC->predictLPCOrder );
Chris@69 93
Chris@69 94 /* Convert to LPC for residual energy evaluation */
Chris@69 95 silk_NLSF2A( a_tmp_Q12, NLSF0_Q15, psEncC->predictLPCOrder, psEncC->arch );
Chris@69 96
Chris@69 97 /* Calculate residual energy with NLSF interpolation */
Chris@69 98 silk_LPC_analysis_filter( LPC_res, x, a_tmp_Q12, 2 * subfr_length, psEncC->predictLPCOrder, psEncC->arch );
Chris@69 99
Chris@69 100 silk_sum_sqr_shift( &res_nrg0, &rshift0, LPC_res + psEncC->predictLPCOrder, subfr_length - psEncC->predictLPCOrder );
Chris@69 101 silk_sum_sqr_shift( &res_nrg1, &rshift1, LPC_res + psEncC->predictLPCOrder + subfr_length, subfr_length - psEncC->predictLPCOrder );
Chris@69 102
Chris@69 103 /* Add subframe energies from first half frame */
Chris@69 104 shift = rshift0 - rshift1;
Chris@69 105 if( shift >= 0 ) {
Chris@69 106 res_nrg1 = silk_RSHIFT( res_nrg1, shift );
Chris@69 107 res_nrg_interp_Q = -rshift0;
Chris@69 108 } else {
Chris@69 109 res_nrg0 = silk_RSHIFT( res_nrg0, -shift );
Chris@69 110 res_nrg_interp_Q = -rshift1;
Chris@69 111 }
Chris@69 112 res_nrg_interp = silk_ADD32( res_nrg0, res_nrg1 );
Chris@69 113
Chris@69 114 /* Compare with first half energy without NLSF interpolation, or best interpolated value so far */
Chris@69 115 shift = res_nrg_interp_Q - res_nrg_Q;
Chris@69 116 if( shift >= 0 ) {
Chris@69 117 if( silk_RSHIFT( res_nrg_interp, shift ) < res_nrg ) {
Chris@69 118 isInterpLower = silk_TRUE;
Chris@69 119 } else {
Chris@69 120 isInterpLower = silk_FALSE;
Chris@69 121 }
Chris@69 122 } else {
Chris@69 123 if( -shift < 32 ) {
Chris@69 124 if( res_nrg_interp < silk_RSHIFT( res_nrg, -shift ) ) {
Chris@69 125 isInterpLower = silk_TRUE;
Chris@69 126 } else {
Chris@69 127 isInterpLower = silk_FALSE;
Chris@69 128 }
Chris@69 129 } else {
Chris@69 130 isInterpLower = silk_FALSE;
Chris@69 131 }
Chris@69 132 }
Chris@69 133
Chris@69 134 /* Determine whether current interpolated NLSFs are best so far */
Chris@69 135 if( isInterpLower == silk_TRUE ) {
Chris@69 136 /* Interpolation has lower residual energy */
Chris@69 137 res_nrg = res_nrg_interp;
Chris@69 138 res_nrg_Q = res_nrg_interp_Q;
Chris@69 139 psEncC->indices.NLSFInterpCoef_Q2 = (opus_int8)k;
Chris@69 140 }
Chris@69 141 }
Chris@69 142 }
Chris@69 143
Chris@69 144 if( psEncC->indices.NLSFInterpCoef_Q2 == 4 ) {
Chris@69 145 /* NLSF interpolation is currently inactive, calculate NLSFs from full frame AR coefficients */
Chris@69 146 silk_A2NLSF( NLSF_Q15, a_Q16, psEncC->predictLPCOrder );
Chris@69 147 }
Chris@69 148
Chris@69 149 celt_assert( psEncC->indices.NLSFInterpCoef_Q2 == 4 || ( psEncC->useInterpolatedNLSFs && !psEncC->first_frame_after_reset && psEncC->nb_subfr == MAX_NB_SUBFR ) );
Chris@69 150 RESTORE_STACK;
Chris@69 151 }