Encoding and Decoding Algorithms of ANS Variants and Evaluation of Their Average Code Lengths
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916356645978112 |
|---|---|
| author | Yamamoto, Hirosuke Iwata, Ken-ichi |
| author_facet | Yamamoto, Hirosuke Iwata, Ken-ichi |
| contents | Asymmetric Numeral Systems (ANS) proposed by Jarek Duda are high-performance distortionless data compression schemes that can achieve almost the same compression performance as arithmetic codes with less arithmetic operations than arithmetic coding. The ANS is widely used in various practical systems like Facebook, Apple, Google, Dropbox, Microsoft, and Pixar, due to their high performance, but many researchers still lack much knowledge about the ANS. This paper thoroughly explains the encoding and decoding algorithms of the ANS, and theoretically analyzes the average code length achievable by the ANS. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_07322 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Encoding and Decoding Algorithms of ANS Variants and Evaluation of Their Average Code Lengths Yamamoto, Hirosuke Iwata, Ken-ichi Information Theory Asymmetric Numeral Systems (ANS) proposed by Jarek Duda are high-performance distortionless data compression schemes that can achieve almost the same compression performance as arithmetic codes with less arithmetic operations than arithmetic coding. The ANS is widely used in various practical systems like Facebook, Apple, Google, Dropbox, Microsoft, and Pixar, due to their high performance, but many researchers still lack much knowledge about the ANS. This paper thoroughly explains the encoding and decoding algorithms of the ANS, and theoretically analyzes the average code length achievable by the ANS. |
| title | Encoding and Decoding Algorithms of ANS Variants and Evaluation of Their Average Code Lengths |
| topic | Information Theory |
| url | https://arxiv.org/abs/2408.07322 |