{'fraction_non_alphanumeric': 0.02142857142857143, 'fraction_numerical': 0.007142857142857143, 'mean_word_length': 5.5703125, '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}}
Relaxed Half-Stochastic Iterative Decoding for Rate Compatible Modulation

This paper presents the Relaxed Half-Stochastic (RHS) decoding algorithm for rate compatible modulation (RCM). RHS algorithm maintains the low-complexity symbol nodes and interconnection characteristic of stochastic decoding, but uses the more accurate additions on log-likelihood ratios in its variable nodes (VNs) to improve the decoding performance and speed up the convergence. Two multiplex-VN structure is proposed to reduce the complexity of VN while maintaining the decoding performance. The performance of RHS algorithm is verified by decoding a 400 × 400 mapping matrix. The simulation and implementation results show that RHS algorithm outperforms the stochastic decoding in terms of frame error rate and convergence speed with very little hardware cost.