{'fraction_non_alphanumeric': 0.022326674500587545, 'fraction_numerical': 0.0, 'mean_word_length': 5.553846153846154, '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 computationally efficient multi-modulus blind equalization algorithm

Adaptive blind equalization has gained widespread use in communication systems that operate without training signals. The multi-modulus blind equalization algorithm can overcome the phase offset error without the need of any rotator at the end of the equalizer stage while the well-known constant modulus algorithm cannot. The desire for further reduction in computational complexity has motivated improvement multi-modulus algorithm (MMA). This paper presents a modification of MMA based on signed-error that results in a more computationally efficient algorithm-signed-error multi-modulus algorithm (SE-MMA). The performance of the SE-MMA is evaluated via simulations and has proved improvements both in convergence speed and in computational complexity as compared to the MMA.