{'fraction_non_alphanumeric': 0.029850746268656716, 'fraction_numerical': 0.0, 'mean_word_length': 5.319371727748691, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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}}
Factorization properties of optimum space-time processors in nonstationary environments

A structural analysis of space-time log-likelihood processors (LLP) that applies to arbitrary signal transmission models consisting of N sources, M sensors, a time-varying linear channel, and nonstationary Gaussian source signal and sensor noise processes is presented. The approach is based on representing the time-varying linear channel as a bounded linear operator L with closed range. By exploiting the properties of such operators and the specific structure of the array covariance function, it is shown that the classical M-dimensional integral equations defining the LLP can be transformed into equivalent N-dimensional integral equations. As a result, it is always possible to factor the LLP into a cascade of three specialized time-varying subprocessors, namely, a space-time whitening filter, an M-input N-output unitary beamformer (UB), and an N-input quadratic postprocessor (QPP). Both the UB and the QPP are given an interpretation and their most important features are indicated. To illustrate the theory, several examples of its application to signal models involving time-varying delays are given. >