ScholarLens Back to search
2006•Unpublished venueRequires access

Fast Weighted Bit-Flipping Decoding of Finite-Geometry LDPC Codes

Xiaofu Wu, Ming Jiang, Chunming Zhao, Xiaohu You

Open publisher page 7 citations

Abstract

In this letter, we establish a natural relationship between the improved modified-weighted-bit-flipping (IMWBF) decoding and min-sum decoding. This insight helps us to develop a fast weighted bit-flipping (FWBF) decoding algorithm. For decoding of finite-geometry low-density parity-check codes, we demonstrate through examples that the FWBF decoding can provide a further improvement to the IMWBF decoding on both convergence and performance

About this research paper

What this paper is about

In this letter, we establish a natural relationship between the improved modified-weighted-bit-flipping (IMWBF) decoding and min-sum decoding. This insight helps us to develop a fast weighted bit-flipping (FWBF) decoding algorithm. For decoding of finite-geometry low-density parity-check codes, we demonstrate through examples that the FWBF decoding can provide a further improvement to the IMWBF decoding on both convergence and performance

Why it matters

OpenAlex reports 7 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

In this letter, we establish a natural relationship between the improved modified-weighted-bit-flipping (IMWBF) decoding and min-sum decoding. This insight helps us to develop a fast weighted bit-flipping (FWBF) decoding algorithm. For decoding of finite-geometry low-density parity-check codes, we demonstrate through examples that the FWBF decoding can provide a further improvement to the IMWBF decoding on both convergence and performance

Key concepts: Decoding methods, Berlekamp–Welch algorithm, Sequential decoding, List decoding, Low-density parity-check code, Algorithm, Computer science, Finite geometry

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Fast Weighted Bit-Flipping Decoding of Finite-Geometry LDPC Codes — Research Paper | ScholarLens