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
Decoding of LDPC Codes with Binary Vector Messages and Scalable Complexity
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
2008 (English)In: 2008 5TH INTERNATIONAL SYMPOSIUM ON TURBO CODES AND RELATED TOPICS, NEW YORK: IEEE , 2008, 350-355 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, an iterative decoder for LDPC codes, suitable for high-speed processing, is proposed and analyzed. The messages exchanged between the nodes are binary vectors, where the information is conveyed by the number of ones rather than their positions in the vector. Regarding this aspect, the approach exhibits some similarities to stochastic decoding techniques. The check node decoders perform simple bit-wise modulo-2 additions, whereas the variable node decoders perform more complex processing tasks, making the resulting structure attractive for high-speed hardware implementation. By selecting the length of the binary vector messages between one and infinity, the complexity and the performance of the decoder can be scaled between that of the original binary message passing algorithm and that of the sum-product algorithm. Density evolution is developed for the proposed decoding algorithm, and decoding thresholds are determined as functions of the length of the binary vector messages. Simulation results exemplify the performance for finite-length codes.

Place, publisher, year, edition, pages
NEW YORK: IEEE , 2008. 350-355 p.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-28956DOI: 10.1109/TURBOCODING.2008.4658724ISI: 000264797900062Scopus ID: 2-s2.0-57849134688OAI: oai:DiVA.org:kth-28956DiVA: diva2:398680
Conference
5TH INTERNATIONAL SYMPOSIUM ON TURBO CODES AND RELATED TOPICS, 2008
Note

QC 20110218

Available from: 2011-02-18 Created: 2011-01-25 Last updated: 2016-05-23Bibliographically 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
urn-nbn

Altmetric score

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