CN1286322C - Quantizing device for low complicated degree integer 4x4 discrete cosine transform and its realizing method - Google Patents

Abstract

The present invention relates to a quantizing device of low complicated degree integer 4*4 discrete cosine transform, and a realizing method thereof. The quantizing device comprises an interframe prediction module, an entropy coding module, an annular wave filtering circuit, a frame buffer, a positive transform module for row transform, a scaling module for normalizing a transform matrix output by the positive transform module, a quantizing module, an inverse quantizing module and an inverse transform module, wherein integer 4*4 discrete cosine transform is carried out to an image block residual error coefficient matrix predicted in frames or between the frames by the positive transform module; the scaling module normalizes a mould of the matrix positively transformed, a matrix calculation bit is shifted and transformed rightwards, and the calculation bit is limited in a certain bit; the quantizing module quantizes the scaling transform matrix by a one-dimensional array; the inverse quantizing module inversely quantizes the quantized transform matrix; the inverse transform module inversely transforms a line and a row of the matrix inversely quantized. The problems of data shift, unmatched coding and decoding terminals, etc. are solved by the present invention, and calculation complexity is lowered.

Description

A kind of low complex degree integer 4 * 4 discrete cosine transforms quantize implementation method

Technical field

The invention belongs to digital TV image handle in system (SOC, System on Chip) technical field on the encoding and decoding technique of digital video and the core, especially relate to a kind of low complex degree integer 4 * 4 discrete cosine transforms and quantize implementation method.

Background technology

Video coding and decoding technology is to realize multi-medium data storage and the key of transmitting efficiently, and advanced video coding and decoding technology is stipulated with the form of standard usually.At present, (the MPEG of Motion Picture Experts Group that typical video compression standard has International Organization for Standardization to divide into, Moving Picture Expert Group) the serial international standard of Tui Chuing, the up-to-date video encoding and decoding standard of International Telecommunications Union that International Telecommunication Union proposes is the series video compression standard H.26x, and the JVT video encoding standard formulated of the joint video team JVT (Joint VideoTeam) that sets up of ISO and ITU etc.What the JVT standard adopted is a kind of novel coding techniques, and it is than all high many of the compression efficiency of existing any coding standard.The formal title of JVT standard in ISO is the tenth part of MPEG-4 standard, and the formal title in ITU is a standard H.264.

Transform and quantization is the key technology that realizes the video coding and decoding, if there is not transform and quantization, the application of any video coding and decoding standard all almost is impossible.The basic reason of introducing conversion improves compression efficiency exactly,

Because discrete cosine transform (DCT) is near Cavan sieve husband (Karhunen-Loeve) conversion, so international image and video compression coding-decoding standard nearly all adopted this transform method at present, but there is data drift problem in this traditional dct transform method, cause not matching of coding and decoding end, from algorithm, adopt multiplication, make hardware realize and application complexity and difficult that complexity is higher.

Integer 4 * 4 conversion that are similar to DCT in up-to-date H.264/AVC suggestion/standard, have then been adopted, but, H.264/AVC integer 4 * 4 conversion battle arrays that adopted in, the absolute value of its every row with unequal, and the mould of every row differs greatly, this can not reduce the computational complexity of decoding end and the time overhead of decoding with regard to being unfavorable for that convergent-divergent with decoding end is put into coding side and carries out; In addition, the quantization method that is adopted in H.264/AVC quantizes and inverse quantization has used 62 dimensions 4 * 4 to show respectively, and the storage overhead that reads the time overhead of quantization table and inverse quantization table and data is all bigger.

Summary of the invention

In order to overcome above-mentioned the deficiencies in the prior art, the object of the present invention is to provide a kind of low complex degree integer 4 * 4 discrete cosine transforms to quantize implementation method, make that floating-point operation coding side and decoding end are complementary in the dct transform.

Another object of the present invention is to provide a kind of low complex degree integer 4 * 4 discrete cosine transforms to quantize implementation method, reduces the computational complexity of conversion.

In order to finish the foregoing invention task, the overall technological scheme that the present invention adopts is:

A kind of low complex degree integer 4 * 4 discrete cosine transforms quantize implementation method, may further comprise the steps:

Step 1: the direct transform module is done 4 * 4 discrete cosine line translations of horizontal direction integer to infra-frame prediction or Inter prediction residue matrix, and does the vertical direction rank transformation;

Described step 1 further comprises:

Step 11, direct transform module receive infra-frame prediction and inter prediction module residual error coefficient matrix;

