{'fraction_non_alphanumeric': 0.03295750216825672, 'fraction_numerical': 0.0, 'mean_word_length': 5.138297872340425, '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}}
Theoretical Analysis of M-ary/SS Communication Systems Using Racing Counter and a Hadamard Matrix

The performance of M-ary spread spectrum (M-ary/SS) communication systems is discussed. Firstly, the initial acquisition time is evaluated. Secondly, the retention time, which is the average number of frames holding correct frame timing, and the recovery time, which is the average number of frames required to establish synchronization, are derived. Lastly, the bit-error rate (BER) performance is evaluated. M-ary/SS communication systems, which have more than one spreading code, can improve the BER performance under conditions in which there is additive white Gaussian noise (AWGN). However, the synchronization of M-ary/SS communication systems is difficult because they have several spreading codes. The frame synchronization method uses a Hadamard matrix and "racing counters." As a result, the retention time becomes longer than the recovery time when the size of the lower counter differs greatly from that of the upper counter in the racing counters. Then the BER gets close to the performance which is achieved under complete synchronization.