{'fraction_non_alphanumeric': 0.017094017094017096, 'fraction_numerical': 0.0, 'mean_word_length': 5.390909090909091, '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 Parallel Viterbi Decoder Implementation for High Throughput

Today’s data reconstruction in digital communication systems requires designs of highest throughput rate. The Viterbi Algorithm is a key element in such digital signal processing applications. The non-linear and recursive nature of the Viterbi decoder makes its high-speed implementation challenging. Several promising approaches to achieve high throughput have been proposed in the past. In this project one such technique, look-ahead, is studied for extracting vectorized output bits without taking into consideration the hardware cost involved. It came out that even with small steps of looking ahead the processing gains are very high.