{'fraction_non_alphanumeric': 0.011221945137157107, 'fraction_numerical': 0.0, 'mean_word_length': 5.083333333333333, '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}}
Equivalent MIMO Channel Matrix Sparcification for Enhancement of Sensor Capabilities

One of the directions of development of new generations of mobile communications is the use of MIMO channels with a large number of antennas. This requires the development and use of new approaches to signal detection in such channels, since the difference in both energy efficiency and complexity between the optimal maximum likelihood algorithm and simpler linear algorithms becomes very large. The goal of the paper is development of a method for transforming a MIMO channel model into a channel with a sparse matrix with a limited number of nonzero elements in a row or representing a MIMO channel signal in the form of a Markov process for using simple iterative MIMO demodulation algorithms (MPA, Turbo, etc.).