Rate-compatible punctured LDPC codes based on recovery tree

We consider the challenges of finding good puncturing patterns for rate-compatible LDPC codes over additive white Gaussian noise (AWGN) channel. In previous works, the role of survived check nodes in puncturing patterns was considered with the limitations such as single survived check node assumption and simulation-based verification. In this paper, we analyze the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on theses analyses, we propose new algorithm to find good puncturing pattern for LDPC codes over additive white Gaussian noise (AWGN) channel.