{'fraction_non_alphanumeric': 0.014537107880642693, 'fraction_numerical': 0.0, 'mean_word_length': 5.77720207253886, '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 recursive QR approach to adaptive equalization of time-varying MIMO channels

This paper presents a novel adaptive equalization algorithm for time-varying MIMO systems with ISI channel conditions. The algorithm avoids channel estimation before equalization and leads to a direct QR-based procedure for updating the equalizer coefficients to track the time- varying channel characteristics. Our approach does not require precise channel estimation and needs relatively few pilot symbols for satisfactory equalization. The theoretical foundations of the pro- posed algorithm are rooted in signal recovery results derived from the generalized Bezout identity and the finite alphabet property inherent in digital communication schemes. Concerning the con- vergence behavior of the algorithm, we address the following three issues: existence of fixed points, exclusiveness of fixed points, and robustness under noise disturbance and parameter selection. The equalizer demonstrates promising capability in achieving low symbol error rates for a very broad range of SNRs. Simulation results are presented confirming that this approach outperforms the more traditional recursive least squares (RLS) adaptive equalizer for this application and rivals the performance of MMSE equalizers requiring channel knowledge.