Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels

DOI10.1109/TIT.2007.904983zbMATH Open1325.94075arXivcs/0609018OpenAlexW3100777080MaRDI QIDQ3549014FDOQ3549014

Wei Yu, Peyman Razaghi

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: This paper describes an efficient implementation of binning for the relay channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC codes to approach the theoretically promised rate of the decode-and-forward relaying strategy by incorporating relay-generated information bits in specially designed bilayer graphical code structures. While conventional LDPC codes are sensitively tuned to operate efficiently at a certain channel parameter, the proposed bilayer LDPC codes are capable of working at two different channel parameters and two different rates: that at the relay and at the destination. To analyze the performance of bilayer LDPC codes, bilayer density evolution is devised as an extension of the standard density evolution algorithm. Based on bilayer density evolution, a design methodology is developed for the bilayer codes in which the degree distribution is iteratively improved using linear programming. Further, in order to approach the theoretical decode-and-forward rate for a wide range of channel parameters, this paper proposes two different forms bilayer codes, the bilayer-expurgated and bilayer-lengthened codes. It is demonstrated that a properly designed bilayer LDPC code can achieve an asymptotic infinite-length threshold within 0.24 dB gap to the Shannon limits of two different channels simultaneously for a wide range of channel parameters. By practical code construction, finite-length bilayer codes are shown to be able to approach within a 0.6 dB gap to the theoretical decode-and-forward rate of the relay channel at a block length of $10^5$ and a bit-error probability (BER) of $10^{-4}$. Finally, it is demonstrated that a generalized version of the proposed bilayer code construction is applicable to relay networks with multiple relays.

Full work available at URL: https://arxiv.org/abs/cs/0609018

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Cited In (4)

• Performance analysis for cooperative communication system with QC-LDPC codes constructed with integer sequences
• Coding and Decoding for the Dynamic Decode and Forward Relay Protocol
• Low-Density Graph Codes for Coded Cooperation on Slow Fading Relay Channels
• Compress-Forward Coding With BPSK Modulation for the Half-Duplex Gaussian Relay Channel

   Recommendations

• Layered Coding for the Interference Channel With a Relay 👍 👎
• Coding for Parallel Gaussian Bidirectional Relay Channels: A Deterministic Approach 👍 👎
• Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels 👍 👎
• Lattice Codes for the Gaussian Relay Channel: Decode-and-Forward and Compress-and-Forward 👍 👎
• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel 👍 👎
• Generalized Backward Decoding Strategies for the Relay Channel 👍 👎
• Using Superposition Codebooks and Partial Decode-and-Forward in Low-SNR Parallel Relay Networks 👍 👎
• A Multi-Layer Encoding and Decoding Strategy for Binary Erasure Channel 👍 👎
• Joint Physical Layer Coding and Network Coding for Bidirectional Relaying 👍 👎
• A Constrained Coding Approach to Error-Free Half-Duplex Relay Networks 👍 👎

This page was built for publication: Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549014)