{'fraction_non_alphanumeric': 0.026932084309133488, 'fraction_numerical': 0.0, 'mean_word_length': 4.816326530612245, '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}}
Decoding of high-rate turbo codes using a syndrome trellis

In this paper we present a new iterative decoding algorithm of the high-rate turbo codes which employ high-rate convolutional codes as component codes. This algorithm constructs a syndrome trellis using the parity check matrix of the code, and produces soft-output of each bit of a codeword. The algorithm is named "turbo syndrome decoding" (TSD). In the trellis diagram, only two paths merge into a node. It therefore leads to the significant reduction in both computational complexity of add-compare-select (ACS) operations and storage requirement for the soft-output to the subsequent decoder as compared with the classical decoding of the high-rate turbo codes. Nevertheless, the TSD algorithm has the same capability as the classical one in a sense that the most probable path is selected.