Industrial Technology Research Institute

Wen-Shan Wang

Tse-Min Chen

Po-Wen Cheng

A dynamic decoding lookup table generation method is provided. The generation method includes: receiving a variable length coding (VLC) table; and dynamically establishing an adaptive decoding lookup table from the VLC table according to a target decoding rate and a free system memory resource.

Dynamic decoding lookup table generation method and electronic device applying the same

A decoding method and a decoding apparatus is provided. The decoding apparatus includes a control unit, a lookup unit, an arithmetic unit, a first switch and a second switch. The control unit receives a part of a bin string. The lookup unit finds out a flag, a length and an indicator, corresponding to the part of the bin string, from a lookup table according to the part of the bin string and a node, and judges whether the flag is equal to a predetermined value. The arithmetic unit finds out a syntax element symbol corresponding to the bin string according to a basic syntax element symbol. The first switch connects the control unit to the lookup unit or the arithmetic unit. The second switch outputs the indicator as the basic syntax element symbol to the arithmetic unit or feeds the indicator as a next node back to the lookup unit.

Decoding method and apparatus

An intra prediction method for a luma block of a video is provided. The present invention provides a solution for unifying the intra prediction of the luma block of the video, which simplifies a plurality of prediction equations defined by video standard. The predication values of common terms in the prediction equations are calculated in advance and directly selected for predicting the luma block of the video. Accordingly, only a few function parameters or register settings are needed to be modified, and then a plurality of prediction modes may use the same software function or hardware circuit to obtain the prediction values.

Intra prediction method for luma block of video

A decoding method comprising the following steps is provided. The mlookup index for a new lookup table is obtained according to the number of leading 1's in the bit stream. The nbase Huffman code in a simplified Huffman table is obtained according to the mlookup index. The (n+1) most significant bits (MSB) are obtained from the bit stream according to the nbase Huffman code. A difference is generated according to the (n+1) MSBs in the bit stream and the nbase Huffman code. Whether the difference is less than 0 is checked. If yes, a symbol index is generated according to the difference and the nbase symbol index, and a symbol is obtained according to the symbol index. If no, n is decreased or increased by 1 according to the method being used, and the data in the simplified Huffman table is compared continually.

Growing community of inventors

Taipei, Taiwan

Wen-Shan Wang