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
Rate-compatible LDPC convolutional codes for capacity-approaching hybrid ARQ
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.
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 Information Theory Workshop (ITW), 2011, 513-517 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we construct a family of rate-compatible LDPC convolutional codes for Type-II HARQ systems. For each code family, the codes of lower rates are constructed by successively extending the graph of the high-rate base code. Theoretically, the proposed rate-compatible family includes all rates from 0 to 1. We prove analytically that all LDPC convolutional codes in the family are capacity achieving over the binary erasure channel (BEC). Thus, if applied to an idealized HARQ system over the BEC where the channel parameter stays constant within one complete information delivery, the throughput achieves the capacity of the channel. Moreover, the code construction is realized by regular degree distributions, which greatly simplifies the optimization.

Place, publisher, year, edition, pages
2011. 513-517 p.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-50614DOI: 10.1109/ITW.2011.6089515ISI: 000299416200106Scopus ID: 2-s2.0-83655191102ISBN: 978-1-4577-0437-6 (print)OAI: oai:DiVA.org:kth-50614DiVA: diva2:462294
Conference
2011 IEEE Information Theory Workshop (ITW). Paraty, Brazil. October 16-20, 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, ZhongweiAndersson, MattiasThobaben, 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: 73 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