{'fraction_non_alphanumeric': 0.009569377990430622, 'fraction_numerical': 0.0, 'mean_word_length': 5.826086956521739, '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}}
Fast converging approach for blind constant modulus interference suppression

Abstract The convergence behavior of the constant modulus algorithm (CMA) is examined in the proper initialization condition of locking onto the desired signal. An improved CMA converging approach is proposed that has the advantage of suppressing multiple access interference without explicit knowledge of interference parameters for synchronous DS‐CDMA systems. Simulation results demonstrate that the method overcomes the slower convergence of the CMA in the sudden birth of the number of users and outperforms the CMA detector and matched filter.