{'fraction_non_alphanumeric': 0.022977022977022976, 'fraction_numerical': 0.0, 'mean_word_length': 5.464516129032258, '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}}
Differential space-time multi-block decoding

In this paper, we consider the maximum-likelihood multi-block decoding in differential space-time block coding systems. Since the computational complexity of the maximum-likelihood multi-block detector increases exponentially as a function of the number of signal blocks used in the decoding, a trellis-based Viterbi algorithm is proposed to implement multi-block space-time decoding without an increase in the computational complexity in each new branch-metric evaluation stage. It is demonstrated that by increasing the number of blocks, one can more efficiently utilize the differential coding relationship in the decoding process. A forgetting factor is further introduced into the maximum-likelihood decoding and the corresponding branch-metric is derived. Numerical results are presented to demonstrate the effects of fading rate, the value of the forgetting factor, and the number of comparative paths on the performance of the proposed approaches.