Study on Data Compression Algorithm Based on Semantic Analysis-Reference-Cited by-同舟云学术

Study on Data Compression Algorithm Based on Semantic Analysis

Published:2013-11 Issue: Volume:842 Page:712-716
ISSN:1662-8985
Container-title:Advanced Materials Research
language:
Short-container-title:AMR

Author:

Hong Qi¹,Lu Xiao Lei¹

Affiliation:

1. Shaanxi University of Technology

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.

Publisher

Trans Tech Publications, Ltd.

Subject

General Engineering

Link

https://www.scientific.net/AMR.842.712.pdf

Reference4 articles.

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).

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).

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

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.