{'fraction_non_alphanumeric': 0.0161892901618929, 'fraction_numerical': 0.0, 'mean_word_length': 5.380952380952381, '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}}
A low-complexity min-sum decoding algorithm for LDPC codes

This paper proposes a low-complexity LDPC decoding algorithm with simplified check nodes updating. The proposed algorithm simplifies the result of the second-minimum in check nodes based on the first-minimum computation instead of computing it directly. In order to obtain the approximate result, effective corrected coefficients are utilized, which can reduce the complexity by eliminating the complex computations. Complexity analysis is provided and the results indicate that the complexity of the proposed algorithm is much lower than the general NMS algorithm and MS-based simplified algorithms. Simulation results show that the performance of the proposed algorithm can closely match the NMS algorithm with the same number of iterations.