Gitiles
Code Review Sign In
review.jami.net / jami-client-android / 3874e557ab7b54f78566363f6deeb3d08933f5dd / . / jni / libopus / silk / CNG.c
blob: d0a619c163d44fb35606fbacb04ecbcb1c4387ff [file] [log] [blame]
Alexandre Lision744f7422013-09-25 11:39:37 -0400[diff] [blame]1/***********************************************************************
2Copyright (c) 2006-2011, Skype Limited. All rights reserved.
3Redistribution and use in source and binary forms, with or without
4modification, are permitted provided that the following conditions
5are met:
6- Redistributions of source code must retain the above copyright notice,
7this list of conditions and the following disclaimer.
8- Redistributions in binary form must reproduce the above copyright
9notice, this list of conditions and the following disclaimer in the
10documentation and/or other materials provided with the distribution.
11- Neither the name of Internet Society, IETF or IETF Trust, nor the
12names of specific contributors, may be used to endorse or promote
13products derived from this software without specific prior written
14permission.
15THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS”
16AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
19LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
20CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
21SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
22INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
24ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
25POSSIBILITY OF SUCH DAMAGE.
26***********************************************************************/
27
28#ifdef HAVE_CONFIG_H
29#include "config.h"
30#endif
31
32#include "main.h"
33
34/* Generates excitation for CNG LPC synthesis */
35static inline void silk_CNG_exc(
36 opus_int32 residual_Q10[], /* O CNG residual signal Q10 */
37 opus_int32 exc_buf_Q14[], /* I Random samples buffer Q10 */
38 opus_int32 Gain_Q16, /* I Gain to apply */
39 opus_int length, /* I Length */
40 opus_int32 *rand_seed /* I/O Seed to random index generator */
41)
42{
43 opus_int32 seed;
44 opus_int i, idx, exc_mask;
45
46 exc_mask = CNG_BUF_MASK_MAX;
47 while( exc_mask > length ) {
48 exc_mask = silk_RSHIFT( exc_mask, 1 );
49 }
50
51 seed = *rand_seed;
52 for( i = 0; i < length; i++ ) {
53 seed = silk_RAND( seed );
54 idx = (opus_int)( silk_RSHIFT( seed, 24 ) & exc_mask );
55 silk_assert( idx >= 0 );
56 silk_assert( idx <= CNG_BUF_MASK_MAX );
57 residual_Q10[ i ] = (opus_int16)silk_SAT16( silk_SMULWW( exc_buf_Q14[ idx ], Gain_Q16 >> 4 ) );
58 }
59 *rand_seed = seed;
60}
61
62void silk_CNG_Reset(
63 silk_decoder_state *psDec /* I/O Decoder state */
64)
65{
66 opus_int i, NLSF_step_Q15, NLSF_acc_Q15;
67
68 NLSF_step_Q15 = silk_DIV32_16( silk_int16_MAX, psDec->LPC_order + 1 );
69 NLSF_acc_Q15 = 0;
70 for( i = 0; i < psDec->LPC_order; i++ ) {
71 NLSF_acc_Q15 += NLSF_step_Q15;
72 psDec->sCNG.CNG_smth_NLSF_Q15[ i ] = NLSF_acc_Q15;
73 }
74 psDec->sCNG.CNG_smth_Gain_Q16 = 0;
75 psDec->sCNG.rand_seed = 3176576;
76}
77
78/* Updates CNG estimate, and applies the CNG when packet was lost */
79void silk_CNG(
80 silk_decoder_state *psDec, /* I/O Decoder state */
81 silk_decoder_control *psDecCtrl, /* I/O Decoder control */
82 opus_int16 frame[], /* I/O Signal */
83 opus_int length /* I Length of residual */
84)
85{
86 opus_int i, subfr;
87 opus_int32 sum_Q6, max_Gain_Q16;
88 opus_int16 A_Q12[ MAX_LPC_ORDER ];
89 opus_int32 CNG_sig_Q10[ MAX_FRAME_LENGTH + MAX_LPC_ORDER ];
90 silk_CNG_struct *psCNG = &psDec->sCNG;
91
92 if( psDec->fs_kHz != psCNG->fs_kHz ) {
93 /* Reset state */
94 silk_CNG_Reset( psDec );
95
96 psCNG->fs_kHz = psDec->fs_kHz;
97 }
98 if( psDec->lossCnt == 0 && psDec->prevSignalType == TYPE_NO_VOICE_ACTIVITY ) {
99 /* Update CNG parameters */
100
101 /* Smoothing of LSF's */
102 for( i = 0; i < psDec->LPC_order; i++ ) {
103 psCNG->CNG_smth_NLSF_Q15[ i ] += silk_SMULWB( (opus_int32)psDec->prevNLSF_Q15[ i ] - (opus_int32)psCNG->CNG_smth_NLSF_Q15[ i ], CNG_NLSF_SMTH_Q16 );
104 }
105 /* Find the subframe with the highest gain */
106 max_Gain_Q16 = 0;
107 subfr = 0;
108 for( i = 0; i < psDec->nb_subfr; i++ ) {
109 if( psDecCtrl->Gains_Q16[ i ] > max_Gain_Q16 ) {
110 max_Gain_Q16 = psDecCtrl->Gains_Q16[ i ];
111 subfr = i;
112 }
113 }
114 /* Update CNG excitation buffer with excitation from this subframe */
115 silk_memmove( &psCNG->CNG_exc_buf_Q14[ psDec->subfr_length ], psCNG->CNG_exc_buf_Q14, ( psDec->nb_subfr - 1 ) * psDec->subfr_length * sizeof( opus_int32 ) );
116 silk_memcpy( psCNG->CNG_exc_buf_Q14, &psDec->exc_Q14[ subfr * psDec->subfr_length ], psDec->subfr_length * sizeof( opus_int32 ) );
117
118 /* Smooth gains */
119 for( i = 0; i < psDec->nb_subfr; i++ ) {
120 psCNG->CNG_smth_Gain_Q16 += silk_SMULWB( psDecCtrl->Gains_Q16[ i ] - psCNG->CNG_smth_Gain_Q16, CNG_GAIN_SMTH_Q16 );
121 }
122 }
123
124 /* Add CNG when packet is lost or during DTX */
125 if( psDec->lossCnt ) {
126
127 /* Generate CNG excitation */
128 silk_CNG_exc( CNG_sig_Q10 + MAX_LPC_ORDER, psCNG->CNG_exc_buf_Q14, psCNG->CNG_smth_Gain_Q16, length, &psCNG->rand_seed );
129
130 /* Convert CNG NLSF to filter representation */
131 silk_NLSF2A( A_Q12, psCNG->CNG_smth_NLSF_Q15, psDec->LPC_order );
132
133 /* Generate CNG signal, by synthesis filtering */
134 silk_memcpy( CNG_sig_Q10, psCNG->CNG_synth_state, MAX_LPC_ORDER * sizeof( opus_int32 ) );
135 for( i = 0; i < length; i++ ) {
136 silk_assert( psDec->LPC_order == 10 || psDec->LPC_order == 16 );
137 /* Avoids introducing a bias because silk_SMLAWB() always rounds to -inf */
138 sum_Q6 = silk_RSHIFT( psDec->LPC_order, 1 );
139 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 1 ], A_Q12[ 0 ] );
140 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 2 ], A_Q12[ 1 ] );
141 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 3 ], A_Q12[ 2 ] );
142 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 4 ], A_Q12[ 3 ] );
143 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 5 ], A_Q12[ 4 ] );
144 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 6 ], A_Q12[ 5 ] );
145 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 7 ], A_Q12[ 6 ] );
146 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 8 ], A_Q12[ 7 ] );
147 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 9 ], A_Q12[ 8 ] );
148 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 10 ], A_Q12[ 9 ] );
149 if( psDec->LPC_order == 16 ) {
150 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 11 ], A_Q12[ 10 ] );
151 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 12 ], A_Q12[ 11 ] );
152 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 13 ], A_Q12[ 12 ] );
153 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 14 ], A_Q12[ 13 ] );
154 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 15 ], A_Q12[ 14 ] );
155 sum_Q6 = silk_SMLAWB( sum_Q6, CNG_sig_Q10[ MAX_LPC_ORDER + i - 16 ], A_Q12[ 15 ] );
156 }
157
158 /* Update states */
159 CNG_sig_Q10[ MAX_LPC_ORDER + i ] = silk_ADD_LSHIFT( CNG_sig_Q10[ MAX_LPC_ORDER + i ], sum_Q6, 4 );
160
161 frame[ i ] = silk_ADD_SAT16( frame[ i ], silk_RSHIFT_ROUND( sum_Q6, 6 ) );
162 }
163 silk_memcpy( psCNG->CNG_synth_state, &CNG_sig_Q10[ length ], MAX_LPC_ORDER * sizeof( opus_int32 ) );
164 } else {
165 silk_memset( psCNG->CNG_synth_state, 0, psDec->LPC_order * sizeof( opus_int32 ) );
166 }
167}