Efficient Data compression using variable length Huffman coding

International Journal of VLSI & Signal Processing
© 2020 by SSRG - IJVSP Journal
Volume 7 Issue 2
Year of Publication : 2020
Authors : Reva Joshi, G. Githika, Ch. Prudvi,Dr.SK.Fairooz, Shaik Mohammed Rafi
: 10.14445/23942584/IJVSP-V7I2P102
pdf
Citation:
MLA Style:

Reva Joshi, G. Githika, Ch. Prudvi,Dr.SK.Fairooz, Shaik Mohammed Rafi, "Efficient Data compression using variable length Huffman coding" SSRG International Journal of VLSI & Signal Processing 7.2 (2020): 6-10.

APA Style:

Reva Joshi, G. Githika, Ch. Prudvi,Dr.SK.Fairooz, Shaik Mohammed Rafi,(2020). Efficient Data compression using variable length Huffman coding. SSRG International Journal of VLSI & Signal Processing 7(2), 6-10.

Abstract:

In this paper, we are developing a new compression approach that relies on the diversity of the proposed approach and the high and low data blocks in Huffman encoding. The proposed curriculum in VHDL languages will be developed and tested for implementation via the targeted Xilinx FPGA. The proposed high-speed decoding system takes approximately 43.75 seconds to decode a 12x32 test dataset. The current tree-based Huffman decoder takes about 83.15μs to decode the same data set. The high-speed decoder implemented takes about 400 hours less than the current system.

References:

[1] Rongshan Weia , Xingang Zhang: " Efficient VLSI Huffman Encoder Implementation and its Application in High Rate Serial Data Encoding" , IEICE Electronics Express, October 24, 2017
[2] D. A. Huffman: “A method for the construction of Minimum-Redundancy Codes,” Proc. I.R.E. #40 (1952) 1098.
[3] P. K. Shukla, et al. “Multiple Subgroup Data Compression Technique Based on Huffman Coding.” First International Conference on Computational Intelligence, Communication Systems and Networks IEEE Computer Society, 2009:397-402.
[4] W. W. Lu and M. P. Gough: “A fast-adaptive Huffman coding algorithm,” IEICE Trans. Commun. 41 [4] (1993) 535.
[5] V. K. Prasanna and H. Park: “Area Efficient VLSI Architectures for Huffman Coding,” IEEE Trans. Circuits and Syst. (1993) 568.
[6] A. J. Mukherjee, et al. "MARVLE: A VLSI Chip for Variable Length Encoding and Decoding." IEEE International Conference on Computer Design on Vlsi in Computer & Processors IEEE Computer Society, (1992)170.
[7] L. Y. Liu, et al.: “Design and hardware architectures for dynamic Huffman coding,” IEE Proc. – Comput. Digit. Tech. 142 [6] (1995) 411.
[8] Y. S. Lee, et al.: “A memory-based architecture for very-high-throughput variable length codec design,” IEEE International Symposium on Circuits and Systems IEEE, 1997:2096-2099 vol.3.
[9] Babu, K. Ashok, and V. S. Kumar. "Implementation of data compression using Huffman coding." International Conference on Methods and MODELS in Computer Science IEEE, 2010:70 - 75.
[10] H. C. Chang, et al.: “A VLSI architecture design of VLC encoder for high data rate video/image coding,” Circuits and Syst. 4 (1999) 398.
[11] A. Mukherjee, N. Ranganathan, and M. Bassiouni: “Efficient VLSI designs for data transformations of tree-based codes,” IEEE Trans. Circuits and Syst. 38 [3] (1991) 306.
[12] T. Kumaki, et al.: “CAM-based VLSI architecture for Huffman coding with real-time optimization of the code word table [image coding example],” IEEE International Symposium on Circuits and Systems IEEE, (2005)5202 Vol. 5.
[13] Chen, Bei, et al. "Huffman Coding Method Based on Number Character." International Conference on Machine Learning and Cybernetics IEEE, 2007:2296-2299.

Key Words:

Huffman , Variable length , FPGA , Xilinx , compression.