HackerPapers

arXiv:1402.3392cs.IT

Interleaved entropy coders

Fabian Giesen

Abstract

The ANS family of arithmetic coders developed by Jarek Duda has the unique property that encoder and decoder are completely symmetric in the sense that a decoder reading bits will be in the exact same state that the encoder was in when writing those bits---all "buffering" of information is explicitly part of the coder state and identical between encoder and decoder. As a consequence, the output from multiple ABS/ANS coders can be interleaved into the same bitstream without any additional metadata. This allows for very efficient encoding and decoding on CPUs supporting superscalar execution or SIMD instructions, as well as GPU implementations. We also show how interleaving without additional metadata can be implemented for any entropy coder, at some increase in encoder complexity.

arXiv comments
16 pages
Journal reference
DOI
Subjects
cs.ITInformation Theory

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from May 2017 to Jul 2022.

Comments linking this paper, per year.

Discussed in comments2 threads

    • ANS is super fast and trivially parallelizable, faster than Huffman or especially arithmetic encoding, and is superior to Huffman at least as far as compression ratios are concerned (symbol probabilities are not restricted to powers of 2, but unlike arithmetic encoding one is…

      jhjView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.