Investigations on Algorithm Selection for Interval-Based Coding Methods

• Main Authors: Strutz, Tilo, Schreiber, Nico
• Format: Journal Article
• Language: English
• Published: 25.09.2024
• Subjects: Computer Science - Data Structures and Algorithms; Computer Science - Information Theory; Mathematics - Information Theory
• DOI: 10.48550/arxiv.2409.17015

Multimedia Tools and Applications, Published online 03 July 2025 There is a class of entropy-coding methods which do not substitute symbols by code words (such as Huffman coding), but operate on intervals or ranges. This class includes three prominent members: conventional arithmetic coding, range coding, and coding based on asymmetric numeral systems. To determine the correct symbol in the decoder, each of these methods requires the comparison of a state variable with subinterval boundaries. In adaptive operation, considering varying symbol statistics, an array of interval boundaries must additionally be kept up to date. The larger the symbol alphabet, the more time-consuming both the search for the correct subinterval and the updating of interval borders become. Detailed pseudo-code is used to discuss different approaches to speed up the symbol search in the decoder and the adaptation of the array of interval borders, both depending on the chosen alphabet size. It is shown that reducing the$\mathcal{O}$ -complexity does not lead to an acceleration in practical implementations if the alphabet size is too small. In adaptive compression mode, the binary indexing method proves to be superior when considering the overall processing time. Although the symbol search (in the decoder) takes longer than with other algorithms, the faster updating of the array of interval borders more than compensates for this disadvantage. A variant of the binary indexing method is proposed, which is more flexible and has a partially lower complexity than the original approach.