1cabdff1aSopenharmony_ci/*
2cabdff1aSopenharmony_ci * reference discrete cosine transform (double precision)
3cabdff1aSopenharmony_ci * Copyright (C) 2009 Dylan Yudaken
4cabdff1aSopenharmony_ci *
5cabdff1aSopenharmony_ci * This file is part of FFmpeg.
6cabdff1aSopenharmony_ci *
7cabdff1aSopenharmony_ci * FFmpeg is free software; you can redistribute it and/or
8cabdff1aSopenharmony_ci * modify it under the terms of the GNU Lesser General Public
9cabdff1aSopenharmony_ci * License as published by the Free Software Foundation; either
10cabdff1aSopenharmony_ci * version 2.1 of the License, or (at your option) any later version.
11cabdff1aSopenharmony_ci *
12cabdff1aSopenharmony_ci * FFmpeg is distributed in the hope that it will be useful,
13cabdff1aSopenharmony_ci * but WITHOUT ANY WARRANTY; without even the implied warranty of
14cabdff1aSopenharmony_ci * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
15cabdff1aSopenharmony_ci * Lesser General Public License for more details.
16cabdff1aSopenharmony_ci *
17cabdff1aSopenharmony_ci * You should have received a copy of the GNU Lesser General Public
18cabdff1aSopenharmony_ci * License along with FFmpeg; if not, write to the Free Software
19cabdff1aSopenharmony_ci * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20cabdff1aSopenharmony_ci */
21cabdff1aSopenharmony_ci
22cabdff1aSopenharmony_ci/**
23cabdff1aSopenharmony_ci * @file
24cabdff1aSopenharmony_ci * reference discrete cosine transform (double precision)
25cabdff1aSopenharmony_ci *
26cabdff1aSopenharmony_ci * @author Dylan Yudaken (dyudaken at gmail)
27cabdff1aSopenharmony_ci *
28cabdff1aSopenharmony_ci * @note This file could be optimized a lot, but is for
29cabdff1aSopenharmony_ci * reference and so readability is better.
30cabdff1aSopenharmony_ci */
31cabdff1aSopenharmony_ci
32cabdff1aSopenharmony_ci#include "libavutil/mathematics.h"
33cabdff1aSopenharmony_ci#include "dctref.h"
34cabdff1aSopenharmony_ci
35cabdff1aSopenharmony_cistatic double coefficients[8 * 8];
36cabdff1aSopenharmony_ci
37cabdff1aSopenharmony_ci/**
38cabdff1aSopenharmony_ci * Initialize the double precision discrete cosine transform
39cabdff1aSopenharmony_ci * functions fdct & idct.
40cabdff1aSopenharmony_ci */
41cabdff1aSopenharmony_ciav_cold void ff_ref_dct_init(void)
42cabdff1aSopenharmony_ci{
43cabdff1aSopenharmony_ci    unsigned int i, j;
44cabdff1aSopenharmony_ci
45cabdff1aSopenharmony_ci    for (j = 0; j < 8; ++j) {
46cabdff1aSopenharmony_ci        coefficients[j] = sqrt(0.125);
47cabdff1aSopenharmony_ci        for (i = 8; i < 64; i += 8) {
48cabdff1aSopenharmony_ci            coefficients[i + j] = 0.5 * cos(i * (j + 0.5) * M_PI / 64.0);
49cabdff1aSopenharmony_ci        }
50cabdff1aSopenharmony_ci    }
51cabdff1aSopenharmony_ci}
52cabdff1aSopenharmony_ci
53cabdff1aSopenharmony_ci/**
54cabdff1aSopenharmony_ci * Transform 8x8 block of data with a double precision forward DCT <br>
55cabdff1aSopenharmony_ci * This is a reference implementation.
56cabdff1aSopenharmony_ci *
57cabdff1aSopenharmony_ci * @param block pointer to 8x8 block of data to transform
58cabdff1aSopenharmony_ci */
59cabdff1aSopenharmony_civoid ff_ref_fdct(short *block)
60cabdff1aSopenharmony_ci{
61cabdff1aSopenharmony_ci    /* implement the equation: block = coefficients * block * coefficients' */
62cabdff1aSopenharmony_ci
63cabdff1aSopenharmony_ci    unsigned int i, j, k;
64cabdff1aSopenharmony_ci    double out[8 * 8];
65cabdff1aSopenharmony_ci
66cabdff1aSopenharmony_ci    /* out = coefficients * block */
67cabdff1aSopenharmony_ci    for (i = 0; i < 64; i += 8) {
68cabdff1aSopenharmony_ci        for (j = 0; j < 8; ++j) {
69cabdff1aSopenharmony_ci            double tmp = 0;
70cabdff1aSopenharmony_ci            for (k = 0; k < 8; ++k) {
71cabdff1aSopenharmony_ci                tmp += coefficients[i + k] * block[k * 8 + j];
72cabdff1aSopenharmony_ci            }
73cabdff1aSopenharmony_ci            out[i + j] = tmp * 8;
74cabdff1aSopenharmony_ci        }
75cabdff1aSopenharmony_ci    }
76cabdff1aSopenharmony_ci
77cabdff1aSopenharmony_ci    /* block = out * (coefficients') */
78cabdff1aSopenharmony_ci    for (j = 0; j < 8; ++j) {
79cabdff1aSopenharmony_ci        for (i = 0; i < 64; i += 8) {
80cabdff1aSopenharmony_ci            double tmp = 0;
81cabdff1aSopenharmony_ci            for (k = 0; k < 8; ++k) {
82cabdff1aSopenharmony_ci                tmp += out[i + k] * coefficients[j * 8 + k];
83cabdff1aSopenharmony_ci            }
84cabdff1aSopenharmony_ci            block[i + j] = floor(tmp + 0.499999999999);
85cabdff1aSopenharmony_ci        }
86cabdff1aSopenharmony_ci    }
87cabdff1aSopenharmony_ci}
88cabdff1aSopenharmony_ci
89cabdff1aSopenharmony_ci/**
90cabdff1aSopenharmony_ci * Transform 8x8 block of data with a double precision inverse DCT <br>
91cabdff1aSopenharmony_ci * This is a reference implementation.
92cabdff1aSopenharmony_ci *
93cabdff1aSopenharmony_ci * @param block pointer to 8x8 block of data to transform
94cabdff1aSopenharmony_ci */
95cabdff1aSopenharmony_civoid ff_ref_idct(short *block)
96cabdff1aSopenharmony_ci{
97cabdff1aSopenharmony_ci    /* implement the equation: block = (coefficients') * block * coefficients */
98cabdff1aSopenharmony_ci
99cabdff1aSopenharmony_ci    unsigned int i, j, k;
100cabdff1aSopenharmony_ci    double out[8 * 8];
101cabdff1aSopenharmony_ci
102cabdff1aSopenharmony_ci    /* out = block * coefficients */
103cabdff1aSopenharmony_ci    for (i = 0; i < 64; i += 8) {
104cabdff1aSopenharmony_ci        for (j = 0; j < 8; ++j) {
105cabdff1aSopenharmony_ci            double tmp = 0;
106cabdff1aSopenharmony_ci            for (k = 0; k < 8; ++k) {
107cabdff1aSopenharmony_ci                tmp += block[i + k] * coefficients[k * 8 + j];
108cabdff1aSopenharmony_ci            }
109cabdff1aSopenharmony_ci            out[i + j] = tmp;
110cabdff1aSopenharmony_ci        }
111cabdff1aSopenharmony_ci    }
112cabdff1aSopenharmony_ci
113cabdff1aSopenharmony_ci    /* block = (coefficients') * out */
114cabdff1aSopenharmony_ci    for (i = 0; i < 8; ++i) {
115cabdff1aSopenharmony_ci        for (j = 0; j < 8; ++j) {
116cabdff1aSopenharmony_ci            double tmp = 0;
117cabdff1aSopenharmony_ci            for (k = 0; k < 64; k += 8) {
118cabdff1aSopenharmony_ci                tmp += coefficients[k + i] * out[k + j];
119cabdff1aSopenharmony_ci            }
120cabdff1aSopenharmony_ci            block[i * 8 + j] = floor(tmp + 0.5);
121cabdff1aSopenharmony_ci        }
122cabdff1aSopenharmony_ci    }
123cabdff1aSopenharmony_ci}
124