{'fraction_non_alphanumeric': 0.01569506726457399, 'fraction_numerical': 0.004484304932735426, 'mean_word_length': 5.114155251141552, '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 optimal signal reconstruction over switching networks

In this paper we consider signal reconstruction over networks where the communication channel can be modeled as an input switching system (e.g., wireless communication). In particular, we formulate the design problem as a prototypical model matching problem where the various mappings involved belong to a class of input switching systems. The design interest is placed on minimizing the worst case performance of this model matching system over all possible switchings with either l1induced norm or H2 norm as the performance criterion. This minimization is performed over all stable receivers Q in the class of input switching systems. For the particular set-up at hand and in the case of matched switching, two convergent sequences to the optimal solution from above and below respectively are formulated in terms of linear programs and quadratic programs respectively for the l1-induced and H2 norm optimizations. An approximate solution with any given precision is possible by finite truncation. Also, it is shown that the optimal receiver Q need not depend on the switching sequence in the cases of partially matched switching and unmatched switching, and that it can be obtained as a linear time-invariant (LTI) solution to an associated l1 induced or H2 norm optimization.