Coverage Report

Created: 2025-12-14 06:24

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/proc/self/cwd/libfaad/tns.c
Line
Count
Source
1
/*
2
** FAAD2 - Freeware Advanced Audio (AAC) Decoder including SBR decoding
3
** Copyright (C) 2003-2005 M. Bakker, Nero AG, http://www.nero.com
4
**
5
** This program is free software; you can redistribute it and/or modify
6
** it under the terms of the GNU General Public License as published by
7
** the Free Software Foundation; either version 2 of the License, or
8
** (at your option) any later version.
9
**
10
** This program is distributed in the hope that it will be useful,
11
** but WITHOUT ANY WARRANTY; without even the implied warranty of
12
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13
** GNU General Public License for more details.
14
**
15
** You should have received a copy of the GNU General Public License
16
** along with this program; if not, write to the Free Software
17
** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18
**
19
** Any non-GPL usage of this software or parts of this software is strictly
20
** forbidden.
21
**
22
** The "appropriate copyright message" mentioned in section 2c of the GPLv2
23
** must read: "Code from FAAD2 is copyright (c) Nero AG, www.nero.com"
24
**
25
** Commercial non-GPL licensing of this software is possible.
26
** For more info contact Nero AG through Mpeg4AAClicense@nero.com.
27
**
28
** $Id: tns.c,v 1.40 2007/11/01 12:33:40 menno Exp $
29
**/
30
31
#include "common.h"
32
#include "structs.h"
33
34
#include "syntax.h"
35
#include "tns.h"
36
37
38
/* static function declarations */
39
/* returns exp */
40
static uint8_t tns_decode_coef(uint8_t order, uint8_t coef_res_bits,
41
                               uint8_t coef_compress, uint8_t *coef, real_t *a);
42
static void tns_ar_filter(real_t *spectrum, uint16_t size, int8_t inc, real_t *lpc,
43
                          uint8_t order, uint8_t exp);
44
static void tns_ma_filter(real_t *spectrum, uint16_t size, int8_t inc, real_t *lpc,
45
                          uint8_t order, uint8_t exp);
46
47
48
#ifdef _MSC_VER
49
#pragma warning(disable:4305)
50
#pragma warning(disable:4244)
51
#endif
52
static real_t tns_coef_0_3[] =
53
{
54
    COEF_CONST(0.0), COEF_CONST(0.4338837391), COEF_CONST(0.7818314825), COEF_CONST(0.9749279122),
55
    COEF_CONST(-0.9848077530), COEF_CONST(-0.8660254038), COEF_CONST(-0.6427876097), COEF_CONST(-0.3420201433),
56
    COEF_CONST(-0.4338837391), COEF_CONST(-0.7818314825), COEF_CONST(-0.9749279122), COEF_CONST(-0.9749279122),
57
    COEF_CONST(-0.9848077530), COEF_CONST(-0.8660254038), COEF_CONST(-0.6427876097), COEF_CONST(-0.3420201433)
58
};
59
static real_t tns_coef_0_4[] =
60
{
61
    COEF_CONST(0.0), COEF_CONST(0.2079116908), COEF_CONST(0.4067366431), COEF_CONST(0.5877852523),
62
    COEF_CONST(0.7431448255), COEF_CONST(0.8660254038), COEF_CONST(0.9510565163), COEF_CONST(0.9945218954),
63
    COEF_CONST(-0.9957341763), COEF_CONST(-0.9618256432), COEF_CONST(-0.8951632914), COEF_CONST(-0.7980172273),
64
    COEF_CONST(-0.6736956436), COEF_CONST(-0.5264321629), COEF_CONST(-0.3612416662), COEF_CONST(-0.1837495178)
65
};
66
static real_t tns_coef_1_3[] =
67
{
68
    COEF_CONST(0.0), COEF_CONST(0.4338837391), COEF_CONST(-0.6427876097), COEF_CONST(-0.3420201433),
69
    COEF_CONST(0.9749279122), COEF_CONST(0.7818314825), COEF_CONST(-0.6427876097), COEF_CONST(-0.3420201433),
70
    COEF_CONST(-0.4338837391), COEF_CONST(-0.7818314825), COEF_CONST(-0.6427876097), COEF_CONST(-0.3420201433),
71
    COEF_CONST(-0.7818314825), COEF_CONST(-0.4338837391), COEF_CONST(-0.6427876097), COEF_CONST(-0.3420201433)
72
};
73
static real_t tns_coef_1_4[] =
74
{
75
    COEF_CONST(0.0), COEF_CONST(0.2079116908), COEF_CONST(0.4067366431), COEF_CONST(0.5877852523),
76
    COEF_CONST(-0.6736956436), COEF_CONST(-0.5264321629), COEF_CONST(-0.3612416662), COEF_CONST(-0.1837495178),
77
    COEF_CONST(0.9945218954), COEF_CONST(0.9510565163), COEF_CONST(0.8660254038), COEF_CONST(0.7431448255),
78
    COEF_CONST(-0.6736956436), COEF_CONST(-0.5264321629), COEF_CONST(-0.3612416662), COEF_CONST(-0.1837495178)
79
};
80
81
static real_t* all_tns_coefs[] = {tns_coef_0_3, tns_coef_0_4, tns_coef_1_3, tns_coef_1_4};
82
83
/* TNS decoding for one channel and frame */
84
void tns_decode_frame(ic_stream *ics, tns_info *tns, uint8_t sr_index,
85
                      uint8_t object_type, real_t *spec, uint16_t frame_len)
