Cascading LZW algorithm with huffman coding: A variable to variable length compression algorithm
Two common schemes in data compression are fixed to variable length coding and variable to fixed length coding. Higher compression is expected from the more flexible scheme of variable to variable length coding. In such a scheme a compression dictionary is used to transfer variable length strings over the text alphabet into variable length strings over the coding alphabet. The compression is achieved due to matching longer more frequent text strings with shorter coding strings.
To obtain a variable to variable length coding we choose to cascade the LZW, variable to fixed, coding with the Huffman, fixed to variable, coding. In this work we consider the effective way of performing this cascading, to optimize the compression using limited time resources.
Unable to display preview. Download preview PDF.
- [CFP]Y. Choueka, A.S. Fraenkel, Y. Perl.: Polynomial construction of optimal prefix tables for text compression. Proc. 19th Annual Allerton Conferences on Communication, control and Computing, 1981, 762–768.Google Scholar
- [H]D.A. Huffman.: A method for the construction of minimum redundancy codes. [A In Proc. IRE 40 (1951). 1098–1101.Google Scholar
- [PCM]Y. Perl, S. Chatterjee, T. Mahapatra.: Incorporating updates into the LZW compression algorithm. N.J.I.T. Technical report.Google Scholar
- [PGS]Y. Perl, S. Gupta, A. Shrivastava, Towards a bound for the compression of the LZW algorithm. N.J.I.T. Technical report.Google Scholar
- [SS1]J.A.Storer, T.G. Szymanski.:The macro model for data compression. Extended Abstract. Proc. Tenth Annual ACM symposium on theory of computing, San Diego, CA, 1978, 30–39.Google Scholar
- [SS3]M.E.G. Smith, J.A. Storer.: Parallel Algorithms Data Compression, JACM, Vol. 32 No. 2, April 1985.Google Scholar
- [W]T.A. Welch.: A technique for high performance data compression, IEEE Computer Journal, 1984, 8–19.Google Scholar