Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Bilayer LDPC convolutional codes for half-duplex relay channels
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9307-484X
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2011 (English)In: 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, 2011, 1464-1468 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we present regular bilayer LDPC convolutional codes for half-duplex relay channels. For the binary erasure relay channel, we prove that the proposed code construction achieves the capacities for the source-relay link and the source-destination link provided that the channel conditions are known when designing the code. Meanwhile, this code enables the highest transmission rate with decode-and-forward relaying. In addition, its regular degree distributions can easily be computed from the channel parameters, which significantly simplifies the code optimization. Numerical results are provided for the codes with finite node degrees over binary erasure channels. We can observe that the gaps between the decoding thresholds and the Shannon limits are impressively small.

Place, publisher, year, edition, pages
2011. 1464-1468 p.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-50613DOI: 10.1109/ISIT.2011.6033784ISI: 000297465101131Scopus ID: 2-s2.0-80054818159ISBN: 978-145770595-3 (print)OAI: oai:DiVA.org:kth-50613DiVA: diva2:462289
Conference
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. St. Petersburg. 31 July 2011 - 5 August 2011
Funder
ICT - The Next Generation
Note
QC 20111207Available from: 2011-12-06 Created: 2011-12-06 Last updated: 2012-04-03Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Thobaben, RagnarSkoglund, Mikael

Search in DiVA

By author/editor
Si, ZhongweiThobaben, RagnarSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 53 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf