cannam@154
|
1 /***********************************************************************
|
cannam@154
|
2 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
|
cannam@154
|
3 Redistribution and use in source and binary forms, with or without
|
cannam@154
|
4 modification, are permitted provided that the following conditions
|
cannam@154
|
5 are met:
|
cannam@154
|
6 - Redistributions of source code must retain the above copyright notice,
|
cannam@154
|
7 this list of conditions and the following disclaimer.
|
cannam@154
|
8 - Redistributions in binary form must reproduce the above copyright
|
cannam@154
|
9 notice, this list of conditions and the following disclaimer in the
|
cannam@154
|
10 documentation and/or other materials provided with the distribution.
|
cannam@154
|
11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
|
cannam@154
|
12 names of specific contributors, may be used to endorse or promote
|
cannam@154
|
13 products derived from this software without specific prior written
|
cannam@154
|
14 permission.
|
cannam@154
|
15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
cannam@154
|
16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
cannam@154
|
17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
cannam@154
|
18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
cannam@154
|
19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
cannam@154
|
20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
cannam@154
|
21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
cannam@154
|
22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
cannam@154
|
23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
cannam@154
|
24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
cannam@154
|
25 POSSIBILITY OF SUCH DAMAGE.
|
cannam@154
|
26 ***********************************************************************/
|
cannam@154
|
27
|
cannam@154
|
28 #ifdef HAVE_CONFIG_H
|
cannam@154
|
29 #include "config.h"
|
cannam@154
|
30 #endif
|
cannam@154
|
31
|
cannam@154
|
32 #include "main_FLP.h"
|
cannam@154
|
33
|
cannam@154
|
34 /* Find LPC and LTP coefficients */
|
cannam@154
|
35 void silk_find_pred_coefs_FLP(
|
cannam@154
|
36 silk_encoder_state_FLP *psEnc, /* I/O Encoder state FLP */
|
cannam@154
|
37 silk_encoder_control_FLP *psEncCtrl, /* I/O Encoder control FLP */
|
cannam@154
|
38 const silk_float res_pitch[], /* I Residual from pitch analysis */
|
cannam@154
|
39 const silk_float x[], /* I Speech signal */
|
cannam@154
|
40 opus_int condCoding /* I The type of conditional coding to use */
|
cannam@154
|
41 )
|
cannam@154
|
42 {
|
cannam@154
|
43 opus_int i;
|
cannam@154
|
44 silk_float XXLTP[ MAX_NB_SUBFR * LTP_ORDER * LTP_ORDER ];
|
cannam@154
|
45 silk_float xXLTP[ MAX_NB_SUBFR * LTP_ORDER ];
|
cannam@154
|
46 silk_float invGains[ MAX_NB_SUBFR ];
|
cannam@154
|
47 opus_int16 NLSF_Q15[ MAX_LPC_ORDER ];
|
cannam@154
|
48 const silk_float *x_ptr;
|
cannam@154
|
49 silk_float *x_pre_ptr, LPC_in_pre[ MAX_NB_SUBFR * MAX_LPC_ORDER + MAX_FRAME_LENGTH ];
|
cannam@154
|
50 silk_float minInvGain;
|
cannam@154
|
51
|
cannam@154
|
52 /* Weighting for weighted least squares */
|
cannam@154
|
53 for( i = 0; i < psEnc->sCmn.nb_subfr; i++ ) {
|
cannam@154
|
54 silk_assert( psEncCtrl->Gains[ i ] > 0.0f );
|
cannam@154
|
55 invGains[ i ] = 1.0f / psEncCtrl->Gains[ i ];
|
cannam@154
|
56 }
|
cannam@154
|
57
|
cannam@154
|
58 if( psEnc->sCmn.indices.signalType == TYPE_VOICED ) {
|
cannam@154
|
59 /**********/
|
cannam@154
|
60 /* VOICED */
|
cannam@154
|
61 /**********/
|
cannam@154
|
62 celt_assert( psEnc->sCmn.ltp_mem_length - psEnc->sCmn.predictLPCOrder >= psEncCtrl->pitchL[ 0 ] + LTP_ORDER / 2 );
|
cannam@154
|
63
|
cannam@154
|
64 /* LTP analysis */
|
cannam@154
|
65 silk_find_LTP_FLP( XXLTP, xXLTP, res_pitch, psEncCtrl->pitchL, psEnc->sCmn.subfr_length, psEnc->sCmn.nb_subfr );
|
cannam@154
|
66
|
cannam@154
|
67 /* Quantize LTP gain parameters */
|
cannam@154
|
68 silk_quant_LTP_gains_FLP( psEncCtrl->LTPCoef, psEnc->sCmn.indices.LTPIndex, &psEnc->sCmn.indices.PERIndex,
|
cannam@154
|
69 &psEnc->sCmn.sum_log_gain_Q7, &psEncCtrl->LTPredCodGain, XXLTP, xXLTP, psEnc->sCmn.subfr_length, psEnc->sCmn.nb_subfr, psEnc->sCmn.arch );
|
cannam@154
|
70
|
cannam@154
|
71 /* Control LTP scaling */
|
cannam@154
|
72 silk_LTP_scale_ctrl_FLP( psEnc, psEncCtrl, condCoding );
|
cannam@154
|
73
|
cannam@154
|
74 /* Create LTP residual */
|
cannam@154
|
75 silk_LTP_analysis_filter_FLP( LPC_in_pre, x - psEnc->sCmn.predictLPCOrder, psEncCtrl->LTPCoef,
|
cannam@154
|
76 psEncCtrl->pitchL, invGains, psEnc->sCmn.subfr_length, psEnc->sCmn.nb_subfr, psEnc->sCmn.predictLPCOrder );
|
cannam@154
|
77 } else {
|
cannam@154
|
78 /************/
|
cannam@154
|
79 /* UNVOICED */
|
cannam@154
|
80 /************/
|
cannam@154
|
81 /* Create signal with prepended subframes, scaled by inverse gains */
|
cannam@154
|
82 x_ptr = x - psEnc->sCmn.predictLPCOrder;
|
cannam@154
|
83 x_pre_ptr = LPC_in_pre;
|
cannam@154
|
84 for( i = 0; i < psEnc->sCmn.nb_subfr; i++ ) {
|
cannam@154
|
85 silk_scale_copy_vector_FLP( x_pre_ptr, x_ptr, invGains[ i ],
|
cannam@154
|
86 psEnc->sCmn.subfr_length + psEnc->sCmn.predictLPCOrder );
|
cannam@154
|
87 x_pre_ptr += psEnc->sCmn.subfr_length + psEnc->sCmn.predictLPCOrder;
|
cannam@154
|
88 x_ptr += psEnc->sCmn.subfr_length;
|
cannam@154
|
89 }
|
cannam@154
|
90 silk_memset( psEncCtrl->LTPCoef, 0, psEnc->sCmn.nb_subfr * LTP_ORDER * sizeof( silk_float ) );
|
cannam@154
|
91 psEncCtrl->LTPredCodGain = 0.0f;
|
cannam@154
|
92 psEnc->sCmn.sum_log_gain_Q7 = 0;
|
cannam@154
|
93 }
|
cannam@154
|
94
|
cannam@154
|
95 /* Limit on total predictive coding gain */
|
cannam@154
|
96 if( psEnc->sCmn.first_frame_after_reset ) {
|
cannam@154
|
97 minInvGain = 1.0f / MAX_PREDICTION_POWER_GAIN_AFTER_RESET;
|
cannam@154
|
98 } else {
|
cannam@154
|
99 minInvGain = (silk_float)pow( 2, psEncCtrl->LTPredCodGain / 3 ) / MAX_PREDICTION_POWER_GAIN;
|
cannam@154
|
100 minInvGain /= 0.25f + 0.75f * psEncCtrl->coding_quality;
|
cannam@154
|
101 }
|
cannam@154
|
102
|
cannam@154
|
103 /* LPC_in_pre contains the LTP-filtered input for voiced, and the unfiltered input for unvoiced */
|
cannam@154
|
104 silk_find_LPC_FLP( &psEnc->sCmn, NLSF_Q15, LPC_in_pre, minInvGain );
|
cannam@154
|
105
|
cannam@154
|
106 /* Quantize LSFs */
|
cannam@154
|
107 silk_process_NLSFs_FLP( &psEnc->sCmn, psEncCtrl->PredCoef, NLSF_Q15, psEnc->sCmn.prev_NLSFq_Q15 );
|
cannam@154
|
108
|
cannam@154
|
109 /* Calculate residual energy using quantized LPC coefficients */
|
cannam@154
|
110 silk_residual_energy_FLP( psEncCtrl->ResNrg, LPC_in_pre, psEncCtrl->PredCoef, psEncCtrl->Gains,
|
cannam@154
|
111 psEnc->sCmn.subfr_length, psEnc->sCmn.nb_subfr, psEnc->sCmn.predictLPCOrder );
|
cannam@154
|
112
|
cannam@154
|
113 /* Copy to prediction struct for use in next frame for interpolation */
|
cannam@154
|
114 silk_memcpy( psEnc->sCmn.prev_NLSFq_Q15, NLSF_Q15, sizeof( psEnc->sCmn.prev_NLSFq_Q15 ) );
|
cannam@154
|
115 }
|
cannam@154
|
116
|