2007•Unpublished venueRequires access

Another derivation process of belief propagation algorithm

Jingli Lin, Long-jiang Jing, Weile Zhu, Jijun Zheng

Abstract

Generally, soft decoding of low-density parity-check codes can be implemented by iterative decoding based on belief propagation (BP) algorithm. In this paper, the BP algorithm is presented and derived in a way which differs from that by Gallager, which helps to understand iterative decoding of LDPC codes more clearly.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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, Decoding methods, Low-density parity-check code, Berlekamp–Welch algorithm, Algorithm, Computer science, List decoding, Factor graph