mdct.c 5.22 KB
Newer Older
1 2
/*
 * MDCT/IMDCT transforms
3
 * Copyright (c) 2002 Fabrice Bellard
4
 *
5
 * This file is part of Libav.
6
 *
7
 * Libav is free software; you can redistribute it and/or
8 9
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
10
 * version 2.1 of the License, or (at your option) any later version.
11
 *
12
 * Libav is distributed in the hope that it will be useful,
13 14 15 16 17
 * 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
18
 * License along with Libav; if not, write to the Free Software
19
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20
 */
21

22 23 24
#include <stdlib.h>
#include <string.h>
#include "libavutil/common.h"
25 26
#include "libavutil/mathematics.h"
#include "fft.h"
27

Michael Niedermayer's avatar
Michael Niedermayer committed
28
/**
29
 * @file
Michael Niedermayer's avatar
Michael Niedermayer committed
30 31 32 33 34
 * MDCT/IMDCT transforms.
 */

/**
 * init MDCT or IMDCT computation.
35
 */
36
av_cold int ff_mdct_init(FFTContext *s, int nbits, int inverse, double scale)
37 38
{
    int n, n4, i;
39
    double alpha, theta;
40
    int tstep;
41 42 43

    memset(s, 0, sizeof(*s));
    n = 1 << nbits;
44 45
    s->mdct_bits = nbits;
    s->mdct_size = n;
46
    n4 = n >> 2;
47
    s->mdct_permutation = FF_MDCT_PERM_NONE;
48 49 50 51 52

    if (ff_fft_init(s, s->mdct_bits - 2, inverse) < 0)
        goto fail;

    s->tcos = av_malloc(n/2 * sizeof(FFTSample));
53 54
    if (!s->tcos)
        goto fail;
55

56
    switch (s->mdct_permutation) {
57 58 59 60 61 62 63 64 65
    case FF_MDCT_PERM_NONE:
        s->tsin = s->tcos + n4;
        tstep = 1;
        break;
    case FF_MDCT_PERM_INTERLEAVE:
        s->tsin = s->tcos + 1;
        tstep = 2;
        break;
    default:
66
        goto fail;
67
    }
68

69 70
    theta = 1.0 / 8.0 + (scale < 0 ? n4 : 0);
    scale = sqrt(fabs(scale));
71
    for(i=0;i<n4;i++) {
72
        alpha = 2 * M_PI * (i + theta) / n;
73 74
        s->tcos[i*tstep] = -cos(alpha) * scale;
        s->tsin[i*tstep] = -sin(alpha) * scale;
75 76 77
    }
    return 0;
 fail:
78
    ff_mdct_end(s);
79 80 81 82 83 84
    return -1;
}

/* complex multiplication: p = a * b */
#define CMUL(pre, pim, are, aim, bre, bim) \
{\
85 86 87 88
    FFTSample _are = (are);\
    FFTSample _aim = (aim);\
    FFTSample _bre = (bre);\
    FFTSample _bim = (bim);\
89 90 91 92
    (pre) = _are * _bre - _aim * _bim;\
    (pim) = _are * _bim + _aim * _bre;\
}

Loren Merritt's avatar
Loren Merritt committed
93 94 95 96 97 98
/**
 * 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
 */
99
void ff_imdct_half_c(FFTContext *s, FFTSample *output, const FFTSample *input)
100
{
Loren Merritt's avatar
Loren Merritt committed
101
    int k, n8, n4, n2, n, j;
102
    const uint16_t *revtab = s->revtab;
103 104 105
    const FFTSample *tcos = s->tcos;
    const FFTSample *tsin = s->tsin;
    const FFTSample *in1, *in2;
Loren Merritt's avatar
Loren Merritt committed
106
    FFTComplex *z = (FFTComplex *)output;
107

108
    n = 1 << s->mdct_bits;
109 110
    n2 = n >> 1;
    n4 = n >> 2;
Loren Merritt's avatar
Loren Merritt committed
111
    n8 = n >> 3;
112 113 114 115 116 117 118 119 120 121

    /* 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;
    }
122
    s->fft_calc(s, z);
123 124

    /* post rotation + reordering */
Loren Merritt's avatar
Loren Merritt committed
125 126 127 128 129 130 131 132
    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;
133
    }
Loren Merritt's avatar
Loren Merritt committed
134 135 136 137 138 139 140
}

/**
 * Compute inverse MDCT of size N = 2^nbits
 * @param output N samples
 * @param input N/2 samples
 */
141
void ff_imdct_calc_c(FFTContext *s, FFTSample *output, const FFTSample *input)
Loren Merritt's avatar
Loren Merritt committed
142
{
Loren Merritt's avatar
Loren Merritt committed
143
    int k;
144
    int n = 1 << s->mdct_bits;
Loren Merritt's avatar
Loren Merritt committed
145 146
    int n2 = n >> 1;
    int n4 = n >> 2;
147

148
    ff_imdct_half_c(s, output+n4, input);
149

Loren Merritt's avatar
Loren Merritt committed
150 151 152
    for(k = 0; k < n4; k++) {
        output[k] = -output[n2-k-1];
        output[n-k-1] = output[n2+k];
Loren Merritt's avatar
Loren Merritt committed
153 154 155
    }
}

156 157 158 159 160
/**
 * Compute MDCT of size N = 2^nbits
 * @param input N samples
 * @param out N/2 samples
 */
161
void ff_mdct_calc_c(FFTContext *s, FFTSample *out, const FFTSample *input)
162 163
{
    int i, j, n, n8, n4, n2, n3;
Loren Merritt's avatar
Loren Merritt committed
164
    FFTSample re, im;
165
    const uint16_t *revtab = s->revtab;
166 167
    const FFTSample *tcos = s->tcos;
    const FFTSample *tsin = s->tsin;
Loren Merritt's avatar
Loren Merritt committed
168
    FFTComplex *x = (FFTComplex *)out;
169

170
    n = 1 << s->mdct_bits;
171 172 173 174 175 176 177
    n2 = n >> 1;
    n4 = n >> 2;
    n8 = n >> 3;
    n3 = 3 * n4;

    /* pre rotation */
    for(i=0;i<n8;i++) {
178
        re = -input[2*i+n3] - input[n3-1-2*i];
179 180 181 182 183 184 185 186 187 188
        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]);
    }

189
    s->fft_calc(s, x);
190

191
    /* post rotation */
Loren Merritt's avatar
Loren Merritt committed
192 193 194 195 196 197 198 199
    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;
200 201 202
    }
}

203
av_cold void ff_mdct_end(FFTContext *s)
204 205
{
    av_freep(&s->tcos);
206
    ff_fft_end(s);
207
}