{'fraction_non_alphanumeric': 0.011254019292604502, 'fraction_numerical': 0.0, 'mean_word_length': 5.489583333333333, '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}}
Sliding window adaptive Constant Modulus Algorithm based on complex Hyperbolic Givens rotations

This paper proposes a new adaptive Constant Modulus Algorithm (CMA) for the blind separation of communication signals. Although many existing CMA-like algorithms have been proposed in the literature, their efficiency in terms of convergence rate and separation quality is still relatively low. We introduce herein a new adaptive technique based on the use of complex Hyperbolic Givens rotations which shows very good performance as illustrated by the simulation results and comparative study provided at the end of the paper.