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
Dynamic decode-and-forward relaying with rate-compatible LDPC convolutional codes
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
2012 (English)In: 5th International Symposium on Communications Control and Signal Processing, ISCCSP 2012, IEEE , 2012, 6217841- p.Conference paper, Published paper (Refereed)
Abstract [en]

Dynamic decode-and-forward (DDF) is an improved decode-and-forward (DF) protocol under which the relay decides based on its received channel-state information (CSI) when to switch from listening mode to transmission mode without knowing the CSI of other links. In this paper we propose to apply rate-compatible LDPC convolutional (RC-LDPCC) codes to the DDF relay channel. The RC-LDPCC codes are constructed by successive graph extensions, and they have been proved analytically to be capacity achieving over the binary erasure channel. In this paper we show that the RC-LDPCC codes fit well with the DDF relaying, and the regularity of degree distributions simplifies the code optimization. Numerical results in terms of bit erasure rate and achievable rate are provided to evaluate the performance of the system. The results show that the RC-LDPCC codes are able to provide high achievable rates for the DDF relay channel.

Place, publisher, year, edition, pages
IEEE , 2012. 6217841- p.
Keyword [en]
Binary erasure channel, Code optimization, Decode-and-forward, Decode-and-forward protocols, Decode-and-forward relaying, Degree distributions, LDPC convolutional codes, Numerical results, Rate-compatible, Relay channels, Transmission mode
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-72118DOI: 10.1109/ISCCSP.2012.6217841Scopus ID: 2-s2.0-84864127255ISBN: 978-146730276-0 (print)OAI: oai:DiVA.org:kth-72118DiVA: diva2:487199
Conference
5th International Symposium on Communications Control and Signal Processing, ISCCSP 2012; Rome; 2 May 2012 through 4 May 2012
Funder
ICT - The Next Generation
Note

QC 20120831

Available from: 2012-01-31 Created: 2012-01-31 Last updated: 2013-09-16Bibliographically 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: 47 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