LDPC code design for transmission of correlated sources across noisy channels without CSIT

We consider the problem of transmitting correlated data after independent encoding to a central receiver through orthogonal channels. We assume that the channel state information is not known at the transmitter. The receiver has access to both the source correlation and the channel state information. We provide a generic framework for analyzing the performance of joint iterative decoding, using density evolution. Using differential evolution, we design punctured systematic LDPC codes to maximize the region of achievable channel conditions, with joint iterative decoding. The main contribution of this paper is to demonstrate that properly designed LDPC can perform well simultaneously over a wide range of channel parameters.

[1]  M. Martalo,et al.  Optimizing channel coding for orthogonal multiple access schemes with correlated sources , 2009, 2009 Information Theory and Applications Workshop.

[2]  Joao Barros,et al.  The Sensor Reachback Problem , 2003 .

[3]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[4]  Javier Garcia-Frías,et al.  Joint source-channel decoding of correlated sources over noisy channels , 2001, Proceedings DCC 2001. Data Compression Conference.

[5]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[6]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[7]  Zixiang Xiong,et al.  Joint source-channel coding of binary sources with side information at the decoder using IRA codes , 2002, 2002 IEEE Workshop on Multimedia Signal Processing..

[8]  Henry D. Pfister,et al.  Can iterative decoding for erasure correlated sources be universal? , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Wei Zhong,et al.  LDGM Codes for Channel Coding and Joint Source-Channel Coding of Correlated Sources , 2005, EURASIP J. Adv. Signal Process..

[10]  Zixiang Xiong,et al.  Compression of binary sources with side information at the decoder using LDPC codes , 2002, IEEE Communications Letters.

[11]  João Barros,et al.  Network information flow with correlated sources , 2005, IEEE Transactions on Information Theory.

[12]  R. Storn,et al.  Design of efficient erasure codes with differential evolution , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[13]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[14]  Gianluigi Ferrari,et al.  Density evolution-based analysis and design of LDPC codes with a priori information , 2010, 2010 Information Theory and Applications Workshop (ITA).

[15]  Jun Chen,et al.  Slepian-Wolf Code Design via Source-Channel Correspondence , 2006, 2006 IEEE International Symposium on Information Theory.