3 December 2015 Research and design of documents compression algorithm based on variable length encoding
Author Affiliations +
Proceedings Volume 9794, Sixth International Conference on Electronics and Information Engineering; 97940Z (2015) https://doi.org/10.1117/12.2203279
Event: Sixth International Conference on Electronics and Information Engineering, 2015, Dalian, China
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.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jie Yu, Jie Yu, Fangxiu Wang, Fangxiu Wang, } "Research and design of documents compression algorithm based on variable length encoding", Proc. SPIE 9794, Sixth International Conference on Electronics and Information Engineering, 97940Z (3 December 2015); doi: 10.1117/12.2203279; https://doi.org/10.1117/12.2203279
PROCEEDINGS
6 PAGES


SHARE
Back to Top