Multi-cell large-scale MIMO user grouping method and system based on graph clustering

Through graph clustering technology, the pairing and timely frequency resource allocation of users and base stations is realized in a large-scale MIMO system, which solves the problems of co-frequency interference and high complexity in multiple cell users, improves system and rate performance, and reduces the Computational complexity.

CN119071874AActive Publication Date: 2024-12-03SOUTHEAST UNIV

Patent Information

Application Number
CN202411055469.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-02
Publication Date
2024-12-03
Estimated Expiration
2044-08-02

AI Technical Summary

Technical Problem

In large-scale MIMO systems, co-frequency interference between multiple cell users limits system performance, and the existing user grouping method is complex to calculate and difficult to achieve global optimal solutions, especially in dense user scenarios.

Method used

Using multi-cell user grouping method based on graph clustering, by establishing user relationship graphs, constructing density connection trees, cutting trees, and combining statistical channel covariance matrix, the timely frequency resource allocation between users and base stations is realized, reducing the computational complexity and Improve system and speed.

Benefits of technology

The system and rate are significantly improved, the computational complexity is reduced, and the running time is only half of the hierarchical clustering method, which improves the system and rate performance by more than 20%.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119071874A_ABST
    Figure CN119071874A_ABST
Patent Text Reader

Abstract

The invention discloses a multi-cell large-scale MIMO (Multiple Input Multiple Output) user grouping method and system based on graph clustering, which are used for realizing pairing of users and base stations and allocation of time-frequency resource blocks. According to the method, user grouping is carried out by taking maximization of the system sum rate as a target, and users in the same group communicate with the same base station by using the same time-frequency resource block. The method comprises the following steps: firstly, selecting part of users as nodes, determining edges and weights according to a statistical channel covariance matrix, and constructing a multi-cell user relation graph; converting the graph into a density connection tree by using local density; cutting the tree according to the average edge weight to obtain an initial user grouping result; and finally, determining the group to which the remaining users belong according to a user grouping criterion. According to the invention, high system and rate can be realized with low complexity, and the problems of user scheduling and time-frequency resource allocation of the multi-cell large-scale MIMO system are effectively solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to a multi-cell large-scale MIMO system resource allocation technology based on graph clustering, in particular to user scheduling and time-frequency resource allocation, and belongs to the technical field of wireless communication. Background Art

[0002] Massive Multiple-Input Multiple-Output (MIMO) technology is one of the key technologies to meet the demand for ultra-high transmission rates. By equipping the base station with a large number of antenna arrays, the massive MIMO system can serve more users on the same resource blocks (RBs). In a multi-cell environment, co-channel interference (CCI) will occur between users sharing the same RB, which greatly limits the performance of the massive MIMO system. An effective solution is to group users in multiple cells, and simultaneously implement user and base station pairing and RB allocation to reduce CCI and improve system and rate. Common user grouping methods include greedy or heuristic search methods, reinforcement learning methods, and unsupervised learning methods. Greedy or heuristic search methods can usually find local optimal solutions, but may not reach the global optimal solution. Reinforcement learning methods will lead to higher computational complexity in dense user scenarios due to the significant increase in action space. Unsupervised learning methods group users by mining implicit features of data, which has the advantage of low complexity and is particularly suitable for multi-cell user grouping problems. As an unsupervised learning method, graph clustering shows significant computational advantages when processing large-scale data. By modeling data as a graph structure and clustering using the topological features of the graph, graph clustering can effectively identify the group structure in the data, while reducing computational complexity and improving the quality and efficiency of user grouping.

[0003] In addition, most user grouping methods rely on instantaneous channel state information, which changes rapidly over time, which may lead to frequent updates of user grouping results or unsatisfactory grouping results over a period of time. Statistical channel state information changes slowly and can be accurately obtained, and research has confirmed that it has significant utility in user scheduling. In view of the characteristics of multi-cell communication, the present invention applies graph clustering technology to the multi-cell user grouping problem based on statistical channel information, achieving the dual goals of low computational complexity and high system and rate. Summary of the invention

[0004] Purpose of the invention: In the multi-cell transmission scenario of large-scale MIMO, in order to address the problems of strong interference among multiple cells and high complexity of resource allocation in dense user scenarios, the present invention discloses a multi-cell large-scale MIMO user grouping method and system based on graph clustering, which simultaneously realizes the pairing of users and base stations and the allocation of time-frequency resources. Compared with existing similar technical means, this method can reduce the computational complexity and improve the system and rate.

