00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021 #include "dsputil.h"
00022
00031 int ff_mdct_init(MDCTContext *s, int nbits, int inverse)
00032 {
00033 int n, n4, i;
00034 float alpha;
00035
00036 memset(s, 0, sizeof(*s));
00037 n = 1 << nbits;
00038 s->nbits = nbits;
00039 s->n = n;
00040 n4 = n >> 2;
00041 s->tcos = av_malloc(n4 * sizeof(FFTSample));
00042 if (!s->tcos)
00043 goto fail;
00044 s->tsin = av_malloc(n4 * sizeof(FFTSample));
00045 if (!s->tsin)
00046 goto fail;
00047
00048 for(i=0;i<n4;i++) {
00049 alpha = 2 * M_PI * (i + 1.0 / 8.0) / n;
00050 s->tcos[i] = -cos(alpha);
00051 s->tsin[i] = -sin(alpha);
00052 }
00053 if (ff_fft_init(&s->fft, s->nbits - 2, inverse) < 0)
00054 goto fail;
00055 return 0;
00056 fail:
00057 av_freep(&s->tcos);
00058 av_freep(&s->tsin);
00059 return -1;
00060 }
00061
00062
00063 #define CMUL(pre, pim, are, aim, bre, bim) \
00064 {\
00065 float _are = (are);\
00066 float _aim = (aim);\
00067 float _bre = (bre);\
00068 float _bim = (bim);\
00069 (pre) = _are * _bre - _aim * _bim;\
00070 (pim) = _are * _bim + _aim * _bre;\
00071 }
00072
00079 void ff_imdct_calc(MDCTContext *s, FFTSample *output,
00080 const FFTSample *input, FFTSample *tmp)
00081 {
00082 int k, n8, n4, n2, n, j;
00083 const uint16_t *revtab = s->fft.revtab;
00084 const FFTSample *tcos = s->tcos;
00085 const FFTSample *tsin = s->tsin;
00086 const FFTSample *in1, *in2;
00087 FFTComplex *z = (FFTComplex *)tmp;
00088
00089 n = 1 << s->nbits;
00090 n2 = n >> 1;
00091 n4 = n >> 2;
00092 n8 = n >> 3;
00093
00094
00095 in1 = input;
00096 in2 = input + n2 - 1;
00097 for(k = 0; k < n4; k++) {
00098 j=revtab[k];
00099 CMUL(z[j].re, z[j].im, *in2, *in1, tcos[k], tsin[k]);
00100 in1 += 2;
00101 in2 -= 2;
00102 }
00103 ff_fft_calc(&s->fft, z);
00104
00105
00106
00107 for(k = 0; k < n4; k++) {
00108 CMUL(z[k].re, z[k].im, z[k].re, z[k].im, tcos[k], tsin[k]);
00109 }
00110 for(k = 0; k < n8; k++) {
00111 output[2*k] = -z[n8 + k].im;
00112 output[n2-1-2*k] = z[n8 + k].im;
00113
00114 output[2*k+1] = z[n8-1-k].re;
00115 output[n2-1-2*k-1] = -z[n8-1-k].re;
00116
00117 output[n2 + 2*k]=-z[k+n8].re;
00118 output[n-1- 2*k]=-z[k+n8].re;
00119
00120 output[n2 + 2*k+1]=z[n8-k-1].im;
00121 output[n-2 - 2 * k] = z[n8-k-1].im;
00122 }
00123 }
00124
00131 void ff_mdct_calc(MDCTContext *s, FFTSample *out,
00132 const FFTSample *input, FFTSample *tmp)
00133 {
00134 int i, j, n, n8, n4, n2, n3;
00135 FFTSample re, im, re1, im1;
00136 const uint16_t *revtab = s->fft.revtab;
00137 const FFTSample *tcos = s->tcos;
00138 const FFTSample *tsin = s->tsin;
00139 FFTComplex *x = (FFTComplex *)tmp;
00140
00141 n = 1 << s->nbits;
00142 n2 = n >> 1;
00143 n4 = n >> 2;
00144 n8 = n >> 3;
00145 n3 = 3 * n4;
00146
00147
00148 for(i=0;i<n8;i++) {
00149 re = -input[2*i+3*n4] - input[n3-1-2*i];
00150 im = -input[n4+2*i] + input[n4-1-2*i];
00151 j = revtab[i];
00152 CMUL(x[j].re, x[j].im, re, im, -tcos[i], tsin[i]);
00153
00154 re = input[2*i] - input[n2-1-2*i];
00155 im = -(input[n2+2*i] + input[n-1-2*i]);
00156 j = revtab[n8 + i];
00157 CMUL(x[j].re, x[j].im, re, im, -tcos[n8 + i], tsin[n8 + i]);
00158 }
00159
00160 ff_fft_calc(&s->fft, x);
00161
00162
00163 for(i=0;i<n4;i++) {
00164 re = x[i].re;
00165 im = x[i].im;
00166 CMUL(re1, im1, re, im, -tsin[i], -tcos[i]);
00167 out[2*i] = im1;
00168 out[n2-1-2*i] = re1;
00169 }
00170 }
00171
00172 void ff_mdct_end(MDCTContext *s)
00173 {
00174 av_freep(&s->tcos);
00175 av_freep(&s->tsin);
00176 ff_fft_end(&s->fft);
00177 }