Audio compression using dynamic Huffman and RLE coding

This paper considers implementation of audio compression using the lossless compression techniques like dynamic Huffman coding and Run Length Encoding (RLE). Audio file is firstly preprocessed to find sampling frequency and the encoded data bits in sample audio file. After that dynamic Huffman and RLE is applied. The design of dynamic Huffman coding technique involves evaluation of the probabilities of occurrence “on the fly”, as the ensemble is being transmitted and RLE is based on finding the runs of the data i.e. repeating strings and replacing it by single data element and its count. These techniques work with a common goal to obtain the utmost possible compression ratio and less Time Elapsed to compress. The competence of the proposed methods is verified by applying these techniques to variety of audio data. Stimulus behind this work is to offer a detail analysis of lossless compression methods and finding the one which is best suited for compression of multimedia data in cognitive radio environment.

[1]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[2]  James A. Storer,et al.  Data Compression , 1992, Inf. Process. Manag..

[3]  Rupali B. Patil,et al.  Image and Text Compression Using Dynamic Huffman and RLE Coding , 2011, SocProS.

[4]  Erik G. Larsson,et al.  Overview of spectrum sensing for cognitive radio , 2010, 2010 2nd International Workshop on Cognitive Information Processing.

[5]  Gilbert Held,et al.  Data and Image Compression: Tools and Techniques , 1996 .

[6]  G.G. Langdon,et al.  Data compression , 1988, IEEE Potentials.

[7]  Hüseyin Arslan,et al.  A survey of spectrum sensing algorithms for cognitive radio applications , 2009, IEEE Communications Surveys & Tutorials.