Mercurial > libavcodec.hg
annotate mdct.c @ 8708:2ecdf1ad277f libavcodec
Cosmetics: simplifying static initialization
author | romansh |
---|---|
date | Sat, 31 Jan 2009 01:41:04 +0000 |
parents | 04423b2f6e0b |
children | e9d9d946f213 |
rev | line source |
---|---|
781 | 1 /* |
2 * MDCT/IMDCT transforms | |
8629
04423b2f6e0b
cosmetics: Remove pointless period after copyright statement non-sentences.
diego
parents:
8567
diff
changeset
|
3 * Copyright (c) 2002 Fabrice Bellard |
781 | 4 * |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3036
diff
changeset
|
5 * This file is part of FFmpeg. |
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3036
diff
changeset
|
6 * |
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3036
diff
changeset
|
7 * FFmpeg is free software; you can redistribute it and/or |
781 | 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:
3036
diff
changeset
|
10 * version 2.1 of the License, or (at your option) any later version. |
781 | 11 * |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3036
diff
changeset
|
12 * FFmpeg is distributed in the hope that it will be useful, |
781 | 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 | |
3947
c8c591fe26f8
Change license headers to say 'FFmpeg' instead of 'this program/this library'
diego
parents:
3036
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:
2967
diff
changeset
|
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
781 | 20 */ |
21 #include "dsputil.h" | |
22 | |
1106 | 23 /** |
24 * @file mdct.c | |
25 * MDCT/IMDCT transforms. | |
26 */ | |
27 | |
6139
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
28 // Generate a Kaiser-Bessel Derived Window. |
6142
a35b838ab955
Add variable alpha and size of half window for Kaiser-Bessel Derived window
superdump
parents:
6139
diff
changeset
|
29 #define BESSEL_I0_ITER 50 // default: 50 iterations of Bessel I0 approximation |
a35b838ab955
Add variable alpha and size of half window for Kaiser-Bessel Derived window
superdump
parents:
6139
diff
changeset
|
30 void ff_kbd_window_init(float *window, float alpha, int n) |
6139
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
31 { |
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
32 int i, j; |
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
33 double sum = 0.0, bessel, tmp; |
6142
a35b838ab955
Add variable alpha and size of half window for Kaiser-Bessel Derived window
superdump
parents:
6139
diff
changeset
|
34 double local_window[n]; |
a35b838ab955
Add variable alpha and size of half window for Kaiser-Bessel Derived window
superdump
parents:
6139
diff
changeset
|
35 double alpha2 = (alpha * M_PI / n) * (alpha * M_PI / n); |
6139
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
36 |
6142
a35b838ab955
Add variable alpha and size of half window for Kaiser-Bessel Derived window
superdump
parents:
6139
diff
changeset
|
37 for (i = 0; i < n; i++) { |
a35b838ab955
Add variable alpha and size of half window for Kaiser-Bessel Derived window
superdump
parents:
6139
diff
changeset
|
38 tmp = i * (n - i) * alpha2; |
6139
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
39 bessel = 1.0; |
6142
a35b838ab955
Add variable alpha and size of half window for Kaiser-Bessel Derived window
superdump
parents:
6139
diff
changeset
|
40 for (j = BESSEL_I0_ITER; j > 0; j--) |
6139
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
41 bessel = bessel * tmp / (j * j) + 1; |
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
42 sum += bessel; |
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
43 local_window[i] = sum; |
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
44 } |
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
45 |
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
46 sum++; |
6142
a35b838ab955
Add variable alpha and size of half window for Kaiser-Bessel Derived window
superdump
parents:
6139
diff
changeset
|
47 for (i = 0; i < n; i++) |
6139
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
48 window[i] = sqrt(local_window[i] / sum); |
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
49 } |
5077d1562573
Make the Kaiser-Bessel window generator a common function
andoma
parents:
3947
diff
changeset
|
50 |
7577
ed956c3c2cf3
The ff_sine_#[] should be aligned as they will commonly be used in dsputil
superdump
parents:
7573
diff
changeset
|
51 DECLARE_ALIGNED(16, float, ff_sine_128 [ 128]); |
ed956c3c2cf3
The ff_sine_#[] should be aligned as they will commonly be used in dsputil
superdump
parents:
7573
diff
changeset
|
52 DECLARE_ALIGNED(16, float, ff_sine_256 [ 256]); |
ed956c3c2cf3
The ff_sine_#[] should be aligned as they will commonly be used in dsputil
superdump
parents:
7573
diff
changeset
|
53 DECLARE_ALIGNED(16, float, ff_sine_512 [ 512]); |
ed956c3c2cf3
The ff_sine_#[] should be aligned as they will commonly be used in dsputil
superdump
parents:
7573
diff
changeset
|
54 DECLARE_ALIGNED(16, float, ff_sine_1024[1024]); |
ed956c3c2cf3
The ff_sine_#[] should be aligned as they will commonly be used in dsputil
superdump
parents:
7573
diff
changeset
|
55 DECLARE_ALIGNED(16, float, ff_sine_2048[2048]); |
8567 | 56 DECLARE_ALIGNED(16, float, ff_sine_4096[4096]); |
57 float *ff_sine_windows[6] = { | |
58 ff_sine_128, ff_sine_256, ff_sine_512, ff_sine_1024, ff_sine_2048, ff_sine_4096 | |
7573
7802295cae6f
Add declarations for the sine tables used in wma.c (half window sizes: 128,
superdump
parents:
7547
diff
changeset
|
59 }; |
7802295cae6f
Add declarations for the sine tables used in wma.c (half window sizes: 128,
superdump
parents:
7547
diff
changeset
|
60 |
7094
b0820b8bd4dd
Add generic ff_sine_window_init function and implement in codecs appropriately
superdump
parents:
6498
diff
changeset
|
61 // Generate a sine window. |
b0820b8bd4dd
Add generic ff_sine_window_init function and implement in codecs appropriately
superdump
parents:
6498
diff
changeset
|
62 void ff_sine_window_init(float *window, int n) { |
b0820b8bd4dd
Add generic ff_sine_window_init function and implement in codecs appropriately
superdump
parents:
6498
diff
changeset
|
63 int i; |
b0820b8bd4dd
Add generic ff_sine_window_init function and implement in codecs appropriately
superdump
parents:
6498
diff
changeset
|
64 for(i = 0; i < n; i++) |
7822 | 65 window[i] = sinf((i + 0.5) * (M_PI / (2.0 * n))); |
7094
b0820b8bd4dd
Add generic ff_sine_window_init function and implement in codecs appropriately
superdump
parents:
6498
diff
changeset
|
66 } |
b0820b8bd4dd
Add generic ff_sine_window_init function and implement in codecs appropriately
superdump
parents:
6498
diff
changeset
|
67 |
1106 | 68 /** |
69 * init MDCT or IMDCT computation. | |
781 | 70 */ |
794 | 71 int ff_mdct_init(MDCTContext *s, int nbits, int inverse) |
781 | 72 { |
73 int n, n4, i; | |
6498
d9c48a85fd23
improve precision in mdct.c using double for some temporaries
mru
parents:
6142
diff
changeset
|
74 double alpha; |
781 | 75 |
76 memset(s, 0, sizeof(*s)); | |
77 n = 1 << nbits; | |
78 s->nbits = nbits; | |
79 s->n = n; | |
80 n4 = n >> 2; | |
970 | 81 s->tcos = av_malloc(n4 * sizeof(FFTSample)); |
781 | 82 if (!s->tcos) |
83 goto fail; | |
970 | 84 s->tsin = av_malloc(n4 * sizeof(FFTSample)); |
781 | 85 if (!s->tsin) |
86 goto fail; | |
87 | |
88 for(i=0;i<n4;i++) { | |
89 alpha = 2 * M_PI * (i + 1.0 / 8.0) / n; | |
90 s->tcos[i] = -cos(alpha); | |
91 s->tsin[i] = -sin(alpha); | |
92 } | |
1879
dd63cb7e5080
fft_*() renamed into ff_fft_*() patch by (Gildas Bazin <gbazin at altern dot org>)
michael
parents:
1106
diff
changeset
|
93 if (ff_fft_init(&s->fft, s->nbits - 2, inverse) < 0) |
781 | 94 goto fail; |
95 return 0; | |
96 fail: | |
97 av_freep(&s->tcos); | |
98 av_freep(&s->tsin); | |
99 return -1; | |
100 } | |
101 | |
102 /* complex multiplication: p = a * b */ | |
103 #define CMUL(pre, pim, are, aim, bre, bim) \ | |
104 {\ | |
7545 | 105 FFTSample _are = (are);\ |
106 FFTSample _aim = (aim);\ | |
107 FFTSample _bre = (bre);\ | |
108 FFTSample _bim = (bim);\ | |
781 | 109 (pre) = _are * _bre - _aim * _bim;\ |
110 (pim) = _are * _bim + _aim * _bre;\ | |
111 } | |
112 | |
7544 | 113 /** |
114 * Compute the middle half of the inverse MDCT of size N = 2^nbits, | |
115 * thus excluding the parts that can be derived by symmetry | |
116 * @param output N/2 samples | |
117 * @param input N/2 samples | |
118 */ | |
7547 | 119 void ff_imdct_half_c(MDCTContext *s, FFTSample *output, const FFTSample *input) |
781 | 120 { |
7544 | 121 int k, n8, n4, n2, n, j; |
781 | 122 const uint16_t *revtab = s->fft.revtab; |
123 const FFTSample *tcos = s->tcos; | |
124 const FFTSample *tsin = s->tsin; | |
125 const FFTSample *in1, *in2; | |
7544 | 126 FFTComplex *z = (FFTComplex *)output; |
781 | 127 |
128 n = 1 << s->nbits; | |
129 n2 = n >> 1; | |
130 n4 = n >> 2; | |
7544 | 131 n8 = n >> 3; |
781 | 132 |
133 /* pre rotation */ | |
134 in1 = input; | |
135 in2 = input + n2 - 1; | |
136 for(k = 0; k < n4; k++) { | |
137 j=revtab[k]; | |
138 CMUL(z[j].re, z[j].im, *in2, *in1, tcos[k], tsin[k]); | |
139 in1 += 2; | |
140 in2 -= 2; | |
141 } | |
1879
dd63cb7e5080
fft_*() renamed into ff_fft_*() patch by (Gildas Bazin <gbazin at altern dot org>)
michael
parents:
1106
diff
changeset
|
142 ff_fft_calc(&s->fft, z); |
781 | 143 |
144 /* post rotation + reordering */ | |
7544 | 145 output += n4; |
146 for(k = 0; k < n8; k++) { | |
147 FFTSample r0, i0, r1, i1; | |
148 CMUL(r0, i1, z[n8-k-1].im, z[n8-k-1].re, tsin[n8-k-1], tcos[n8-k-1]); | |
149 CMUL(r1, i0, z[n8+k ].im, z[n8+k ].re, tsin[n8+k ], tcos[n8+k ]); | |
150 z[n8-k-1].re = r0; | |
151 z[n8-k-1].im = i0; | |
152 z[n8+k ].re = r1; | |
153 z[n8+k ].im = i1; | |
781 | 154 } |
7263 | 155 } |
156 | |
157 /** | |
158 * Compute inverse MDCT of size N = 2^nbits | |
159 * @param output N samples | |
160 * @param input N/2 samples | |
161 * @param tmp N/2 samples | |
162 */ | |
7547 | 163 void ff_imdct_calc_c(MDCTContext *s, FFTSample *output, const FFTSample *input) |
7263 | 164 { |
7544 | 165 int k; |
166 int n = 1 << s->nbits; | |
167 int n2 = n >> 1; | |
168 int n4 = n >> 2; | |
781 | 169 |
7547 | 170 ff_imdct_half_c(s, output+n4, input); |
7263 | 171 |
7544 | 172 for(k = 0; k < n4; k++) { |
173 output[k] = -output[n2-k-1]; | |
174 output[n-k-1] = output[n2+k]; | |
7263 | 175 } |
176 } | |
177 | |
178 /** | |
781 | 179 * Compute MDCT of size N = 2^nbits |
180 * @param input N samples | |
181 * @param out N/2 samples | |
182 * @param tmp temporary storage of N/2 samples | |
183 */ | |
7546 | 184 void ff_mdct_calc(MDCTContext *s, FFTSample *out, const FFTSample *input) |
781 | 185 { |
186 int i, j, n, n8, n4, n2, n3; | |
7546 | 187 FFTSample re, im; |
781 | 188 const uint16_t *revtab = s->fft.revtab; |
189 const FFTSample *tcos = s->tcos; | |
190 const FFTSample *tsin = s->tsin; | |
7544 | 191 FFTComplex *x = (FFTComplex *)out; |
781 | 192 |
193 n = 1 << s->nbits; | |
194 n2 = n >> 1; | |
195 n4 = n >> 2; | |
196 n8 = n >> 3; | |
197 n3 = 3 * n4; | |
198 | |
199 /* pre rotation */ | |
200 for(i=0;i<n8;i++) { | |
201 re = -input[2*i+3*n4] - input[n3-1-2*i]; | |
202 im = -input[n4+2*i] + input[n4-1-2*i]; | |
203 j = revtab[i]; | |
204 CMUL(x[j].re, x[j].im, re, im, -tcos[i], tsin[i]); | |
205 | |
206 re = input[2*i] - input[n2-1-2*i]; | |
207 im = -(input[n2+2*i] + input[n-1-2*i]); | |
208 j = revtab[n8 + i]; | |
209 CMUL(x[j].re, x[j].im, re, im, -tcos[n8 + i], tsin[n8 + i]); | |
210 } | |
211 | |
1879
dd63cb7e5080
fft_*() renamed into ff_fft_*() patch by (Gildas Bazin <gbazin at altern dot org>)
michael
parents:
1106
diff
changeset
|
212 ff_fft_calc(&s->fft, x); |
2967 | 213 |
781 | 214 /* post rotation */ |
7544 | 215 for(i=0;i<n8;i++) { |
216 FFTSample r0, i0, r1, i1; | |
217 CMUL(i1, r0, x[n8-i-1].re, x[n8-i-1].im, -tsin[n8-i-1], -tcos[n8-i-1]); | |
218 CMUL(i0, r1, x[n8+i ].re, x[n8+i ].im, -tsin[n8+i ], -tcos[n8+i ]); | |
219 x[n8-i-1].re = r0; | |
220 x[n8-i-1].im = i0; | |
221 x[n8+i ].re = r1; | |
222 x[n8+i ].im = i1; | |
781 | 223 } |
224 } | |
225 | |
794 | 226 void ff_mdct_end(MDCTContext *s) |
781 | 227 { |
228 av_freep(&s->tcos); | |
229 av_freep(&s->tsin); | |
1879
dd63cb7e5080
fft_*() renamed into ff_fft_*() patch by (Gildas Bazin <gbazin at altern dot org>)
michael
parents:
1106
diff
changeset
|
230 ff_fft_end(&s->fft); |
781 | 231 } |