{'fraction_non_alphanumeric': 0.02318840579710145, 'fraction_numerical': 0.0, 'mean_word_length': 5.06140350877193, '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 synchronization in asynchronous multiuser packet networks using KMA

In a system with multiple (interfering) users transmitting data packets asynchronously, we consider separating the user of interest by blind beamforming. The transmitter gives the signal a unique "color code" by modulating the power of each symbol, in a pattern known to the receiver. The beamformer can then be computed using CMA-like algorithms. In this paper, we consider the associated synchronization problem: the receiver does not know when a packet will arrive and has to detect the onset of a packet. We propose an extension of the algebraic known modulus algorithm (AKMA) to take this problem into account.