An fast and effective algorithm for adaptive arithmetic coding
Guo Le
Abstract
Guo Le
Abstract
The principle of arithmetic coding is introduced at first.The model-based adaptive arithmetic coding is introduced too.An effective data structure which is binary indexed tree has been used for improving ze-ro-order adaptive arithmetic coding.It's showed that the new method can decrease the running time drastically for both centralized data set and uniform data set.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The principle of arithmetic coding is introduced at first.The model-based adaptive arithmetic coding is introduced too.An effective data structure which is binary indexed tree has been used for improving ze-ro-order adaptive arithmetic coding.It's showed that the new method can decrease the running time drastically for both centralized data set and uniform data set.
Key concepts: Arithmetic coding, Computer science, Coding (social sciences), Arithmetic, Context-adaptive binary arithmetic coding, Binary tree, Algorithm, Binary number