##plugins.themes.academic_pro.article.main##

Abstract

Abstract: Most source coding standards (voice, audio, image and video) use Variable-Length Codes (VLCs) for compression. However, the VLC decoder is very sensitive to transmission errors in the compressed bit-stream. Previous contributions, using a trellis description of the VLC codeword’s to perform soft decoding, have been proposed. But the complexity of the trellis technique becomes intractable. In this paper, we propose a soft-input VLC decoding method which is not trellis based. Performance in the case of transmission over an Additive White Gaussian Noise (AWGN) channel is evaluated. Simulation results show that the proposed decoding algorithm exhibit very low complexity and also bit error rate (BER) at output of channel decoder decreases with increase in SNR. We consider the serial concatenation of a VLC with the channel code and perform iterative decoding. Results show that, when concatenated with Low Density Parity Check (LDPC) codes, iterative decoding provides remarkable error correction performance. Experimental results indicate that the proposed method requires less iteration and improves overall system performance.

Keywords: JPEG compression, Discrete Cosine Transform (DCT), Huffman encoding, LDPC codes.

##plugins.themes.academic_pro.article.details##

Author Biographies

Hazeena Hussain, MACE,Kerala University,Venjaramoodu,Trivandrum, Kerala

PG Student

Rehna. A.S, MACE,Kerala University,Venjaramoodu,Trivandrum, Ker

PG Student

Radha. S, MACE,Kerala University,Venjaramoodu,Trivandrum, Ker

PG Student
How to Cite
Hussain, H., A.S, R., & S, R. (2014). Image Transmission Using LDPC Log Domain Iterative Decoding Method. International Journal of Emerging Trends in Science and Technology, 1(05). Retrieved from http://igmpublication.org/ijetst.in/index.php/ijetst/article/view/227

References

Amin Zribi, Ramesh Pyndiah, Sonia Zaibi, Frédéric Guilloud,and Ammar Bouallègue,”Low-Complexity Soft Decoding of Huffman Codes and Iterative Joint Source Channel Decoding,” IEEE Trans. Comm., vol. 60, no. 6, June 2012
[2] Ragnar Thobaben and Jrg Kliewer ,” An Efficient Variable-Length Code Construction for Iterative Source-Channel Decoding,” IEEE Trans. Comm, vol. 57, no. 7, July. 2009.
[3] D. A. Huffman, “A method for the construction of minimum redundancy Codes,” Proc. I.R.E., vol. 40, no. 9, pp. 1098–1102, Sep. 1952.
[4] L. Pu, Z.Wu, A. Bilgin, M.W. Marcellin, and B. Vasic,”LDPC-based iterative joint source channel decoding for JPEG2000,” IEEE Trans. Image Process., vol. 16, no. 2, Feb. 2007.
[5] Mridul Kumar Mathur, Seema Loonker, Dr. Dheeraj Saxena,” Lossless Huffman coding technique for image compression and reconstruction using binary trees“Int.J.Comp.Tech.Appl, Vol 3 (1), 76-79.
[6] David J. C. MacKay,” Good Error-Correcting Codes Based on Very Sparse Matrices”, IEEE Trans. . . . Inf.Theory, Vol. 45, no. 2, March 1999
[7] Andrew B. Watson, “Image Compression Using the Discrete Cosine Transform,” Mathematica Journal, Vol. 4, No.1, Pp.81-88, 1994.
[8] K. Lakovic, Tao Tian, and J. Villasenor, “Iterative decoder design for joint source-channel LDPC coding,” in Proc. 2005 EUROCON Int.Conf. Computer as a Tool.
[9] R. G. Gallager, “Low-density parity check codes,” IRE Trans. Inf.Theory, vol. 8, pp. 21–28, Jan. 1962.
[10] V. B. Balakirsky, “Joint source-channel coding with variable length codes,” in Proc. 1997 IEEE Int. Symp. Inf. Theory, p. 419.
[11] Mamta Sharma,” Compression Using Huffman Coding”, IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.5, May 2010.
[12] William E.Ryan,” An introduction to LDPC codes”, Dept. of electrical and communication Engg. The university of Arizona, Box ,August 2003.