Abstract
Asymmetric Numeral Systems (ANS) have the distinct disadvantage, that they have to be encoded in reverse order. In rANS, adaptive rANS specifically, this is often alleviated by buffering the coding decisions and flushing it in the end, resitting the rANS state every time. The decoder has to know, when to flush/re-initialize the state of the rANS decoder. This disclosure describes a method for selectively flushing (or retaining) the state of the rANS decoder on a symbol-by-symbol base. After renormalization, the decoder checks, if the value of the state of the rANS decoder is equal to the constant, whith which the rANS encoder initializes it’s state prior to encoding, and, if equal will flush and re-initialize its state. The corresponding rANS encoder takes special care, that the state is flushed, if the state becomes equal to that said constant after encoding a symbol.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Schmidt, Simon, "Efficient flush/re-initalize signaling for rANS states", Technical Disclosure Commons, (December 18, 2024)
https://www.tdcommons.org/dpubs_series/7660