A finite-precision adaptation of bit recycling to arithmetic coding
| Autor: | Ahmad Al-Rababa'a, Canada Universite Laval, Danny Dube |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Lossless compression
Computer science Real-time computing Data compression ratio Data_CODINGANDINFORMATIONTHEORY Huffman coding Arithmetic coding symbols.namesake Redundancy (information theory) Computer engineering symbols Context-adaptive binary arithmetic coding Data compression Image compression |
| Zdroj: | ISSPIT |
| Popis: | The bit recycling compression technique has been introduced to minimize the redundancy caused by the multiplicity of encodings present in many compression techniques. It has achieved about 9% as a reduction in the size of the files compressed by Gzip. In prior work, we have proposed an arbitrary-precision technique to adapt bit recycling to arithmetic code instead of Huffman code. We have shown that this adaptation enables bit recycling to achieve better compression and a much wider applicability. We have also presented a theoretical analysis that estimates the average amount of data compression that can be achieved by this adaptation. In this paper, we propose the finite-precision version of this adaptation so that it can be implemented efficiently using conventional computer registers. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|