{'fraction_non_alphanumeric': 0.015281757402101241, 'fraction_numerical': 0.0, 'mean_word_length': 5.238095238095238, '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}}
Hybrid Iteration Control on LDPC Decoders

Stopping criteria for the iterative decoding of low-density parity-check codes are considered. For a successful decoding task an inherent stopping criterion is used: the fulfillment of all parity-check constraints. For an unsuccessful task the decoder usually completes a preset maximum number of iterations. Proper iteration control is required to save energy and time on unnecessary decoder operation when processing undecodable blocks. In this paper we propose an iteration control policy that is driven by the combination of two decision metrics. One is the number of satisfied parity-check constraints and the second one is provided by a specific message computation kernel: the Self-Corrected Min-Sum decoding algorithm. Our results show that this hybrid control policy offers superior performance in terms of energy efficiency compared to previously proposed techniques. In addition we show empirically how stopping criteria should be tuned as a function of false alarm and missed detection rates.