Step 12, direct transform module are two matrixes that multiply each other with the kernel kernal mapping matrix decomposition, with first matrix premultiplication image parameter residual matrix, use the matrix behind first matrix premultiplication image prediction residual error coefficient matrix of second matrix premultiplication again, obtain the intermediate object program matrix;

Step 13, direct transform module are taken advantage of the commentaries on classics order matrix of first matrix with the intermediate object program matrix right side that obtains, and the right side are taken advantage of the matrix right side that obtains to take advantage of second matrix again;

Step 14, direct transform module will be handled the resulting last transformation results matrix in back through it and output to Zoom module.

Step 2: the matrix norm that Zoom module aligns after the conversion module conversion carries out normalized;

Step 3: the computing gt of the matrix of consequence that Zoom module will obtain after normalized, and the computing position is limited within the location number;

Step 4: quantization modules quantizes the transformation matrix through convergent-divergent with an one-dimension array at coding side and decoding end, and the matrix of consequence after the output of entropy coding module quantizes;

Step 5: inverse quantization module is carried out inverse quantization with an one-dimension array to the transformation matrix after quantizing at coding side and decoding end;

Step 6: matrix column and the row of inverse transform block after to inverse quantization carries out inverse transformation.

Kernel kernal mapping matrix in the described step 11 is:

$\left[\begin{array}{cccc}2& 2& 2& 2\\ 3& 1& -1& -3\\ 2& -2& -2& 2\\ 1& -3& 3& -1\end{array}\right]$

First matrix in the described step 12 and second matrix are:

First matrix:

$\left[\begin{array}{cccc}2& 2& 0& 0\\ 0& 0& 1& 3\\ 2& -2& 0& 0\\ 0& 0& -3& 1\end{array}\right]$

Second matrix:

$\left[\begin{array}{cccc}1& 0& 0& 1\\ 0& 1& 1& 0\\ 0& 1& -1& 0\\ 1& 0& 0& -1\end{array}\right]$

Each row operation position after horizontal direction integer 4 * 4 conversion in the described step 1 is 12, and it comprises 9 of 3 of the capable figure places of transformation matrix and residual error figure places.

In the described step 1 behind the vertical direction rank transformation computing position be 15.

In the described step 2 to the matrix norm after changing carry out unified normalized be specially each element of forming matrix is removed its place respectively each element of row or column through the value of evolution square again, make the mould of each row or column all equal 1.

Computing position restriction figure place in the described step 3 is 16.

Quantification in the described step 4 specifically comprises:

Step 41, at a certain quantization step, determine its corresponding quantization parameter according to formula Q (i)=32768/2i/8, and be kept in the quantization table of an one dimension;

Step 42, will handle the resulting intermediate object program matrix Y ' in back through convergent-divergent and multiply by corresponding quantization parameter;

Step 43, again with the computing gt of The above results matrix, make final matrix of consequence computing position remain on below 16.

The step of the inverse quantization in the described step 5 specifically comprises:

Step 51, a certain quantization step that is adopted when quantizing are according to formula IQ_TAB[64]=32768 * 2 ^Qp/8Determine its corresponding inverse quantization parameter, and be kept in the inverse quantization table of an one dimension;

Step 52, will be through resulting quantization matrix Y after the entropy decoding processing " multiply by corresponding inverse quantization parameter;

Step 53, again with The above results matrix operation gt, make the computing position of final matrix of consequence remain on below 16.

Inverse transformation in the described step 6 specifically may further comprise the steps:

Step 61, inverse transform block are that two first matrixes that multiply each other change the order matrix and second matrix changes the order matrix with the commentaries on classics order matrix decomposition of kernel kernal mapping matrix, with the matrix behind second matrix commentaries on classics order matrix premultiplication inverse quantization, change the matrix that order matrix premultiplication obtains with first matrix again, obtain product matrix;

The commentaries on classics order matrix of the above-mentioned product matrix that step 62, inverse transform block will the obtain right side is again taken advantage of second matrix and first matrix, gets matrix of consequence to the end.

The present invention has significant advantage and good effect, the present invention adopt be different from prior art the kernel kernal mapping matrix, the mould of every row in the transformation matrix has been made normalized, adopt integer 4 * 4 discrete cosine transform battle arrays, the mould absolute value of every row and that all equal 8, first and third row is

The second, the mould of four lines equals

