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 Decode-and-Forward Relaying
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
2013 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 61, no 8, 3086-3099 p.Article in journal (Refereed) Published
Abstract [en]

In this paper we present bilayer LDPC convolutional codes for half-duplex relay channels. Two types of codes, bilayer expurgated LDPC convolutional codes and bilayer lengthened LDPC convolutional codes, are proposed for decode-and-forward (DF) relaying. In the case of the binary erasure relay channel, we prove analytically that both code constructions achieve the capacities of the source-relay link and the source-destination link simultaneously, provided that the channel conditions are known when designing the codes. Meanwhile, both codes enable the highest transmission rate possible with DF relaying for a wide range of channel parameters. In addition, the regular degree distributions can easily be computed from the channel parameters, which significantly simplifies the code optimization. The code construction and performance analysis are extended to the general binary memoryless symmetric channel, where a capacity-achieving performance is conjectured. Numerical results are provided for both types of codes with finite node degrees over binary erasure channels and binary-input additive white Gaussian noise channels, which verify the aforementioned theoretical analysis.

Place, publisher, year, edition, pages
2013. Vol. 61, no 8, 3086-3099 p.
Keyword [en]
Low-density parity-check (LDPC) codes, LDPC convolutional codes, relay channel, decode-and-forward, cooperative communication
National Category
Electrical Engineering, Electronic Engineering, Information Engineering Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-129466DOI: 10.1109/TCOMM.2013.061013.120122ISI: 000323647500002Scopus ID: 2-s2.0-84883276240OAI: oai:DiVA.org:kth-129466DiVA: diva2:653511
Funder
EU, FP7, Seventh Framework Programme, 257626Swedish Foundation for Strategic Research
Note

QC 20131004

Available from: 2013-10-04 Created: 2013-09-30 Last updated: 2017-12-06Bibliographically 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
In the same journal
IEEE Transactions on Communications
Electrical Engineering, Electronic Engineering, Information EngineeringTelecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 54 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