Low-Complexity Joint Source Channel Decoding of Image

Yin Wei-wei; Mei Zhong-hui; Wu Le-nan

Volume 28 Issue 12

Aug. 2010

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2006 > 28(12): 2301-2304

Yin Wei-wei, Mei Zhong-hui, Wu Le-nan. Low-Complexity Joint Source Channel Decoding of Image[J]. Journal of Electronics & Information Technology, 2006, 28(12): 2301-2304.

Citation:

Yin Wei-wei, Mei Zhong-hui, Wu Le-nan. Low-Complexity Joint Source Channel Decoding of Image[J]. Journal of Electronics & Information Technology, 2006, 28(12): 2301-2304.

Yin Wei-wei, Mei Zhong-hui, Wu Le-nan. Low-Complexity Joint Source Channel Decoding of Image[J]. Journal of Electronics & Information Technology, 2006, 28(12): 2301-2304.

Citation:

Yin Wei-wei, Mei Zhong-hui, Wu Le-nan. Low-Complexity Joint Source Channel Decoding of Image[J]. Journal of Electronics & Information Technology, 2006, 28(12): 2301-2304.

PDF( 281 KB)

Low-Complexity Joint Source Channel Decoding of Image

Received Date: 2005-04-21
Rev Recd Date: 2005-11-16
Publish Date: 2006-12-19

Abstract

Abstract

Markov Random Field Model (MRFM) is separated into four Markov chains which are used to represent the residuals of encoded image source. Combined with the soft output of Low Density Parity Check (LDPC) code, this simplified model is used in joint source channel decoding. Different correlation in different direction in source is regarded as a kind of natural channel code. In order to utilize the correlation, a serial decoding using forward-backward algorithm and a parallel decoding using sum-product algorithm are proposed respectively. Simulations show that compared with the traditional joint source channel decoding algorithm based on the MRFM, the proposed algorithm has lower complexity and better PSNR of the rebuilt images.

FullText(HTML)

References(1)

References

Buch G, Burkert F, Hagenauer J, et al. To compress or not to compress? [C]. IEEE GLOBECOM 1996, London, U.K., Nov. 1996: 198 - 203.[2]Fingscheidt T, Hindelang T, Cox R V, et al.. Joint source-channel (de-)coding for mobile communications[J].IEEE Trans. on Communications.2002,50(2):200-[3]Lahouti F, Khandani A K. Efficient source decoding over memoryless noisy channels using higher order Markov models [J].IEEE Trans. on Information Theory.2004, 50(9):2103-[4]Park M, Miller D J. Improved image decoding over noisy channels using minimum mean-squared estimation and a Markov mesh [J].IEEE Trans. on Image Processing.1999, 8(6):863-[5]Othman H, Aboulnasr T. A separable low complexity 2D HMM with application to face recognition [J].IEEE Trans. on Pattern Analysis and Machine Intelligence.2003, 25(10):1229-[6]Kschischang F R, Frey B J, Loeliger H A. Factor graphs and the sum-product algorithm [J].IEEE Trans. on Information Theory.2001, 47(2):498-[7]Hagenauer J, Gortz N. The turbo principle in joint source-channel coding [C]. IEEE Information Theory Workshop 2003, Paris, France, Mar. 2003: 275-278.[8]Kschischang F R, Frey B J. Iterative decoding of compound codes by probability propagation in graphical models [J].IEEE Journal on Selected Areas in Communications.1998, 16(2):219-

Relative Articles

Supplements(0)

Cited By

Proportional views