Differentiating trapping sets with the same label [w; u]

Authors:
X. Zheng;Francis C. M. Lau;C. K. Tse
Affiliations:
Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hong Kong;Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hong Kong;Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hong Kong
Venue:
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Year:
2009

Citing 5
Cited 0

Evaluation of the extremely low block error rate of irregular LDPC codes

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

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

IEEE Transactions on Information Theory
Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Trapping sets (TSs) have been known to contribute to errors in the decoding of low-density parity-check (LDPC) codes, particularly at the high signal-to-noise ratio (SNR) region. Moreover, TSs with the same label [w; u] are considered equivalent under the automorphism of the graph of a regular code. But according to our our simulations, TSs with the same label [w; u] are producing different error rates in the case of irregular codes. In this paper, we will identify and explain the cause of the differences in error rates for TSs with the same label. Further, we will propose a simple mechanism to differentiate these TSs.