Joint source-channel iterative decoding of codes

In this paper an innovative joint source channel coding scheme is presented. The system is based on iterative soft decoding of arithmetic codes, by means of a novel soft-in soft-out decoder based on suboptimal search and pruning of a binary tree. An error resilient arithmetic coder with a forbidden symbol is used in order to improve the performance of the joint source/channel scheme. The performance in the case of transmission across the AWGN channel is evaluated in terms of frame error rate, and compared to a traditional separated approach. Finally the convergence property of the system is analyzed by means of the EXIT chart technique.

[1]  J. Chou,et al.  Arithmetic coding-based continuous error detection for efficient ARQ-based image transmission , 2000, IEEE Journal on Selected Areas in Communications.

[2]  John G. Cleary,et al.  Integrating error detection into arithmetic coding , 1997, IEEE Trans. Commun..

[3]  Christine Guillemot,et al.  Joint source-channel turbo decoding of entropy-coded sources , 2001, IEEE J. Sel. Areas Commun..

[4]  Kannan Ramchandran,et al.  Continuous error detection (CED) for reliable communication , 2001, IEEE Trans. Commun..

[5]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[6]  Roberto Garello,et al.  A search for good convolutional codes to be used in the construction of turbo codes , 1998, IEEE Trans. Commun..

[7]  Ananthram Swami,et al.  Cross-layer designs of multichannel reservation MAC under Rayleigh fading , 2003, IEEE Trans. Signal Process..

[8]  J. D. Villasenor,et al.  On reversible variable length codes with turbo codes, and iterative source-channel decoding , 2002, Proceedings IEEE International Symposium on Information Theory,.

[9]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[10]  Joachim Hagenauer,et al.  The turbo principle in joint source channel decoding of variable length codes , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[11]  John B. Anderson,et al.  Source and Channel Coding , 1991 .

[12]  Khalid Sayood,et al.  Joint source/channel coding for variable length codes , 2000, IEEE Trans. Commun..

[13]  John D. Villasenor,et al.  Soft-input soft-output decoding of variable length codes , 2002, IEEE Trans. Commun..

[14]  Khalid Sayood,et al.  Joint source/channel coding using arithmetic codes , 2001, IEEE Trans. Commun..

[15]  Joachim Hagenauer,et al.  On variable length codes for iterative source/channel decoding , 2001, Proceedings DCC 2001. Data Compression Conference.

[16]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[17]  Enrico Magli,et al.  Robust video transmission over error-prone channels via error correcting arithmetic codes , 2003, IEEE Communications Letters.

[18]  Dariush Divsalar,et al.  Soft-input soft-output modules for the construction and distributed iterative decoding of code networks , 1998, Eur. Trans. Telecommun..

[19]  David J. Miller,et al.  Joint source-channel decoding for variable-length encoded data by exact and approximate MAP sequence estimation , 2000, IEEE Trans. Commun..

[20]  Peter Vary,et al.  Convergence behavior of iterative source-channel decoding , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..