|
|
Arithmetic encoding was developed into robust algorithm in the beginning of 80th although
some successful implementations were known earlier. It gives compression ratio very close
to the one estimated by famous Shannon formula presented in his article of 1948.
|
Claude Shannon
|
There was no, however, theoretical prove in this article that this compression limit is the
best possible. I address this issue in my article along with some other entropy encoding
questions, such as difference between range encoder and arithmetic encoder. The article
has explained and fully optimized C code for arithmetic or range encoder where the fast
execution is a primary goal. The benchmarks are provided and comparison to few
other known encoders in terms of compression ratio and code execution time.
|