Advanced search
1 file | 346.99 KB

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

Author
Organization
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
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

Downloads

  • paper ldpc cooperative finalsubmission epreprint.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 346.99 KB

Citation

Please use this url to cite or link to this publication:

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.
@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},
}

Altmetric
View in Altmetric
Web of Science
Times cited: