Lossless data compression techniques and their performance
Authors:
- 1 May 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 256-261
Abstract
This paper provides the study of various lossless data compression techniques and compares their performance and efficiency using time and space complexity. Data compression is itself a huge field in a computer science and it is used in reducing the size of data by removing the redundant characters or encoding the bits in data. We have used only lossless data compression techniques for compressing various media format files like text, doc, bmp, png and wav. Huffman coding which generates variable length codes for each symbol. LZW is a dictionary based technique and Shannon-Fano coding is used to generate binary code based on the frequency of each symbol. So we calculated the mean compression ratio, compression factor and compression time for various media files and result analysis of above data compression techniques will help to select the most appropriate method of compressing of any given file format in real world.Keywords
This publication has 5 references indexed in Scilit:
- An Efficient and Robust Data Compression Algorithm in Wireless Sensor NetworksIEEE Communications Letters, 2014
- Data Compression Considering Text FilesInternational Journal of Computer Applications, 2014
- Huffman and Lempel-Ziv based data compression algorithms for wireless sensor networks2013
- Comparison Study of Lossless Data Compression Algorithms for Text DataIOSR Journal of Computer Engineering, 2013
- A new compression ratio prediction algorithm for hardware implementations of LZW data compression2010