{'fraction_non_alphanumeric': 0.018518518518518517, 'fraction_numerical': 0.0, 'mean_word_length': 4.778625954198473, '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}}
Hop timing recovery algorithms Citation

Communication systems must maintain tight timing synchronization between the transmitter and receiver. Systems typically pull-in timing from a large timing offset and then track timing once it has been sufficiently pulled in. When timing errors are large, additional reference symbols are needed to pull-in time. In some frequency hopping systems, the time pull-in step must be repeated for every hop and could occur many times a second. It then becomes important to develop rapid time pull-in algorithms that can operate on a limited number of data and reference symbols. This paper presents two algorithms for rapid time pull-in. The performance as a function of the number of data and reference symbols is shown.