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
Adaptive Decoding of LDPC Codes with Binary Messages
University of South Australia. (Institute for Telecommunication Research)
University of South Australia. (Institute for Telecommunication Research)
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7182-9543
2009 (English)In: 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORYIEEE International Symposium on Information Theory - Proceedings, NEW YORK: IEEE , 2009, 2146-2150 p.Conference paper, Published paper (Refereed)
Abstract [en]

A novel adaptive binary decoding algorithm for LDPC codes is proposed, which reduces the decoding complexity while having a comparable or even better performance than corresponding non-adaptive alternatives. In each iteration the variable node decoders use the binary check node decoders multiple times; each single use is referred to as a sub-iteration. To process the sequences of binary messages in each iteration, the variable node decoders employ pre-computed look-up tables. These look-up tables as well as the number of sub-iterations per iteration are dynamically adapted during the decoding process based on the decoder state, represented by the mutual information between the current messages and the syndrome bits. The look-up tables and the number of sub-iterations per iteration are determined and optimized using density evolution. The performance and the complexity of the proposed adaptive decoding algorithm is exemplified by simulations.

Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 2146-2150 p.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-28934DOI: 10.1109/ISIT.2009.5205782ISI: 000280141401143Scopus ID: 2-s2.0-70449469505ISBN: 978-1-4244-4312-3 (print)OAI: oai:DiVA.org:kth-28934DiVA: diva2:399656
Conference
2009 IEEE International Symposium on Information Theory, ISIT 2009; Seoul; South Korea; 28 June 2009 through 3 July 2009;
Note

QC 20150713

Available from: 2011-02-23 Created: 2011-01-25 Last updated: 2015-07-13Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Rasmussen, Lars Kildehöj

Search in DiVA

By author/editor
Rasmussen, Lars Kildehöj
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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