-
Notifications
You must be signed in to change notification settings - Fork 1
/
cor_h.c
350 lines (274 loc) · 9.73 KB
/
cor_h.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
/* ------------------------------------------------------------------
* 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: cor_h.cpp
------------------------------------------------------------------------------
*/
/*----------------------------------------------------------------------------
; INCLUDES
----------------------------------------------------------------------------*/
#include "cnst.h"
#include "cor_h.h"
#include "basicop_malloc.h"
#include "inv_sqrt.h"
#include "basic_op.h"
/*----------------------------------------------------------------------------
; MACROS
; Define module specific macros here
----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------
; DEFINES
; Include all pre-processor statements here. Include conditional
; compile variables also.
----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------
; LOCAL FUNCTION DEFINITIONS
; Function Prototype declaration
----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------
; LOCAL STORE/BUFFER/POINTER DEFINITIONS
; Variable declaration - defined here and used outside this module
----------------------------------------------------------------------------*/
/*
------------------------------------------------------------------------------
FUNCTION NAME: cor_h
------------------------------------------------------------------------------
INPUT AND OUTPUT DEFINITIONS
Inputs:
h = vector containing the impulse response of the weighted synthesis
filter; vector contents are of type Word16; vector length is
2 * L_SUBFR
sign = vector containing the sign information for the correlation
values; vector contents are of type Word16; vector length is
L_CODE
rr = autocorrelation matrix; matrix contents are of type Word16;
matrix dimension is L_CODE by L_CODE
Outputs:
rr contents are the newly calculated autocorrelation values
Returns:
None
Global Variables Used:
None
Local Variables Needed:
None
------------------------------------------------------------------------------
FUNCTION DESCRIPTION
This function computes correlations of the impulse response (h) needed for
the codebook search, and includes the sign information into the correlations.
The correlations are given by:
rr[i][j] = sum_{n=i}^{L-1} h[n-i] h[n-j]; i>=j; i,j=0,...,L-1
The sign information is included by:
rr[i][j] = rr[i][j]*sign[i]*sign[j]
------------------------------------------------------------------------------
REQUIREMENTS
None
------------------------------------------------------------------------------
REFERENCES
cor_h.c, UMTS GSM AMR speech codec, R99 - Version 3.2.0, March 2, 2001
------------------------------------------------------------------------------
PSEUDO-CODE
void cor_h (
Word16 h[], // (i) : impulse response of weighted synthesis
filter
Word16 sign[], // (i) : sign of d[n]
Word16 rr[][L_CODE] // (o) : matrix of autocorrelation
)
{
Word16 i, j, k, dec, h2[L_CODE];
Word32 s;
// Scaling for maximum precision
s = 2;
for (i = 0; i < L_CODE; i++)
s = L_mac (s, h[i], h[i]);
j = sub (extract_h (s), 32767);
if (j == 0)
{
for (i = 0; i < L_CODE; i++)
{
h2[i] = shr (h[i], 1);
}
}
else
{
s = L_shr (s, 1);
k = extract_h (L_shl (Inv_sqrt (s), 7));
k = mult (k, 32440); // k = 0.99*k
for (i = 0; i < L_CODE; i++)
{
h2[i] = pv_round (L_shl (L_mult (h[i], k), 9));
}
}
// build matrix rr[]
s = 0;
i = L_CODE - 1;
for (k = 0; k < L_CODE; k++, i--)
{
s = L_mac (s, h2[k], h2[k]);
rr[i][i] = pv_round (s);
}
for (dec = 1; dec < L_CODE; dec++)
{
s = 0;
j = L_CODE - 1;
i = sub (j, dec);
for (k = 0; k < (L_CODE - dec); k++, i--, j--)
{
s = L_mac (s, h2[k], h2[k + dec]);
rr[j][i] = mult (pv_round (s), mult (sign[i], sign[j]));
rr[i][j] = rr[j][i];
}
}
}
---------------------------------------------------------------------------
CAUTION [optional]
[State any special notes, constraints or cautions for users of this function]
------------------------------------------------------------------------------
*/
void cor_h(
Word16 h[], /* (i) : impulse response of weighted synthesis
filter */
Word16 sign[], /* (i) : sign of d[n] */
Word16 rr[][L_CODE], /* (o) : matrix of autocorrelation */
Flag *pOverflow
)
{
register Word16 i;
register Word16 dec;
Word16 h2[L_CODE];
Word32 s;
Word32 s2;
Word16 tmp1;
Word16 tmp2;
Word16 tmp11;
Word16 tmp22;
Word16 *p_h;
Word16 *p_h2;
Word16 *rr1;
Word16 *rr2;
Word16 *rr3;
Word16 *p_rr_ref1;
Word16 *p_sign1;
Word16 *p_sign2;
/* Scaling for maximum precision */
/* Initialize accumulator to 1 since left shift happens */
/* after the accumulation of the sum of squares (original */
/* code initialized s to 2) */
s = 1;
p_h = h;
for (i = (L_CODE >> 1); i != 0 ; i--)
{
tmp1 = *(p_h++);
s = amrnb_fxp_mac_16_by_16bb((Word32) tmp1, (Word32) tmp1, s);
tmp1 = *(p_h++);
s = amrnb_fxp_mac_16_by_16bb((Word32) tmp1, (Word32) tmp1, s);
}
s <<= 1;
if (s & MIN_32)
{
p_h2 = h2;
p_h = h;
for (i = (L_CODE >> 1); i != 0; i--)
{
*(p_h2++) = *(p_h++) >> 1;
*(p_h2++) = *(p_h++) >> 1;
}
}
else
{
s >>= 1;
s = Inv_sqrt(s, pOverflow);
if (s < (Word32) 0x00ffffffL)
{
/* k = 0.99*k */
dec = (Word16)(((s >> 9) * 32440) >> 15);
}
else
{
dec = 32440; /* 0.99 */
}
p_h = h;
p_h2 = h2;
for (i = (L_CODE >> 1); i != 0; i--)
{
*(p_h2++) = (Word16)((amrnb_fxp_mac_16_by_16bb((Word32) * (p_h++), (Word32) dec, 0x020L)) >> 6);
*(p_h2++) = (Word16)((amrnb_fxp_mac_16_by_16bb((Word32) * (p_h++), (Word32) dec, 0x020L)) >> 6);
}
}
/* build matrix rr[] */
s = 0;
p_h2 = h2;
rr1 = &rr[L_CODE-1][L_CODE-1];
for (i = L_CODE >> 1; i != 0 ; i--)
{
tmp1 = *(p_h2++);
s = amrnb_fxp_mac_16_by_16bb((Word32) tmp1, (Word32) tmp1, s);
*rr1 = (Word16)((s + 0x00004000L) >> 15);
rr1 -= (L_CODE + 1);
tmp1 = *(p_h2++);
s = amrnb_fxp_mac_16_by_16bb((Word32) tmp1, (Word32) tmp1, s);
*rr1 = (Word16)((s + 0x00004000L) >> 15);
rr1 -= (L_CODE + 1);
}
p_rr_ref1 = rr[L_CODE-1];
for (dec = 1; dec < L_CODE; dec += 2)
{
rr1 = &p_rr_ref1[L_CODE-1-dec];
rr2 = &rr[L_CODE-1-dec][L_CODE-1];
rr3 = &rr[L_CODE-1-(dec+1)][L_CODE-1];
s = 0;
s2 = 0;
p_sign1 = &sign[L_CODE - 1];
p_sign2 = &sign[L_CODE - 1 - dec];
p_h2 = h2;
p_h = &h2[dec];
for (i = (L_CODE - dec - 1); i != 0 ; i--)
{
s = amrnb_fxp_mac_16_by_16bb((Word32) * (p_h2), (Word32) * (p_h++), s);
s2 = amrnb_fxp_mac_16_by_16bb((Word32) * (p_h2++), (Word32) * (p_h), s2);
tmp1 = (Word16)((s + 0x00004000L) >> 15);
tmp11 = (Word16)((s2 + 0x00004000L) >> 15);
tmp2 = ((Word32) * (p_sign1) * *(p_sign2--)) >> 15;
tmp22 = ((Word32) * (p_sign1--) * *(p_sign2)) >> 15;
*rr2 = ((Word32) tmp1 * tmp2) >> 15;
*(rr1--) = *rr2;
*rr1 = ((Word32) tmp11 * tmp22) >> 15;
*rr3 = *rr1;
rr1 -= (L_CODE);
rr2 -= (L_CODE + 1);
rr3 -= (L_CODE + 1);
}
s = amrnb_fxp_mac_16_by_16bb((Word32) * (p_h2), (Word32) * (p_h), s);
tmp1 = (Word16)((s + 0x00004000L) >> 15);
tmp2 = ((Word32) * (p_sign1) * *(p_sign2)) >> 15;
*rr1 = ((Word32) tmp1 * tmp2) >> 15;
*rr2 = *rr1;
rr1 -= (L_CODE + 1);
rr2 -= (L_CODE + 1);
}
return;
}