Study on Data Compression Algorithm Based on Semantic Analysis

Qi Hong; Xiao Lei Lu

doi:10.4028/www.scientific.net/AMR.842.712

Paper Titles

Development of Computer-Aided Design Module for Mechanical Products Based on AutoCAD
p.691

Research on the Facilities Layout Planning in MTO Manufacturing Industry Based on Genetic Algorithm
p.695

Design of Smart Home Management System Based on GSM and Zigbee
p.703

A Novel Traffic Flow Forecasting Method Based on the Artificial Neural Networks and Intelligent Transportation Systems Data Mining
p.708

Study on Data Compression Algorithm Based on Semantic Analysis
p.712

Application Research of Memory Alloy Washer on Power Equipment Safety and Energy Saving
p.719

Behavior of the Spruce and Birch Wood from the Fire Safety Point of View
p.725

The Flooding Tolerance and Growth Characteristics of 2 Woody Species by Flooding Durations for Aquatic Ecosystem Restoration
p.729

Comparative and Study the Influence of Sand Depth for Liquefied Evaluation
p.733

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 842Study on Data Compression Algorithm Based on...

Study on Data Compression Algorithm Based on Semantic Analysis

Abstract:

As a lossless data compression coding, Huffman coding is widely used in text compression. Nevertheless, the traditional approach has some deficiencies. For example, same compression on all characters may overlook the particularity of keywords and special statements as well as the regularity of some statements. In terms of this situation, a new data compression algorithm based on semantic analysis is proposed in this paper. The new kind of method, which takes C language keywords as the basic element, is created for solving the text compression of source files of C language. The results of experiment show that the compression ratio has been improved by 150 percent roughly in this way. This method can be promoted to apply to text compression of the constrained-language.

You might also be interested in these eBooks

Materials, Mechanical and Manufacturing Engineering

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 842)

Pages:

712-716

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.842.712

Citation:

Cite this paper

Online since:

November 2013

Authors:

Qi Hong*, Xiao Lei Lu

Keywords:

Compression Rate, Constrained-Language, Data Compression, Huffman Coding, Semantic Analysis

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Liyin Hu，Lu Lin. An efficient Huffman encoding algorithm based on multi-level and look-up table.J. of Math, V01. 32(4)(2012), pp.753-760(In Chinese).

Google Scholar

[2] Pen Shi, Min Li, Tao Yu, et al. Design and application of an XML data compression algorithm based on Huffman coding. Journal of Beijing University of Chemical Technology(Natural Science), V0l. 40(4)(2013), pp.120-124(In Chinese).

Google Scholar

[3] Zhaoqing He. New data compression algorithm based on Huffman coding. Science Technology and Engineering, Vol. 8(16)(2008), pp.4531-4535 (In Chinese).

Google Scholar

[4] Sungwen Wang, Jaling Wu, Shangchin Chuang, et a1．Memory efficient hierarchical lookup tables for mass arbitrary-side growing Huffman trees decoding. IEEE Transactions on Circuits and Systems for Video Technology, Vol. 18(10)(2008), pp.1335-1346.

DOI: 10.1109/tcsvt.2008.920968

Google Scholar