{'fraction_non_alphanumeric': 0.014354066985645933, 'fraction_numerical': 0.0, 'mean_word_length': 5.488372093023256, '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}}
Modified adaptive Viterbi algorithm for convolutional codes decoding

This paper introduces an efficient modification to one of the most successful complexity reduction techniques of the Viterbi decoding algorithm; the adaptive Viterbi algorithm. Although the use of the adaptive algorithm made it practically visible to use convolutional codes with large constraint lengths, the decoding complexity reduction at lower signal-to-noise ratios is not as good as that at higher signal-to-noise ratios. In this work we have modified the elimination rule for the adaptive Viterbi algorithm based on minimum free distance threshold. The proposed algorithm can preserve the same error performance as the adaptive Viterbi algorithm while requiring a substantially smaller average number of computations at wider range of signal-to-noise ratios.