Adaptive Group Shuffled Decoding for LDPC Codes

Tofar C.Y. Chang, Yu-Ted Su*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

We propose new grouping methods for group shuffled (GS) decoding of both regular and irregular low-density parity check cods. These methods are applicable for the belief-propagation as well as the min-sum-based GS decoders. Integer-valued metrics for measuring the reliability of each tentative variable node (VN) decision and the associated likelihood of being corrected are developed. The metrics are used to determine the VN updating priority, so the grouping may vary in each iteration. We estimate the computation complexity needed to adaptively regroup VNs. Numerical results show that our GS algorithms improve the performance of some existing GS belief-propagation decoders.

Original languageEnglish
Article number7953650
Pages (from-to)2118-2121
Number of pages4
JournalIEEE Communications Letters
Volume21
Issue number10
DOIs
StatePublished - 1 Oct 2017

Keywords

  • adaptive decoding schedule
  • belief propagation
  • group shuffled decoding
  • LDPC codes

Fingerprint Dive into the research topics of 'Adaptive Group Shuffled Decoding for LDPC Codes'. Together they form a unique fingerprint.

Cite this