{'fraction_non_alphanumeric': 0.0163098878695209, 'fraction_numerical': 0.0, 'mean_word_length': 5.503311258278146, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Efficient Ranking of Rate-Compatible Puncturing Patterns for a Given LDPC Code Matrix

In this paper, we introduce a novel criterion to rank puncturing patterns for rate-compatible LDPC codes. Specifically, based on Gaussian approximation density evolution, a cost function is devised to characterize the degree distribution of the punctured code matrices, which are derived from a mother code matrix by matrix transformation. This cost function allows us to effectively compare the expected performance of candidate puncturing patterns and to sort out good ones. Combined with well-designed search algorithms, the proposed criterion can be applied on both standardized Block-LDPC codes and generic binary LDPC codes to get good puncturing patterns with manageable complexity. Numerical simulation results verify the effectiveness of the proposed ranking criterion, and demonstrate that a series of good rate-compatible LDPC codes can be obtained by the proposed ranking criterion.