Download now Free registration required
In this paper, the authors propose a novel efficient adaptive binary arithmetic coder which is multiplication-free and requires no look-up tables. To achieve this, they combine the probability estimation based on a virtual sliding window with the approximation of multiplication and the use of simple operations to calculate the next approximation after the encoding of each binary symbol. They show that the proposed algorithm is faster and provides better compression efficiency compared to the M-coder in the CABAC entropy coding scheme of the H.264/AVC video coding standard.
- Format: PDF
- Size: 132.6 KB