{'fraction_non_alphanumeric': 0.016666666666666666, 'fraction_numerical': 0.0, 'mean_word_length': 5.950413223140496, '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 simplified equalization method for asynchronous cooperative relay systems

In this paper, asynchronous cooperative relay systems based on distributed linear convolutional space-time codes are investigated. By utilizing the banded Toeplitz property of the equivalent channel matrix, a block minimum mean square error (MMSE) equalization method employing the Trench algorithm to solve the Toeplitz linear equations is proposed, which avoids the high order matrix inversion operation in the traditional MMSE equalization method. The computation of the equalization operation is further simplified greatly by converting the high order banded Toeplitz linear equations to the low order ones. Simulation results show that satisfactory system performance can be achieved by employing non-minimum-order non-trace-orthogonal generator polynomials.