{'fraction_non_alphanumeric': 0.025755879059350503, 'fraction_numerical': 0.0, 'mean_word_length': 5.385714285714286, '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}}
MMSE joint detection for an asynchronous spread-spectrum system based on random permutations

This paper studies the joint detection of bits for a new spread-spectrum system based on random permutations. The proposed technique can be regarded as a special case of discrete linear periodic time varying filters. As any spread-spectrum technique, this method generates multi-access interference, which must be mitigated in order to retrieve the users' bits with acceptable bit-error-rate. Thus, different detection strategies must be analysed regarding their performance, their complexity and the available a priori information. In this paper, an asynchronous model is considered, and a linear minimum mean-square error (MMSE) detector fitted to this model is investigated. Theoretical and simulated results are provided, along with a comparison with the corresponding detector for CDMA systems.