86
677k
{
87
677k
    uint8_t w, f, tns_order;
88
677k
    int8_t inc;
89
677k
    int16_t size;
90
677k
    uint16_t bottom, top, start, end;
91
677k
    uint16_t nshort = frame_len/8;
92
677k
    real_t lpc[TNS_MAX_ORDER+1];
93
677k
    uint8_t exp;
94
95
677k
    if (!ics->tns_data_present)
96
635k
        return;
97
98
125k
    for (w = 0; w < ics->num_windows; w++)
99
83.8k
    {
100
83.8k
        bottom = ics->num_swb;
101
102
122k
        for (f = 0; f < tns->n_filt[w]; f++)
103
38.9k
        {
104
38.9k
            top = bottom;
105
38.9k
            bottom = max(top - tns->length[w][f], 0);
106
38.9k
            tns_order = min(tns->order[w][f], TNS_MAX_ORDER);
107
38.9k
            if (!tns_order)
108
15.9k
                continue;
109
110
23.0k
            exp = tns_decode_coef(tns_order, tns->coef_res[w]+3,
111
23.0k
                tns->coef_compress[w][f], tns->coef[w][f], lpc);
112
113
23.0k
            start = min(bottom, max_tns_sfb(sr_index, object_type, (ics->window_sequence == EIGHT_SHORT_SEQUENCE)));
114
23.0k
            start = min(start, ics->max_sfb);
115
23.0k
            start = min(ics->swb_offset[start], ics->swb_offset_max);
116
117
23.0k
            end = min(top, max_tns_sfb(sr_index, object_type, (ics->window_sequence == EIGHT_SHORT_SEQUENCE)));
118
23.0k
            end = min(end, ics->max_sfb);
119
23.0k
            end = min(ics->swb_offset[end], ics->swb_offset_max);
120
121
23.0k
            size = end - start;
122
23.0k
            if (size <= 0)
123
19.5k
                continue;
124
125
3.52k
            if (tns->direction[w][f])
126
2.04k
            {
127
2.04k
                inc = -1;
128
2.04k
                start = end - 1;
129
2.04k
            } else {
130
1.47k
                inc = 1;
131
1.47k
            }
132
133
3.52k
            tns_ar_filter(&spec[(w*nshort)+start], size, inc, lpc, tns_order, exp);
134
3.52k
        }
135
83.8k
    }
136
41.2k
}
137
138
/* TNS encoding for one channel and frame */
139
void tns_encode_frame(ic_stream *ics, tns_info *tns, uint8_t sr_index,
140
                      uint8_t object_type, real_t *spec, uint16_t frame_len)
