Data Compression Using Asymmetric Numeral Systems
Data Compression Using Asymmetric Numeral Systems
This Demonstration allows you to experiment with compression using a new method: asymmetric numeral systems.
Using a probability distribution , a sequence of symbols of a given length is generated and encoded using the parameters of the encoder.
p
The decoding table, starting from a given state, produces a symbol and new state, with blue bits added to get the new state in the range.
A summary is on the right: the optimal asymptotic minimum bit per symbol required (Shannon's entropy), how it should be asymptotically compressed with an ideal compressor but using no necessarily optimal (=) probability distribution, and how it compares with the generated example. Next you see the distribution of symbols in the table, the generated sequence, and finally the correlations in encoded sequences of bits.
q
p