Encoding and Decoding Algorithms of ANS Variants and Evaluation of Their Average Code Lengths

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 system...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Yamamoto, Hirosuke, Iwata, Ken-ichi
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 14.08.2024
Subjects:
Algorithms
Arithmetic coding
Data compression
Decoding
Performance evaluation
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.2408.07322