libavcodec/mdct.c
bb6f5690
 /*
  * MDCT/IMDCT transforms
406792e7
  * Copyright (c) 2002 Fabrice Bellard
bb6f5690
  *
b78e7197
  * This file is part of FFmpeg.
  *
  * FFmpeg is free software; you can redistribute it and/or
bb6f5690
  * modify it under the terms of the GNU Lesser General Public
  * License as published by the Free Software Foundation; either
b78e7197
  * version 2.1 of the License, or (at your option) any later version.
bb6f5690
  *
b78e7197
  * FFmpeg is distributed in the hope that it will be useful,
bb6f5690
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  * Lesser General Public License for more details.
  *
  * You should have received a copy of the GNU Lesser General Public
b78e7197
  * License along with FFmpeg; if not, write to the Free Software
5509bffa
  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
bb6f5690
  */
 #include "dsputil.h"
 
983e3246
 /**
bad5537e
  * @file libavcodec/mdct.c
983e3246
  * MDCT/IMDCT transforms.
  */
 
4eb7a735
 // Generate a Kaiser-Bessel Derived Window.
3ed546fe
 #define BESSEL_I0_ITER 50 // default: 50 iterations of Bessel I0 approximation
5363c43e
 av_cold void ff_kbd_window_init(float *window, float alpha, int n)
4eb7a735
 {
    int i, j;
    double sum = 0.0, bessel, tmp;
3ed546fe
    double local_window[n];
    double alpha2 = (alpha * M_PI / n) * (alpha * M_PI / n);
4eb7a735
 
3ed546fe
    for (i = 0; i < n; i++) {
        tmp = i * (n - i) * alpha2;
4eb7a735
        bessel = 1.0;
3ed546fe
        for (j = BESSEL_I0_ITER; j > 0; j--)
4eb7a735
            bessel = bessel * tmp / (j * j) + 1;
        sum += bessel;
        local_window[i] = sum;
    }
 
    sum++;
3ed546fe
    for (i = 0; i < n; i++)
4eb7a735
        window[i] = sqrt(local_window[i] / sum);
 }
 
47698b83
 DECLARE_ALIGNED(16, float, ff_sine_128 [ 128]);
 DECLARE_ALIGNED(16, float, ff_sine_256 [ 256]);
 DECLARE_ALIGNED(16, float, ff_sine_512 [ 512]);
 DECLARE_ALIGNED(16, float, ff_sine_1024[1024]);
 DECLARE_ALIGNED(16, float, ff_sine_2048[2048]);
336c2ca5
 DECLARE_ALIGNED(16, float, ff_sine_4096[4096]);
 float *ff_sine_windows[6] = {
     ff_sine_128, ff_sine_256, ff_sine_512, ff_sine_1024, ff_sine_2048, ff_sine_4096
69fc4da3
 };
 
9146e4d6
 // Generate a sine window.
5363c43e
 av_cold void ff_sine_window_init(float *window, int n) {
9146e4d6
     int i;
     for(i = 0; i < n; i++)
71375e05
         window[i] = sinf((i + 0.5) * (M_PI / (2.0 * n)));
9146e4d6
 }
 
983e3246
 /**
  * init MDCT or IMDCT computation.
bb6f5690
  */
5363c43e
 av_cold int ff_mdct_init(MDCTContext *s, int nbits, int inverse)
bb6f5690
 {
     int n, n4, i;
77f11d8a
     double alpha;
bb6f5690
 
     memset(s, 0, sizeof(*s));
     n = 1 << nbits;
     s->nbits = nbits;
     s->n = n;
     n4 = n >> 2;
d9823692
     s->tcos = av_malloc(n4 * sizeof(FFTSample));
bb6f5690
     if (!s->tcos)
         goto fail;
d9823692
     s->tsin = av_malloc(n4 * sizeof(FFTSample));
bb6f5690
     if (!s->tsin)
         goto fail;
 
     for(i=0;i<n4;i++) {
         alpha = 2 * M_PI * (i + 1.0 / 8.0) / n;
         s->tcos[i] = -cos(alpha);
         s->tsin[i] = -sin(alpha);
     }
68951ecf
     if (ff_fft_init(&s->fft, s->nbits - 2, inverse) < 0)
bb6f5690
         goto fail;
     return 0;
  fail:
     av_freep(&s->tcos);
     av_freep(&s->tsin);
     return -1;
 }
 
 /* complex multiplication: p = a * b */
 #define CMUL(pre, pim, are, aim, bre, bim) \
 {\
e8dd7b0c
     FFTSample _are = (are);\
     FFTSample _aim = (aim);\
     FFTSample _bre = (bre);\
     FFTSample _bim = (bim);\
bb6f5690
     (pre) = _are * _bre - _aim * _bim;\
     (pim) = _are * _bim + _aim * _bre;\
 }
 
46803f4f
 /**
  * Compute the middle half of the inverse MDCT of size N = 2^nbits,
  * thus excluding the parts that can be derived by symmetry
  * @param output N/2 samples
  * @param input N/2 samples
  */
