CN101370138B - Decoding method for H.264 standard CAVLC residual error coefficient - Google Patents
Decoding method for H.264 standard CAVLC residual error coefficient Download PDFInfo
- Publication number
- CN101370138B CN101370138B CN 200710120442 CN200710120442A CN101370138B CN 101370138 B CN101370138 B CN 101370138B CN 200710120442 CN200710120442 CN 200710120442 CN 200710120442 A CN200710120442 A CN 200710120442A CN 101370138 B CN101370138 B CN 101370138B
- Authority
- CN
- China
- Prior art keywords
- coefficient
- nonzero coefficient
- decoding
- hangover
- index
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 206010019133 Hangover Diseases 0.000 claims description 49
- 230000003044 adaptive effect Effects 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000010168 coupling process Methods 0.000 description 2
- 238000005859 coupling reaction Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000013011 mating Effects 0.000 description 2
- 101000911390 Homo sapiens Coagulation factor VIII Proteins 0.000 description 1
- 101001126234 Homo sapiens Phospholipid phosphatase 3 Proteins 0.000 description 1
- 102100030450 Phospholipid phosphatase 3 Human genes 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000011549 displacement method Methods 0.000 description 1
- 238000006073 displacement reaction Methods 0.000 description 1
- 238000009472 formulation Methods 0.000 description 1
- 102000057593 human F8 Human genes 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 229940047431 recombinate Drugs 0.000 description 1
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a decoding method of the H.264 context self-adapting coding residual error coefficient. The method comprises following steps: firstly decoding the quantity of the nonzero coefficient and a binary group of the trailing coefficient quantity; then decoding the sign digit of the trailing coefficient; then decoding the extent value of the nonzero coefficient of the trailing coefficient; finally decoding the quantity of the previous zero number of the last nonzero coefficient and the quantity of the previous zero number of each nonzero coefficient. The binary group decoding of the nonzero coefficient and a binary group of the trailing coefficient can confirm the length of the code information according to the three-dimensional code list and the predetermined bit digits, further confirming the content of the binary group; the quantity of the nonzero coefficient and a binary group of the trailing coefficient quantity and the extent value of the nonzero coefficient use the quantity obtained by the method of two bytes of the prior zero. The method can enhance the decoding speed of the CAVLC code flow.
Description
Technical field
The present invention relates to the field of video and image coding and decoding, particularly a kind of coding/decoding method of context-adaptive variable-length encoding (CAVLC) residual error coefficient H.264.
Background technology
H.264, up-to-date international video encoding standard stipulates that its entropy coding can adopt the arithmetic coding (CABAC) of CAVLC or context-adaptive, wherein, the efficient of CAVLC improves many than the variable-length encoding of adopting in MPEG-1, the Moving Picture Experts Group-2, and computation complexity is lower many than CABAC, between code efficiency and complexity, obtained good compromise, H.264 consensus standard special recommendation this technology of employing in basic layer is used towards video monitoring, video conference etc.These application requirements code stream real-time decodings, and in CAVLC, different syntactic elements are adopted different coding/decoding methods: the index Columbus sign indicating number that employings such as macro block (mb) type, motion vector are direct or indirect is decoded, and the decoding of residual error coefficient is owing to need resolve one by one all code words that produce in the coding, thereby more complicated speed is lower.Code word specifically comprises the number of nonzero coefficient and two tuple coeff_token＜TotalCoeff of hangover number of coefficients, TrailingOnes 〉, amplitude, the number of last nonzero coefficient preceding 0 and the number of each nonzero coefficient preceding 0 of the nonzero coefficient of sign bit, the non-hangover of hangover coefficient.
The residual error coefficient decode time mainly consumes in the decoding of two tuples of the number of the number of nonzero coefficient and hangover coefficient, the decoding of this code word not only needs to carry out code table and switches, the one dimension code table that main is provided by consensus standard H.264 limits, in code word resolving, need to read in code word by bit, whenever reading in a bit will travel through in code table, to judge whether the part of having read in is an effective code word, up to the Bit String that has read in can with certain code word coupling in the code table till, thereby needing in decode procedure causing carries out read operation and compare operation repeatedly, and efficient is very low.
For the amplitude decoding of the nonzero coefficient of non-hangover, whether the determining of leading 0 number also consumed the plenty of time, because can only be 0 by bit decision, up to reading till 1.
In view of above problem, the CAVLC algorithm some implementations occurred after 2003 determine to adopt.Document 1 (Hsiu-Cheng Chang, Chien-Chang Lin and Jiun-In Guo, " A Novel Low-Cost High-Performance VLSI Architecture for MPEG-4AVC/H.264 CAVLC Decoding ", Proc.ISCAS 2005, pp.6110-6113,23-26 May 2005) VLSI (the Very Large Scale Integration that CAVLC decodes is disclosed, ultra-large integrated) design, document 2 (Xing Qin, Xiaolang Yan, " A memory and Speed EfficientCAVLC Decoder ", Proc.VCIP 2005, pp.1418-1426, Jul.2005) a programmable VLSI design is disclosed, it is lower that document 3 (patent " a kind of method based on the context-adaptive variable length decoding " of Tsing-Hua University's application, publication number 200610041780.X) has proposed a kind of memory requirement on this basis, speed is faster towards the CAVLC of integrated circuit decoding method for designing.More than each method all propose at the integrated circuit (IC) design of CAVLC, depend on this platform of integrated circuit (IC) design, and the software that is not suitable on the platforms such as universal cpu or DSP is realized.Document 4 (Korea S C﹠amp; The patent " the H.264 coding/decoding method that is used for fast CAVLC " of S technology Co., Ltd application, publication number 200610002800.2) a kind of three-dimensional code table is disclosed, can be used for the CAVLC software decode and realize.Yet the method is memory cost no matter, or operand is all bigger, thereby arithmetic speed is slower, has the possibility of further optimizing.
Simultaneously, above document all is that the code table at earlier version is optimized design, in up-to-date H.264 standard, original code table is adjusted, and has also increased the code table of nC==-2 especially.The code table that the present invention is directed to new H.264 consensus standard formulation has designed the CAVLC coding/decoding method.
Summary of the invention
Purpose of the present invention is bigger to the existing existing operand of coding/decoding method, and the slower problem of arithmetic speed is improved, and a kind of coding/decoding method able to programme of high efficiency context-adaptive code coefficient is provided.
For achieving the above object, according to an aspect of the present invention, provide a kind of coding/decoding method of H.264 standard CAVLC residual error coefficient, residual error coefficient has been carried out by high frequency after the zigzag scanning of low frequency, all code word orders are resolved one by one, comprise the following steps:
Based on the number of code table decoding nonzero coefficient and two tuples of hangover number of coefficients, wherein code table comprises the three-dimensional parameter of leading 0 number, information bit length and information, the information that different information bit length correspondences read according to described information bit length;
The sign bit of decoding hangover coefficient;
The decode amplitude of nonzero coefficient of non-hangover;
The decode number of last nonzero coefficient preceding 0;
The decode number of each nonzero coefficient preceding 0.
According to a further aspect in the invention, further comprise the following step based on the number of the nonzero coefficient of code table and the two tuples decoding of hangover number of coefficients:
Calculate nC according to standard code H.264, select code table according to nC;
Read leading 0 number;
According to code table of selecting and leading 0 number, read information bit, determine the number of nonzero coefficient and the binary group information of hangover number of coefficients.
In accordance with a further aspect of the present invention, read leading 0 number and further comprise following steps:
Read 2 byte code streams;
Read value is 1 highest order number in these 2 byte code streams, and then Zhi Qian figure place is leading 0 number.
The invention has the advantages that effective the minimizing read the code stream number of operations; Effectively reduced the code table memory space; Effectively reduced the code word matching times, once mated at the most, do not needed coupling just can determine code word under most of situation, improved the decoding speed of code stream for the number of nonzero coefficient and number two tuples of hangover coefficient.
Description of drawings
Below, describe embodiments of the invention in conjunction with the accompanying drawings in detail, wherein:
The reverse zigzag scanning that Fig. 1 residual error coefficient coding adopts.
The position relation of Fig. 2 nC and nA, nB.
H.264, the code table that Fig. 3 is used to encode in the consensus standard.
Fig. 4 index Columbus sign indicating number code word building method.
Fig. 5 is used for the code table of number two tuples (0=＜nC＜2) decoding of the number of nonzero coefficient and the coefficient that trails.
Fig. 6 is used for the code table of number two tuples (2=＜nC＜4) decoding of the number of nonzero coefficient and the coefficient that trails.
Fig. 7 is used for the code table of number two tuples (4=＜nC＜8) decoding of the number of nonzero coefficient and the coefficient that trails.
Fig. 8 is used for the number of nonzero coefficient and the number two tuples (code table of the decoding of 8=＜nC) of hangover coefficient.
Fig. 9 is used for the code table of number two tuples (nC==-1) decoding of the number of nonzero coefficient and the coefficient that trails.
Figure 10 is used for the code table of number two tuples (nC==-2) decoding of the number of nonzero coefficient and the coefficient that trails.
The number two tuple decoding process figure of the number of Figure 11 nonzero coefficient and hangover coefficient.
The number two tuple decoding process figure of the number of another nonzero coefficient of Figure 12 and hangover coefficient.
Embodiment
Residual error coefficient decode procedure based on the contextual adaptive variable length coding of consensus standard H.264 is the process of a complexity, by high frequency to the reverse zigzag scanning (as shown in Figure 1) of low frequency afterwards all code words is resolved one by one in that residual error coefficient is carried out.Existing coding/decoding method comprises following steps usually:
The first step: two tuples to the number of nonzero coefficient and hangover number of coefficients are decoded, and wherein, the hangover number of coefficients specifically is meant by low frequency non-ly 0 in the one dimensional system matrix number that high frequency sweep obtains, and absolute value is 1 continuous coefficients number.The hangover number of coefficients is 3 to the maximum, surpass 3 ± 1 coefficient regards common coefficient as, decoding process adopts the mode of the individual number decoder of each nonzero coefficient preceding 0.
Concrete decoding step comprises:
(1) based on context select code table: the selection of the number two tuples decoding institute use code table of the number of nonzero coefficient and hangover coefficient needs the basis distribution situation of piece residual error coefficient on every side, depends on the value of nC.The concrete calculation procedure of nC is as follows: if colourity DC coefficient decoding, and nC=-1 during the 4:2:0 form then, nC=-2 during the 4:2:2 form, nC=0 during the 4:4:4 form; Otherwise nC calculates (nA, nB, nC position concern as shown in Figure 2) according to the coefficient number nB of top piece coefficient number nA and left side piece: if nA and nB are available, and nC=(nA+nB+1)/2 then; Otherwise, if nA can use, nC=nA then, if nB can use, nC=nB then, otherwise nC=0.H.264 number two tuples of the number of nonzero coefficient and hangover coefficient decode the standard code table as shown in Figure 3;
(2) read code stream by bit, can mate with certain code word in the code table up to the Bit String that has read in; Take out this code word correspondence nonzero coefficient number and the hangover coefficient the number content.
Second step: to the sign bit decoding of hangover coefficient, 1 of each symbol decoding is decoded as 0 or 1 respectively according to positive and negative.
The 3rd step: according to scanning sequency the amplitude of the nonzero coefficient of non-hangover is used the index Columbus sign indicating number decoding of mapping, this is a kind of structurized decoding process, the code word make as shown in Figure 4, concrete steps comprise:
(1) reads leading 0 number: read by bit,, then continue to read next bit if be 0; If be 1, then carry out next step;
(2) amplitude of the nonzero coefficient of the non-hangover of calculating
Wherein message part is a part of representing amplitude in code table (as shown in Figure 4) inner code word, and its length equals leading 0 figure place, and Ceil represents the function that rounds up.
The 4th step: use adaptive code table to decode to 0 number before last nonzero coefficient;
The 5th step:, 0 number before each nonzero coefficient is decoded according to the adaptively selected code table of coded message.
From above-mentioned decode procedure as can be seen, because reading with code word operation relatively by bit of relating to of the number two tuple decode procedures of the number of nonzero coefficient and hangover coefficient is very many, can cause decoding speed seriously to reduce.The defective that exists in this decode procedure is by the one dimension characteristic decision of standard code table H.264 in essence.For this reason, the present invention has designed a kind of new code table, utilizes the three-dimensional parameter of leading 0 figure place, information bit length and message part to design three-dimensional code table, can directly determine number two tuples of the number and the hangover coefficient of nonzero coefficient thus.
Particularly, designed three-dimensional code table at number two tuples decoding the present invention of the number of nonzero coefficient and hangover coefficient based on the code word feature.By to the H.264 observation of standard code table among Fig. 3, be divided into 0=＜nC＜2,2=＜nC＜4,4=＜nC＜8, nC＞=8, nC==-1 and nC==-2 totally 6 code tables.At these six code tables, recombinate respectively, make up as Fig. 5, Fig. 6, Fig. 7, Fig. 8, Fig. 9 and six three-dimensional table shown in Figure 10.The part of leaving a blank in the code table represents there is not corresponding code word.In code table of the present invention, determine that the length of information bit has only two kinds at most after context and leading 0 number, length numerical value differs 1 at most, and this shelf space for compressed character code is very effective, utilizes this point can effectively compress memory space.In decode procedure, if the information bit length of leading 0 number correspondence has two kinds, then at first consider the situation that length is big, read in the number of corresponding positions, in the time mating, then be defined as this information bit length with code table; In the time can not mating, think that then information bit is the little situation of length with code table.Especially, when nC＞=8 (as shown in Figure 8), code table is a fixed length, need not carry out repeatedly relatively just can obtaining code word, and the present invention directly is changed to 0 with its leading 0 length, and 6 of back all are considered as information bit.
In code table, information both can be the index index of number two tuples of the number of nonzero coefficient and the coefficient that trails, also can directly be the number of nonzero coefficient and the number two tuple particular contents of hangover coefficient, the former can reduce code table and take up space, but need be according to number two tuples of the number of index calculation nonzero coefficient and hangover coefficient, the latter then can directly obtain required element value.Can select one of them according to the restriction of different platform resource.If in code table, deposit index, calculate number two tuples of the number and the hangover coefficient of nonzero coefficient in the following manner:
(if index＜6) {
=0) index+=3 so;
If (index＞=3) are index+=2 so;
TotalCoeff＝(index＞＞2)&3；
TrailingOnes＝index&3；
}
Otherwise
TotalCoeff＝3+(index-6)/4；
TrailingOnes＝(index-6)&3；
}
Obtain leading 0 number required time in order to reduce in the amplitude decode procedure of the nonzero coefficient of number two tuples of the number of nonzero coefficient and hangover coefficient and non-hangover, the present invention has designed a kind of scheme that obtains leading 0 number fast.Consider leading 0 the longest 12 bits that reach, reduce simultaneously the number of times of reading code stream as far as possible, when reading leading 0 figure place operation, read 2 byte lengths at every turn.Many in addition particular platforms have specialized instructions to realize this function, make full use of these instructions and just can further reduce and read the leading required cycle of 0 figure place.
At above-mentioned three-dimensional code table with obtain fast on the basis of scheme of leading 0 number, the present invention proposes a kind of coding/decoding method of H.264 standard CAVLC residual error coefficient, and concrete steps are as follows:
1, the number two tuples decoding of the number of nonzero coefficient and hangover coefficient:
Suppose that current code stream points to " 00000000010110110... ".
First: based on context select code table
Calculate nC according to standard code H.264, determine the code table that to select for use according to nC.Suppose nC=1, the corresponding code table of number two tuples decoding of the number of nonzero coefficient and hangover coefficient should be selected the code table (Fig. 5) corresponding to 0=＜nC＜2 so at this moment.
The second, read leading 0 number
Begin to read leading 0 number from the code stream current location.Method is as follows: read the code stream of 2 bytes, read value is 1 highest order number then, and figure place before is leading 0 number.In this example, read in " 0000000001011011 ", leading 0 number is 9.
The 3rd, read information bit, determine the number binary group information of the number and the hangover coefficient of nonzero coefficient
According to code table of selecting and leading 0 number, determine possibility information bit length, and read by displacement method.In this example, can determine that information bit length is 4, reads in 4 bits " 1011 " by displacement mode.The corresponding decimal system 11 of binary system " 1011 ".If directly deposit the number two tuple contents of the number and the hangover coefficient of nonzero coefficient in the code table, the number that then directly obtains the hangover coefficient is 0, and the number of nonzero coefficient was 7 (as shown in figure 11); If what deposit in the table is the index of code word, then can obtain 22, calculating the number that obtains the hangover coefficient in view of the above is 0, the number of nonzero coefficient was 7 (as shown in figure 12).
2, the sign bit decoding of hangover coefficient is decoded as positive and negative respectively according to code word 0 or 1;
3, the amplitude of the nonzero coefficient of non-hangover decoding
Suppose that current code stream points to " 000101101101100101111001... ".
The first step reads leading 0 number
Begin to read leading 0 number from the code stream current location.Method is as follows: read the code stream of 2 bytes, read value is 1 highest order number then, and figure place before is leading 0 number.In this example, read in " 0001011011011001 ", leading 0 number is 3.
Second goes on foot, and calculates the amplitude of the nonzero coefficient of non-hangover
4, first nonzero coefficient of decoding reverse scan;
5, the decode number of each nonzero coefficient preceding 0.
Claims (5)
1. the coding/decoding method of standard context adaptive variable length coding (CAVLC) residual error coefficient H.264 comprises the following steps:
Residual error coefficient is carried out by the zigzag scanning of high frequency to low frequency;
Based on the number of code table decoding nonzero coefficient and two tuples of hangover number of coefficients, wherein, described code table comprises standard code table is H.264 cut apart six code tables that obtain according to 0=＜nC＜2,2=＜nC＜4,4=＜nC＜8, nC＞=8, nC==-1 and nC==-2; Described code table comprises three-dimensional parameter: leading 0 number, information bit length and information, described code table is the also corresponding information bit information that reads according to information bit length under different information bit length, when information bit length is identical, can correctly find the number and the hangover number of coefficients information of nonzero coefficient; This step further comprises:
A, calculate nC, select described code table according to nC according to standard code H.264;
B, read leading 0 number;
C, according to code table of selecting and leading 0 number, read information bit, determine the number of nonzero coefficient and the binary group information of hangover number of coefficients;
The sign bit of decoding hangover coefficient;
The decode amplitude of nonzero coefficient of non-hangover;
The decode number of last nonzero coefficient preceding 0;
The decode number of each nonzero coefficient preceding 0.
2. the method for claim 1 is characterized in that described information is the number of nonzero coefficient and two tuples of hangover number of coefficients.
3. the method for claim 1 is characterized in that described information is the index value of two tuples of the number of nonzero coefficient and the number of coefficients of trailing, and can calculate described two tuples according to this value, and concrete computational process is as follows:
(if index＜6) {
=0) index+=3 so;
If (index＞=3) are index+=2 so;
TotalCoeff＝(index＞＞2)&3；
TrailingOnes＝index&3；
}
Otherwise
TotalCoeff＝3+(index-6)/4；
TrailingOnes＝(index-6)&3；
}
Wherein, index is described index value, and TotalCoeff is that the number and the TrailingOnes of described nonzero coefficient is described hangover number of coefficients.
4. the method for claim 1 is characterized in that the amplitude of the nonzero coefficient of the non-hangover of described decoding further comprises the following step:
Read leading 0 number;
Calculate the amplitude of the nonzero coefficient of non-hangover according to leading 0 number that reads.
5. method as claimed in claim 4 is characterized in that described leading 0 the number of reading further comprises following steps:
Read 2 byte code streams;
Read value is 1 highest order number in these 2 byte code streams, and then Zhi Qian figure place is leading 0 number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200710120442 CN101370138B (en) | 2007-08-17 | 2007-08-17 | Decoding method for H.264 standard CAVLC residual error coefficient |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200710120442 CN101370138B (en) | 2007-08-17 | 2007-08-17 | Decoding method for H.264 standard CAVLC residual error coefficient |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101370138A CN101370138A (en) | 2009-02-18 |
| CN101370138B true CN101370138B (en) | 2011-02-09 |
Family
ID=40413722
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200710120442 Active CN101370138B (en) | 2007-08-17 | 2007-08-17 | Decoding method for H.264 standard CAVLC residual error coefficient |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101370138B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873496B (en) * | 2010-05-24 | 2012-02-29 | 杭州海康威视软件有限公司 | Context-based self-adaption variable length decoding method and device of H.264 |
| CN102547260B (en) * | 2010-12-22 | 2014-11-19 | 联芯科技有限公司 | Decoding method of adaptive variable length coding based on context and system thereof |
| CN102355578B (en) * | 2011-05-25 | 2016-12-07 | 深圳市云宙多媒体技术有限公司 | A kind of entropy decoding method, device |
| CN102710937B (en) * | 2011-06-02 | 2014-08-20 | 龙芯中科技术有限公司 | Entropy decoding device and method for realizing CAVLC (context-based adaptive variable length coding) of H.246 |
| CN102263960B (en) * | 2011-08-15 | 2013-11-27 | 复旦大学 | Rapid context-adaptive variable-length coding (CAVLC) non-zero coefficient amplitude decoding method |
| GB2496201A (en) * | 2011-11-07 | 2013-05-08 | Sony Corp | Context adaptive data encoding and decoding |
| WO2013099892A1 (en) * | 2011-12-28 | 2013-07-04 | シャープ株式会社 | Arithmetic decoding device, image decoding device, and arithmetic encoding device |
| CN103384329A (en) * | 2013-05-07 | 2013-11-06 | 广东工业大学 | CAVLC decoding method based on no code table lookup |
| CN103414897B (en) * | 2013-07-31 | 2016-05-18 | 北京蛙视通信技术股份有限公司 | To method and the device of the decoding of video image entropy |
| CN107438181B (en) * | 2016-05-27 | 2019-12-06 | 贰陆陆(深圳)游戏开发有限公司 | audio and video processing method and device |
-
2007
- 2007-08-17 CN CN 200710120442 patent/CN101370138B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN101370138A (en) | 2009-02-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101370138B (en) | Decoding method for H.264 standard CAVLC residual error coefficient | |
| CN1787384B (en) | Decoding method and device, and encoding method and device | |
| CN100518325C (en) | Combined runlength coding and variable length coding for video compression | |
| CN101167366B (en) | Binarizing method and device | |
| CN1312938C (en) | Improved variable length decoder | |
| JP4313771B2 (en) | Method and apparatus for encoding transform coefficients in image and / or video encoder and decoder and corresponding computer program and corresponding computer readable storage medium | |
| CN100555877C (en) | Variable length decoding method, variable length coding apparatus | |
| CN101072353B (en) | Decoding system and graphics processing unit | |
| CN104394418B (en) | A kind of video data encoding, decoded method and device | |
| US20070080832A1 (en) | Decoding system and method based on context-based adaptive binary arithmetic coding | |
| CN104054342A (en) | High throughout coding for CABAC in HEVC | |
| CN101878651B (en) | Variable length coding of coefficient clusters for image and video compression | |
| WO2012159301A1 (en) | Method, device and medium for video entropy encoding and entropy decoding | |
| CN1984336A (en) | Binary method and device | |
| CN101562455A (en) | Context-based adaptive binary arithmetic coding (cabac) decoding apparatus and decoding method thereof | |
| CN103227924A (en) | Arithmetic coder and coding method | |
| WO2012097250A1 (en) | Method and apparatus for arithmetic coding and termination | |
| CN104918049A (en) | Binary arithmetic coding module suitable for HEVC (high efficiency video coding) standards | |
| CN100466743C (en) | Method for programmable entropy decoding based on shared storage and countra-quantization | |
| CN102355578A (en) | Entropy decoding method and device | |
| Hsieh et al. | A concurrent memory-efficient VLC decoder for MPEG applications | |
| CN101090501B (en) | Mould search type variable-length code-decode method and device | |
| CN101093998B (en) | Decoding method and device | |
| CN101198056A (en) | Variable length encoding method and device | |
| Lee et al. | A design of high-performance pipelined architecture for H. 264/AVC CAVLC decoder and low-power implementation |
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: HUAWEI TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: INSTITUTE OF COMPUTING TECHNOLOGY, CHINESE ACADEMY OF SCIENCES Effective date: 20140218 |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100080 HAIDIAN, BEIJING TO: 518129 SHENZHEN, GUANGDONG PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20140218 Address after: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee after: HUAWEI TECHNOLOGIES Co.,Ltd. Address before: 100080 Haidian District, Zhongguancun Academy of Sciences, South Road, No. 6, No. Patentee before: Institute of Computing Technology, Chinese Academy of Sciences |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211227 Address after: 450046 Floor 9, building 1, Zhengshang Boya Plaza, Longzihu wisdom Island, Zhengdong New Area, Zhengzhou City, Henan Province Patentee after: xFusion Digital Technologies Co., Ltd. Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: HUAWEI TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right |