{'fraction_non_alphanumeric': 0.02043132803632236, 'fraction_numerical': 0.0, 'mean_word_length': 5.391304347826087, '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}}
Efficient Data Fusion Using Random Matrix Theory

This letter addresses multisensor data fusion under the Gaussian noise. Under the Gauss–Markov model assumptions, data fusion based on maximum likelihood estimation (MLE) is the minimum variance unbiased estimator. Nonetheless, we propose a linear fusion algorithm based on the random matrix theory, which yields a biased estimator. The proposed estimator has a lower mean squared error (MSE) than the MLE fusion method when the dimensionality of signal is larger than the number of sensors, which is the typical use case in modern fusion systems. The fusion coefficients are directly solved in the proposed method without iteration, and this method can be considered as an approximate implementation of the linear minimum MSE (LMMSE) estimator. Numerical simulations demonstrate the performance gain of the proposed fusion method.