1 /*
2 * MPEG-4 ALS decoder
3 * Copyright (c) 2009 Thilo Borgmann <thilo.borgmann _at_ googlemail.com>
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 /**
23 * @file
24 * MPEG-4 ALS decoder
25 * @author Thilo Borgmann <thilo.borgmann _at_ googlemail.com>
26 */
27
38
39 #include <stdint.h>
40
41 /** Rice parameters and corresponding index offsets for decoding the
42 * indices of scaled PARCOR values. The table chosen is set globally
43 * by the encoder and stored in ALSSpecificConfig.
44 */
46 { {-52, 4}, {-29, 5}, {-31, 4}, { 19, 4}, {-16, 4},
47 { 12, 3}, { -7, 3}, { 9, 3}, { -5, 3}, { 6, 3},
48 { -4, 3}, { 3, 3}, { -3, 2}, { 3, 2}, { -2, 2},
49 { 3, 2}, { -1, 2}, { 2, 2}, { -1, 2}, { 2, 2} },
50 { {-58, 3}, {-42, 4}, {-46, 4}, { 37, 5}, {-36, 4},
51 { 29, 4}, {-29, 4}, { 25, 4}, {-23, 4}, { 20, 4},
52 {-17, 4}, { 16, 4}, {-12, 4}, { 12, 3}, {-10, 4},
53 { 7, 3}, { -4, 4}, { 3, 3}, { -1, 3}, { 1, 3} },
54 { {-59, 3}, {-45, 5}, {-50, 4}, { 38, 4}, {-39, 4},
55 { 32, 4}, {-30, 4}, { 25, 3}, {-23, 3}, { 20, 3},
56 {-20, 3}, { 16, 3}, {-13, 3}, { 10, 3}, { -7, 3},
57 { 3, 3}, { 0, 3}, { -1, 3}, { 2, 3}, { -1, 2} }
58 };
59
60
61 /** Scaled PARCOR values used for the first two PARCOR coefficients.
62 * To be indexed by the Rice coded indices.
63 * Generated by: parcor_scaled_values[i] = 32 + ((i * (i+1)) << 7) - (1 << 20)
64 * Actual values are divided by 32 in order to be stored in 16 bits.
65 */
67 -1048544 / 32, -1048288 / 32, -1047776 / 32, -1047008 / 32,
68 -1045984 / 32, -1044704 / 32, -1043168 / 32, -1041376 / 32,
69 -1039328 / 32, -1037024 / 32, -1034464 / 32, -1031648 / 32,
70 -1028576 / 32, -1025248 / 32, -1021664 / 32, -1017824 / 32,
71 -1013728 / 32, -1009376 / 32, -1004768 / 32, -999904 / 32,
72 -994784 / 32, -989408 / 32, -983776 / 32, -977888 / 32,
73 -971744 / 32, -965344 / 32, -958688 / 32, -951776 / 32,
74 -944608 / 32, -937184 / 32, -929504 / 32, -921568 / 32,
75 -913376 / 32, -904928 / 32, -896224 / 32, -887264 / 32,
76 -878048 / 32, -868576 / 32, -858848 / 32, -848864 / 32,
77 -838624 / 32, -828128 / 32, -817376 / 32, -806368 / 32,
78 -795104 / 32, -783584 / 32, -771808 / 32, -759776 / 32,
79 -747488 / 32, -734944 / 32, -722144 / 32, -709088 / 32,
80 -695776 / 32, -682208 / 32, -668384 / 32, -654304 / 32,
81 -639968 / 32, -625376 / 32, -610528 / 32, -595424 / 32,
82 -580064 / 32, -564448 / 32, -548576 / 32, -532448 / 32,
83 -516064 / 32, -499424 / 32, -482528 / 32, -465376 / 32,
84 -447968 / 32, -430304 / 32, -412384 / 32, -394208 / 32,
85 -375776 / 32, -357088 / 32, -338144 / 32, -318944 / 32,
86 -299488 / 32, -279776 / 32, -259808 / 32, -239584 / 32,
87 -219104 / 32, -198368 / 32, -177376 / 32, -156128 / 32,
88 -134624 / 32, -112864 / 32, -90848 / 32, -68576 / 32,
89 -46048 / 32, -23264 / 32, -224 / 32, 23072 / 32,
90 46624 / 32, 70432 / 32, 94496 / 32, 118816 / 32,
91 143392 / 32, 168224 / 32, 193312 / 32, 218656 / 32,
92 244256 / 32, 270112 / 32, 296224 / 32, 322592 / 32,
93 349216 / 32, 376096 / 32, 403232 / 32, 430624 / 32,
94 458272 / 32, 486176 / 32, 514336 / 32, 542752 / 32,
95 571424 / 32, 600352 / 32, 629536 / 32, 658976 / 32,
96 688672 / 32, 718624 / 32, 748832 / 32, 779296 / 32,
97 810016 / 32, 840992 / 32, 872224 / 32, 903712 / 32,
98 935456 / 32, 967456 / 32, 999712 / 32, 1032224 / 32
99 };
100
101
102 /** Gain values of p(0) for long-term prediction.
103 * To be indexed by the Rice coded indices.
104 */
106 { 0, 8, 16, 24},
107 {32, 40, 48, 56},
108 {64, 70, 76, 82},
109 {88, 92, 96, 100}
110 };
111
112
113 /** Inter-channel weighting factors for multi-channel correlation.
114 * To be indexed by the Rice coded indices.
115 */
117 204, 192, 179, 166, 153, 140, 128, 115,
118 102, 89, 76, 64, 51, 38, 25, 12,
119 0, -12, -25, -38, -51, -64, -76, -89,
120 -102, -115, -128, -140, -153, -166, -179, -192
121 };
122
123
124 /** Tail codes used in arithmetic coding using block Gilbert-Moore codes.
125 */
127 { 74, 44, 25, 13, 7, 3},
128 { 68, 42, 24, 13, 7, 3},
129 { 58, 39, 23, 13, 7, 3},
130 {126, 70, 37, 19, 10, 5},
131 {132, 70, 37, 20, 10, 5},
132 {124, 70, 38, 20, 10, 5},
133 {120, 69, 37, 20, 11, 5},
134 {116, 67, 37, 20, 11, 5},
135 {108, 66, 36, 20, 10, 5},
136 {102, 62, 36, 20, 10, 5},
137 { 88, 58, 34, 19, 10, 5},
138 {162, 89, 49, 25, 13, 7},
139 {156, 87, 49, 26, 14, 7},
140 {150, 86, 47, 26, 14, 7},
141 {142, 84, 47, 26, 14, 7},
142 {131, 79, 46, 26, 14, 7}
143 };
144
145
150 };
151
152
154 uint32_t
samples;
///< number of samples, 0xFFFFFFFF if unknown
155 int resolution;
///< 000 = 8-bit; 001 = 16-bit; 010 = 24-bit; 011 = 32-bit
156 int floating;
///< 1 = IEEE 32-bit floating-point, 0 = integer
157 int msb_first;
///< 1 = original CRC calculated on big-endian system, 0 = little-endian
158 int frame_length;
///< frame length for each frame (last frame may differ)
159 int ra_distance;
///< distance between RA frames (in frames, 0...255)
166 int bgmc;
///< "Block Gilbert-Moore Code": 1 = on, 0 = off (Rice coding only)
169 int mc_coding;
///< extended inter-channel coding (multi channel coding): 1 = on, 0 = off
170 int chan_config;
///< indicates that a chan_config_info field is present
171 int chan_sort;
///< channel rearrangement: 1 = on, 0 = off
172 int rlslms;
///< use "Recursive Least Square-Least Mean Square" predictor: 1 = on, 0 = off
173 int chan_config_info;
///< mapping of channels to loudspeaker locations. Unused until setting channel configuration is implemented.
177
178
187
188
195 uint32_t
crc_org;
///< CRC value of the original input data
196 uint32_t
crc;
///< CRC value calculated from decoded data
198 unsigned int frame_id;
///< the frame ID / number of the current frame
199 unsigned int js_switch;
///< if true, joint-stereo decoding is enforced
200 unsigned int cs_switch;
///< if true, channel rearrangement is done
201 unsigned int num_blocks;
///< number of blocks used in the current frame
202 unsigned int s_max;
///< maximum Rice parameter allowed in entropy coding
206 int *
const_block;
///< contains const_block flags for all channels
207 unsigned int *
shift_lsbs;
///< contains shift_lsbs flags for all channels
208 unsigned int *
opt_order;
///< contains opt_order flags for all channels
210 int *
use_ltp;
///< contains use_ltp flags for all channels
211 int *
ltp_lag;
///< contains ltp lag values for all channels
212 int **
ltp_gain;
///< gain values for ltp 5-tap filter for a channel
216 int32_t **
lpc_cof;
///< coefficients of the direct form prediction filter for a channel
227
228
231 unsigned int ra_block;
///< if true, this is a random access block
233 int js_blocks;
///< true if this block contains a difference signal
234 unsigned int *
shift_lsbs;
///< shift of values for this block
235 unsigned int *
opt_order;
///< prediction order of this block
237 int *
use_ltp;
///< if true, long-term prediction is used
238 int *
ltp_lag;
///< lag value for long-term prediction
239 int *
ltp_gain;
///< gain values for ltp 5-tap filter
246
247
249 {
250 #ifdef DEBUG
253
272 #endif
273 }
274
275
276 /** Read an ALSSpecificConfig from a buffer into the output struct.
277 */
279 {
281 uint64_t ht_size;
282 int i, config_offset;
286 uint32_t als_id, header_size, trailer_size;
288
291
294
295 if (config_offset < 0)
296 return -1;
297
299
301 return -1;
302
303 // read the fixed items
309 skip_bits(&gb, 16);
// number of channels already known
330 skip_bits(&gb, 5);
// skip 5 reserved bits
332
333
334 // check for ALSSpecificConfig struct
335 if (als_id !=
MKBETAG(
'A',
'L',
'S',
'0円'))
336 return -1;
337
339
340 // read channel config
343 // TODO: use this to set avctx->channel_layout
344
345
346 // read channel sorting
348 int chan_pos_bits = av_ceil_log2(avctx->
channels);
349 int bits_needed = avctx->
channels * chan_pos_bits + 7;
351 return -1;
352
355
357
358 for (i = 0; i < avctx->
channels; i++) {
359 int idx;
360
365 break;
366 }
368 }
369
371 }
372
373
374 // read fixed header and trailer sizes,
375 // if size = 0xFFFFFFFF then there is no data field!
377 return -1;
378
381 if (header_size == 0xFFFFFFFF)
382 header_size = 0;
383 if (trailer_size == 0xFFFFFFFF)
384 trailer_size = 0;
385
386 ht_size = ((int64_t)(header_size) + (int64_t)(trailer_size)) << 3;
387
388
389 // skip the header and trailer data
391 return -1;
392
393 if (ht_size > INT32_MAX)
394 return -1;
395
397
398
399 // initialize CRC calculation
402 return -1;
403
406 ctx->
crc = 0xFFFFFFFF;
408 } else
410 }
411
412
413 // no need to read the rest of ALSSpecificConfig (ra_unit_size & aux data)
414
416
417 return 0;
418 }
419
420
421 /** Check the ALSSpecificConfig for unsupported features.
422 */
424 {
426 int error = 0;
427
428 // report unsupported feature and set error value
429 #define MISSING_ERR(cond, str, errval) \
430 { \
431 if (cond) { \
432 avpriv_report_missing_feature(ctx->avctx, \
433 str); \
434 error = errval; \
435 } \
436 }
437
440
441 return error;
442 }
443
444
445 /** Parse the bs_info field to extract the block partitioning used in
446 * block switching mode, refer to ISO/IEC 14496-3, section 11.6.2.
447 */
449 unsigned int div, unsigned int **div_blocks,
450 unsigned int *num_blocks)
451 {
452 if (n < 31 && ((bs_info << n) & 0x40000000)) {
453 // if the level is valid and the investigated bit n is set
454 // then recursively check both children at bits (2n+1) and (2n+2)
455 n *= 2;
456 div += 1;
459 } else {
460 // else the bit is not set or the last level has been reached
461 // (bit implicitly not set)
462 **div_blocks = div;
463 (*div_blocks)++;
464 (*num_blocks)++;
465 }
466 }
467
468
469 /** Read and decode a Rice codeword.
470 */
472 {
476
477 if (k > 1) {
478 q <<= (k - 1);
480 } else if (!k) {
481 q >>= 1;
482 }
483 return r ? q : ~q;
484 }
485
486
487 /** Convert PARCOR coefficient k to direct filter coefficient.
488 */
490 {
491 int i, j;
492
493 for (i = 0, j = k - 1; i < j; i++, j--) {
494 int tmp1 = ((
MUL64(par[k], cof[j]) + (1 << 19)) >> 20);
495 cof[j] += ((
MUL64(par[k], cof[i]) + (1 << 19)) >> 20);
496 cof[i] += tmp1;
497 }
498 if (i == j)
499 cof[i] += ((
MUL64(par[k], cof[j]) + (1 << 19)) >> 20);
500
501 cof[k] = par[k];
502 }
503
504
505 /** Read block switching field if necessary and set actual block sizes.
506 * Also assure that the block sizes of the last frame correspond to the
507 * actual number of samples.
508 */
510 uint32_t *bs_info)
511 {
514 unsigned int *ptr_div_blocks = div_blocks;
516
520 *bs_info <<= (32 - bs_info_len);
521 }
522
525
526 // The last frame may have an overdetermined block structure given in
527 // the bitstream. In that case the defined block structure would need
528 // more samples than available to be consistent.
529 // The block structure is actually used but the block sizes are adapted
530 // to fit the actual number of available samples.
531 // Example: 5 samples, 2nd level block sizes: 2 2 2 2.
532 // This results in the actual block sizes: 2 2 1 0.
533 // This is not specified in 14496-3 but actually done by the reference
534 // codec RM22 revision 2.
535 // This appears to happen in case of an odd number of samples in the last
536 // frame which is actually not allowed by the block length switching part
537 // of 14496-3.
538 // The ALS conformance files feature an odd number of samples in the last
539 // frame.
540
543
546
548 if (remaining <= div_blocks[b]) {
549 div_blocks[
b] = remaining;
551 break;
552 }
553
554 remaining -= div_blocks[
b];
555 }
556 }
557 }
558
559
560 /** Read the block data for a constant block
561 */
563 {
567
570
574
575 // skip 5 reserved bits
577
581 }
582
583 // ensure constant block decoding by reusing this field
585
586 return 0;
587 }
588
589
590 /** Decode the block data for a constant block
591 */
593 {
597
598 // write raw samples into buffer
599 for (; smp; smp--)
600 *dst++ = val;
601 }
602
603
604 /** Read the block data for a non-constant block
605 */
607 {
611 unsigned int k;
613 unsigned int sx[8];
614 unsigned int sub_blocks, log2_sub_blocks, sb_length;
615 unsigned int start = 0;
616 unsigned int opt_order;
617 int sb;
620
621
622 // ensure variable block decoding by reusing this field
624
627
629
630 // determine the number of subblocks for entropy decoding
632 log2_sub_blocks = 0;
633 } else {
636 else
638 }
639
640 sub_blocks = 1 << log2_sub_blocks;
641
642 // do not continue in case of a damaged stream since
643 // block_length must be evenly divisible by sub_blocks
646 "Block length is not evenly divisible by the number of subblocks.\n");
647 return -1;
648 }
649
651
654 for (k = 1; k < sub_blocks; k++)
656
657 for (k = 0; k < sub_blocks; k++) {
658 sx[k] = s[k] & 0x0F;
659 s [k] >>= 4;
660 }
661 } else {
663 for (k = 1; k < sub_blocks; k++)
665 }
666 for (k = 1; k < sub_blocks; k++)
667 if (s[k] > 32) {
670 }
671
674
676
677
680 int opt_order_length = av_ceil_log2(av_clip((bd->
block_length >> 3) - 1,
687 }
688 } else {
690 }
691
693
694 if (opt_order) {
695 int add_base;
696
698 add_base = 0x7F;
699
700 // read coefficient 0
702
703 // read coefficient 1
704 if (opt_order > 1)
706
707 // read coefficients 2 to opt_order
708 for (k = 2; k < opt_order; k++)
710 } else {
711 int k_max;
712 add_base = 1;
713
714 // read coefficient 0 to 19
715 k_max =
FFMIN(opt_order, 20);
716 for (k = 0; k < k_max; k++) {
720 if (quant_cof[k] < -64 || quant_cof[k] > 63) {
723 }
724 }
725
726 // read coefficients 20 to 126
727 k_max =
FFMIN(opt_order, 127);
728 for (; k < k_max; k++)
730
731 // read coefficients 127 to opt_order
732 for (; k < opt_order; k++)
734
736
737 if (opt_order > 1)
739 }
740
741 for (k = 2; k < opt_order; k++)
742 quant_cof[k] = (quant_cof[k] << 14) + (add_base << 13);
743 }
744 }
745
746 // read LTP gain and lag values
749
752
755
759
762
765 }
766 }
767
768 // read first value and residuals in case of a random access block
770 if (opt_order)
772 if (opt_order > 1)
774 if (opt_order > 2)
776
777 start =
FFMIN(opt_order, 3);
778 }
779
780 // read all residuals
783 unsigned int k [8];
784 unsigned int b = av_clip((av_ceil_log2(bd->
block_length) - 3) >> 1, 0, 5);
785
786 // read most significant bits
787 unsigned int high;
788 unsigned int low;
790
792
794
795 for (sb = 0; sb < sub_blocks; sb++) {
796 unsigned int sb_len = sb_length - (sb ? 0 :
start);
797
798 k [sb] = s[sb] > b ? s[sb] - b : 0;
799 delta[sb] = 5 - s[sb] + k[sb];
800
803
804 current_res += sb_len;
805 }
806
808
809
810 // read least significant bits and tails
812
813 for (sb = 0; sb < sub_blocks; sb++, start = 0) {
814 unsigned int cur_tail_code =
tail_code[sx[sb]][delta[sb]];
815 unsigned int cur_k = k[sb];
816 unsigned int cur_s = s[sb];
817
818 for (; start < sb_length; start++) {
820
821 if (res == cur_tail_code) {
822 unsigned int max_msb = (2 + (sx[sb] > 2) + (sx[sb] > 10))
823 << (5 - delta[sb]);
824
826
827 if (res >= 0) {
828 res += (max_msb ) << cur_k;
829 } else {
830 res -= (max_msb - 1) << cur_k;
831 }
832 } else {
833 if (res > cur_tail_code)
834 res--;
835
836 if (res & 1)
838
839 res >>= 1;
840
841 if (cur_k) {
842 res <<= cur_k;
844 }
845 }
846
847 *current_res++ =
res;
848 }
849 }
850 } else {
852
853 for (sb = 0; sb < sub_blocks; sb++, start = 0)
854 for (; start < sb_length; start++)
856 }
857
860
861 return 0;
862 }
863
864
865 /** Decode the block data for a non-constant block
866 */
868 {
871 unsigned int smp = 0;
872 unsigned int k;
874 int sb;
881
882 // reverse long-term prediction
884 int ltp_smp;
885
886 for (ltp_smp =
FFMAX(*bd->
ltp_lag - 2, 0); ltp_smp < block_length; ltp_smp++) {
887 int center = ltp_smp - *bd->
ltp_lag;
888 int begin =
FFMAX(0, center - 2);
889 int end = center + 3;
890 int tab = 5 - (end - begin);
891 int base;
892
893 y = 1 << 6;
894
895 for (base = begin; base <
end; base++, tab++)
897
898 raw_samples[ltp_smp] += y >> 7;
899 }
900 }
901
902 // reconstruct all samples from residuals
904 for (smp = 0; smp < opt_order; smp++) {
905 y = 1 << 19;
906
907 for (sb = 0; sb < smp; sb++)
908 y +=
MUL64(lpc_cof[sb], raw_samples[-(sb + 1)]);
909
910 *raw_samples++ -= y >> 20;
912 }
913 } else {
914 for (k = 0; k < opt_order; k++)
916
917 // store previous samples in case that they have to be altered
921
922 // reconstruct difference signal for prediction (joint-stereo)
925
926 if (bd->
raw_other > raw_samples) {
// D = R - L
927 left = raw_samples;
929 } else { // D = R - L
931 right = raw_samples;
932 }
933
934 for (sb = -1; sb >= -sconf->
max_order; sb--)
935 raw_samples[sb] = right[sb] - left[sb];
936 }
937
938 // reconstruct shifted signal
940 for (sb = -1; sb >= -sconf->
max_order; sb--)
942 }
943
944 // reverse linear prediction coefficients for efficiency
945 lpc_cof = lpc_cof + opt_order;
946
947 for (sb = 0; sb < opt_order; sb++)
948 lpc_cof_reversed[sb] = lpc_cof[-(sb + 1)];
949
950 // reconstruct raw samples
952 lpc_cof = lpc_cof_reversed + opt_order;
953
954 for (; raw_samples < raw_samples_end; raw_samples++) {
955 y = 1 << 19;
956
957 for (sb = -opt_order; sb < 0; sb++)
958 y +=
MUL64(lpc_cof[sb], raw_samples[sb]);
959
960 *raw_samples -= y >> 20;
961 }
962
964
965 // restore previous samples in case that they have been altered
968 sizeof(*raw_samples) * sconf->
max_order);
969
970 return 0;
971 }
972
973
974 /** Read the block data.
975 */
977 {
980
982 // read block type flag and read the samples accordingly
986 } else {
989 }
990
991 return 0;
992 }
993
994
995 /** Decode the block data.
996 */
998 {
999 unsigned int smp;
1000
1001 // read block type flag and read the samples accordingly
1005 return -1;
1006
1007 // TODO: read RLSLMS extension data
1008
1012
1013 return 0;
1014 }
1015
1016
1017 /** Read and decode block data successively.
1018 */
1020 {
1022
1024
1025 if (ret)
1027
1029
1031 }
1032
1033
1034 /** Compute the number of samples left to decode for the current frame and
1035 * sets these samples to zero.
1036 */
1038 const unsigned int *div_blocks,
int32_t *
buf)
1039 {
1040 unsigned int count = 0;
1041
1042 while (b < b_max)
1043 count += div_blocks[b++];
1044
1045 if (count)
1046 memset(buf, 0, sizeof(*buf) * count);
1047 }
1048
1049
1050 /** Decode blocks independently.
1051 */
1053 unsigned int c,
const unsigned int *div_blocks,
1054 unsigned int *js_blocks)
1055 {
1058
1071
1072
1075
1077 // damaged block, write zero for the rest of the frame
1079 return -1;
1080 }
1083 }
1084
1085 return 0;
1086 }
1087
1088
1089 /** Decode blocks dependently.
1090 */
1092 unsigned int c,
const unsigned int *div_blocks,
1093 unsigned int *js_blocks)
1094 {
1099
1112
1125
1126 // decode all blocks
1129
1132
1135
1138
1140 // damaged block, write zero for the rest of the frame
1143 return -1;
1144 }
1145
1146 // reconstruct joint-stereo blocks
1147 if (bd[0].js_blocks) {
1148 if (bd[1].js_blocks)
1150
1151 for (s = 0; s < div_blocks[
b]; s++)
1152 bd[0].raw_samples[s] = bd[1].raw_samples[s] - bd[0].raw_samples[s];
1153 } else if (bd[1].js_blocks) {
1154 for (s = 0; s < div_blocks[
b]; s++)
1155 bd[1].raw_samples[s] = bd[1].raw_samples[s] + bd[0].raw_samples[s];
1156 }
1157
1158 offset += div_blocks[
b];
1161 }
1162
1163 // store carryover raw samples,
1164 // the others channel raw samples are stored by the calling function.
1168
1169 return 0;
1170 }
1171
1172
1173 /** Read the channel data.
1174 */
1176 {
1180 int entries = 0;
1181
1184
1187 return -1;
1188 }
1189
1195
1200
1203 }
1204 }
1205
1206 current++;
1207 entries++;
1208 }
1209
1210 if (entries == channels) {
1212 return -1;
1213 }
1214
1216 return 0;
1217 }
1218
1219
1220 /** Recursively reverts the inter-channel correlation for a block.
1221 */
1225 {
1227 unsigned int dep = 0;
1229
1230 if (reverted[c])
1231 return 0;
1232
1234
1235 while (dep < channels && !ch[dep].stop_flag) {
1237 ch[dep].master_channel);
1238
1239 dep++;
1240 }
1241
1242 if (dep == channels) {
1244 return -1;
1245 }
1246
1257
1258 dep = 0;
1259 while (!ch[dep].stop_flag) {
1260 unsigned int smp;
1261 unsigned int begin = 1;
1265
1266 if (ch[dep].time_diff_flag) {
1268
1269 if (ch[dep].time_diff_sign) {
1272 } else {
1274 }
1275
1276 for (smp = begin; smp <
end; smp++) {
1277 y = (1 << 6) +
1278 MUL64(ch[dep].weighting[0], master[smp - 1 ]) +
1279 MUL64(ch[dep].weighting[1], master[smp ]) +
1280 MUL64(ch[dep].weighting[2], master[smp + 1 ]) +
1281 MUL64(ch[dep].weighting[3], master[smp - 1 + t]) +
1282 MUL64(ch[dep].weighting[4], master[smp + t]) +
1283 MUL64(ch[dep].weighting[5], master[smp + 1 + t]);
1284
1286 }
1287 } else {
1288 for (smp = begin; smp <
end; smp++) {
1289 y = (1 << 6) +
1290 MUL64(ch[dep].weighting[0], master[smp - 1]) +
1291 MUL64(ch[dep].weighting[1], master[smp ]) +
1292 MUL64(ch[dep].weighting[2], master[smp + 1]);
1293
1295 }
1296 }
1297
1298 dep++;
1299 }
1300
1301 return 0;
1302 }
1303
1304
1305 /** Read the frame data.
1306 */
1308 {
1312 unsigned int div_blocks[32]; ///< block sizes.
1314 unsigned int js_blocks[2];
1315
1316 uint32_t bs_info = 0;
1317
1318 // skip the size of the ra unit if present in the frame
1321
1325 }
1326
1329
1330 for (c = 0; c < avctx->
channels; c++) {
1331 js_blocks[0] = 0;
1332 js_blocks[1] = 0;
1333
1335
1336 // if joint_stereo and block_switching is set, independent decoding
1337 // is signaled via the first bit of bs_info
1339 if (bs_info >> 31)
1340 independent_bs = 2;
1341
1342 // if this is the last channel, it has to be decoded independently
1344 independent_bs = 1;
1345
1346 if (independent_bs) {
1348 return -1;
1349
1350 independent_bs--;
1351 } else {
1353 return -1;
1354
1355 c++;
1356 }
1357
1358 // store carryover raw samples
1362 }
1363 } else { // multi-channel coding
1368
1369 for (c = 0; c < avctx->
channels; c++)
1372 return -1;
1373 }
1374
1375 memset(reverted_channels, 0,
sizeof(*reverted_channels) * avctx->
channels);
1376
1379
1381
1384
1385 for (c = 0; c < avctx->
channels; c++) {
1397
1402 }
1403
1404 for (c = 0; c < avctx->
channels; c++)
1406 reverted_channels, offset, c))
1407 return -1;
1408
1409 for (c = 0; c < avctx->
channels; c++) {
1420
1423 }
1424
1425 memset(reverted_channels, 0, avctx->
channels *
sizeof(*reverted_channels));
1426 offset += div_blocks[
b];
1428 }
1429
1430 // store carryover raw samples
1431 for (c = 0; c < avctx->
channels; c++)
1435 }
1436
1437 // TODO: read_diff_float_data
1438
1439 return 0;
1440 }
1441
1442
1443 /** Decode an ALS frame.
1444 */
1447 {
1452 int buffer_size = avpkt->
size;
1453 int invalid_frame,
ret;
1455
1457
1458 // In the case that the distance between random access frames is set to zero
1459 // (sconf->ra_distance == 0) no frame is treated as a random access frame.
1460 // For the first frame, if prediction is used, all samples used from the
1461 // previous frame are assumed to be zero.
1463
1464 // the last frame to decode might have a different length
1465 if (sconf->
samples != 0xFFFFFFFF)
1468 else
1470
1471 // decode the frame data
1474 "Reading frame data failed. Skipping RA unit.\n");
1475
1477
1478 /* get output buffer */
1482
1483 // transform decoded frame into output format
1484 #define INTERLEAVE_OUTPUT(bps) \
1485 { \
1486 int##bps##_t *dest = (int##bps##_t*)frame->data[0]; \
1487 shift = bps - ctx->avctx->bits_per_raw_sample; \
1488 if (!ctx->cs_switch) { \
1489 for (sample = 0; sample < ctx->cur_frame_length; sample++) \
1490 for (c = 0; c < avctx->channels; c++) \
1491 *dest++ = ctx->raw_samples[c][sample] << shift; \
1492 } else { \
1493 for (sample = 0; sample < ctx->cur_frame_length; sample++) \
1494 for (c = 0; c < avctx->channels; c++) \
1495 *dest++ = ctx->raw_samples[sconf->chan_pos[c]][sample] << shift; \
1496 } \
1497 }
1498
1501 } else {
1503 }
1504
1505 // update CRC
1507 int swap = HAVE_BIGENDIAN != sconf->
msb_first;
1508
1511
1514 sample++) {
1516
1517 if (swap)
1519 else
1521 if (!HAVE_BIGENDIAN)
1522 v >>= 8;
1523
1525 }
1526 } else {
1528
1529 if (swap) {
1531 int16_t *
src = (int16_t*) frame->
data[0];
1533 for (sample = 0;
1535 sample++)
1537 } else {
1539 (uint32_t *)frame->
data[0],
1541 }
1543 } else {
1544 crc_source = frame->
data[0];
1545 }
1546
1550 }
1551
1552
1553 // check CRC sums if this is the last frame
1557 }
1558 }
1559
1560 *got_frame_ptr = 1;
1561
1562 bytes_read = invalid_frame ? buffer_size :
1564
1565 return bytes_read;
1566 }
1567
1568
1569 /** Uninitialize the ALS decoder.
1570 */
1572 {
1574
1576
1578
1599
1600 return 0;
1601 }
1602
1603
1604 /** Initialize the ALS decoder.
1605 */
1607 {
1609 unsigned int channel_size;
1610 int num_buffers;
1614
1617 return -1;
1618 }
1619
1623 return -1;
1624 }
1625
1628 return -1;
1629 }
1630
1633
1637 } else {
1641 }
1642
1643 // set maximum Rice parameter for progressive decoding based on resolution
1644 // This is not specified in 14496-3 but actually done by the reference
1645 // codec RM22 revision 2.
1647
1648 // set lag value for long-term prediction
1651
1652 // allocate quantized parcor coefficient buffer
1654
1663
1669 }
1670
1671 // assign quantized parcor coefficient buffers
1672 for (c = 0; c < num_buffers; c++) {
1675 }
1676
1677 // allocate and assign lag and gain data buffer for ltp mode
1686 num_buffers * 5);
1687
1695 }
1696
1697 for (c = 0; c < num_buffers; c++)
1699
1700 // allocate and assign channel data buffer for mcc mode
1703 num_buffers * num_buffers);
1705 num_buffers);
1707 num_buffers);
1708
1713 }
1714
1715 for (c = 0; c < num_buffers; c++)
1717 } else {
1721 }
1722
1724
1728
1729 // allocate previous raw sample buffer
1734 }
1735
1736 // assign raw samples buffers
1738 for (c = 1; c < avctx->
channels; c++)
1740
1741 // allocate crc buffer
1752 }
1753 }
1754
1756
1757 return 0;
1758 }
1759
1760
1761 /** Flush (reset) the frame ID after seeking.
1762 */
1764 {
1766
1768 }
1769
1770
1782 };