A BP decoding algorithm based on nodes residual for LDPC codes

We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages, such as fast decoding, good performance, and low complexity. It is similar to residual bel...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Conference on Wireless Communications, Networking and Information Security pp. 124 - 127
Main Authors Wang Zhong-xun, Wang Xing-cheng, Yu Xin-qiao, Guo Dong
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2010
Subjects
Belief propagation
Bit error rate
Dynamic scheduling
Information science
Iterative decoding
LDPC code
Parity check codes
residual
Scheduling algorithm
Sparse matrices
Turbo codes
Virtual colonoscopy
Online AccessGet full text

Cover

More Information
Summary:We researched BP decoding algorithm based on variable-to-check information residual for LDPC code (VC-RBP) in this paper. It is a dynamic scheduling belief propagation using residuals, and has some advantages, such as fast decoding, good performance, and low complexity. It is similar to residual belief propagation (RBP),but has some difference in computing the residual message. Simulation shows that it outperforms with only a maximum of ten iterations by about 0.28 dB compared with RBP at an BER of 10 -4 .
ISBN:1424458501
9781424458509
DOI:10.1109/WCINS.2010.5541903