-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathencode_sv7.c
executable file
·734 lines (650 loc) · 24.2 KB
/
encode_sv7.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
/*
* Clear Vocal Detection functions
*
* (C) Frank Klemm 2002. All rights reserved.
*
* Principles:
*
* History:
* ca. 1998 created
* 2002
*
* Global functions:
* -
*
* TODO:
* -
*/
#include "mppenc.h"
/*
* SV1: DATE 13.12.1998
* SV2: DATE 12.06.1999
* SV3: DATE 19.10.1999
* SV4: DATE 20.10.1999
* SV5: DATE 18.06.2000
* SV6: DATE 10.08.2000
* SV7: DATE 23.08.2000
* SV7.F: DATE 20.07.2002
* SV7.F: DATE 18.01.2003
* SVF.F: DATE 27.01.2003
*/
/*
------
8 bit Versionsnummer
24 bit +PM
------
16 bit Size of Header (the following bytes = 26 )
16 bit Subbandwidth * 32
------
32 bit Musepack Frames
------
6 bit maximum used number of subbands
1 bit MS used ?
9 bit -
16 bit Samples Rest
------
8 bit Channel Count
24 bit -
------
8 bit Profile
8 bit Version number
16 bit -
------
16 bit Peak Title
16 bit Peak Album
------
16 bit Gain Title
16 bit Gain Album
------
*/
void
WriteHeader_SV7F ( const unsigned int MaxBand, // writes SV7.15-header
const unsigned int Profile,
const unsigned int MS_on,
const Uint32_t TotalFrames,
const unsigned int SamplesRest,
const unsigned int StreamVersion,
int SampleFreq )
{
// 0
WriteBits ( 0x4D502B , 24 ); // Magic Number "MP+"
WriteBits ( StreamVersion, 8 ); // StreamVersion
// 4
WriteBits ( 0 , 16 ); // placeholder for header length
WriteBits ( MPPENC_VERSION [3] & 1 ? 1 : Profile
, 8 ); // 1: Experimental profile, 5...15: below Telephone...above BrainDead
WriteBits ( (MPPENC_VERSION[0]&15)*100 + (MPPENC_VERSION[2]&15)*10 + (MPPENC_VERSION[3]&15)
, 8 ); // encoder version number
// 8
WriteBits ( TotalFrames , 32 ); // number of Musepack frames
// 12
WriteBits ( 0 , 16 ); // title peak
WriteBits ( 0 , 16 ); // title gain
// 16
WriteBits ( 0 , 16 ); // album peak
WriteBits ( 0 , 16 ); // album gain
// 20
WriteBits ( MaxBand , 6 ); // Bandwidth
WriteBits ( MS_on , 4 ); // MS Coding bits
WriteBits ( 0 , 6 ); // -
WriteBits ( SamplesRest , 16 ); // true gapless: valid samples in last frame
// 24
WriteBits ( 2 , 8 ); // 2 channels
WriteBits ( 0 , 24 ); // -
// 28
WriteBits ( SampleFreq , 16 ); // 32 * Subbband width
WriteBits ( 0 , 16 ); // -
}
int
UpdateHeader_SV7F ( FILE* fp,
Uint32_t Frames,
Uint ValidSamples )
{
Uint8_t buff [4];
long pos;
if ( ( pos = ftell (fp) ) < 0 )
return -1;
if ( fseek ( fp, 8L, SEEK_SET ) < 0 ) // Schreibe Frameanzahl in den Header
return -1;
buff [0] = (Uint8_t)(Frames >> 24);
buff [1] = (Uint8_t)(Frames >> 16);
buff [2] = (Uint8_t)(Frames >> 8);
buff [3] = (Uint8_t)(Frames >> 0);
fwrite ( buff, 1, 4, fp );
if ( fseek ( fp, 22L, SEEK_SET ) < 0 ) // Schreibe ValidSamples in den Header
return -1;
buff [0] = (Uint8_t)(ValidSamples >> 8);
buff [1] = (Uint8_t)(ValidSamples >> 0);
fwrite ( buff, 1, 2, fp );
if ( fseek ( fp, pos, SEEK_SET ) < 0 );
return -1;
return 0;
}
static int Cdecl
cmp_fn ( const void* p1, const void* p2 )
{
return *(const int*)p1 - *(const int*)p2;
}
static int
bestof ( const size_t no, const int* data, int* const best1 , int* const best2 )
{
int y [16][2];
size_t i;
for ( i = 0; i < no; i++ ) {
y [i][0] = data[i];
y [i][1] = i;
}
qsort ( y, no, sizeof(*y), cmp_fn );
*best1 = y [0][0];
*best2 = y [1][0];
return y [0][1];
}
static int
countbits ( int x )
{
if ( x < 0 )
x = ~x;
if ( x < 1 ) return 0;
if ( x < 2 ) return 1;
if ( x < 4 ) return 2;
if ( x < 8 ) return 3;
if ( x < 16 ) return 4;
if ( x < 32 ) return 5;
if ( x < 64 ) return 6;
if ( x < 128 ) return 7;
if ( x < 256 ) return 8;
if ( x < 512 ) return 9;
if ( x < 1024 ) return 10;
if ( x < 2048 ) return 11;
if ( x < 4096 ) return 12;
if ( x < 8192 ) return 13;
if ( x < 16384 ) return 14;
if ( x < 32768 ) return 15;
if ( x < 65536 ) return 16;
if ( x <131072 ) return 17;
fprintf ( stderr, "Subband sample too large: %d\n", x );
return -1;
}
static int
bastel ( const HuffEncCode_t* T,
int auxbits,
int S0,
int S1,
int S2 )
{
int bits0 = countbits (S0) - auxbits;
int bits1 = countbits (S1) - auxbits;
int bits2 = countbits (S2) - auxbits;
int idx;
int ret;
if ( bits0 >= 0 || bits1 >= 0 || bits2 >= 0 ) {
if ( bits0 < 0 ) bits0 = 0;
if ( bits1 < 0 ) bits1 = 0;
if ( bits2 < 0 ) bits2 = 0;
idx = (5-bits0) + 6*(5-bits1) + 36*(5-bits2);
ret = T [idx].bits + 3 * auxbits + (bits0 ? bits0-1 : 0) + (bits1 ? bits1-1 : 0) + (bits2 ? bits2-1 : 0);
}
else {
if ( bits1 > bits0 ) bits0 = bits1;
if ( bits2 > bits0 ) bits0 = bits2;
idx = 215 - bits0; // darf nicht größer als 225 werden
ret = T [idx].bits + 3 * auxbits + 3 * bits0;
}
return ret;
}
static void
kodiere ( const HuffEncTable_t* T,
int auxbits,
int S0,
int S1,
int S2,
int book )
{
static unsigned int msk[17] = {
0x0000, 0x0001, 0x0003, 0x0007,
0x000F, 0x001F, 0x003F, 0x007F,
0x00FF, 0x01FF, 0x03FF, 0x07FF,
0x0FFF, 0x1FFF, 0x3FFF, 0x7FFF,
0xFFFF
};
int bits0 = countbits (S0) - auxbits;
int bits1 = countbits (S1) - auxbits;
int bits2 = countbits (S2) - auxbits;
int idx;
int tmp;
if ( bits0 >= 0 || bits1 >= 0 || bits2 >= 0 ) {
if ( bits0 < 0 ) bits0 = 0;
if ( bits1 < 0 ) bits1 = 0;
if ( bits2 < 0 ) bits2 = 0;
idx = (5-bits0) + 6*(5-bits1) + 36*(5-bits2);
WriteHuffman3 ( T, idx );
tmp = (bits0 ? bits0-1 : 0) + auxbits;
WriteBits ( (S0 < 0 ? ~S0 : S0) & msk [tmp], tmp );
WriteBit ( S0 < 0 );
tmp = (bits1 ? bits1-1 : 0) + auxbits;
WriteBits ( (S1 < 0 ? ~S1 : S1) & msk [tmp], tmp );
WriteBit ( S1 < 0 );
tmp = (bits2 ? bits2-1 : 0) + auxbits;
WriteBits ( (S2 < 0 ? ~S2 : S2) & msk [tmp], tmp );
WriteBit ( S2 < 0 );
}
else {
if ( bits1 > bits0 ) bits0 = bits1;
if ( bits2 > bits0 ) bits0 = bits2;
idx = 215 - bits0; // darf nicht größer als 225 werden
WriteHuffman3 ( T, idx );
tmp = bits0 + auxbits;
WriteBits ( (S0 < 0 ? ~S0 : S0) & msk [tmp], tmp );
WriteBit ( S0 < 0 );
WriteBits ( (S1 < 0 ? ~S1 : S1) & msk [tmp], tmp );
WriteBit ( S1 < 0 );
WriteBits ( (S2 < 0 ? ~S2 : S2) & msk [tmp], tmp );
WriteBit ( S2 < 0 );
}
}
static void
WriteBitStream_Samples ( const int MaxBand,
const res_t Res [32],
const Uint q [32] [36] )
{
static const HuffEncTablePtr_t TT [12] [4] = {
{ NULL , NULL }, // 0
{ NULL , NULL }, // 1
{ NULL , NULL }, // 2
{ &Encodertable_Q11 , &Encodertable_Q12 , &Encodertable_Q13, &Encodertable_Q14 }, // 3
{ &Encodertable_Q21 , &Encodertable_Q22 , &Encodertable_Q23, &Encodertable_Q24 }, // 4
{ &Encodertable_Q31 , &Encodertable_Q32 , &Encodertable_Q33, &Encodertable_Q34 }, // 5
{ &Encodertable_Q41 , &Encodertable_Q42 }, // 6
{ &Encodertable_Q51 , &Encodertable_Q52 }, // 7
{ &Encodertable_Q71 , &Encodertable_Q72 }, // 8
{ &Encodertable_Q101 , &Encodertable_Q102 }, // 9
{ &Encodertable_Q151 , &Encodertable_Q152 }, // 10
{ &Encodertable_Q311 , &Encodertable_Q312 }, // 11
};
static const HuffEncTablePtr_t TU [8] = {
&Encodertable_BIG1 , &Encodertable_BIG2 , &Encodertable_BIG3 , &Encodertable_BIG4 ,
&Encodertable_BIGV1, &Encodertable_BIGV2, &Encodertable_BIGV3
};
static const Uint32_t msk [] = {
0x000, 0x001, 0x003, 0x007, 0x00F, 0x01F, 0x03F, 0x07F,
0x0FF, 0x1FF, 0x3FF, 0x7FF, 0xFFF
};
static const Uint mul [] = { 0, 0, 0, 3, 5, 7, 9, 11, 15 };
const HuffEncTable_t* T;
const HuffEncCode_t* T0;
const HuffEncCode_t* T1;
const HuffEncCode_t* T2;
const HuffEncCode_t* T3;
unsigned int idx;
unsigned int book;
int n;
int k;
int tmp;
int sum0;
int sum1;
int sum [16];
for ( n = 0; n <= MaxBand; n++ ) {
switch ( Res[n] ) {
case -8:
case -7:
case -6:
case -5:
case -4:
case -3:
case -2:
case -1:
case 0:
case 1:
break;
case 2:
break;
case 3: // -1...+1, 4 samples coupled
T0 = TT [3][0] -> table;
T1 = TT [3][1] -> table;
T2 = TT [3][2] -> table;
T3 = TT [3][3] -> table;
sum[0] = sum[1] = sum[2] = sum[3] = 0;
for ( k = 0; k < 36; k += 4 ) {
idx = q[n][k+0] + 3*q[n][k+1] + 9*q[n][k+2] + 27*q[n][k+3];
sum[0] += T0 [idx].bits;
sum[1] += T1 [idx].bits;
sum[2] += T2 [idx].bits;
sum[3] += T3 [idx].bits;
}
book = bestof ( 4, sum, &sum0, &sum1 );
WriteHuffman ( Q1, book );
T = TT [3] [book];
Advantage ( T, sum0, sum1, 1 );
for ( k = 0; k < 36; k += 4 ) {
idx = q[n][k+0] + 3*q[n][k+1] + 9*q[n][k+2] + 27*q[n][k+3];
WriteHuffman3 ( T, idx );
}
break;
case 4: // -2...+2, 3 samples coupled
T0 = TT [4][0] -> table;
T1 = TT [4][1] -> table;
T2 = TT [4][2] -> table;
T3 = TT [4][3] -> table;
sum[0] = sum[1] = sum[2] = sum[3] = 0;
for ( k = 0; k < 36; k += 3 ) {
idx = q[n][k+0] + 5*q[n][k+1] + 25*q[n][k+2];
sum[0] += T0 [idx].bits;
sum[1] += T1 [idx].bits;
sum[2] += T2 [idx].bits;
sum[3] += T3 [idx].bits;
}
book = bestof ( 4, sum, &sum0, &sum1 );
WriteHuffman ( Q2, book );
T = TT [4] [book];
Advantage ( T, sum0, sum1, 1 );
for ( k = 0; k < 36; k += 3 ) {
idx = q[n][k+0] + 5*q[n][k+1] + 25*q[n][k+2];
WriteHuffman3 ( T, idx );
}
break;
case 5: // -3...+3, 2 samples coupled
T0 = TT [Res[n]][0] -> table;
T1 = TT [Res[n]][1] -> table;
T2 = TT [Res[n]][2] -> table;
T3 = TT [Res[n]][3] -> table;
sum[0] = sum[1] = sum[2] = sum[3] = 0;
for ( k = 0; k < 36; k += 2 ) {
idx = q[n][k+0] + mul[Res[n]]*q[n][k+1];
sum[0] += T0 [idx].bits;
sum[1] += T1 [idx].bits;
sum[2] += T2 [idx].bits;
sum[3] += T3 [idx].bits;
}
book = bestof ( 4, sum, &sum0, &sum1 );
WriteHuffman ( Q3, book );
T = TT [Res[n]] [book];
Advantage ( T, sum0, sum1, 1 );
for ( k = 0; k < 36; k += 2 ) {
idx = q[n][k+0] + mul[Res[n]]*q[n][k+1];
WriteHuffman3 ( T, idx );
}
break;
case 6: // -4...+4, 2 samples coupled
case 7: // -5...+5, 2 samples coupled
case 8: // -7...+7, 2 samples coupled
T0 = TT [Res[n]][0] -> table;
T1 = TT [Res[n]][1] -> table;
sum0 = sum1 = 0;
for ( k = 0; k < 36; k += 2 ) {
idx = q[n][k+0] + mul[Res[n]]*q[n][k+1];
sum0 += T0 [idx].bits;
sum1 += T1 [idx].bits;
}
book = sum0 >= sum1;
WriteBits ( book, 1 );
T = TT [Res[n]] [book];
Advantage ( T, mini(sum0, sum1), maxi(sum0, sum1), 1 );
for ( k = 0; k < 36; k += 2 ) {
idx = q[n][k+0] + mul[Res[n]]*q[n][k+1];
WriteHuffman3 ( T, idx );
}
break;
case 9: // -10...+10
case 10: // -15...+15
case 11: // -31...+31
T0 = TT [Res[n]] [0] -> table_no_offs;
T1 = TT [Res[n]] [1] -> table_no_offs;
sum0 = sum1 = 0;
for ( k = 0; k < 36; k++ ) {
idx = q[n][k];
sum0 += T0 [idx].bits;
sum1 += T1 [idx].bits;
}
book = sum0 >= sum1;
WriteBits ( book, 1 );
T = TT [Res[n]] [book];
Advantage ( T, mini(sum0, sum1), maxi(sum0, sum1), 1 );
for ( k = 0; k < 36; k++ ) {
idx = q[n][k];
WriteHuffman3 ( T, idx );
}
break;
case 12: // -64... +63
case 13: // -128... +127
case 14: // -256... +255
case 15: // -512... +511
case 16: // -1024... +1023
case 17: // -2048... +2047
case 18: // -4096... +4095
case 19: // -8192... +8191
case 20: // -16384...+16383
case 21: // -32768...+32767
T0 = TU [0] -> table_no_offs;
T1 = TU [1] -> table_no_offs;
tmp = Res[n] - 11;
sum[0] = sum[1] = 36*tmp;
for ( k = 0; k < 36; k++ ) {
idx = q[n][k] >> tmp;
sum[0] += T0 [idx].bits;
sum[1] += T1 [idx].bits;
}
T0 = TU [2] -> table_no_offs;
T1 = TU [3] -> table_no_offs;
tmp = Res[n] - 9;
sum[2] = sum[3] = 36*tmp;
for ( k = 0; k < 36; k += 2 ) {
idx = (q[n][k] >> tmp)*16 + (q[n][k+1] >> tmp);
sum[2] += T0 [idx].bits;
sum[3] += T1 [idx].bits;
}
T0 = TU [4] -> table_no_offs;
T1 = TU [5] -> table_no_offs;
T2 = TU [6] -> table_no_offs;
tmp = Res[n] - 11;
sum[4] = sum[5] = sum[6] = 36;
for ( k = 0; k < 36; k += 3 ) {
sum[4] += bastel ( T0, tmp, q[n][k]-(32<<tmp), q[n][k+1]-(32<<tmp), q[n][k+2]-(32<<tmp) );
sum[5] += bastel ( T1, tmp, q[n][k]-(32<<tmp), q[n][k+1]-(32<<tmp), q[n][k+2]-(32<<tmp) );
sum[6] += bastel ( T2, tmp, q[n][k]-(32<<tmp), q[n][k+1]-(32<<tmp), q[n][k+2]-(32<<tmp) );
}
book = bestof ( 7, sum, &sum0, &sum1 );
WriteHuffman ( BIGT, book );
T = TU [book];
Advantage ( T, sum0, sum1, 1 );
if ( book < 2 ) {
tmp = Res[n] - 11;
for ( k = 0; k < 36; k++ ) {
idx = q[n][k];
WriteHuffman3 ( T, idx >> tmp );
WriteBits ( idx & msk[tmp], tmp );
}
}
else if ( book < 4 ) {
tmp = Res[n] - 9;
// printf ("%1u: ", book );
for ( k = 0; k < 36; k += 2 ) {
// printf ("%7d%7d", q[n][k]-(1<<(Res[n]-6)), q[n][k+1]-(1<<(Res[n]-6)) );
idx = (q[n][k] >> tmp)*16 + (q[n][k+1] >> tmp);
WriteHuffman3 ( T, idx );
WriteBits ( q[n][k+0] & msk[tmp], tmp );
WriteBits ( q[n][k+1] & msk[tmp], tmp );
}
// printf ("\n");
}
else {
tmp = Res[n] - 11;
for ( k = 0; k < 36; k += 3 ) {
kodiere ( T, tmp, q[n][k]-(32<<tmp), q[n][k+1]-(32<<tmp), q[n][k+2]-(32<<tmp), 10*Res[n]+1+book );
}
}
break;
}
}
return;
}
#define ENCODE_SCF1( new, last, rll ) \
d = new - last; \
if ( new == SCF_RES ) { \
WriteHuffman ( DSCF, 0 ); \
} \
else if ( -10 <= d && d <= 10 && rll < 32 ) { \
WriteHuffman ( DSCF, d ); \
last = new; \
} \
else { \
WriteHuffman ( DSCF, 11 ); \
WriteBits ( (unsigned int)new, 7 ); \
rll = 0; \
last = new; \
}
#define ENCODE_SCFn( new, last, rll ) \
d = new - last; \
if ( -10 <= d && d <= 10 ) { \
WriteHuffman ( DSCF, d ); \
last = new; \
} \
else { \
WriteHuffman ( DSCF, 11 ); \
WriteBits ( (unsigned int)new, 7 ); \
rll = 0; \
last = new; \
}
static void
WriteBitStream_SCF ( const int MaxBand,
const res_t Res [32],
Uint8_t dscf_rll [32],
scf_t scf_last [32],
const scf_t scf_index [32] [3] )
{
int n;
unsigned int scfi;
unsigned int rll;
int d;
scf_t last;
for ( n = 0; n <= MaxBand; n++ ) {
rll = dscf_rll[n];
if ( Res[n] ) {
// printf ("%2u: %3d %3d %3d\n", n, scf_index[n][0], scf_index[n][1], scf_index[n][2] );
scfi = 2 * (scf_index[n][0] == scf_index[n][1] || scf_index[n][1] == SCF_RES ) + (scf_index[n][1] == scf_index[n][2] || scf_index[n][2] == SCF_RES );
WriteHuffman ( SCFI, scfi );
last = scf_last [n];
switch ( scfi ) {
default:
ENCODE_SCF1 ( scf_index[n][0], last, rll );
ENCODE_SCFn ( scf_index[n][1], last, rll );
ENCODE_SCFn ( scf_index[n][2], last, rll );
break;
case 1:
ENCODE_SCF1 ( scf_index[n][0], last, rll );
ENCODE_SCFn ( scf_index[n][1], last, rll );
break;
case 2:
ENCODE_SCF1 ( scf_index[n][0], last, rll );
ENCODE_SCFn ( scf_index[n][2], last, rll );
break;
case 3:
ENCODE_SCF1 ( scf_index[n][0], last, rll );
break;
}
scf_last [n] = last;
}
dscf_rll[n] = rll + 1; // Erhöhe Zähler für nicht neu initialisierte SCF
}
}
/*
* Encoding of the subband resolutions
* - Resolution of subband 0 is encoded via HuffTable HDR0.
* - Resolution of subband 1 is encoded differentially, residual is encoded via HuffTable DHDR1.
* - Remaining subbands are encoded differentially, residual is encoded via HuffTable DHDR.
* - There's a special escape code 23 for all following subband resolutions are the same like the resolution of the last subband
*/
static void
WriteBitStream_Res ( const int MaxBand,
const res_t Res [32] )
{
int n;
int d;
int c = -1;
d = 0;
if ( MaxBand > 6 &&
Res[MaxBand] == Res[MaxBand-1] &&
Res[MaxBand] == Res[MaxBand-2] &&
Res[MaxBand] == Res[MaxBand-3] &&
Res[MaxBand] == Res[MaxBand-4] &&
Res[MaxBand] == Res[MaxBand-5] &&
Res[MaxBand] == Res[MaxBand-6] ) {
for ( n = MaxBand; n >= 1; n-- )
if ( Res[MaxBand] == Res[n-1] )
c = n;
else
break;
if ( Res[MaxBand] == 0 && c == 1 )
c = 0;
}
if ( c == 0 ) {
WriteHuffman ( HDR0, 23 ); // repeat
return;
}
WriteHuffman ( HDR0, Res[0] ); // subband 0
if ( MaxBand < 1 )
return;
if ( c == 1 ) {
WriteHuffman ( DHDR1 , 5 );
WriteBits ( 23+8, 5 );
return;
}
d = Res[1] - Res[0]; // subband 1
if ( -12 <= d && d <= 4 ) {
WriteHuffman ( DHDR1 , d );
}
else {
WriteHuffman ( DHDR1 , 5 );
WriteBits ( (unsigned int)Res[1]+8, 5 );
}
for ( n = 2; n <= MaxBand; n++ ) { // subband 2...MaxBand
if ( c == n ) {
WriteHuffman ( DHDR , 8 );
WriteBits ( 23+8, 5 );
return;
}
d = Res[n] - Res[n-1];
if ( -7 <= d && d <= 7 ) {
WriteHuffman ( DHDR , d );
}
else {
WriteHuffman ( DHDR , 8 );
WriteBits ( (unsigned int)Res[n]+8, 5 );
}
}
}
// formatting and writing SV7-bitstream for one frame
void
WriteBitstream_SV7F ( int MaxBand,
const res_t Res [] [32],
const pack_t MS [32],
const scf_t SCF_Index [] [32] [ 3],
const Uint S [] [32] [36] )
{
static scf_t SCF_Last [MAXCH] [32]; // Letzter kodierter SCF-Wert
static Uint8_t DSCF_RLL [MAXCH] [32]; // Dauer des differentiellen SCF-Coding zur Lauflängenbegrenzung
int n;
ENTER(110);
/************************************ Bands *********************************/
while ( MaxBand >= 0 && Res[0][MaxBand] == 0 && Res[1][MaxBand] == 0 )
MaxBand--;
WriteHuffman ( MAXSUB, MaxBand );
if ( MaxBand < 0 )
return;
/************************************ Resolution *********************************/
WriteBitStream_Res ( MaxBand, Res[0] );
WriteBitStream_Res ( MaxBand, Res[1] );
/************************************ MS Channelbits ******************************/
if ( MS_Channelmode > 0 )
for ( n = 0; n <= MaxBand; n++ )
if ( Res[0][n] != 0 || Res[1][n] != 0 )
WriteBits ( MS[n], 1 );
/************************************ SCF ************************************/
WriteBitStream_SCF ( MaxBand, Res[0], DSCF_RLL[0], SCF_Last[0], SCF_Index[0] );
WriteBitStream_SCF ( MaxBand, Res[1], DSCF_RLL[1], SCF_Last[1], SCF_Index[1] );
/*********************************** Samples *********************************/
WriteBitStream_Samples ( MaxBand, Res[0], S[0] );
WriteBitStream_Samples ( MaxBand, Res[1], S[1] );
LEAVE(110);
return;
}
/* end of encode_sv7.c */