Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding · HackerPapers discussions

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by jiggawatts

Fri, 15 Mar 2024 23:53:03 GMT

Some people's brains just work this way. Here's an example of a somewhat popular and regularly maintained library written in a similar style: https://github.com/enkimute/ganja.js/blob/6e97cb45d780cd7c66... Another example is Jarek Duda's paper on the ANS compression algorithm. A brilliant guy by all accounts, but his diagrams are... well... impenetrable. Check out Figure 4 on page 10: https://arxiv.org/pdf/1311.2540.pdf There's lines and arrows going every which way. There's about five different concepts layered on top of each other into one diagram, with nothing to obviously disambiguate…

Paper and discussion history. A mention is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — HN submission

Tue, 03 Jan 2023 13:40:08 GMT

Asymmetric numeral systems – A new approach to accurate entropy coding (2014) [pdf]

16 points; 2 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by pyinstallwoes

Sat, 21 May 2022 11:10:00 GMT

Sounds similar to: https://github.com/Cyan4973/FiniteStateEntropy https://arxiv.org/abs/1311.2540 > The modern data compression is mainly based on two approaches to entropy coding: Huffman (HC) and arithmetic/range coding (AC). The former is much faster, but approximates probabilities with powers of 2, usually leading to relatively low compression rates. The latter uses nearly exact probabilities - easily approaching theoretical compression rate limit (Shannon entropy), but at cost of much larger computational cost. Asymmetric numeral systems (ANS) is a new approach to accurate entropy…

Paper and discussion history. A mention is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by adamnemecek

Tue, 22 Aug 2017 23:03:49 GMT

It is. "Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding" https://arxiv.org/abs/1311.2540

Paper and discussion history. A mention is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by pera

Sun, 20 Aug 2017 19:03:20 GMT

I think you are correct: ANS is an entropy coding method, so a patent shouldn't be able to claim a new use for encoding some specific type of information [1]. Also, Duda's paper even exemplifies the obvious use case for video compression [2]. [1] - https://en.wikipedia.org/wiki/Inventive_step_and_non-obvious... [2] - https://arxiv.org/abs/1311.2540

Paper and discussion history. A mention is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by baybal2

Wed, 12 Jul 2017 14:43:02 GMT

Who is Jarek - his page http://th.if.uj.edu.pl/~dudaj/ His original publication from - https://arxiv.org/abs/1311.2540 . That work was a result of two years of research that was well documented, and was making noise in encoding community. His first notes on use ans for quick entropy coding date to 2008. First production grade code was published under GPL at around late 2013 with explicit intention to enforce copyleftness of derived works, and the patent poison pill clause. Jarek claims that Google has abruptly ended communications with him few month after the time of first code publication…

Paper and discussion history. A mention is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by TheGorramBatman

Wed, 26 Apr 2017 14:07:58 GMT

JPEG2000 used Arithmetic coding. But, you'd have to re-write the standard and evaluate it to get JPEG to use Arithmetic coding (e.g. does the way JPEG coefficients are read out still make sense with Arithmetic coding)? There are also other algorithms for universal source coding that exist -- theres nothing to say that arithmetic coding is a good choice, esp. given its relatively complex compared to say Asymmetric Numeral Systems (Duda; arXiv:1311.2540 [cs.IT], though I don't remember where it was published) or (Recursive) Interleaved Entropy Coding (Klimesh and Kiely; NASA/JPL IPN Progress…

Paper and discussion history. A mention is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by rektide

Wed, 31 Aug 2016 21:11:02 GMT

Cyan4973/Yann also is well known for xxhash[1], which is one of the faster hashers[2] out there. Post a new hasher and people will probably ask about xxhash (ex: metrohash[3]). Guy is an absolute machine. If you search Google for 'zstd' right now, you'll find him, not Facebook, namely: https://github.com/Cyan4973/zstd . Glad his work is being supported by someone now! Immensely well deserved, after so many years of helping make everyone fast. PS - I didn't know a lot of the terms you used, but the Finite State Entropy (FSE) link you provided does a good job intro'ing some of them, and the…

Paper and discussion history. A mention is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by eln1

Fri, 08 Jul 2016 21:53:27 GMT

It points to even older paper for ANS: http://arxiv.org/abs/0710.3861 The more recent one is: http://arxiv.org/abs/1311.2540 The first one is about kind of multidimensional analogue of Fibonacci coding ( https://en.wikipedia.org/wiki/Fibonacci_coding )- on a lattice, such that there cannot be two neighboring '1's. It also uses an interesting concept of Maximal Entropy Random Walk.

Paper and discussion history. A mention is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — HN submission

Fri, 08 Jul 2016 15:01:28 GMT

Asymmetric numeral systems (2014)

39 points; 4 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by espadrine

Fri, 08 Jul 2016 08:34:54 GMT

LZ4 is a format. All you can say about how energy efficient a format is, is by looking at the average speeds of its implementations. However, zlib for instance (a DEFLATE library) is more energy efficient than zopfli (another DEFLATE library), just by virtue of taking less CPU cycles to crunch data. There is in fact a very high correlation between CPU cycles and energy efficiency, since compression algorithms don't sit idle and use roughly the same instructions. In fact, Yann Collet's Zstd uses the same principles as LZFSE, as both were sprouted from Jarek Duda's research…

Paper and discussion history. A mention is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by dchest

Thu, 07 Jul 2016 08:21:28 GMT

This is a baseless speculation. First of all, Apple provides LZ4 in libcompression. Secondly, LZFSE uses Lempel–Ziv algorithm and ANS coder invented by Jarek Duda (https://arxiv.org/abs/1311.2540): https://developer.apple.com/library/ios/documentation/Perfor...

Paper and discussion history. A mention is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — HN submission

Wed, 04 May 2016 18:22:36 GMT

Asymmetric numeral systems: entropy encoding (2013)

36 points; 9 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding — mentioned by wfn

Sat, 11 Jan 2014 19:42:19 GMT

Blog entry: http://fastcompression.blogspot.fr/2013/12/finite-state-entr... Paper: http://arxiv.org/abs/1311.2540

Paper and discussion history. A mention is not an endorsement.