Data storage is an indispensable part of data management system. Asymmetric numeral systems (ANS) is a widely used compression algorithm. A number of implementations, such as range asymmetric numeral systems (rANS) and tabled asymmetric numeral systems (tANS), were proposed. However, rANS requires some costly arithmetic operations (integer additions, multiplications and divisions), and tANS requires large space to store the entire behavior in a look-up table. When the integer addition is allowed, this paper proposes a variant of tANS, that requires much smaller look-up table than the conventional tANS. In addition, a decoding algorithm to decode multiple symbols at once is proposed. The simulation shows that with a slight loss of compression ratio (approximately $$0.5\%$$ lower), the proposed method has up to a $$25\%$$ ( $$60\%$$ ) better throughput than rANS in encoding (decoding).

中文翻译：

---

具有较小查找表的表格非对称数字系统的简化变体

数据存储是数据管理系统中不可或缺的一部分。非对称数字系统 (ANS) 是一种广泛使用的压缩算法。提出了许多实现方式，例如范围非对称数字系统 (rANS) 和表格非对称数字系统 (tANS)。然而，rANS 需要一些代价高昂的算术运算（整数加法、乘法和除法），而 tANS 需要大空间来将整个行为存储在查找表中。当允许整数加法时，本文提出了 tANS 的一种变体，它需要比传统 tANS 小得多的查找表。此外，还提出了一种同时解码多个符号的解码算法。模拟显示，压缩率略有损失（大约低 $$0.5\%$$），