Document Compression Scheme Based On Integer Data

In the field of today’s electronic information technology,there is going to behappen a long-term influence of the digital revolution.As a result of the digitalmultimedia information, especially in digital video and audio signal have largeamount of data, if we does not carry on the effective compression,it can be difficult toget the actual application.Along with the computer application are gradually deepened in many fields, thenumber of data processing of the application has been greatly increased, it is need tohandle and store large amounts of data.At the same time,thanks to the prosperity anddevelopment of the computer network,it promotes the spread of data in the field ofcommunication, among the above described case, it is better to reduce the storage andcommunication costs through the compression data.Nowadays, data compression is ubiquitous, everywhere is the application ofcompression.Data compression is a branch of information theory, and the informationtheory is processing technology related to data volume minimization, used fortransmission and storage.The basic characteristic of the data compression, it is toconvert a string of characters to another set of characters, after the transformation ofcharacter have the same information as before, as much as possible, but its length issmaller.This article firstly briefly introduction the related technology and the existingcompression algorithm, first introduced the information theory, it is shannon who putforward the concept of entropy in information theory, then the true sense datacompression is introduced in;Then this paper introduces the concept of probabilitycoding, this algorithm introduced laid a theoretical foundation for later;Finallydetailed introduces the existing compression algorithm, mainly in the compressionalgorithm based on dictionary and compression algorithm based on the statistics of thetwo aspects are introduced, in this paper, we proposed a new compression algorithm,it is on the basis of these algorithms to improve.On the basis of above, with the aid of godel’s number,we proposed compressionsequence coding CSN,this paper,we firstly introduces the definition of CSN-1 number, and we propose the CSN-1number is insufficient based onpractice,because it must be no less than the integer in the integer sequences, or at thetime of decompression it will failure;Then on the basis of it, the CSN-2algorithm isput forward, it makes up for the previous algorithm cannot be less than1of thedeficiencies in the integer sequences, but when T become large,the compressionefficiency will become low, we finally put forward an adaptive compression algorithm(ASCS), it made up for the shortage, the compressed sequence segmentation, and takethe T’s minimum on average, make the compression efficiency is highest.Finally,through the analysis of the experimental data,we proved that the adaptivecompression algorithm proposed in this paper, is indeed better than the existingcompression algorithm.