{'fraction_non_alphanumeric': 0.022727272727272728, 'fraction_numerical': 0.0, 'mean_word_length': 5.211538461538462, '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}}
An Iterative Decoding Method Based on Gaussian Approximation for LDPC Coded Modulations

In this paper, we propose an improved iterative demapping/decoding method for short length Low-density parity-check (LDPC) coded bit-interleaved coded modulations(BICM). For short length LDPC, there exist cycles in the bipartite graph, thereby leading to the high correlation among the extrinsic information of bits out from BP decoder. Based on the Gaussian assumption of the extrinsic log-likelihood ratios (LLRs)delivered by BP decoder, we multiply the extrinsic output of the decoder by a scaling factor and then pass it as a priori information to the demodulator for the next iteration. In this way, we can decrease the correlation of coded bits within the symbol and thus reduce the error propagation. Simulation results show that the proposed method can achieve noticeable performance gains for short length LDPC coded BICM-ID with a minor computation complexity increase.