141
14.0k
{
142
14.0k
    uint8_t w, f, tns_order;
143
14.0k
    int8_t inc;
144
14.0k
    int16_t size;
145
14.0k
    uint16_t bottom, top, start, end;
146
14.0k
    uint16_t nshort = frame_len/8;
147
14.0k
    real_t lpc[TNS_MAX_ORDER+1];
148
14.0k
    uint8_t exp;
149
150
14.0k
    if (!ics->tns_data_present)
151
11.9k
        return;
152
153
4.34k
    for (w = 0; w < ics->num_windows; w++)
154
2.17k
    {
155
2.17k
        bottom = ics->num_swb;
156
157
7.44k
        for (f = 0; f < tns->n_filt[w]; f++)
158
5.27k
        {
159
5.27k
            top = bottom;
160
5.27k
            bottom = max(top - tns->length[w][f], 0);
161
5.27k
            tns_order = min(tns->order[w][f], TNS_MAX_ORDER);
162
5.27k
            if (!tns_order)
163
1.13k
                continue;
164
165
4.13k
            exp = tns_decode_coef(tns_order, tns->coef_res[w]+3,
166
4.13k
                tns->coef_compress[w][f], tns->coef[w][f], lpc);
167
168
4.13k
            start = min(bottom, max_tns_sfb(sr_index, object_type, (ics->window_sequence == EIGHT_SHORT_SEQUENCE)));
169
4.13k
            start = min(start, ics->max_sfb);
170
4.13k
            start = min(ics->swb_offset[start], ics->swb_offset_max);
171
172
4.13k
            end = min(top, max_tns_sfb(sr_index, object_type, (ics->window_sequence == EIGHT_SHORT_SEQUENCE)));
173
4.13k
            end = min(end, ics->max_sfb);
174
4.13k
            end = min(ics->swb_offset[end], ics->swb_offset_max);
175
176
4.13k
            size = end - start;
177
4.13k
            if (size <= 0)
178
2.85k
                continue;
179
180
1.28k
            if (tns->direction[w][f])
181
461
            {
182
461
                inc = -1;
183
461
                start = end - 1;
184
824
            } else {
185
824
                inc = 1;
186
824
            }
187
188
1.28k
            tns_ma_filter(&spec[(w*nshort)+start], size, inc, lpc, tns_order, exp);
189
1.28k
        }
190
2.17k
    }
191
2.17k
}
192
193
/* Decoder transmitted coefficients for one TNS filter */
194
static uint8_t tns_decode_coef(uint8_t order, uint8_t coef_res_bits, uint8_t coef_compress,
195
                            uint8_t *coef, real_t *a)
