1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
|
/* ------------------------------------------------------------------
* Copyright (C) 1998-2009 PacketVideo
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
* express or implied.
* See the License for the specific language governing permissions
* and limitations under the License.
* -------------------------------------------------------------------
*/
/****************************************************************************************
Portions of this file are derived from the following 3GPP standard:
3GPP TS 26.073
ANSI-C code for the Adaptive Multi-Rate (AMR) speech codec
Available from http://www.3gpp.org
(C) 2004, 3GPP Organizational Partners (ARIB, ATIS, CCSA, ETSI, TTA, TTC)
Permission to distribute, modify and use this file under the standard license
terms listed above has been obtained from the copyright holder.
****************************************************************************************/
/*
------------------------------------------------------------------------------
Pathname: ./audio/gsm-amr/c/src/d_plsf_3.c
Functions: D_plsf_3
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
Inputs:
st -- Pointer to type struct D_plsfState
mode -- enum Mode -- coder mode
bfi -- Word16 -- bad frame indicator (set to 1 if a bad frame is received)
indice -- Pointer to type Word16 -- quantization indices of
3 submatrices, Q0
Outputs:
st -- Pointer to type struct D_plsfState
lsp1_q -- Pointer to type Word16 -- quantized 1st LSP vector Q15
pOverflow -- Pointer to type Flag -- Flag set when overflow occurs
Returns:
None.
Global Variables Used:
None
Local Variables Needed:
None
------------------------------------------------------------------------------
FUNCTION DESCRIPTION
PURPOSE: Decodes the LSP parameters using the received quantization
indices.1st order MA prediction and split by 3 vector
quantization (split-VQ)
------------------------------------------------------------------------------
REQUIREMENTS
------------------------------------------------------------------------------
REFERENCES
d_plsf_3.c, UMTS GSM AMR speech codec, R99 - Version 3.2.0, March 2, 2001
------------------------------------------------------------------------------
PSEUDO-CODE
------------------------------------------------------------------------------
RESOURCES USED
When the code is written for a specific target processor the
the resources used should be documented below.
STACK USAGE: [stack count for this module] + [variable to represent
stack usage for each subroutine called]
where: [stack usage variable] = stack usage for [subroutine
name] (see [filename].ext)
DATA MEMORY USED: x words
PROGRAM MEMORY USED: x words
CLOCK CYCLES: [cycle count equation for this module] + [variable
used to represent cycle count for each subroutine
called]
where: [cycle count variable] = cycle count for [subroutine
name] (see [filename].ext)
------------------------------------------------------------------------------
*/
/*----------------------------------------------------------------------------
; INCLUDES
----------------------------------------------------------------------------*/
#include "d_plsf.h"
#include "typedef.h"
#include "basic_op.h"
#include "lsp_lsf.h"
#include "reorder.h"
#include "copy.h"
#include "q_plsf_3_tbl.h"
/*----------------------------------------------------------------------------
; MACROS
; Define module specific macros here
----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------
; DEFINES
; Include all pre-processor statements here. Include conditional
; compile variables also.
----------------------------------------------------------------------------*/
#define ALPHA 29491 /* ALPHA -> 0.9 */
#define ONE_ALPHA 3277 /* ONE_ALPHA-> (1.0-ALPHA) */
/*----------------------------------------------------------------------------
; LOCAL FUNCTION DEFINITIONS
; Function Prototype declaration
----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------
; LOCAL STORE/BUFFER/POINTER DEFINITIONS
; Variable declaration - defined here and used outside this module
----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------
; EXTERNAL FUNCTION REFERENCES
; Declare functions defined elsewhere and referenced in this module
----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------
; EXTERNAL GLOBAL STORE/BUFFER/POINTER REFERENCES
; Declare variables used in this module but defined elsewhere
----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------
; FUNCTION CODE
----------------------------------------------------------------------------*/
void D_plsf_3(
D_plsfState *st, /* i/o: State struct */
enum Mode mode, /* i : coder mode */
Word16 bfi, /* i : bad frame indicator (set to 1 if a */
/* bad frame is received) */
Word16 * indice, /* i : quantization indices of 3 submatrices, Q0 */
Word16 * lsp1_q, /* o : quantized 1st LSP vector, Q15 */
Flag *pOverflow /* o : Flag set when overflow occurs */
)
{
Word16 i;
Word16 temp;
Word16 index;
Word16 lsf1_r[M];
Word16 lsf1_q[M];
if (bfi != 0) /* if bad frame */
{
/* use the past LSFs slightly shifted towards their mean */
for (i = 0; i < M; i++)
{
/* lsfi_q[i] = ALPHA*past_lsf_q[i] + ONE_ALPHA*mean_lsf[i]; */
temp =
mult(
st->past_lsf_q[i],
ALPHA,
pOverflow);
index =
mult(
mean_lsf_3[i],
ONE_ALPHA,
pOverflow);
lsf1_q[i] =
add(
index,
temp,
pOverflow);
}
/* estimate past quantized residual to be used in next frame */
if (mode != MRDTX)
{
for (i = 0; i < M; i++)
{
/* temp = mean_lsf[i] + past_r2_q[i] * PRED_FAC; */
temp =
mult(
st->past_r_q[i],
pred_fac_3[i],
pOverflow);
temp =
add(
mean_lsf_3[i],
temp,
pOverflow);
st->past_r_q[i] =
sub(
lsf1_q[i],
temp,
pOverflow);
}
} /* if (mode == MRDTX) */
else
{
for (i = 0; i < M; i++)
{
/* temp = mean_lsf[i] + past_r2_q[i]; */
temp =
add(
mean_lsf_3[i],
st->past_r_q[i],
pOverflow);
st->past_r_q[i] =
sub(
lsf1_q[i],
temp,
pOverflow);
}
}
} /* if (bfi != 0) */
else /* if good LSFs received */
{
Word16 index_limit_1 = 0;
Word16 index_limit_2 = (DICO2_SIZE - 1) * 3;
Word16 index_limit_3 = 0;
const Word16 *p_cb1;
const Word16 *p_cb2;
const Word16 *p_cb3;
const Word16 *p_dico;
p_cb2 = dico2_lsf_3; /* size DICO2_SIZE*3 */
if ((mode == MR475) || (mode == MR515))
{ /* MR475, MR515 */
p_cb1 = dico1_lsf_3; /* size DICO1_SIZE*3 */
p_cb3 = mr515_3_lsf; /* size MR515_3_SIZE*4 */
index_limit_1 = (DICO1_SIZE - 1) * 3;
index_limit_3 = (MR515_3_SIZE - 1) * 4;
}
else if (mode == MR795)
{ /* MR795 */
p_cb1 = mr795_1_lsf; /* size MR795_1_SIZE*3 */
p_cb3 = dico3_lsf_3; /* size DICO3_SIZE*4 */
index_limit_1 = (MR795_1_SIZE - 1) * 3;
index_limit_3 = (DICO3_SIZE - 1) * 4;
}
else
{ /* MR59, MR67, MR74, MR102, MRDTX */
p_cb1 = dico1_lsf_3; /* size DICO1_SIZE*3 */
p_cb3 = dico3_lsf_3; /* size DICO3_SIZE*4 */
index_limit_1 = (DICO1_SIZE - 1) * 3;
index_limit_3 = (DICO3_SIZE - 1) * 4;
}
/* decode prediction residuals from 3 received indices */
index = *indice++;
/* temp = 3*index; */
temp = index + (index << 1);
if (temp > index_limit_1)
{
temp = index_limit_1; /* avoid buffer overrun */
}
p_dico = &p_cb1[temp];
lsf1_r[0] = *p_dico++;
lsf1_r[1] = *p_dico++;
lsf1_r[2] = *p_dico++;
index = *indice++;
if (mode == MR475 || mode == MR515)
{ /* MR475, MR515 only using every second entry */
index <<= 1;
}
/* temp = 3*index */
temp = index + (index << 1);
if (temp > index_limit_2)
{
temp = index_limit_2; /* avoid buffer overrun */
}
p_dico = &p_cb2[temp];
lsf1_r[3] = *p_dico++;
lsf1_r[4] = *p_dico++;
lsf1_r[5] = *p_dico++;
index = *indice++;
temp = index << 2;
if (temp > index_limit_3)
{
temp = index_limit_3; /* avoid buffer overrun */
}
p_dico = &p_cb3[temp];
lsf1_r[6] = *p_dico++;
lsf1_r[7] = *p_dico++;
lsf1_r[8] = *p_dico++;
lsf1_r[9] = *p_dico++;
/* Compute quantized LSFs and update the past quantized residual */
if (mode != MRDTX)
{
for (i = 0; i < M; i++)
{
temp =
mult(
st->past_r_q[i],
pred_fac_3[i],
pOverflow);
temp =
add(
mean_lsf_3[i],
temp,
pOverflow);
lsf1_q[i] =
add(
lsf1_r[i],
temp,
pOverflow);
st->past_r_q[i] = lsf1_r[i];
}
}
else
{
for (i = 0; i < M; i++)
{
temp =
add(
mean_lsf_3[i],
st->past_r_q[i],
pOverflow);
lsf1_q[i] =
add(
lsf1_r[i],
temp,
pOverflow);
st->past_r_q[i] = lsf1_r[i];
}
}
}
/* verification that LSFs has minimum distance of LSF_GAP Hz */
Reorder_lsf(
lsf1_q,
LSF_GAP,
M,
pOverflow);
Copy(
lsf1_q,
st->past_lsf_q,
M);
/* convert LSFs to the cosine domain */
Lsf_lsp(
lsf1_q,
lsp1_q,
M,
pOverflow);
return;
}
/*
------------------------------------------------------------------------------
FUNCTION NAME: Init_D_plsf_3
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
Inputs:
st = pointer to a structure of type D_plsfState
index = Word16, past_rq_init[] index [0, 7]
Outputs:
st = pointer to a structure of type D_plsfState
Returns:
None
Global Variables Used:
None.
Local Variables Needed:
None.
------------------------------------------------------------------------------
FUNCTION DESCRIPTION
This function initializes the D_plsfState structure.
------------------------------------------------------------------------------
REQUIREMENTS
None.
------------------------------------------------------------------------------
REFERENCES
d_plsf_3.c, UMTS GSM AMR speech codec, R99 - Version 3.2.0, March 2, 2001
------------------------------------------------------------------------------
PSEUDO-CODE
------------------------------------------------------------------------------
RESOURCES USED [optional]
When the code is written for a specific target processor the
the resources used should be documented below.
HEAP MEMORY USED: x bytes
STACK MEMORY USED: x bytes
CLOCK CYCLES: (cycle count equation for this function) + (variable
used to represent cycle count for each subroutine
called)
where: (cycle count variable) = cycle count for [subroutine
name]
------------------------------------------------------------------------------
CAUTION [optional]
[State any special notes, constraints or cautions for users of this function]
------------------------------------------------------------------------------
*/
void Init_D_plsf_3(
D_plsfState *st, /* i/o: State struct */
Word16 index /* i : past_rq_init[] index [0, 7] */)
{
Copy(
&past_rq_init[index * M],
st->past_r_q,
M);
}
|
