An Effective Puncturing Scheme for Rate- Compatible LDPC Codes

摘要：

We consider the problem of finding good puncturing patterns for rate-compatible LDPC codes over additive white Gaussian noise (AWGN) channels. When studying the recovered process of punctured nodes, Ha et al. maximized the number of lower k-SR nodes and obtained a so-called grouping and sorting puncturing scheme, where only single survived check node was guaranteed. In this paper, we investigate the effect of multiple survived check nodes and afford theoretical analysis to them. Based on the analysis, we propose an effective puncturing scheme called MSCN, which maximizes the number of survived check nodes. The MSCN scheme is quite different from the grouping and sorting scheme in the rules of finding nodes and update. By simulations, the MSCN scheme is shown to be superior to the grouping and sorting scheme over AWGN channels at low rates for rate-compatible LDPC codes.

作者: He-Guang Su Ming-Qiu Wang Shu-Tao Xia

作者单位: Graduate School at Shenzhen, Tsinghua University Guangdong 518055, P.R.China

会议类型: 国际会议

会议名称: 2010年无线通信与信号处理国际会议

会议地点: 上海

会议语种:英文

页码: 1-6

在线出版日期: 2010-10-20（万方平台首次上网日期，不代表论文的发表时间）