Analysis of Various Issues of Data Compression Algorithms

Compression is used just about everywhere. Themotivation of the compression is reduction of data storage and transmission bandwidth requirements. Compression helps reduce the consumption of expensive resources, such as hard disk space or transmission bandwidth. So the growth of volume of data has led to a need for “Data Compression “, that is the ability to reduce the amount of storage or Internet bandwidth required to handle this data. Compression is the reduction in size of data in order to save space or transmission time. For data transmission, compression can be performed on just the data content or on the entire transmission unit depending on a number of factors. This paper summarizes the different issues related with the various compression algorithms such as Huffman Coding, LZW Coding, Arithmetic Coding, BWT related with various authors. By implementing these algorithms, I get some results and regarding to these results we suggest the efficient algorithm to be used with a certain type of file to be compressed. This paper compares the features of these algorithms also such as Compression speed, Decompression speed, Memory space occupied, Compression ratio etc.