Differ very little, helping convergent-divergent with decoding end is put into coding side and carries out, the computational complexity of decoding end and the time overhead of decoding have been reduced, therefore, only need an one-dimension array can finish quantification, the inverse quantization of different stage respectively at quantification end and inverse quantization end, this just makes that quantification and the required memory space of inverse quantization reduce greatly, has significantly reduced time overhead and storage overhead.The present invention has overcome the defective of the data drift that exists in traditional dct transform method on performance, avoided the unmatched problem of coding and decoding end, in method, the present invention realizes the integer transform of low complex degree, low storage overhead making that the implementation complexity of software and hardware is all lower with interior coefficient matrix with 3.Fully phase out multiplication, only adopted addition and displacement, made hardware realize and use conveniently and easy, and result of calculation has been limited within the 16Bit, reduced computational complexity, especially suitable low side processor.

Description of drawings

Fig. 1 is main functional modules figure of the present invention;

Fig. 2 is a method flow diagram of the present invention;

Fig. 3 is that the direct transform rapid DCT calculates schematic diagram;

Fig. 4 is that the inverse transformation rapid DCT calculates schematic diagram.

Embodiment

The present invention is further detailed explanation below in conjunction with the drawings and specific embodiments.

See also Fig. 1 a kind of low complex degree integral discrete cosine transform quantization device of the present invention, comprise intra-framed prediction module; The entropy coding module; The circle filtering circuit; Frame buffer; Be used for direct transform module that the residual error data piece that infra-frame prediction or inter prediction module produce is carried out 4 * 4 conversion of row, column integer, its input connects the residual error coefficient matrix output of infra-frame prediction or inter prediction module, and output connects the Zoom module (not shown); The transformation matrix that is used to align conversion module output is unified the Zoom module of normalized; The quantization modules that the intermediate object program matrix that is used for obtaining behind the convergent-divergent quantizes, its output connects the input and the entropy coding module of Zoom module; Be used for and will quantize the inverse quantization module of back matrix inverse quantization, the inverse quantization module input is connected with Zoom module convergent-divergent output, and its inverse quantization matrix output is connected with the input of inverse transform block; Be used for the inverse transform block to the image parameter matrix inverse transformation of inverse quantization output, the inverse transform block output is connected to circle filtering and frame buffer.

During coding,, carry out 4 * 4 following conversion for infra-frame prediction or Inter prediction residue:

$Y=C_{f}X{C}_f^T\&CircleTimes;E_r=\left(\left[\begin{array}{cccc}2& 2& 2& 2\\ 3& 1& -1& -3\\ 2& -2& -2& 2\\ 1& -3& 3& -1\end{array}\right]\mathrm{<figure-callout\; id="2"\; label="X"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">X</figure-callout>}\left[\begin{array}{cccc}2& 3& 2& 1\\ 2& 1& -2& -3\\ 2& -1& -2& 3\\ 2& -3& 2& -1\end{array}\right]\right)\&CircleTimes;\left[\begin{array}{cccc}{a}^2& \mathrm{ab}& a^2& \mathrm{ab}\\ \mathrm{ab}& {\mathrm{<figure-callout\; id="2"\; label="b"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">b</figure-callout>}}^2& \mathrm{ab}& b^2\\ a^2& \mathrm{ab}& a^2& \mathrm{ab}\\ \mathrm{ab}& {\mathrm{<figure-callout\; id="2"\; label="b"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">b</figure-callout>}}^2& \mathrm{<figure-callout\; id="2"\; label="ab\; b"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">ab</figure-callout>}& b^{}{}^2\end{array}\right]$

C _fXC _f ^TBe the core of two-dimensional transform, E _fIt is the zoom factor matrix.Operator  represent after each conversion coefficient respectively with matrix E _fThe zoom factor of middle same position multiplies each other, and it is scalar multiplication rather than matrix multiplication.Here a, b is respectively C _fThe inverse of the mould of first row and second row coefficient.

Adopt 8 accuracy representings for Y, U, V signal, because input matrix is a predicated error, therefore needs 9 and represent, the maximum of each row absolute value sum of transformation matrix is 8, therefore, needs 9+log for the matrix element after the conversion ₂8 * 8=15 represents the position.Carrying out two-dimensional core conversion C _fXC _f ^TAfter, the convergent-divergent process combines with quantizing, and has so just reduced operand, has reduced computational complexity.

See also Fig. 2 method flow diagram of the present invention.A kind of integer 4 * 4 discrete cosine transforms of the present invention quantize the method for realization, mainly comprise the steps:

The first step, direct transform module to infra-frame prediction or inter prediction after the residual error data piece do 4 * 4 discrete cosine line translations of horizontal direction integer, and do the vertical direction rank transformation;

