Dynamic schedules based on variable nodes residual for LDPC codes

Authors:
Han Guo-jun;Liu Xing-cheng
Affiliations:
Faculty Information Engineering, Guangdong University of Technology, Guangzhou, China;Department of Electronics and Communication Engineering, Sun Yat-Sen University, Guangzhou, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 4
Cited 0

High-throughput LDPC decoders

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory
Efficient Serial Message-Passing Schedules for LDPC Decoding

IEEE Transactions on Information Theory
Iterative decoding of compound codes by probability propagation in graphical models

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Layered Belief-Propagation (LBP) with dynamic schedule for Low-Density Parity-Check (LDPC) codes using variable nodes residual is presented. The proposed schedule outperforms the conventional LBP with predetermined schedule both in terms of convergence speed and error performance. As compared with Node-wised Residual Belief-Propagation (NRBP), it has much lower extra complexity. For LDPC code constructed by PEG, simulation results show that the new schedule offers better error performance and requires much lower extra complexity.