Ghent University Academic Bibliography

Advanced

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

Dieter Duyck UGent, Joseph Boutros and Marc Moeneclaey UGent (2011) IEEE TRANSACTIONS ON INFORMATION THEORY. 57(7). p.4202-4218
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.
Please use this url to cite or link to this publication:
author
organization
year
type
journalArticle (original)
publication status
published
subject
keyword
low-density parity-check code, mutual information, density evolution, Block fading channels, relay channels, PARITY-CHECK CODES, CONVOLUTIONAL-CODES, WIRELESS NETWORKS, DIVERSITY, PERFORMANCE, CAPACITY, THEOREMS, DESIGN
journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
IEEE Trans. Inf. Theory
volume
57
issue
7
pages
4202 - 4218
Web of Science type
Article
Web of Science id
000291922500013
JCR category
COMPUTER SCIENCE, INFORMATION SYSTEMS
JCR impact factor
3.009 (2011)
JCR rank
7/133 (2011)
JCR quartile
1 (2011)
ISSN
0018-9448
DOI
10.1109/TIT.2011.2145470
language
English
UGent publication?
yes
classification
A1
copyright statement
I have transferred the copyright for this publication to the publisher
id
1201484
handle
http://hdl.handle.net/1854/LU-1201484
date created
2011-04-01 15:01:49
date last changed
2018-06-26 10:25:08
@article{1201484,
  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.},
  author       = {Duyck, Dieter and Boutros, Joseph and Moeneclaey, Marc},
  issn         = {0018-9448},
  journal      = {IEEE TRANSACTIONS ON INFORMATION THEORY},
  keyword      = {low-density parity-check code,mutual information,density evolution,Block fading channels,relay channels,PARITY-CHECK CODES,CONVOLUTIONAL-CODES,WIRELESS NETWORKS,DIVERSITY,PERFORMANCE,CAPACITY,THEOREMS,DESIGN},
  language     = {eng},
  number       = {7},
  pages        = {4202--4218},
  title        = {Low-density graph codes for coded cooperation on slow fading relay channels},
  url          = {http://dx.doi.org/10.1109/TIT.2011.2145470},
  volume       = {57},
  year         = {2011},
}

Chicago
Duyck, Dieter, Joseph Boutros, and Marc Moeneclaey. 2011. “Low-density Graph Codes for Coded Cooperation on Slow Fading Relay Channels.” Ieee Transactions on Information Theory 57 (7): 4202–4218.
APA
Duyck, D., Boutros, J., & Moeneclaey, M. (2011). Low-density graph codes for coded cooperation on slow fading relay channels. IEEE TRANSACTIONS ON INFORMATION THEORY, 57(7), 4202–4218.
Vancouver
1.
Duyck D, Boutros J, Moeneclaey M. Low-density graph codes for coded cooperation on slow fading relay channels. IEEE TRANSACTIONS ON INFORMATION THEORY. 2011;57(7):4202–18.
MLA
Duyck, Dieter, Joseph Boutros, and Marc Moeneclaey. “Low-density Graph Codes for Coded Cooperation on Slow Fading Relay Channels.” IEEE TRANSACTIONS ON INFORMATION THEORY 57.7 (2011): 4202–4218. Print.