At first residual error coefficient matrix behind infra-frame prediction or the inter prediction is done integer 4 * 4 discrete cosine transforms of horizontal direction during the forward line translation.Can know from above-mentioned Matrix Formula, the absolute value of every row of kernel kernal mapping matrix [A] is maximum and be 8, because the mould of the every row of kernel kernal mapping battle array is not 1, finishes once complete line translation like this, after just being equivalent to do once complete line translation with original dct transform battle array, log again moves to left ₂8=3Bit adds the 9Bit of original storage residual error, will need the computing position of 9+3=12Bit.After finishing line translation, and then begin to do the rank transformation of vertical direction, method is with the forward line translation.Therefore, after rank transformation was finished, the computing position can be increased to 15Bit.

As the following formula, wherein, Y is the battle array after the conversion, and X is the residual error battle array of input, and A is the kernel kernal mapping battle array, and B, E are the decomposition battle array of A.

$Y=\mathrm{AX}{A}^T=\left(\left[\begin{array}{cccc}2& 2& 2& 2\\ 3& 1& -1& -3\\ 2& -2& -2& 2\\ 1& -3& 3& -1\end{array}\right]\mathrm{<figure-callout\; id="2"\; label="X"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">X</figure-callout>}\left[\begin{array}{cccc}2& 3& 2& 1\\ 2& 1& -2& -3\\ 2& -1& -2& 3\\ 2& -3& 2& -1\end{array}\right]\right)\&CircleTimes;\left[\begin{array}{cccc}{a}^2& \mathrm{ab}& a^2& \mathrm{ab}\\ \mathrm{ab}& {\mathrm{<figure-callout\; id="2"\; label="b"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">b</figure-callout>}}^2& \mathrm{ab}& b^2\\ a^2& \mathrm{ab}& a^2& \mathrm{ab}\\ \mathrm{ab}& {\mathrm{<figure-callout\; id="2"\; label="b"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">b</figure-callout>}}^2& \mathrm{ab}& {\mathrm{<figure-callout\; id="2"\; label="b"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">b</figure-callout>}}^2\end{array}\right]$

[A]＝[B]×[C]

Wherein, A, B, shown in C is defined as follows:

$\left[A\right]=\left[\begin{array}{cccc}2& 2& 2& 2\\ 3& 1& -1& -3\\ 2& -2& -2& 2\\ 1& -3& 3& -1\end{array}\right],\left[B\right]=\left[\begin{array}{cccc}2& 2& 0& 0\\ 0& 0& 1& 3\\ 2& -2& 0& 0\\ 0& 0& -3& 1\end{array}\right],\left[C\right]=\left[\begin{array}{cccc}1& 0& 0& 1\\ 0& 1& 1& 0\\ 0& 1& -1& 0\\ 1& 0& 0& -1\end{array}\right]$

${\left[B\right]}^T=\left[\begin{array}{cccc}2& 0& 2& 0\\ 2& 0& -2& 0\\ 0& 1& 0& -3\\ 0& 3& 0& 1\end{array}\right],{\left[C\right]}^T=\left[\begin{array}{cccc}1& 0& 0& 1\\ 0& 1& 1& 0\\ 0& 1& -1& 0\\ 1& 0& 0& -1\end{array}\right]$

$\left[A\right]=\left[B\right]\&times;\left[C\right]=\left[\begin{array}{cccc}2& 2& 2& 2\\ 3& 1& -1& -3\\ 2& -2& -2& 2\\ 1& -3& 3& -1\end{array}\right]=\left[\begin{array}{cccc}2& 2& 0& 0\\ 0& 0& 1& 3\\ 2& -2& 0& 0\\ 0& 0& -3& 1\end{array}\right]\&times;\left[\begin{array}{cccc}1& 0& 0& 1\\ 0& 1& 1& 0\\ 0& 1& -1& 0\\ 1& 0& 0& -1\end{array}\right]$

1, at first establishing the image parameter that receives infra-frame prediction or the output of motion-vector prediction module is:

[X]＝[x1，x2，x3，x4] ^T；

2, again kernel kernal mapping matrix [A] is decomposed [B] * [C], and with [C], [B] priority premultiplication [X].Calculate [C] * [X] earlier, establish the intermediate object program that obtains and be [G]=[g ₁, g ₂, g ₃, g ₄] ^T, this realizes with addition.Wherein, g ₁=x1+x4, g ₂=x2+x3, g ₃=x2-x3, g ₄=x1-x4.Then, calculate [B] * [G] again, establish the result who obtains and be [V]=[v1, v2, v3, v4] ^T, this realizes with addition and displacement, earlier with g ₁, g ₂Move to left 1, addition again obtains v1, v3:

