Abstract
A new Forward Looking variant of dynamic Huffman or arithmetic encoding has been recently proposed, that provably always performs better than the corresponding general static encoding schemes, as far as the net compressed file, without the necessary header, is concerned. The current paper suggests to integrate the Forward Looking paradigm with the well-known adaptive PPM—Prediction by Partial Matching algorithm. This combination, that attempts to predict the following character based on the context that has already occurred in past, but uses its knowledge of the exact frequencies in the future, is empirically shown to enhance the prediction capability, and therefore to improve the compression efficiency.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cleary JG, Witten IH. Data compression using adaptive coding and partial string matching. IEEE Trans Commun. 1984;32(4):396–402.
Huffman DA. A method for the construction of minimum-redundancy codes. Proc IRE. 1952;40(9):1098–101.
Witten IH, Neal RM, Cleary JG. Arithmetic coding for data compression. Commun ACM. 1987;30(6):520–40.
Elias P. Universal codeword sets and representations of the integers. IEEE Trans Inf Theory. 1975;21(2):194–203.
Klein ST, Shapira D. Random access to Fibonacci encoded files. Discrete Appl Math. 2016;212:115–28.
Tunstall BP. Synthesis of noiseless compression codes. PhD thesis, Georgia Institute of Technology. 1967.
Klein ST, Shapira D. On improving Tunstall codes. Inf Process Manage. 2011;47(5):777–85.
Ziv J, Lempel A. A universal algorithm for sequential data compression. IEEE Trans Inf Theory. 1977;23(3):337–43.
Ziv J, Lempel A. Compression of individual sequences via variable-rate coding. IEEE Trans Inf Theory. 1978;24(5):530–6.
Storer JA, Szymanski TG. Data compression via textual substitution. J ACM. 1982;29(4):928–51.
Welch TA. A technique for high-performance data compression. IEEE Comput. 1984;17(6):8–19.
Moffat A, Turpin A. Compression and Coding Algorithms. In: The international series in engineering and computer science, 1st ed., vol. 669. Kluwer, Springer, English; 2002
Klein ST, Saadia S, Shapira D. Forward looking Huffman coding. Theory Comput Syst. 2021;65(3):593–612.
Fruchtman A, Klein ST, Shapira D. Bidirectional adaptive compression. In: Proceedings of the Prague Stringology Conference 2019; 2019. pp. 92–101.
Klein ST, Shapira D. A new compression method for compressed matching. In: Data compression conference, DCC 2000, Snowbird; 2000. pp. 400–409.
Vitter JS. Algorithm 673: Dynamic Huffman coding. ACM Trans Math Softw. 1989;15(2):158–67.
Fruchtman A, Gross Y, Klein ST, Shapira D. Weighted adaptive coding. CoRR abs/2005.08232; 2020.
Fruchtman A, Gross Y, Klein ST, Shapira D. Backward weighted coding. In: Data compression conference, DCC 2000, Snowbird; 2021. pp. 93–102
Fruchtman A, Gross Y, Klein ST, Shapira D. Weighted Burrows-Wheeler compression. CoRR abs/2105.10327; 2021.
Véronis J, Langlais P. Evaluation of parallel text alignment systems: the arcade project. In: Véronis J, editor. Parallel text processing, Chapter 19. Dordrecht: Kluwer Academic Publishers; 2000. pp. 369–388.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This article is part of the topical collection “String Processing and Combinatorial Algorithms” guest edited by Simone Faro.
Rights and permissions
About this article
Cite this article
Avrunin, R.M., Klein, S.T. & Shapira, D. Combining Forward Compression with PPM. SN COMPUT. SCI. 3, 239 (2022). https://doi.org/10.1007/s42979-022-01121-0
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s42979-022-01121-0