CN101605259B - Device and method for transforming coding and decoding for multimedia data - Google Patents

Device and method for transforming coding and decoding for multimedia data Download PDF

Info

Publication number
CN101605259B
CN101605259B CN 200910052271 CN200910052271A CN101605259B CN 101605259 B CN101605259 B CN 101605259B CN 200910052271 CN200910052271 CN 200910052271 CN 200910052271 A CN200910052271 A CN 200910052271A CN 101605259 B CN101605259 B CN 101605259B
Authority
CN
China
Prior art keywords
data
butterfly computation
carried out
bit
bit data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN 200910052271
Other languages
Chinese (zh)
Other versions
CN101605259A (en
Inventor
王灵光
鲍海峰
蒋琦
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhangjiagang Kangdexin Optronics Material Co Ltd
Original Assignee
Huaya Microelectronics Shanghai Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huaya Microelectronics Shanghai Inc filed Critical Huaya Microelectronics Shanghai Inc
Priority to CN 200910052271 priority Critical patent/CN101605259B/en
Publication of CN101605259A publication Critical patent/CN101605259A/en
Application granted granted Critical
Publication of CN101605259B publication Critical patent/CN101605259B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Complex Calculations (AREA)

Abstract

The invention discloses a method and a device for transforming decoding for multimedia data, a method and a device for transforming coding for multimedia data, and a device for transforming coding and decoding for multimedia data. The method for transforming the decoding for the multimedia data comprises the following steps: carrying out one-dimensional inverse transformation for a frequency domain data matrix, transposing the data matrix after the one-dimensional inverse transformation, and carrying out the one-dimensional inverse transformation for the transposed data matrix again to acquire a spatial domain data matrix. The one-dimensional inverse transformation comprises the following steps: ordering the data of each row of the data matrix and carrying out multistage composite butterfly operation for the ordered data of each row. The method and the device support various transformations in multiple video standards, and can realize that one set of the device can support various transformations of multiple standards. The device for transforming the coding and decoding for the multimedia data can realize positive transformation and reverse transformation in one set of device.

Description

Multi-medium data is carried out the device and method of conversion coding and decoding
Technical field
The present invention relates to multi-medium data encoding and decoding technique field, particularly multi-medium data is carried out the device and method of conversion coding and decoding.
Background technology
In multimedia technology field, exist the multiple international standard that rest image or moving image are carried out compression and decompression, for example comprise JPEG, MPEG-1, MPEG-2, MPEG-4, AVS, H.264 wait.
JPEG is a Joint Photographic Experts Group, issues in 1992, and obtains the identification of ISO 109918-1 in 1994.MPEG is the abbreviation of Moving Picture Experts Group.We said MPEG makes a general reference a series of video encoding standards that this group formulates now.This group formed in 1988, had formulated a plurality of standards such as MPEG-1, MPEG-2, MPEG-4 so far.
And H.264 be the video compression coding-decoding standard of issuing jointly in May, 2003 by International Telecommunication Union and International Organization for Standardization of new generation.Compare with the previous generation video encoding standard, its performance has significantly lifting, and compression ratio is more than the twice of MPEG-2 basically.It also comprises a series of new characteristics, compares former codec, not only can more effectively encode, and is more suitable under variety of network environments, using.Certainly these all are to be reached by the unprecedented soaring of computational complexity.
Data tones video encoding and decoding standard (AVS, Audio Video coding Standard) is a kind of multimedia source coding standard of being formulated by AVS working group.It is the general character basic standard of digital audio/video industrial colonies such as DTV, broadband network Streaming Media, mobile multimedia communication, videodisc.Its video section and on February 22nd, 2006 are the State Standard of the People's Republic of China by promulgation, and standard No. GB/T 20090.2-2006 was in enforcement on March 1 in 2006.AVS adopts the 8x8 integer transform, and series of new techniques such as infra-frame prediction, loop filtering had both reached and H.264 suitable performance, reduced implementation complexity again greatly.
In order to improve compression ratio, above-mentioned image or video compression standard are all used transition coding.Promptly through certain conversion image information is changed to frequency domain from transform of spatial domain at coding side, the energy of general pattern signal mainly concentrates on low frequency part, and human eye exactly possesses to the low frequency component sensitivity and to the insensitive characteristic of high fdrequency component.Therefore can utilize this characteristic that low frequency component is adopted thin the quantification, high fdrequency component is slightly quantized, carry out entropy coding after the quantification, reach the purpose of compression with this.Adopt corresponding inverse transformation that image information is transformed into spatial domain from frequency domain in decoding end.
The block size of the transition coding that respective standard adopted of Joint Photographic Experts Group and MPEG tissue is 8x8's; Standard two dimension (the 2D of strict orthogonal; Two-dimensional) discrete cosine transform (DCT; Discrete Cosine Transform) conversion and inverse discrete cosine transformation (IDCT, Inverse DiscreteCosine Transform).The AVS standard and H.264 standard adopt integral discrete cosine transform (abbreviation integer transform) and inverse transformation thereof, this conversion is the improvement and the simplification of normal scatter cosine transform.The size of transform block is 8x8 in the AVS standard; H.264 block size can carry out adaptively selected between 4x4 and 8x8 in the standard; And after the 4x4 conversion, carry out a Hadamard conversion (4x4 or 2x2 size) again, smooth region is better compressed for the DC coefficient.
The advantage of integer transform is the operand that has reduced encoding and decoding effectively, has avoided the mismatch phenomenon that floating-point operation caused simultaneously.But integer transform is not proper orthonormal transformation, therefore much will be no longer suitable based on orthogonality decomposition algorithm (such as Loeffler algorithm).
In addition, for standard H.264, exist the transform blocks of 8x8,4x4, the different sizes of 2x2, even onesize transform block, transformation matrix also is not quite similar, and for example for the piece of 4x4 size, existing integer transform also has the Hadamard conversion.If it is adopt many cover converting means to realize, not only loaded down with trivial details but also waste resource.
In addition, for pictures different or video compression standard, transformation matrix is not quite similar, such as MPEG-2, AVS, H.264 waits.If adopt many cover converting means to support various criterions respectively, then also will make and merge encoder or the fusing and decoding device is loaded down with trivial details and the waste resource.
In like manner, support at the same time in the equipment of encoding and decoding,, also can waste a large amount of resources if positive inverse transformation device designs separately.
Summary of the invention
First problem that the present invention will solve provides a kind of effective method and device, supports the multi-medium data of each standard to carry out the conversion decoding.
Second problem that the present invention will solve provides a kind of effective method and device, supports the multi-medium data of each standard to carry out transition coding.
The 3rd problem that the present invention will solve is in same set of device, both supported encoding function, also supports decoding function.
For solving first problem; The present invention provides a kind of method of multi-medium data being carried out the conversion decoding; Comprise: the frequency domain data matrix is carried out the one dimension inverse transformation, the data matrix after the one dimension inverse transformation is carried out transposition, carry out once more obtaining the spatial domain data matrix after the one dimension inverse transformation for the data matrix behind the transposition; Wherein, said one dimension inverse transformation comprises:
Data in each row of data matrix are sorted;
Each line data to after ordering carries out the multistage composite butterfly computation.
Correspondingly, the present invention also provides a kind of device that multi-medium data is carried out the conversion decoding, comprising:
One dimension inverse transformation arithmetic element is carried out the computing of one dimension inverse transformation with the frequency domain data matrix, and the data matrix behind the transposition is carried out obtaining the spatial domain data matrix after the one dimension inverse transformation once more;
The transposition arithmetic element is carried out transposition to the data matrix after the one dimension inverse transformation,
Wherein, said one dimension inverse transformation arithmetic element comprises:
The data arrangement unit sorts to data in each row of data matrix;
Compound butterfly processing element carries out the multistage composite butterfly computation to each line data after ordering.
For solving second problem; The present invention provides a kind of method of multi-medium data being carried out transition coding; Comprise: the spatial domain data matrix is carried out the one dimension direct transform, the data matrix after the one dimension direct transform is carried out transposition, carry out once more obtaining the frequency domain data matrix after the one dimension direct transform for the data matrix behind the transposition; Wherein, said one dimension direct transform comprises at least:
Each line data is carried out the multistage composite butterfly computation.
Correspondingly, the present invention also provides a kind of device that multi-medium data is carried out transition coding, comprising:
One dimension direct transform arithmetic element is carried out one dimension direct transform computing with the spatial domain data matrix, and the data matrix behind the transposition is carried out obtaining the frequency domain data matrix after the one dimension direct transform once more;
The transposition arithmetic element is carried out transposition to the data matrix after the one dimension direct transform,
Wherein, said one dimension direct transform arithmetic element comprises at least:
Compound butterfly processing element carries out the multistage composite butterfly computation to each line data.
For solving the 3rd problem, the present invention provides a kind of multi-medium data to carry out the device of transform coding and decoding, comprising:
First arithmetic element when conversion is decoded, is carried out shift operation to the two bits that is obtained, and the two bits after the shift operation is carried out the simplest butterfly computation; When transition coding, the two bits that is obtained is carried out the simplest butterfly computation, and the result of simple butterfly computation is carried out shift operation;
Second arithmetic element is carried out symmetrical butterfly computation to the two bits that is obtained;
The 3rd arithmetic element is carried out the simplest butterfly computation respectively to first and four figures certificate, the second and the 3rd bit data in the four figures certificate that is obtained;
The convergent-divergent arithmetic element is carried out the convergent-divergent computing to first and the four figures certificate in the four figures certificate that is obtained;
The shift operation unit carries out shift operation respectively to first to fourth bit data in the four figures certificate that is obtained;
The 4th arithmetic element is carried out the simplest butterfly computation to first and the four figures certificate in the four figures certificate that is obtained;
The 5th arithmetic element, to the four figures that obtained according in the first and the 3rd bit data, second and the four figures certificate carry out common butterfly computation respectively;
The 6th arithmetic element is carried out symmetrical butterfly computation respectively to first and four figures certificate, the second and the 3rd bit data in the four figures certificate that is obtained;
The 7th arithmetic element, to first and eight bit data in the eight bit data that is obtained, the second and the 7th bit data, the 3rd and the 6th bit data, the 4th and five-digit number according to carrying out the simplest butterfly computation respectively;
The transform coding and decoding control unit, corresponding current alternative types is exported corresponding multichannel and is selected signal, and starts the corresponding arithmetic element in first to the 7th arithmetic element, convergent-divergent arithmetic element and the shift operation unit;
Some MUXs are disposed at the input and the output of first to the 7th arithmetic element, convergent-divergent arithmetic element and shift operation unit respectively, select unblanking corresponding data passage according to multichannel, to confirm the data transfer sequence between each arithmetic element.
Compared with prior art, the present invention has the following advantages:
1) the present invention supports normal scatter cosine transform and inverse transformation, also supports for example AVS, H.264 substandard integer transform and inverse transformation, and Hadamard conversion and inverse transformation.And its data reordering method is more regular.
2) the present invention supports the conversion of different rank under each standard, has both supported the 8x8 conversion, also supports 4x4 or 2x2 conversion, can accomplish many engines to the low order conversion simultaneously.
3) the present invention supports the encoding and decoding integration program, and the splicing of carrying out different modes through Standardisation Cell can realize direct transform and inverse transformation, need not to do two covering devices.
Description of drawings
Fig. 1 a is two-dimentional direct transform processing procedure figure;
Fig. 1 b is two-dimension inverse transformation processing procedure figure;
Fig. 2 is that the embodiment of the invention 8 * 8 inverse transformations are handled Organization Chart;
Fig. 3 a is the sketch map of symmetrical butterfly computation in the embodiment of the invention;
Fig. 3 b is the sketch map of simple butterfly computation in the embodiment of the invention;
Fig. 3 c is the sketch map of common butterfly computation in the embodiment of the invention;
Fig. 4 is the embodiment of the invention 4 * 4 inverse transformations first processing engines Organization Charts;
Fig. 5 a is the embodiment of the invention 4 * 4 inverse transformations second processing engines Organization Charts;
Fig. 5 b is a configurable line sketch map in the framework shown in Fig. 5 a;
Fig. 6 is that the embodiment of the invention 2 * 2Hadamard inverse transformation is handled Organization Chart;
Fig. 7 is that Organization Chart is handled in the embodiment of the invention 8 * 8 direct transforms;
Fig. 8 is the embodiment of the invention 4 * 4 direct transforms first processing engines Organization Charts;
Fig. 9 is the embodiment of the invention 4 * 4 direct transforms second processing engines Organization Charts;
Figure 10 is that the embodiment of the invention 2 * 2Hadamard inverse transformation is handled Organization Chart;
Figure 11 a makes up the fusion cage composition that positive inverse transformation is used configurable line to unit A, B;
Figure 11 b makes up the fusion cage composition that positive inverse transformation is used configurable line to unit A, B, C;
Figure 12 a is the dividing elements sketch map that framework is handled in the embodiment of the invention 8 * 8 direct transforms;
Figure 12 b is the dividing elements sketch map that the embodiment of the invention 8 * 8 inverse transformations are handled framework;
Figure 12 c is the fusion cage composition of SP_8 unit in the positive inverse transformation of the embodiment of the invention, the configurable line of ASP_8 unit application;
Figure 13 is the fusion cage composition that 4 * 4 first engines are used configurable line in the positive inverse transformation of the embodiment of the invention;
Figure 14 a is the Organization Chart of Even_4 unit in the positive inverse transformation of the embodiment of the invention;
Figure 14 b is the Organization Chart of ODD_4 unit in the embodiment of the invention inverse transformation;
Figure 14 c is the Organization Chart of ODD_4 unit in the embodiment of the invention direct transform;
Figure 15 a is the Organization Chart of ODD_8 unit in the embodiment of the invention inverse transformation;
Figure 15 b is the dividing elements sketch map of ODD_8 unit in the embodiment of the invention inverse transformation;
Figure 16 a is the Organization Chart of ODD_8 unit in the embodiment of the invention direct transform;
Figure 16 b is the dividing elements sketch map of ODD_8 unit in the embodiment of the invention direct transform;
Figure 17 is the fusion cage composition of first kind of configurable line of ODD_8 unit application in the positive inverse transformation of the embodiment of the invention;
Figure 18 is the Organization Chart of second kind of configurable line of ODD_8 unit application in the embodiment of the invention direct transform;
Figure 19 is the Organization Chart that 4 * 4 second engines are used second kind of configurable line in the positive inverse transformation of the embodiment of the invention.
Embodiment
The mathematic(al) representation of two-dimension discrete cosine transform (2D-DCT) is:
Y p , q = α p α q Σ m = 1 N - 1 Σ m = 1 N - 1 X m , n cos π ( 2 m + 1 ) p 2 N cos π ( 2 n + 1 ) q 2 N , 0 ≤ p ≤ N - 1 0 ≤ q ≤ N - 1
α p = 1 / N , p = 0 2 / N , 1 ≤ p ≤ N - 1 α q = 1 / N , q = 0 2 / N , 1 ≤ q ≤ N - 1
Wherein, what the X matrix was corresponding is the view data of spatial domain, and what the Y matrix was corresponding is the frequency domain view data, and the block size of required conversion is NxN, and promptly the line number of X, Y matrix and columns all are N.
The mathematic(al) representation of 2-D discrete cosine inverse transformation (2D-IDCT) is:
X m , n = Σ p = 1 N - 1 Σ q = 1 N - 1 α p α q Y p , q cos π ( 2 m + 1 ) p 2 N cos π ( 2 n + 1 ) q 2 N , 0 ≤ m ≤ N - 1 0 ≤ n ≤ N - 1
α p = 1 / N , p = 0 2 / N , 1 ≤ p ≤ N - 1 α q = 1 / N , q = 0 2 / N , 1 ≤ q ≤ N - 1
Wherein the definition of X, Y, N is identical with direct transform.
If need carry out the size of the image block of conversion is NxN, definition space area image data are matrix X, and the frequency domain view data is matrix Y, and transformation matrix is A.The definition of transformation matrix A is following:
A = 2 N × 2 2 2 2 · · · · · · 2 2 cos ( 1 × 1 ) π 2 × N cos ( 1 × 3 ) π 2 × N · · · · · · cos ( 1 × ( 2 N - 1 ) ) π 2 × N · · · · · · · · · · · · · · · · · · · · · · · · cos ( ( N - 1 ) × 1 ) π 2 × N cos ( N - 1 ) × 3 ) π 2 × N · · · · · · cos ( ( N - 1 ) × ( 2 N - 1 ) ) π 2 N
Then the matrix form expression formula of two-dimension discrete cosine transform (2D-DCT) is:
Y=AXA T
The matrix form expression formula of its inverse transformation (2D-IDCT) is:
X=A TYA
The corresponding mathematic(al) representation of 1 dimension discrete cosine transform (1D-DCT) is:
y ( k ) = w ( k ) Σ n = 0 N - 1 x ( n ) cos π ( 2 n + 1 ) k 2 N , k=0,…,N-1
Wherein, w ( k ) = 1 N k = 0 2 N 1 ≤ k ≤ N ,
X is the one-dimensional data of spatial domain, and y is the one-dimensional data of frequency domain, and N is for needing the length of conversion vector.
The corresponding mathematic(al) representation of 1 dimension inverse discrete cosine transformation (1D-IDCT) is:
x ( n ) = Σ k = 0 N - 1 w ( k ) y ( k ) cos π ( 2 n + 1 ) k 2 N , n=0,…,N-1
Wherein, w, x, y, the definition of N is identical with direct transform (1D-DCT).
If the transition matrix A of definition is identical with the 2D conversion, then the matrix form expression formula of one dimension direct transform is:
y → = A x →
The matrix form expression formula of one dimension inverse transformation is:
Figure G2009100522710D00093
Wherein
Figure G2009100522710D00094
is the column vector that length is N.
Can find out by above-mentioned expression formula no matter two-dimensional transform is the result that direct transform or its inverse transformation can be regarded twice corresponding one-dimensional transform as.Shown in Fig. 1 a, two-dimentional direct transform can be decomposed into twice one dimension direct transform, after one dimension direct transform for the first time, with the matrix transpose that obtains, again matrix behind the transposition is carried out the one dimension direct transform second time, and final implementation space numeric field data is to the conversion of frequency domain data.Shown in Fig. 1 b, two-dimension inverse transformation can be decomposed into the one dimension inverse transformation twice, and after the process one dimension inverse transformation first time, the matrix arrangement with obtaining carries out the one dimension inverse transformation second time to matrix behind the transposition again, finally realizes the conversion of frequency domain data to spatial domain data.
Being interest of clarity, all is that example is described with the one-dimensional transform with down conversion.
So-called orthonormal transformation that is to say that transformation matrix is orthogonal matrix, i.e. AA T=A TA=E
The transformation matrix of conversion is in the AVS standard:
A = 8 8 8 8 8 8 8 8 10 9 6 2 - 2 - 6 - 9 - 10 10 4 - 4 - 10 - 10 - 4 4 10 9 - 2 - 10 - 6 6 10 2 - 9 8 - 8 - 8 8 8 - 8 - 8 8 6 - 10 2 9 - 9 - 2 10 - 6 4 - 10 10 - 4 - 4 10 - 10 4 2 - 6 9 - 10 10 - 9 6 - 2
H.2648x8 the transformation matrix of conversion is:
A = 1 1 1 1 1 1 1 1 3 / 2 5 / 4 3 / 4 3 / 8 - 3 / 8 - 3 / 4 - 5 / 4 - 3 / 2 1 1 / 2 - 1 / 2 - 1 - 1 - 1 / 2 1 / 2 1 5 / 4 - 3 / 8 - 3 / 2 - 3 / 4 3 / 4 3 / 2 3 / 8 - 5 / 4 1 - 1 - 1 1 1 - 1 - 1 1 3 / 4 - 3 / 2 3 / 8 5 / 4 - 5 / 4 - 3 / 8 3 / 2 - / 34 1 / 2 - 1 1 - 1 / 2 - 1 / 2 1 - 1 1 / 2 3 / 8 - 3 / 4 5 / 4 - 3 / 2 3 / 2 - 5 / 4 3 / 4 - 3 / 8
H.2644x4 the corresponding transformation matrix of direct transform is:
A = 1 1 1 1 2 1 - 1 - 2 1 - 1 - 1 1 1 - 2 2 - 1
H.2644x4 the corresponding transformation matrix of inverse transformation is:
A = 1 1 1 1 1 1 / 2 - 1 / 2 - 1 1 - 1 - 1 1 1 / 2 - 1 1 - 1 / 2
More than the pairing transformation matrix of these integer transforms do not satisfy orthonormal transformation, i.e. AA T=A TTherefore A=E is not proper orthonormal transformation.
The transformation matrix of 4x4hadamard conversion,
A = 1 1 1 1 1 1 - 1 - 1 1 - 1 - 1 1 1 - 1 1 - 1
The transformation matrix of 2x2hadamard conversion,
A = 1 1 1 - 1
Can find out through above-mentioned each transformation matrix, although AVS and H.264 in transformation matrix be not to be orthogonal matrix, they have and the identical symmetry of standard floating-point DCT/IDCT transformation matrix.And low order transformation matrix (such as 4x4 or 2x2) carries out bit-reversed by line index number to row and arrange again, and is identical by the symmetry of arranging the upper left corner, back submatrix with quadrat method with high level matrix.This is that each standard, the realization of different masses size conversion in same device provide possibility.
And in same standard, the pairing matrix of the direct transform of same nature and inverse transformation is a transposition relation, or the distortion of transposed matrix, promptly only carries out minor modifications, and does not destroy its original symmetry.From this character, the present invention is through guaranteeing the versatility of elementary cell, and realizes the compatibility of direct transform and inverse transformation through configurable line.
The concrete realization that below is applied to various conversion for the present invention respectively is illustrated.
(1) 8x8 inverse transformation:
The 8x8 inverse transformation that single standard or many standards merge (supporting many standard decodings) framework can realize through structure shown in Figure 2; Comprise the multistage composite butterfly computation in this structure, said compound butterfly computation can have following several kinds of forms: the 1) combination 2 of convergent-divergent computing and the butterfly computation) combination of a plurality of butterfly computations.
Wherein, butterfly computation also can be divided into: the simplest butterfly computation, symmetrical butterfly computation and common butterfly computation.Wherein, common butterfly computation comprises symmetrical butterfly computation, and symmetrical butterfly computation comprises the simplest butterfly computation.That is to say that the simplest butterfly computation is a kind of special case of symmetrical butterfly computation, symmetrical butterfly computation is a kind of special case of common butterfly computation.
Wherein, the convergent-divergent computing also comprises shift operation.
About above various computing meetings in following detailed description.
In single standard, the coefficient of butterfly computation, convergent-divergent computing is fixed.
And under the fusion standard, the coefficient of various computings is configurable.Configurable can the realization through two kinds of methods:
1) configurable multiplier promptly will be taken advantage of the coefficient of getting to be divided into some groups and be placed in advance in the memory, the corresponding different different coefficients of standard calls.
2) can replace multiplication through the way that displacement adds, soon all possibly all enumerate out, from the easier to the more advanced realizes, difficult multiplexing being easy to.
Suppose the one dimension inverse transformation: ( x → ) T = ( y → ) T A In, ( x ) → T = x 0 x 1 , ( y ) → T = y 0 y 1 , Then this one dimension inverse transformation can realize through the symmetrical butterfly computation shown in Fig. 3 a.Order A = c b - b c , Then the corresponding computing of this one dimension inverse transformation is:
x 0=c×y 0-b×y 1
(1)
x 1=b×y 0+c×y 1
Thereby for the one dimension inverse transformation, the most directly method such as above-mentioned configurable method 1) explain, will take advantage of the coefficient of getting; For example b, c; Be divided into some groups and be placed in advance in the memory, call different coefficients during corresponding different standard, carry out the related multiplying of conversion.
Coefficient is meant pairing coefficient in the conversion of each standard, for example y among Fig. 2 in the table 1 0, y 4To e 0, e 4Corresponding b, c value in the conversion)
Table 1
Figure DEST_PATH_GA20175265200910052271001D00015
Figure DEST_PATH_GA20175265200910052271001D00021
And above-mentioned multiplying also can be adopted above-mentioned configurable method 2) method that adds of the displacement explained.Adopt CSD coding back (annotate: carry out the CSD coding by absolute value, positive number remains unchanged, negative step-by-step negate, promptly 1 becomes-1 ,-1 becomes 1,0 and remain unchanged), the transfer pair of each standard situation of answering is seen table 2
Table 2
Annotate: expression can multiplexing part in the red circle of 12Bit. for the floating-point coefficient fixed point, the 3rd group of complete multiplexing the 2nd group of result.
Can find out that from last table this dish engine after realizing merging only needs 12 of adders.
Below also associative list 1 and table 2 are further specified in each conversion for example.
Therefore no matter realize the 8x8 inverse transformation, continue with reference to shown in Figure 2, be that single standard or many standards merge, and all can comprise following steps:
The first step is arranged 8 data of each row of the view data of importing by call number bit-reversed mode.Need to prove here; Delegation at behavior 8x8 matrix described in the first time one dimension inverse transformation; And in second time one dimension inverse transformation, because through transposition, thereby the delegation's essence in the one dimension inverse transformation is row of the matrix that obtains after the one dimension inverse transformation for the first time for the second time.Table 3 is depicted as the explanation that said inverted order is arranged.
Table 3
In second step, input image data is carried out convergent-divergent computing (shift operation also is a kind of of convergent-divergent computing).
For example in the AVS standard, after inverted order is arranged, y 0, y 4The 3bit that need move to left realize taking advantage of 8 computing, so the coefficient k of shift operation can get 3.And corresponding other standards, because y 0, y 4Need not the computing of convergent-divergent convergent-divergent, then k=0.Again for example in Moving Picture Experts Group-2, y 1, y 7Need carry out convergent-divergent, zoom factor w does
Figure G2009100522710D00142
And corresponding other standards, y 1, y 7Need not the convergent-divergent computing, then w=0.
The 3rd step is through the y behind the convergent-divergent 0, y 4Carry out the simplest butterfly computation, get e 0, e 4y 2, y 6Carry out symmetrical butterfly computation, get e 2, e 6Through the y behind the convergent-divergent 1, y 7Carry out the simplest butterfly computation, get d 1, d 7
Wherein, the simplest said butterfly computation, when being meant the b=c=1 in formula (1) with reference to Fig. 3 b, corresponding multiplying just can be reduced to add operation.For example for y 0, y 4Carry out the simplest butterfly computation, get e 0, e 4Can be undertaken by following formula:
e 0=y 0-y 4
e 4=y 0+y 4 (2)
Correspondingly, y 1, y 7Carry out the simplest butterfly computation, get d 1, d 7Then have with reference to formula (2):
d 1=y 1-y 7
d 7=y 1+y 7
And y 2, y 6Carry out symmetrical butterfly computation, get e 2, e 6Then have with reference to formula (1):
e 2=c×y 2-b×y 6
e 6=b×y 2+c×y 6
The 4th step, d 1, d 3Carry out common butterfly computation and get e 1, e 3, d 5, d 7Carry out common butterfly computation and get e 5, e 7
Wherein, to d 1, d 3Carry out common butterfly computation and get e 1, e 3, shown in Fig. 3 c, have:
e 1=a 00×d 1+a 20×d 3
e 3=a 02×d 1-a 22×d 3 (3)
Correspondingly, d 5, d 7Carry out common butterfly computation and get e 5, e 7Then have with reference to formula (3):
e 5=a 11×d 5-a 31×d 7
e 7=a 13×d 5+a 33×d 7
For example, said common butterfly computation, for the AVS standard, its coefficient a 00=2, a 20=3, a 02=3, a 22=4; Coefficient a 11=4, a 31=3, a 13=3, a 33=2; For standard H.264, its coefficient a 00=3, a 20=4, a 02=2, a 22=3; Coefficient a 11=3, a 31=2, a 13=4, a 33=3.
The 5th step, e 0, e 6Carry out the simplest butterfly computation, get f 0, f 6e 4, e 2Carry out the simplest butterfly computation, get f 2, f 4e 1, e 7Carry out common butterfly computation, get f 1, f 7e 3, e 5Carry out common butterfly computation, get f 5, f 3
Wherein, the simplest corresponding butterfly computation can be with reference to formula (2), and common butterfly computation then can be with reference to formula (3).
The 6th step, f 0, f 7Carry out the simplest butterfly computation, get x 0, x 7f 2, f 5Carry out the simplest butterfly computation, get x 1, x 6f 4, f 3Carry out the simplest butterfly computation, get x 2, x 5f 6, f 1Carry out the simplest butterfly computation, get x 3, x 4
Wherein, the simplest corresponding butterfly computation can be with reference to formula (2), and common butterfly computation then can be with reference to formula (3).
So far, one dimension 8x8 inverse transformation is accomplished.
To related multiplying in above-mentioned one dimension 8 * 8 inverse transformations; The for example multiplying of shape such as formula (1), formula (3) both can directly corresponding each standard be adopted the coefficient in the table 1, utilized multiplier directly to carry out multiplying; Also can use the method that displacement adds; Through the csd coding, and adopt the expression formula in the table 2, convert multiplying into add operation.
Need to prove that here the operating procedure in above-mentioned second step to the 6th step is merely illustrated steps for example, its sequencing all can be adjusted arbitrarily on the basis of conversion being undertaken by structure shown in Figure 2.
(2) 4x4 inverse transformation:
After 4 data of each row of 4x4 inverse transformation matrix are arranged by the call number bit-reversed; Identical by the symmetry of the upper left corner submatrix of call number bit-reversed arrangement back gained transformation matrix with 8x8 inverse transformation matrix, therefore wanting the 8x8 inverse transformation to want compatible 1 4x4 inverse transformation is not difficult matter.Yet 8x8 conversion resource needed is more than the twice of 4x4 conversion, if a compatibility 1 is overlapped the 4x4 inverse transformation when supporting the 8x8 inverse transformation, can meet with into a large amount of wastings of resources so.Therefore, in the present invention, overlap the rational transformation of slack resources process of 4x4 transform engine and the second cover engine is provided with respect to first.Below elaborate for this two covers engine respectively.
4x4 inverse transformation first engine:
4x4 inverse transformation first engine and 8x8 inverse transformation even number item decompose part compatibility fully.Realize this conversion,, need following steps with reference to shown in Figure 4:
The first step is arranged 4 data of each row of the view data of importing by call number bit-reversed mode.Need to prove here; Delegation at behavior 4x4 matrix described in the first time one dimension inverse transformation; And in second time one dimension inverse transformation, because through transposition, thereby the delegation's essence in the one dimension inverse transformation is row of the matrix that obtains after the one dimension inverse transformation for the first time for the second time.Table 4 is depicted as the explanation that said inverted order is arranged.
Table 4
Figure G2009100522710D00171
Second step, y 0, y 2Carry out the simplest butterfly computation, get e 0, e 2y 1, y 3Carry out symmetrical butterfly computation, get e 1, e 3
Wherein, y 0, y 2Carry out the simplest butterfly computation, get e 0, e 2, can be with reference to formula (2).
y 1, y 3Carry out symmetrical butterfly computation, get e 1, e 3, can be with reference to formula (1).
e 1=c×y 1-b×y 3
e 3=b×y 1+c×y 3
For example, said symmetrical butterfly computation, for standard H.264, its coefficient b=1, c=1/2.
And for 4x4hadamard, its corresponding coefficient b=1, c=1.
The 3rd step, e 0, e 3Carry out the simplest butterfly computation, get x 0, x 3e 2, e 1Carry out the simplest butterfly computation, get x 1, x 2
Wherein, e 0, e 3Carry out the simplest butterfly computation, get x 0, x 3, can be with reference to formula (2).e 2, y 1Carry out the simplest butterfly computation, get x 1, x 3, can be with reference to formula (2).
So far, one dimension 4x4 inverse transformation is accomplished.
To related multiplying in above-mentioned one dimension 4 * 4 inverse transformations; The for example multiplying of shape such as formula (1) both can directly corresponding each standard be adopted the coefficient in the table 1, utilized multiplier directly to carry out multiplying; Also can use the method that displacement adds; Through the csd coding, and adopt the expression formula in the table 2, convert multiplying into add operation.
4x4 inverse transformation second engine:
Second engine is mutually multiplexing with the decomposition of 8x8 inverse transformation odd term, and its Organization Chart is with reference to shown in Fig. 5 a, and the configurable line that is made up of two MUXs among the available Fig. 5 b of intersection line part is realized the compatibility with the 8x8 inverse transformation.
Shown in Fig. 5 a and Fig. 5 b, realize that this conversion needs following steps:
The first step is pressed y with the view data of input 1, y 2, y 3, y 0Sequence arrangement.
Second step, y 1, y 3Carry out symmetrical butterfly computation, get e 3, e 1y 2, y 0Carry out the simplest butterfly computation and get e 2, e 0
For example, said symmetrical butterfly computation, for standard H.264, its coefficient a 00=1, a 02=1/2, a 20=1/2, a 22=1.
Can see y in conjunction with Fig. 2 and Fig. 5 a here, 1, y 3, y 2, y 0The compute mode that the 4th step was adopted in the above-mentioned 8x8 inverse transformation explanation that the butterfly computation that is carried out is multiplexing is with the compatibility of realization with the 8x8 inverse transformation.Just here, y 1, y 3In the butterfly computation that is carried out, its each above-mentioned coefficient makes that this butterfly computation essence is symmetrical butterfly computation, and its calculating process can be corresponding to formula (1).And y 2, y 0In the butterfly computation that is carried out, for example for standard H.264, its coefficient a 11=a 33=a 13=a 31=1, thereby its essence is the simplest butterfly computation, its calculating process can be corresponding to formula (2).
In the 3rd step,, realize e through the MUX switch 2, e 1Coordinated transposition.
Continuation is with reference to shown in Fig. 5 b, with e 2, e 1Intersect and insert in two identical MUXs, bring in through the selection of control MUX and realize e 2, e 1Coordinated transposition.Specifically, with e 2Insert 0 end of MUX 51 and 1 end of MUX 52, with e 1Insert 1 end of MUX 51 and 0 end of MUX 52.When for MUX 51 and 52, control simultaneously its let 1 end signal through the time, MUX 51 is just through signal e 1, and MUX 52 is just through signal e 2Thereby, realized e 2, e 1Coordinated transposition.
The 4th step, e 0, e 3Carry out the simplest butterfly computation, get x 0, x 3e 2, e 1Carry out the simplest butterfly computation, get x 1, x 2
Can see e in conjunction with Fig. 2 and Fig. 5 a here, 0, e 3, e 2, e 1The compute mode that the 5th step was adopted in the above-mentioned 8x8 inverse transformation explanation that the butterfly computation that is carried out is multiplexing is with the compatibility of realization with the 8x8 inverse transformation.Just here, e 0, e 3In the butterfly computation that is carried out, coefficient u=v=1, thereby its essence is the simplest butterfly computation, its calculating process can be corresponding to formula (2).And e 2, e 1In the butterfly computation that is carried out, p=q=1, thereby its essence is the simplest butterfly computation, its calculating process can be corresponding to formula (2).
So far, one dimension 4x4 inverse transformation is accomplished.
(3) 2x2 rank Hadamard inverse transformation:
The realization Organization Chart of 2x2 rank Hadamard inverse transformation is with reference to shown in Figure 6.2x2 rank Hadamard inverse transformation with reference to formula (2), can realize through the simplest symmetrical butterfly computation.
(4) 8x8 direct transform:
The 8x8 direct transform that single standard or many standards merge (supporting many standard decodings) framework can realize through structure shown in Figure 7.In single standard, the coefficient of butterfly computation and convergent-divergent computing is fixed, and under the fusion standard, each operation coefficient is configurable.Configurable method can just repeat no more with reference to respective description in the above-mentioned inverse transformation here.
No matter realize the 8x8 direct transform, be single standard or many standards, with reference to shown in Figure 7, all can comprise following steps:
The first step, x 0, x 7Carry out the simplest butterfly computation, get f 0, f 7x 1, x 6Carry out the simplest butterfly computation, get f 2, f 5x 2, x 5Carry out the simplest butterfly computation, get f 4, f 3, x 3, x 4Carry out the simplest butterfly computation, get f 6, f 1
Second step, f 0, f 6Carry out the simplest butterfly computation and get e 0, e 6f 2, f 4Carry out the simplest butterfly computation, get e 4, e 2f 1, f 7Carry out common butterfly computation, get e 1, e 7f 3, f 5Carry out common butterfly computation, get e 5, e 3
In conjunction with Fig. 2 and shown in Figure 7, here, f 1, f 7, f 3, f 5Corresponding operation mode in the 8x8 inverse transformation that the butterfly computation that carries out has been multiplexing in fact.Just here, f 1, f 7In the butterfly computation that carries out, each coefficient is all different, its essence is common butterfly computation, and its calculating process can be corresponding to formula (3).And f 3, f 5In the butterfly computation that carries out, each coefficient is all different, its essence is common butterfly computation, and its calculating process can be corresponding to formula (3).
The 3rd step, e 1, e 3Carry out common butterfly computation and get d 1, d 3, e 5, e 7Carry out common butterfly computation and get d 5, d 7
The 4th step, e 0, e 4Carry out the simplest butterfly computation.e 2, e 6Carry out symmetrical butterfly computation, get y 2, y 6d 1, d 7Carry out the simplest butterfly computation.
The 5th step is to d 5, d 3Carry out the convergent-divergent computing and get y 5, y 3, to e 0, e 4The simplest butterfly computation result carry out the convergent-divergent computing, y 0, y 4, to d 1, d 7The simplest butterfly computation result carry out the convergent-divergent computing and get y 1, y 7So far one dimension 8x8 direct transform is accomplished.
(5) 4x4 direct transform:
The reason identical with inverse transformation, the direct transform of 4x4 rank also can be accomplished with double engines.
4x4 rank direct transform first engine:
4x4 direct transform first engine and 8x8 direct transform even number item decompose part compatibility fully.With reference to shown in Figure 8, realize that this conversion needs following steps:
The first step, x 0, x 3Carry out the simplest butterfly computation e 0, e 3x 1, x 2Carry out the simplest butterfly computation, get e 2, e 1
Second step, e 0, e 2Carry out the simplest butterfly computation, get y 0, y 2e 1, e 3Carry out symmetrical butterfly computation, get y 1, y 3So far, the one dimension 4x4 direct transform in first engine is accomplished.
4x4 direct transform second engine:
Second engine and 8x8 direct transform odd term decompose mutually multiplexing, and its Organization Chart is with reference to shown in Figure 9, and the line that intersects partly realizes with configurable line and the compatibility of 8x8 direct transform, and it specifies please the second engine explanation with reference to the 4x4 inverse transformation.
(6) 2x2 rank Hadamard direct transform:
The realization Organization Chart of 2x2 rank Hadamard direct transform is with reference to shown in Figure 10.The Hadamard direct transform of 2x2 rank with reference to formula (2), can realize through the simplest symmetrical butterfly computation.
(7) realization of positive inverse transformation integration program:
For example two conversion that unit A, B are combined into, after its direct transform is unit A computing in proper order, input unit B computing, and after its inverse transformation is the unit B computing in proper order, input unit A computing.For the occasion that positive and negative conversion all exists,, then obviously just not too suitable for the nervous situation of resource if this positive and negative conversion is designed corresponding converting means respectively.
And this positive inverse transformation can merge through the mode of configurable line in fact.Shown in Figure 11 a; The output of unit B is inserted 1 end of MUX 110 and 0 end of MUX 112; The output of unit A is inserted 0 end of MUX 111 and 1 end of MUX 112, and the conversion control signal is then imported 0 end of MUX 110 and 1 end of MUX 111.Then when the conversion control signal is chosen 0 end of MUX 110, after its order change is unit A computing, input unit B computing, i.e. direct transform.And when the conversion control signal is chosen 1 end of MUX 110, after its order change is the unit B computing, input unit A computing, i.e. inverse transformation.Thereby, in same device, just can realize direct transform and two kinds of functions of inverse transformation through the mode of configurable line.
And, can adopt identical configurable connection mode equally for the conversion that three unit A, B, C are combined into.The concrete structure of its configurable line is with reference to shown in Figure 11 b, equally through the cooperating of each unit and MUX, with the conversion control signal to different the choosing of MUX, thereby realize A-respectively B-the direct transform of C, and C-B-the inverse transformation of A.
By that analogy, for more unit, can realize that equally the fusion of positive inverse transformation in same device realizes based on the processing mode of identical configurable line.
And can find out that from the Organization Chart of above-mentioned illustrational inverse transformation, direct transform all conversion all are to be made up of identical basic sub-units, realize its direct transform or inverse transformation through different connection modes.Therefore, can be through being decomposed into various arithmetic elements to all direct transforms and inverse transformation, each unit connects by the mode of configurable line then, just can constitute required various direct transforms or inverse transformation.
The present invention carries out a kind of execution mode of the device of transform coding and decoding to multi-medium data, comprising:
First arithmetic element (Even_4) when conversion is decoded, is carried out shift operation to the two bits that is obtained, and the two bits after the shift operation is carried out the simplest butterfly computation; When transition coding, the two bits that is obtained is carried out the simplest butterfly computation, and the result of simple butterfly computation is carried out shift operation;
Second arithmetic element (ODD_4) is carried out symmetrical butterfly computation to the two bits that is obtained;
The 3rd arithmetic element (SP_4) is carried out the simplest butterfly computation respectively to first and four figures certificate, the second and the 3rd bit data in the four figures certificate that is obtained;
The convergent-divergent arithmetic element is carried out the convergent-divergent computing to first and the four figures certificate in the four figures certificate that is obtained;
The shift operation unit carries out shift operation respectively to first to fourth bit data in the four figures certificate that is obtained;
The 4th arithmetic element (ODD_8_1) is carried out the simplest butterfly computation to first and the four figures certificate in the four figures certificate that is obtained;
The 5th arithmetic element (ODD_8_2), to the four figures that obtained according in the first and the 3rd bit data, second and the four figures certificate carry out common butterfly computation respectively;
The 6th arithmetic element (ODD_8_3) is carried out symmetrical butterfly computation respectively to first and four figures certificate, the second and the 3rd bit data in the four figures certificate that is obtained;
The 7th arithmetic element (SP_8), to first and eight bit data in the eight bit data that is obtained, the second and the 7th bit data, the 3rd and the 6th bit data, the 4th and five-digit number according to carrying out the simplest butterfly computation respectively;
The transform coding and decoding control unit, corresponding current alternative types is exported corresponding multichannel and is selected signal, and starts the corresponding arithmetic element in first to the 7th arithmetic element, convergent-divergent arithmetic element and the shift operation unit;
Some MUXs are disposed at the input and the output of first to the 7th arithmetic element, convergent-divergent arithmetic element and shift operation unit respectively, select unblanking corresponding data passage according to multichannel, to confirm the data transfer sequence between each arithmetic element.
Wherein, the corresponding information of said alternative types comprises: current conversion belongs to any in direct transform, the inverse transformation, is the conversion under which kind of video standard, and what the size of transform block is.
Shown in Fig. 2 and Figure 12 a, for example for 8 * 8 direct transforms, its framework can be divided into SP_8 (symmetric part) and two unit of ASP_8 (asymmetric part).And combine shown in Fig. 7 and Figure 12 b, for example for 8 * 8 inverse transformations, its framework also can be divided into SP_8 and two unit of ASP_8.Then under the known situation of the operation result of SP_8 unit and ASP_8 unit, mode that just can be through configurable line merges the positive inverse transformation in 8 stratum time.Shown in Figure 12 c; To connect method identical with the line of Figure 11 a; The output of SP_8 unit is inserted 0 end of MUX 122 and 1 end of MUX 123; The output of ASP_8 unit is inserted 1 end of MUX 121 and 0 end of MUX 123,0 end of conversion control signal input MUX 121 and 1 end of MUX 122.Then when the conversion control signal is chosen 0 end of MUX 121, just realize SP_8->the direct transform computing of ASP_8, and when the conversion control signal is chosen 1 end of MUX 122, just realize ASP_8->the inverse transformation computing of SP_8.
Next, to the ASP_8 unit in the direct transform, its framework can be divided into Even_8 (even number item) and two unit of ODD_8 (odd term).And for the ASP_8 unit in the inverse transformation, its framework also can be divided into Even_8 and two unit of ODD_8.Below can be elaborated for the fusion method that relates in Even_8 and the ODD_8 unit.
To the Even_8 unit in the direct transform, its framework (first engines of corresponding 4 * 4 conversion) can be divided into SP_4 (symmetric part) and two unit of ASP_4 (asymmetric part).And for the Even_8 unit in the inverse transformation, its framework also can be divided into SP_4 and two unit of ASP_4.Then under the known situation of the operation result of SP_4 unit and ASP_4 unit, the Even_8 unit that also can align through the mode of configurable line in the inverse transformation merges.The mode of its configurable line is with reference to shown in Figure 13; Through SP_4 is linked to each other with corresponding MUX with ASP_4, to realize SP_4->the direct transform computing of ASP_4, and ASP_4-the inverse transformation computing of SP_4; Its connected mode can contrast above-mentioned explanation, just no longer has been repeated in this description.
Next, to the ASP_4 unit in the direct transform, its framework can be divided into Even_4 (even number item) and two unit of ODD_4 (odd term).And for the ASP_4 unit in the inverse transformation, its framework also can be divided into Even_4 and two unit of ODD_4.
And the structure of the Even_4 unit in the positive inverse transformation is identical, and shown in Figure 14 a, it is 2 * 2 mapped structures, comprises convergent-divergent computing and the simplest butterfly computation.
ODD_4 unit in the positive inverse transformation is then slightly different, but can realize through different connection modes.In conjunction with ODD_4 unit in the inverse transformation shown in ODD_4 unit and Figure 14 c in the direct transform shown in Figure 14 b; Through changing connection mode; The difference of ODD_4 unit only is that input signal is different with the output signal in the positive inverse transformation, and it is the symmetrical butterfly computation of same structure.
For the ODD_8 unit in the inverse transformation, shown in Fig. 2, Figure 15 a and Figure 15 b, its structure can be divided into 5 grades of unit, is followed successively by according to the signal processing sequence of inverse transformation: convergent-divergent, ODD_8I, ODD_8II, ODD_8III and displacement.
And correspondingly; ODD_8 unit in the direct transform; Shown in Fig. 7, Figure 16 a and Figure 16 b, its structure also can be divided into 5 grades of unit, is followed successively by according to the signal processing sequence of direct transform: ODD_8III, ODD_8II, ODD_8I, convergent-divergent and displacement (displacement also is a kind of convergent-divergent).For example, for the AVS standard, the coefficient W=1 of its convergent-divergent computing, the Coefficient m of shift operation=1, n=0; For the AVS standard, the coefficient W=1 of its convergent-divergent computing, the Coefficient m of shift operation=4, n=3.
Can see that from above analysis the structure of each sub-cells in the ODD_8 unit in the positive inverse transformation is identical, and except the sequence of positions of displacement is identical, the sequence of positions of other subelements is inverted order each other just in time.Therefore, also can use the method for configurable line to merge.It comprises two kinds of optional methods, below further specifies respectively for these two kinds of methods.
Method one: inner configurable line.That is to say, between each sub-cells of ODD_8, carry out configurable line.With reference to shown in Figure 17, same method with reference to above-mentioned configurable line is connected ODD_8III, ODD_8II, ODD_8I and unit for scaling with corresponding MUX, and through the output of displacement subelement.Control through the conversion control signal; When the conversion control signal is chosen 0 end; Realize convergent-divergent-ODD_8I->ODD_8I->ODD_8III->the inverse transformation computing of displacement, when the conversion control signal is chosen 1 end, realize ODD_8III->ODD_8II->ODD_8I->the direct transform computing of convergent-divergent-displacement.
In addition; Second engine of 4 * 4 conversion under this mode; Shown in Fig. 5 a, Fig. 9, Figure 15 a, Figure 15 b; Configurable line through between ODD_8_II and ODD_8_III is realized, thereby is realized and the compatibility of ODD_8 unitary operation that the mode for configurable line just no longer has been repeated in this description here.
The configurable connection mode of method one is more directly perceived, but the complexity of its line is higher.Thereby method two has been arranged: keep interconnector constant, but the whole line that is connected with the outside changes in proper order.That is to say the line order that keeps each sub-cells of ODD_8 for positive inverse transformation homogeneous phase with, and adjustment gets into the signal sequence of ODD_8 unit.In conjunction with Figure 15 a, Figure 16 a and shown in Figure 180, the inside and outside line of inverse transformation order changes, but direct transform is changed, and makes the also connection mode of each subelement in the reusable inverse transformation of connection mode of each subelement in the direct transform.
And 4x4 conversion second engine under the method; In conjunction with Fig. 5 a, Fig. 9 and shown in Figure 19; The inside and outside line order of inverse transformation changes, but direct transform is changed, and makes the also connection mode of each subelement in the reusable inverse transformation of connection mode of each subelement in the direct transform.
Therefore, the employing method has at 2 and notes 1) the inputoutput data number order is different; 2) compute mode of the same race is for positive inverse transformation, and its corresponding parameter is different.
In sum, when using configurable line and carry out the fusion of positive inverse transformation, any one N rank conversion can be decomposed into symmetric part (SP_N) and, asymmetric part (ASP_N partly carries out cascade), the direct transform symmetric part preceding asymmetric part after.The asymmetric part of inverse transformation is preceding, symmetric part after.But not symmetric part can be divided into independently singular transformation (ODD_N) and mutation changes (EVEN_N) two parts.EVEN_N is identical with connatural low order conversion (N/2 rank), therefore can continue to decompose the fusion application until accomplishing the conversion all levels by this rule.

