|
|
|
| A Novel Puncturing Scheme for Rate-compatible LDPC Codes |
| Su He-guang① Xia Shu-tao①② |
①(Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China)
②(National Mobile Communications Research Laboratory of the Southeast University, Nanjing 210096, China) |
|
|
|
|
Abstract This paper considers the issue of finding good puncturing patterns for rate-compatible LDPC codes. When studying the puncturing of LDPC codes, Ha, et al. obtain a so-called grouping and sorting puncturing scheme to maximize the number of lower k-SR nodes. Though the grouping and sorting scheme outperforms random puncturing schemes, it guarantees only single survived check node. This paper investigates the effect of multiple survived check nodes, and proposes an effective puncturing scheme called MSCN, which maximizes the number of survived check nodes. Simulation results over AWGN channels show that the proposed MSCN scheme is superior to the grouping and sorting scheme at low rates. By theoretical analysis and experimental results, it is indicated that multiple survived check nodes enhance the decoding performance of LDPC codes.
|
|
Received: 05 November 2010
|
|
|
|
Corresponding Authors:
Xia Shu-tao
E-mail: xiast@sz.tsinghua.edu.cn
|
|
|
|
|
|
|
2011, Vol. 33 
