Summary

The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)

2018

Session Number:We-PM-1-3

Session:

Number:We-PM-1-3.2

Probability Approximation in Asymmetric Numeral Systems

Hidetoshi Yokoo,  Toshiki Shimizu,  

pp.670-674

Publication Date:2018/10/18

Online ISSN:2188-5079

DOI:10.34385/proc.55.We-PM-1-3.2

PDF download

PayPerView

Summary:
Asymmetric Numeral Systems (ANS) are a family of entropy coders for information sources with a finite alphabet, and usually require approximating the source distribution to rational numbers to associate the source symbols with the internal states of ANS. In the range variant of ANS, each source symbol corresponds to a continuous interval of the state set. ANS assigns shorter codewords to states with smaller numbers and longer codewords to states with larger numbers. Therefore, it is not fair or valid to make the lengths of state intervals proportional to symbol probabilities. To overcome this problem, this paper proposes a new source approximation formula, and shows that it leads to an improvement of compression efficiency of ANS.