Article navigation
Purpose

The purpose of this paper is to research the traditional belief‐propagation (BP) decoding algorithm of low‐density parity‐check code. The big computation load is a shortcoming of traditional BP decoding algorithm. Accordingly, the paper provides an improved BP decoding algorithm which raises the decoding efficiency and reduces decoding time delay.

Design/methodology/approach

An improved BP decoding algorithm is studied and the error correction performance of the improved BP decoding algorithm in the Gaussian channel is provided.

Findings

The simulation result shows the improved BP decoding algorithm has lower computational complexity and higher decoding speed based on the premise of a little decoding performance loss.

Research limitations/implications

The improved BP decoding algorithm has lower computational complexity and higher decoding speed based on the premise of a little decoding performance loss.

Practical implications

The improved BP decoding algorithm raises the decoding efficiency and reduces decoding time delay.

Originality/value

The decoding algorithm only needs to update the wrong bit information which might arise, but not update the bit information whose reliability is very high. The improved BP decoding algorithm raises the decoding efficiency and reduces decoding time delay.

You do not currently have access to this content.
Don't already have an account? Register

Purchased this content as a guest? Enter your email address to restore access.

Pay-Per-View Access
$39.00
Rental

or Create an Account

Close subscription notice
Close access options