ScholarLens Back to search
2008•Unpublished venueRequires access

A Feedback Belief Propagation Algorithm for LDPC Convolutional Codes

Yuanhua Liu, Xinmei Wang, Yucheng He

Open publisher page 2 citations

Abstract

A feedback belief propagation (BP) decoding algorithm for low-density parity-check convolutional codes is proposed. The proposed algorithm can activate the variable nodes more efficiently by applying feedback decoding at each decoding iteration. Compared with the on-demand BP algorithm, the proposed algorithm has a doubled convergence speed and causes only about half of the decoding delay at similar error performances without any increase of storage requirement. Simulation results show that the proposed algorithm can offer a good trade-off between the error-correcting performance and the decoding complexity.

About this research paper

What this paper is about

A feedback belief propagation (BP) decoding algorithm for low-density parity-check convolutional codes is proposed. The proposed algorithm can activate the variable nodes more efficiently by applying feedback decoding at each decoding iteration. Compared with the on-demand BP algorithm, the proposed algorithm has a doubled convergence speed and causes only about half of the decoding delay at similar error performances without any increase of storage requirement. Simulation results show that the proposed algorithm can offer a good trade-off between the error-correcting performance and the decoding complexity.

Why it matters

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

A feedback belief propagation (BP) decoding algorithm for low-density parity-check convolutional codes is proposed. The proposed algorithm can activate the variable nodes more efficiently by applying feedback decoding at each decoding iteration. Compared with the on-demand BP algorithm, the proposed algorithm has a doubled convergence speed and causes only about half of the decoding delay at similar error performances without any increase of storage requirement. Simulation results show that the proposed algorithm can offer a good trade-off between the error-correcting performance and the decoding complexity.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Feedback Belief Propagation Algorithm for LDPC Convolutional Codes — Research Paper | ScholarLens