{'fraction_non_alphanumeric': 0.02130492676431425, 'fraction_numerical': 0.0, 'mean_word_length': 5.654867256637168, '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}}
An accelerated constant modulus algorithm for space-time blind equalization

We address the problem of signal separation using space-time blind equalization techniques. A novel blind algorithm, denoted ACMA (Accelerated Constant Modulus Algorithm), is proposed. It minimizes the constant modulus cost function and is based on a tuner used in adaptive control that sets the second derivative (“acceleration ”) of the coefficient estimates. Both the convergence speed and computational complexity of Multiuser ACMA lie between those of the Multiuser Constant Modulus and the Multiuser Shalvi-Weinstein algorithms. Some preliminary results show that the proposed algorithm presents a robust behavior with respect to global minima and tracking capability.