[0005] Technical solution: In order to achieve the above-mentioned purpose, the present invention adopts the following technical solution: a multi-cell large-scale MIMO user grouping method based on graph clustering, wherein the user grouping is performed according to the statistical channel covariance matrix with the goal of maximizing the system and rate, and the same group of users uses the same time-frequency resource block to communicate with the same base station, and the specific steps are as follows: Step 1, establish a graph, select some users as nodes based on the channel gain between the user and each base station to establish a multi-cell user relationship graph, and determine the edges and weights between the user nodes according to the statistical channel covariance matrix; Step 2, construct a tree, and convert the above-mentioned multi-cell user relationship graph into a density connection tree according to the principle of local density maximization; Step 3, cut the tree, cut the tree according to the average edge weight, and preferentially remove the edges with the largest minimum value of the average edge weight of the two connected node groups, so as to obtain the same number of node groups as the number of time-frequency resource blocks to be allocated, and combine the base stations paired with the users to obtain the initial user grouping results; Step 4, supplement the grouping, and determine the user group to which the remaining users belong according to the user grouping criterion of giving priority to no interference between users and secondly considering the system and rate loss.

[0006] Furthermore, users are grouped according to the statistical covariance matrix of the beam domain channel between the users and each base station. The beam domain channel is the channel obtained after the sampling matrix performs angle sampling on the spatial channel, and its statistical covariance matrix is ​​a diagonal matrix, and each diagonal element represents the channel energy in the corresponding direction; the direction corresponding to the diagonal element exceeding the threshold is the main channel direction between the user and the base station, and the direction corresponding to the maximum diagonal element in the main channel direction is the direction of the maximum channel gain between the user and the base station.

[0007] Furthermore, in step 1, some users are selected as nodes, and each node is paired with the base station with the largest channel gain. The selected node satisfies that the ratio of the channel gain between it and the paired base station to the sum of the channel gains between it and all base stations exceeds a threshold; the direction assigned to each node is the direction of the maximum channel gain between it and the paired base station, and if the two nodes do not interfere with each other in their respective assigned directions, there is an edge between them, and the weight of the edge is equal to the minimum value of the maximum channel gain of the two nodes multiplied by the ratio of the number of their common main channel directions to the total number of main channel directions.

[0008] Assume that users k1 and k2 are nodes in the graph, paired with base stations n1 and n2 respectively, and assigned directions l1 and l2 respectively; the two users do not interfere with each other in their respective assigned directions, which means that the main channel direction of user k1 and base station n2 does not include l2, and the main channel direction of user k2 and base station n1 does not include l1.

[0009] Furthermore, in step 2, the constructed multi-cell user relationship graph is converted into a density connection tree according to the principle of local density maximization, ensuring that all nodes are connected to each other and no closed loop is formed, and the local density of the two nodes is equal to the edge weight between them multiplied by the ratio of the number of common adjacent nodes to the total number of adjacent nodes. The specific steps of constructing the density connection tree are as follows: step 2.1, randomly select a node as the starting point of the density connection tree; step 2.2, select the adjacent node with the largest local density with the node in the tree and connect it to the density connection tree; step 2.3, repeat step 2.2 until all nodes are added to the density connection tree.

[0010] Furthermore, in the step 3, the initial user grouping result is obtained by cutting the tree, and the specific steps are as follows: step 3.1, calculate the D value of each edge, that is, the minimum value of the average edge weight of the two node groups connected by the edge; step 3.2, remove the edge with the maximum D value; step 3.3, repeat step 3.2 until L node groups are generated, where L represents the number of time-frequency resource blocks to be allocated; step 3.4, according to the base stations corresponding to the nodes, further divide the above groups into N×L node groups, where N represents the number of cells.

[0011] Furthermore, in step 4, the direction in which the users to be grouped will be assigned when entering each user group is first determined, that is, the direction in which the users to be grouped receive the least interference when communicating with the corresponding base station on the time-frequency resource blocks corresponding to each user group, and then the group to which the users belong is determined based on the user grouping criteria.

[0012] Furthermore, the user grouping criteria are as follows: priority is given to non-interference between the user to be grouped and the users in the group to be joined: if the user to be grouped and all users in a certain user group do not interfere with each other in their respective assigned directions, the user joins the group; if there are multiple groups that do not interfere with each other, priority is given to selecting the group whose main channel direction of all users in the group has the highest overlap with the main channel direction of the user to be grouped; secondly, considering the system sum rate loss, a user group with the smallest clustering cost is selected for the user to be grouped, wherein the clustering cost of a user joining a certain user group is the difference between the original system sum rate and the system sum rate after the user joins the certain group.

[0013] The present invention also provides a multi-cell massive MIMO user grouping system based on graph clustering, including a central scheduler, which is used to group users according to a statistical channel covariance matrix with the goal of maximizing the system sum rate, and the same group of users communicates with the same base station using the same time-frequency resource block, and the central scheduler includes:

[0014] A graph building module, used to select some users as nodes to build a multi-cell user relationship graph based on the channel gains between the users and each base station, and determine the edges and weights between the user nodes based on the statistical channel covariance matrix;

[0015] A tree construction module, used to convert the multi-cell user relationship graph into a density connection tree according to the principle of local density maximization;

[0016] A tree cutting module is used to cut the tree according to the average edge weight, preferentially remove the edge with the largest minimum average edge weight of the two connected node groups, obtain the same number of node groups as the number of time-frequency resource blocks to be allocated, and obtain the initial user grouping result in combination with the base station paired with the user;

[0017] The supplementary grouping module is used to determine the user group to which the remaining users belong according to the user grouping criterion of giving priority to no interference between users and secondly considering the minimum system and rate loss.

[0018] The present invention also provides a computer program product, comprising a computer program / instruction, which, when executed by a processor, implements the steps of the multi-cell large-scale MIMO user grouping method based on graph clustering.

[0019] Beneficial effects: The multi-cell large-scale MIMO user grouping method based on graph clustering proposed in the present invention can simultaneously realize the pairing of users and base stations and the allocation of time-frequency resource blocks, effectively reduce co-frequency interference, and improve the system and rate. Compared with the baseline algorithm, the system and rate are significantly improved by more than 20%. In addition, the method also effectively reduces the computational complexity. In the dense user scenario, its running time is only half of that of the hierarchical clustering method. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Figure 1 The present invention is a flowchart of a multi-cell user grouping method based on graph clustering according to an embodiment of the present invention.

[0021] Figure 2 Schematic diagram of a density connection tree in an embodiment of the present invention.

[0022] Figure 3 The figure is a comparison chart of the performance of the embodiment of the present invention and the baseline algorithm as the signal-to-noise ratio changes.

[0023] Figure 4 This is a comparison chart of the performance of the embodiment of the present invention and the baseline algorithm as the number of users changes. DETAILED DESCRIPTION

[0024] In order to make the purpose, technical solution and effect of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the accompanying drawings of the present invention.

[0025] like Figure 1 As shown, an embodiment of the present invention discloses a multi-cell large-scale MIMO user grouping method based on graph clustering, with the goal of maximizing the system and rate, and performing user grouping according to the statistical channel covariance matrix, and the same group of users uses the same time-frequency resource block to communicate with the same base station. In this embodiment, user grouping is performed according to the statistical covariance matrix of the beam domain channel between the user and each base station, wherein the beam domain channel is the channel after the sampling matrix performs angle sampling on the spatial channel, and its statistical covariance matrix is ​​a diagonal matrix, and each diagonal element represents the channel energy in the corresponding direction; the direction corresponding to the diagonal element exceeding the threshold can be set as the main channel direction between the user and the base station, and the direction corresponding to the maximum diagonal element in the main channel direction is the maximum channel gain direction between the user and the base station.

[0026] Specifically, in this embodiment, the multi-cell massive MIMO user grouping method based on graph clustering specifically includes:

[0027] Step 1: Based on the channel gains between users and base stations, some users are selected as nodes to establish a multi-cell user relationship graph, and the edges and weights between user nodes are determined according to the statistical channel covariance matrix.

[0028] In this embodiment, some users are selected as nodes, and each node is paired with the base station with the largest channel gain. The selected nodes satisfy that the ratio of the channel gain between the node and the paired base station to the sum of the channel gains between the user and all base stations exceeds a threshold; the direction assigned to each node is the direction of the maximum channel gain between the node and the paired base station, and if the two nodes do not interfere with each other in their respective assigned directions, there is an edge between them, and the weight of the edge is equal to the minimum value of the maximum channel gain of the two nodes multiplied by the ratio of the number of their common main channel directions to the total number of main channel directions.

[0029] Exemplarily, assuming that users k1 and k2 are nodes in the graph, paired with base stations n1 and n2 respectively, and assigned directions l1 and l2 respectively, the two users do not interfere with each other in their respective assigned directions, which means that the main channel direction of user k1 and base station n2 does not include l2, and the main channel direction of user k2 and base station n1 does not include l1.

[0030] Step 2: Convert the multi-cell user relationship graph into a density connection tree according to the principle of local density maximization.

[0031] In this embodiment, the local density of two nodes is equal to the edge weight between them multiplied by the ratio of the number of common adjacent nodes to the total number of adjacent nodes; the steps of constructing a density connection tree include:

[0032] Step 2.1, randomly select a node as the starting point of the density connection tree;

[0033] Step 2.2, select the neighboring node with the largest local density to the node in the tree and connect it to the density connection tree;

[0034] Step 2.3, repeat step 2.2 until all nodes are added to the density-connected tree.

[0035] Step 3: Cut the tree according to the average edge weight, and preferentially remove the edge with the largest minimum average edge weight between the two node groups connected, so as to obtain the same number of node groups as the number of time-frequency resource blocks to be allocated, and combine the base stations paired with the users to obtain the initial user grouping results.

[0036] In this embodiment, the step of obtaining the initial user grouping result by cutting the tree includes:

[0037] Step 3.1, calculate the D value of each edge, that is, the minimum value of the average edge weight of the two node groups connected by the edge;

[0038] Step 3.2, remove the edge with the maximum D value;

[0039] Step 3.3, repeating step 3.2 until L node groups are generated, where L represents the number of time-frequency resource blocks to be allocated;

[0040] Step 3.4: further divide the above grouping into N×L node groups according to the base stations corresponding to the nodes, where N represents the number of cells.

[0041] Step 4: determine the user group to which the remaining users belong based on the user grouping criterion of giving priority to no interference between users and secondly considering the minimum system and rate loss.

[0042] In an embodiment, the direction in which the users to be grouped will be assigned when entering each user group can be determined first, that is, the main channel direction in which the users to be grouped are least interfered when communicating with the corresponding base station on the time-frequency resource blocks corresponding to each user group, and then the group to which the users belong can be determined based on the user grouping criteria.

[0043] Exemplarily, the user grouping criteria can be described as:

[0044] Priority is given to the non-interference between the user to be grouped and the users in the group to be joined: if the user to be grouped and all users in a certain user group do not interfere with each other in their respective assigned directions, the user joins the group; if there are multiple groups that do not interfere with each other, the group with the highest overlap between the main channel direction of all users in the group and the main channel direction of the user to be grouped is selected;

[0045] Secondly, the system sum rate loss is considered, and the user group with the smallest clustering cost is selected for the users to be grouped. The clustering cost of a user joining a user group is the difference between the original system sum rate and the system sum rate after the user joins a group.

[0046] The following further exemplifies the user grouping method based on graph clustering provided by the embodiment of the present invention in conjunction with a specific multi-cell massive MIMO system scenario.

[0047] Consider a multi-cell massive MIMO system consisting of N base stations and K users. Each base station is equipped with a uniform linear array of M antennas. The antenna array spacing is d = 0.5λ, where λ is the carrier wavelength. Each user is equipped with a single antenna. After OFDM modulation, the system has L time-frequency resource blocks to be allocated. It is assumed that the channel coefficients in each time-frequency resource block remain unchanged. (The following analysis is about a single time slot and does not involve resource allocation in the time dimension.)

[0048] For a uniform linear array with half-wavelength spacing, the steering vector of the antenna array can be expressed as

[0049]

[0050] Where Ω = cos(θ) is the direction cosine and θ is the angle of arrival. On the time-frequency resource block l, the channel between base station n and user k is It can be expressed as

[0051]

[0052] Among them, Q n,k The number of paths between base station n and user k, a n,k,q is the channel gain of the qth path, f c is the carrier frequency, Δf is the frequency interval between adjacent time-frequency resource blocks, and are the time delay and direction cosine of the qth path respectively. and are respectively the delay set and direction cosine set of the multipath between base station n and user k.

[0053] Define the matrix V as in are direction cosines uniformly sampled in the range [-1,1), and X = sM is the number of direction cosines sampled, where Then, V is a semi-unitary matrix, that is, VV H =I, I is the unit matrix, H represents the conjugate transpose. n,k,l It can be approximated as

[0054]

[0055] in, The xth element of

[0056]

[0057] Among them, the collection and In this embodiment, V is referred to as a spatial sampling matrix. It is called beam domain channel.

[0058] For the beam domain channel, the statistical channel covariance matrix Its (x, y)th element is calculated as

[0059]

[0060] Where * represents conjugation and δ(·) is the Kronecker delta function. From equation (4), we can see that different elements of the beam domain channel represent the channel gains of different paths. When using large antennas, the base station can separate signals at different angles. Based on the assumption of uncorrelated scattering, If each element of is an independent complex random variable with zero mean and different variance, then equation (a) holds, and Γ n,k is a diagonal matrix. In addition, Γ n,k The xth diagonal element [Γ n,k ] x represents the channel energy of user k in the xth sampling direction of base station n. Since the number of channel multipaths is much smaller than the number of antennas, Γ n,k is a sparse diagonal matrix.

[0061] Consider the uplink transmission of a multi-cell massive MIMO system. Indicates the user grouping scheme, where user group Contains users communicating with base station n through time-frequency resource block l. The user set using time-frequency resource block l is expressed as The set of users served by base station n is expressed as The signal received by base station n on time-frequency resource block l can be expressed as

[0062]

[0063] in, is additive Gaussian noise, σ2 is the noise variance, is the data signal of user k, p k is the transmission power. Assume that each user sends a signal with equal power, that is, p k =p (p is a constant). Under linear detection, about the user The received signal is expressed as

[0064]

[0065] in, is the receiving vector of base station n on time-frequency resource block l for user k, and satisfies ||w n,K,l ||2=1, includes interference and noise. Then, the user The signal-to-interference-noise ratio can be calculated as

[0066]

[0067] in, Since V is a semi-unitary matrix, substituting (3) into the expression of signal-to-interference-noise ratio yields equation (b). The uplink ergodic achievable rate of is given by

[0068]

[0069] In order to reduce the computational complexity of the Monte Carlo average in the traversal rate, this embodiment gives the following approximate rate

[0070]

[0071] in, Yes n,k,l The numerator and denominator of are respectively the expected results. According to the properties of generalized Rayleigh entropy, The maximum value of

[0072]

[0073] in, Indicates that base station n is allocated to user Direction, equal Then, the uplink sum rate can be expressed as

[0074]

[0075] With the goal of maximizing the system sum rate, the multi-cell user grouping problem can be expressed as

[0076]

[0077] The first and second conditions ensure that each user belongs to a user group and uses a time-frequency resource block and a base station for communication. The third condition ensures that all users are scheduled.

[0078] Since Γ n,k Is a sparse matrix, first define the set Contains the main channel direction between base station n and user k, where the constant Constant a>0. Condition [Γ n,k ] x ≥max[θ·tr(Γ n,k ),a] represents [Γ n,k ] x Exceeds the threshold a and is much larger than the smaller element in the sparse matrix. is the direction of maximum channel gain between base station b and user k. According to equation (11), user The interference received comes from other users assigned to the same time-frequency resource block and direction. Therefore, when grouping users, the channel directions of users in the same group must be carefully considered. In order to maximize the system and rate, this embodiment proposes the following user grouping criteria.

[0079] Rule 1: If and Users k1 and k2 are allocated the same time-frequency resource blocks, wherein n1 and n2 are the base station indexes of the pairing of users k1 and k2 respectively (n1 may be equal to n2).

[0080] Criterion 2: If users k1, k2, and k3 all meet Criterion 1, and User k1 is preferentially allocated to the same time-frequency resource block as k2.

[0081] Rule 3: If and User k1 is assigned to user group in

[0082] Criteria 4: If user k1 and user group Satisfies criterion 3, and User k1 is assigned to user group first

[0083] Criteria 1 and 2 are pairing criteria between two users, where Criteria 1 states that if two users do not interfere with each other in the direction of maximum channel gain between their paired base stations, they can use the same time-frequency resource block; Criteria 2 states that if there are multiple users that do not interfere with each other, the user to be decided and the user with the highest overlap in the main channel direction use the same time-frequency resource block. Criteria 3 and 4 are user grouping criteria under known initial user grouping, where Criteria 3 states that if the user to be grouped and all users in a certain user group do not interfere with each other in their respective assigned directions, the user can be assigned to the group. Criteria 4 states that if there are multiple groups that do not interfere with each other, the user to be grouped joins the group with the highest overlap in the main channel direction with all users in the group.

[0084] Based on the multi-cell user grouping problem and user grouping criteria described above, this embodiment uses a weighted graph To describe the multi-cell user relationship, ε and Represents the set of nodes, edges and weights respectively. The central scheduler regards some users as nodes, and the node set is defined as

[0085]

[0086] Among them, the constant is the threshold. If the user User k and base station n k The channel gain between user k and base station n is significantly greater than the channel gain between user k and other base stations. k Pairing. Only when two users meet the grouping criterion 1 (i.e., and )hour, There is an edge between two nodes in The weight is determined by the minimum value of the maximum channel gain of the two nodes and the ratio of the number of main channel directions they share to the total number of main channel directions, which is given by the following formula:

[0087]

[0088] in, Given by the following formula

[0089]

[0090] According to the above graph, the local density of any two nodes can be calculated, which is determined by the edge weight between them and the ratio of the number of common adjacent nodes to the total number of adjacent nodes. The formula is expressed as:

[0091]

[0092] Among them, the adjacent node set

[0093] After calculating the local density, the multi-cell user relationship graph is converted into a density connection tree. In the density connection tree, each node in the original graph is connected to its most similar node according to the local density. Specifically, a node is first randomly selected as the starting point of the density connection tree, and then the adjacent nodes with the largest local density with the node in the tree are gradually selected and connected to the density connection tree until all nodes are successfully added to the density connection tree.

[0094] like Figure 2 As shown in , the density-connected tree connects all nodes and does not form closed loops. Cutting an edge in the density-connected tree can split the graph into two parts. Definition To evaluate the quality of graph clustering,

[0095]

[0096] Delete the edge with the largest D value to cut the density connection tree until L groups are obtained. According to the base station corresponding to each user, the L groups can be further divided into N×L groups This is the initial user grouping result.

[0097] For collections For users outside the cell, especially those at the cell edge, the central scheduler groups them according to user grouping criteria 3 and 4. If there is no user group that satisfies grouping criterion 3 with the user to be grouped, then according to the clustering cost function Determine user groups. The clustering cost function is defined as

[0098]

[0099] in, is the sum rate of all users using time-frequency resource block l, After adding user k, we get the set The user group assigned to user k is

[0100] In order to enable those skilled in the art to better understand the solution of the present invention, the performance demonstration and computational complexity comparison of the multi-cell user grouping method based on graph clustering in this embodiment under specific system configuration are given below. The simulation environment is generated by the QuaDRiGa platform, where the base station is equipped with M=128 antennas and each user is equipped with a single antenna. More than 500 samples are simulated and analyzed, and the proposed algorithm is compared with the benchmark algorithms, SC-MS, MADOC, and AUC.

[0101] Figure 3The user grouping performance of different algorithms is compared when the system configuration is K=100, L=6, and N=3. Under low signal-to-noise ratio, the difference in the system sum rate of each algorithm is small, but the method proposed in this patent shows better performance. Under high signal-to-noise ratio, the method of this embodiment improves the system sum rate by 11%, 14%, and 19% respectively compared with the SC-MS, MADOC, and AUC algorithms.

[0102] Figure 4 The performance of the algorithms is compared with the number of users when the system configuration is L=12 and N=3 under high signal-to-noise ratio. As the number of users increases, the system sum rate gradually improves. However, when the number of users exceeds 700, the system sum rates using the SC-MS, MADOC, and AUC algorithms begin to decrease. Due to the effectiveness of the proposed user grouping criterion, the proposed method shows better performance in improving the system sum rate.

[0103] Table 1 Operation schedule

[0104]

[0105] *(N,L,K) represent the number of base stations, the number of time-frequency resource blocks and the number of users respectively

[0106] Table 1 provides the running time of each algorithm under different system configurations. The MADOC algorithm using the K-means clustering principle has the shortest running time, followed closely by the method of the present invention. As the number of users increases, the running time of the SC-MS and AUC algorithms increases significantly.

[0107] Based on the same inventive concept, an embodiment of the present invention also discloses a multi-cell large-scale MIMO user grouping system based on graph clustering, including a central scheduler, which is used to group users according to a statistical channel covariance matrix with the goal of maximizing the system and rate, and the same group of users uses the same time-frequency resource block to communicate with the same base station. The central scheduler includes: a graph establishment module, which is used to select some users as nodes based on the channel gain between the users and each base station to establish a multi-cell user relationship graph, and determine the edges and weights between the user nodes according to the statistical channel covariance matrix; a tree construction module, which is used to convert the above-mentioned multi-cell user relationship graph into a density connection tree according to the principle of local density maximization; a tree cutting module, which is used to cut the tree according to the average edge weight, preferentially remove the edges with the largest minimum value of the average edge weight of the two connected node groups, obtain the same number of node groups as the number of time-frequency resource blocks to be allocated, and obtain the initial user grouping result in combination with the base station paired with the user; a supplementary grouping module, which is used to determine the user group to which the remaining users belong according to the user grouping criterion of giving priority to no interference between users and secondly considering the system and rate loss.

[0108] The detailed working process of each module described above can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here. The module division is only a logical function division, and there may be other division methods in actual implementation, such as multiple modules can be combined or integrated into another system.

[0109] The present invention also provides a computer program product, including a computer program / instruction, which implements the steps of the multi-cell large-scale MIMO user grouping method based on graph clustering when the computer program / instruction is executed by a processor. The program code for implementing the method of the present invention can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer or other programmable data processing device, so that the program code, when executed by the processor or controller, implements the steps of the method of the present invention. The program code can be executed entirely on the machine, partially on the machine, partially on the machine as a stand-alone software package and partially on a remote machine, or entirely on a remote machine or server.

Claims

1. A multi-cell massive MIMO user grouping method based on graph clustering, characterized in that: The method aims to maximize the system sum rate, groups users according to the statistical channel covariance matrix, and the same group of users communicates with the same base station using the same time-frequency resource block, and includes the following steps: Step 1: Select some users as nodes based on the channel gains between users and base stations to establish a multi-cell user relationship graph, and determine the edges and weights between user nodes based on the statistical channel covariance matrix; Step 2: convert the multi-cell user relationship graph into a density connection tree according to the principle of local density maximization; Step 3: Cut the tree according to the average edge weight, and preferentially remove the edge with the largest minimum average edge weight of the two connected node groups, so as to obtain the same number of node groups as the number of time-frequency resource blocks to be allocated, and combine the base stations paired with the users to obtain the initial user grouping result; Step 4: determine the user group to which the remaining users belong based on the user grouping criterion of giving priority to no interference between users and secondly considering the minimum system and rate loss.

2. The multi-cell massive MIMO user grouping method based on graph clustering according to claim 1, characterized in that: Users are grouped according to the statistical covariance matrix of the beam domain channel between the user and each base station. The beam domain channel is the channel obtained after the sampling matrix performs angle sampling on the spatial channel, and its statistical covariance matrix is ​​a diagonal matrix, and each diagonal element represents the channel energy in the corresponding direction; the direction corresponding to the diagonal element exceeding the threshold is the main channel direction between the user and the base station, and the direction corresponding to the maximum diagonal element in the main channel direction is the direction of the maximum channel gain between the user and the base station.

3. The multi-cell massive MIMO user grouping method based on graph clustering according to claim 1, characterized in that: In the step 1, some users are selected as nodes, and each node is paired with the base station with the largest channel gain. The selected nodes satisfy that the ratio of the channel gain between the node and the paired base station to the sum of the channel gains between the user and all base stations exceeds a threshold; the direction assigned to each node is the direction of the maximum channel gain between the node and the paired base station, and if the two nodes do not interfere with each other in their respective assigned directions, there is an edge between them, and the weight of the edge is equal to the minimum value of the maximum channel gain of the two nodes multiplied by the ratio of the number of their common main channel directions to the total number of main channel directions; the main channel direction between the user and the base station is the direction corresponding to the diagonal element in the statistical channel covariance matrix whose channel energy exceeds the set threshold.

