Name
Abstract | ||
|---|---|---|
A typical arithmetic coder consists of three steps: range calculation, renormalization, and probability model updating. In this paper, we propose and analyze from an information theoretic point of view a greedy renormalization method, which has two components: greedy thresholding and greedy outputting. The method significantly reduces the computational complexity of the renormalization step of ari... |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/TCOMM.2007.902534 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Arithmetic,Computational complexity,Huffman coding,Data compression,Entropy,Probability,Information analysis,Source coding,Communications Society,Councils | Information theory,Discrete mathematics,Data compression ratio,Control theory,Algorithm,Greedy algorithm,Independent and identically distributed random variables,Thresholding,Data compression,Greedy randomized adaptive search procedure,Mathematics,Arithmetic coding | Journal |
Volume | Issue | ISSN |
55 | 8 | 0090-6778 |
Citations | PageRank | References |
7 | 0.58 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yunwei Jia | 1 | 9 | 1.62 |
| En-Hui Yang | 2 | 1097 | 94.93 |
| Dake He | 3 | 253 | 32.64 |
| Steven Chan | 4 | 16 | 5.46 |