{'fraction_non_alphanumeric': 0.017699115044247787, 'fraction_numerical': 0.0029498525073746312, 'mean_word_length': 5.287037037037037, '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}}
Optimal sequences for channel estimation using discrete Fourier transform techniques

This paper addresses the problem of selecting the optimum training sequence for channel estimation in communication systems over time-dispersive channels. By processing in the frequency domain, a new explicit form of search criterion is found, the gain loss factor (GLF), which minimizes the variance of the estimation error and is easy to compute. Theoretical upper and lower bounds on the GLF are derived. An efficient directed search strategy and optimal sequences up to length 42 are given. These sequences are optimal only for frequency domain estimation, not for time domain estimation.