Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An efficient dynamic schedule for layered 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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Guojun Han ; Dept. of Electron. & Commun. Eng., Sun Yat-sen Univ., Guangzhou, China ; Xingcheng Liu

An efficient dynamic schedule for layered belief-propagation (LBP) decoding of low-density parity-check (LDPC) codes is presented, in which the check nodes connecting to a variable node with maximum relative message residual are chosen in each dynamic decoding iteration, and then LBP is performed for these check nodes. In this schedule we combined the features of lazy schedule and node-wise residual belief propagation (NWRBP) together while keeping the extra computational complexity very low. Simulation results show that the new schedule speeds up the convergence rate and greatly improves error performance at medium to high signal-to-noise ratio (SNR) when compared to the standard LBP decoding algorithm.

Published in:

Communications Letters, IEEE  (Volume:13 ,  Issue: 12 )