Method and system for decoding exponential Columbus code, electronic equipment and storage medium

Abstract

The present application discloses a method and system for decoding an Exponential Columbus code, an electronic device and a computer-readable storage medium. The method includes: obtaining the bit stream of the Exponential Colomb code to be decoded, and sequentially converting the bits in the bit stream from the starting position to The bit is determined as the target bit, and the operation corresponding to the target bit is performed; wherein, the operation includes: judging whether the identification of the operation conforms to the coding rules of the Exponential Golomb code; wherein, the identification of the operation is from the starting position to the bit corresponding to the operation If so, output the decoding result corresponding to the operation; among them, the decoding result is the target decimal value minus one, the target decimal value is the decimal value corresponding to the target binary value, and the target binary value is the status flag; if not, execute The operation corresponding to the next bit of the target bit reduces the overhead and time delay of exponential Golomb code decoding.

Description

technical field [0001] The present application relates to the technical field of multimedia video processing, and more specifically, relates to an Exponential Golomb code decoding method and system, an electronic device, and a computer-readable storage medium. Background technique [0002] Exponential Columbus code is a special kind of Huffman code, its essence is that the probability of the encoded signal being 0 is at least 1 / 2, and the sum of the probabilities of 1 and 2 accounts for at least 1 / 2 of the remaining probabilities, so that analogy. The Exponential Columbus code is a variable-length code, and the code length is dynamically determined by the content of its code word. [0003] Existing exponential Golomb decoders usually use a hard look-up table to decode leading zeros, which will bring a large area overhead and a long delay. [0004] Therefore, how to reduce the overhead and time delay of exponential Golomb code decoding is a technical problem to be solved by...

AI Technical Summary

Problems solved by technology

[0003] Existing exponential Columbus decoders usually use a hard lookup table to decode leading zeros, which will bring large area overhead and long delay

Images