{'fraction_non_alphanumeric': 0.015706806282722512, 'fraction_numerical': 0.0, 'mean_word_length': 5.0236220472440944, '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}}
Blind Source Separation with a Time-Varying Mixing Matrix

Blind source separation (BSS) is the process of using multiple sensors to separate multiple random signals from a received linear combination. In this paper, we apply blind source separation techniques to mixtures of digital communications signals. We predict the achievable symbol error rate when the signals are received on the same carrier frequency and blindly separated. In a wireless environment where the sources are mobile or the environment is changing, the mixing matrix will vary with time. Our primary contribution is that we identify the major source of error in separation. We extend an adaptive step size algorithm to the complex-valued case to mitigate the errors in a dynamic environment.