Claims (15)

1. method of multi-medium data being carried out conversion decoding; Said method support is carried out the conversion decoding with the multi-medium data of each standard; Said method comprises: the frequency domain data matrix is carried out the one dimension inverse transformation, the data matrix after the one dimension inverse transformation is carried out transposition, carry out once more obtaining the spatial domain data matrix after the one dimension inverse transformation for the data matrix behind the transposition; It is characterized in that said one dimension inverse transformation comprises:
Data in each row of data matrix are sorted;
Each line data to after ordering carries out the multistage composite butterfly computation;
Wherein, when said frequency domain data matrix is 8 exponent numbers during according to matrix, said ordering is carried out the multistage composite butterfly computation to each line data after arranging by the call number inverted order and is comprised for arranging by the call number bit-reversed:
First and second bit data in each row after arranging by the call number bit-reversed is carried out shift operation and the simplest butterfly computation; The 5th and eight bit data carry out convergent-divergent computing and the simplest butterfly computation; The 3rd and four figures according to carrying out symmetrical butterfly computation, obtain first order intermediate data;
First and four figures certificate, the second and the 3rd bit data to first order intermediate data are carried out the simplest butterfly computation respectively; The 5th of first order intermediate data with arrange by the call number bit-reversed after each row in the 7th bit data, first order intermediate data the 6th with arrange in each row of back the 6th bit data by the call number bit-reversed and carry out common butterfly computation respectively, obtain second level intermediate data;
The 5th and eight bit data to second level intermediate data are carried out symmetrical butterfly computation and shift operation, and the 6th and the 7th bit data is carried out symmetrical butterfly computation and shift operation, obtain third level intermediate data;
The four figures of first bit data of second level intermediate data and the third level intermediate data after the shift operation is carried out the simplest butterfly computation respectively according to first bit data of the third level intermediate data after the four figures certificate of the second order digit certificate of the 3rd bit data of the 3rd bit data of the third level intermediate data after the second order digit certificate of, second level intermediate data and the shift operation, second level intermediate data and the third level intermediate data after the shift operation, second level intermediate data and the shift operation.
2. method of multi-medium data being carried out the conversion decoding as claimed in claim 1; It is characterized in that; When said frequency domain data matrix was 4 rank matrixes, said ordering was carried out the multistage composite butterfly computation to each line data after arranging by the call number inverted order and is comprised for arranging by the call number bit-reversed:
First and second bit data in each row after arranging by the call number bit-reversed is carried out the simplest butterfly computation, the 3rd with four figures according to carrying out symmetrical butterfly computation, acquisition first order intermediate data;
First and four figures certificate, the second and the 3rd bit data to first order intermediate data are carried out the simplest butterfly computation respectively.
3. method of multi-medium data being carried out the conversion decoding as claimed in claim 1; It is characterized in that; When said frequency domain data matrix is 4 rank matrixes; Said ordering be to each line data by second, third, the rearrangement of the 4th, first order, each line data after the ordering is carried out the multistage composite butterfly computation comprises:
The first and the 3rd bit data in each row after the ordering is carried out common butterfly computation, and second carries out common butterfly computation, acquisition first order intermediate data with four figures certificate;
First and four figures certificate to first order intermediate data is carried out symmetrical butterfly computation, carries out the computing of symmetrical adjustment shape after the second and the 3rd bit data coordinated transposition with first order intermediate data.
4. method of multi-medium data being carried out the conversion decoding as claimed in claim 1; It is characterized in that; When said frequency domain data matrix was 2 rank matrixes, said ordering was carried out the multistage composite butterfly computation to each line data after arranging by the call number inverted order and is comprised for arranging by the call number bit-reversed:
First and second bit data in each row after arranging by the call number bit-reversed is carried out the simplest butterfly computation.
5. like claim 1 or the 3 described methods that multi-medium data is carried out the conversion decoding, it is characterized in that the multiplying that comprises in said common butterfly computation, the symmetrical butterfly computation adopts multiplication mode or displacement add mode to carry out.
6. the method that multi-medium data is carried out the conversion decoding as claimed in claim 2 is characterized in that, the multiplying that comprises in the said symmetrical butterfly computation adopts multiplication mode or displacement add mode to carry out.
7. method of multi-medium data being carried out transition coding; Said method support is carried out transition coding with the multi-medium data of each standard; Said method comprises: the spatial domain data matrix is carried out the one dimension direct transform, the data matrix after the one dimension direct transform is carried out transposition, carry out once more obtaining the frequency domain data matrix after the one dimension direct transform for the data matrix behind the transposition; It is characterized in that said one dimension direct transform comprises at least:
Each line data is carried out the multistage composite butterfly computation;
Wherein, when said spatial domain data matrix is 8 exponent numbers during according to matrix, each line data is carried out the multistage composite butterfly computation comprises:
To in each row first with eight bit data, the second and the 7th bit data, the 3rd and the 6th bit data, the 4th and the five-digit number certificate carry out the simplest butterfly computation respectively, acquisition first order intermediate data;
First and four figures of first order intermediate data are carried out the simplest butterfly computation respectively according to, the second and the 3rd bit data, the 5th and eight bit data, the 6th and the 7th bit data carry out symmetrical butterfly computation respectively, acquisition second level intermediate data;
First and second bit data to second level intermediate data is carried out the simplest butterfly computation and shift operation; The 3rd and four figures according to carrying out symmetrical butterfly computation; The the 5th and the 7th bit data, the 6th and eight bit data carry out common butterfly computation respectively, obtain third level intermediate data;
The 5th and eight bit data to third level intermediate data are carried out the simplest butterfly computation, convergent-divergent computing and shift operation, and the 6th and the 7th bit data is carried out shift operation.
8. the method that multi-medium data is carried out transition coding as claimed in claim 7 is characterized in that, when said spatial domain data matrix is 4 rank matrixes, each line data is carried out the multistage composite butterfly computation comprise:
To first carrying out the simplest butterfly computation respectively according to, the second and the 3rd bit data, acquisition first order intermediate data in each row with four figures;
First and second bit data to first order intermediate data is carried out the simplest butterfly computation, the 3rd and four figures according to carrying out symmetrical butterfly computation.
9. the method that multi-medium data is carried out transition coding as claimed in claim 7 is characterized in that, when said spatial domain data matrix is 4 rank matrixes, each line data is carried out the multistage composite butterfly computation comprise:
To first carrying out symmetrical butterfly computation respectively according to, the second and the 3rd bit data, acquisition first order intermediate data in each row with four figures;
With the second and the 3rd bit data coordinated transposition of first order intermediate data, to first bit data of first order intermediate data and the 3rd bit data after the coordinated transposition, the four figures of second order digit certificate and first order intermediate data after the coordinated transposition according to carrying out common butterfly computation respectively.
10. the method that multi-medium data is carried out transition coding as claimed in claim 7 is characterized in that, when said spatial domain data matrix is 2 rank matrixes, each line data is carried out the multistage composite butterfly computation comprise:
First and second bit data in each row is carried out the simplest butterfly computation.
11., it is characterized in that the multiplying that comprises in said common butterfly computation, the symmetrical butterfly computation adopts multiplication mode or displacement add mode to carry out like claim 7 or the 9 described methods that multi-medium data is carried out transition coding.
12. the method that multi-medium data is carried out transition coding as claimed in claim 8 is characterized in that, the multiplying that comprises in the said symmetrical butterfly computation adopts multiplication mode or displacement add mode to carry out.
13. one kind is carried out the device of transform coding and decoding to multi-medium data, said device support is carried out transition coding with the multi-medium data of each standard, it is characterized in that, said device comprises:
First arithmetic element when conversion is decoded, is carried out shift operation to the two bits that is obtained, and the two bits after the shift operation is carried out the simplest butterfly computation; When transition coding, the two bits that is obtained is carried out the simplest butterfly computation, and the result of simple butterfly computation is carried out shift operation;
Second arithmetic element is carried out symmetrical butterfly computation to the two bits that is obtained;
The 3rd arithmetic element is carried out the simplest butterfly computation respectively to first and four figures certificate, the second and the 3rd bit data in the four figures certificate that is obtained;
The convergent-divergent arithmetic element is carried out the convergent-divergent computing to first and the four figures certificate in the four figures certificate that is obtained;
The shift operation unit carries out shift operation respectively to first to fourth bit data in the four figures certificate that is obtained;
The 4th arithmetic element is carried out the simplest butterfly computation to first and the four figures certificate in the four figures certificate that is obtained;
The 5th arithmetic element, to the four figures that obtained according in the first and the 3rd bit data, second and the four figures certificate carry out common butterfly computation respectively;
The 6th arithmetic element is carried out symmetrical butterfly computation respectively to first and four figures certificate, the second and the 3rd bit data in the four figures certificate that is obtained;
The 7th arithmetic element, to first and eight bit data in the eight bit data that is obtained, the second and the 7th bit data, the 3rd and the 6th bit data, the 4th and five-digit number according to carrying out the simplest butterfly computation respectively;
The transform coding and decoding control unit, corresponding current alternative types is exported corresponding multichannel and is selected signal, and starts the corresponding arithmetic element in first to the 7th arithmetic element, convergent-divergent arithmetic element and the shift operation unit;
Some MUXs are disposed at the input and the output of first to the 7th arithmetic element, convergent-divergent arithmetic element and shift operation unit respectively, select unblanking corresponding data passage according to multichannel, to confirm the data transfer sequence between each arithmetic element.
14. as claimed in claim 13 multi-medium data is carried out the device of transform coding and decoding, it is characterized in that,
The input of first, second arithmetic element, output and the input of the 3rd arithmetic element, output intersect to link to each other via a circuit-switched data passage of first, second MUX respectively afterwards imports the 3rd MUX;
Via the continuous back input of circuit-switched data passage intersection the 8th MUX of the 4th to the 7th MUX, the output of the 8th MUX links to each other with the shift operation unit respectively for the input of convergent-divergent arithmetic element, first to the 6th arithmetic element, output;
The input of another circuit-switched data passage of another circuit-switched data passage of first and second MUX, the output of the 3rd MUX, the 4th to the 7th MUX, the output of shift operation unit and the 7th arithmetic element, output intersect to link to each other via a circuit-switched data passage of the 9th, the tenth MUX respectively afterwards imports the 11 MUX, another circuit-switched data passage receiving conversion control signal of said the 9th, the tenth MUX.
15. described multi-medium data is carried out the device of transform coding and decoding like claim 13 or 14, it is characterized in that the multiplying that comprises in said common butterfly computation, the symmetrical butterfly computation adopts multiplication mode or displacement add mode to carry out.
CN 200910052271 2009-05-31 2009-05-31 Device and method for transforming coding and decoding for multimedia data Active CN101605259B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200910052271 CN101605259B (en) 2009-05-31 2009-05-31 Device and method for transforming coding and decoding for multimedia data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200910052271 CN101605259B (en) 2009-05-31 2009-05-31 Device and method for transforming coding and decoding for multimedia data

