Arithmetic encoder based on probability polymerization
An arithmetic coding and encoder technology, applied in the field of binary arithmetic encoders, can solve problems such as poor parallelism and parallel multi-symbol decoding obstacles
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0032] The following code illustrates the codec. However, the present invention is not limited to the software mode, for example, custom integrated circuits and FPGAs, or other configurable processors can be the realization carriers of the present invention. In addition, the present invention is not limited to byte-based input and output, and the arithmetic codec based on word or double-word input and output can be fully realized by adopting other configurations. Set Range=0x10000, then iobits=8, that is, byte input and output. Choose t to be 128. The following is the c sample code of the encoder, where value, bytesOutstanding, backbyte, and currpos are all used to represent code.
[0033] typedef struct
[0034] {
[0035] unsigned int low, logProb, endhigh;
[0036] unsigned int value, bytesOutstanding, backbyte, currpos;
[0037]}EncodingEnvironment, *EncodingEnvironmentPtr;
[0038] typedef struct
[0039] {
[0040] char state; / / symbol probability state
[0041] u...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 