{'fraction_non_alphanumeric': 0.02693965517241379, 'fraction_numerical': 0.0, 'mean_word_length': 5.451388888888889, '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 robust algorithm for blind space-time equalization

The efficient separation of signals is a frequent problem in multiuser communication systems. Among many algorithms for blind deconvolution of a multiple-input multiple-output (MIMO) system, the one that utilizes higher-order cumulants has advantages in regards to convergence rate. Inspired by this algorithm, and on a stochastic gradient approach, we propose an algorithm with the capacity of recovering simultaneously all sources, denoted as MU-SWA (multiuser Shalvi-Weinstein algorithm). Based on the steady-state analysis, recently presented by Luo and Chambers for the multiuser constant modulus algorithm, we derive the expression for the mean-square error of MU-SWA. Simulation results show that MU-SWA presents a more robust behavior with respect to convergence rate and tracking capability when compared to others known algorithms for blind multiuser equalization.