Adaptive lossless forward move dictionary based compression

For storing and transmitting data from one end to another, size of the data should be reduced in size for better bandwidth and increase speed of device. Online compression is in great demand as more and more of the work is on online platform. Numerous static compression methods are there but they are time consuming and require complete data before compression. It requires two pass compressions but online compression take one pass compression for encoding and decoding simultaneously. A dictionary based compression technique can be applied to reduce the data size for better bandwidth utilization and hence faster transmission of data. In this paper we generate dictionary of incoming data according to first come first serve basis. Initially first block of some size is compressed using adaptive tree method and simultaneously dictionary is generated during processing and a particular code of 9 bits is provided for each string generated with LZW method and forward move basis method. The efficiency will be enhanced if repetition of string is greater in the document. We use a median to store coming data during transmission of previous data after compression. This way we create a block of data of particular size and apply compression on the block.