196
27.1k
{
197
27.1k
    uint8_t i, m;
198
27.1k
    real_t tmp2[TNS_MAX_ORDER+1], b[TNS_MAX_ORDER+1];
199
27.1k
    uint8_t table_index = 2 * (coef_compress != 0) + (coef_res_bits != 3);
200
27.1k
    real_t* tns_coef = all_tns_coefs[table_index];
201
27.1k
    uint8_t exp = 0;
202
203
    /* Conversion to signed integer */
204
172k
    for (i = 0; i < order; i++)
205
145k
        tmp2[i] = tns_coef[coef[i]];
206
207
    /* Conversion to LPC coefficients */
208
27.1k
    a[0] = COEF_CONST(1.0);
209
172k
    for (m = 1; m <= order; m++)
210
145k
    {
211
145k
        a[m] = tmp2[m-1]; /* changed */
212
895k
        for (i = 1; i < m; i++) /* loop only while i<m */
213
749k
            b[i] = a[i] + MUL_C(a[m], a[m-i]);
214
215
895k
        for (i = 1; i < m; i++) /* loop only while i<m */
216
749k
            a[i] = b[i];
217
218
#ifdef FIXED_POINT
219
        a[m] >>= exp;
220
221
        /* OK not to check after the last iteration. */
222
87.2k
        if (m < order)
223
71.7k
        {
224
71.7k
            real_t sum_abs = COEF_CONST(0.0);
225
541k
            for (i = 1; i <= m; ++i)
226
470k
            {
227
470k
                sum_abs += (a[i] >= 0) ? a[i] : -a[i];
228
470k
            }
229
            /* Next iteration would turn sum to 2*sum + 1; maximal "coef" is 7.999 */
230
71.7k
            if (sum_abs >= COEF_CONST(3.5))
231
9.97k
            {
232
9.97k
                exp++;
233
114k
                for (i = 1; i <= m; ++i)
234
104k
                {
235
104k
                    a[i] >>= 1;
236
104k
                }
237
9.97k
            }
238
71.7k
        }
239
#endif
240
145k
    }
241
27.1k
    return exp;
242
27.1k
}
tns.c:tns_decode_coef
Line
Count
Source
196
15.4k
{
197
15.4k
    uint8_t i, m;
198
15.4k
    real_t tmp2[TNS_MAX_ORDER+1], b[TNS_MAX_ORDER+1];
199
15.4k
    uint8_t table_index = 2 * (coef_compress != 0) + (coef_res_bits != 3);
200
15.4k
    real_t* tns_coef = all_tns_coefs[table_index];
201
15.4k
    uint8_t exp = 0;
202
203
    /* Conversion to signed integer */
204
102k
    for (i = 0; i < order; i++)
205
87.2k
        tmp2[i] = tns_coef[coef[i]];
206
207
    /* Conversion to LPC coefficients */
208
15.4k
    a[0] = COEF_CONST(1.0);
209
102k
    for (m = 1; m <= order; m++)
210
87.2k
    {
211
87.2k
        a[m] = tmp2[m-1]; /* changed */
212
557k
        for (i = 1; i < m; i++) /* loop only while i<m */
213
470k
            b[i] = a[i] + MUL_C(a[m], a[m-i]);
214
215
557k
        for (i = 1; i < m; i++) /* loop only while i<m */
216
470k
            a[i] = b[i];
217
218
87.2k
#ifdef FIXED_POINT
219
87.2k
        a[m] >>= exp;
220
221
        /* OK not to check after the last iteration. */
222
87.2k
        if (m < order)
223
71.7k
        {
224
71.7k
            real_t sum_abs = COEF_CONST(0.0);
225
541k
            for (i = 1; i <= m; ++i)
226
470k
            {
227
470k
                sum_abs += (a[i] >= 0) ? a[i] : -a[i];
228
470k
            }
229
            /* Next iteration would turn sum to 2*sum + 1; maximal "coef" is 7.999 */
230
71.7k
            if (sum_abs >= COEF_CONST(3.5))
231
9.97k
            {
232
9.97k
                exp++;
233
114k
                for (i = 1; i <= m; ++i)
234
104k
                {
235
104k
                    a[i] >>= 1;
236
104k
                }
237
9.97k
            }
238
71.7k
        }
239
87.2k
#endif
240
87.2k
    }
241
15.4k
    return exp;
242
15.4k
}
tns.c:tns_decode_coef
Line
Count
Source
196
11.7k
{
197
11.7k
    uint8_t i, m;
198
11.7k
    real_t tmp2[TNS_MAX_ORDER+1], b[TNS_MAX_ORDER+1];
199
11.7k
    uint8_t table_index = 2 * (coef_compress != 0) + (coef_res_bits != 3);
200
11.7k
    real_t* tns_coef = all_tns_coefs[table_index];
201
11.7k
    uint8_t exp = 0;
202
203
    /* Conversion to signed integer */
204
70.1k
    for (i = 0; i < order; i++)
205
58.4k
        tmp2[i] = tns_coef[coef[i]];
206
207
    /* Conversion to LPC coefficients */
208
11.7k
    a[0] = COEF_CONST(1.0);
209
70.1k
    for (m = 1; m <= order; m++)
210
58.4k
    {
211
58.4k
        a[m] = tmp2[m-1]; /* changed */
212
337k
        for (i = 1; i < m; i++) /* loop only while i<m */
213
279k
            b[i] = a[i] + MUL_C(a[m], a[m-i]);
214
215
337k
        for (i = 1; i < m; i++) /* loop only while i<m */
216
279k
            a[i] = b[i];
217
218
#ifdef FIXED_POINT
219
        a[m] >>= exp;
220
221
        /* OK not to check after the last iteration. */
222
        if (m < order)
223
        {
224
            real_t sum_abs = COEF_CONST(0.0);
225
            for (i = 1; i <= m; ++i)
226
            {
227
                sum_abs += (a[i] >= 0) ? a[i] : -a[i];
228
            }
229
            /* Next iteration would turn sum to 2*sum + 1; maximal "coef" is 7.999 */
230
            if (sum_abs >= COEF_CONST(3.5))
231
            {
232
                exp++;
233
                for (i = 1; i <= m; ++i)
234
                {
235
                    a[i] >>= 1;
236
                }
237
            }
238
        }
239
#endif
240
58.4k
    }
241
11.7k
    return exp;
242
11.7k
}
243
244
static void tns_ar_filter(real_t *spectrum, uint16_t size, int8_t inc, real_t *lpc,
245
                          uint8_t order, uint8_t exp)
