{'fraction_non_alphanumeric': 0.01276207839562443, 'fraction_numerical': 0.0, 'mean_word_length': 5.654545454545454, '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}}
Fast DS-SS Acquisition Implementation for High Sensitivity Receivers

Pseudorandom codes are used in direct sequence spread spectrum (DSSS) receivers to synchronize the received signals with locally generated replica. A coarse synchronization called acquisition is followed by a finer synchronization, tracking. Both of these procedures bring received and replica signals to a small timing offset and find the residual frequency modulation which is left after carrier wipe-off. The acquisition stage is computationally challenging procedure for the receivers operating in weak signal conditions as the signal search space increases due to long integrations needed for high sensitivity. For example, these conditions can be observed indoors for satellite ranging and communication portable receivers. We present new very fast technique for acquiring signals indoors in conditions that require a significant number of computations. In our approach, many arithmetic operations are shared and external aid can be used to reduce the search space. Significant gains in arithmetic complexity are achieved