{'fraction_non_alphanumeric': 0.028678304239401497, 'fraction_numerical': 0.0, 'mean_word_length': 5.373015873015873, '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}}
On the convergence of joint channel and mismatch estimation for time-interleaved data converters

Mostly digital architectures for communication transceivers rely on the use of accurate analog-to-digital converters (ADCs), which becomes a bottleneck in scaling to multi-Gigabit speeds. A promising workaround is to employ slower, power-efficient sub-ADCs in a time-interleaved ADC (TI-ADC) architecture. While mismatch between sub-ADCs can lead to performance floors, recent work shows that this can be mitigated using joint channel and mismatch compensation algorithms. In this paper, we investigate the scalability and convergence of a recently proposed iterative channel and mismatch estimation algorithm, and derive rules of thumb relating the required length of training to the number of sub-ADCs.