A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding
[article]
2014
arXiv
pre-print
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
arXiv:1311.2540v2
fatcat:2njwd2tjvjhn3nhuvxob7n25zm