Eliminating small stopping sets in irregular low-density parity-check codes

Authors:
Xiaopeng Jiao;Jianjun Mu;Jing Song;Lihua Zhou
Affiliations:
School of Computer Science and Technology, Xidian University, Xi'an, P. R. China;School of Computer Science and Technology, Xidian University, Xi'an, P. R. China;Department of State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, P. R. China;School of Computer Science and Technology, Xidian University, Xi'an, P. R. China
Venue:
IEEE Communications Letters
Year:
2009

Citing 5
Cited 1

Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory
On the stopping distance and the stopping redundancy of codes

IEEE Transactions on Information Theory
Improved Upper Bounds on Stopping Redundancy

IEEE Transactions on Information Theory

Improved construction of irregular progressive edge-growth tanner graphs

IEEE Communications Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a novel scheme to eliminate small stopping sets in irregular low-density parity-check (LDPC) codes. By adding several new check nodes and having their edges connected to small stopping sets in the original code, the improved code decreases the number of small stopping sets efficiently. Simulation results show that the proposed scheme decreases the frame error rate (FER) significantly in the error floor region, whereas having almost the same rate as the original code.