{'fraction_non_alphanumeric': 0.02699896157840083, 'fraction_numerical': 0.003115264797507788, 'mean_word_length': 5.10126582278481, '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}}
A Robust Detector for Rapid Code Acquisition in Non-Gaussian Impulsive Channels

Recently, a novel detector was proposed by the authors for code acquisition in non-Gaussian impulsive channels [3], which dramatically outperforms the conventional squared-sum detector; however, it requires exact knowledge of the non-Gaussian noise dispersion. In this paper, a robust detector is proposed, which employs the signs and ranks of the received signal samples, instead of their actual values, and so does not require knowledge of the non-Gaussian noise dispersion. The acquisition performance of the proposed detector is compared with that of the detector of [3] in terms of the mean acquisition time. The simulation results show that the proposed scheme is not only robust to deviations from the true value of the non-Gaussian noise dispersion, but also has comparable performance to that of the scheme of [3] using exact knowledge of the non-Gaussian noise dispersion.