/proc/self/cwd/libfaad/lt_predict.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | ** FAAD2 - Freeware Advanced Audio (AAC) Decoder including SBR decoding |
3 | | ** Copyright (C) 2003-2005 M. Bakker, Nero AG, http://www.nero.com |
4 | | ** |
5 | | ** This program is free software; you can redistribute it and/or modify |
6 | | ** it under the terms of the GNU General Public License as published by |
7 | | ** the Free Software Foundation; either version 2 of the License, or |
8 | | ** (at your option) any later version. |
9 | | ** |
10 | | ** This program is distributed in the hope that it will be useful, |
11 | | ** but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | | ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | | ** GNU General Public License for more details. |
14 | | ** |
15 | | ** You should have received a copy of the GNU General Public License |
16 | | ** along with this program; if not, write to the Free Software |
17 | | ** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
18 | | ** |
19 | | ** Any non-GPL usage of this software or parts of this software is strictly |
20 | | ** forbidden. |
21 | | ** |
22 | | ** The "appropriate copyright message" mentioned in section 2c of the GPLv2 |
23 | | ** must read: "Code from FAAD2 is copyright (c) Nero AG, www.nero.com" |
24 | | ** |
25 | | ** Commercial non-GPL licensing of this software is possible. |
26 | | ** For more info contact Nero AG through Mpeg4AAClicense@nero.com. |
27 | | ** |
28 | | ** $Id: lt_predict.c,v 1.27 2007/11/01 12:33:31 menno Exp $ |
29 | | **/ |
30 | | |
31 | | |
32 | | #include "common.h" |
33 | | #include "structs.h" |
34 | | |
35 | | #ifdef LTP_DEC |
36 | | |
37 | | #include <stdlib.h> |
38 | | #include "syntax.h" |
39 | | #include "lt_predict.h" |
40 | | #include "filtbank.h" |
41 | | #include "tns.h" |
42 | | |
43 | | |
44 | | /* static function declarations */ |
45 | | static int16_t real_to_int16(real_t sig_in); |
46 | | |
47 | | |
48 | | /* check if the object type is an object type that can have LTP */ |
49 | | uint8_t is_ltp_ot(uint8_t object_type) |
50 | 0 | { |
51 | 0 | #ifdef LTP_DEC |
52 | 0 | if ((object_type == LTP) |
53 | 0 | #ifdef ERROR_RESILIENCE |
54 | 0 | || (object_type == ER_LTP) |
55 | 0 | #endif |
56 | 0 | #ifdef LD_DEC |
57 | 0 | || (object_type == LD) |
58 | 0 | #endif |
59 | 0 | ) |
60 | 0 | { |
61 | 0 | return 1; |
62 | 0 | } |
63 | 0 | #endif |
64 | | |
65 | 0 | return 0; |
66 | 0 | } |
67 | | |
68 | | ALIGN static const real_t codebook[8] = |
69 | | { |
70 | | REAL_CONST(0.570829), |
71 | | REAL_CONST(0.696616), |
72 | | REAL_CONST(0.813004), |
73 | | REAL_CONST(0.911304), |
74 | | REAL_CONST(0.984900), |
75 | | REAL_CONST(1.067894), |
76 | | REAL_CONST(1.194601), |
77 | | REAL_CONST(1.369533) |
78 | | }; |
79 | | |
80 | | void lt_prediction(ic_stream *ics, ltp_info *ltp, real_t *spec, |
81 | | int16_t *lt_pred_stat, fb_info *fb, uint8_t win_shape, |
82 | | uint8_t win_shape_prev, uint8_t sr_index, |
83 | | uint8_t object_type, uint16_t frame_len) |
84 | 0 | { |
85 | 0 | uint8_t sfb; |
86 | 0 | uint16_t bin, i, num_samples; |
87 | 0 | ALIGN real_t x_est[2048]; |
88 | 0 | ALIGN real_t X_est[2048]; |
89 | |
|
90 | 0 | if (ics->window_sequence != EIGHT_SHORT_SEQUENCE) |
91 | 0 | { |
92 | 0 | if (ltp->data_present) |
93 | 0 | { |
94 | 0 | num_samples = frame_len << 1; |
95 | |
|
96 | 0 | for(i = 0; i < num_samples; i++) |
97 | 0 | { |
98 | | /* The extra lookback M (N/2 for LD, 0 for LTP) is handled |
99 | | in the buffer updating */ |
100 | |
|
101 | | #if 0 |
102 | | x_est[i] = MUL_R_C(lt_pred_stat[num_samples + i - ltp->lag], |
103 | | codebook[ltp->coef]); |
104 | | #else |
105 | | /* lt_pred_stat is a 16 bit int, multiplied with the fixed point real |
106 | | this gives a real for x_est |
107 | | */ |
108 | 0 | x_est[i] = (real_t)lt_pred_stat[num_samples + i - ltp->lag] * codebook[ltp->coef]; |
109 | 0 | #endif |
110 | 0 | } |
111 | |
|
112 | 0 | filter_bank_ltp(fb, ics->window_sequence, win_shape, win_shape_prev, |
113 | 0 | x_est, X_est, object_type, frame_len); |
114 | |
|
115 | 0 | tns_encode_frame(ics, &(ics->tns), sr_index, object_type, X_est, |
116 | 0 | frame_len); |
117 | |
|
118 | 0 | for (sfb = 0; sfb < ltp->last_band; sfb++) |
119 | 0 | { |
120 | 0 | if (ltp->long_used[sfb]) |
121 | 0 | { |
122 | 0 | uint16_t low = ics->swb_offset[sfb]; |
123 | 0 | uint16_t high = min(ics->swb_offset[sfb+1], ics->swb_offset_max); |
124 | |
|
125 | 0 | for (bin = low; bin < high; bin++) |
126 | 0 | { |
127 | 0 | spec[bin] += X_est[bin]; |
128 | 0 | } |
129 | 0 | } |
130 | 0 | } |
131 | 0 | } |
132 | 0 | } |
133 | 0 | } |
134 | | |
135 | | #ifdef FIXED_POINT |
136 | | static INLINE int16_t real_to_int16(real_t sig_in) |
137 | | { |
138 | | if (sig_in >= 0) |
139 | | { |
140 | | sig_in += (1 << (REAL_BITS-1)); |
141 | | if (sig_in >= REAL_CONST(32768)) |
142 | | return 32767; |
143 | | } else { |
144 | | sig_in += -(1 << (REAL_BITS-1)); |
145 | | if (sig_in <= REAL_CONST(-32768)) |
146 | | return -32768; |
147 | | } |
148 | | |
149 | | return (int16_t)(sig_in >> REAL_BITS); |
150 | | } |
151 | | #else |
152 | | static INLINE int16_t real_to_int16(real_t sig_in) |
153 | 0 | { |
154 | 0 | if (sig_in >= 0) |
155 | 0 | { |
156 | 0 | #ifndef HAS_LRINTF |
157 | 0 | sig_in += 0.5f; |
158 | 0 | #endif |
159 | 0 | if (sig_in >= 32768.0f) |
160 | 0 | return 32767; |
161 | 0 | } else { |
162 | 0 | #ifndef HAS_LRINTF |
163 | 0 | sig_in += -0.5f; |
164 | 0 | #endif |
165 | 0 | if (sig_in <= -32768.0f) |
166 | 0 | return -32768; |
167 | 0 | } |
168 | | |
169 | 0 | return (int16_t)lrintf(sig_in); |
170 | 0 | } |
171 | | #endif |
172 | | |
173 | | void lt_update_state(int16_t *lt_pred_stat, real_t *time, real_t *overlap, |
174 | | uint16_t frame_len, uint8_t object_type) |
175 | 0 | { |
176 | 0 | uint16_t i; |
177 | | |
178 | | /* |
179 | | * The reference point for index i and the content of the buffer |
180 | | * lt_pred_stat are arranged so that lt_pred_stat(0 ... N/2 - 1) contains the |
181 | | * last aliased half window from the IMDCT, and lt_pred_stat(N/2 ... N-1) |
182 | | * is always all zeros. The rest of lt_pred_stat (i<0) contains the previous |
183 | | * fully reconstructed time domain samples, i.e., output of the decoder. |
184 | | * |
185 | | * These values are shifted up by N*2 to avoid (i<0) |
186 | | * |
187 | | * For the LD object type an extra 512 samples lookback is accomodated here. |
188 | | */ |
189 | 0 | #ifdef LD_DEC |
190 | 0 | if (object_type == LD) |
191 | 0 | { |
192 | 0 | for (i = 0; i < frame_len; i++) |
193 | 0 | { |
194 | 0 | lt_pred_stat[i] /* extra 512 */ = lt_pred_stat[i + frame_len]; |
195 | 0 | lt_pred_stat[frame_len + i] = lt_pred_stat[i + (frame_len * 2)]; |
196 | 0 | lt_pred_stat[(frame_len * 2) + i] = real_to_int16(time[i]); |
197 | 0 | lt_pred_stat[(frame_len * 3) + i] = real_to_int16(overlap[i]); |
198 | 0 | } |
199 | 0 | } else { |
200 | 0 | #endif |
201 | 0 | for (i = 0; i < frame_len; i++) |
202 | 0 | { |
203 | 0 | lt_pred_stat[i] = lt_pred_stat[i + frame_len]; |
204 | 0 | lt_pred_stat[frame_len + i] = real_to_int16(time[i]); |
205 | 0 | lt_pred_stat[(frame_len * 2) + i] = real_to_int16(overlap[i]); |
206 | | #if 0 /* set to zero once upon initialisation */ |
207 | | lt_pred_stat[(frame_len * 3) + i] = 0; |
208 | | #endif |
209 | 0 | } |
210 | 0 | #ifdef LD_DEC |
211 | 0 | } |
212 | 0 | #endif |
213 | 0 | } |
214 | | |
215 | | #endif |