Low-Density Graph Codes for Coded Cooperation on Slow Fading Relay Channels
From MaRDI portal
Abstract: We study Low-Density Parity-Check (LDPC) codes with iterative decoding on block-fading (BF) Relay Channels. We consider two users that employ coded cooperation, a variant of decode-and-forward with a smaller outage probability than the latter. An outage probability analysis for discrete constellations shows that full diversity can be achieved only when the coding rate does not exceed a maximum value that depends on the level of cooperation. We derive a new code structure by extending the previously published full-diversity root-LDPC code, designed for the BF point-to-point channel, to exhibit a rate-compatibility property which is necessary for coded cooperation. We estimate the asymptotic performance through a new density evolution analysis and the word error rate performance is determined for finite length codes. We show that our code construction exhibits near-outage limit performance for all block lengths and for a range of coding rates up to 0.5, which is the highest possible coding rate for two cooperating users.
Recommendations
- Source and Channel Coding for Cooperative Relaying
- Slepian–Wolf Coding Over Cooperative Relay Networks
- Coding Schemes for User Cooperation in Low-Power Regimes
- Coarse Network Coding: A Simple Relay Strategy for Two-User Gaussian Interference Channels
- A low rate coding and decoding scheme based on the LDPC-BCH graph
- Optimal Distributed Codes for Feedback-Aided Cooperative Relay Networks
- Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
- Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
- Graph-based convolutional and block LDPC codes
This page was built for publication: Low-Density Graph Codes for Coded Cooperation on Slow Fading Relay Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273528)
