{'fraction_non_alphanumeric': 0.02995270625328429, 'fraction_numerical': 0.0, 'mean_word_length': 5.346666666666667, '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}}
Frame/Training Sequence Synchronization and DC-Offset Removal for (Data-Dependent) Superimposed Training Based Channel Estimation

Over the last few years there has been growing interest in performing channel estimation via superimposed training (ST), where a training sequence is added to the information-bearing data, as opposed to being time-division multiplexed with it. Recent enhancements of ST are data-dependent ST (DDST), where an additional data-dependent training sequence is also added to the information-bearing signal, and semiblind approaches based on ST. In this paper, along with the channel estimation, we consider new algorithms for training sequence synchronization for both ST and DDST and block (or frame) synchronization (BS) for DDST (BS is not needed for ST). The synchronization algorithms are based on the structural properties of the vector containing the cyclic means of the channel output. In addition, we also consider removal of the unknown dc offset that can occur due to using first-order statistics with a non-ideal radio-frequency receiver. The subsequent bit error rate (BER) simulations (after equalization) show a performance not far removed from the ideal case of exact synchronization. While this is the first synchronization algorithm for DDST, our new approach for ST gives identical results to an existing ST synchronization method but with a reduced computational burden. In addition, we also present analysis of BER simulations for time-varying channels, different modulation schemes, and traditional time-division multiplexed training. Finally, the advantage of DDST over (conventional, non semi-blind) ST will reduce as the constellation size increases, and we also show that even without a BS algorithm, DDST is still superior to conventional ST. However, iterative semiblind schemes based upon ST outperform DDST but at the expense of greater complexity