WO2020134771A1 - 一种用户分组的方法、装置和电子设备 - Google Patents

一种用户分组的方法、装置和电子设备 Download PDF

Info

Publication number
WO2020134771A1
WO2020134771A1 PCT/CN2019/120383 CN2019120383W WO2020134771A1 WO 2020134771 A1 WO2020134771 A1 WO 2020134771A1 CN 2019120383 W CN2019120383 W CN 2019120383W WO 2020134771 A1 WO2020134771 A1 WO 2020134771A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
users
root node
capacity
empty
Prior art date
Application number
PCT/CN2019/120383
Other languages
English (en)
French (fr)
Inventor
钱欣瑞
程巍
杜娟
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2020134771A1 publication Critical patent/WO2020134771A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0452—Multi-user MIMO systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/30—Monitoring; Testing of propagation channels
    • H04B17/309—Measuring or estimating channel quality parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/30—Monitoring; Testing of propagation channels
    • H04B17/309—Measuring or estimating channel quality parameters
    • H04B17/336—Signal-to-interference ratio [SIR] or carrier-to-interference ratio [CIR]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H04W4/08—User group management

Definitions

  • This application relates to the field of communication technologies, and in particular, to a method, device, and electronic device for grouping users.
  • Multi-user multi-input and multi-output (English: Multi-User Multi-Input and Multi-Output, abbreviation: MU-MIMO) technology is currently the most important technical means to increase system capacity.
  • the technology is to use the space division between different users to form different The channel can enable users with certain spatial isolation to reuse the same physical resources, thereby increasing the capacity of the mobile communication network, and allowing different users in the cell to schedule on the same time-frequency resources.
  • MU-MIMO technology liberates the limited time-frequency domain resources to a certain extent, and can greatly increase the system capacity.
  • MU-MIMO technology introduces inter-user interference when multiplexing time-frequency resources, compared to single-user multi-input and multi-output (English: Single-User Multi-Input and Multi-Output, abbreviation: SU-MIMO) users can transmit in a single time
  • the amount of data decreases; at the same time, it is precisely because of the reuse of time-frequency resources, increasing the scheduling opportunities of each user in the system. Therefore, there is a need to balance the relationship between the two and increase the system capacity.
  • an embodiment of the present application provides a user grouping method, including: determining a root node user and a non-root node user from a user queue, and an empty group user includes the root node user; according to the empty group user's Correlation, single-user signal-to-dry ratio, SUSINR, and empty splitter number, estimate the capacity of the first cell; sort the non-root node users according to the correlation with the empty group users to generate a user matrix to be paired Select a specific user in the user matrix to be paired; compare the capacity of the second cell after joining the specific user with the capacity of the first cell, and determine whether to add the specific user to an empty group according to the comparison result.
  • an embodiment of the present application provides an apparatus for grouping users, including: a determination module for determining a root node user and a non-root node user from a user queue, and an empty group user includes the root node user; a calculation module , Used to estimate the capacity of the first cell based on the correlation of the empty group users, the single-user signal-to-dry ratio SUSINR, and the number of empty splits; a generation module is used to group the non-root node users according to the empty group users Sort the correlation of the users to generate a matrix of users to be paired, and select a specific user from the matrix of users to be paired; a grouping module is used to compare the capacity of the second cell after joining the specific user with the capacity of the first cell Compare, and determine whether to add the specific user to an empty group according to the comparison result.
  • an embodiment of the present application provides an electronic device, including: a memory, a processor, and computer-executable instructions stored on the memory and executable on the processor, the computer-executable instructions being When the processor executes, it implements the steps of a method for controlling client traffic as described in the first aspect above.
  • an embodiment of the present application provides a computer-readable storage medium for storing computer-executable instructions.
  • the computer-executable instructions are implemented by a processor as described in the first aspect above The steps of a method for controlling client traffic.
  • an embodiment of the present application provides a computer program product.
  • the computer program product includes a computer program stored on a computer-readable storage medium.
  • the computer program includes program instructions. When the program instructions are executed by a computer When the computer is executed to perform the method described in the above aspects.
  • FIG. 1 is a schematic flowchart of a method for grouping users according to an embodiment of the present application
  • FIG. 2 shows another schematic flowchart of a method for grouping users according to an embodiment of the present application
  • FIG. 3 is a schematic structural diagram of an apparatus for grouping users according to an embodiment of the present disclosure.
  • FIG. 4 shows a schematic diagram of a hardware structure of an electronic device that executes a method for grouping users according to an embodiment of the present application.
  • the first type of strategy uses spatial information to group users, and group users according to user spatial information. Dispatch users of different categories together to minimize interference among users.
  • the second type of strategy traverses the user's pairing combination to evaluate the expected traffic of different combinations, and selects the pairing group based on the principle of maximum flow to maximize the flow of the entire pairing group.
  • the first type of strategy is simple and can stably increase cell traffic, but because users are completely classified according to user space information, it is impossible to fully tap the potential of the system.
  • the second type of strategy adds an analysis of the overall flow of users in the pairing group, but due to the large number of traversals, the estimation method may be more complicated, the calculation complexity is very high, and it is more time-consuming. When the measurement is accurate and the estimation method is reliable, the maximum system capacity can be obtained.
  • FIG. 1 shows a schematic flowchart of a method for grouping users according to an embodiment of the present application.
  • the method may be executed by an electronic device, such as user equipment or base station equipment.
  • the method may be performed by software or hardware installed in user equipment or base station equipment.
  • the method may include the following steps.
  • S10 Determine root node users and non-root node users from the user queue, and empty group users include the root node users.
  • QoS Quality of Service
  • the root node user of MU-MIMO is determined from the user queue, and the root node user is added to the null group.
  • the initial state spatio-temporal grouping may have only one root node user.
  • S20 Estimate the capacity of the first cell based on the relevance of the empty group users, the single user signal-to-dry ratio SUSINR, and the number of empty traffic splits.
  • S30 Sort the non-root node users according to their relevance to the empty group users to generate a user matrix to be paired, and select a specific user from the user matrix to be paired.
  • S40 Compare the capacity of the second cell after joining the specific user with the capacity of the first cell, and determine whether to add the specific user to an empty group according to the comparison result.
  • the capacity of the second cell is greater than the capacity of the first cell, it means that the joining of the specific user can increase the system capacity, so the specific user is added to the null group.
  • a user grouping method determines a root node user and a non-root node user from a user queue, and an empty group user includes the root node user, according to the correlation of the empty group user 1.
  • the single-user signal-to-dry ratio SUSINR and the number of empty traffic splits estimate the capacity of the first cell, sort the non-root node users according to their relevance to the empty group users to generate a user matrix to be paired, and select Select a specific user in the paired user matrix, compare the capacity of the second cell after joining the specific user with the capacity of the first cell, and determine whether to add the specific user to an empty group according to the comparison result, which will increase the system capacity Of users join the null group, not only considering the impact of correlation on users in the null group, but also considering the improvement of the capacity of the null group by the user channel quality.
  • FIG. 2 shows another schematic flowchart of a method for grouping users according to an embodiment of the present application.
  • the method may be performed by an electronic device, such as user equipment or base station equipment.
  • the method may be performed by software or hardware installed in user equipment or base station equipment.
  • the method may include the following steps.
  • S10 Determine root node users and non-root node users from the user queue, and empty group users include the root node users.
  • QoS Quality of Service
  • the network can use various basic technologies to provide better service capabilities for the specified network communication. It is a security mechanism of the network and a technology used to solve problems such as network delay and blocking.
  • this step may specifically include step S11.
  • S11 Determine the first user in the user queue as the root node user, and determine the other users in the user queue as the non-root node user.
  • S20 Estimate the capacity of the first cell according to the correlation, SUSINR, and the number of empty traffic splits of the empty group users.
  • this step may specifically include steps S21 to S22.
  • S30 Sort the non-root node users according to their relevance to the empty group users to generate a user matrix to be paired, and select a specific user from the user matrix to be paired.
  • this step may specifically include steps S31 to S33.
  • S31 Sort the non-root node users according to the correlation with the empty group users from low to high to generate a user matrix to be paired.
  • S33 Select the first user in the upper left corner from the user matrix to be paired as the specific user.
  • S40 Compare the capacity of the second cell after joining the specific user with the capacity of the first cell, and determine whether to add the specific user to an empty group according to the comparison result.
  • this step may specifically include steps S41-S42.
  • the empty group user is updated, and the process returns to step S21.
  • the Qos module outputs the user sequence as UE1UE2UE3UE4UE5UE6.
  • the user SRS and SINR (dB) are as follows: [23,27,23,25,30,18]
  • UE 1 1.00 0.17 0.08 0.07 0.45 0.15 UE 2 0.17 1.00 0.33 0.62 0.15 0.25 UE 3 0.08 0.33 1.00 0.43 0.12 0.41 UE 4 0.07 0.62 0.43 1.00 0.05 0.54 UE 5 0.45 0.15 0.12 0.05 1.00 0.21 UE 6 0.15 0.25 0.41 0.54 0.21 1.00
  • step S11 the queue of users to be scheduled is acquired from the Qos module, and the first user is used as the root node user of MU-MIMO, and the remaining users to be scheduled participate in the subsequent pairing process as non-root nodes.
  • UE 1 serves as an empty allocation to the root node
  • UE 2- UE 6 serve as users to be paired.
  • the estimated cell capacity is recorded as C group .
  • SINR and single packet spectrum efficiency of empty packets need to be obtained through actual measurement or simulation.
  • the following table is for reference only.
  • Layer group is the current number of empty groups. When there is only the root node, it is calculated according to the number of SU layers.
  • the users are sorted according to the maximum value of the correlation between the user and the users in the empty group from low to high, and the interval is divided by 0.1; for the same correlation, according to SRS- SINR is sorted from high to low; the user matrix to be paired is output, and the pairing priority decreases for each row; from left to right in the same row, the priority gradually decreases.
  • the initial correlation matrix in the current scenario is as follows:
  • step S33 select the first user in the upper left corner from the matrix of users to be paired to try an empty allocation pair (UE 3 ); according to step S40, according to the user relevance, SU SINR, and total empty split in the newly added pair of users to be paired Number, the estimated cell capacity after adding a new paired user, recorded as C group ';
  • the null packet interference table is based on actual test data. The following table is for reference only.
  • each row represents a different correlation
  • each column corresponds to a different number of empty packet layers
  • the values in the table are interference parameters (dB).
  • SINR sch_group SINR SU_group -I group
  • the SINR sch_group and empty group single-stream spectral efficiency are obtained through actual measurement results.
  • the following table is for reference only.
  • step S41 if C group 'is greater than C group, it is considered that the addition of a new user will increase the system capacity, and the user pairing result is updated; the correlation between the user to be paired and the air separation user is recalculated, according to the method of step 21 Update the user matrix to be paired, and repeat steps 30-40;
  • UE 3 calculates the result of the user matrix to be paired after joining the empty group
  • step S42 if C group 'is less than C group, it is considered that the addition of a new user will reduce the system capacity, and there is no other user among the users to be scheduled to increase the system capacity.
  • the pairing process is ended: the current pairing process is ended, and the scheduling result is output.
  • a user grouping method determines a root node user and a non-root node user from a user queue, and an empty group user includes the root node user, according to the correlation of the empty group user , SUSINR and the number of empty splits, estimate the capacity of the first cell, sort the non-root node users according to the correlation with the empty group users to generate a user matrix to be paired, and select from the user matrix to be paired For a specific user, compare the capacity of the second cell after joining the specific user with the capacity of the first cell, and determine whether to add the specific user to an empty group according to the comparison result, and add a user who can increase the system capacity to the empty group
  • the user matrix provided by the embodiment of the present invention has low maintenance overhead and is easy to sort.
  • the embodiment of the present invention not only considers the impact of correlation on users in an empty packet, but also considers the effect of user channel quality on empty packet capacity. Promotion, real-time calculation of the contribution of each paired user to the system capacity. When a specific user with the lowest correlation with the root node user cannot improve the system capacity, end user grouping, effectively improving the grouping efficiency.
  • FIG. 3 shows a schematic structural diagram of an apparatus for grouping users according to an embodiment of the present disclosure.
  • the apparatus 100 includes a determination module 110, a calculation module 120, a generation module 130, and a grouping module 140.
  • the determining module 110 is configured to determine a root node user and a non-root node user from the user queue, and empty group users include the root node user.
  • the calculation module 120 is configured to estimate the capacity of the first cell based on the correlation of the null group users, the single user signal-to-dry ratio SUSINR, and the number of null splits.
  • the generating module 130 is configured to sort the non-root node users according to their relevance to the empty group users to generate a user matrix to be paired, and select a specific user from the user matrix to be paired.
  • the grouping module 140 is configured to compare the capacity of the second cell after joining the specific user with the capacity of the first cell, and determine whether to add the specific user to an empty group according to the comparison result.
  • the determination module 110 is specifically configured to determine the first user in the user queue as the root node user, and determine other users in the user queue as the non-root node user.
  • the calculation module 120 is specifically configured to check interference parameters of empty packets according to the average correlation between users of empty packets and the current number of empty traffic splits; according to the interference parameters and each empty packet
  • the user's SU SINR estimates the system capacity.
  • the generating module 130 is configured to sort the non-root node users according to the correlation with the empty group users from low to high to generate a user matrix to be paired.
  • the generating module 130 is configured to divide the non-root node users with the same correlation interval, and sort them according to the signal-to-dry ratio SRS-SINR of the reference signal from high to low to generate a user matrix to be paired.
  • the generation module 130 is used to select the first user in the upper left corner from the user matrix to be paired as the specific user.
  • the grouping module 140 is used to add the specific user to the empty group when the capacity of the second cell is greater than the capacity of the first cell.
  • the grouping module 140 is configured not to add the specific user to the empty group when the capacity of the second cell is smaller than the capacity of the first cell, and end the method.
  • an apparatus for grouping users determines the root node user and the non-root node user from the user queue, and the empty group user includes the root node user, according to the correlation of the empty group user 1.
  • the single-user signal-to-dry ratio SUSINR and the number of empty traffic splits estimate the capacity of the first cell, sort the non-root node users according to their relevance to the empty group users to generate a user matrix to be paired Select a specific user in the paired user matrix, compare the capacity of the second cell after joining the specific user with the capacity of the first cell, and determine whether to add the specific user to an empty group according to the comparison result, which will increase the system capacity Of users join the null group, not only considering the interference caused by the correlation to the users in the null group, but also considering the improvement of the capacity of the null group by the user channel quality.
  • FIG. 4 shows a schematic diagram of a hardware structure of an electronic device that executes a method for grouping users according to an embodiment of the present application.
  • the electronic device may have a relatively large difference due to different configurations or performance, and may include one or More than one processor 701 and memory 702, and one or more stored application programs or data may be stored in the memory 702.
  • the memory 702 may be short-term storage or persistent storage.
  • the application stored in the memory 702 may include one or more modules (not shown in the figure), and each module may include a series of computer-executable instructions in the electronic device.
  • the processor 701 may be configured to communicate with the memory 702 and execute a series of computer-executable instructions in the memory 702 on the electronic device.
  • the electronic device may further include one or more power supplies 703, one or more wired or wireless network interfaces 704, one or more input/output interfaces 705, one or more keyboards 706, and so on.
  • the electronic device includes a memory, a processor, and computer-executable instructions stored on the memory and executable on the processor, and the computer-executable instructions are executed by the processor
  • the following process is implemented: root node users and non-root node users are determined from the user queue, and empty group users include the root node users; according to the correlation of the empty group users, the single user signal drying ratio SUSINR and the number of empty splits, Estimate the capacity of the first cell; sort the non-root node users according to their relevance to the empty group users to generate a user matrix to be paired, and select a specific user from the user matrix to be paired; The capacity of the second cell after the specific user is compared with the capacity of the first cell, and it is determined whether to add the specific user to an empty group according to the comparison result.
  • the electronic device that executes the user grouping method provided in the embodiment of the present application determines the root node user and the non-root node user from the user queue.
  • the empty group user includes the root node user.
  • Correlation, single-user signal-to-dry ratio, SUSINR, and empty splitter number estimate the capacity of the first cell, sort the non-root node users according to the correlation with the empty group users to generate a user matrix to be paired Select a specific user in the user matrix to be paired, compare the capacity of the second cell after joining the specific user with the capacity of the first cell, and determine whether to add the specific user to an empty group according to the comparison result, which can improve
  • users with system capacity join the null group both the interference effect of correlation on the users in the null group is considered, and the improvement of the null group capacity by the user channel quality is also considered.
  • an embodiment of the present application further provides a computer-readable storage medium for storing computer-executable instructions, which are implemented when executed by a processor
  • the following process determine the root node user and non-root node user from the user queue, and the empty group users include the root node users; according to the correlation of the empty group users, the single user signal drying ratio SUSINR and the number of empty splits, estimate First cell capacity; sort the non-root node users according to their relevance to the empty group users to generate a user matrix to be paired, and select a specific user from the user matrix to be paired; the specific user will be added The capacity of the second cell after that is compared with the capacity of the first cell, and it is determined whether to add the specific user to an empty packet according to the comparison result.
  • the root node user and the non-root node user can be determined from the user queue.
  • the empty group users include the root node user.
  • the single-user signal-to-dry ratio SUSINR and the number of empty traffic splits estimate the capacity of the first cell, sort the non-root node users according to the correlation with the empty group users to generate a user matrix to be paired, Select a specific user in the user matrix, compare the capacity of the second cell after joining the specific user with the capacity of the first cell, and determine whether to add the specific user to an empty group according to the comparison result, which will increase the system capacity.
  • a user joins a null packet it not only considers the impact of correlation on the users in the null packet, but also considers the improvement of the capacity of the null packet by the user channel quality.
  • the computer-readable storage medium includes read-only memory (Read-Only Memory, ROM for short), random access memory (Random Access Memory, RAM for short), magnetic disk or optical disk, etc.
  • an embodiment of the present application further provides a computer program product, the computer program product includes a computer program stored on a computer-readable storage medium, the computer program includes program instructions, when the When the program instructions are executed by a computer, the computer is caused to execute the method in any of the above method embodiments.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Multimedia (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本申请实施例提供了一种用户分组的方法、装置和电子设备，方法包括：从用户队列中确定根节点用户和非根节点用户，空分组用户包括根节点用户，根据空分组用户的相关性、SUSINR和空分流数，预估第一小区容量，将非根节点用户按照与空分组用户的相关性进行排序以生成待配对用户矩阵，并从待配对用户矩阵中选择特定用户，将加入特定用户之后的第二小区容量与第一小区容量进行比较，根据比较结果确定是否将特定用户加入空分组。

Description

一种用户分组的方法、装置和电子设备
交叉引用
本发明要求在2018年12月28日提交至中国专利局、申请号为201811620016.7、发明名称为“一种用户分组的方法、装置和电子设备”的中国专利申请的优先权，该申请的全部内容通过引用结合在本发明中。
技术领域
本申请涉及通信技术领域，尤其涉及一种用户分组的方法、装置和电子设备。
背景技术
多用户多输入多输出(英文：Multi-User Multi-Input and Multi-Output，缩写：MU-MIMO)技术是目前提升系统容量最主要的技术手段，该技术是利用不同用户间的空间分割构成不同的信道，可以使得具有一定空间隔离的用户复用相同的物理资源，从而提高移动通信网络的容量，可以让小区中不同用户在相同的时频资源上进行调度。MU-MIMO技术一定程度上解放了有限的时频域资源，可以大幅提升系统容量。
MU-MIMO技术复用时频资源时引入了用户间干扰，相比于单用户多输入多输出(英文：Single-User Multi-Input and Multi-Output，缩写：SU-MIMO)用户单次可传输数据量下降；同时，正因为时频资源的复用，增加了系统内每个用户的调度机会。因此，有需要平衡两者的关系，提高系统容量。
公开于该背景技术部分的信息仅仅旨在增加对本发明的总体背景的理解，而不应当被视为承认或以任何形式暗示该信息构成已为本领域一般技术人员所公知的现有技术。
发明内容
第一方面，本申请实施例提供了一种用户分组的方法，包括：从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户；根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量；将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户；将加入 所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
第二方面，本申请实施例提供了一种用户分组的装置，包括：确定模块，用于从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户；计算模块，用于根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量；生成模块，用于将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户；分组模块，用于将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
第三方面，本申请实施例提供了一种电子设备，包括：存储器、处理器和存储在所述存储器上并可在所述处理器上运行的计算机可执行指令，所述计算机可执行指令被所述处理器执行时实现如上述第一方面所述的一种控制客户端流量的方法的步骤。
第四方面，本申请实施例提供了一种计算机可读存储介质，所述计算机可读存储介质用于存储计算机可执行指令，所述计算机可执行指令被处理器执行时实现如上述第一方面所述的一种控制客户端流量的方法的步骤。
第五方面，本申请实施例提供了一种计算机程序产品，所述计算机程序产品包括存储在计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令，当所述程序指令被计算机执行时，使所述计算机执行以上各个方面所述的方法。
附图说明
为了更清楚地说明本申请实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请中记载的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动性的前提下，还可以根据这些附图获得其他的附图。
图1示出本申请实施例提供的一种用户分组的方法的一种流程示意图；
图2示出本申请实施例提供的一种用户分组的方法的另一种流程示意 图；
图3示出本发明实施例提供的一种用户分组的装置的结构示意图；
图4示出执行本申请实施例提供的一种用户分组的方法的电子设备的硬件结构示意图。
具体实施方式
为了使本技术领域的人员更好地理解本申请中的技术方案，下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本申请一部分实施例，而不是全部的实施例。基于本申请中的实施例，本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例，都应当属于本申请保护的范围。
目前提高系统容量主要的策略一般分为以下两类：
第一类策略利用空间信息将用户进行分组，按照用户空间信息对用户进行分组分类。将不同分类的用户一起调度，期以最大程度上减少用户间干扰。
第二类策略通过遍历用户配对组合，评估不同组合预期流量，基于流量最大化原则选取配对组，尽可能使整个配对组流量最大。
第一类策略思路简单可以稳定提升小区流量，但是由于完全按照用户空间信息对用户进行分类，无法完全挖掘系统潜力。第二类策略增加了对配对组用户整体流量分析，但是由于遍历次数较多，预估方法可能较为复杂，计算复杂度很高，较为耗时。在测量准确，预估方法可靠的情况下，可以获得最大的系统容量。
因此，本申请的设计人认为切实可行的调度策略可以结合两者的思想，充分利用用户空间信息，结合预估计算，尽可能地挖掘系统潜力。
图1示出本申请实施例提供的一种用户分组的方法的一种流程示意图，该方法可以由电子设备执行，例如用户设备或基站设备。换言之，所述方法可以由安装在用户设备或基站设备的软件或硬件来执行。如图所示，该方法可以包括以下步骤。
S10：从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户。
从服务质量(英文：Quality of Service，缩写：Qos)模块获取待调度用户队列。QoS指网络能够利用各种基础技术，为指定的网络通信提供更好的服务能力，是网络的一种安全机制，是用来解决网络延迟和阻塞等问题的技 术。从用户队列中确定MU-MIMO的根节点用户，将所述根节点用户加入空分组，初始状态时空分组可以只有根节点用户一个用户。
S20：根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量。
S30：将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户。
S40：将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
当所述第二小区容量大于所述第一小区容量时，说明该特定用户的加入能够提高系统容量，因此，将所述特定用户加入所述空分组。
由此，本申请实施例提供的一种用户分组的方法，通过从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户，根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量，将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户，将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组，将能够提高系统容量的用户加入空分组，既考虑了相关性对空分组内用户带来的干扰影响，又考虑了用户信道质量对空分组容量的提升。
图2示出本申请实施例提供的一种用户分组的方法的另一种流程示意图，该方法可以由电子设备执行，例如用户设备或基站设备。换言之，所述方法可以由安装在用户设备或基站设备的软件或硬件来执行。如图所示，该方法可以包括以下步骤。
S10：从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户。
从服务质量(英文：Quality of Service，缩写：Qos)模块获取待调度用户队列。QoS指网络能够利用各种基础技术，为指定的网络通信提供更好的服务能力，是网络的一种安全机制，是用来解决网络延迟和阻塞等问题的技术。将所述根节点用户加入空分组，初始状态时空分组可以只有根节点用户一个用户。
在一种可能的实现方式中，本步骤可以具体包括步骤S11。
S11：将所述用户队列中的第一个用户确定为所述根节点用户，将所述 用户队列中的其他用户确定为所述非根节点用户。
S20：根据所述空分组用户的相关性、SUSINR和空分流数，预估第一小区容量。
在一种可能的实现方式中，本步骤可以具体包括步骤S21～S22。
S21：根据空分组用户之间的平均相关性，当前空分流数，查取空分组的干扰参数。
S22：根据所述干扰参数和各个所述空分组用户的SU SINR预估系统容量。
S30：将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户。
在一种可能的实现方式中，本步骤可以具体包括步骤S31～S33。
S31：将所述非根节点用户按照与所述空分组用户的相关性从低到高排序以生成待配对用户矩阵。
S32：对于相关性区间划分相同的所述非根节点用户，按照参考信号的信干燥比SRS-SINR从高到低排序以生成待配对用户矩阵。
S33：从所述待配对用户矩阵中选择左上角第一个用户作为所述特定用户。
S40：将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
在一种可能的实现方式中，本步骤可以具体包括步骤S41～S42。
S41：当所述第二小区容量大于所述第一小区容量时，将所述特定用户加入所述空分组。
此时，说明该特定用户的加入能够提高系统容量，因此，将所述特定用户加入所述空分组。
在一种可能的实现方式中，更新空分组用户，并返回执行步骤S21。
S42：当所述第二小区容量小于所述第一小区容量时，不将所述特定用户加入所述空分组，并结束所述用户分组的方法。
举例进行说明，假设现仅存在6UE在该系统内。
Qos模块输出用户顺序为UE1UE2UE3UE4UE5UE6。
用户SRS SINR(dB)依次为：[23,27,23,25,30,18]
用户间相关性如下：
  UE 1 UE 2 UE 3 UE 4 UE 5 UE 6
UE 1 1.00 0.17 0.08 0.07 0.45 0.15
UE 2 0.17 1.00 0.33 0.62 0.15 0.25
UE 3 0.08 0.33 1.00 0.43 0.12 0.41
UE 4 0.07 0.62 0.43 1.00 0.05 0.54
UE 5 0.45 0.15 0.12 0.05 1.00 0.21
UE 6 0.15 0.25 0.41 0.54 0.21 1.00
根据步骤S11，从Qos模块获取待调度用户队列，将第一个用户作为MU-MIMO的根节点用户，其余待调度用户作为非根节点参与后续配对流程。
UE 1作为空分配对根节点,UE 2-UE 6作为待配对用户。根据配对组内用户之间相关性、SRS SINR、总空分流数，预估小区容量，记做C group。
C group的计算流程：
1、根据根节点SU SINR查表获得当前空分组单流频谱效率SE layer_group；
SINR和空分组单流频谱效率需要通过实测或者仿真获取，下表仅供参考。
SINR(dB) SE
-3 0.2344
-1.5 0.3770
0.5 0.6016
1.5 0.8770
3 1.1758
4.5 1.4766
5.5 1.6953
6.5 1.9141
7 2.1602
8 2.4063
8.5 2.5703
10 2.7305
11 3.0293
12 3.3223
13 3.6094
13.5 3.9023
14.5 4.2129
15.5 4.5234
16.5 4.8164
17.5 5.1152
18.5 5.3320
19 5.5547
20 5.8906
21.5 6.2266
22 6.5703
23.5 6.9141
24 7.1602
26 7.4063
2、根据Layer group和SE layer_group计算空分组容量C group；
C group＝Layer group×SE layer_group×REnum
REnum是每一次调度可用的RE数，以100RB，sch有效符号数12计算，则 可以认为REnum＝14400。
Layer group是当前空分组的层数，只有根节点的情况下，按照SU层数计算。
根据步骤S31～S32，对于非根节点用户(配对用户)，按照该用户与空分组内用户相关性的最大值从低到高进行排序，以0.1为区间划分；对于相关性相同的按照SRS-SINR从高到低排序；输出待配对用户矩阵，配对优先级每一行递减；同一行内从左到右，优先级逐渐降低。
当前场景下初始相关性矩阵如下：
0.1 UE 3(32) UE 4(25)        
0.2 UE 2(27) UE 6(18)        
0.3            
0.4            
0.5 UE 5(30)          
0.6            
0.7            
0.8            
0.9            
1.0            
根据步骤S33，从待配对用户矩阵中选择左上角第一个用户尝试空分配对(UE 3)；根据步骤S40，根据新加入待配对用户的配对组内用户相关性、SU SINR、总空分流数，预估加入新的配对用户后小区容量，记做C group'；
C group'的计算流程：
1、计算空分组内用户SU SINR的线性平均值，记为SINR SU_group，单位dB；
2、根据空分组层数Layer group和空分组内各用户间最大相关性Cor group，查取空分组干扰参数I group，由于加入过程中是相关性优先加入，Cor group可以简化为当前 加入用户在待配对用户矩阵中行对应的相关性；
空分组干扰表格是根据实际测试数据总结，下表仅作参考。
  ... 4 ... 20 ... 24
0.1 ... 0.32 ... 1.92 ... 2.36
0.2 ... 0.6 ... 2.4 ... 2.85
0.3 ... 1.02 ... 2.97 ... 3.42
0.4 ... 1.57 ... 3.64 ... 4.08
0.5 ... 2.27 ... 4.42 ... 4.88
0.6 ... 3.16 ... 5.4 ... 5.85
0.7 ... 4.35 ... 6.64 ... 7.09
0.8 ... 6.07 ... 8.39 ... 8.84
0.9 ... 9.04 ... 11.41 ... 11.87
每一行代表不同的相关性，每一列对应的不同的空分组层数，表格中的值为干扰参数(dB)。
3、计算空分组平均调度SINR SINR sch_group，单位dB，如果空分组中仅有根节点用户则I group＝0；
SINR sch_group＝SINR SU_group-I group
4、根据SINR sch_group查表获得空分组单流频谱效率SE layer_group；
SINR sch_group和空分组单流频谱效率通过实测结果获取，下表仅供参考。
SINR(dB) SE
-3 0.2344
-1.5 0.3770
0.5 0.6016
1.5 0.8770
3 1.1758
4.5 1.4766
5.5 1.6953
6.5 1.9141
7 2.1602
8 2.4063
8.5 2.5703
10 2.7305
11 3.0293
12 3.3223
13 3.6094
13.5 3.9023
14.5 4.2129
15.5 4.5234
16.5 4.8164
17.5 5.1152
18.5 5.3320
19 5.5547
20 5.8906
21.5 6.2266
22 6.5703
23.5 6.9141
24 7.1602
26 7.4063
5、根据Layer group和SE layer_group计算空分组容量C group；
C group＝Layer group×SE layer_group×REnum
REnum是每一次调度可用的RE数，以100RB，sch有效符号数12计算，则可以认为REnum＝14400
对比C group和C group'决定是否将该用户加入空分组，以及判断是否结束配对流程。
具体地，根据步骤S41，如果C group'大于C group则认为新用户的加入将提升系统容量，则更新用户配对结果；重新计算待配对用户与空分用户之间相关性，按照步骤21的方法更新待配对用户矩阵，重复步骤30～40；
UE 3加入空分组后待配对用户矩阵计算结果：
UE2相关性min(0.17,0.33)SRS SINR 27dB
UE4相关性min(0.07,0.43)SRS SINR 25dB
UE5相关性min(0.45,0.12)SRS SINR 30dB
UE6相关性min(0.15,0.41)SRS SINR 18dB
0.1            
0.2            
0.3            
0.4 UE 2(27)          
0.5 UE 5(30) UE 4(25) UE 6(18)      
0.6            
0.7            
0.8            
0.9            
1.0            
根据步骤S42，如果C group'小于C group则认为新用户的加入会降低系统容量，并且待调度用户中不存在其他用户可以使系统容量提升，结束配对流程：结束当前配对流程，输出调度结果。
由此，本申请实施例提供的一种用户分组的方法，通过从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户，根据所述空分组用户的相关性、SUSINR和空分流数，预估第一小区容量，将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户，将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组，将能够提高系统容量的用户加入空分组，本发明实施例提供的用户矩阵维护的开销小，排序简单易行，本发明实施例既考虑了相关性对空分组内用户带来的干扰影响，又考虑了用户信道质量对空分组容量的提升，实时计算每加入一个配对用户对系统容量的贡献，当与根节点用户相关性最低的特定用户都不可以提升系统容量时结束用户分组，有效提高分组效率。
图3示出本发明实施例提供的一种用户分组的装置的结构示意图，该装置100包括：确定模块110、计算模块120、生成模块130和分组模块140。
确定模块110，用于从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户。计算模块120，用于根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量。生成模块130，用于将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户。分组模块140，用于将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
在一种可能的实现方式中，确定模块110具体用于将所述用户队列中的第一个用户确定为所述根节点用户，将所述用户队列中的其他用户确定为所述非根节点用户。
在一种可能的实现方式中，计算模块120具体用于根据空分组用户之间的 平均相关性，当前空分流数，查取空分组的干扰参数；根据所述干扰参数和各个所述空分组用户的SU SINR预估系统容量。
在一种可能的实现方式中，生成模块130用于将所述非根节点用户按照与所述空分组用户的相关性从低到高排序以生成待配对用户矩阵。
在一种可能的实现方式中，生成模块130用于对于相关性区间划分相同的所述非根节点用户，按照参考信号的信干燥比SRS-SINR从高到低排序以生成待配对用户矩阵。
在一种可能的实现方式中，生成模块130用于从所述待配对用户矩阵中选择左上角第一个用户作为所述特定用户。
在一种可能的实现方式中，分组模块140用于当所述第二小区容量大于所述第一小区容量时，将所述特定用户加入所述空分组。
在一种可能的实现方式中，分组模块140用于当所述第二小区容量小于所述第一小区容量时，不将所述特定用户加入所述空分组，并结束所述方法。
由此，本申请实施例提供的一种用户分组的装置，通过从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户，根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量，将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户，将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组，将能够提高系统容量的用户加入空分组，既考虑了相关性对空分组内用户带来的干扰影响，又考虑了用户信道质量对空分组容量的提升。
图4示出执行本申请实施例提供的一种用户分组的方法的电子设备的硬件结构示意图，如图所示，该电子设备可因配置或性能不同而产生比较大的差异，可以包括一个或一个以上的处理器701和存储器702，存储器702中可以存储有一个或一个以上存储应用程序或数据。其中，存储器702可以是短暂存储或持久存储。存储在存储器702的应用程序可以包括一个或一个以上模块(图示未示出)，每个模块可以包括对该电子设备中的一系列计算机可执行指令。更进一步地，处理器701可以设置为与存储器702通信，在该电子设备上执行存储器702中的一系列计算机可执行指令。该电子设备还可以包括一个或一个以上电源703，一个或一个以上有线或无线网络接口704，一个或一个以上输入输出接口705，一个或一个以上键盘706等。
在一个具体的实施例中，该电子设备包括存储器、处理器和存储在所述存储器上并可在所述处理器上运行的计算机可执行指令，所述计算机可执行指令被所述处理器执行时实现以下流程：从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户；根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量；将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户；将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
由此，执行本申请实施例提供的用户分组的方法的电子设备，通过从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户，根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量，将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户，将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组，将能够提高系统容量的用户加入空分组，既考虑了相关性对空分组内用户带来的干扰影响，又考虑了用户信道质量对空分组容量的提升。
在一示例性实施方式中，本申请实施例还提供了一种计算机可读存储介质，所述计算机可读存储介质用于存储计算机可执行指令，所述计算机可执行指令被处理器执行时实现以下流程：从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户；根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量；将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户；将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
由此，所述计算机可执行指令被处理器执行时能够通过从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户，根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量，将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户，将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组，将能够提高系统容量的用户加入空分组，既考虑了相 关性对空分组内用户带来的干扰影响，又考虑了用户信道质量对空分组容量的提升。
其中，所述的计算机可读存储介质包括只读存储器(Read-Only Memory，简称ROM)、随机存取存储器(Random Access Memory，简称RAM)、磁碟或者光盘等。
在一示例性实施方式中，本申请实施例还提供了一种计算机程序产品，所述计算机程序产品包括存储在计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令，当所述程序指令被计算机执行时，使所述计算机执行上述任意方法实施例中的方法。
本说明书中的各个实施例均采用递进的方式描述，各个实施例之间相同相似的部分互相参见即可，每个实施例重点说明的都是与其他实施例的不同之处。尤其，对于系统实施例而言，由于其基本相似于方法实施例，所以描述的比较简单，相关之处参见方法实施例的部分说明即可。
以上所述仅为本申请的实施例而已，并不用于限制本申请。对于本领域技术人员来说，本申请可以有各种更改和变化。凡在本申请的精神和原理之内所作的任何修改、等同替换、改进等，均应包含在本申请的权利要求范围之内。

Claims (18)

  1. 一种用户分组的方法，其中，包括：
    从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户；
    根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量；
    将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户；
    将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
  2. 根据权利要求1所述的方法，其中，所述从用户队列中确定根节点用户和非根节点用户包括：
    将所述用户队列中的第一个用户确定为所述根节点用户，将所述用户队列中的其他用户确定为所述非根节点用户。
  3. 根据权利要求1所述的方法，其中，根据所述空分组用户的相关性、SU SINR和空分流数，预估第一小区容量包括：
    根据空分组用户之间的平均相关性，当前空分流数，查取空分组的干扰参数；
    根据所述干扰参数和各个所述空分组用户的SU SINR预估系统容量。
  4. 根据权利要求1所述的方法，其中，将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵包括：
    将所述非根节点用户按照与所述空分组用户的相关性从低到高排序以生成待配对用户矩阵。
  5. 根据权利要求4所述的方法，其中，将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵包括：
    对于相关性区间划分相同的所述非根节点用户，按照参考信号的信干燥比SRS-SINR从高到低排序以生成待配对用户矩阵。
  6. 根据权利要求5所述的方法，其中，从所述待配对用户矩阵中选择特定用户，包括：
    从所述待配对用户矩阵中选择左上角第一个用户作为所述特定用户。
  7. 根据权利要求1所述的方法，其中，将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组，包括：
    当所述第二小区容量大于所述第一小区容量时，将所述特定用户加入所述空分组。
  8. 根据权利要求6所述的方法，其中，将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组，包括：
    当所述第二小区容量小于所述第一小区容量时，不将所述特定用户加入所述空分组，并结束所述用户分组的方法。
  9. 一种用户分组的装置，其中，包括：
    确定模块，用于从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户；
    计算模块，用于根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量；
    生成模块，用于将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户；
    分组模块，用于将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
  10. 根据权利要求9所述的装置，其中，所述确定模块用于将所述用户队列中的第一个用户确定为所述根节点用户，将所述用户队列中的其他用户确定为所述非根节点用户。
  11. 根据权利要求9所述的装置，其中，所述计算模块用于根据空分组用户之间的平均相关性，当前空分流数，查取空分组的干扰参数；根据所述干扰参数和各个所述空分组用户的SU SINR预估系统容量。
  12. 根据权利要求9所述的装置，其中，所述生成模块用于将所述非根节点用户按照与所述空分组用户的相关性从低到高排序以生成待配对用户矩阵。
  13. 根据权利要求12所述的装置，其中，所述生成模块用于对于相关性区间划分相同的所述非根节点用户，按照参考信号的信干燥比SRS-SINR从高到低排序以生成待配对用户矩阵。
  14. 根据权利要求13所述的装置，其中，所述生成模块用于从所述待配对用户矩阵中选择左上角第一个用户作为所述特定用户。
  15. 根据权利要求9所述的装置，其中，所述分组模块用于当所述第二小区容量大于所述第一小区容量时，将所述特定用户加入所述空分组。
  16. 根据权利要求14所述的装置，其中，所述分组模块用于当所述第二小区容量小于所述第一小区容量时，不将所述特定用户加入所述空分组，并结束所述方法。
  17. 一种电子设备，包括：
    处理器；以及
    被安排成存储计算机可执行指令的存储器，所述可执行指令在被执行时使用所述处理器执行以下操作：
    从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节点用户；
    根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量；
    将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户；
    将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
  18. 一种计算机可读介质，所述计算机可读介质存储一个或多个程序，所述一个或多个程序当被包括多个应用程序的电子设备执行时，使得所述电子设备执行以下操作：
    从用户队列中确定根节点用户和非根节点用户，空分组用户包括所述根节 点用户；
    根据所述空分组用户的相关性、单用户信干燥比SUSINR和空分流数，预估第一小区容量；
    将所述非根节点用户按照与所述空分组用户的相关性进行排序以生成待配对用户矩阵，并从所述待配对用户矩阵中选择特定用户；
    将加入所述特定用户之后的第二小区容量与所述第一小区容量进行比较，并根据比较结果确定是否将所述特定用户加入空分组。
PCT/CN2019/120383 2018-12-28 2019-11-22 一种用户分组的方法、装置和电子设备 WO2020134771A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811620016.7 2018-12-28
CN201811620016.7A CN111385001B (zh) 2018-12-28 2018-12-28 一种用户分组的方法、装置和电子设备

Publications (1)

Publication Number Publication Date
WO2020134771A1 true WO2020134771A1 (zh) 2020-07-02

Family

ID=71129664

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/120383 WO2020134771A1 (zh) 2018-12-28 2019-11-22 一种用户分组的方法、装置和电子设备

Country Status (2)

Country Link
CN (1) CN111385001B (zh)
WO (1) WO2020134771A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101667896A (zh) * 2009-09-18 2010-03-10 上海第二工业大学 基于码本的多用户mimo通信系统的用户选择方法
EP2288049A2 (en) * 2009-08-21 2011-02-23 Sony Corporation Method and device for user pairing for uplink multi-user MIMO under coordinated multiple point transmission scenario
CN102142880A (zh) * 2011-05-10 2011-08-03 广州大学 一种多输入-多输出多用户分集系统的用户快速调度方法
CN102932113A (zh) * 2011-08-12 2013-02-13 中国电信股份有限公司 上行多用户mimo 配对方法、装置和基站
CN105406905A (zh) * 2014-09-10 2016-03-16 中兴通讯股份有限公司 用户配对处理方法、装置及基站

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7782755B2 (en) * 2007-12-21 2010-08-24 Motorola, Inc. Method for uplink collaborative SDMA user pairing in WIMAX
US8644288B2 (en) * 2008-07-31 2014-02-04 Motorola Mobility Llc Uplink spatial division multiple access (SDMA) user pairing and scheduling
CN102316597B (zh) * 2010-06-30 2015-04-22 中兴通讯股份有限公司 Mimo系统中的资源调度方法和装置
CN105611640B (zh) * 2015-10-30 2019-01-15 哈尔滨工程大学 一种公平度可调的CoMP下行用户调度方法
CN107846266B (zh) * 2016-09-18 2022-03-04 中兴通讯股份有限公司 时频资源空分调度方法和装置
US20180176743A1 (en) * 2016-12-15 2018-06-21 Qualcomm Incorporated Phased determination of channel-correlation-based grouping metrics for multi-user transmissions

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2288049A2 (en) * 2009-08-21 2011-02-23 Sony Corporation Method and device for user pairing for uplink multi-user MIMO under coordinated multiple point transmission scenario
CN101667896A (zh) * 2009-09-18 2010-03-10 上海第二工业大学 基于码本的多用户mimo通信系统的用户选择方法
CN102142880A (zh) * 2011-05-10 2011-08-03 广州大学 一种多输入-多输出多用户分集系统的用户快速调度方法
CN102932113A (zh) * 2011-08-12 2013-02-13 中国电信股份有限公司 上行多用户mimo 配对方法、装置和基站
CN105406905A (zh) * 2014-09-10 2016-03-16 中兴通讯股份有限公司 用户配对处理方法、装置及基站

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
MOTOROLA: "Spatial Correlation Feedback to Support LTE-A MU-MIMO and CoMP: System Operation and Performance Results", 3GPP TSG-RAN WG1 #57 R1-092221, 8 May 2019 (2019-05-08), XP050339645, DOI: 20200217173207A *

Also Published As

Publication number Publication date
CN111385001B (zh) 2022-09-30
CN111385001A (zh) 2020-07-07

Similar Documents

Publication Publication Date Title
Wu et al. Distributed channel selection in time-varying radio environment: Interference mitigation game with uncoupled stochastic learning
Wang et al. Dynamic load balancing and throughput optimization in 3gpp lte networks
US9723572B2 (en) Systems and methods for uplink power control and scheduling in a wireless network
Corroy et al. Cell association in small heterogeneous networks: Downlink sum rate and min rate maximization
JP6438597B2 (ja) アダプティヴダウンリンクＣｏＭＰ伝送方法及び装置
EP3297180A1 (en) Coordinated beamforming method and device
Tembine et al. Joint power control-allocation for green cognitive wireless networks using mean field theory
Guo et al. QoS-aware user grouping strategy for downlink multi-cell NOMA systems
Leng et al. Client scheduling in wireless federated learning based on channel and learning qualities
CN102300326B (zh) 多用户多输入多输出mimo通信系统的调度方法和基站
Ghalut et al. QoE-aware optimization of video stream downlink scheduling over LTE networks using RNNs and genetic algorithm
Huang et al. Stable multiuser channel allocations in opportunistic spectrum access
Mashdour et al. Clustering and Scheduling With Fairness Based On Information Rates for Cell-Free MIMO Networks
Li et al. QoS and channel state aware load balancing in 3GPP LTE multi-cell networks
Meng et al. Multi-user grouping based scheduling algorithm in massive MIMO uplink networks
WO2020134771A1 (zh) 一种用户分组的方法、装置和电子设备
Zhang et al. Cooperative spectrum allocation with QoS support in cognitive cooperative vehicular ad hoc networks
Menon et al. Interference avoidance in networks with distributed receivers
WO2022042119A1 (zh) Srs时域资源的动态选择方法和装置、存储介质及电子装置
Srinivasan et al. Maximizing throughput in MIMO networks with variable rate streams
CN103813343A (zh) 分配成员载波的方法及装置
KR20130120802A (ko) 다중 사용자 ｍｉｍｏ 통신 시스템에서의 사용자 스케쥴링 방법 및 장치
Valkova-Jarvis et al. Novel throughput quantile averaging methods for the proportional fair algorithm in indoor mobile networks
CN105101265B (zh) 一种用于解决小区服务中断的协作补偿服务方法
Lam et al. Performance of soft frequency reuse in random cellular networks in Rayleigh-Lognormal fading channels

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19905744

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 15/11/2021)

122 Ep: pct application non-entry in european phase

Ref document number: 19905744

Country of ref document: EP

Kind code of ref document: A1