2 ** FAAD2 - Freeware Advanced Audio (AAC) Decoder including SBR decoding
3 ** Copyright (C) 2003-2005 M. Bakker, Nero AG, http://www.nero.com
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.
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.
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.
19 ** Any non-GPL usage of this software or parts of this software is strictly
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"
25 ** Commercial non-GPL licensing of this software is possible.
26 ** For more info contact Nero AG through Mpeg4AAClicense@nero.com.
28 ** $Id: filtbank.c,v 1.46 2009/01/26 23:51:15 menno Exp $
49 fb_info *filter_bank_init(uint16_t frame_len)
51 uint16_t nshort = frame_len/8;
53 uint16_t frame_len_ld = frame_len/2;
56 fb_info *fb = (fb_info*)faad_malloc(sizeof(fb_info));
57 memset(fb, 0, sizeof(fb_info));
60 fb->mdct256 = faad_mdct_init(2*nshort);
61 fb->mdct2048 = faad_mdct_init(2*frame_len);
64 fb->mdct1024 = faad_mdct_init(2*frame_len_ld);
67 #ifdef ALLOW_SMALL_FRAMELENGTH
68 if (frame_len == 1024)
71 fb->long_window[0] = sine_long_1024;
72 fb->short_window[0] = sine_short_128;
73 fb->long_window[1] = kbd_long_1024;
74 fb->short_window[1] = kbd_short_128;
76 fb->ld_window[0] = sine_mid_512;
77 fb->ld_window[1] = ld_mid_512;
79 #ifdef ALLOW_SMALL_FRAMELENGTH
80 } else /* (frame_len == 960) */ {
81 fb->long_window[0] = sine_long_960;
82 fb->short_window[0] = sine_short_120;
83 fb->long_window[1] = kbd_long_960;
84 fb->short_window[1] = kbd_short_120;
86 fb->ld_window[0] = sine_mid_480;
87 fb->ld_window[1] = ld_mid_480;
95 void filter_bank_end(fb_info *fb)
100 printf("FB: %I64d cycles\n", fb->cycles);
103 faad_mdct_end(fb->mdct256);
104 faad_mdct_end(fb->mdct2048);
106 faad_mdct_end(fb->mdct1024);
113 static INLINE void imdct_long(fb_info *fb, real_t *in_data, real_t *out_data, uint16_t len)
116 mdct_info *mdct = NULL;
130 faad_imdct(mdct, in_data, out_data);
132 faad_imdct(fb->mdct2048, in_data, out_data);
138 static INLINE void mdct(fb_info *fb, real_t *in_data, real_t *out_data, uint16_t len)
140 mdct_info *mdct = NULL;
160 faad_mdct(mdct, in_data, out_data);
164 void ifilter_bank(fb_info *fb, uint8_t window_sequence, uint8_t window_shape,
165 uint8_t window_shape_prev, real_t *freq_in,
166 real_t *time_out, real_t *overlap,
167 uint8_t object_type, uint16_t frame_len)
170 ALIGN real_t transf_buf[2*1024] = {0};
172 const real_t *window_long = NULL;
173 const real_t *window_long_prev = NULL;
174 const real_t *window_short = NULL;
175 const real_t *window_short_prev = NULL;
177 uint16_t nlong = frame_len;
178 uint16_t nshort = frame_len/8;
179 uint16_t trans = nshort/2;
181 uint16_t nflat_ls = (nlong-nshort)/2;
184 int64_t count = faad_get_ts();
187 /* select windows of current frame and previous frame (Sine or KBD) */
189 if (object_type == LD)
191 window_long = fb->ld_window[window_shape];
192 window_long_prev = fb->ld_window[window_shape_prev];
195 window_long = fb->long_window[window_shape];
196 window_long_prev = fb->long_window[window_shape_prev];
197 window_short = fb->short_window[window_shape];
198 window_short_prev = fb->short_window[window_shape_prev];
204 for (i = 0; i < 1024; i++)
206 printf("%d\n", freq_in[i]);
211 printf("%d %d\n", window_sequence, window_shape);
214 switch (window_sequence)
216 case ONLY_LONG_SEQUENCE:
218 imdct_long(fb, freq_in, transf_buf, 2*nlong);
220 /* add second half output of previous frame to windowed output of current frame */
221 for (i = 0; i < nlong; i+=4)
223 time_out[i] = overlap[i] + MUL_F(transf_buf[i],window_long_prev[i]);
224 time_out[i+1] = overlap[i+1] + MUL_F(transf_buf[i+1],window_long_prev[i+1]);
225 time_out[i+2] = overlap[i+2] + MUL_F(transf_buf[i+2],window_long_prev[i+2]);
226 time_out[i+3] = overlap[i+3] + MUL_F(transf_buf[i+3],window_long_prev[i+3]);
229 /* window the second half and save as overlap for next frame */
230 for (i = 0; i < nlong; i+=4)
232 overlap[i] = MUL_F(transf_buf[nlong+i],window_long[nlong-1-i]);
233 overlap[i+1] = MUL_F(transf_buf[nlong+i+1],window_long[nlong-2-i]);
234 overlap[i+2] = MUL_F(transf_buf[nlong+i+2],window_long[nlong-3-i]);
235 overlap[i+3] = MUL_F(transf_buf[nlong+i+3],window_long[nlong-4-i]);
239 case LONG_START_SEQUENCE:
241 imdct_long(fb, freq_in, transf_buf, 2*nlong);
243 /* add second half output of previous frame to windowed output of current frame */
244 for (i = 0; i < nlong; i+=4)
246 time_out[i] = overlap[i] + MUL_F(transf_buf[i],window_long_prev[i]);
247 time_out[i+1] = overlap[i+1] + MUL_F(transf_buf[i+1],window_long_prev[i+1]);
248 time_out[i+2] = overlap[i+2] + MUL_F(transf_buf[i+2],window_long_prev[i+2]);
249 time_out[i+3] = overlap[i+3] + MUL_F(transf_buf[i+3],window_long_prev[i+3]);
252 /* window the second half and save as overlap for next frame */
253 /* construct second half window using padding with 1's and 0's */
254 for (i = 0; i < nflat_ls; i++)
255 overlap[i] = transf_buf[nlong+i];
256 for (i = 0; i < nshort; i++)
257 overlap[nflat_ls+i] = MUL_F(transf_buf[nlong+nflat_ls+i],window_short[nshort-i-1]);
258 for (i = 0; i < nflat_ls; i++)
259 overlap[nflat_ls+nshort+i] = 0;
262 case EIGHT_SHORT_SEQUENCE:
263 /* perform iMDCT for each short block */
264 faad_imdct(fb->mdct256, freq_in+0*nshort, transf_buf+2*nshort*0);
265 faad_imdct(fb->mdct256, freq_in+1*nshort, transf_buf+2*nshort*1);
266 faad_imdct(fb->mdct256, freq_in+2*nshort, transf_buf+2*nshort*2);
267 faad_imdct(fb->mdct256, freq_in+3*nshort, transf_buf+2*nshort*3);
268 faad_imdct(fb->mdct256, freq_in+4*nshort, transf_buf+2*nshort*4);
269 faad_imdct(fb->mdct256, freq_in+5*nshort, transf_buf+2*nshort*5);
270 faad_imdct(fb->mdct256, freq_in+6*nshort, transf_buf+2*nshort*6);
271 faad_imdct(fb->mdct256, freq_in+7*nshort, transf_buf+2*nshort*7);
273 /* add second half output of previous frame to windowed output of current frame */
274 for (i = 0; i < nflat_ls; i++)
275 time_out[i] = overlap[i];
276 for(i = 0; i < nshort; i++)
278 time_out[nflat_ls+ i] = overlap[nflat_ls+ i] + MUL_F(transf_buf[nshort*0+i],window_short_prev[i]);
279 time_out[nflat_ls+1*nshort+i] = overlap[nflat_ls+nshort*1+i] + MUL_F(transf_buf[nshort*1+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*2+i],window_short[i]);
280 time_out[nflat_ls+2*nshort+i] = overlap[nflat_ls+nshort*2+i] + MUL_F(transf_buf[nshort*3+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*4+i],window_short[i]);
281 time_out[nflat_ls+3*nshort+i] = overlap[nflat_ls+nshort*3+i] + MUL_F(transf_buf[nshort*5+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*6+i],window_short[i]);
283 time_out[nflat_ls+4*nshort+i] = overlap[nflat_ls+nshort*4+i] + MUL_F(transf_buf[nshort*7+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*8+i],window_short[i]);
286 /* window the second half and save as overlap for next frame */
287 for(i = 0; i < nshort; i++)
290 overlap[nflat_ls+4*nshort+i-nlong] = MUL_F(transf_buf[nshort*7+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*8+i],window_short[i]);
291 overlap[nflat_ls+5*nshort+i-nlong] = MUL_F(transf_buf[nshort*9+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*10+i],window_short[i]);
292 overlap[nflat_ls+6*nshort+i-nlong] = MUL_F(transf_buf[nshort*11+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*12+i],window_short[i]);
293 overlap[nflat_ls+7*nshort+i-nlong] = MUL_F(transf_buf[nshort*13+i],window_short[nshort-1-i]) + MUL_F(transf_buf[nshort*14+i],window_short[i]);
294 overlap[nflat_ls+8*nshort+i-nlong] = MUL_F(transf_buf[nshort*15+i],window_short[nshort-1-i]);
296 for (i = 0; i < nflat_ls; i++)
297 overlap[nflat_ls+nshort+i] = 0;
300 case LONG_STOP_SEQUENCE:
302 imdct_long(fb, freq_in, transf_buf, 2*nlong);
304 /* add second half output of previous frame to windowed output of current frame */
305 /* construct first half window using padding with 1's and 0's */
306 for (i = 0; i < nflat_ls; i++)
307 time_out[i] = overlap[i];
308 for (i = 0; i < nshort; i++)
309 time_out[nflat_ls+i] = overlap[nflat_ls+i] + MUL_F(transf_buf[nflat_ls+i],window_short_prev[i]);
310 for (i = 0; i < nflat_ls; i++)
311 time_out[nflat_ls+nshort+i] = overlap[nflat_ls+nshort+i] + transf_buf[nflat_ls+nshort+i];
313 /* window the second half and save as overlap for next frame */
314 for (i = 0; i < nlong; i++)
315 overlap[i] = MUL_F(transf_buf[nlong+i],window_long[nlong-1-i]);
320 for (i = 0; i < 1024; i++)
322 printf("%d\n", time_out[i]);
323 //printf("0x%.8X\n", time_out[i]);
329 count = faad_get_ts() - count;
336 /* only works for LTP -> no overlapping, no short blocks */
337 void filter_bank_ltp(fb_info *fb, uint8_t window_sequence, uint8_t window_shape,
338 uint8_t window_shape_prev, real_t *in_data, real_t *out_mdct,
339 uint8_t object_type, uint16_t frame_len)
342 ALIGN real_t windowed_buf[2*1024] = {0};
344 const real_t *window_long = NULL;
345 const real_t *window_long_prev = NULL;
346 const real_t *window_short = NULL;
347 const real_t *window_short_prev = NULL;
349 uint16_t nlong = frame_len;
350 uint16_t nshort = frame_len/8;
351 uint16_t nflat_ls = (nlong-nshort)/2;
353 assert(window_sequence != EIGHT_SHORT_SEQUENCE);
356 if (object_type == LD)
358 window_long = fb->ld_window[window_shape];
359 window_long_prev = fb->ld_window[window_shape_prev];
362 window_long = fb->long_window[window_shape];
363 window_long_prev = fb->long_window[window_shape_prev];
364 window_short = fb->short_window[window_shape];
365 window_short_prev = fb->short_window[window_shape_prev];
370 switch(window_sequence)
372 case ONLY_LONG_SEQUENCE:
373 for (i = nlong-1; i >= 0; i--)
375 windowed_buf[i] = MUL_F(in_data[i], window_long_prev[i]);
376 windowed_buf[i+nlong] = MUL_F(in_data[i+nlong], window_long[nlong-1-i]);
378 mdct(fb, windowed_buf, out_mdct, 2*nlong);
381 case LONG_START_SEQUENCE:
382 for (i = 0; i < nlong; i++)
383 windowed_buf[i] = MUL_F(in_data[i], window_long_prev[i]);
384 for (i = 0; i < nflat_ls; i++)
385 windowed_buf[i+nlong] = in_data[i+nlong];
386 for (i = 0; i < nshort; i++)
387 windowed_buf[i+nlong+nflat_ls] = MUL_F(in_data[i+nlong+nflat_ls], window_short[nshort-1-i]);
388 for (i = 0; i < nflat_ls; i++)
389 windowed_buf[i+nlong+nflat_ls+nshort] = 0;
390 mdct(fb, windowed_buf, out_mdct, 2*nlong);
393 case LONG_STOP_SEQUENCE:
394 for (i = 0; i < nflat_ls; i++)
396 for (i = 0; i < nshort; i++)
397 windowed_buf[i+nflat_ls] = MUL_F(in_data[i+nflat_ls], window_short_prev[i]);
398 for (i = 0; i < nflat_ls; i++)
399 windowed_buf[i+nflat_ls+nshort] = in_data[i+nflat_ls+nshort];
400 for (i = 0; i < nlong; i++)
401 windowed_buf[i+nlong] = MUL_F(in_data[i+nlong], window_long[nlong-1-i]);
402 mdct(fb, windowed_buf, out_mdct, 2*nlong);