A method for grouping symbol nodes of group shuffled BP decoding algorithm

Yoshiyuki Sato, Gou Hosoya, Hideki Yagi, Shigeichi Hirasawa

Research output: Contribution to journalArticle

Abstract

In this paper, we propose a method for enhancing performance of a sequential version of the belief-propagation (BP) decoding algorithm, the group shuffled BP decoding algorithm for low-density parity-check (LDPC) codes. An improved BP decoding algorithm, called the shuffled BP decoding algorithm, decodes each symbol node in serial at each iteration. To reduce the decoding delay of the shuffled BP decoding algorithm, the group shuffled BP decoding algorithm divides all symbol nodes into several groups. In contrast to the original group shuffled BP, which automatically generates groups accordingg to symbol positions, in this paper we propose a method for grouping symbol nodes which generates groups according to the structure of a Tanner graph of the codes. The proposed method can accelerate the convergence of the group shuffled BP algorithm and obtain a lower error rate in a small number of iterations. We show by simulation results that the decoding performance of the proposed method is improved compared with those of the shuffled BP decoding algorithm and the group shuffled BP decoding algorithm.

Original languageEnglish
Pages (from-to)2745-2753
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE91-A
Issue number10
DOIs
Publication statusPublished - 2008 Oct

Keywords

  • Belief propagation decoding
  • Low-density parity-check code
  • Shuffled BP decoding
  • Symbol nodes grouping method
  • Tanner graph

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A method for grouping symbol nodes of group shuffled BP decoding algorithm'. Together they form a unique fingerprint.

  • Cite this