JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM 2011, 18(1) 121-128 DOI:    10.1016/S1005-8885(10)60037-4   ISSN: 1005-8885 CN: 11-3486/TN

Current Issue | Archive | Search                                                            [Print]   [Close]
Wireless
Information and Service
This Article
Supporting info
PDF(0KB)
[HTML]
Reference
Service and feedback
Email this article to a colleague
Add to Bookshelf
Add to Citation Manager
Cite This Article
Email Alert
Keywords
Authors
YAN Jian-Cheng
BO Zhong-Yang
PubMed
Article by Yan,J.C
Article by Bo,Z.Y

Design of new format for mass data compression

Abstract

In the field of lossless compression, most kinds of traditional software have some shortages when they face the mass data. Their compressing abilities are limited by the data window size and the compressing format design. This paper presents a new design of compressing format named ‘CZ format’ which supports the data window size up to 4 GB and has some advantages in the mass data compression. Using this format, a compressing shareware named ‘ComZip’ is designed. The experiment results support that ComZip has better compression ratio than WinZip, Bzip2 and WinRAR in most cases, especially when GBs or TBs of mass data are compressed. And ComZip has the potential to beat 7-zip in future as the data window size exceeds 128 MB.

Keywords
Received 2010-01-08 Revised 2010-11-08 Online: 2011-02-28 
DOI: 10.1016/S1005-8885(10)60037-4
Fund:
Corresponding Authors: Qin Jian-Cheng
Email: dragon_2k@21cn.com
About author:

References:

 

 1.    Ziv J, Lempel A. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 1977, 23(3): 337-343
 2.    Chang W L, Yun X C, Fang B X, et al. The block LZSS compression algorithm. Proceedings of the Data Compression Conference (DCC’09), Mar 16-18, 2009, Snowbird, UT, USA. Piscataway, NJ, USA: IEEE, 2009: 439
 3.    James A S, Thomas G S. Data compression via textual substitution. Journal of the ACM, 1982, 29(4): 928-951
 4.    Alistair M, Radford M N, Ian H W. Arithmetic coding revisited. ACM Transactions on Information Systems, 1998, 16(3): 256-294
 5.    Howard P G, Vitter J S. Arithmetic coding for data compression. Proceedings of the IEEE, 1994, 82(6): 857-865
 6.    Burrows M, Wheeler D J. A block-sorting lossless data compression algorithm. Technical Report, Digital System Research Center, 1994: 24p
 7.    Nelson M. Data compression with the Burrows-Wheeler transform. Dr Dobb’s Journal, 1996, 21(9): 46p
 8.    Tu Z J, Zhang S Y. A novel mplementation of JPEG 2000 lossless coding based on LZMA. Proceedings of the 6th IEEE International Conference on Computer and Information Technology (CIT’06), Sep 20-22, 2006, Seoul, Korea. Los Alamitos, CA, USA: IEEE Computer Society, 2006: 140
 9.    Shi Y, He L Q, Wen Y H, et al. An efficient lossless compression algorithm for well logging result drawings. Proceedings of the 4th International Conference on Image and Graphics (ICIG’07), Aug 22-24, 2007, Chengdu, China. 2007: 200-204
Similar articles

Copyright by JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM