{'fraction_non_alphanumeric': 0.03361344537815126, 'fraction_numerical': 0.0, 'mean_word_length': 5.34319526627219, '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}}
A Matching-Based User Pairing and Resource Allocation Mechanism for V-MIMO Systems

In this paper, we investigate the joint user pairing and resource allocation (UP-RA) problem in uplink multi-user MIMO or virtual MIMO (V-MIMO) systems. Due to the practical transmission constraints, solving such a joint optimization problem is NP-hard. Therefore, we study this problem from a novel perspective, and propose a universal and efficient heuristic algorithm. First, we formulate the UP-RA problem as a special many-to-one matching problem with constraints. Different from most existing researches, we consider a universal scheduling problem, instead of a particular one. Then, we modify the classical deferred acceptance (DA) algorithm which is designed for the common many-to-one matching problem, and develop a lowcomplex heuristic algorithm called adapted deferred acceptance (ADA) algorithm for the UP-RA problem. Numerical results demonstrate that the ADA algorithm achieves robust and better performance compared with other representative algorithms in many scenarios.