Answers are grounded in this paper and cite their sources.
We have proposed the concept of simple and fast binary arithmetic coder, STT-coder, in which arithmetic operation can be executed by referring a state transition table just like the case of Huffman coding. In our previous study, STT-coder with 3-bit interval register was designed and evaluated. Its coding efficiency was found to be satisfactory despite of the introduction of the simplification of the process. Then we have been trying to extend the register to 6-bit length in order to improve the performance of higher MPS probability sources. In this paper, we introduce a coding parameter of STT-coder, which is called as offset, and optimize the value to maximize the average coding efficiency. We further tried to enlarge the expected interval size after the renormalization to improve the coding efficiency of higher MPS probability sources by sacrificing the accuracy of interval division ratio in low MPS probability sources, which turned out to improve the coding efficiency in total.
No takes yet. Share an insight, caveat, or question.
Ueno et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: