1*a58d3d2aSXin Li /* Copyright (c) 2021 Amazon */
2*a58d3d2aSXin Li /*
3*a58d3d2aSXin Li Redistribution and use in source and binary forms, with or without
4*a58d3d2aSXin Li modification, are permitted provided that the following conditions
5*a58d3d2aSXin Li are met:
6*a58d3d2aSXin Li
7*a58d3d2aSXin Li - Redistributions of source code must retain the above copyright
8*a58d3d2aSXin Li notice, this list of conditions and the following disclaimer.
9*a58d3d2aSXin Li
10*a58d3d2aSXin Li - Redistributions in binary form must reproduce the above copyright
11*a58d3d2aSXin Li notice, this list of conditions and the following disclaimer in the
12*a58d3d2aSXin Li documentation and/or other materials provided with the distribution.
13*a58d3d2aSXin Li
14*a58d3d2aSXin Li THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
15*a58d3d2aSXin Li ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
16*a58d3d2aSXin Li LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
17*a58d3d2aSXin Li A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR
18*a58d3d2aSXin Li CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
19*a58d3d2aSXin Li EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
20*a58d3d2aSXin Li PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
21*a58d3d2aSXin Li PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
22*a58d3d2aSXin Li LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
23*a58d3d2aSXin Li NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
24*a58d3d2aSXin Li SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25*a58d3d2aSXin Li */
26*a58d3d2aSXin Li
27*a58d3d2aSXin Li #ifdef HAVE_CONFIG_H
28*a58d3d2aSXin Li #include "config.h"
29*a58d3d2aSXin Li #endif
30*a58d3d2aSXin Li
31*a58d3d2aSXin Li #include "lpcnet_private.h"
32*a58d3d2aSXin Li #include "lpcnet.h"
33*a58d3d2aSXin Li #include "plc_data.h"
34*a58d3d2aSXin Li #include "os_support.h"
35*a58d3d2aSXin Li #include "common.h"
36*a58d3d2aSXin Li #include "cpu_support.h"
37*a58d3d2aSXin Li
38*a58d3d2aSXin Li #ifndef M_PI
39*a58d3d2aSXin Li #define M_PI 3.141592653
40*a58d3d2aSXin Li #endif
41*a58d3d2aSXin Li
42*a58d3d2aSXin Li /* Comment this out to have LPCNet update its state on every good packet (slow). */
43*a58d3d2aSXin Li #define PLC_SKIP_UPDATES
44*a58d3d2aSXin Li
lpcnet_plc_reset(LPCNetPLCState * st)45*a58d3d2aSXin Li void lpcnet_plc_reset(LPCNetPLCState *st) {
46*a58d3d2aSXin Li OPUS_CLEAR((char*)&st->LPCNET_PLC_RESET_START,
47*a58d3d2aSXin Li sizeof(LPCNetPLCState)-
48*a58d3d2aSXin Li ((char*)&st->LPCNET_PLC_RESET_START - (char*)st));
49*a58d3d2aSXin Li lpcnet_encoder_init(&st->enc);
50*a58d3d2aSXin Li OPUS_CLEAR(st->pcm, PLC_BUF_SIZE);
51*a58d3d2aSXin Li st->blend = 0;
52*a58d3d2aSXin Li st->loss_count = 0;
53*a58d3d2aSXin Li st->analysis_gap = 1;
54*a58d3d2aSXin Li st->analysis_pos = PLC_BUF_SIZE;
55*a58d3d2aSXin Li st->predict_pos = PLC_BUF_SIZE;
56*a58d3d2aSXin Li }
57*a58d3d2aSXin Li
lpcnet_plc_init(LPCNetPLCState * st)58*a58d3d2aSXin Li int lpcnet_plc_init(LPCNetPLCState *st) {
59*a58d3d2aSXin Li int ret;
60*a58d3d2aSXin Li st->arch = opus_select_arch();
61*a58d3d2aSXin Li fargan_init(&st->fargan);
62*a58d3d2aSXin Li lpcnet_encoder_init(&st->enc);
63*a58d3d2aSXin Li st->loaded = 0;
64*a58d3d2aSXin Li #ifndef USE_WEIGHTS_FILE
65*a58d3d2aSXin Li ret = init_plcmodel(&st->model, plcmodel_arrays);
66*a58d3d2aSXin Li if (ret == 0) st->loaded = 1;
67*a58d3d2aSXin Li #else
68*a58d3d2aSXin Li ret = 0;
69*a58d3d2aSXin Li #endif
70*a58d3d2aSXin Li celt_assert(ret == 0);
71*a58d3d2aSXin Li lpcnet_plc_reset(st);
72*a58d3d2aSXin Li return ret;
73*a58d3d2aSXin Li }
74*a58d3d2aSXin Li
lpcnet_plc_load_model(LPCNetPLCState * st,const void * data,int len)75*a58d3d2aSXin Li int lpcnet_plc_load_model(LPCNetPLCState *st, const void *data, int len) {
76*a58d3d2aSXin Li WeightArray *list;
77*a58d3d2aSXin Li int ret;
78*a58d3d2aSXin Li parse_weights(&list, data, len);
79*a58d3d2aSXin Li ret = init_plcmodel(&st->model, list);
80*a58d3d2aSXin Li opus_free(list);
81*a58d3d2aSXin Li if (ret == 0) {
82*a58d3d2aSXin Li ret = lpcnet_encoder_load_model(&st->enc, data, len);
83*a58d3d2aSXin Li }
84*a58d3d2aSXin Li if (ret == 0) {
85*a58d3d2aSXin Li ret = fargan_load_model(&st->fargan, data, len);
86*a58d3d2aSXin Li }
87*a58d3d2aSXin Li if (ret == 0) st->loaded = 1;
88*a58d3d2aSXin Li return ret;
89*a58d3d2aSXin Li }
90*a58d3d2aSXin Li
lpcnet_plc_fec_add(LPCNetPLCState * st,const float * features)91*a58d3d2aSXin Li void lpcnet_plc_fec_add(LPCNetPLCState *st, const float *features) {
92*a58d3d2aSXin Li if (features == NULL) {
93*a58d3d2aSXin Li st->fec_skip++;
94*a58d3d2aSXin Li return;
95*a58d3d2aSXin Li }
96*a58d3d2aSXin Li if (st->fec_fill_pos == PLC_MAX_FEC) {
97*a58d3d2aSXin Li OPUS_MOVE(&st->fec[0][0], &st->fec[st->fec_read_pos][0], (st->fec_fill_pos-st->fec_read_pos)*NB_FEATURES);
98*a58d3d2aSXin Li st->fec_fill_pos = st->fec_fill_pos-st->fec_read_pos;
99*a58d3d2aSXin Li st->fec_read_pos -= st->fec_read_pos;
100*a58d3d2aSXin Li }
101*a58d3d2aSXin Li OPUS_COPY(&st->fec[st->fec_fill_pos][0], features, NB_FEATURES);
102*a58d3d2aSXin Li st->fec_fill_pos++;
103*a58d3d2aSXin Li }
104*a58d3d2aSXin Li
lpcnet_plc_fec_clear(LPCNetPLCState * st)105*a58d3d2aSXin Li void lpcnet_plc_fec_clear(LPCNetPLCState *st) {
106*a58d3d2aSXin Li st->fec_read_pos = st->fec_fill_pos = st->fec_skip = 0;
107*a58d3d2aSXin Li }
108*a58d3d2aSXin Li
109*a58d3d2aSXin Li
compute_plc_pred(LPCNetPLCState * st,float * out,const float * in)110*a58d3d2aSXin Li static void compute_plc_pred(LPCNetPLCState *st, float *out, const float *in) {
111*a58d3d2aSXin Li float tmp[PLC_DENSE_IN_OUT_SIZE];
112*a58d3d2aSXin Li PLCModel *model = &st->model;
113*a58d3d2aSXin Li PLCNetState *net = &st->plc_net;
114*a58d3d2aSXin Li celt_assert(st->loaded);
115*a58d3d2aSXin Li compute_generic_dense(&model->plc_dense_in, tmp, in, ACTIVATION_TANH, st->arch);
116*a58d3d2aSXin Li compute_generic_gru(&model->plc_gru1_input, &model->plc_gru1_recurrent, net->gru1_state, tmp, st->arch);
117*a58d3d2aSXin Li compute_generic_gru(&model->plc_gru2_input, &model->plc_gru2_recurrent, net->gru2_state, net->gru1_state, st->arch);
118*a58d3d2aSXin Li compute_generic_dense(&model->plc_dense_out, out, net->gru2_state, ACTIVATION_LINEAR, st->arch);
119*a58d3d2aSXin Li }
120*a58d3d2aSXin Li
get_fec_or_pred(LPCNetPLCState * st,float * out)121*a58d3d2aSXin Li static int get_fec_or_pred(LPCNetPLCState *st, float *out) {
122*a58d3d2aSXin Li if (st->fec_read_pos != st->fec_fill_pos && st->fec_skip==0) {
123*a58d3d2aSXin Li float plc_features[2*NB_BANDS+NB_FEATURES+1] = {0};
124*a58d3d2aSXin Li float discard[NB_FEATURES];
125*a58d3d2aSXin Li OPUS_COPY(out, &st->fec[st->fec_read_pos][0], NB_FEATURES);
126*a58d3d2aSXin Li st->fec_read_pos++;
127*a58d3d2aSXin Li /* Update PLC state using FEC, so without Burg features. */
128*a58d3d2aSXin Li OPUS_COPY(&plc_features[2*NB_BANDS], out, NB_FEATURES);
129*a58d3d2aSXin Li plc_features[2*NB_BANDS+NB_FEATURES] = -1;
130*a58d3d2aSXin Li compute_plc_pred(st, discard, plc_features);
131*a58d3d2aSXin Li return 1;
132*a58d3d2aSXin Li } else {
133*a58d3d2aSXin Li float zeros[2*NB_BANDS+NB_FEATURES+1] = {0};
134*a58d3d2aSXin Li compute_plc_pred(st, out, zeros);
135*a58d3d2aSXin Li if (st->fec_skip > 0) st->fec_skip--;
136*a58d3d2aSXin Li return 0;
137*a58d3d2aSXin Li }
138*a58d3d2aSXin Li }
139*a58d3d2aSXin Li
queue_features(LPCNetPLCState * st,const float * features)140*a58d3d2aSXin Li static void queue_features(LPCNetPLCState *st, const float *features) {
141*a58d3d2aSXin Li OPUS_MOVE(&st->cont_features[0], &st->cont_features[NB_FEATURES], (CONT_VECTORS-1)*NB_FEATURES);
142*a58d3d2aSXin Li OPUS_COPY(&st->cont_features[(CONT_VECTORS-1)*NB_FEATURES], features, NB_FEATURES);
143*a58d3d2aSXin Li }
144*a58d3d2aSXin Li
145*a58d3d2aSXin Li /* In this causal version of the code, the DNN model implemented by compute_plc_pred()
146*a58d3d2aSXin Li needs to generate two feature vectors to conceal the first lost packet.*/
147*a58d3d2aSXin Li
lpcnet_plc_update(LPCNetPLCState * st,opus_int16 * pcm)148*a58d3d2aSXin Li int lpcnet_plc_update(LPCNetPLCState *st, opus_int16 *pcm) {
149*a58d3d2aSXin Li int i;
150*a58d3d2aSXin Li if (st->analysis_pos - FRAME_SIZE >= 0) st->analysis_pos -= FRAME_SIZE;
151*a58d3d2aSXin Li else st->analysis_gap = 1;
152*a58d3d2aSXin Li if (st->predict_pos - FRAME_SIZE >= 0) st->predict_pos -= FRAME_SIZE;
153*a58d3d2aSXin Li OPUS_MOVE(st->pcm, &st->pcm[FRAME_SIZE], PLC_BUF_SIZE-FRAME_SIZE);
154*a58d3d2aSXin Li for (i=0;i<FRAME_SIZE;i++) st->pcm[PLC_BUF_SIZE-FRAME_SIZE+i] = (1.f/32768.f)*pcm[i];
155*a58d3d2aSXin Li st->loss_count = 0;
156*a58d3d2aSXin Li st->blend = 0;
157*a58d3d2aSXin Li return 0;
158*a58d3d2aSXin Li }
159*a58d3d2aSXin Li
160*a58d3d2aSXin Li static const float att_table[10] = {0, 0, -.2, -.2, -.4, -.4, -.8, -.8, -1.6, -1.6};
lpcnet_plc_conceal(LPCNetPLCState * st,opus_int16 * pcm)161*a58d3d2aSXin Li int lpcnet_plc_conceal(LPCNetPLCState *st, opus_int16 *pcm) {
162*a58d3d2aSXin Li int i;
163*a58d3d2aSXin Li celt_assert(st->loaded);
164*a58d3d2aSXin Li if (st->blend == 0) {
165*a58d3d2aSXin Li int count = 0;
166*a58d3d2aSXin Li st->plc_net = st->plc_bak[0];
167*a58d3d2aSXin Li while (st->analysis_pos + FRAME_SIZE <= PLC_BUF_SIZE) {
168*a58d3d2aSXin Li float x[FRAME_SIZE];
169*a58d3d2aSXin Li float plc_features[2*NB_BANDS+NB_FEATURES+1];
170*a58d3d2aSXin Li celt_assert(st->analysis_pos >= 0);
171*a58d3d2aSXin Li for (i=0;i<FRAME_SIZE;i++) x[i] = 32768.f*st->pcm[st->analysis_pos+i];
172*a58d3d2aSXin Li burg_cepstral_analysis(plc_features, x);
173*a58d3d2aSXin Li lpcnet_compute_single_frame_features_float(&st->enc, x, st->features, st->arch);
174*a58d3d2aSXin Li if ((!st->analysis_gap || count>0) && st->analysis_pos >= st->predict_pos) {
175*a58d3d2aSXin Li queue_features(st, st->features);
176*a58d3d2aSXin Li OPUS_COPY(&plc_features[2*NB_BANDS], st->features, NB_FEATURES);
177*a58d3d2aSXin Li plc_features[2*NB_BANDS+NB_FEATURES] = 1;
178*a58d3d2aSXin Li st->plc_bak[0] = st->plc_bak[1];
179*a58d3d2aSXin Li st->plc_bak[1] = st->plc_net;
180*a58d3d2aSXin Li compute_plc_pred(st, st->features, plc_features);
181*a58d3d2aSXin Li }
182*a58d3d2aSXin Li st->analysis_pos += FRAME_SIZE;
183*a58d3d2aSXin Li count++;
184*a58d3d2aSXin Li }
185*a58d3d2aSXin Li st->plc_bak[0] = st->plc_bak[1];
186*a58d3d2aSXin Li st->plc_bak[1] = st->plc_net;
187*a58d3d2aSXin Li get_fec_or_pred(st, st->features);
188*a58d3d2aSXin Li queue_features(st, st->features);
189*a58d3d2aSXin Li st->plc_bak[0] = st->plc_bak[1];
190*a58d3d2aSXin Li st->plc_bak[1] = st->plc_net;
191*a58d3d2aSXin Li get_fec_or_pred(st, st->features);
192*a58d3d2aSXin Li queue_features(st, st->features);
193*a58d3d2aSXin Li fargan_cont(&st->fargan, &st->pcm[PLC_BUF_SIZE-FARGAN_CONT_SAMPLES], st->cont_features);
194*a58d3d2aSXin Li st->analysis_gap = 0;
195*a58d3d2aSXin Li }
196*a58d3d2aSXin Li st->plc_bak[0] = st->plc_bak[1];
197*a58d3d2aSXin Li st->plc_bak[1] = st->plc_net;
198*a58d3d2aSXin Li if (get_fec_or_pred(st, st->features)) st->loss_count = 0;
199*a58d3d2aSXin Li else st->loss_count++;
200*a58d3d2aSXin Li if (st->loss_count >= 10) st->features[0] = MAX16(-10, st->features[0]+att_table[9] - 2*(st->loss_count-9));
201*a58d3d2aSXin Li else st->features[0] = MAX16(-10, st->features[0]+att_table[st->loss_count]);
202*a58d3d2aSXin Li fargan_synthesize_int(&st->fargan, pcm, &st->features[0]);
203*a58d3d2aSXin Li queue_features(st, st->features);
204*a58d3d2aSXin Li if (st->analysis_pos - FRAME_SIZE >= 0) st->analysis_pos -= FRAME_SIZE;
205*a58d3d2aSXin Li else st->analysis_gap = 1;
206*a58d3d2aSXin Li st->predict_pos = PLC_BUF_SIZE;
207*a58d3d2aSXin Li OPUS_MOVE(st->pcm, &st->pcm[FRAME_SIZE], PLC_BUF_SIZE-FRAME_SIZE);
208*a58d3d2aSXin Li for (i=0;i<FRAME_SIZE;i++) st->pcm[PLC_BUF_SIZE-FRAME_SIZE+i] = (1.f/32768.f)*pcm[i];
209*a58d3d2aSXin Li st->blend = 1;
210*a58d3d2aSXin Li return 0;
211*a58d3d2aSXin Li }
212