Open Access

Progressive Image Transmission Based on Joint Source-Channel Decoding Using Adaptive Sum-Product Algorithm

EURASIP Journal on Image and Video Processing20072007:069805

DOI: 10.1155/2007/69805

Received: 13 August 2006

Accepted: 5 January 2007

Published: 7 March 2007


A joint source-channel decoding method is designed to accelerate the iterative log-domain sum-product decoding procedure of LDPC codes as well as to improve the reconstructed image quality. Error resilience modes are used in the JPEG2000 source codec making it possible to provide useful source decoded information to the channel decoder. After each iteration, a tentative decoding is made and the channel decoded bits are then sent to the JPEG2000 decoder. The positions of bits belonging to error-free coding passes are then fed back to the channel decoder. The log-likelihood ratios (LLRs) of these bits are then modified by a weighting factor for the next iteration. By observing the statistics of the decoding procedure, the weighting factor is designed as a function of the channel condition. Results show that the proposed joint decoding methods can greatly reduce the number of iterations, and thereby reduce the decoding delay considerably. At the same time, this method always outperforms the nonsource controlled decoding method by up to 3 dB in terms of PSNR.


Authors’ Affiliations

Department of Electrical and Computer Engineering, Rutgers, The State University of New Jersey
Qualcomm Inc.


  1. Banister BA, Belzer B, Fischer TR: Robust image transmission using JPEG2000 and turbo-codes. Proceedings of the International Conference on Image Processing (ICIP '00), September 2000, Vancouver, BC, Canada 1: 375-378.Google Scholar
  2. Wu Z, Bilgin A, Marcellin MW: An efficient joint source-channel rate allocation scheme for JPEG2000 codestreams. Proceedings of Data Compression Conference (DCC' 03), March 2003, Snowbird, Utah, USA 113-122.Google Scholar
  3. Liu W, Daut DG: An adaptive UEP transmission system for JPEG2000 codestream using RCPT codes. Proceedings of 38th Asilomar Conference on Signals, Systems and Computers, November 2004, Pacific Grove, Calif, USA 2: 2265-2269.Google Scholar
  4. Hagenauer J: Source-controlled channel decoding. IEEE Transactions on Communications 1995,43(9):2449-2457. 10.1109/26.412719View ArticleGoogle Scholar
  5. Görtz N: A generalized framework for iterative source-channel decoding. In Turbo Codes, Error-Correcting Codes of Widening Application. Edited by: Jézéquel M, Pyndiah R. Kogan Pade Science; 2003:105-126.Google Scholar
  6. Brink ST: Convergence of iterative decoding. Electronics Letters 1999,35(10):806-808. 10.1049/el:19990555View ArticleGoogle Scholar
  7. Brink ST: Convergence behavior of iteratively decoded parallel concatenated codes. IEEE Transactions on Communications 2001,49(10):1727-1737. 10.1109/26.957394View ArticleMATHGoogle Scholar
  8. Hindelang T, Fingscheidt T, Seshadri N, Cox RV: Combined source/channel (de-)coding: can a priori information be used twice? Proceedings of IEEE International Symposium on Information Theory, June 2000, Sorrento, Italy 266.Google Scholar
  9. Adrat M, Vary P, Spittka J: Iterative source-channel decoder using extrinsic information from softbit-source decoding. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '01), May 2001, Salt Lake, Utah, USA 4: 2653-2656.Google Scholar
  10. Laković K, Villasenor J: On reversible variable length codes with turbo codes, and iterative source-channel decoding. Proceedings of IEEE International Symposium on Information Theory, June-July 2002, Lausanne, Switzerland 170.View ArticleGoogle Scholar
  11. Adrat M, von Agris U, Vary P: Convergence behavior of iterative source-channel decoding. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '03), April 2003, Hong Kong 4: 269-272.Google Scholar
  12. Peng Z, Huang Y-F, Costello DJ Jr.: Turbo codes for image transmission—a joint channel and source decoding approach. IEEE Journal on Selected Areas in Communications 2000,18(6):868-879. 10.1109/49.848241View ArticleGoogle Scholar
  13. Gallager RG: Low-density parity-check codes. IRE Transactions on Information Theory 1962,8(1):21-28. 10.1109/TIT.1962.1057683MathSciNetView ArticleMATHGoogle Scholar
  14. MacKay DJC: Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory 1999,45(2):399-431. 10.1109/18.748992MathSciNetView ArticleMATHGoogle Scholar
  15. Lechner G, Sayir J: On the convergence of log-likelihood values in iterative decoding. Proceedings of Mini-Workshop on Topics in Information Theory, September 2002, Essen, Germany 1-4.Google Scholar
  16. Lechner G: Convergence of sum-product algorithm for finite length low-density parity-check codes. Proceedings of Winter School on Coding and Information Theory, February 2003, Monte Verita, SwitzerlandGoogle Scholar
  17. Ardakani M, Chan TH, Kschischang FR: EXIT-chart properties of the highest-rate LDPC code with desired convergence behavior. IEEE Communications Letters 2005,9(1):52-54. 10.1109/LCOMM.2005.1375239View ArticleGoogle Scholar
  18. Pu L, Wu Z, Bilgin A, Marcellin MW, Vasic B: Iterative joint source/channel decoding for JPEG2000. Proceedings of the 37th Asilomar Conference on Signals, Systems and Computers, November 2003, Pacific Grove, Calif, USA 2: 1961-1965.Google Scholar
  19. Tanner RM: A recursive approach to low complexity codes. IEEE Transactions on Information Theory 1981,27(5):533-547. 10.1109/TIT.1981.1056404MathSciNetView ArticleMATHGoogle Scholar
  20. MacKay DJC, Neal RM: Good codes based on very sparse matrices. In Cryptography and Coding: 5th IMA Conference, Lecture Notes in Computer Science, no. 1025. Edited by: Boyd C. Springer; 1995:100-111.View ArticleGoogle Scholar


© W. Liu and D. G. Daut. 2007

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.