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: sbr_fbt.c,v 1.21 2007/11/01 12:33:35 menno Exp $
29 **/
30
31 /* Calculate frequency band tables */
32
33 #include "common.h"
34 #include "structs.h"
35
36 #ifdef SBR_DEC
37
38 #include <stdlib.h>
39
40 #include "sbr_syntax.h"
41 #include "sbr_fbt.h"
42
43 /* static function declarations */
44 static int32_t find_bands(uint8_t warp, uint8_t bands, uint8_t a0, uint8_t a1);
45
46
47 /* calculate the start QMF channel for the master frequency band table */
48 /* parameter is also called k0 */
qmf_start_channel(uint8_t bs_start_freq,uint8_t bs_samplerate_mode,uint32_t sample_rate)49 uint8_t qmf_start_channel(uint8_t bs_start_freq, uint8_t bs_samplerate_mode,
50 uint32_t sample_rate)
51 {
52 static const uint8_t startMinTable[12] = { 7, 7, 10, 11, 12, 16, 16,
53 17, 24, 32, 35, 48 };
54 static const uint8_t offsetIndexTable[12] = { 5, 5, 4, 4, 4, 3, 2, 1, 0,
55 6, 6, 6 };
56 static const int8_t offset[7][16] = {
57 { -8, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7 },
58 { -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13 },
59 { -5, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16 },
60 { -6, -4, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16 },
61 { -4, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16, 20 },
62 { -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16, 20, 24 },
63 { 0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16, 20, 24, 28, 33 }
64 };
65 uint8_t startMin = startMinTable[get_sr_index(sample_rate)];
66 uint8_t offsetIndex = offsetIndexTable[get_sr_index(sample_rate)];
67
68 #if 0 /* replaced with table (startMinTable) */
69 if (sample_rate >= 64000)
70 {
71 startMin = (uint8_t)((5000.*128.)/(float)sample_rate + 0.5);
72 } else if (sample_rate < 32000) {
73 startMin = (uint8_t)((3000.*128.)/(float)sample_rate + 0.5);
74 } else {
75 startMin = (uint8_t)((4000.*128.)/(float)sample_rate + 0.5);
76 }
77 #endif
78
79 if (bs_samplerate_mode)
80 {
81 return startMin + offset[offsetIndex][bs_start_freq];
82
83 #if 0 /* replaced by offsetIndexTable */
84 switch (sample_rate)
85 {
86 case 16000:
87 return startMin + offset[0][bs_start_freq];
88 case 22050:
89 return startMin + offset[1][bs_start_freq];
90 case 24000:
91 return startMin + offset[2][bs_start_freq];
92 case 32000:
93 return startMin + offset[3][bs_start_freq];
94 default:
95 if (sample_rate > 64000)
96 {
97 return startMin + offset[5][bs_start_freq];
98 } else { /* 44100 <= sample_rate <= 64000 */
99 return startMin + offset[4][bs_start_freq];
100 }
101 }
102 #endif
103 } else {
104 return startMin + offset[6][bs_start_freq];
105 }
106 }
107
longcmp(const void * a,const void * b)108 static int longcmp(const void *a, const void *b)
109 {
110 return ((int)(*(int32_t*)a - *(int32_t*)b));
111 }
112
113 /* calculate the stop QMF channel for the master frequency band table */
114 /* parameter is also called k2 */
qmf_stop_channel(uint8_t bs_stop_freq,uint32_t sample_rate,uint8_t k0)115 uint8_t qmf_stop_channel(uint8_t bs_stop_freq, uint32_t sample_rate,
116 uint8_t k0)
117 {
118 if (bs_stop_freq == 15)
119 {
120 return min(64, k0 * 3);
121 } else if (bs_stop_freq == 14) {
122 return min(64, k0 * 2);
123 } else {
124 static const uint8_t stopMinTable[12] = { 13, 15, 20, 21, 23,
125 32, 32, 35, 48, 64, 70, 96 };
126 static const int8_t offset[12][14] = {
127 { 0, 2, 4, 6, 8, 11, 14, 18, 22, 26, 31, 37, 44, 51 },
128 { 0, 2, 4, 6, 8, 11, 14, 18, 22, 26, 31, 36, 42, 49 },
129 { 0, 2, 4, 6, 8, 11, 14, 17, 21, 25, 29, 34, 39, 44 },
130 { 0, 2, 4, 6, 8, 11, 14, 17, 20, 24, 28, 33, 38, 43 },
131 { 0, 2, 4, 6, 8, 11, 14, 17, 20, 24, 28, 32, 36, 41 },
132 { 0, 2, 4, 6, 8, 10, 12, 14, 17, 20, 23, 26, 29, 32 },
133 { 0, 2, 4, 6, 8, 10, 12, 14, 17, 20, 23, 26, 29, 32 },
134 { 0, 1, 3, 5, 7, 9, 11, 13, 15, 17, 20, 23, 26, 29 },
135 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16 },
136 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
137 { 0, -1, -2, -3, -4, -5, -6, -6, -6, -6, -6, -6, -6, -6 },
138 { 0, -3, -6, -9, -12, -15, -18, -20, -22, -24, -26, -28, -30, -32 }
139 };
140 #if 0
141 uint8_t i;
142 int32_t stopDk[13], stopDk_t[14], k2;
143 #endif
144 uint8_t stopMin = stopMinTable[get_sr_index(sample_rate)];
145
146 #if 0 /* replaced by table lookup */
147 if (sample_rate >= 64000)
148 {
149 stopMin = (uint8_t)((10000.*128.)/(float)sample_rate + 0.5);
150 } else if (sample_rate < 32000) {
151 stopMin = (uint8_t)((6000.*128.)/(float)sample_rate + 0.5);
152 } else {
153 stopMin = (uint8_t)((8000.*128.)/(float)sample_rate + 0.5);
154 }
155 #endif
156
157 #if 0 /* replaced by table lookup */
158 /* diverging power series */
159 for (i = 0; i <= 13; i++)
160 {
161 stopDk_t[i] = (int32_t)(stopMin*pow(64.0/stopMin, i/13.0) + 0.5);
162 }
163 for (i = 0; i < 13; i++)
164 {
165 stopDk[i] = stopDk_t[i+1] - stopDk_t[i];
166 }
167
168 /* needed? */
169 qsort(stopDk, 13, sizeof(stopDk[0]), longcmp);
170
171 k2 = stopMin;
172 for (i = 0; i < bs_stop_freq; i++)
173 {
174 k2 += stopDk[i];
175 }
176 return min(64, k2);
177 #endif
178 /* bs_stop_freq <= 13 */
179 return min(64, stopMin + offset[get_sr_index(sample_rate)][min(bs_stop_freq, 13)]);
180 }
181
182 return 0;
183 }
184
185 /* calculate the master frequency table from k0, k2, bs_freq_scale
186 and bs_alter_scale
187
188 version for bs_freq_scale = 0
189 */
master_frequency_table_fs0(sbr_info * sbr,uint8_t k0,uint8_t k2,uint8_t bs_alter_scale)190 uint8_t master_frequency_table_fs0(sbr_info *sbr, uint8_t k0, uint8_t k2,
191 uint8_t bs_alter_scale)
192 {
193 int8_t incr;
194 uint8_t k;
195 uint8_t dk;
196 uint32_t nrBands, k2Achieved;
197 int32_t k2Diff, vDk[64] = {0};
198
199 /* mft only defined for k2 > k0 */
200 if (k2 <= k0)
201 {
202 sbr->N_master = 0;
203 return 1;
204 }
205
206 dk = bs_alter_scale ? 2 : 1;
207
208 #if 0 /* replaced by float-less design */
209 nrBands = 2 * (int32_t)((float)(k2-k0)/(dk*2) + (-1+dk)/2.0f);
210 #else
211 if (bs_alter_scale)
212 {
213 nrBands = (((k2-k0+2)>>2)<<1);
214 } else {
215 nrBands = (((k2-k0)>>1)<<1);
216 }
217 #endif
218 nrBands = min(nrBands, 63);
219 if (nrBands <= 0)
220 return 1;
221
222 k2Achieved = k0 + nrBands * dk;
223 k2Diff = k2 - k2Achieved;
224 for (k = 0; k < nrBands; k++)
225 vDk[k] = dk;
226
227 if (k2Diff)
228 {
229 incr = (k2Diff > 0) ? -1 : 1;
230 k = (uint8_t) ((k2Diff > 0) ? (nrBands-1) : 0);
231
232 while (k2Diff != 0)
233 {
234 vDk[k] -= incr;
235 k += incr;
236 k2Diff += incr;
237 }
238 }
239
240 sbr->f_master[0] = k0;
241 for (k = 1; k <= nrBands; k++)
242 sbr->f_master[k] = (uint8_t)(sbr->f_master[k-1] + vDk[k-1]);
243
244 sbr->N_master = (uint8_t)nrBands;
245 sbr->N_master = (min(sbr->N_master, 64));
246
247 #if 0
248 printf("f_master[%d]: ", nrBands);
249 for (k = 0; k <= nrBands; k++)
250 {
251 printf("%d ", sbr->f_master[k]);
252 }
253 printf("\n");
254 #endif
255
256 return 0;
257 }
258
259 /*
260 This function finds the number of bands using this formula:
261 bands * log(a1/a0)/log(2.0) + 0.5
262 */
find_bands(uint8_t warp,uint8_t bands,uint8_t a0,uint8_t a1)263 static int32_t find_bands(uint8_t warp, uint8_t bands, uint8_t a0, uint8_t a1)
264 {
265 #ifdef FIXED_POINT
266 /* table with log2() values */
267 static const real_t log2Table[65] = {
268 COEF_CONST(0.0), COEF_CONST(0.0), COEF_CONST(1.0000000000), COEF_CONST(1.5849625007),
269 COEF_CONST(2.0000000000), COEF_CONST(2.3219280949), COEF_CONST(2.5849625007), COEF_CONST(2.8073549221),
270 COEF_CONST(3.0000000000), COEF_CONST(3.1699250014), COEF_CONST(3.3219280949), COEF_CONST(3.4594316186),
271 COEF_CONST(3.5849625007), COEF_CONST(3.7004397181), COEF_CONST(3.8073549221), COEF_CONST(3.9068905956),
272 COEF_CONST(4.0000000000), COEF_CONST(4.0874628413), COEF_CONST(4.1699250014), COEF_CONST(4.2479275134),
273 COEF_CONST(4.3219280949), COEF_CONST(4.3923174228), COEF_CONST(4.4594316186), COEF_CONST(4.5235619561),
274 COEF_CONST(4.5849625007), COEF_CONST(4.6438561898), COEF_CONST(4.7004397181), COEF_CONST(4.7548875022),
275 COEF_CONST(4.8073549221), COEF_CONST(4.8579809951), COEF_CONST(4.9068905956), COEF_CONST(4.9541963104),
276 COEF_CONST(5.0000000000), COEF_CONST(5.0443941194), COEF_CONST(5.0874628413), COEF_CONST(5.1292830169),
277 COEF_CONST(5.1699250014), COEF_CONST(5.2094533656), COEF_CONST(5.2479275134), COEF_CONST(5.2854022189),
278 COEF_CONST(5.3219280949), COEF_CONST(5.3575520046), COEF_CONST(5.3923174228), COEF_CONST(5.4262647547),
279 COEF_CONST(5.4594316186), COEF_CONST(5.4918530963), COEF_CONST(5.5235619561), COEF_CONST(5.5545888517),
280 COEF_CONST(5.5849625007), COEF_CONST(5.6147098441), COEF_CONST(5.6438561898), COEF_CONST(5.6724253420),
281 COEF_CONST(5.7004397181), COEF_CONST(5.7279204546), COEF_CONST(5.7548875022), COEF_CONST(5.7813597135),
282 COEF_CONST(5.8073549221), COEF_CONST(5.8328900142), COEF_CONST(5.8579809951), COEF_CONST(5.8826430494),
283 COEF_CONST(5.9068905956), COEF_CONST(5.9307373376), COEF_CONST(5.9541963104), COEF_CONST(5.9772799235),
284 COEF_CONST(6.0)
285 };
286 real_t r0 = log2Table[a0]; /* coef */
287 real_t r1 = log2Table[a1]; /* coef */
288 real_t r2 = (r1 - r0); /* coef */
289
290 if (warp)
291 r2 = MUL_C(r2, COEF_CONST(1.0/1.3));
292
293 /* convert r2 to real and then multiply and round */
294 r2 = (r2 >> (COEF_BITS-REAL_BITS)) * bands + (1<<(REAL_BITS-1));
295
296 return (r2 >> REAL_BITS);
297 #else
298 real_t div = (real_t)log(2.0);
299 if (warp) div *= (real_t)1.3;
300
301 return (int32_t)(bands * log((float)a1/(float)a0)/div + 0.5);
302 #endif
303 }
304
find_initial_power(uint8_t bands,uint8_t a0,uint8_t a1)305 static real_t find_initial_power(uint8_t bands, uint8_t a0, uint8_t a1)
306 {
307 #ifdef FIXED_POINT
308 /* table with log() values */
309 static const real_t logTable[65] = {
310 COEF_CONST(0.0), COEF_CONST(0.0), COEF_CONST(0.6931471806), COEF_CONST(1.0986122887),
311 COEF_CONST(1.3862943611), COEF_CONST(1.6094379124), COEF_CONST(1.7917594692), COEF_CONST(1.9459101491),
312 COEF_CONST(2.0794415417), COEF_CONST(2.1972245773), COEF_CONST(2.3025850930), COEF_CONST(2.3978952728),
313 COEF_CONST(2.4849066498), COEF_CONST(2.5649493575), COEF_CONST(2.6390573296), COEF_CONST(2.7080502011),
314 COEF_CONST(2.7725887222), COEF_CONST(2.8332133441), COEF_CONST(2.8903717579), COEF_CONST(2.9444389792),
315 COEF_CONST(2.9957322736), COEF_CONST(3.0445224377), COEF_CONST(3.0910424534), COEF_CONST(3.1354942159),
316 COEF_CONST(3.1780538303), COEF_CONST(3.2188758249), COEF_CONST(3.2580965380), COEF_CONST(3.2958368660),
317 COEF_CONST(3.3322045102), COEF_CONST(3.3672958300), COEF_CONST(3.4011973817), COEF_CONST(3.4339872045),
318 COEF_CONST(3.4657359028), COEF_CONST(3.4965075615), COEF_CONST(3.5263605246), COEF_CONST(3.5553480615),
319 COEF_CONST(3.5835189385), COEF_CONST(3.6109179126), COEF_CONST(3.6375861597), COEF_CONST(3.6635616461),
320 COEF_CONST(3.6888794541), COEF_CONST(3.7135720667), COEF_CONST(3.7376696183), COEF_CONST(3.7612001157),
321 COEF_CONST(3.7841896339), COEF_CONST(3.8066624898), COEF_CONST(3.8286413965), COEF_CONST(3.8501476017),
322 COEF_CONST(3.8712010109), COEF_CONST(3.8918202981), COEF_CONST(3.9120230054), COEF_CONST(3.9318256327),
323 COEF_CONST(3.9512437186), COEF_CONST(3.9702919136), COEF_CONST(3.9889840466), COEF_CONST(4.0073331852),
324 COEF_CONST(4.0253516907), COEF_CONST(4.0430512678), COEF_CONST(4.0604430105), COEF_CONST(4.0775374439),
325 COEF_CONST(4.0943445622), COEF_CONST(4.1108738642), COEF_CONST(4.1271343850), COEF_CONST(4.1431347264),
326 COEF_CONST(4.158883083)
327 };
328 /* standard Taylor polynomial coefficients for exp(x) around 0 */
329 /* a polynomial around x=1 is more precise, as most values are around 1.07,
330 but this is just fine already */
331 static const real_t c1 = COEF_CONST(1.0);
332 static const real_t c2 = COEF_CONST(1.0/2.0);
333 static const real_t c3 = COEF_CONST(1.0/6.0);
334 static const real_t c4 = COEF_CONST(1.0/24.0);
335
336 real_t r0 = logTable[a0]; /* coef */
337 real_t r1 = logTable[a1]; /* coef */
338 real_t r2 = (r1 - r0) / bands; /* coef */
339 real_t rexp = c1 + MUL_C((c1 + MUL_C((c2 + MUL_C((c3 + MUL_C(c4,r2)), r2)), r2)), r2);
340
341 return (rexp >> (COEF_BITS-REAL_BITS)); /* real */
342 #else
343 return (real_t)pow((real_t)a1/(real_t)a0, 1.0/(real_t)bands);
344 #endif
345 }
346
347 /*
348 version for bs_freq_scale > 0
349 */
master_frequency_table(sbr_info * sbr,uint8_t k0,uint8_t k2,uint8_t bs_freq_scale,uint8_t bs_alter_scale)350 uint8_t master_frequency_table(sbr_info *sbr, uint8_t k0, uint8_t k2,
351 uint8_t bs_freq_scale, uint8_t bs_alter_scale)
352 {
353 uint8_t k, bands, twoRegions;
354 uint8_t k1;
355 uint8_t nrBand0, nrBand1;
356 int32_t vDk0[64] = {0}, vDk1[64] = {0};
357 int32_t vk0[64] = {0}, vk1[64] = {0};
358 uint8_t temp1[] = { 6, 5, 4 };
359 real_t q, qk;
360 int32_t A_1;
361 #ifdef FIXED_POINT
362 real_t rk2, rk0;
363 #endif
364
365 /* mft only defined for k2 > k0 */
366 if (k2 <= k0)
367 {
368 sbr->N_master = 0;
369 return 1;
370 }
371
372 bands = temp1[bs_freq_scale-1];
373
374 #ifdef FIXED_POINT
375 rk0 = (real_t)k0 << REAL_BITS;
376 rk2 = (real_t)k2 << REAL_BITS;
377 if (rk2 > MUL_C(rk0, COEF_CONST(2.2449)))
378 #else
379 if ((float)k2/(float)k0 > 2.2449)
380 #endif
381 {
382 twoRegions = 1;
383 k1 = k0 << 1;
384 } else {
385 twoRegions = 0;
386 k1 = k2;
387 }
388
389 nrBand0 = (uint8_t)(2 * find_bands(0, bands, k0, k1));
390 nrBand0 = min(nrBand0, 63);
391 if (nrBand0 <= 0)
392 return 1;
393
394 q = find_initial_power(nrBand0, k0, k1);
395 #ifdef FIXED_POINT
396 qk = (real_t)k0 << REAL_BITS;
397 //A_1 = (int32_t)((qk + REAL_CONST(0.5)) >> REAL_BITS);
398 A_1 = k0;
399 #else
400 qk = REAL_CONST(k0);
401 A_1 = (int32_t)(qk + .5);
402 #endif
403 for (k = 0; k <= nrBand0; k++)
404 {
405 int32_t A_0 = A_1;
406 #ifdef FIXED_POINT
407 qk = MUL_R(qk,q);
408 A_1 = (int32_t)((qk + REAL_CONST(0.5)) >> REAL_BITS);
409 #else
410 qk *= q;
411 A_1 = (int32_t)(qk + 0.5);
412 #endif
413 vDk0[k] = A_1 - A_0;
414 }
415
416 /* needed? */
417 qsort(vDk0, nrBand0, sizeof(vDk0[0]), longcmp);
418
419 vk0[0] = k0;
420 for (k = 1; k <= nrBand0; k++)
421 {
422 vk0[k] = vk0[k-1] + vDk0[k-1];
423 if (vDk0[k-1] == 0)
424 return 1;
425 }
426
427 if (!twoRegions)
428 {
429 for (k = 0; k <= nrBand0; k++)
430 sbr->f_master[k] = (uint8_t) vk0[k];
431
432 sbr->N_master = nrBand0;
433 sbr->N_master = min(sbr->N_master, 64);
434 return 0;
435 }
436
437 nrBand1 = (uint8_t)(2 * find_bands(1 /* warped */, bands, k1, k2));
438 nrBand1 = min(nrBand1, 63);
439
440 q = find_initial_power(nrBand1, k1, k2);
441 #ifdef FIXED_POINT
442 qk = (real_t)k1 << REAL_BITS;
443 //A_1 = (int32_t)((qk + REAL_CONST(0.5)) >> REAL_BITS);
444 A_1 = k1;
445 #else
446 qk = REAL_CONST(k1);
447 A_1 = (int32_t)(qk + .5);
448 #endif
449 for (k = 0; k <= nrBand1 - 1; k++)
450 {
451 int32_t A_0 = A_1;
452 #ifdef FIXED_POINT
453 qk = MUL_R(qk,q);
454 A_1 = (int32_t)((qk + REAL_CONST(0.5)) >> REAL_BITS);
455 #else
456 qk *= q;
457 A_1 = (int32_t)(qk + 0.5);
458 #endif
459 vDk1[k] = A_1 - A_0;
460 }
461
462 if (vDk1[0] < vDk0[nrBand0 - 1])
463 {
464 int32_t change;
465
466 /* needed? */
467 qsort(vDk1, nrBand1 + 1, sizeof(vDk1[0]), longcmp);
468 change = vDk0[nrBand0 - 1] - vDk1[0];
469 vDk1[0] = vDk0[nrBand0 - 1];
470 vDk1[nrBand1 - 1] = vDk1[nrBand1 - 1] - change;
471 }
472
473 /* needed? */
474 qsort(vDk1, nrBand1, sizeof(vDk1[0]), longcmp);
475 vk1[0] = k1;
476 for (k = 1; k <= nrBand1; k++)
477 {
478 vk1[k] = vk1[k-1] + vDk1[k-1];
479 if (vDk1[k-1] == 0)
480 return 1;
481 }
482
483 sbr->N_master = nrBand0 + nrBand1;
484 sbr->N_master = min(sbr->N_master, 64);
485 for (k = 0; k <= nrBand0; k++)
486 {
487 sbr->f_master[k] = (uint8_t) vk0[k];
488 }
489 for (k = nrBand0 + 1; k <= sbr->N_master; k++)
490 {
491 sbr->f_master[k] = (uint8_t) vk1[k - nrBand0];
492 }
493
494 #if 0
495 printf("f_master[%d]: ", sbr->N_master);
496 for (k = 0; k <= sbr->N_master; k++)
497 {
498 printf("%d ", sbr->f_master[k]);
499 }
500 printf("\n");
501 #endif
502
503 return 0;
504 }
505
506 /* calculate the derived frequency border tables from f_master */
derived_frequency_table(sbr_info * sbr,uint8_t bs_xover_band,uint8_t k2)507 uint8_t derived_frequency_table(sbr_info *sbr, uint8_t bs_xover_band,
508 uint8_t k2)
509 {
510 uint8_t k, i;
511 uint32_t minus;
512
513 /* The following relation shall be satisfied: bs_xover_band < N_Master */
514 if (sbr->N_master <= bs_xover_band)
515 return 1;
516
517 sbr->N_high = sbr->N_master - bs_xover_band;
518 sbr->N_low = (sbr->N_high>>1) + (sbr->N_high - ((sbr->N_high>>1)<<1));
519
520 sbr->n[0] = sbr->N_low;
521 sbr->n[1] = sbr->N_high;
522
523 for (k = 0; k <= sbr->N_high; k++)
524 {
525 sbr->f_table_res[HI_RES][k] = sbr->f_master[k + bs_xover_band];
526 }
527
528 sbr->M = sbr->f_table_res[HI_RES][sbr->N_high] - sbr->f_table_res[HI_RES][0];
529 sbr->kx = sbr->f_table_res[HI_RES][0];
530 if (sbr->kx > 32)
531 return 1;
532 if (sbr->kx + sbr->M > 64)
533 return 1;
534
535 minus = (sbr->N_high & 1) ? 1 : 0;
536
537 for (k = 0; k <= sbr->N_low; k++)
538 {
539 if (k == 0)
540 i = 0;
541 else
542 i = (uint8_t)(2*k - minus);
543 sbr->f_table_res[LO_RES][k] = sbr->f_table_res[HI_RES][i];
544 }
545
546 #if 0
547 printf("bs_freq_scale: %d\n", sbr->bs_freq_scale);
548 printf("bs_limiter_bands: %d\n", sbr->bs_limiter_bands);
549 printf("f_table_res[HI_RES][%d]: ", sbr->N_high);
550 for (k = 0; k <= sbr->N_high; k++)
551 {
552 printf("%d ", sbr->f_table_res[HI_RES][k]);
553 }
554 printf("\n");
555 #endif
556 #if 0
557 printf("f_table_res[LO_RES][%d]: ", sbr->N_low);
558 for (k = 0; k <= sbr->N_low; k++)
559 {
560 printf("%d ", sbr->f_table_res[LO_RES][k]);
561 }
562 printf("\n");
563 #endif
564
565 sbr->N_Q = 0;
566 if (sbr->bs_noise_bands == 0)
567 {
568 sbr->N_Q = 1;
569 } else {
570 #if 0
571 sbr->N_Q = max(1, (int32_t)(sbr->bs_noise_bands*(log(k2/(float)sbr->kx)/log(2.0)) + 0.5));
572 #else
573 sbr->N_Q = (uint8_t)(max(1, find_bands(0, sbr->bs_noise_bands, sbr->kx, k2)));
574 #endif
575 sbr->N_Q = min(5, sbr->N_Q);
576 }
577
578 for (k = 0; k <= sbr->N_Q; k++)
579 {
580 if (k == 0)
581 {
582 i = 0;
583 } else {
584 /* i = i + (int32_t)((sbr->N_low - i)/(sbr->N_Q + 1 - k)); */
585 i = i + (sbr->N_low - i)/(sbr->N_Q + 1 - k);
586 }
587 sbr->f_table_noise[k] = sbr->f_table_res[LO_RES][i];
588 }
589
590 /* build table for mapping k to g in hf patching */
591 for (k = 0; k < 64; k++)
592 {
593 uint8_t g;
594 for (g = 0; g < sbr->N_Q; g++)
595 {
596 if ((sbr->f_table_noise[g] <= k) &&
597 (k < sbr->f_table_noise[g+1]))
598 {
599 sbr->table_map_k_to_g[k] = g;
600 break;
601 }
602 }
603 }
604
605 #if 0
606 printf("f_table_noise[%d]: ", sbr->N_Q);
607 for (k = 0; k <= sbr->N_Q; k++)
608 {
609 printf("%d ", sbr->f_table_noise[k] - sbr->kx);
610 }
611 printf("\n");
612 #endif
613
614 return 0;
615 }
616
617 /* TODO: blegh, ugly */
618 /* Modified to calculate for all possible bs_limiter_bands always
619 * This reduces the number calls to this functions needed (now only on
620 * header reset)
621 */
limiter_frequency_table(sbr_info * sbr)622 void limiter_frequency_table(sbr_info *sbr)
623 {
624 #if 0
625 static const real_t limiterBandsPerOctave[] = { REAL_CONST(1.2),
626 REAL_CONST(2), REAL_CONST(3) };
627 #else
628 static const real_t limiterBandsCompare[] = { REAL_CONST(1.327152),
629 REAL_CONST(1.185093), REAL_CONST(1.119872) };
630 #endif
631 uint8_t k, s;
632 int8_t nrLim;
633 #if 0
634 real_t limBands;
635 #endif
636
637 sbr->f_table_lim[0][0] = sbr->f_table_res[LO_RES][0] - sbr->kx;
638 sbr->f_table_lim[0][1] = sbr->f_table_res[LO_RES][sbr->N_low] - sbr->kx;
639 sbr->N_L[0] = 1;
640
641 #if 0
642 printf("f_table_lim[%d][%d]: ", 0, sbr->N_L[0]);
643 for (k = 0; k <= sbr->N_L[0]; k++)
644 {
645 printf("%d ", sbr->f_table_lim[0][k]);
646 }
647 printf("\n");
648 #endif
649
650 for (s = 1; s < 4; s++)
651 {
652 int32_t limTable[100 /*TODO*/] = {0};
653 uint8_t patchBorders[64/*??*/] = {0};
654
655 #if 0
656 limBands = limiterBandsPerOctave[s - 1];
657 #endif
658
659 patchBorders[0] = sbr->kx;
660 for (k = 1; k <= sbr->noPatches; k++)
661 {
662 patchBorders[k] = patchBorders[k-1] + sbr->patchNoSubbands[k-1];
663 }
664
665 for (k = 0; k <= sbr->N_low; k++)
666 {
667 limTable[k] = sbr->f_table_res[LO_RES][k];
668 }
669 for (k = 1; k < sbr->noPatches; k++)
670 {
671 limTable[k+sbr->N_low] = patchBorders[k];
672 }
673
674 /* needed */
675 qsort(limTable, sbr->noPatches + sbr->N_low, sizeof(limTable[0]), longcmp);
676 k = 1;
677 nrLim = sbr->noPatches + sbr->N_low - 1;
678
679 if (nrLim < 0) // TODO: BIG FAT PROBLEM
680 return;
681
682 restart:
683 if (k <= nrLim)
684 {
685 real_t nOctaves;
686
687 if (limTable[k-1] != 0)
688 #if 0
689 nOctaves = REAL_CONST(log((float)limTable[k]/(float)limTable[k-1])/log(2.0));
690 #else
691 #ifdef FIXED_POINT
692 nOctaves = DIV_R((limTable[k]<<REAL_BITS),REAL_CONST(limTable[k-1]));
693 #else
694 nOctaves = (real_t)limTable[k]/(real_t)limTable[k-1];
695 #endif
696 #endif
697 else
698 nOctaves = 0;
699
700 #if 0
701 if ((MUL_R(nOctaves,limBands)) < REAL_CONST(0.49))
702 #else
703 if (nOctaves < limiterBandsCompare[s - 1])
704 #endif
705 {
706 uint8_t i;
707 if (limTable[k] != limTable[k-1])
708 {
709 uint8_t found = 0, found2 = 0;
710 for (i = 0; i <= sbr->noPatches; i++)
711 {
712 if (limTable[k] == patchBorders[i])
713 found = 1;
714 }
715 if (found)
716 {
717 found2 = 0;
718 for (i = 0; i <= sbr->noPatches; i++)
719 {
720 if (limTable[k-1] == patchBorders[i])
721 found2 = 1;
722 }
723 if (found2)
724 {
725 k++;
726 goto restart;
727 } else {
728 /* remove (k-1)th element */
729 limTable[k-1] = sbr->f_table_res[LO_RES][sbr->N_low];
730 qsort(limTable, sbr->noPatches + sbr->N_low, sizeof(limTable[0]), longcmp);
731 nrLim--;
732 goto restart;
733 }
734 }
735 }
736 /* remove kth element */
737 limTable[k] = sbr->f_table_res[LO_RES][sbr->N_low];
738 qsort(limTable, nrLim, sizeof(limTable[0]), longcmp);
739 nrLim--;
740 goto restart;
741 } else {
742 k++;
743 goto restart;
744 }
745 }
746
747 sbr->N_L[s] = nrLim;
748 for (k = 0; k <= nrLim; k++)
749 {
750 sbr->f_table_lim[s][k] = limTable[k] - sbr->kx;
751 }
752
753 #if 0
754 printf("f_table_lim[%d][%d]: ", s, sbr->N_L[s]);
755 for (k = 0; k <= sbr->N_L[s]; k++)
756 {
757 printf("%d ", sbr->f_table_lim[s][k]);
758 }
759 printf("\n");
760 #endif
761 }
762 }
763
764 #endif
765