{'fraction_non_alphanumeric': 0.020087336244541485, 'fraction_numerical': 0.0034934497816593887, 'mean_word_length': 5.548571428571429, '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}}
Genie-aided adaptive normalized min-sum algorithm for LDPC decoding

This paper proposes an algorithm for the decoding of low-density parity check (LDPC) codes, aiming to retrieve the performance degradation of conventional normalized min-sum algorithm, especially for irregular LDPC code. In our proposed algorithm, normalization factors are adjusted dynamically and adaptively during iterative decoding process according to look-up tables obtained by training and simulation in our proposal. The look-up tables construct the relationship between normalization factor a and the failed parity-check equation proportion p, which could be calculated in each decoding process. Simulation results demonstrate that the proposed algorithm can achieve a performance closer to the sum-product algorithm and a coding gain of around 0.2dB compared to the conventional normalized min-sum algorithm for rate 2/3 irregular LDPC codes over the AWGN channel. Our proposal is independent from the channel characteristics and retains low complexity. The implementation facility and the excellent performance make the proposed algorithm expect a wide application.