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
Systematic LDPC Convolutional Codes: Asymptotic and Finite-Length Anytime Properties
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-2704-6423
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7182-9543
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
2014 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, ISSN 0090-6778, Vol. 62, no 12, 4165-4183 p.Article in journal (Refereed) Published
Abstract [en]

Here we propose an ensemble of non-terminated systematic LDPC convolutional codes with increasing memory, and show that over the binary erasure channel (BEC) these codes achieve anytime reliability asymptotically when decoded with an expanding-window message-passing decoder. The corresponding anytime exponents are determined through protograph-based extrinsic information transfer charts. Fundamental complications arising when transmitting with finite block lengths are identified and a combinatorial performance analysis, when transmitting over a static BEC with a fixed number of erasures per codeword block, is developed. Based on the performance analysis we explore the use of feedback for achieving anytime behavior with constraints on block length. To meet complexity constraints, with or without feedback, the code memory can be limited at the cost of an error floor emerging with a delay proportional to the memory constraint. Although the analysis is developed for a static BEC we show numerically that we can design efficient low-complexity finite-length codes with anytime properties even for the conventional BEC.

Place, publisher, year, edition, pages
IEEE , 2014. Vol. 62, no 12, 4165-4183 p.
Keyword [en]
Communications
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-157509DOI: 10.1109/TCOMM.2014.2364600ISI: 000346793800001Scopus ID: 2-s2.0-84919684286OAI: oai:DiVA.org:kth-157509DiVA: diva2:775879
Note

QC 20150122

Available from: 2015-01-05 Created: 2014-12-10 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Grosjean, LeefkeRasmussen, Lars K.Thobaben, RagnarSkoglund, Mikael

Search in DiVA

By author/editor
Grosjean, LeefkeRasmussen, Lars K.Thobaben, RagnarSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Communications
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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