246
3.52k
{
247
    /*
248
     - Simple all-pole filter of order "order" defined by
249
       y(n) = x(n) - lpc[1]*y(n-1) - ... - lpc[order]*y(n-order)
250
     - The state variables of the filter are initialized to zero every time
251
     - The output data is written over the input data ("in-place operation")
252
     - An input vector of "size" samples is processed and the index increment
253
       to the next data sample is given by "inc"
254
    */
255
256
3.52k
    uint8_t j;
257
3.52k
    uint16_t i;
258
    /* state is stored as a double ringbuffer */
259
3.52k
    real_t state[2*TNS_MAX_ORDER] = {0};
260
3.52k
    int8_t state_index = 0;
261
3.52k
    int32_t mul = 1;
262
263
#ifdef FIXED_POINT
264
2.21k
    if (exp >= 4)
265
709
        return;
266
1.50k
    mul = 1 << exp;
267
#else
268
    (void)exp;
269
#endif
270
271
174k
    for (i = 0; i < size; i++)
272
171k
    {
273
171k
        real_t y = REAL_CONST(0.0);
274
1.64M
        for (j = 0; j < order; j++)
275
1.47M
            y += MUL_C(state[state_index+j], lpc[j+1]);
276
171k
        y = *spectrum - (y * mul);
277
278
        /* double ringbuffer state */
279
171k
        state_index--;
280
171k
        if (state_index < 0)
281
42.6k
            state_index = order-1;
282
171k
        state[state_index] = state[state_index + order] = y;
283
284
171k
        *spectrum = y;
285
171k
        spectrum += inc;
286
287
//#define TNS_PRINT
288
#ifdef TNS_PRINT
289
        //printf("%d\n", y);
290
        printf("0x%.8X\n", y);
291
#endif
292
171k
    }
293
1.50k
}
tns.c:tns_ar_filter
Line
Count
Source
246
2.21k
{
247
    /*
248
     - Simple all-pole filter of order "order" defined by
249
       y(n) = x(n) - lpc[1]*y(n-1) - ... - lpc[order]*y(n-order)
250
     - The state variables of the filter are initialized to zero every time
251
     - The output data is written over the input data ("in-place operation")
252
     - An input vector of "size" samples is processed and the index increment
253
       to the next data sample is given by "inc"
254
    */
255
256
2.21k
    uint8_t j;
257
2.21k
    uint16_t i;
258
    /* state is stored as a double ringbuffer */
259
2.21k
    real_t state[2*TNS_MAX_ORDER] = {0};
260
2.21k
    int8_t state_index = 0;
261
2.21k
    int32_t mul = 1;
262
263
2.21k
#ifdef FIXED_POINT
264
2.21k
    if (exp >= 4)
265
709
        return;
266
1.50k
    mul = 1 << exp;
267
#else
268
    (void)exp;
269
#endif
270
271
66.3k
    for (i = 0; i < size; i++)
272
64.8k
    {
273
64.8k
        real_t y = REAL_CONST(0.0);
274
630k
        for (j = 0; j < order; j++)
275
565k
            y += MUL_C(state[state_index+j], lpc[j+1]);
276
64.8k
        y = *spectrum - (y * mul);
277
278
        /* double ringbuffer state */
279
64.8k
        state_index--;
280
64.8k
        if (state_index < 0)
281
14.2k
            state_index = order-1;
282
64.8k
        state[state_index] = state[state_index + order] = y;
283
284
64.8k
        *spectrum = y;
285
64.8k
        spectrum += inc;
286
287
//#define TNS_PRINT
288
#ifdef TNS_PRINT
289
        //printf("%d\n", y);
290
        printf("0x%.8X\n", y);
291
#endif
292
64.8k
    }
293
1.50k
}
tns.c:tns_ar_filter
Line
Count
Source
246
1.30k
{
247
    /*
248
     - Simple all-pole filter of order "order" defined by
249
       y(n) = x(n) - lpc[1]*y(n-1) - ... - lpc[order]*y(n-order)
250
     - The state variables of the filter are initialized to zero every time
251
     - The output data is written over the input data ("in-place operation")
252
     - An input vector of "size" samples is processed and the index increment
253
       to the next data sample is given by "inc"
254
    */
255
256
1.30k
    uint8_t j;
257
1.30k
    uint16_t i;
258
    /* state is stored as a double ringbuffer */
259
1.30k
    real_t state[2*TNS_MAX_ORDER] = {0};
260
1.30k
    int8_t state_index = 0;
261
1.30k
    int32_t mul = 1;
262
263
#ifdef FIXED_POINT
264
    if (exp >= 4)
265
        return;
266
    mul = 1 << exp;
267
#else
268
1.30k
    (void)exp;
269
1.30k
#endif
270
271
108k
    for (i = 0; i < size; i++)
272
107k
    {
273
107k
        real_t y = REAL_CONST(0.0);
274
1.01M
        for (j = 0; j < order; j++)
275
905k
            y += MUL_C(state[state_index+j], lpc[j+1]);
276
107k
        y = *spectrum - (y * mul);
277
278
        /* double ringbuffer state */
279
107k
        state_index--;
280
107k
        if (state_index < 0)
281
28.4k
            state_index = order-1;
282
107k
        state[state_index] = state[state_index + order] = y;
283
284
107k
        *spectrum = y;
285
107k
        spectrum += inc;
286
287
//#define TNS_PRINT
288
#ifdef TNS_PRINT
289
        //printf("%d\n", y);
290
        printf("0x%.8X\n", y);
291
#endif
292
107k
    }
293
1.30k
}
294
295
static void tns_ma_filter(real_t *spectrum, uint16_t size, int8_t inc, real_t *lpc,
296
                          uint8_t order, uint8_t exp)
