Spatially-Coupled LDPC Codes for Decode-and-Forward Relaying of Two Correlated Sources over the BEC

We present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the nodes are modeled as binary erasure channels. Joint source-channel coding with joint channel decoding is used to exploit the correlation. The relay performs network coding. We derive analytical bounds on the achievable rates for the binary erasure time-division multiple-access relay channel with correlated sources. We then design bilayer SC-LDPC codes and analyze their asymptotic performance for this scenario. We prove analytically that the proposed coding scheme achieves the theoretical limit for symmetric channel conditions and uncorrelated sources. Using density evolution, we furthermore demonstrate that our scheme approaches the theoretical limit also for non-symmetric channel conditions and when the sources are correlated, and we observe the threshold saturation effect that is typical for spatially-coupled systems. Finally, we give simulation results for large block lengths, which validate the DE analysis.

[1]  João Barros,et al.  On the capacity of the reachback channel in wireless sensor networks , 2002, 2002 IEEE Workshop on Multimedia Signal Processing..

[2]  Ying Zhao,et al.  Turbo-Like Codes for Transmission of Correlated Sources over Noisy Channels , 2007, IEEE Signal Processing Magazine.

[3]  Rudiger Urbanke,et al.  Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC , 2010, ISIT.

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

[5]  Michelle Effros,et al.  Lossless and near-lossless source coding for multiple access networks , 2003, IEEE Trans. Inf. Theory.

[6]  G. Bauch,et al.  Iterative Network and Channel Decoding on a Tanner Graph , 2005 .

[7]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[8]  Ron Dabora,et al.  Source-Channel Coding Theorems for the Multiple-Access Relay Channel , 2011, IEEE Transactions on Information Theory.

[9]  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).

[10]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

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

[12]  Thomas E. Fuja,et al.  Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels , 2006, IEEE Transactions on Information Theory.

[13]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[14]  Gerhard Fettweis,et al.  Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity , 2010, 2010 Information Theory and Applications Workshop (ITA).

[15]  Ashutosh Sabharwal,et al.  Low density parity check codes for the relay channel , 2007, IEEE Journal on Selected Areas in Communications.

[16]  Gerald Matz,et al.  Spatially coupled LDPC codes for two-user decode-and-forward relaying , 2012, 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[17]  Matthew C. Valenti,et al.  Distributed turbo coded diversity for relay channel , 2003 .

[18]  Alexandre Graell i Amat,et al.  Distributed Serially Concatenated Codes for Multi-Source Cooperative Relay Networks , 2011, IEEE Transactions on Wireless Communications.

[19]  Henry D. Pfister,et al.  LDPC code design for transmission of correlated sources across noisy channels without CSIT , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

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

[21]  Henry D. Pfister,et al.  Universality for the noisy Slepian-Wolf problem via spatial coupling , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[22]  Ming Xiao,et al.  Network Coded LDPC Code Design for a Multi-Source Relaying System , 2011, IEEE Transactions on Wireless Communications.

[23]  M. Gastpar,et al.  Information-theoretic multihopping for relay networks , 2004, International Zurich Seminar on Communications, 2004.

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

[25]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[26]  Mikael Skoglund,et al.  Bilayer LDPC convolutional codes for half-duplex relay channels , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[27]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[28]  Elza Erkip,et al.  Cooperative coding for wireless networks , 2004, IEEE Trans. Commun..

[29]  Christoph Hausl,et al.  Joint Network-Channel Coding for Wireless Relay Networks , 2008 .

[30]  Fred Daneshgaran,et al.  LDPC-based channel coding of correlated sources with iterative joint decoding , 2006, IEEE Transactions on Communications.

[31]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[32]  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).