Mercurial > libavcodec.hg
annotate acelp_filters.c @ 6810:17cfc415325d libavcodec
Simplify rotate_block()
author | vitor |
---|---|
date | Thu, 15 May 2008 18:42:05 +0000 |
parents | 1f02f929b9ff |
children | 94465a2c3b34 |
rev | line source |
---|---|
6772 | 1 /* |
2 * various filters for ACELP-based codecs | |
3 * | |
4 * Copyright (c) 2008 Vladimir Voroshilov | |
5 * | |
6 * This file is part of FFmpeg. | |
7 * | |
8 * FFmpeg is free software; you can redistribute it and/or | |
9 * modify it under the terms of the GNU Lesser General Public | |
10 * License as published by the Free Software Foundation; either | |
11 * version 2.1 of the License, or (at your option) any later version. | |
12 * | |
13 * FFmpeg is distributed in the hope that it will be useful, | |
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
16 * Lesser General Public License for more details. | |
17 * | |
18 * You should have received a copy of the GNU Lesser General Public | |
19 * License along with FFmpeg; if not, write to the Free Software | |
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | |
21 */ | |
22 | |
23 #include <inttypes.h> | |
24 | |
25 #include "avcodec.h" | |
26 #include "acelp_filters.h" | |
27 #define FRAC_BITS 13 | |
28 #include "mathops.h" | |
29 | |
30 void ff_acelp_convolve_circ( | |
31 int16_t* fc_out, | |
32 const int16_t* fc_in, | |
33 const int16_t* filter, | |
34 int subframe_size) | |
35 { | |
36 int i, k; | |
37 | |
38 memset(fc_out, 0, subframe_size * sizeof(int16_t)); | |
39 | |
6775
1f02f929b9ff
Update comment to version, negotiated with Diego, and
voroshil
parents:
6772
diff
changeset
|
40 /* Since there are few pulses over an entire subframe (i.e. almost |
1f02f929b9ff
Update comment to version, negotiated with Diego, and
voroshil
parents:
6772
diff
changeset
|
41 all fc_in[i] are zero) it is faster to swap two loops and process |
1f02f929b9ff
Update comment to version, negotiated with Diego, and
voroshil
parents:
6772
diff
changeset
|
42 non-zero samples only. In the case of G.729D the buffer contains |
1f02f929b9ff
Update comment to version, negotiated with Diego, and
voroshil
parents:
6772
diff
changeset
|
43 two non-zero samples before the call to ff_acelp_enhance_harmonics |
1f02f929b9ff
Update comment to version, negotiated with Diego, and
voroshil
parents:
6772
diff
changeset
|
44 and, due to pitch_delay being bounded by [20; 143], a maximum |
1f02f929b9ff
Update comment to version, negotiated with Diego, and
voroshil
parents:
6772
diff
changeset
|
45 of four non-zero samples for a total of 40 after the call. */ |
6772 | 46 for(i=0; i<subframe_size; i++) |
47 { | |
48 if(fc_in[i]) | |
49 { | |
50 for(k=0; k<i; k++) | |
51 fc_out[k] += (fc_in[i] * filter[subframe_size + k - i]) >> 15; | |
52 | |
53 for(k=i; k<subframe_size; k++) | |
54 fc_out[k] += (fc_in[i] * filter[k - i]) >> 15; | |
55 } | |
56 } | |
57 } | |
58 | |
59 int ff_acelp_lp_synthesis_filter( | |
60 int16_t *out, | |
61 const int16_t* filter_coeffs, | |
62 const int16_t* in, | |
63 int buffer_length, | |
64 int filter_length, | |
65 int stop_on_overflow) | |
66 { | |
67 int i,n; | |
68 | |
69 for(n=0; n<buffer_length; n++) | |
70 { | |
71 int sum = 0x800; | |
72 for(i=1; i<filter_length; i++) | |
73 sum -= filter_coeffs[i] * out[n-i]; | |
74 | |
75 sum = (sum >> 12) + in[n]; | |
76 | |
77 /* Check for overflow */ | |
78 if(sum + 0x8000 > 0xFFFFU) | |
79 { | |
80 if(stop_on_overflow) | |
81 return 1; | |
82 sum = (sum >> 31) ^ 32767; | |
83 } | |
84 out[n] = sum; | |
85 } | |
86 | |
87 return 0; | |
88 } | |
89 | |
90 void ff_acelp_weighted_filter( | |
91 int16_t *out, | |
92 const int16_t* in, | |
93 const int16_t *weight_pow, | |
94 int filter_length) | |
95 { | |
96 int n; | |
97 for(n=0; n<filter_length; n++) | |
98 out[n] = (in[n] * weight_pow[n] + 0x4000) >> 15; /* (3.12) = (0.15) * (3.12) with rounding */ | |
99 } | |
100 | |
101 void ff_acelp_high_pass_filter( | |
102 int16_t* out, | |
103 int hpf_f[2], | |
104 const int16_t* in, | |
105 int length) | |
106 { | |
107 int i; | |
108 int tmp; | |
109 | |
110 for(i=0; i<length; i++) | |
111 { | |
112 tmp = MULL(hpf_f[0], 15836); /* (14.13) = (13.13) * (1.13) */ | |
113 tmp += MULL(hpf_f[1], -7667); /* (13.13) = (13.13) * (0.13) */ | |
114 tmp += 7699 * (in[i] - 2*in[i-1] + in[i-2]); /* (14.13) = (0.13) * (14.0) */ | |
115 | |
116 /* Multiplication by 2 with rounding can cause short type | |
117 overflow, thus clipping is required. */ | |
118 | |
119 out[i] = av_clip_int16((tmp + 0x800) >> 12); /* (15.0) = 2 * (13.13) = (14.13) */ | |
120 | |
121 hpf_f[1] = hpf_f[0]; | |
122 hpf_f[0] = tmp; | |
123 } | |
124 } |