1 |
/************************************************************************** |
/***************************************************************************** |
2 |
* |
* |
3 |
* XVID MPEG-4 VIDEO CODEC |
* XVID MPEG-4 VIDEO CODEC |
4 |
* mpeg-4 quantization/dequantization |
* - Mpeg4 quantization/dequantization functions - |
5 |
* |
* |
6 |
* This program is an implementation of a part of one or more MPEG-4 |
* Copyright(C) 2002 Peter Ross <pross@xvid.org> |
|
* Video tools as specified in ISO/IEC 14496-2 standard. Those intending |
|
|
* to use this software module in hardware or software products are |
|
|
* advised that its use may infringe existing patents or copyrights, and |
|
|
* any such use would be at such party's own risk. The original |
|
|
* developer of this software module and his/her company, and subsequent |
|
|
* editors and their companies, will have no liability for use of this |
|
|
* software or modifications or derivatives thereof. |
|
7 |
* |
* |
8 |
* This program is free software; you can redistribute it and/or modify |
* This file is part of XviD, a free MPEG-4 video encoder/decoder |
9 |
* it under the terms of the GNU General Public License as published by |
* |
10 |
|
* XviD is free software; you can redistribute it and/or modify it |
11 |
|
* under the terms of the GNU General Public License as published by |
12 |
* the Free Software Foundation; either version 2 of the License, or |
* the Free Software Foundation; either version 2 of the License, or |
13 |
* (at your option) any later version. |
* (at your option) any later version. |
14 |
* |
* |
19 |
* |
* |
20 |
* You should have received a copy of the GNU General Public License |
* You should have received a copy of the GNU General Public License |
21 |
* along with this program; if not, write to the Free Software |
* along with this program; if not, write to the Free Software |
22 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
23 |
* |
* |
24 |
*************************************************************************/ |
* Under section 8 of the GNU General Public License, the copyright |
25 |
|
* holders of XVID explicitly forbid distribution in the following |
26 |
/************************************************************************** |
* countries: |
27 |
* |
* |
28 |
* History: |
* - Japan |
29 |
|
* - United States of America |
30 |
* |
* |
31 |
* 26.01.2002 fixed quant4_intra dcscalar signed/unsigned error |
* Linking XviD statically or dynamically with other modules is making a |
32 |
* 20.01.2002 increased accuracy of >> divide |
* combined work based on XviD. Thus, the terms and conditions of the |
33 |
* 26.12.2001 divide-by-multiplication optimization |
* GNU General Public License cover the whole combination. |
|
* 22.12.2001 [-127,127] clamping removed; minor tweaks |
|
|
* 19.11.2001 inital version <pross@cs.rmit.edu.au> |
|
34 |
* |
* |
35 |
*************************************************************************/ |
* As a special exception, the copyright holders of XviD give you |
36 |
|
* permission to link XviD with independent modules that communicate with |
37 |
|
* XviD solely through the VFW1.1 and DShow interfaces, regardless of the |
38 |
|
* license terms of these independent modules, and to copy and distribute |
39 |
|
* the resulting combined work under terms of your choice, provided that |
40 |
|
* every copy of the combined work is accompanied by a complete copy of |
41 |
|
* the source code of XviD (the version of XviD used to produce the |
42 |
|
* combined work), being distributed under the terms of the GNU General |
43 |
|
* Public License plus this exception. An independent module is a module |
44 |
|
* which is not derived from or based on XviD. |
45 |
|
* |
46 |
|
* Note that people who make modified versions of XviD are not obligated |
47 |
|
* to grant this special exception for their modified versions; it is |
48 |
|
* their choice whether to do so. The GNU General Public License gives |
49 |
|
* permission to release a modified version without this exception; this |
50 |
|
* exception also makes it possible to release a modified version which |
51 |
|
* carries forward this exception. |
52 |
|
* |
53 |
|
* $Id: quant_mpeg4.c,v 1.6 2002-11-17 00:41:19 edgomez Exp $ |
54 |
|
* |
55 |
|
****************************************************************************/ |
56 |
|
|
57 |
#include "quant_mpeg4.h" |
#include "quant_mpeg4.h" |
58 |
|
#include "quant_matrix.h" |
59 |
|
|
60 |
|
/***************************************************************************** |
61 |
|
* Function pointers |
62 |
|
****************************************************************************/ |
63 |
|
|
|
|
|
|
// function pointers |
|
64 |
quant_intraFuncPtr quant4_intra; |
quant_intraFuncPtr quant4_intra; |
65 |
quant_intraFuncPtr dequant4_intra; |
quant_intraFuncPtr dequant4_intra; |
66 |
dequant_interFuncPtr dequant4_inter; |
dequant_interFuncPtr dequant4_inter; |
67 |
quant_interFuncPtr quant4_inter; |
quant_interFuncPtr quant4_inter; |
68 |
|
|
69 |
|
|
70 |
|
/***************************************************************************** |
71 |
|
* Local data |
72 |
|
****************************************************************************/ |
73 |
|
|
74 |
#define DIV_DIV(A,B) ( (A) > 0 ? ((A)+((B)>>1))/(B) : ((A)-((B)>>1))/(B) ) |
#define DIV_DIV(A,B) ( (A) > 0 ? ((A)+((B)>>1))/(B) : ((A)-((B)>>1))/(B) ) |
75 |
#define SIGN(A) ((A)>0?1:-1) |
#define SIGN(A) ((A)>0?1:-1) |
76 |
#define VM18P 3 |
#define VM18P 3 |
77 |
#define VM18Q 4 |
#define VM18Q 4 |
78 |
|
|
79 |
|
|
80 |
// divide-by-multiply table |
/* |
81 |
// need 17 bit shift (16 causes slight errors when q > 19) |
* divide-by-multiply table |
82 |
|
* need 17 bit shift (16 causes slight errors when q > 19) |
83 |
|
*/ |
84 |
|
|
85 |
#define SCALEBITS 17 |
#define SCALEBITS 17 |
86 |
#define FIX(X) ((1UL << SCALEBITS) / (X) + 1) |
#define FIX(X) ((1UL << SCALEBITS) / (X) + 1) |
87 |
|
|
88 |
static const uint32_t multipliers[32] = |
static const uint32_t multipliers[32] = { |
|
{ |
|
89 |
0, FIX(2), FIX(4), FIX(6), |
0, FIX(2), FIX(4), FIX(6), |
90 |
FIX(8), FIX(10), FIX(12), FIX(14), |
FIX(8), FIX(10), FIX(12), FIX(14), |
91 |
FIX(16), FIX(18), FIX(20), FIX(22), |
FIX(16), FIX(18), FIX(20), FIX(22), |
96 |
FIX(56), FIX(58), FIX(60), FIX(62) |
FIX(56), FIX(58), FIX(60), FIX(62) |
97 |
}; |
}; |
98 |
|
|
99 |
|
/***************************************************************************** |
100 |
static const int16_t default_intra_matrix[64] = { |
* Functions |
101 |
8,17,18,19,21,23,25,27, |
****************************************************************************/ |
|
17,18,19,21,23,25,27,28, |
|
|
20,21,22,23,24,26,28,30, |
|
|
21,22,23,24,26,28,30,32, |
|
|
22,23,24,26,28,30,32,35, |
|
|
23,24,26,28,30,32,35,38, |
|
|
25,26,28,30,32,35,38,41, |
|
|
27,28,30,32,35,38,41,45 |
|
|
}; |
|
|
|
|
|
static const int16_t default_inter_matrix[64] = { |
|
|
16,17,18,19,20,21,22,23, |
|
|
17,18,19,20,21,22,23,24, |
|
|
18,19,20,21,22,23,24,25, |
|
|
19,20,21,22,23,24,26,27, |
|
|
20,21,22,23,25,26,27,28, |
|
|
21,22,23,24,26,27,28,30, |
|
|
22,23,24,26,27,28,30,31, |
|
|
23,24,25,27,28,30,31,33 |
|
|
}; |
|
|
|
|
102 |
|
|
103 |
/* quantize intra-block |
/* quantize intra-block |
104 |
|
|
108 |
// coeff[i] = (level + quantd) / quant2; |
// coeff[i] = (level + quantd) / quant2; |
109 |
*/ |
*/ |
110 |
|
|
111 |
void quant4_intra_c(int16_t * coeff, const int16_t * data, const uint32_t quant, const uint32_t dcscalar) |
void |
112 |
|
quant4_intra_c(int16_t * coeff, |
113 |
|
const int16_t * data, |
114 |
|
const uint32_t quant, |
115 |
|
const uint32_t dcscalar) |
116 |
{ |
{ |
117 |
const uint32_t quantd = ((VM18P*quant) + (VM18Q/2)) / VM18Q; |
const uint32_t quantd = ((VM18P*quant) + (VM18Q/2)) / VM18Q; |
118 |
const uint32_t mult = multipliers[quant]; |
const uint32_t mult = multipliers[quant]; |
119 |
uint32_t i; |
uint32_t i; |
120 |
|
int16_t *intra_matrix; |
121 |
|
|
122 |
|
intra_matrix = get_intra_matrix(); |
123 |
|
|
124 |
coeff[0] = DIV_DIV(data[0], (int32_t)dcscalar); |
coeff[0] = DIV_DIV(data[0], (int32_t)dcscalar); |
125 |
|
|
126 |
for (i = 1; i < 64; i++) |
for (i = 1; i < 64; i++) { |
127 |
{ |
if (data[i] < 0) { |
|
if (data[i] < 0) |
|
|
{ |
|
128 |
uint32_t level = -data[i]; |
uint32_t level = -data[i]; |
129 |
level = ((level<<4) + (default_intra_matrix[i]>>1)) / default_intra_matrix[i]; |
|
130 |
|
level = ((level << 4) + (intra_matrix[i] >> 1)) / intra_matrix[i]; |
131 |
level = ((level + quantd) * mult) >> 17; |
level = ((level + quantd) * mult) >> 17; |
132 |
coeff[i] = -(int16_t)level; |
coeff[i] = -(int16_t)level; |
133 |
} |
} else if (data[i] > 0) { |
|
else if (data[i] > 0) |
|
|
{ |
|
134 |
uint32_t level = data[i]; |
uint32_t level = data[i]; |
135 |
level = ((level<<4) + (default_intra_matrix[i]>>1)) / default_intra_matrix[i]; |
|
136 |
|
level = ((level << 4) + (intra_matrix[i] >> 1)) / intra_matrix[i]; |
137 |
level = ((level + quantd) * mult) >> 17; |
level = ((level + quantd) * mult) >> 17; |
138 |
coeff[i] = level; |
coeff[i] = level; |
139 |
} |
} else { |
|
else |
|
|
{ |
|
140 |
coeff[i] = 0; |
coeff[i] = 0; |
141 |
} |
} |
142 |
} |
} |
148 |
// data[i] = (coeff[i] * default_intra_matrix[i] * quant2) >> 4; |
// data[i] = (coeff[i] * default_intra_matrix[i] * quant2) >> 4; |
149 |
*/ |
*/ |
150 |
|
|
151 |
void dequant4_intra_c(int16_t *data, const int16_t *coeff, const uint32_t quant, const uint32_t dcscalar) |
void |
152 |
|
dequant4_intra_c(int16_t * data, |
153 |
|
const int16_t * coeff, |
154 |
|
const uint32_t quant, |
155 |
|
const uint32_t dcscalar) |
156 |
{ |
{ |
157 |
uint32_t i; |
uint32_t i; |
158 |
|
int16_t *intra_matrix; |
159 |
|
|
160 |
|
intra_matrix = get_intra_matrix(); |
161 |
|
|
162 |
data[0] = coeff[0] * dcscalar; |
data[0] = coeff[0] * dcscalar; |
163 |
if (data[0] < -2048) |
if (data[0] < -2048) { |
|
{ |
|
164 |
data[0] = -2048; |
data[0] = -2048; |
165 |
} |
} else if (data[0] > 2047) { |
|
else if (data[0] > 2047) |
|
|
{ |
|
166 |
data[0] = 2047; |
data[0] = 2047; |
167 |
} |
} |
168 |
|
|
169 |
for (i = 1; i < 64; i++) |
for (i = 1; i < 64; i++) { |
170 |
{ |
if (coeff[i] == 0) { |
|
if (coeff[i] == 0) |
|
|
{ |
|
171 |
data[i] = 0; |
data[i] = 0; |
172 |
} |
} else if (coeff[i] < 0) { |
|
else if (coeff[i] < 0) |
|
|
{ |
|
173 |
uint32_t level = -coeff[i]; |
uint32_t level = -coeff[i]; |
174 |
level = (level * default_intra_matrix[i] * quant) >> 3; |
|
175 |
|
level = (level * intra_matrix[i] * quant) >> 3; |
176 |
data[i] = (level <= 2048 ? -(int16_t)level : -2048); |
data[i] = (level <= 2048 ? -(int16_t)level : -2048); |
177 |
} |
} else // if (coeff[i] > 0) |
|
else // if (coeff[i] > 0) |
|
178 |
{ |
{ |
179 |
uint32_t level = coeff[i]; |
uint32_t level = coeff[i]; |
180 |
level = (level * default_intra_matrix[i] * quant) >> 3; |
|
181 |
|
level = (level * intra_matrix[i] * quant) >> 3; |
182 |
data[i] = (level <= 2047 ? level : 2047); |
data[i] = (level <= 2047 ? level : 2047); |
183 |
} |
} |
184 |
} |
} |
193 |
// sum += abs(level); |
// sum += abs(level); |
194 |
*/ |
*/ |
195 |
|
|
196 |
uint32_t quant4_inter_c(int16_t * coeff, const int16_t * data, const uint32_t quant) |
uint32_t |
197 |
|
quant4_inter_c(int16_t * coeff, |
198 |
|
const int16_t * data, |
199 |
|
const uint32_t quant) |
200 |
{ |
{ |
201 |
const uint32_t mult = multipliers[quant]; |
const uint32_t mult = multipliers[quant]; |
202 |
uint32_t sum = 0; |
uint32_t sum = 0; |
203 |
uint32_t i; |
uint32_t i; |
204 |
|
int16_t *inter_matrix; |
205 |
|
|
206 |
for (i = 0; i < 64; i++) |
inter_matrix = get_inter_matrix(); |
207 |
{ |
|
208 |
if (data[i] < 0) |
for (i = 0; i < 64; i++) { |
209 |
{ |
if (data[i] < 0) { |
210 |
uint32_t level = -data[i]; |
uint32_t level = -data[i]; |
211 |
level = ((level<<4) + (default_inter_matrix[i]>>1)) / default_inter_matrix[i]; |
|
212 |
|
level = ((level << 4) + (inter_matrix[i] >> 1)) / inter_matrix[i]; |
213 |
level = (level * mult) >> 17; |
level = (level * mult) >> 17; |
214 |
sum += level; |
sum += level; |
215 |
coeff[i] = -(int16_t)level; |
coeff[i] = -(int16_t)level; |
216 |
} |
} else if (data[i] > 0) { |
|
else if (data[i] > 0) |
|
|
{ |
|
217 |
uint32_t level = data[i]; |
uint32_t level = data[i]; |
218 |
level = ((level<<4) + (default_inter_matrix[i]>>1)) / default_inter_matrix[i]; |
|
219 |
|
level = ((level << 4) + (inter_matrix[i] >> 1)) / inter_matrix[i]; |
220 |
level = (level * mult) >> 17; |
level = (level * mult) >> 17; |
221 |
sum += level; |
sum += level; |
222 |
coeff[i] = level; |
coeff[i] = level; |
223 |
} |
} else { |
|
else |
|
|
{ |
|
224 |
coeff[i] = 0; |
coeff[i] = 0; |
225 |
} |
} |
226 |
} |
} |
233 |
data = ((2 * coeff + SIGN(coeff)) * inter_matrix[i] * quant) / 16 |
data = ((2 * coeff + SIGN(coeff)) * inter_matrix[i] * quant) / 16 |
234 |
*/ |
*/ |
235 |
|
|
236 |
void dequant4_inter_c(int16_t *data, const int16_t *coeff, const uint32_t quant) |
void |
237 |
|
dequant4_inter_c(int16_t * data, |
238 |
|
const int16_t * coeff, |
239 |
|
const uint32_t quant) |
240 |
{ |
{ |
241 |
uint32_t sum = 0; |
uint32_t sum = 0; |
242 |
uint32_t i; |
uint32_t i; |
243 |
|
int16_t *inter_matrix; |
244 |
|
|
245 |
for (i = 0; i < 64; i++) |
inter_matrix = get_inter_matrix(); |
246 |
{ |
|
247 |
if (coeff[i] == 0) |
for (i = 0; i < 64; i++) { |
248 |
{ |
if (coeff[i] == 0) { |
249 |
data[i] = 0; |
data[i] = 0; |
250 |
} |
} else if (coeff[i] < 0) { |
|
else if (coeff[i] < 0) |
|
|
{ |
|
251 |
int32_t level = -coeff[i]; |
int32_t level = -coeff[i]; |
252 |
level = ((2 * level + 1) * default_inter_matrix[i] * quant) >> 4; |
|
253 |
|
level = ((2 * level + 1) * inter_matrix[i] * quant) >> 4; |
254 |
data[i] = (level <= 2048 ? -level : -2048); |
data[i] = (level <= 2048 ? -level : -2048); |
255 |
} |
} else // if (coeff[i] > 0) |
|
else // if (coeff[i] > 0) |
|
256 |
{ |
{ |
257 |
uint32_t level = coeff[i]; |
uint32_t level = coeff[i]; |
258 |
level = ((2 * level + 1) * default_inter_matrix[i] * quant) >> 4; |
|
259 |
|
level = ((2 * level + 1) * inter_matrix[i] * quant) >> 4; |
260 |
data[i] = (level <= 2047 ? level : 2047); |
data[i] = (level <= 2047 ? level : 2047); |
261 |
} |
} |
262 |
|
|
265 |
|
|
266 |
// mismatch control |
// mismatch control |
267 |
|
|
268 |
if ((sum & 1) == 0) |
if ((sum & 1) == 0) { |
|
{ |
|
269 |
data[63] ^= 1; |
data[63] ^= 1; |
270 |
} |
} |
271 |
} |
} |