{'fraction_non_alphanumeric': 0.016100178890876567, 'fraction_numerical': 0.0017889087656529517, 'mean_word_length': 5.363636363636363, '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}}
Performance of modified Fano algorithm in AWGN and fading channels

A computationally efficient modified Fano algorithm for decoding of convolutional codes, recently proposed by the authors [1] has been further studied through simulation. Computational efforts and the BER performance of the original Fano and the modified Fano algorithms have been compared for the i) BSC and ii) Rayleigh fading channel with flat fading assumption. For the simulation example, the performance of the modified Fano algorithm was found to be comparable to the Viterbi decoder.