Publications (2)

Publication Number Publication Date
CN101605259A CN101605259A (en) 2009-12-16
CN101605259B true CN101605259B (en) 2012-11-21

Family

ID=41470777

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200910052271 Active CN101605259B (en) 2009-05-31 2009-05-31 Device and method for transforming coding and decoding for multimedia data

Country Status (1)

Country Link
CN (1) CN101605259B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102006478A (en) * 2010-11-29 2011-04-06 青岛海信信芯科技有限公司 Inverse transformation method and device of video decoding
CN102404569B (en) * 2011-11-08 2014-01-08 复旦大学 Universal method capable of being used for various video standards and multi-size two-dimensional integer cosine inverse transform
CN102387367B (en) * 2011-11-08 2014-01-08 复旦大学 Universal method applied to kinds of video standards for multi-size two-dimensional integer cosine transform
CN106231304A (en) * 2016-08-30 2016-12-14 成都金本华电子有限公司 A kind of video decoding integer transform method based on one-dimensional quick dish algorithm improvement
CN109451307B (en) * 2018-11-26 2021-01-08 电子科技大学 One-dimensional DCT operation method and DCT transformation device based on approximate coefficient
CN113840101A (en) * 2020-06-24 2021-12-24 重庆山淞信息技术有限公司 Video image processing method and device based on FPGA

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030081674A1 (en) * 2001-09-18 2003-05-01 Microsoft Coroporation Block transform and quantization for image and video coding
WO2004006219A1 (en) * 2002-07-06 2004-01-15 Koninklijke Philips Electronics N.V. Matrix display including inverse transform decoding and method of driving such a matrix display
CN1770864A (en) * 2005-09-09 2006-05-10 海信集团有限公司 4x4 discrete cosine transform rapid parallel device based on AVS and its method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1268231A (en) * 1997-08-25 2000-09-27 夸尔柯姆股份有限公司 Variable block size 2-dimensional inverse discrete cosine transform engine

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030081674A1 (en) * 2001-09-18 2003-05-01 Microsoft Coroporation Block transform and quantization for image and video coding
WO2004006219A1 (en) * 2002-07-06 2004-01-15 Koninklijke Philips Electronics N.V. Matrix display including inverse transform decoding and method of driving such a matrix display
CN1770864A (en) * 2005-09-09 2006-05-10 海信集团有限公司 4x4 discrete cosine transform rapid parallel device based on AVS and its method

