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 Achieving the Capacity of the BEC
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: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 58, no 6, 4021-4029 p.Article in journal (Refereed) Published
Abstract [en]

In this paper, we propose a new family of rate-compatible regular low-density parity-check (LDPC) convolutional codes. The construction is based on graph extension, i.e., the codes of lower rates are generated by successively extending the graph of the base code with the highest rate. Theoretically, the proposed rate-compatible family can cover all the rational rates from 0 to 1. In addition, the regularity of degree distributions simplifies the code optimization. We prove analytically that all the LDPC convolutional codes of different rates in the family are capable of achieving the capacity of the binary erasure channel (BEC). The analysis is extended to the general binary memoryless symmetric channel, for which a capacity-approaching performance can be achieved. Analytical thresholds and simulation results for finite check and variable node degrees are provided for both BECs and binary-input additive white Gaussian noise channels. The results confirm that the decoding thresholds of the rate-compatible codes approach the corresponding Shannon limits over both channels.

Place, publisher, year, edition, pages
2012. Vol. 58, no 6, 4021-4029 p.
Keyword [en]
Graph extension, low-density parity-check (LDPC) codes, LDPC convolutional codes, rate-compatible codes, Shannon limit
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-97997DOI: 10.1109/TIT.2012.2188990ISI: 000304245100052Scopus ID: 2-s2.0-84861398935OAI: oai:DiVA.org:kth-97997DiVA: diva2:535024
Funder
EU, European Research Council, 257626ICT - The Next Generation
Note

QC 20120619

Available from: 2012-06-19 Created: 2012-06-18 Last updated: 2017-12-07Bibliographically 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 Information Theory
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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