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).
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
Tax calculation will be finalised during checkout.
Bokka, V., Nakano, K.: Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications. IEEE Trans. Parallel Distrib. Syst. 12(9), 875–887 (2001)
Brunelle, N., Robins, G.: Compression-aware algorithms for massive datasets. In: Proceedings of the 2015 Data Compression Conference, pp. 441–441 (2015)
Chandra, A., Chakrabarty, K.: System-on-a-chip test-data compression and decompression architectures based on golomb codes. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 20(3), 355–368 (2001)
Chen, D., Chiang, Y.: Alphabet partitioning techniques for semiadaptive huffman coding of large alphabets. IEEE Trans. Commun. 55(3), 436–443 (2007)
Cho, Y., Pearlman, W.A.: Hierarchical dynamic range coding of wavelet subbands for fast and efficient image decompression. IEEE Trans. Image Process. 16(8), 2005–2015 (2007)
Conrad, K.J., Wilson, P.R.: Grammatical ziv-lempel compression: achieving ppm-class text compression ratios with lz-class decompression speed. In: Proceedings of the 2016 Data Compression Conference (DCC), pp. 586–586 (2016)
Ding, J., Chen, H.: Adaptive golomb code for joint geometrically distributed data and its application in image coding. IEEE Trans. Circuits Syst. Video Technol. 23(4), 661–670 (2013)
Dong, L., Lu, D.: Parallel algorithm of visualization of reservoir numerical simulation based on pebi grids. In: Proceedings of the 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming, pp. 302–305 (2011)
Dubé, D., Yokoo, H.: Fast construction of almost optimal symbol distributions for asymmetric numeral systems. In: Proceedings of the 2019 IEEE International Symposium on Information Theory (ISIT), pp. 1682–1686 (2019)
Duda, J.: Asymmetric numeral systems: entropy coding combining speed of huffman coding with compression rate of arithmetic coding. arXiv preprint arXiv:1311.2540 (2013)
Duda, J., Tahboub, K.: The use of asymmetric numeral systems as an accurate replacement for huffman coding. In: Proceedings of the 2015 Picture Coding Symposium (PCS), pp. 65–69 (2015)
Duda, J., Niemiec, M.: Lightweight compression with encryption based on asymmetric numeral systems (2016). arXiv:1612.04662
Giesen, F.: Interleaved entropy coders. arXiv preprint arXiv:1402.3392 (2014)
Goyal, M., Tatwawadi, K.: Deepzip: Lossless data compression using recurrent neural networks. In: Proceedings of the 2019 Data Compression Conference (DCC), pp. 575–575 (2019)
Hashemian, R.: Memory efficient and high-speed search Huffman coding. IEEE Trans. Commun. 43(10), 2576–2581 (1995). https://doi.org/10.1109/26.469442
Hashempour, H., Lombardi, F.: Application of arithmetic coding to compression of vlsi test data. IEEE Trans. Comput. 54(9), 1166–1177 (2005)
Hayashi, T., Nakano, K.: Optimal parallel algorithms for finding proximate points, with applications. IEEE Trans. Parallel Distrib. Syst. 9(12), 1153–1166 (1998)
Hertz, D., Azenkot, Y.: Memory/speed tradeoffs for look-up table decoding of systematic linear block codes. IEEE Trans. Commun. 38(1), 109–111 (1990)
Huang, B., Sriraja, Y.: Improvement of burst error correction using a look-up table with low density parity check coding for compressed ultraspectral sounder data. In: Proceedings of the 2006 8th International Conference Advanced Communication Technology, vol. 2, pp. 1172–1176 (2006)
Jas, A., Ghosh-Dastidar, J.: An efficient test vector compression scheme using selective huffman coding. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(6), 797–806 (2003). https://doi.org/10.1109/TCAD.2003.811452
Konstantinov, F., Gryzov, G.: The use of asymmetric numeral systems entropy encoding in video compression. In: Proceedings of the International Conference on Distributed Computer and Communication Networks, pp. 125–139. Springer (2019)
Ma, C., Liu, D.: Convolutional neural network-based arithmetic coding for hevc intra-predicted residues. IEEE Trans. Circuits Syst. Video Technol. 30(7), 1901–1916 (2020)
Muscedere, R., Dimitrov, V.: Efficient techniques for binary-to-multidigit multidimensional logarithmic number system conversion using range-addressable look-up tables. IEEE Trans. Comput. 54(3), 257–271 (2005)
Najmabadi, S.M., Wang, Z.: High throughput hardware architectures for asymmetric numeral systems entropy coding. In: Proceedings of the 2015 9th international symposium on image and signal processing and analysis (ISPA), pp. 256–259. IEEE (2015)
Najmabadi, S.M., Tungal, H.S.: Hardware-based architecture for asymmetric numeral systems entropy decoder. In: Proceedings of the 2017 Conference on Design and Architectures for Signal and Image Processing (DASIP), pp. 1–6. IEEE (2017)
Najmabadi, S.M., Tran, T.H.: An architecture for asymmetric numeral systems entropy decoder—a comparison with a canonical huffman decoder. J. Signal Process. Syst. 91(7), 805–817 (2019)
Nakagawa, M., Man, D.: A simple parallel convex hulls algorithm for sorted points and the performance evaluation on the multicore processors. In: Proceedings of the 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 506–511 (2009)
Ruan, X., Katti, R.: Using improved shannon-fano-elias codes for data encryption. In: Proceedings of the 2006 IEEE International Symposium on Information Theory, pp. 1249–1252 (2006)
Sun, X., Zhang, W.: A parallel two-level hybrid method for tridiagonal systems and its application to fast poisson solvers. IEEE Trans. Parallel Distrib. Syst. 15(2), 97–106 (2004)
Teng, C.Y.: Compression of smil documents. In: Proceedings of the DCC 2000. Data Compression Conference, p. 572 (2000)
Wei, R.: Differential encoding by a look-up table for quadrature-amplitude modulation. IEEE Trans. Commun. 59(1), 84–94 (2011)
Weißenberger, A., Schmidt, B.: Massively parallel ans decoding on gpus. In: Proceedings of the 48th International Conference on Parallel Processing, pp. 1–10 (2019)
Witten, I.H., Bell, T.C.: The zero-frequency problem: estimating the probabilities of novel events in adaptive text compression. IEEE Trans. Inf. Theory 37(4), 1085–1094 (1991)
Yokoo, H.: On the stationary distribution of asymmetric numeral systems. In: Proceedings of the 2016 International Symposium on Information Theory and Its Applications (ISITA), pp. 631–635. IEEE (2016)
Funding was provided by the Natural Science Foundation of Anhui Province (Grant No. BJ2100330001).
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Wang, N., Wang, C. & Lin, SJ. A simplified variant of tabled asymmetric numeral systems with a smaller look-up table. Distrib Parallel Databases (2020). https://doi.org/10.1007/s10619-020-07316-9
- Data storage
- Asymmetric numeral systems
- Look-up table