Also Published As

Publication number Publication date
CN101605259A (en) 2009-12-16

Similar Documents

Publication Publication Date Title
CN101605259B (en) Device and method for transforming coding and decoding for multimedia data
Budagavi et al. Core transform design in the high efficiency video coding (HEVC) standard
TWI471013B (en) Computational complexity and precision control in transform-based digital media codec
CA2526762C (en) Reversible transform for lossy and lossless 2-d data compression
US6587590B1 (en) Method and system for computing 8×8 DCT/IDCT and a VLSI implementation
KR101362696B1 (en) Signal transformation apparatus applied hybrid architecture, signal transformation method, and recording medium
Suzuki et al. Integer DCT based on direct-lifting of DCT-IDCT for lossless-to-lossy image coding
CN102804171B (en) For 16 point transformation of media data decoding
CN102804172A (en) 16-point Transform For Media Data Coding
CN103380425A (en) 32-point transform for media data coding
Tran et al. Linear phase paraunitary filter bank with filters of different lengths and its application in image compression
JPH0373689A (en) Method and apparatus for compressing image data by mathematical conversion at low custom for low speed transmission of image sequence
CA2446874C (en) Apparatus and method for encoding and computing a discrete cosine transform using a butterfly processor
CN1981534B (en) Image encoding device, image decoding device, and integrated circuit used therein
CN100409693C (en) Orthogonal transformation method for image and video compression
Yoshida et al. Two dimensional non-separable adaptive directional lifting structure of discrete wavelet transform
TWI412281B (en) A Method of Calculating Reverse Conversion of Low Complexity
CN100450184C (en) Discrete cosine transforming method operated for image coding and video coding
CN100452880C (en) Integral discrete cosine transform method in use for encoding video
CN101095137A (en) 8x8 transform and quantization
CN105872536B (en) A kind of method for compressing image based on dual coding pattern
Yao et al. Area and throughput efficient IDCT/IDST architecture for HEVC standard
Jdidia et al. Hardware implementation of 1-D 8-point adaptive multiple transform in post-HEVC standard
CN100384253C (en) Method of hardware realizing AVS/II.264 colority interpolation and apparatus therefor
Yang et al. An efficient two-dimensional inverse discrete cosine transform algorithm for HDTV receivers

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
ASS Succession or assignment of patent right

