Decoding method and decoder for unary/kth order exponential Golomb codes
AssigneeMStar Semiconductor, Inc.
InventorsYao-Hsin Wang, Yu-Chao Lin
Life of this patent
Estimating the term…
Abstract
A decoding method for unary/kth order exponential Golomb (UEGk) codes is provided. The first step is a receiving step: receiving N bits from an input stream and updating a bit count. If the N bits are all one, the receiving step is re-performed. If the N bits includes zero, a searching step is performed to find a first value based on the bit count. Subsequently, according to the bit count and a threshold value, a remaining bit number M is calculated. A second value is generated based on M remaining bits received from the input stream. Then, the first value and the second value are added, so as to generate an index.
Claims12
A decoding method for a unary/kth order exponential Golomb (UEGk) code, comprising:
- a) receiving an N number of bits from an input bitstream, and updating a bit count according to N, wherein N is a positive integer;
- b) repeating step (a) when all of the N number of bits are “1”;
- c) generating a first value through a look-up table search at least according to the bit count when not all of the N number of bits are “1”;
- d) determining a remaining bit count M according to the bit count and a threshold;
- e) generating a second value according to an M number of remaining bits received from the input bitstream;
- and
- f) adding the first value and the second value to generate an index.
A decoder for a unary/kth order exponential Golomb (UEGk) code, comprising:
- a reception module, for receiving an input bitstream, and outputting an N number of bits each time, wherein N is a positive integer;
- a counter module, for recording a bit count, and updating the bit count according to the N number of bits when the reception module outputs the N number of bits each time;
- a bit zero detection module, for detecting whether the N number of bits last output by the reception module are “0” or “1”;
- a memory unit, storing a look-up table;
- a look-up table search module, for searching through the look-up table at least according to the bit count when the bit zero detection module determines that not all of the N number of bits last output by the reception module are “1” to generate a first value;
- a remaining bit determination module, for determining a remaining bit count M at least according to the bit count and a threshold, and generating a second value according to an M number of remaining bits received from the input bitstream;
- and
- a calculation module, for adding the first value and the second value to generate an index.
A decoding method for a unary/kth order exponential Golomb (UEGk) code, comprising:
- a) receiving an N number of bits from an input bitstream;
- b) determining whether all of the N number of bits received in step a) are “1”, and updating a bit count according to the N number of bits;
- c) determining whether the bit count is greater than a threshold when a determination result of step b) is yes;
- d) repeating steps a) and b) when the determination result of step c) is no;
- e) updating an index according to the bit count when a determination result of step c) is yes, and repeating steps a) and b);
- f) determining whether the bit count is greater than the threshold when the determination result of step b) is no;
- g) calculating a final index according to the bit count when a determination result of step f) is no;
- h) calculating a remaining value according to the threshold and the bit count when the determination result of step f) is yes;
- and
- i) adding the index and the remaining value to generate the final index.
Dependencies are inferred from the claim text.