annotate ffmpeg/libavcodec/dct.c @ 13:844d341cf643 tip

Back up before ISMIR
author Yading Song <yading.song@eecs.qmul.ac.uk>
date Thu, 31 Oct 2013 13:17:06 +0000
parents 6840f77b83aa
children
rev   line source
yading@10 1 /*
yading@10 2 * (I)DCT Transforms
yading@10 3 * Copyright (c) 2009 Peter Ross <pross@xvid.org>
yading@10 4 * Copyright (c) 2010 Alex Converse <alex.converse@gmail.com>
yading@10 5 * Copyright (c) 2010 Vitor Sessak
yading@10 6 *
yading@10 7 * This file is part of FFmpeg.
yading@10 8 *
yading@10 9 * FFmpeg is free software; you can redistribute it and/or
yading@10 10 * modify it under the terms of the GNU Lesser General Public
yading@10 11 * License as published by the Free Software Foundation; either
yading@10 12 * version 2.1 of the License, or (at your option) any later version.
yading@10 13 *
yading@10 14 * FFmpeg is distributed in the hope that it will be useful,
yading@10 15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
yading@10 16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
yading@10 17 * Lesser General Public License for more details.
yading@10 18 *
yading@10 19 * You should have received a copy of the GNU Lesser General Public
yading@10 20 * License along with FFmpeg; if not, write to the Free Software
yading@10 21 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
yading@10 22 */
yading@10 23
yading@10 24 /**
yading@10 25 * @file
yading@10 26 * (Inverse) Discrete Cosine Transforms. These are also known as the
yading@10 27 * type II and type III DCTs respectively.
yading@10 28 */
yading@10 29
yading@10 30 #include <math.h>
yading@10 31 #include <string.h>
yading@10 32
yading@10 33 #include "libavutil/mathematics.h"
yading@10 34 #include "dct.h"
yading@10 35 #include "dct32.h"
yading@10 36
yading@10 37 /* sin((M_PI * x / (2 * n)) */
yading@10 38 #define SIN(s, n, x) (s->costab[(n) - (x)])
yading@10 39
yading@10 40 /* cos((M_PI * x / (2 * n)) */
yading@10 41 #define COS(s, n, x) (s->costab[x])
yading@10 42
yading@10 43 static void ff_dst_calc_I_c(DCTContext *ctx, FFTSample *data)
yading@10 44 {
yading@10 45 int n = 1 << ctx->nbits;
yading@10 46 int i;
yading@10 47
yading@10 48 data[0] = 0;
yading@10 49 for (i = 1; i < n / 2; i++) {
yading@10 50 float tmp1 = data[i ];
yading@10 51 float tmp2 = data[n - i];
yading@10 52 float s = SIN(ctx, n, 2 * i);
yading@10 53
yading@10 54 s *= tmp1 + tmp2;
yading@10 55 tmp1 = (tmp1 - tmp2) * 0.5f;
yading@10 56 data[i] = s + tmp1;
yading@10 57 data[n - i] = s - tmp1;
yading@10 58 }
yading@10 59
yading@10 60 data[n / 2] *= 2;
yading@10 61 ctx->rdft.rdft_calc(&ctx->rdft, data);
yading@10 62
yading@10 63 data[0] *= 0.5f;
yading@10 64
yading@10 65 for (i = 1; i < n - 2; i += 2) {
yading@10 66 data[i + 1] += data[i - 1];
yading@10 67 data[i] = -data[i + 2];
yading@10 68 }
yading@10 69
yading@10 70 data[n - 1] = 0;
yading@10 71 }
yading@10 72
yading@10 73 static void ff_dct_calc_I_c(DCTContext *ctx, FFTSample *data)
yading@10 74 {
yading@10 75 int n = 1 << ctx->nbits;
yading@10 76 int i;
yading@10 77 float next = -0.5f * (data[0] - data[n]);
yading@10 78
yading@10 79 for (i = 0; i < n / 2; i++) {
yading@10 80 float tmp1 = data[i];
yading@10 81 float tmp2 = data[n - i];
yading@10 82 float s = SIN(ctx, n, 2 * i);
yading@10 83 float c = COS(ctx, n, 2 * i);
yading@10 84
yading@10 85 c *= tmp1 - tmp2;
yading@10 86 s *= tmp1 - tmp2;
yading@10 87
yading@10 88 next += c;
yading@10 89
yading@10 90 tmp1 = (tmp1 + tmp2) * 0.5f;
yading@10 91 data[i] = tmp1 - s;
yading@10 92 data[n - i] = tmp1 + s;
yading@10 93 }
yading@10 94
yading@10 95 ctx->rdft.rdft_calc(&ctx->rdft, data);
yading@10 96 data[n] = data[1];
yading@10 97 data[1] = next;
yading@10 98
yading@10 99 for (i = 3; i <= n; i += 2)
yading@10 100 data[i] = data[i - 2] - data[i];
yading@10 101 }
yading@10 102
yading@10 103 static void ff_dct_calc_III_c(DCTContext *ctx, FFTSample *data)
yading@10 104 {
yading@10 105 int n = 1 << ctx->nbits;
yading@10 106 int i;
yading@10 107
yading@10 108 float next = data[n - 1];
yading@10 109 float inv_n = 1.0f / n;
yading@10 110
yading@10 111 for (i = n - 2; i >= 2; i -= 2) {
yading@10 112 float val1 = data[i];
yading@10 113 float val2 = data[i - 1] - data[i + 1];
yading@10 114 float c = COS(ctx, n, i);
yading@10 115 float s = SIN(ctx, n, i);
yading@10 116
yading@10 117 data[i] = c * val1 + s * val2;
yading@10 118 data[i + 1] = s * val1 - c * val2;
yading@10 119 }
yading@10 120
yading@10 121 data[1] = 2 * next;
yading@10 122
yading@10 123 ctx->rdft.rdft_calc(&ctx->rdft, data);
yading@10 124
yading@10 125 for (i = 0; i < n / 2; i++) {
yading@10 126 float tmp1 = data[i] * inv_n;
yading@10 127 float tmp2 = data[n - i - 1] * inv_n;
yading@10 128 float csc = ctx->csc2[i] * (tmp1 - tmp2);
yading@10 129
yading@10 130 tmp1 += tmp2;
yading@10 131 data[i] = tmp1 + csc;
yading@10 132 data[n - i - 1] = tmp1 - csc;
yading@10 133 }
yading@10 134 }
yading@10 135
yading@10 136 static void ff_dct_calc_II_c(DCTContext *ctx, FFTSample *data)
yading@10 137 {
yading@10 138 int n = 1 << ctx->nbits;
yading@10 139 int i;
yading@10 140 float next;
yading@10 141
yading@10 142 for (i = 0; i < n / 2; i++) {
yading@10 143 float tmp1 = data[i];
yading@10 144 float tmp2 = data[n - i - 1];
yading@10 145 float s = SIN(ctx, n, 2 * i + 1);
yading@10 146
yading@10 147 s *= tmp1 - tmp2;
yading@10 148 tmp1 = (tmp1 + tmp2) * 0.5f;
yading@10 149
yading@10 150 data[i] = tmp1 + s;
yading@10 151 data[n-i-1] = tmp1 - s;
yading@10 152 }
yading@10 153
yading@10 154 ctx->rdft.rdft_calc(&ctx->rdft, data);
yading@10 155
yading@10 156 next = data[1] * 0.5;
yading@10 157 data[1] *= -1;
yading@10 158
yading@10 159 for (i = n - 2; i >= 0; i -= 2) {
yading@10 160 float inr = data[i ];
yading@10 161 float ini = data[i + 1];
yading@10 162 float c = COS(ctx, n, i);
yading@10 163 float s = SIN(ctx, n, i);
yading@10 164
yading@10 165 data[i] = c * inr + s * ini;
yading@10 166 data[i + 1] = next;
yading@10 167
yading@10 168 next += s * inr - c * ini;
yading@10 169 }
yading@10 170 }
yading@10 171
yading@10 172 static void dct32_func(DCTContext *ctx, FFTSample *data)
yading@10 173 {
yading@10 174 ctx->dct32(data, data);
yading@10 175 }
yading@10 176
yading@10 177 av_cold int ff_dct_init(DCTContext *s, int nbits, enum DCTTransformType inverse)
yading@10 178 {
yading@10 179 int n = 1 << nbits;
yading@10 180 int i;
yading@10 181
yading@10 182 memset(s, 0, sizeof(*s));
yading@10 183
yading@10 184 s->nbits = nbits;
yading@10 185 s->inverse = inverse;
yading@10 186
yading@10 187 if (inverse == DCT_II && nbits == 5) {
yading@10 188 s->dct_calc = dct32_func;
yading@10 189 } else {
yading@10 190 ff_init_ff_cos_tabs(nbits + 2);
yading@10 191
yading@10 192 s->costab = ff_cos_tabs[nbits + 2];
yading@10 193 s->csc2 = av_malloc(n / 2 * sizeof(FFTSample));
yading@10 194
yading@10 195 if (ff_rdft_init(&s->rdft, nbits, inverse == DCT_III) < 0) {
yading@10 196 av_free(s->csc2);
yading@10 197 return -1;
yading@10 198 }
yading@10 199
yading@10 200 for (i = 0; i < n / 2; i++)
yading@10 201 s->csc2[i] = 0.5 / sin((M_PI / (2 * n) * (2 * i + 1)));
yading@10 202
yading@10 203 switch (inverse) {
yading@10 204 case DCT_I : s->dct_calc = ff_dct_calc_I_c; break;
yading@10 205 case DCT_II : s->dct_calc = ff_dct_calc_II_c; break;
yading@10 206 case DCT_III: s->dct_calc = ff_dct_calc_III_c; break;
yading@10 207 case DST_I : s->dct_calc = ff_dst_calc_I_c; break;
yading@10 208 }
yading@10 209 }
yading@10 210
yading@10 211 s->dct32 = ff_dct32_float;
yading@10 212 if (ARCH_X86)
yading@10 213 ff_dct_init_x86(s);
yading@10 214
yading@10 215 return 0;
yading@10 216 }
yading@10 217
yading@10 218 av_cold void ff_dct_end(DCTContext *s)
yading@10 219 {
yading@10 220 ff_rdft_end(&s->rdft);
yading@10 221 av_free(s->csc2);
yading@10 222 }