An effective puncturing algorithm for QC-LDPC codes with dual-diagonal structure
Xin Zhao, Lidong Zhu, Yantao Guo, Xiaogang Gou · 2012
Puncturing is an effective method to achieve rate compatible. However, the existing puncturing algorithms are complex and difficult to implement by hardware. This article researches on puncturing algorithm for QC-LDPC codes with dual-diagonal structure. Taking LDPC codes under IEEE802.16e standard as an example, this paper proposes a simple puncturing algorithm to achieve bit-rate compatible. Based on dual-diagonal structure, the puncturing algorithm chooses variable nodes with low degree for deletion and follows the rule that the deleted variable nodes should not be in the same calibration equation as far as possible. The simulation shows that the proposed puncturing algorithm is simple and effective, and the sub-codes obtained through the puncturing have better BER performance than that of random puncturing and order puncturing. In addition, because the puncturing matrix does not need to send to the receiver, it reduces a lot of overhead. Overall, the proposed puncturing algorithm is very practical to achieve rate compatible.