LDPCCodeDesignforHalf-DuplexDecode-and-Forward.PDFVIP

LDPC Code Design for Half-Duplex Decode-and-Forward Relaying Arnab Chakrabarti, Alexandre de Baynast, Ashutosh Sabharwal, and Behnaam Aazhang Department of Electrical and Computer Engineering Rice University, Houston, Texas 77005 Email: {arnychak,debaynas,ashu,aaz}@ ∗ Abstract We propose LDPC code designs for the half-duplex relay channel. Our designs mimic the information theoretic random coding scheme for decode-and-forward relaying. An important advantage of our scheme is that it is built entirely of single-user codes that can be decoded by belief propagation. The optimization of relay LDPC code profiles presents unique challenges, which are met by using the density evolution algorithm with additional constraints for relaying. To speed up our optimization, we use a Gaussian approximation of density evolution that converts the infinite dimensional code profile optimization into a simple linear programming problem. The thresholds of the discovered relay code profiles are within 0.4 dB of the achievable lower bound for decode-and-forward relaying. 1 Introduction We propose LDPC code designs for the half-duplex relay channel. Our work is motivated by the observation that half-duplex relaying - where the relay cannot simultaneously transmit and receive in the same band - yields substantially higher rate than both direct and two-hop communication with the same average power constraint. We use LDPC codes as component codes because they have several advantages : provably good performance, efficient decoding using belief propagation, and parallelizable decoder structure. Our code designs are based on the