Mercurial > libavcodec.hg
annotate ac3.c @ 4645:056127e5df89 libavcodec
remove redundancy in AC-3 parser by using common tables from ac3tab.h
author | jbr |
---|---|
date | Sun, 11 Mar 2007 02:13:05 +0000 |
parents | 7e140e4cd8cb |
children | 5683b496ffbc |
rev | line source |
---|---|
0 | 1 /* |
4642 | 2 * Common code between AC3 encoder and decoder |
429 | 3 * Copyright (c) 2000 Fabrice Bellard. |
0 | 4 * |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3668
diff
changeset
|
5 * This file is part of FFmpeg. |
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3668
diff
changeset
|
6 * |
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3668
diff
changeset
|
7 * FFmpeg is free software; you can redistribute it and/or |
429 | 8 * modify it under the terms of the GNU Lesser General Public |
9 * License as published by the Free Software Foundation; either | |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3668
diff
changeset
|
10 * version 2.1 of the License, or (at your option) any later version. |
0 | 11 * |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3668
diff
changeset
|
12 * FFmpeg is distributed in the hope that it will be useful, |
0 | 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
429 | 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
15 * Lesser General Public License for more details. | |
0 | 16 * |
429 | 17 * You should have received a copy of the GNU Lesser General Public |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3668
diff
changeset
|
18 * License along with FFmpeg; if not, write to the Free Software |
3036
0b546eab515d
Update licensing information: The FSF changed postal address.
diego
parents:
2979
diff
changeset
|
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
0 | 20 */ |
1106 | 21 |
22 /** | |
4642 | 23 * @file ac3.c |
24 * Common code between AC3 encoder and decoder. | |
1106 | 25 */ |
782 | 26 |
4642 | 27 #include "avcodec.h" |
28 #include "ac3.h" | |
0 | 29 #include "ac3tab.h" |
30 | |
4641 | 31 static inline int calc_lowcomp1(int a, int b0, int b1, int c) |
0 | 32 { |
33 if ((b0 + 256) == b1) { | |
4641 | 34 a = c; |
2967 | 35 } else if (b0 > b1) { |
4641 | 36 a = FFMAX(a - 64, 0); |
0 | 37 } |
38 return a; | |
39 } | |
40 | |
41 static inline int calc_lowcomp(int a, int b0, int b1, int bin) | |
42 { | |
43 if (bin < 7) { | |
4641 | 44 return calc_lowcomp1(a, b0, b1, 384); |
0 | 45 } else if (bin < 20) { |
4641 | 46 return calc_lowcomp1(a, b0, b1, 320); |
0 | 47 } else { |
4641 | 48 return FFMAX(a - 128, 0); |
0 | 49 } |
50 } | |
51 | |
52 /* AC3 bit allocation. The algorithm is the one described in the AC3 | |
782 | 53 spec. */ |
1064 | 54 void ac3_parametric_bit_allocation(AC3BitAllocParameters *s, uint8_t *bap, |
55 int8_t *exp, int start, int end, | |
782 | 56 int snroffset, int fgain, int is_lfe, |
2967 | 57 int deltbae,int deltnseg, |
1064 | 58 uint8_t *deltoffst, uint8_t *deltlen, uint8_t *deltba) |
0 | 59 { |
4641 | 60 int bin,i,j,k,end1,v,bndstrt,bndend,lowcomp,begin; |
0 | 61 int fastleak,slowleak,address,tmp; |
1064 | 62 int16_t psd[256]; /* scaled exponents */ |
63 int16_t bndpsd[50]; /* interpolated exponents */ | |
64 int16_t excite[50]; /* excitation */ | |
65 int16_t mask[50]; /* masking value */ | |
0 | 66 |
67 /* exponent mapping to PSD */ | |
68 for(bin=start;bin<end;bin++) { | |
69 psd[bin]=(3072 - (exp[bin] << 7)); | |
70 } | |
71 | |
72 /* PSD integration */ | |
73 j=start; | |
74 k=masktab[start]; | |
75 do { | |
76 v=psd[j]; | |
77 j++; | |
4641 | 78 end1 = FFMIN(bndtab[k+1], end); |
0 | 79 for(i=j;i<end1;i++) { |
80 /* logadd */ | |
4641 | 81 int adr = FFMIN(FFABS(v - psd[j]) >> 1, 255); |
82 v = FFMAX(v, psd[j]) + latab[adr]; | |
0 | 83 j++; |
84 } | |
85 bndpsd[k]=v; | |
86 k++; | |
87 } while (end > bndtab[k]); | |
88 | |
89 /* excitation function */ | |
90 bndstrt = masktab[start]; | |
91 bndend = masktab[end-1] + 1; | |
2967 | 92 |
782 | 93 if (bndstrt == 0) { |
94 lowcomp = 0; | |
4641 | 95 lowcomp = calc_lowcomp1(lowcomp, bndpsd[0], bndpsd[1], 384); |
4640 | 96 excite[0] = bndpsd[0] - fgain - lowcomp; |
4641 | 97 lowcomp = calc_lowcomp1(lowcomp, bndpsd[1], bndpsd[2], 384); |
4640 | 98 excite[1] = bndpsd[1] - fgain - lowcomp; |
99 begin = 7; | |
782 | 100 for (bin = 2; bin < 7; bin++) { |
101 if (!(is_lfe && bin == 6)) | |
4641 | 102 lowcomp = calc_lowcomp1(lowcomp, bndpsd[bin], bndpsd[bin+1], 384); |
4640 | 103 fastleak = bndpsd[bin] - fgain; |
104 slowleak = bndpsd[bin] - s->sgain; | |
105 excite[bin] = fastleak - lowcomp; | |
782 | 106 if (!(is_lfe && bin == 6)) { |
107 if (bndpsd[bin] <= bndpsd[bin+1]) { | |
4640 | 108 begin = bin + 1; |
109 break; | |
782 | 110 } |
111 } | |
112 } | |
2967 | 113 |
782 | 114 end1=bndend; |
115 if (end1 > 22) end1=22; | |
2967 | 116 |
782 | 117 for (bin = begin; bin < end1; bin++) { |
118 if (!(is_lfe && bin == 6)) | |
4640 | 119 lowcomp = calc_lowcomp(lowcomp, bndpsd[bin], bndpsd[bin+1], bin); |
2967 | 120 |
4641 | 121 fastleak = FFMAX(fastleak - s->fdecay, bndpsd[bin] - fgain); |
122 slowleak = FFMAX(slowleak - s->sdecay, bndpsd[bin] - s->sgain); | |
123 excite[bin] = FFMAX(fastleak - lowcomp, slowleak); | |
782 | 124 } |
125 begin = 22; | |
126 } else { | |
127 /* coupling channel */ | |
128 begin = bndstrt; | |
2967 | 129 |
782 | 130 fastleak = (s->cplfleak << 8) + 768; |
131 slowleak = (s->cplsleak << 8) + 768; | |
0 | 132 } |
133 | |
782 | 134 for (bin = begin; bin < bndend; bin++) { |
4641 | 135 fastleak = FFMAX(fastleak - s->fdecay, bndpsd[bin] - fgain); |
136 slowleak = FFMAX(slowleak - s->sdecay, bndpsd[bin] - s->sgain); | |
137 excite[bin] = FFMAX(fastleak, slowleak); | |
0 | 138 } |
139 | |
140 /* compute masking curve */ | |
141 | |
142 for (bin = bndstrt; bin < bndend; bin++) { | |
143 tmp = s->dbknee - bndpsd[bin]; | |
144 if (tmp > 0) { | |
4641 | 145 excite[bin] += tmp >> 2; |
0 | 146 } |
4641 | 147 mask[bin] = FFMAX(hth[bin >> s->halfratecod][s->fscod], excite[bin]); |
0 | 148 } |
149 | |
782 | 150 /* delta bit allocation */ |
151 | |
152 if (deltbae == 0 || deltbae == 1) { | |
153 int band, seg, delta; | |
4640 | 154 band = 0; |
782 | 155 for (seg = 0; seg < deltnseg; seg++) { |
4640 | 156 band += deltoffst[seg]; |
782 | 157 if (deltba[seg] >= 4) { |
158 delta = (deltba[seg] - 3) << 7; | |
159 } else { | |
160 delta = (deltba[seg] - 4) << 7; | |
161 } | |
162 for (k = 0; k < deltlen[seg]; k++) { | |
4640 | 163 mask[band] += delta; |
164 band++; | |
782 | 165 } |
166 } | |
167 } | |
168 | |
0 | 169 /* compute bit allocation */ |
2967 | 170 |
4640 | 171 i = start; |
172 j = masktab[start]; | |
0 | 173 do { |
4641 | 174 v = (FFMAX(mask[j] - snroffset - s->floor, 0) & 0x1FE0) + s->floor; |
175 end1 = FFMIN(bndtab[j] + bndsz[j], end); | |
0 | 176 for (k = i; k < end1; k++) { |
4641 | 177 address = av_clip((psd[i] - v) >> 5, 0, 63); |
0 | 178 bap[i] = baptab[address]; |
179 i++; | |
180 } | |
4640 | 181 } while (end > bndtab[j++]); |
0 | 182 } |
183 | |
4645
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
184 /** |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
185 * Initializes some tables. |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
186 * note: This function must remain thread safe because it is called by the |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
187 * AVParser init code. |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
188 */ |
4197 | 189 void ac3_common_init(void) |
782 | 190 { |
191 int i, j, k, l, v; | |
192 /* compute bndtab and masktab from bandsz */ | |
193 k = 0; | |
194 l = 0; | |
195 for(i=0;i<50;i++) { | |
196 bndtab[i] = l; | |
197 v = bndsz[i]; | |
198 for(j=0;j<v;j++) masktab[k++]=i; | |
199 l += v; | |
200 } | |
3668
34d76180e5d0
Fix 2 bit allocation bugs. One fix enables using a higher bandwidth code. The other fixes an issue with floorcod=7.
jbr
parents:
3280
diff
changeset
|
201 bndtab[50] = l; |
4645
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
202 |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
203 /* generate ff_ac3_frame_sizes table */ |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
204 for(i=0; i<38; i++) { |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
205 int br = ff_ac3_bitratetab[i >> 1]; |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
206 ff_ac3_frame_sizes[i][0] = ( 2*br ); |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
207 ff_ac3_frame_sizes[i][1] = (320*br / 147) + (i & 1); |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
208 ff_ac3_frame_sizes[i][2] = ( 3*br ); |
056127e5df89
remove redundancy in AC-3 parser by using common tables from ac3tab.h
jbr
parents:
4642
diff
changeset
|
209 } |
782 | 210 } |