Owner name: SHANGHAI WEIZHOU MICROELECTRONIC TECHNOLOGY CO., L

Free format text: FORMER OWNER: HUAYA MICRO-ELECTRONIC (SHANGHAI) CO., LTD.

Effective date: 20130121

C41 Transfer of patent application or patent right or utility model
TR01 Transfer of patent right

Effective date of registration: 20130121

Address after: 201203, Shanghai 690 Zhangjiang Road, Pudong No. 5 Building No. 2 floor

Patentee after: SHANGHAI WEI ZHOU MICROELECTRONICS TECHNOLOGY CO., LTD.

Address before: 201203 Shanghai city Pudong New Area Songtao Road No. 696 building 4F Lenovo

Patentee before: Huaya Microelectronics (Shanghai) Co., Ltd.

TR01 Transfer of patent right

Effective date of registration: 20200330

Address after: 215634 north side of Chengang road and west side of Ganghua Road, Jiangsu environmental protection new material industrial park, Zhangjiagang City, Suzhou City, Jiangsu Province

Patentee after: ZHANGJIAGANG KANGDE XIN OPTRONICS MATERIAL Co.,Ltd.

Address before: 201203, Shanghai 690 Zhangjiang Road, Pudong No. 5 Building No. 2 floor

Patentee before: WZ TECHNOLOGY Inc.

TR01 Transfer of patent right