[1] Yin Weiwei, Mei Zhonghui, Wu Lenan,. Low complexity joint source-channel decoding for transmissionof wavelet compressed images [J]. Journal of Southeast University (English Edition), 2006, 22 (2): 148-152. [doi:10.3969/j.issn.1003-7985.2006.02.002]

Copy

Low complexity joint source-channel decoding for transmissionof wavelet compressed images()

Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:

22

Issue:

2006 2

Page:

148-152

Research Field:

Information and Communication Engineering

Publishing date:

2006-06-30

Info

Title:

Low complexity joint source-channel decoding for transmissionof wavelet compressed images

Author(s):

Yin Weiwei;  Mei Zhonghui;  Wu Lenan

College of Information Science Engineering, Southeast University, Nanjing 210096, China

Keywords:

joint source-channel decoding;  sum-product algorithm;  generalized distribution law;  wavelet compressed image

PACS:

TN91

DOI:

10.3969/j.issn.1003-7985.2006.02.002

Abstract:

To utilize residual redundancy to reduce the error induced by fading channels and decrease the complexity of the field model to describe the probability structure for residual redundancy, a simplified statistical model for residual redundancy and a low complexity joint source-channel decoding(JSCD)algorithm are proposed.The complicated residual redundancy in wavelet compressed images is decomposed into several independent 1-D probability check equations composed of Markov chains and it is regarded as a natural channel code with a structure similar to the low density parity check(LDPC)code.A parallel sum-product(SP)and iterative JSCD algorithm is proposed.Simulation results show that the proposed JSCD algorithm can make full use of residual redundancy in different directions to correct errors and improve the peak signal noise ratio(PSNR)of the reconstructed image and reduce the complexity and delay of JSCD.The performance of JSCD is more robust than the traditional separated encoding system with arithmetic coding in the same data rate.

References:

[1] Buch G, Burkert F, Hagenauer J, et al.To compress or not to compress [A].In:Proc of IEEE Communications Theory Miniconf [C].London, 1996.198-203.
[2] Fingscheidt T, Hindelang T, Cox R V, et al.Joint source-channel(de-)coding for mobile communications[J].IEEE Trans Commun, 2002, 50(2):200-212.
[3] Lahouti F, Khandani A K.Efficient source decoding over memoryless noisy channels using higher order Markov models [J].IEEE Transactions on Information Theory, 2004, 50(9):2103-2118.
[4] Park M, Miller D J.Improved image decoding over noisy channels using minimum mean-squared estimation and a Markov mesh [J].IEEE Transactions on Image Process, 1999, 8(6):863-867.
[5] Kschischang F R, Frey B J, Loeliger H A.Factor graphs and the sum-product algorithm [J].IEEE Transactions on Information Theory, 2001, 47(2):498-519.
[6] 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-230.
[7] Aji S M, McEliece R J.The generalized distributive law [J]. IEEE Transactions on Information Theory, 2000, 46(2):325-343.
[8] Romberg J K, Hyeokho Choi, Baraniuk R G.Bayesian tree-structured image modeling using wavelet-domain hidden Markov models [J].IEEE Transactions on Image Process, 2001, 10(7):1056-1068.

Memo

Memo:

Biographies: Yin Weiwei(1978—), female, graduate;Wu Lenan(corresponding author), male, professor, wuln@seu.edu.cn.

Common functions