Interleaved entropy coders

Author name not available (Why is that?)

Publication date: 14 February 2014

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.

Has companion code repository: https://github.com/rygorous/ryg_rans

This page was built for publication: Interleaved entropy coders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6249030)