2016•IEEE Communications LettersRequires access

A Grouping Based on Local Girths for the Group Shuffled Belief Propagation Decoding

Akiko Manada, Kyohei Yoshida, Hiroyoshi Morita, Ryuichi Tatasukawa

Open publisher page 5 citations

Abstract

Low-density parity-check codes have been known to exhibit good error correcting performance by using with the belief propagation (BP) decoding. The group shuffled BP decoding, which is a modification of the BP decoding, can exhibit a better performance than BP decoding by suitably grouping variable nodes in a Tanner graph. In this letter, we propose a new grouping of variable nodes based on local girths and evaluate its performance.

About this research paper

What this paper is about

Low-density parity-check codes have been known to exhibit good error correcting performance by using with the belief propagation (BP) decoding. The group shuffled BP decoding, which is a modification of the BP decoding, can exhibit a better performance than BP decoding by suitably grouping variable nodes in a Tanner graph. In this letter, we propose a new grouping of variable nodes based on local girths and evaluate its performance.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Low-density parity-check codes have been known to exhibit good error correcting performance by using with the belief propagation (BP) decoding. The group shuffled BP decoding, which is a modification of the BP decoding, can exhibit a better performance than BP decoding by suitably grouping variable nodes in a Tanner graph. In this letter, we propose a new grouping of variable nodes based on local girths and evaluate its performance.

Key concepts: Decoding methods, Belief propagation, Tanner graph, List decoding, Variable (mathematics), Sequential decoding, Algorithm, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
A Grouping Based on Local Girths for the Group Shuffled Belief Propagation Decoding — Research Paper | ScholarLens