Wherein, v1=2 * (g1+g2);

v3＝2×(g ₁-g ₂)；

Again with g ₃, g ₄Do following processing:

Calculate v2 earlier, with g ₄Move to left one, obtain 2 * g ₄, add g ₄, g ₃, obtain v2, i.e. v2=2 * g ₄+ g ₄+ g ₃Calculate v3 again, with g ₃Move to left one, obtain 2 * g ₃, negate is then added-g ₃, g ₄, obtain v4, i.e. v4=g ₄-2 * g ₃-g ₃

3, with intermediate object program matrix [V]=[v1, v2, v3, the v4] that obtains ^TThe commentaries on classics order matrix [C] of [C], [B] is taken advantage of on the right side again ^T, [B] ^T, get transformation results matrix [Y]=[y1, y2, y3, y4] to the end.

Specific algorithm is as follows:

Calculate [V] * [C] earlier ^T, to establish the intermediate object program that obtains and be [H]=[h1, h2, h3, h4], this step realizes with addition fully.At this moment, establish [V]=[v1 ', v2 ', v3 ', v4 '], so just with the form of expression of [V], the form of expression vectorial by the row in first, second step changes the column vector form of expression into.

Obtain [H]: h1=v1 '+v4 ' like this; H2=v2 '+v3 '; H3=v2 '-v3 '; H4=v1 '-v4 '.

Then, calculate [H] * [B] again ^T, this step realizes with addition and displacement.Earlier h1, h2 are respectively moved to left one, addition then obtains y1, y3:

y1＝2×(h1+h2)

y3＝2×(h1-h3)

And then h4 moved to left after one, with the h3 addition, obtain y2; H3 is moved to left after one,, obtains y4 with the h4 addition:

y2＝2×h4+h4+h3

y4＝-2×h3-h3+h4

The DCT algorithm of direct transform as shown in Figure 3.

Second step, Zoom module carry out normalized to direct transform place that the convergent-divergent with the decoding end inverse transformation is grouped into coding side, after finishing dealing with, can quantize.

Matrix Y after finishing at conversion at first had the process of a convergent-divergent before quantizing.Purpose is that the mould of all row has all been done normalized processing, makes when quantizing in the future, only needs an one-dimension array can finish the quantification of different stage.After convergent-divergent was finished, the computing position can return to 11Bit.The formula of convergent-divergent is as follows:

Scale2(i，j)＝norm(A(1，:))×norm(A(1，:))×norm(A(1，:))×norm(A(1，:))×32768/(norm(A(i，:))×norm(A(j，:))×norm(Aj，:))×norm(A(i，:)))

Y’(i，j)＝abs(Y(i，j))×Scale2(i，j)＞＞19

Wherein Scale2 (i, j) for the required zoom factor of conversion current block, (i, j) corresponding position in 4 * 4 gusts of the expressions, i=1,2,3,4; J=1,2,3,4; Norm (A (i :)) and norm (A (j :)) expression the mould that i is capable or j is capable.Before quantizing, 3. element to each position among the Y by formula carries out normalized, normalized specifically is meant each element square sum value of evolution again of each element of forming matrix being removed the row or column at its place respectively, like this, make the mould of each row or column all equal 1, thereby reached the normalization of mould.Y handles the resulting intermediate object program in back for carrying out convergent-divergent.

The 3rd step, because processing and amplifying in convergent-divergent makes the computing position exceed 16Bit, therefore, must make respective handling, the computing position is limited within the 16Bit.After moving to right, operation result keeps 11Bit.

The 4th step, quantization modules quantize the transformation matrix through convergent-divergent with an one-dimension array at coding side and decoding end.The concrete steps that quantize are: at first at a certain quantization step, according to formula Q (i)=32768/2 ^I/8Determine its corresponding quantization parameter, and be kept in the quantization table of an one dimension, will handle the resulting intermediate object program matrix Y ' in back through convergent-divergent then and multiply by corresponding quantization parameter; At last, again with The above results computing gt, make final result's computing position remain on below 16.

The present invention adopts is 0～63 quantification mechanism, and has all done normalized before quantification, therefore, during quantification, only needs an one-dimension array can finish the quantification of different stage.

Wherein, vectorization step-length is 2 ^I/8, i=0 ..., 63; So quantization table can be represented with following formula:

Q(i)＝32768/2 ^i/8；i＝0，...，63；