d46ac5bf
 void ff_imdct_half_c(MDCTContext *s, FFTSample *output, const FFTSample *input)
bb6f5690
 {
46803f4f
     int k, n8, n4, n2, n, j;
bb6f5690
     const uint16_t *revtab = s->fft.revtab;
     const FFTSample *tcos = s->tcos;
     const FFTSample *tsin = s->tsin;
     const FFTSample *in1, *in2;
46803f4f
     FFTComplex *z = (FFTComplex *)output;
bb6f5690
 
     n = 1 << s->nbits;
     n2 = n >> 1;
     n4 = n >> 2;
46803f4f
     n8 = n >> 3;
bb6f5690
 
     /* pre rotation */
     in1 = input;
     in2 = input + n2 - 1;
     for(k = 0; k < n4; k++) {
         j=revtab[k];
         CMUL(z[j].re, z[j].im, *in2, *in1, tcos[k], tsin[k]);
         in1 += 2;
         in2 -= 2;
     }
68951ecf
     ff_fft_calc(&s->fft, z);
bb6f5690
 
     /* post rotation + reordering */
46803f4f
     output += n4;
     for(k = 0; k < n8; k++) {
         FFTSample r0, i0, r1, i1;
         CMUL(r0, i1, z[n8-k-1].im, z[n8-k-1].re, tsin[n8-k-1], tcos[n8-k-1]);
         CMUL(r1, i0, z[n8+k  ].im, z[n8+k  ].re, tsin[n8+k  ], tcos[n8+k  ]);
         z[n8-k-1].re = r0;
         z[n8-k-1].im = i0;
         z[n8+k  ].re = r1;
         z[n8+k  ].im = i1;
bb6f5690
     }
b9fa3208
 }
 
 /**
  * Compute inverse MDCT of size N = 2^nbits
  * @param output N samples
  * @param input N/2 samples
  */
d46ac5bf
 void ff_imdct_calc_c(MDCTContext *s, FFTSample *output, const FFTSample *input)
b9fa3208
 {
46803f4f
     int k;
     int n = 1 << s->nbits;
     int n2 = n >> 1;
     int n4 = n >> 2;
bb6f5690
 
d46ac5bf
     ff_imdct_half_c(s, output+n4, input);
bb6f5690
 
46803f4f
     for(k = 0; k < n4; k++) {
         output[k] = -output[n2-k-1];
         output[n-k-1] = output[n2+k];
b9fa3208
     }
 }
 
 /**
bb6f5690
  * Compute MDCT of size N = 2^nbits
  * @param input N samples
  * @param out N/2 samples
  */
0a570e82
 void ff_mdct_calc(MDCTContext *s, FFTSample *out, const FFTSample *input)
bb6f5690
 {
     int i, j, n, n8, n4, n2, n3;
0a570e82
     FFTSample re, im;
bb6f5690
     const uint16_t *revtab = s->fft.revtab;
     const FFTSample *tcos = s->tcos;
     const FFTSample *tsin = s->tsin;
46803f4f
     FFTComplex *x = (FFTComplex *)out;
bb6f5690
 
     n = 1 << s->nbits;
     n2 = n >> 1;
     n4 = n >> 2;
     n8 = n >> 3;
     n3 = 3 * n4;
 
     /* pre rotation */
     for(i=0;i<n8;i++) {
         re = -input[2*i+3*n4] - input[n3-1-2*i];
         im = -input[n4+2*i] + input[n4-1-2*i];
         j = revtab[i];
         CMUL(x[j].re, x[j].im, re, im, -tcos[i], tsin[i]);
 
         re = input[2*i] - input[n2-1-2*i];
         im = -(input[n2+2*i] + input[n-1-2*i]);
         j = revtab[n8 + i];
         CMUL(x[j].re, x[j].im, re, im, -tcos[n8 + i], tsin[n8 + i]);
     }
 
68951ecf
     ff_fft_calc(&s->fft, x);
115329f1
 
bb6f5690
     /* post rotation */
46803f4f
     for(i=0;i<n8;i++) {
         FFTSample r0, i0, r1, i1;
         CMUL(i1, r0, x[n8-i-1].re, x[n8-i-1].im, -tsin[n8-i-1], -tcos[n8-i-1]);
         CMUL(i0, r1, x[n8+i  ].re, x[n8+i  ].im, -tsin[n8+i  ], -tcos[n8+i  ]);
         x[n8-i-1].re = r0;
         x[n8-i-1].im = i0;
         x[n8+i  ].re = r1;
         x[n8+i  ].im = i1;
bb6f5690
     }
 }
 
5363c43e
 av_cold void ff_mdct_end(MDCTContext *s)
bb6f5690
 {
     av_freep(&s->tcos);
     av_freep(&s->tsin);
68951ecf
     ff_fft_end(&s->fft);
bb6f5690
 }