Optimized Asymptotic Puncturing Distributions for Different LDPC Code Constructions

In this paper, we describe a method, how to optimize the asymptotic puncturing distributions for low-density parity-check codes constructed with different algorithms. Therefore, we generalize the discretized density evolution such that we can take care of the structure of the code. We show by density evolution and by simulations that even for the same degree distributions the optimized asymptotic puncturing distributions vary considerably for different construction algorithms. Furthermore, we demonstrate the performance gain by using the designed puncturing distributions compared to known puncturing distributions