{'fraction_non_alphanumeric': 0.025614754098360656, 'fraction_numerical': 0.022540983606557378, 'mean_word_length': 5.303225806451613, '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}}
Design and implementation of an ML decoder for tail-biting convolutional codes

Tail-biting convolutional codes (TBCC) find applications in many modern-day communication standards such as LTE and IEEE 802.16e. Since tail-biting convolutional codes do not require a zero-tail, they achieve a better coding efficiency than their traditional counterparts. However, the absence of a zero-tail drastically increases the complexity of a standard maximum-likelihood decoder, making its implementation impractical. However, recently a decoder based on the Viterbi and A* algorithm has been proposed that achieves maximum likelihood performance with significantly reduced complexity. This paper presents an efficient hardware implementation of this algorithm for TBCCs corresponding to both LTE and IEEE 802.16e standards. The designs have been tested on a Xilinx Spartan 3E starter kit, achieving a throughput of 141 Mbps and 130 Mbps for the LTE and IEEE 802.16e TBCCs, respectively.