{'fraction_non_alphanumeric': 0.02666666666666667, 'fraction_numerical': 0.0, 'mean_word_length': 4.887254901960785, '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}}
A new piecewise linear modification to log-map turbo decoding algorithm: comparative analysis, numerical estimations, and simulation

In this article, we discuss an extensive class of channel codes called turbo codes. These error correction methods will achieve very good results in terms of error rates, which may be close to the bandwidth limit of the Shannon channel. The article begins with a brief discussion on the coding of the turbo, and then describes the form of the iterative decoder most often used to decode the turbo codes. This article proposes a new optimal modification of the log-MAP-log decoding algorithm. This method (PL-log-MAP) is based on a partial linear approximation of the correction function in the Jacobean logarithm. Using the proposed approximation, the complex functions of ln (.) I exp (.) In the log-MAP algorithm can be estimated with high accuracy and lower computational complexity. The effectiveness of the proposed approximation is tested and demonstrated by applying it to the digital communication system for transmission images in MatLab. It seems that the performance of the PL-log-MAP algorithm has the closest efficiency to the original log-MAP solution.