The Community for Technology Leaders
Data Compression Conference (1995)
Snowbird, Utah
Mar. 28, 1995 to Mar. 30, 1995
ISBN: 0-8186-7012-6
pp: 475
Summary form only given. This paper presents two approaches to improve the LZFG data compression algorithm. One approach is to introduce a self-adaptive word based scheme to achieve significant improvement for English text compression. The other is to apply a simple move-to-front scheme to further reduce the redundancy within the statistics of copy nodes. The experiments show that an overall improvement is achieved from both approaches. The self-adaptive word-based scheme takes all the consecutive English characters as one word. Any other character in the ASCII codes will be taken as one single word. As an example, the input message '(2+x) is represented by y' can be classified into 9 words. To run the word-based scheme in PATRICIA tree, the data structure is modified.
word processing; data compression; tree data structures; algorithm theory; adaptive signal processing; ZFG data compression algorithm; self-adaptive word based scheme; English text compression; move-to-front scheme; redundancy; copy nodes; statistics; experiments; English characters; ASCII codes; input message; PATRICIA tree; modified data structure
Jianmin Jiang, "Improving LZFG data compression algorithm", Data Compression Conference, vol. 00, no. , pp. 475, 1995, doi:10.1109/DCC.1995.515585
79 ms
(Ver 3.3 (11022016))