TY - GEN
T1 - In praise of nontrivial redundant rows of algebraic LDPC codes
AU - Huang, Qin
AU - Zhang, Mu
AU - Guo, Xujing
AU - Wang, Zulin
PY - 2012
Y1 - 2012
N2 - One of the most interesting features of some algebraic LDPC codes is that their RC-constrained parity-check matrices have several or many redundant rows. This paper focuses on the positive impacts of these redundant rows on the belief propagation decoding algorithms. First, the analysis indicates that they are able to eliminate small trapping sets which cause high error-floors in BER curves. Second, their positive impacts on waterfall thresholds of BER curves are verified and explained. An LDPC code with such redundant rows is constructed, which outperforms the corresponding PEG-LDPC code 0.2 dB at BER around 10 -7.
AB - One of the most interesting features of some algebraic LDPC codes is that their RC-constrained parity-check matrices have several or many redundant rows. This paper focuses on the positive impacts of these redundant rows on the belief propagation decoding algorithms. First, the analysis indicates that they are able to eliminate small trapping sets which cause high error-floors in BER curves. Second, their positive impacts on waterfall thresholds of BER curves are verified and explained. An LDPC code with such redundant rows is constructed, which outperforms the corresponding PEG-LDPC code 0.2 dB at BER around 10 -7.
UR - https://www.scopus.com/pages/publications/84881036854
U2 - 10.1109/WCSP.2012.6542911
DO - 10.1109/WCSP.2012.6542911
M3 - 会议稿件
AN - SCOPUS:84881036854
SN - 9781467358293
T3 - 2012 International Conference on Wireless Communications and Signal Processing, WCSP 2012
BT - 2012 International Conference on Wireless Communications and Signal Processing, WCSP 2012
T2 - 2012 International Conference on Wireless Communications and Signal Processing, WCSP 2012
Y2 - 25 October 2012 through 27 October 2012
ER -