Complexity Analysis of Adaptive Binary Arithmetic Coding Software Implementations

Higher precision range estimation for context‐based adaptive binary arithmetic coding

“…A better compression rate is obtained by using a look‐up‐table, index‐based entropy coder [7]. In [12] the results show that the adaptive binary range encoder leads to a reduction in computational complexity. However, the range encoder is not efficient for short binary sequences and still uses multiplication in interval partitioning.…”

An Efficient Adaptive Binary Arithmetic Coder With Low Memory Requirement

“…Let us define as a number of the input binary symbols, as a size of the output bit stream. Then, the complexity per input symbol for the binary arithmetic coder can be written as follows [19]: (29) where is the computation complexity of the interval division part per input binary symbol, is the computation complexity of the renormalization part per output binary symbol. For arithmetic coder the output bit stream size (30) where is an entropy of binary memoryless source with probability of ones , is an coding redundancy.…”

“…As an alternative to arithmetic coders, range coders use bytes as output bit stream element and do byte renormalization at a time [15]- [18]. In [19] it was shown that adaptive binary range coder allows to decrease computation complexity. However, range coder is not efficient for compression of small length binary sequences and it also uses a multiplication in the interval division part of ABAC, so it is not suitable for hardware applications.…”

An Adaptive Multialphabet Arithmetic Coding Based on Generalized Virtual Sliding Window

“…In [11], [12] a probability estimation for a binary source based on virtual sliding window was proposed. In this algorithm the probability that symbol x i is equal to one is estimated asp…”