Share Email Print
cover

Proceedings Paper

Research and design of documents compression algorithm based on variable length encoding
Author(s): Jie Yu; Fangxiu Wang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Considering there exists defects for Huffman coding to compress files, this paper presents a general algorithm to predict the vality of compressed files with variable-length coding. Through the pre-sentence of the prior estimate method of the average code length and the estimation method after file compressed, It implements a compressed file is no longer compressed. The algorithm includes character encoding and file encoding two stages, and it uses variable-length coding technique and compression rate information of the target file. First, it obtains the file code table from character probability statistics and the variable length encoding technique. Second, it uses the character probability and character code length to calculate the average code long. Finally, it determines whether the file is actually compressed according to the average code length of characters or the file compression ratio. Algorithm tests show: it can accurately pre-judge whether any type file can be compressed so that it only compresses the file that can be compressed.

Paper Details

Date Published: 3 December 2015
PDF: 6 pages
Proc. SPIE 9794, Sixth International Conference on Electronics and Information Engineering, 97940Z (3 December 2015); doi: 10.1117/12.2203279
Show Author Affiliations
Jie Yu, Wuhan Light Industry Univ. (China)
Fangxiu Wang, Wuhan Light Industry Univ. (China)


Published in SPIE Proceedings Vol. 9794:
Sixth International Conference on Electronics and Information Engineering
Qiang Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top