Like this, quantize just to adopt following formula to carry out:

Y”＝Y’×Q(i)＞＞15。

The 5th step, inverse quantization module are carried out inverse quantization with an one-dimension array to the transformation matrix after quantizing at coding side and decoding end.The step of inverse quantization is: a certain quantization step that is adopted during at first at quantification, according to formula IQ_TAB[64]=32768 * 2 ^Qp/8Determine its corresponding inverse quantization parameter, and be kept in the inverse quantization table of an one dimension, then will be through resulting quantization matrix Y after the entropy decoding processing " multiply by corresponding inverse quantization parameter; last; as, to make the computing position of final matrix of consequence remain on below 16 again with the computing gt of The above results matrix.

Inverse quantization is undertaken by following formula:

Y＝(Y”×IQ_TAB[qp])＞＞IQ_SHIFT[qp]；

Wherein, IQ_TAB[64]=32768 * 2 ^Qp/8, qp=0 ..., 63;

IQ_SHIFT[64]＝{

14，14，14，14，14，14，14，14，

13，13，13，13，13，13，13，13，

13，12，12，12，12，12，12，12，

11，11，11，11，11，11，11，11，

11，10，10，10，10，10，10，10，

10，9，9，9，9，9，9，9，

9，8，8，8，8，8，8，8，

7，7，7，7，7，7，7，7

}；

Wherein, IQ_TAB[qp] be the inverse quantization table, IQ_SHIFT[64] be the displacement table.

The 6th step, inverse transform block matrix column and the row after to inverse quantization carries out inverse transformation.The output of inverse quantization module is exactly the input of inverse transform block.Inverse transformation process and conversion process are opposite, also are to handle at row and column respectively.Concrete grammar is as follows:

1, establishes image parameter [Y]=[y1, y2, y3, the y4] of inverse quantization module output ^T, the output image parameter of inverse transformation is [X]=[x1, x2, x3, x4]; Like this, [X]=[A] ^TY[A];

2, with the commentaries on classics order matrix [A] of [A] ^TBe decomposed into [C] ^T* [B] ^T, wherein, [C] ^TBe the commentaries on classics order matrix of [C], [B] ^TFor the commentaries on classics order matrix of [B], use [B] then ^T, [C] ^TPriority premultiplication [Y].

(1) at first calculates [B] ^T* [Y] establishes the intermediate object program that obtains and is [M]=[m ₁, m ₂, m ₃, m ₄] ^T, this realizes with addition and displacement.Earlier with y ₁, y ₂Move to left 1, addition again obtains m1, m2:

Wherein, m1=2 * (y1+y3);

m2＝2×(y ₁-y ₃)；

Again with y2,, y4 does following processing: calculate m3 earlier, with y ₄Move to left one, obtain 2 * y ₄, add g ₄, g ₃, obtain m3, i.e. m3=y2-2 * y4-y4.Calculate m4 again, y2 is moved to left one, obtain 2 * y2, add y2, y4, obtain m4, i.e. m4=2 * y2+y2+y4.

(2) then, calculate [C] again ^T* [M] establishes the result who obtains and is [U]=[u1, u2, u3, u4] ^T, this realizes with addition:

u1＝m1+m4，u2＝m2+m3，u3＝m2-m3，u4＝m1-m4。

3, with intermediate object program matrix [M]=[m that obtains ₁, m ₂, m ₃, m ₄] ^T[B] taken advantage of on the right side again, and [C] gets matrix of consequence [X]=[x1, x2, x3, x4] to the end.Concrete grammar is as follows:

(1), earlier calculate [M] * [B], establish the intermediate object program that obtains and be [Z]=[z1, z2, z3, z4], this step realizes with addition and displacement.At this moment, establish [M]=[m1 ', m2 ', m3 ', m4 '], so just the form of expression with [M] changes the column vector form of expression into by the second vectorial form of expression of row that goes on foot.

At first, with m1 ', m3 ' moves to left one, obtains like this

z1＝2(m1’+m3’)；

z2＝2(m1’-m3’)；

Then, m4 ' is moved to left one, with the m2 addition, obtains z3 again:

z3＝m2’-2*m3’-m3’

At last, m2 ' is moved to left one, with m4 ' addition, obtains z4 again:

z4＝2*m2’+m2’+m4’

(2), again calculate [Z] * [C], can obtain final result [X] like this, this step is to realize with addition fully, wherein:

x1＝z1+z4

x2＝z2+z3

x3＝z2-z3

x4＝z1-z4

