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
id sg-ntu-dr.10356-81360
record_format dspace
spelling sg-ntu-dr.10356-813602020-03-07T13:57:24Z Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling Aslam, Chaudhry Adnan Guan, Yong Liang Cai, Kui School of Electrical and Electronic Engineering Belief-propagation Rayleigh fading LDPC codes Shuffled decoding Column-weight Decoding schedule AWGN 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. Accepted version 2015-12-30T01:34:30Z 2019-12-06T14:29:14Z 2015-12-30T01:34:30Z 2019-12-06T14:29:14Z 2015 Journal Article Aslam, C. A., Guan, Y. L., & Cai, K. (2015). Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling. IEEE Communications Letters, 19(8), 1283-1286. 1089-7798 https://hdl.handle.net/10356/81360 http://hdl.handle.net/10220/39236 10.1109/LCOMM.2015.2444381 en IEEE Communications Letters © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/LCOMM.2015.2444381]. 4 p. application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic Belief-propagation
Rayleigh fading
LDPC codes
Shuffled decoding
Column-weight
Decoding schedule
AWGN
spellingShingle Belief-propagation
Rayleigh fading
LDPC codes
Shuffled decoding
Column-weight
Decoding schedule
AWGN
Aslam, Chaudhry Adnan
Guan, Yong Liang
Cai, Kui
Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling
description 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.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Aslam, Chaudhry Adnan
Guan, Yong Liang
Cai, Kui
format Article
author Aslam, Chaudhry Adnan
Guan, Yong Liang
Cai, Kui
author_sort Aslam, Chaudhry Adnan
title Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling
title_short Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling
title_full Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling
title_fullStr Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling
title_full_unstemmed Improving the Belief-Propagation Convergence of Irregular LDPC Codes Using Column-Weight Based Scheduling
title_sort improving the belief-propagation convergence of irregular ldpc codes using column-weight based scheduling
publishDate 2015
url https://hdl.handle.net/10356/81360
http://hdl.handle.net/10220/39236
_version_ 1681046072823119872

Similar Items