2009•Unpublished venueRequires access

A Modified Belief Propagation Decoding Algorithm of LDPC Codes for Fast Convergence

Aimin Zhu, Sen-jie Yao

Abstract

The belief-propagation decoding algorithm for low-density parity check codes is analyzed and the convergence characteristic of this algorithm is researched. A modified belief-propagation decoding algorithm aiming at decreasing the number of iteration is proposed. Simulation result shows that the number of iteration of the proposed algorithm is only half of that of the standard one at expense of little loss in performance.

About this research paper

What this paper is about

Why it matters

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

Key concepts: Belief propagation, Low-density parity-check code, Decoding methods, Algorithm, Berlekamp–Welch algorithm, Convergence (economics), Computer science, Sequential decoding