Re:Smaller and faster data compression with Zstandard
by eln1 on Friday September 02, 2016 @10:01AM
(#12413072)
It depends if you have static or adaptive coder.
Static is much cheaper, uses the same probabilities for the entire data block (e.g. 30 kB), probabilities are stored in the header - practically all Huffman and tANS compressors (however, there are considered exceptions: https://en.wikipedia.org/wiki/Adaptive_Huffman_coding ).
Adaptive can start with e.g. uniform probability (no need to store in header) and learns on the way - it is more costly but gives better compression, used with arithmetic coding or rANS. See https://fgiesen.wordpress.com/2015/05/26/models-for-adaptive... https://fgiesen.wordpress.com/2015/12/21/rans-in-practice/
Re:Smaller and faster data compression with Zstandard
by vintermann on Tuesday September 06, 2016 @02:56AM
(#12434074)
I know that's what adaptive coding means, I thought that was impossible with rANS. All the descriptions of rANS I could find (back when I looked at it) described it terms of a static model, and I ran into problems trying to generalize it to an adaptive one.
Thanks for the resources.
I thought this wasn't possible with ANS. Or has this changed?