{'fraction_non_alphanumeric': 0.031205673758865248, 'fraction_numerical': 0.004964539007092199, 'mean_word_length': 5.18859649122807, '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}}
Improvements in SOVA-based decoding for turbo-coded storage channels

In this paper, we propose a novel and simple approach for dealing with the exaggerated extrinsic information produced by the soft-output Viterbi algorithm (SOVA). We first identify the reason behind these exaggerated values and then propose a simple remedy for it. We argue that what leads to this optimistic extrinsic information is the inherent strong correlation between the intrinsic information (input to the SOVA) and extrinsic information (output of the SOVA). Our proposed remedy is based on mathematical analysis, and it involves using two attenuators, one applied to the immediate output of the SOVA and another applied to the extrinsic information before it is passed to the other decoder (assuming iterative decoding). We examine the modified SOVA (MSOVA) on idealized partial response (PR) channels and the Lorentzian channel equalized to a PR target. We consider both parallel concatenated codes (PCCs) and serial concatenated codes (SCCs). We show that the MSOVA provides substantial performance improvements over both channels. For example, it provides improvements of about 0.8 to 1.6 dB at P/sub b/=10/sup -5/. Finally, we note that the proposed modifications, while they provide considerable performance improvements, introduce only two additional multipliers to the complexity of the SOVA algorithm, which is remarkable.