Because each line translation 3Bit that all moved to left when conversion, 3Bit therefore will move to right in inverse transformation.Rank transformation in the inverse transformation also is correspondingly processed.Like this, finish once complete inverse transformation, the 6Bit that move to right, at this moment, the computing position reaches 6Bit.But because when making the consistency quantification treatment, the mould of every row has been done the processing dwindled, therefore, will give corresponding the amplification here at the element of diverse location and recover.At formula:

$Y=C_{f}X{C}_f^T\&CircleTimes;E_r=\left(\left[\begin{array}{cccc}2& 2& 2& 2\\ 3& 1& -1& -3\\ 2& -2& -2& 2\\ 1& -3& 3& -1\end{array}\right]\mathrm{<figure-callout\; id="2"\; label="X"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">X</figure-callout>}\left[\begin{array}{cccc}2& 3& 2& 1\\ 2& 1& -2& -3\\ 2& -1& -2& 3\\ 2& -3& 2& -1\end{array}\right]\right)\&CircleTimes;\left[\begin{array}{cccc}{a}^2& \mathrm{ab}& a^2& \mathrm{<figure-callout\; id="2"\; label="ab\; ab\; b"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">ab</figure-callout>}& \\ \mathrm{ab}& b^{}{}^2& \mathrm{ab}& b^2\\ a^2& \mathrm{ab}& a^2& \mathrm{<figure-callout\; id="2"\; label="ab\; ab\; b"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">ab</figure-callout>}& \\ \mathrm{ab}& b^{}{}^2& \mathrm{<figure-callout\; id="2"\; label="ab\; b"\; filenames="C20041006270000193.png,C20041006270000201.png"\; state="\{\{state\}\}">ab</figure-callout>}& b^{}{}^2\end{array}\right]$

Three kinds of situations of middle branch give processing and amplifying: 1 if at a ²The element of position should amplify 16 * 16 times so, and like this, the computing position reaches log ₂256+6=14Bit, 5 the processing of then moving to right again returns to 14-5=9Bit with data at last; 2 if at the element of ab position, should amplify 16 * 20 times so, and like this, the computing position reaches log ₂320+6=14.32Bit 5 the processing of then moving to right again returns to 14.32-5=9.32Bit with data at last; 3 if at b ²The element of position should amplify 20 * 20 times so, and like this, the computing position reaches log ₂400+6=14.644Bit 5 the processing of then moving to right again returns to 14.644-5=9.644Bit with data at last.

The rapid DCT butterfly computation of inverse transformation as shown in Figure 4.

The tracking and the statistical form of the computing position when table 1 is each step operation and after the computing, when this table has shown different operating, the dynamic change of data bit and final computing position.

Table 1 data bit change list

Concrete operations are described

The dynamic change of data bit

Final result

X	0	9Bit
			A＝T·X	9+3	12Bit
B＝A·T	12+3	15Bit
			C＝Scale·B＞＞19	15+15-19	11Bit
D＝q·C＞＞15	11+15-15	11Bit
			E＝D·Iq＞＞Shift	11+15-14	12Bit
F＝E·T	12+1	13Bit
			G＝TT·F	13+1	14Bit
H＝G＞＞5	14-5	9Bit

Above embodiment is the unrestricted technical scheme of the present invention in order to explanation only, those of ordinary skill in the art is to be understood that: can make amendment or be equal to replacement the present invention, and not breaking away from any modification or partial replacement of the spirit and scope of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.

Claims (10)

1, a kind of low complex degree integer 4 * 4 discrete cosine transforms quantize implementation method, it is characterized in that, may further comprise the steps:

Step 1: the direct transform module is done 4 * 4 discrete cosine line translations of horizontal direction integer to infra-frame prediction or Inter prediction residue data block, and does the vertical direction rank transformation;

Step 1 also further comprises:

Step 11, direct transform module receive infra-frame prediction or inter prediction module residual error coefficient matrix;

Step 12, direct transform module are two matrixes that multiply each other with the kernel kernal mapping matrix decomposition, with first matrix premultiplication image parameter residual matrix, use the matrix behind first matrix premultiplication image parameter residual matrix of second matrix premultiplication again, obtain the intermediate object program matrix;

Step 13, direct transform module are taken advantage of the commentaries on classics order matrix of first matrix with the intermediate object program matrix right side that obtains, and the right side are taken advantage of the matrix right side that obtains to take advantage of second matrix again;

Step 14, direct transform module will be handled the resulting last transformation results matrix in back through it and output to Zoom module.

Step 2: the matrix norm that Zoom module aligns after the conversion module conversion carries out unified normalized;

Step 3: the computing gt of the matrix of consequence that Zoom module will obtain after normalized, and the computing position is limited within the location number;

Step 4: quantization modules quantizes the transformation matrix through convergent-divergent with an one-dimension array at coding side and decoding end, and the matrix of consequence after the output of entropy coding module quantizes;

Step 5: inverse quantization module is carried out inverse quantization with an one-dimension array to the transformation matrix after quantizing at coding side and decoding end;

Step 6: matrix column and the row of inverse transform block after to inverse quantization carries out inverse transformation.

2, low complex degree integer 4 * 4 discrete cosine transforms according to claim 1 quantize implementation method, it is characterized in that the kernel kernal mapping matrix in the described step 12 is:

$\left[\begin{array}{cccc}2& 2& 2& 2\\ 3& 1& -1& -3\\ 2& -2& -2& 2\\ 1& -3& 3& -1\end{array}\right].$

3, low complex degree integer 4 * 4 discrete cosine transforms according to claim 1 quantize implementation method, it is characterized in that first matrix in the described step 12 and second matrix are:

First matrix:

$\left[\begin{array}{cccc}2& 2& 0& 0\\ 0& 0& 1& 3\\ 2& -2& 0& 0\\ 0& 0& -3& 1\end{array}\right]$

Second matrix:

$\left[\begin{array}{cccc}1& 0& 0& 1\\ 0& 1& 1& 0\\ 0& 1& -1& 0\\ 1& 0& 0& -1\end{array}\right].$

4, low complex degree integer 4 * 4 discrete cosine transforms according to claim 1 quantize implementation method, it is characterized in that, each row operation position after horizontal direction integer 4 * 4 conversion in the described step 1 is 12, and it comprises 9 of 3 of the capable figure places of transformation matrix and residual error figure places.

5, low complex degree integer 4 * 4 discrete cosine transforms according to claim 1 quantize implementation method, it is characterized in that, in the described step 1 behind the vertical direction rank transformation computing position be 15.

6, low complex degree integer 4 * 4 discrete cosine transforms according to claim 1 quantize implementation method, it is characterized in that, in the described step 2 to the matrix norm after changing carry out unified normalized be specially with each element of forming matrix remove respectively its place row or column each element through square after the addition value of evolution again, make the mould of each row or column all equal 1.

7, low complex degree integer 4 * 4 discrete cosine transforms according to claim 1 quantize implementation method, it is characterized in that, the computing position restriction figure place in the described step 3 is 16.

8, low complex degree integer 4 * 4 discrete cosine transforms according to claim 1 quantize implementation method, it is characterized in that the quantification in the described step 4 specifically comprises:

Step 41, at a certain quantization step, according to formula Q (i)=32768/2 ^I/8Determine its corresponding quantization parameter, and be kept in the quantization table of an one dimension;

Step 42, will handle the resulting intermediate object program matrix Y ' in back through convergent-divergent and multiply by corresponding quantization parameter;

Step 43, again with the computing gt of the matrix of consequence that obtains in the described step 42, make final matrix of consequence computing position remain on below 16.

9, low complex degree integer 4 * 4 discrete cosine transforms according to claim 1 quantize implementation method, it is characterized in that the step of the inverse quantization in the described step 5 specifically comprises:

Step 51, a certain quantization step that is adopted when quantizing are according to formula IQ_TAB[64]=32768 * 2 ^Qp/8Determine its corresponding inverse quantization parameter, and be kept in the inverse quantization table of an one dimension;

Step 52, will be through resulting quantization matrix Y after the entropy decoding processing " multiply by corresponding inverse quantization parameter;

Step 53, again with the matrix of consequence computing gt that obtains in the described step 52, make the computing position of final matrix of consequence remain on below 16.

10, low complex degree integer 4 * 4 discrete cosine transforms according to claim 1 quantize implementation method, it is characterized in that the inverse transformation in the described step 6 specifically may further comprise the steps:

Step 61, inverse transform block are that two first matrixes that multiply each other change the order matrix and second matrix changes the order matrix with the commentaries on classics order matrix decomposition of kernel kernal mapping matrix, with the matrix behind second matrix commentaries on classics order matrix premultiplication inverse quantization, change the resulting matrix of the order aforementioned matrix operation of matrix premultiplication with first matrix again, obtain product matrix;

The commentaries on classics order matrix of the above-mentioned product matrix that step 62, inverse transform block will the obtain right side is again taken advantage of second matrix and first matrix, gets matrix of consequence to the end.

Images