By Topic

AE-BP: Adaptive Erasure Belief Propagation Decoding Algorithm of LDPC Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Chaonian Guo ; Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China ; Xiangxue Li ; Dong Zheng ; Shengli Liu
more authors

In the decoding process of LDPC codes, variable node messages often fluctuate continuously and thereby become the hindrance to the successful decoding. This paper proposes an adaptive erasure belief propagation (AE-BP) decoding algorithm to reduce the influence of these unreliable messages. The idea behind AE-BP is recording the continuous fluctuant times of variable nodes by introducing a sequence of counters, and then adaptively erasing the messages according to their fluctuant times so that other messages would recover to more precise states. Semi-Gaussian approximation demonstrates adaptive erasure is a good candidate towards offsetting the defect of unreliable messages. Experimental simulations show that, for LDPC codes AE-BP outperforms most decoding algorithms in the literature.

Published in:

INC, IMS and IDC, 2009. NCM '09. Fifth International Joint Conference on

Date of Conference:

25-27 Aug. 2009