-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathc3_14pf.c
748 lines (593 loc) · 23.5 KB
/
c3_14pf.c
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
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
/* ------------------------------------------------------------------
* 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.
****************************************************************************************/
/*
------------------------------------------------------------------------------
Filename: c3_14pf.cpp
------------------------------------------------------------------------------
MODULE DESCRIPTION
------------------------------------------------------------------------------
*/
/*----------------------------------------------------------------------------
; INCLUDES
----------------------------------------------------------------------------*/
#include "c3_14pf.h"
#include "typedef.h"
#include "inv_sqrt.h"
#include "cnst.h"
#include "cor_h.h"
#include "set_sign.h"
#include "basic_op.h"
/*----------------------------------------------------------------------------
; MACROS
; Define module specific macros here
----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------
; DEFINES
; Include all pre-processor statements here. Include conditional
; compile variables also.
----------------------------------------------------------------------------*/
#define NB_PULSE 3
/*----------------------------------------------------------------------------
; LOCAL FUNCTION DEFINITIONS
; Function Prototype declaration
----------------------------------------------------------------------------*/
static void search_3i40(
Word16 dn[], /* i : correlation between target and h[] */
Word16 dn2[], /* i : maximum of corr. in each track. */
Word16 rr[][L_CODE],/* i : matrix of autocorrelation */
Word16 codvec[], /* o : algebraic codebook vector */
Flag * pOverflow /* o : Flag set when overflow occurs */
);
static Word16 build_code(
Word16 codvec[], /* i : algebraic codebook vector */
Word16 dn_sign[], /* i : sign of dn[] */
Word16 cod[], /* o : algebraic (fixed) codebook excitation */
Word16 h[], /* i : impulse response of weighted synthesis filter */
Word16 y[], /* o : filtered fixed codebook excitation */
Word16 sign[], /* o : sign of 3 pulses */
Flag * pOverflow /* o : Flag set when overflow occurs */
);
/*----------------------------------------------------------------------------
; LOCAL VARIABLE DEFINITIONS
; Variable declaration - defined here and used outside this module
----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------
; EXTERNAL GLOBAL STORE/BUFFER/POINTER REFERENCES
; Declare variables used in this module but defined elsewhere
----------------------------------------------------------------------------*/
/*
------------------------------------------------------------------------------
FUNCTION NAME: code_3i40_14bits
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
Inputs:
x[] Array of type Word16 -- target vector
h[] Array of type Word16 -- impulse response of weighted synthesis filter
h[-L_subfr..-1] must be set to zero.
T0 Array of type Word16 -- Pitch lag
pitch_sharp, Array of type Word16 -- Last quantized pitch gain
Outputs:
code[] Array of type Word16 -- Innovative codebook
y[] Array of type Word16 -- filtered fixed codebook excitation
* sign Pointer of type Word16 -- Pointer to the signs of 3 pulses
pOverflow Pointer to Flag -- set when overflow occurs
Returns:
index
Global Variables Used:
None
Local Variables Needed:
None
------------------------------------------------------------------------------
FUNCTION DESCRIPTION
PURPOSE: Searches a 14 bit algebraic codebook containing 3 pulses
in a frame of 40 samples.
DESCRIPTION:
The code length is 40, containing 3 nonzero pulses: i0...i2.
All pulses can have two possible amplitudes: +1 or -1.
Pulse i0 can have 8 possible positions, pulses i1 and i2 can have
2x8=16 positions.
i0 : 0, 5, 10, 15, 20, 25, 30, 35.
i1 : 1, 6, 11, 16, 21, 26, 31, 36.
3, 8, 13, 18, 23, 28, 33, 38.
i2 : 2, 7, 12, 17, 22, 27, 32, 37.
4, 9, 14, 19, 24, 29, 34, 39.
------------------------------------------------------------------------------
REQUIREMENTS
None
------------------------------------------------------------------------------
REFERENCES
[1] c3_14pf.c, UMTS GSM AMR speech codec, R99 - Version 3.2.0, March 2, 2001
------------------------------------------------------------------------------
PSEUDO-CODE
------------------------------------------------------------------------------
CAUTION [optional]
[State any special notes, constraints or cautions for users of this function]
------------------------------------------------------------------------------
*/
Word16 code_3i40_14bits(
Word16 x[], /* i : target vector */
Word16 h[], /* i : impulse response of weighted synthesis filter */
/* h[-L_subfr..-1] must be set to zero. */
Word16 T0, /* i : Pitch lag */
Word16 pitch_sharp, /* i : Last quantized pitch gain */
Word16 code[], /* o : Innovative codebook */
Word16 y[], /* o : filtered fixed codebook excitation */
Word16 * sign, /* o : Signs of 3 pulses */
Flag * pOverflow /* o : Flag set when overflow occurs */
)
{
Word16 codvec[NB_PULSE];
Word16 dn[L_CODE];
Word16 dn2[L_CODE];
Word16 dn_sign[L_CODE];
Word16 rr[L_CODE][L_CODE];
Word16 i;
Word16 index;
Word16 sharp;
Word16 tempWord;
/* sharp = shl(pitch_sharp, 1, pOverflow); */
sharp = pitch_sharp << 1;
if (T0 < L_CODE)
{
for (i = T0; i < L_CODE; i++)
{
tempWord =
mult(
h[i - T0],
sharp,
pOverflow);
h[i] =
add_16(
h[i],
tempWord,
pOverflow);
}
}
cor_h_x(
h,
x,
dn,
1,
pOverflow);
set_sign(
dn,
dn_sign,
dn2,
6);
cor_h(
h,
dn_sign,
rr,
pOverflow);
search_3i40(
dn,
dn2,
rr,
codvec,
pOverflow);
/* function result */
index =
build_code(
codvec,
dn_sign,
code,
h,
y,
sign,
pOverflow);
/*-----------------------------------------------------------------*
* Compute innovation vector gain. *
* Include fixed-gain pitch contribution into code[]. *
*-----------------------------------------------------------------*/
if (T0 < L_CODE)
{
for (i = T0; i < L_CODE; i++)
{
tempWord =
mult(
code[i - T0],
sharp,
pOverflow);
code[i] =
add_16(
code[i],
tempWord,
pOverflow);
}
}
return index;
}
/****************************************************************************/
/*
------------------------------------------------------------------------------
FUNCTION NAME: search_3i40
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
Inputs:
dn[] Array of type Word16 -- correlation between target and h[]
dn2[] Array of type Word16 -- maximum of corr. in each track.
rr[][L_CODE] Double Array of type Word16 -- autocorrelation matrix
Outputs:
codvec[] Array of type Word16 -- algebraic codebook vector
pOverflow Pointer to Flag -- set when overflow occurs
Returns:
None
Global Variables Used:
None
Local Variables Needed:
None
------------------------------------------------------------------------------
FUNCTION DESCRIPTION
PURPOSE: Search the best codevector; determine positions of the 3 pulses
in the 40-sample frame.
------------------------------------------------------------------------------
REQUIREMENTS
None
------------------------------------------------------------------------------
REFERENCES
[1] c3_14pf.c, UMTS GSM AMR speech codec, R99 - Version 3.2.0, March 2, 2001
------------------------------------------------------------------------------
PSEUDO-CODE
------------------------------------------------------------------------------
CAUTION [optional]
[State any special notes, constraints or cautions for users of this function]
------------------------------------------------------------------------------
*/
static void search_3i40(
Word16 dn[], /* i : correlation between target and h[] */
Word16 dn2[], /* i : maximum of corr. in each track. */
Word16 rr[][L_CODE], /* i : matrix of autocorrelation */
Word16 codvec[], /* o : algebraic codebook vector */
Flag * pOverflow /* o : Flag set when overflow occurs */
)
{
Word16 i0;
Word16 i1;
Word16 i2;
Word16 ix = 0; /* initialization only needed to keep gcc silent */
Word16 ps = 0; /* initialization only needed to keep gcc silent */
Word16 i;
Word16 pos;
Word16 track1;
Word16 track2;
Word16 ipos[NB_PULSE];
Word16 psk;
Word16 ps0;
Word16 ps1;
Word16 sq;
Word16 sq1;
Word16 alpk;
Word16 alp;
Word16 alp_16;
Word16 *p_codvec = &codvec[0];
Word32 s;
Word32 alp0;
Word32 alp1;
psk = -1;
alpk = 1;
for (i = 0; i < NB_PULSE; i++)
{
*(p_codvec++) = i;
}
for (track1 = 1; track1 < 4; track1 += 2)
{
for (track2 = 2; track2 < 5; track2 += 2)
{
/* fix starting position */
ipos[0] = 0;
ipos[1] = track1;
ipos[2] = track2;
/*------------------------------------------------------------------*
* main loop: try 3 tracks. *
*------------------------------------------------------------------*/
for (i = 0; i < NB_PULSE; i++)
{
/*----------------------------------------------------------------*
* i0 loop: try 8 positions. *
*----------------------------------------------------------------*/
/* account for ptr. init. (rr[io]) */
for (i0 = ipos[0]; i0 < L_CODE; i0 += STEP)
{
if (dn2[i0] >= 0)
{
ps0 = dn[i0];
/* alp0 = L_mult(rr[i0][i0],_1_4, pOverflow); */
alp0 = (Word32) rr[i0][i0] << 14;
/*----------------------------------------------------------------*
* i1 loop: 8 positions. *
*----------------------------------------------------------------*/
sq = -1;
alp = 1;
ps = 0;
ix = ipos[1];
/* initialize 4 index for next loop. */
/*-------------------------------------------------------------------*
* These index have low complexity address computation because *
* they are, in fact, pointers with fixed increment. For example, *
* "rr[i0][i2]" is a pointer initialized to "&rr[i0][ipos[2]]" *
* and incremented by "STEP". *
*-------------------------------------------------------------------*/
for (i1 = ipos[1]; i1 < L_CODE; i1 += STEP)
{
/* idx increment = STEP */
/* ps1 = add(ps0, dn[i1], pOverflow); */
ps1 = ps0 + dn[i1];
/* alp1 = alp0 + rr[i0][i1] + 1/2*rr[i1][i1]; */
/* idx incr = STEP */
/* alp1 = L_mac(alp0, rr[i1][i1], _1_4, pOverflow); */
alp1 = alp0 + ((Word32) rr[i1][i1] << 14);
/* idx incr = STEP */
/* alp1 = L_mac(alp1, rr[i0][i1], _1_2, pOverflow); */
alp1 += (Word32) rr[i0][i1] << 15;
/* sq1 = mult(ps1, ps1, pOverflow); */
sq1 = (Word16)(((Word32) ps1 * ps1) >> 15);
/* alp_16 = pv_round(alp1, pOverflow); */
alp_16 = (Word16)((alp1 + (Word32) 0x00008000L) >> 16);
/* s = L_mult(alp, sq1, pOverflow); */
s = ((Word32) alp * sq1) << 1;
/* s = L_msu(s, sq, alp_16, pOverflow); */
s -= (((Word32) sq * alp_16) << 1);
if (s > 0)
{
sq = sq1;
ps = ps1;
alp = alp_16;
ix = i1;
}
}
i1 = ix;
/*----------------------------------------------------------------*
* i2 loop: 8 positions. *
*----------------------------------------------------------------*/
ps0 = ps;
/* alp0 = L_mult(alp, _1_4, pOverflow); */
alp0 = (Word32) alp << 14;
sq = -1;
alp = 1;
ps = 0;
ix = ipos[2];
/* initialize 4 index for next loop (see i1 loop) */
for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP)
{
/* index increment = STEP */
/* ps1 = add(ps0, dn[i2], pOverflow); */
ps1 = ps0 + dn[i2];
/* alp1 = alp0 + rr[i0][i2] + rr[i1][i2] + 1/2*rr[i2][i2]; */
/* idx incr = STEP */
/* alp1 = L_mac(alp0, rr[i2][i2], _1_16, pOverflow); */
alp1 = alp0 + ((Word32) rr[i2][i2] << 12);
/* idx incr = STEP */
/* alp1 = L_mac(alp1, rr[i1][i2], _1_8, pOverflow); */
alp1 += (Word32) rr[i1][i2] << 13;
/* idx incr = STEP */
/* alp1 = L_mac(alp1,rr[i0][i2], _1_8, pOverflow); */
alp1 += (Word32) rr[i0][i2] << 13;
/* sq1 = mult(ps1, ps1, pOverflow); */
sq1 = (Word16)(((Word32) ps1 * ps1) >> 15);
/* alp_16 = pv_round(alp1, pOverflow); */
alp_16 = (Word16)((alp1 + (Word32) 0x00008000L) >> 16);
/* s = L_mult(alp, sq1, pOverflow); */
s = ((Word32) alp * sq1) << 1;
/* s = L_msu(s, sq, alp_16, pOverflow); */
s -= (((Word32) sq * alp_16) << 1);
if (s > 0)
{
sq = sq1;
ps = ps1;
alp = alp_16;
ix = i2;
}
}
i2 = ix;
/* memorize codevector if this one
* is better than the last one.
*/
s = L_mult(alpk, sq, pOverflow);
//s = ((Word32) alpk * sq) << 1;
s = L_msu(s, psk, alp, pOverflow);
//s -= (((Word32) psk * alp) << 1);
if (s > 0)
{
psk = sq;
alpk = alp;
p_codvec = &codvec[0];
*(p_codvec++) = i0;
*(p_codvec++) = i1;
*(p_codvec) = i2;
}
}
}
/*----------------------------------------------------------------*
* Cyclic permutation of i0, i1 and i2. *
*----------------------------------------------------------------*/
pos = ipos[2];
ipos[2] = ipos[1];
ipos[1] = ipos[0];
ipos[0] = pos;
}
}
}
return;
}
/****************************************************************************/
/*
------------------------------------------------------------------------------
FUNCTION NAME: build_code()
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
Inputs:
codvec[] Array of type Word16 -- position of pulses
dn_sign[] Array of type Word16 -- sign of pulses
h[] Array of type Word16 -- impulse response of
weighted synthesis filter
Outputs:
cod[] Array of type Word16 -- innovative code vector
y[] Array of type Word16 -- filtered innovative code
sign[] Array of type Word16 -- sign of 3 pulses
pOverflow Pointer to Flag -- set when overflow occurs
Returns:
indx
Global Variables Used:
None
Local Variables Needed:
None
------------------------------------------------------------------------------
FUNCTION DESCRIPTION
PURPOSE: Builds the codeword, the filtered codeword and index of the
codevector, based on the signs and positions of 3 pulses.
------------------------------------------------------------------------------
REQUIREMENTS
None
------------------------------------------------------------------------------
REFERENCES
[1] c3_14pf.c, UMTS GSM AMR speech codec, R99 - Version 3.2.0, March 2, 2001
------------------------------------------------------------------------------
PSEUDO-CODE
------------------------------------------------------------------------------
CAUTION [optional]
[State any special notes, constraints or cautions for users of this function]
------------------------------------------------------------------------------
*/
static Word16
build_code(
Word16 codvec[], /* i : position of pulses */
Word16 dn_sign[], /* i : sign of pulses */
Word16 cod[], /* o : innovative code vector */
Word16 h[], /* i : impulse response of weighted synthesis filter */
Word16 y[], /* o : filtered innovative code */
Word16 sign[], /* o : sign of 3 pulses */
Flag *pOverflow /* o : Flag set when overflow occurs */
)
{
Word16 i;
Word16 j;
Word16 k;
Word16 track;
Word16 index;
Word16 _sign[NB_PULSE];
Word16 indx;
Word16 rsign;
Word16 *p0;
Word16 *p1;
Word16 *p2;
Word32 s;
for (i = 0; i < L_CODE; i++)
{
cod[i] = 0;
}
indx = 0;
rsign = 0;
for (k = 0; k < NB_PULSE; k++)
{
i = codvec[k]; /* read pulse position */
j = dn_sign[i]; /* read sign */
/* index = pos/5 */
/* index = mult(i, 6554, pOverflow); */
index = (Word16)(((Word32) i * 6554) >> 15);
/* track = pos%5 */
/* s = L_mult(index, 5, pOverflow); */
s = ((Word32) index * 5) << 1;
/* s = L_shr(s, 1, pOverflow); */
s >>= 1;
/* track = sub(i, (Word16) s, pOverflow); */
track = i - (Word16) s;
if (track == 1)
{
/* index = shl(index, 4, pOverflow); */
index <<= 4;
}
else if (track == 2)
{
track = 2;
/* index = shl(index, 8, pOverflow); */
index <<= 8;
}
else if (track == 3)
{
track = 1;
/* index = shl(index, 4, pOverflow); */
index <<= 4;
/* index = add(index, 8, pOverflow); */
index += 8;
}
else if (track == 4)
{
track = 2;
/* index = shl(index, 8, pOverflow); */
index <<= 8;
/* index = add(index, 128, pOverflow); */
index += 128;
}
if (j > 0)
{
cod[i] = 8191;
_sign[k] = 32767;
/* track = shl(1, track, pOverflow); */
track = 1 << track;
/* rsign = add(rsign, track, pOverflow); */
rsign += track;
}
else
{
cod[i] = -8192;
_sign[k] = (Word16) - 32768L;
}
/* indx = add(indx, index, pOverflow); */
indx += index;
}
*sign = rsign;
p0 = h - codvec[0];
p1 = h - codvec[1];
p2 = h - codvec[2];
for (i = 0; i < L_CODE; i++)
{
s = 0;
s =
L_mac(
s,
*p0++,
_sign[0],
pOverflow);
s =
L_mac(
s,
*p1++,
_sign[1],
pOverflow);
s =
L_mac(
s,
*p2++,
_sign[2],
pOverflow);
y[i] =
pv_round(
s,
pOverflow);
}
return indx;
}