A coder and method and device to realize adaptive arithmetic code

Abstract

The provided adaptive arithmetic code method comprises: A. making received binary bit bin as current bin; B. with initial probability space of current bin, calculating probability space of the bin before normalization, and executing step C and D paralleled; C. taking the first normalization process for probability space of current bin as the initial space of next bin, back to step A; and D. taking second normalization process for probability space of current bin, and outputting bit code flow. This invention improves coding efficiency.

Description

technical field [0001] The present invention relates to the technical field of entropy coding, in particular to an encoder and a method and device for realizing adaptive arithmetic coding. Background technique [0002] The H.264 standard adopts context-based adaptive binary arithmetic coding (CABAC) to achieve high coding adaptability and high compression rate. CABAC encodes and decodes the input bit stream in units of slices, and adopts corresponding modeling methods for the header information and residual data contained in a slice to achieve maximum redundancy compression. During the encoding process, CABAC automatically adjusts the probability of 0 or 1 in the next bit according to the current bit (bit) and its probability characteristics, thereby changing the global probability space and generating a corresponding code stream. Wherein, the so-called slice means that an image is divided into many parts, one of which is called a slice unit. [0003] figure 1 It is a sch...

AI Technical Summary

Problems solved by technology

[0018] It can be seen that the existing encoding process needs to wait for the update of the probability space of the current bin and the bit stream corresponding to the output to be executed before continuing to update the probability space of the next bin

In fact, the dependency between the next bin and the current bin is only dependent on the probability space of the current bin after normalization, and has nothing to do with whether to output the bit stream corresponding to the current bin

Therefore, the problem in the prior art is that the process of updating the probability space of the current bin is embedded with the process of outputting the corresponding bit stream, resulting in low coding efficiency

Images