4. The multi-cell massive MIMO user grouping method based on graph clustering according to claim 3, characterized in that: Assume that users k1 and k2 are nodes in the graph, paired with base stations n1 and n2 respectively, and assigned directions l1 and l2 respectively. The two users do not interfere with each other in their respective assigned directions, which means that the main channel direction of user k1 and base station n2 does not include l2, and the main channel direction of user k2 and base station n1 does not include l1.

5. The multi-cell massive MIMO user grouping method based on graph clustering according to claim 1, characterized in that: In step 2, the local density of two nodes is equal to the edge weight between them multiplied by the ratio of the number of common adjacent nodes to the total number of adjacent nodes; The steps to construct a density-linkage tree include: Step 2.1, randomly select a node as the starting point of the density connection tree; Step 2.2, select the neighboring node with the largest local density to the node in the tree and connect it to the density connection tree; Step 2.3, repeat step 2.2 until all nodes are added to the density-connected tree.

6. The multi-cell massive MIMO user grouping method based on graph clustering according to claim 1, characterized in that: In step 3, the step of obtaining the initial user grouping result by cutting the tree includes: Step 3.1, calculate the D value of each edge, that is, the minimum value of the average edge weight of the two node groups connected by the edge; Step 3.2, remove the edge with the maximum D value; Step 3.3, repeating step 3.2 until L node groups are generated, where L represents the number of time-frequency resource blocks to be allocated; Step 3.4: further divide the above grouping into N×L node groups according to the base stations corresponding to the nodes, where N represents the number of cells.

7. The multi-cell massive MIMO user grouping method based on graph clustering according to claim 1, characterized in that: In step 4, the direction in which the users to be grouped will be assigned when entering each user group is first determined, that is, the main channel direction in which the users to be grouped receive the least interference when communicating with the corresponding base station on the time-frequency resource blocks corresponding to each user group, and then the group to which the users belong is determined according to the user grouping criteria.

8. The multi-cell massive MIMO user grouping method based on graph clustering according to claim 7, characterized in that: The user grouping criteria are: Priority is given to the non-interference between the user to be grouped and the users in the group to be joined: if the user to be grouped and all users in a certain user group do not interfere with each other in their respective assigned directions, the user joins the group; if there are multiple groups that do not interfere with each other, the group with the highest overlap between the main channel direction of all users in the group and the main channel direction of the user to be grouped is selected; Secondly, the system sum rate loss is considered, and the user group with the smallest clustering cost is selected for the users to be grouped. The clustering cost of a user joining a user group is the difference between the original system sum rate and the system sum rate after the user joins a group.

9. A multi-cell massive MIMO user grouping system based on graph clustering, characterized in that: The central scheduler is used to group users according to the statistical channel covariance matrix with the goal of maximizing the system sum rate, and the same group of users communicates with the same base station using the same time-frequency resource block, and the central scheduler includes: A graph building module, used to select some users as nodes to build a multi-cell user relationship graph based on the channel gains between the users and each base station, and determine the edges and weights between the user nodes based on the statistical channel covariance matrix; A tree construction module, used to convert the multi-cell user relationship graph into a density connection tree according to the principle of local density maximization; A tree cutting module is used to cut the tree according to the average edge weight, preferentially remove the edge with the largest minimum average edge weight of the two connected node groups, obtain the same number of node groups as the number of time-frequency resource blocks to be allocated, and obtain the initial user grouping result in combination with the base station paired with the user; The supplementary grouping module is used to determine the user group to which the remaining users belong according to the user grouping criterion of giving priority to no interference between users and secondly considering the minimum system and rate loss.

10. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instructions are executed by a processor, the steps of a multi-cell massive MIMO user grouping method based on graph clustering are implemented according to any one of claims 1-8.

Citation Information

Patent Citations

  • Spatial-orthogonality-based large-scale MIMO (multiple input multiple output) system pilot frequency distribution method

    CN103298124A

  • Transmission method with channel estimation and power control combined based on user arrival direction

    CN106330278A

  • User packet method based on density in large-scale MIMO system downlink

    CN106899338A

  • Interference free geographical zonal mapping utilizing slow varying channel covariance matrix

    CN110892688A

  • System and method for grouping of users into overlapping clusters in social networks

    US20130013601A1

Cited By

  • Balanced clustering method for cellular-removed large-scale MIMO system

    CN120378961A