Low-density graph codes for coded cooperation on slow fading relay channels

Dieter Duyck, Joseph Boutros, Marc Moeneclaey

Research output: Contribution to journalArticle

17 Citations (Scopus)

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.

Original languageEnglish
Article number5895062
Pages (from-to)4202-4218
Number of pages17
JournalIEEE Transactions on Information Theory
Volume57
Issue number7
DOIs
Publication statusPublished - 1 Jul 2011

Fingerprint

Outages
coding
performance
Iterative decoding

Keywords

  • Block fading channels
  • density evolution
  • low-density parity-check code
  • mutual information
  • relay channels

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Low-density graph codes for coded cooperation on slow fading relay channels. / Duyck, Dieter; Boutros, Joseph; Moeneclaey, Marc.

In: IEEE Transactions on Information Theory, Vol. 57, No. 7, 5895062, 01.07.2011, p. 4202-4218.

Research output: Contribution to journalArticle

@article{1f3b2a8e052d426fb49512c090612bf3,
title = "Low-density graph codes for coded cooperation on slow fading relay channels",
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.",
keywords = "Block fading channels, density evolution, low-density parity-check code, mutual information, relay channels",
author = "Dieter Duyck and Joseph Boutros and Marc Moeneclaey",
year = "2011",
month = "7",
day = "1",
doi = "10.1109/TIT.2011.2145470",
language = "English",
volume = "57",
pages = "4202--4218",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Low-density graph codes for coded cooperation on slow fading relay channels

AU - Duyck, Dieter

AU - Boutros, Joseph

AU - Moeneclaey, Marc

PY - 2011/7/1

Y1 - 2011/7/1

N2 - 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.

AB - 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.

KW - Block fading channels

KW - density evolution

KW - low-density parity-check code

KW - mutual information

KW - relay channels

UR - http://www.scopus.com/inward/record.url?scp=79959563758&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959563758&partnerID=8YFLogxK

U2 - 10.1109/TIT.2011.2145470

DO - 10.1109/TIT.2011.2145470

M3 - Article

VL - 57

SP - 4202

EP - 4218

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 7

M1 - 5895062

ER -