2 * Copyright (c) 2001-2002, David Janssens
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
15 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
18 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
19 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
20 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
21 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
22 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
23 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
24 * POSSIBILITY OF SUCH DAMAGE.
31 /* This table contains the norms of the basis function of the reversible MCT. */
33 double mct_norms[3] = { 1.732, .8292, .8292 };
36 /* This table contains the norms of the basis function of the irreversible MCT. */
38 double mct_norms_real[3] = { 1.732, 1.805, 1.573 };
41 /* Foward reversible MCT. */
43 void mct_encode(int *c0, int *c1, int *c2, int n)
46 for (i = 0; i < n; i++) {
51 y = (r + (g << 1) + b) >> 2;
61 /* Inverse reversible MCT. */
63 void mct_decode(int *c0, int *c1, int *c2, int n)
66 for (i = 0; i < n; i++) {
71 g = y - ((u + v) >> 2);
81 /* Get norm of basis function of reversible MCT. */
83 double mct_getnorm(int compno)
85 return mct_norms[compno];
89 /* Foward irreversible MCT. */
91 void mct_encode_real(int *c0, int *c1, int *c2, int n)
94 for (i = 0; i < n; i++) {
99 y = fix_mul(r, 2449) + fix_mul(g, 4809) + fix_mul(b, 934);
100 u = -fix_mul(r, 1382) - fix_mul(g, 2714) + fix_mul(b, 4096);
101 v = fix_mul(r, 4096) - fix_mul(g, 3430) - fix_mul(b, 666);
109 /* Inverse irreversible MCT. */
111 void mct_decode_real(int *c0, int *c1, int *c2, int n)
114 for (i = 0; i < n; i++) {
115 int y, u, v, r, g, b;
119 r = y + fix_mul(v, 11485);
120 g = y - fix_mul(u, 2819) - fix_mul(v, 5850);
121 b = y + fix_mul(u, 14516);
129 /* Get norm of basis function of irreversible MCT. */
131 double mct_getnorm_real(int compno)
133 return mct_norms_real[compno];