Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling

Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling

In this letter, a novel scheduling scheme for decoding irregular low-density parity-check (LDPC) code, based on the column weight of variable nodes in the code graph, is introduced. In this scheme, the irregular LDPC code is decoded using the shuffled belief-propagation (BP) algorithm by selecti...

Full description

Saved in:
Bibliographic Details
Main Authors: Aslam, Chaudhry Adnan, Guan, Yong Liang, Cai, Kui
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2015
Subjects:
Belief-propagation
Rayleigh fading
LDPC codes
Shuffled decoding
Column-weight
Decoding schedule
AWGN
Online Access:https://hdl.handle.net/10356/81360
http://hdl.handle.net/10220/39236
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:In this letter, a novel scheduling scheme for decoding irregular low-density parity-check (LDPC) code, based on the column weight of variable nodes in the code graph, is introduced. In this scheme, the irregular LDPC code is decoded using the shuffled belief-propagation (BP) algorithm by selecting the variable nodes in descending order of their column weight. Via numerical simulation, it is shown that the proposed highto- low column-weight based decoding schedule can noticeably increase the convergence speed at medium to high signal-to-noise ratio (SNR) over AWGN and Rayleigh fading channels without introducing additional complexity or error rate degradation. Furthermore, it is found that the improvement in decoding convergence is proportional to the maximum column-weight in the code graph.

Similar Items