297
1.28k
{
298
    /*
299
     - Simple all-zero filter of order "order" defined by
300
       y(n) =  x(n) + a(2)*x(n-1) + ... + a(order+1)*x(n-order)
301
     - The state variables of the filter are initialized to zero every time
302
     - The output data is written over the input data ("in-place operation")
303
     - An input vector of "size" samples is processed and the index increment
304
       to the next data sample is given by "inc"
305
    */
306
307
1.28k
    uint8_t j;
308
1.28k
    uint16_t i;
309
    /* state is stored as a double ringbuffer */
310
1.28k
    real_t state[2*TNS_MAX_ORDER] = {0};
311
1.28k
    int8_t state_index = 0;
312
1.28k
    int32_t mul = 1;
313
314
#ifdef FIXED_POINT
315
739
    if (exp >= 4)
316
149
        return;
317
590
    mul = 1 << exp;
318
#else
319
    (void)exp;
320
#endif
321
322
24.6k
    for (i = 0; i < size; i++)
323
23.5k
    {
324
23.5k
        real_t y = REAL_CONST(0.0);
325
210k
        for (j = 0; j < order; j++)
326
186k
            y += MUL_C(state[state_index+j], lpc[j+1]);
327
328
23.5k
        y = *spectrum + (y * mul);
329
330
        /* double ringbuffer state */
331
23.5k
        state_index--;
332
23.5k
        if (state_index < 0)
333
9.15k
            state_index = order-1;
334
23.5k
        state[state_index] = state[state_index + order] = *spectrum;
335
336
23.5k
        *spectrum = y;
337
23.5k
        spectrum += inc;
338
23.5k
    }
339
590
}
tns.c:tns_ma_filter
Line
Count
Source
297
739
{
298
    /*
299
     - Simple all-zero filter of order "order" defined by
300
       y(n) =  x(n) + a(2)*x(n-1) + ... + a(order+1)*x(n-order)
301
     - The state variables of the filter are initialized to zero every time
302
     - The output data is written over the input data ("in-place operation")
303
     - An input vector of "size" samples is processed and the index increment
304
       to the next data sample is given by "inc"
305
    */
306
307
739
    uint8_t j;
308
739
    uint16_t i;
309
    /* state is stored as a double ringbuffer */
310
739
    real_t state[2*TNS_MAX_ORDER] = {0};
311
739
    int8_t state_index = 0;
312
739
    int32_t mul = 1;
313
314
739
#ifdef FIXED_POINT
315
739
    if (exp >= 4)
316
149
        return;
317
590
    mul = 1 << exp;
318
#else
319
    (void)exp;
320
#endif
321
322
7.03k
    for (i = 0; i < size; i++)
323
6.44k
    {
324
6.44k
        real_t y = REAL_CONST(0.0);
325
62.7k
        for (j = 0; j < order; j++)
326
56.3k
            y += MUL_C(state[state_index+j], lpc[j+1]);
327
328
6.44k
        y = *spectrum + (y * mul);
329
330
        /* double ringbuffer state */
331
6.44k
        state_index--;
332
6.44k
        if (state_index < 0)
333
2.82k
            state_index = order-1;
334
6.44k
        state[state_index] = state[state_index + order] = *spectrum;
335
336
6.44k
        *spectrum = y;
337
6.44k
        spectrum += inc;
338
6.44k
    }
339
590
}
tns.c:tns_ma_filter
Line
Count
Source
297
546
{
298
    /*
299
     - Simple all-zero filter of order "order" defined by
300
       y(n) =  x(n) + a(2)*x(n-1) + ... + a(order+1)*x(n-order)
301
     - The state variables of the filter are initialized to zero every time
302
     - The output data is written over the input data ("in-place operation")
303
     - An input vector of "size" samples is processed and the index increment
304
       to the next data sample is given by "inc"
305
    */
306
307
546
    uint8_t j;
308
546
    uint16_t i;
309
    /* state is stored as a double ringbuffer */
310
546
    real_t state[2*TNS_MAX_ORDER] = {0};
311
546
    int8_t state_index = 0;
312
546
    int32_t mul = 1;
313
314
#ifdef FIXED_POINT
315
    if (exp >= 4)
316
        return;
317
    mul = 1 << exp;
318
#else
319
546
    (void)exp;
320
546
#endif
321
322
17.6k
    for (i = 0; i < size; i++)
323
17.0k
    {
324
17.0k
        real_t y = REAL_CONST(0.0);
325
147k
        for (j = 0; j < order; j++)
326
130k
            y += MUL_C(state[state_index+j], lpc[j+1]);
327
328
17.0k
        y = *spectrum + (y * mul);
329
330
        /* double ringbuffer state */
331
17.0k
        state_index--;
332
17.0k
        if (state_index < 0)
333
6.33k
            state_index = order-1;
334
17.0k
        state[state_index] = state[state_index + order] = *spectrum;
335
336
17.0k
        *spectrum = y;
337
17.0k
        spectrum += inc;
338
17.0k
    }
339
546
}