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