Bilayer LDPC Convolutional Codes for Decode-and-Forward Relaying

In this paper we present bilayer LDPC convolutional codes for half-duplex relay channels. Two types of codes, bilayer expurgated LDPC convolutional codes and bilayer lengthened LDPC convolutional codes, are proposed for decode-and-forward (DF) relaying. In the case of the binary erasure relay channel, we prove analytically that both code constructions achieve the capacities of the source-relay link and the source-destination link simultaneously, provided that the channel conditions are known when designing the codes. Meanwhile, both codes enable the highest transmission rate possible with DF relaying for a wide range of channel parameters. In addition, the regular degree distributions can easily be computed from the channel parameters, which significantly simplifies the code optimization. The code construction and performance analysis are extended to the general binary memoryless symmetric channel, where a capacity-achieving performance is conjectured. Numerical results are provided for both types of codes with finite node degrees over binary erasure channels and binary-input additive white Gaussian noise channels, which verify the aforementioned theoretical analysis.

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

[2]  Aria Nosratinia,et al.  Bilayer Protograph Codes for Half-Duplex Relay Channels , 2010, IEEE Transactions on Wireless Communications.

[3]  Michael Lentmaier,et al.  Implementation aspects of LDPC convolutional codes , 2008, IEEE Transactions on Communications.

[4]  Lars K. Rasmussen,et al.  Design of Multi-Edge-Type Bilayer-Expurgated LDPC Codes for Decode-and-Forward in Relay Channels , 2011 .

[5]  Jean-Pierre Cances,et al.  Optimized low density parity check codes designs for half duplex relay channels , 2009, IEEE Transactions on Wireless Communications.

[6]  Jun Hu,et al.  Low Density Parity Check Codes over Wireless Relay Channels , 2007, IEEE Transactions on Wireless Communications.

[7]  Kenta Kasai,et al.  Spatially coupled LDPC codes for decode-and-forward in erasure relay channel , 2011, ISIT.

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

[9]  Rüdiger L. Urbanke,et al.  Threshold saturation on BMS channels via spatial coupling , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[10]  Mikael Skoglund,et al.  Rate-equivocation optimal spatially coupled LDPC codes for the BEC wiretap channel , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[11]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[12]  Zheng Zhang,et al.  Capacity-approaching turbo coding and iterative decoding for relay channels , 2005, IEEE Transactions on Communications.

[13]  Behnaam Aazhang,et al.  Code designs for cooperative communication , 2007, IEEE Signal Processing Magazine.

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

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

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

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

[18]  Ashutosh Sabharwal,et al.  On capacity of Gaussian 'cheap' relay channel , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[19]  Rüdiger L. Urbanke,et al.  Spatially coupled ensembles universally achieve capacity under belief propagation , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

[21]  Abbas El Gamal,et al.  Capacity of a class of relay channels with orthogonal components , 2005, IEEE Transactions on Information Theory.

[22]  Michael Lentmaier,et al.  Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.

[23]  Yingbin Liang,et al.  Gaussian orthogonal relay channels: optimal resource allocation and capacity , 2005, IEEE Transactions on Information Theory.

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