Re:A Gentle Introduction to Data Compression
by terryM4h3r on Tuesday December 30, 2014 @09:59PM
(#8818062)
Well, if it's as good as claimed, then maybe it needs to be described as a new category, alongside Huffman, arithmetic & Rle
Re:A Gentle Introduction to Data Compression
by tandemstrong on Tuesday December 30, 2014 @09:57PM
(#8818055)
The performance figures displayed on those pages look exceptional. Has anyone experimented with it already ?
Recently I've been following the progress of the Finite State Entropy algorithm[1]. From the readme on the github project [2]:
>FSE is a new kind of Entropy encoder, based on ANS theory, from Jarek Duda.
>It is designed to compete with Huffman encoder and Arithmetic ones.
>While huffman is fast but can only represent probabilities in power of 2 (50%, 25%, etc.) arithmetic coding can represent probabilities with much better accuracy, but requires multiplications and divisions.
> FSE solve this dilemma by providing precise probabilities, like arithmetic does, but using only additions, masks and shifts.
> This makes FSE faster, on par with Huffman speed, and even suitable for low-power CPU environment.
[1]: http://fastcompression.blogspot.com/2013/12/finite-state-ent... [2]: https://github.com/Cyan4973/FiniteStateEntropy