Coverage Report

Created: 2026-01-10 06:30

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/libxaac/encoder/iusace_lpc_avq.c
Line
Count
Source
1
/******************************************************************************
2
 *                                                                            *
3
 * Copyright (C) 2023 The Android Open Source Project
4
 *
5
 * Licensed under the Apache License, Version 2.0 (the "License");
6
 * you may not use this file except in compliance with the License.
7
 * You may obtain a copy of the License at:
8
 *
9
 * http://www.apache.org/licenses/LICENSE-2.0
10
 *
11
 * Unless required by applicable law or agreed to in writing, software
12
 * distributed under the License is distributed on an "AS IS" BASIS,
13
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14
 * See the License for the specific language governing permissions and
15
 * limitations under the License.
16
 *
17
 *****************************************************************************
18
 * Originally developed and contributed by Ittiam Systems Pvt. Ltd, Bangalore
19
 */
20
21
#include <math.h>
22
#include "ixheaac_type_def.h"
23
#include "ixheaace_adjust_threshold_data.h"
24
#include "iusace_bitbuffer.h"
25
26
/* DRC */
27
#include "impd_drc_common_enc.h"
28
#include "impd_drc_uni_drc.h"
29
#include "impd_drc_tables.h"
30
#include "impd_drc_api.h"
31
#include "impd_drc_uni_drc_eq.h"
32
#include "impd_drc_uni_drc_filter_bank.h"
33
#include "impd_drc_gain_enc.h"
34
#include "impd_drc_struct_def.h"
35
36
#include "iusace_cnst.h"
37
#include "iusace_tns_usac.h"
38
#include "iusace_psy_mod.h"
39
#include "iusace_config.h"
40
#include "iusace_arith_enc.h"
41
#include "iusace_block_switch_const.h"
42
#include "iusace_block_switch_struct_def.h"
43
#include "iusace_fd_qc_util.h"
44
#include "iusace_fd_quant.h"
45
#include "iusace_ms.h"
46
#include "iusace_signal_classifier.h"
47
#include "ixheaace_sbr_header.h"
48
#include "ixheaace_config.h"
49
#include "ixheaace_asc_write.h"
50
#include "iusace_main.h"
51
#include "iusace_func_prototypes.h"
52
#include "iusace_avq_enc.h"
53
54
2.64M
static VOID iusace_lsf_weight_2st_flt(FLOAT32 *lsfq, FLOAT32 *w, WORD32 mode) {
55
2.64M
  WORD32 i;
56
2.64M
  FLOAT32 d[ORDER + 1];
57
58
2.64M
  d[0] = lsfq[0];
59
2.64M
  d[ORDER] = FREQ_MAX - lsfq[ORDER - 1];
60
42.2M
  for (i = 1; i < ORDER; i++) {
61
39.6M
    d[i] = lsfq[i] - lsfq[i - 1];
62
39.6M
  }
63
64
44.9M
  for (i = 0; i < ORDER; i++) {
65
42.2M
    w[i] = (FLOAT32)(iusace_wlsf_factor_table[mode] / (FREQ_DIV / sqrt(d[i] * d[i + 1])));
66
42.2M
  }
67
2.64M
}
68
69
608k
static VOID iusace_lsf_weight(FLOAT32 *lsf, FLOAT32 *ptr_w) {
70
608k
  WORD32 i;
71
608k
  FLOAT32 d[ORDER + 1];
72
73
608k
  d[0] = lsf[0];
74
608k
  d[ORDER] = FREQ_MAX - lsf[ORDER - 1];
75
9.73M
  for (i = 1; i < ORDER; i++) {
76
9.12M
    d[i] = lsf[i] - lsf[i - 1];
77
9.12M
  }
78
79
10.3M
  for (i = 0; i < ORDER; i++) {
80
9.73M
    ptr_w[i] = (1.0f / d[i]) + (1.0f / d[i + 1]);
81
9.73M
  }
82
83
608k
  return;
84
608k
}
85
86
608k
static WORD32 iusace_avq_first_approx_abs(FLOAT32 *lsf, FLOAT32 *lsfq) {
87
608k
  WORD32 i, j, index;
88
608k
  FLOAT32 w[ORDER];
89
608k
  FLOAT32 dist_min, dist, temp;
90
608k
  const FLOAT32 *p_dico;
91
92
608k
  iusace_lsf_weight(lsf, w);
93
94
608k
  dist_min = 1.0e30f;
95
608k
  p_dico = iusace_dico_lsf_abs_8b_flt;
96
608k
  index = 0;
97
98
156M
  for (i = 0; i < 256; i++) {
99
155M
    dist = 0.0;
100
2.64G
    for (j = 0; j < ORDER; j++) {
101
2.49G
      temp = lsf[j] - *p_dico++;
102
2.49G
      dist += w[j] * temp * temp;
103
2.49G
    }
104
155M
    if (dist < dist_min) {
105
4.29M
      dist_min = dist;
106
4.29M
      index = i;
107
4.29M
    }
108
155M
  }
109
110
10.3M
  for (j = 0; j < ORDER; j++) {
111
9.73M
    lsfq[j] = iusace_dico_lsf_abs_8b_flt[index * ORDER + j];
112
9.73M
  }
113
114
608k
  return index;
115
608k
}
116
117
static WORD32 iusace_avq_first_approx_rel(FLOAT32 *ptr_lsf, FLOAT32 *ptr_lsfq, WORD32 *idx,
118
1.51M
                                          WORD32 mode) {
119
1.51M
  WORD32 i, num_bits;
120
1.51M
  FLOAT32 w[ORDER], x[ORDER], temp;
121
1.51M
  WORD32 nq, avq[ORDER];
122
1.51M
  FLOAT32 lsf_min;
123
124
1.51M
  iusace_lsf_weight_2st_flt(ptr_lsf, w, 1);
125
126
1.51M
  temp = 0.0f;
127
25.8M
  for (i = 0; i < ORDER; i++) {
128
24.3M
    x[i] = (ptr_lsf[i] - ptr_lsfq[i]) / w[i];
129
24.3M
    temp += x[i] * x[i];
130
24.3M
  }
131
132
1.51M
  if (temp < 8.0f) {
133
394k
    idx[0] = 0;
134
394k
    idx[1] = 0;
135
394k
    if ((mode == 0) || (mode == 3)) {
136
77.3k
      return (10);
137
316k
    } else if (mode == 1) {
138
142k
      return (2);
139
174k
    } else {
140
174k
      return (6);
141
174k
    }
142
394k
  }
143
144
1.12M
  iusace_lsf_weight_2st_flt(ptr_lsfq, w, mode);
145
146
19.1M
  for (i = 0; i < ORDER; i++) {
147
17.9M
    x[i] = (ptr_lsf[i] - ptr_lsfq[i]) / w[i];
148
17.9M
  }
149
150
1.12M
  iusace_alg_vec_quant(x, avq, idx);
151
152
19.1M
  for (i = 0; i < ORDER; i++) {
153
17.9M
    ptr_lsfq[i] += (w[i] * (FLOAT32)avq[i]);
154
17.9M
  }
155
156
1.12M
  num_bits = 0;
157
3.37M
  for (i = 0; i < 2; i++) {
158
2.24M
    nq = idx[i];
159
160
2.24M
    if ((mode == 0) || (mode == 3)) {
161
1.37M
      num_bits += (2 + (nq * 4));
162
1.37M
      if (nq > 6) {
163
233k
        num_bits += nq - 3;
164
1.13M
      } else if (nq > 4) {
165
558k
        num_bits += nq - 4;
166
580k
      } else if (nq == 0) {
167
137k
        num_bits += 3;
168
137k
      }
169
1.37M
    } else if (mode == 1) {
170
320k
      num_bits += nq * 5;
171
320k
      if (nq == 0) {
172
35.3k
        num_bits += 1;
173
35.3k
      }
174
556k
    } else {
175
556k
      num_bits += (2 + (nq * 4));
176
556k
      if (nq == 0) {
177
30.6k
        num_bits += 1;
178
525k
      } else if (nq > 4) {
179
157k
        num_bits += nq - 3;
180
157k
      }
181
556k
    }
182
2.24M
  }
183
184
1.12M
  lsf_min = LSF_GAP;
185
19.1M
  for (i = 0; i < ORDER; i++) {
186
17.9M
    if (ptr_lsfq[i] < lsf_min) {
187
578k
      ptr_lsfq[i] = lsf_min;
188
578k
    }
189
190
17.9M
    lsf_min = ptr_lsfq[i] + LSF_GAP;
191
17.9M
  }
192
193
1.12M
  lsf_min = FREQ_MAX - LSF_GAP;
194
19.1M
  for (i = ORDER - 1; i >= 0; i--) {
195
17.9M
    if (ptr_lsfq[i] > lsf_min) {
196
54.4k
      ptr_lsfq[i] = lsf_min;
197
54.4k
    }
198
199
17.9M
    lsf_min = ptr_lsfq[i] - LSF_GAP;
200
17.9M
  }
201
202
1.12M
  return (num_bits);
203
1.51M
}
204
205
VOID iusace_quantize_lpc_avq(FLOAT32 *ptr_lsf, FLOAT32 *ptr_lsfq, WORD32 lpc0,
206
151k
                             WORD32 *ptr_lpc_idx, WORD32 *nb_indices, WORD32 *nbbits) {
207
151k
  WORD32 i;
208
151k
  FLOAT32 lsfq[ORDER];
209
151k
  WORD32 *ptr_index, indxt[100], num_bits, nbt, nit;
210
211
151k
  ptr_index = &ptr_lpc_idx[0];
212
151k
  *nb_indices = 0;
213
151k
  *nbbits = 0;
214
215
151k
  ptr_index[0] = iusace_avq_first_approx_abs(&ptr_lsf[3 * ORDER], &ptr_lsfq[3 * ORDER]);
216
217
151k
  nbt = iusace_avq_first_approx_rel(&ptr_lsf[3 * ORDER], &ptr_lsfq[3 * ORDER], &ptr_index[1], 0);
218
151k
  nit = 1 + iusace_get_num_params(&ptr_lpc_idx[1]);
219
220
151k
  ptr_index += nit;
221
151k
  *nb_indices += nit;
222
151k
  *nbbits += 8 + nbt;
223
224
151k
  if (lpc0) {
225
4.30k
    *ptr_index = 0;
226
4.30k
    ptr_index++;
227
4.30k
    *nb_indices += 1;
228
4.30k
    *nbbits += 1;
229
230
4.30k
    ptr_index[0] = iusace_avq_first_approx_abs(&ptr_lsf[-ORDER], &ptr_lsfq[-ORDER]);
231
232
4.30k
    num_bits = iusace_avq_first_approx_rel(&ptr_lsf[-ORDER], &ptr_lsfq[-ORDER], &ptr_index[1], 0);
233
4.30k
    nbt = 8 + num_bits;
234
4.30k
    nit = 1 + iusace_get_num_params(&ptr_index[1]);
235
236
73.1k
    for (i = 0; i < ORDER; i++) lsfq[i] = ptr_lsfq[3 * ORDER + i];
237
238
4.30k
    num_bits = iusace_avq_first_approx_rel(&ptr_lsf[-ORDER], &lsfq[0], indxt, 3);
239
240
4.30k
    if (num_bits < nbt) {
241
4.08k
      nbt = num_bits;
242
4.08k
      nit = iusace_get_num_params(&indxt[0]);
243
4.08k
      ptr_index[-1] = 1;
244
69.3k
      for (i = 0; i < ORDER; i++) ptr_lsfq[-ORDER + i] = lsfq[i];
245
51.6k
      for (i = 0; i < nit; i++) ptr_index[i] = indxt[i];
246
4.08k
    }
247
248
4.30k
    ptr_index += nit;
249
4.30k
    *nb_indices += nit;
250
4.30k
    *nbbits += nbt;
251
4.30k
  }
252
253
151k
  *ptr_index = 0;
254
151k
  ptr_index++;
255
151k
  *nb_indices += 1;
256
151k
  *nbbits += 1;
257
258
151k
  ptr_index[0] = iusace_avq_first_approx_abs(&ptr_lsf[ORDER], &ptr_lsfq[ORDER]);
259
260
151k
  num_bits = iusace_avq_first_approx_rel(&ptr_lsf[ORDER], &ptr_lsfq[ORDER], &ptr_index[1], 0);
261
151k
  nbt = 8 + num_bits;
262
151k
  nit = 1 + iusace_get_num_params(&ptr_index[1]);
263
264
2.56M
  for (i = 0; i < ORDER; i++) lsfq[i] = ptr_lsfq[3 * ORDER + i];
265
266
151k
  num_bits = iusace_avq_first_approx_rel(&ptr_lsf[ORDER], &lsfq[0], indxt, 3);
267
268
151k
  if (num_bits < nbt) {
269
109k
    nbt = num_bits;
270
109k
    nit = iusace_get_num_params(&indxt[0]);
271
109k
    ptr_index[-1] = 1;
272
1.85M
    for (i = 0; i < ORDER; i++) ptr_lsfq[ORDER + i] = lsfq[i];
273
1.34M
    for (i = 0; i < nit; i++) ptr_index[i] = indxt[i];
274
109k
  }
275
276
151k
  ptr_index += nit;
277
151k
  *nb_indices += nit;
278
151k
  *nbbits += nbt;
279
280
151k
  *ptr_index = 0;
281
151k
  ptr_index++;
282
151k
  *nb_indices += 1;
283
284
151k
  ptr_index[0] = iusace_avq_first_approx_abs(&ptr_lsf[0], &ptr_lsfq[0]);
285
286
151k
  num_bits = iusace_avq_first_approx_rel(&ptr_lsf[0], &ptr_lsfq[0], &ptr_index[1], 0);
287
151k
  nbt = 2 + 8 + num_bits;
288
151k
  nit = 1 + iusace_get_num_params(&ptr_index[1]);
289
290
2.56M
  for (i = 0; i < ORDER; i++) lsfq[i] = 0.5f * (ptr_lsfq[-ORDER + i] + ptr_lsfq[ORDER + i]);
291
292
151k
  num_bits = iusace_avq_first_approx_rel(&ptr_lsf[0], lsfq, indxt, 1);
293
294
151k
  if (num_bits < 10) {
295
70.2k
    nbt = 2;
296
70.2k
    nit = 0;
297
70.2k
    ptr_index[-1] = 1;
298
1.19M
    for (i = 0; i < ORDER; i++) ptr_lsfq[i] = lsfq[i];
299
70.2k
  }
300
301
2.56M
  for (i = 0; i < ORDER; i++) lsfq[i] = ptr_lsfq[ORDER + i];
302
303
151k
  num_bits = iusace_avq_first_approx_rel(&ptr_lsf[0], lsfq, indxt, 2);
304
151k
  num_bits += 1;
305
306
151k
  if (num_bits < nbt) {
307
58.5k
    nbt = num_bits;
308
58.5k
    nit = iusace_get_num_params(&indxt[0]);
309
58.5k
    ptr_index[-1] = 2;
310
995k
    for (i = 0; i < ORDER; i++) ptr_lsfq[i] = lsfq[i];
311
1.10M
    for (i = 0; i < nit; i++) ptr_index[i] = indxt[i];
312
58.5k
  }
313
314
151k
  ptr_index += nit;
315
151k
  *nb_indices += nit;
316
151k
  *nbbits += nbt;
317
318
151k
  *ptr_index = 0;
319
151k
  ptr_index++;
320
151k
  *nb_indices += 1;
321
322
151k
  ptr_index[0] = iusace_avq_first_approx_abs(&ptr_lsf[2 * ORDER], &ptr_lsfq[2 * ORDER]);
323
324
151k
  num_bits =
325
151k
      iusace_avq_first_approx_rel(&ptr_lsf[2 * ORDER], &ptr_lsfq[2 * ORDER], &ptr_index[1], 0);
326
151k
  nbt = 2 + 8 + num_bits;
327
151k
  nit = 1 + iusace_get_num_params(&ptr_index[1]);
328
329
2.56M
  for (i = 0; i < ORDER; i++) lsfq[i] = 0.5f * (ptr_lsfq[ORDER + i] + ptr_lsfq[3 * ORDER + i]);
330
331
151k
  num_bits = iusace_avq_first_approx_rel(&ptr_lsf[2 * ORDER], lsfq, indxt, 1);
332
151k
  num_bits += 1;
333
334
151k
  if (num_bits < nbt) {
335
145k
    nbt = num_bits;
336
145k
    nit = iusace_get_num_params(&indxt[0]);
337
145k
    ptr_index[-1] = 1;
338
2.47M
    for (i = 0; i < ORDER; i++) ptr_lsfq[2 * ORDER + i] = lsfq[i];
339
1.64M
    for (i = 0; i < nit; i++) ptr_index[i] = indxt[i];
340
145k
  }
341
342
2.56M
  for (i = 0; i < ORDER; i++) lsfq[i] = ptr_lsfq[ORDER + i];
343
344
151k
  num_bits = iusace_avq_first_approx_rel(&ptr_lsf[2 * ORDER], lsfq, indxt, 2);
345
151k
  num_bits += 3;
346
347
151k
  if (num_bits < nbt) {
348
7.34k
    nbt = num_bits;
349
7.34k
    nit = iusace_get_num_params(&indxt[0]);
350
7.34k
    ptr_index[-1] = 2;
351
124k
    for (i = 0; i < ORDER; i++) ptr_lsfq[2 * ORDER + i] = lsfq[i];
352
99.9k
    for (i = 0; i < nit; i++) ptr_index[i] = indxt[i];
353
7.34k
  }
354
355
2.56M
  for (i = 0; i < ORDER; i++) lsfq[i] = ptr_lsfq[3 * ORDER + i];
356
357
151k
  num_bits = iusace_avq_first_approx_rel(&ptr_lsf[2 * ORDER], lsfq, indxt, 2);
358
151k
  num_bits += 3;
359
360
151k
  if (num_bits < nbt) {
361
38.1k
    nbt = num_bits;
362
38.1k
    nit = iusace_get_num_params(&indxt[0]);
363
38.1k
    ptr_index[-1] = 3;
364
648k
    for (i = 0; i < ORDER; i++) ptr_lsfq[2 * ORDER + i] = lsfq[i];
365
667k
    for (i = 0; i < nit; i++) ptr_index[i] = indxt[i];
366
38.1k
  }
367
368
151k
  *nb_indices += nit;
369
151k
  *nbbits += nbt;
370
371
151k
  return;
372
151k
}