By Topic

Reliability-based high-efficient dynamic schedules for belief propagation decoding 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

3 Author(s)
Lijun Zhang ; Sch. of Electr. & Inf. Eng., Beijing Jiaotong Univ., Beijing, China ; Jie Huang ; Cheng, L.L.

Four reliability-based high-efficient dynamic schedules (RHDS) for belief propagation (BP) decoding of low-density parity-check codes are proposed. The RHDS only processes one variable (or check) node, which has the maximum relative residual among all the variable (or check) nodes in each decoding iteration, thus keeping less greediness and decreasing complexity in comparison with egde-wise variable-to-check residual belief propagation (VC-RBP) algorithm. Simulation results show that RHDS's convergence rate is higher than VC-RBP while still keeping very low computational complexity.

Published in:

Signal Processing (ICSP), 2012 IEEE 11th International Conference on  (Volume:2 )

Date of Conference:

21-25 Oct. 2012