CN109728891B - Cluster-based User Pairing Method in MU-MIMO System - Google Patents

Cluster-based User Pairing Method in MU-MIMO System Download PDF

Info

Publication number
CN109728891B
CN109728891B CN201811600741.8A CN201811600741A CN109728891B CN 109728891 B CN109728891 B CN 109728891B CN 201811600741 A CN201811600741 A CN 201811600741A CN 109728891 B CN109728891 B CN 109728891B
Authority
CN
China
Prior art keywords
user
resource block
class
users
group
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN201811600741.8A
Other languages
Chinese (zh)
Other versions
CN109728891A (en
Inventor
卢小峰
赵丹萍
樊思涵
刘欢
郭惠
范宁
杨鲲
张海林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
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 Xidian University filed Critical Xidian University
Priority to CN201811600741.8A priority Critical patent/CN109728891B/en
Publication of CN109728891A publication Critical patent/CN109728891A/en
Application granted granted Critical
Publication of CN109728891B publication Critical patent/CN109728891B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

本发明公开了一种MU‑MIMO系统中基于聚类的用户配对方法,主要解决现有技术频谱利用率低及求解复杂度高的问题。其技术方案是:1.利用分拆法生成资源块分拆完备集;2.在每个资源块分拆集中,确定好类的个数和中心;3.初始化各个类中的用户组和资源块组;4.在各个类中不断执行用户移出操作和用户加入操作,直到所有用户都被分到类中,完成用户配对过程。本发明在考虑系统误比特率约束的基础上,在接收端采用最小均方误差‑基于排序的连续干扰消除MMSE‑OSIC技术,不仅能高效地进行动态的多用户配对,而且能在满足系统通信质量要求的情况下,最大化通信系统的频谱利用率。可用于对MU‑MIMO系统中的手机用户进行配对。

Figure 201811600741

The invention discloses a clustering-based user pairing method in a MU-MIMO system, which mainly solves the problems of low spectrum utilization and high solution complexity in the prior art. The technical solution is: 1. Use the split method to generate a complete set of resource block splitting; 2. Determine the number and center of classes in each resource block split set; 3. Initialize user groups and resources in each class Block group; 4. Continuously perform user removal operations and user join operations in each class until all users are classified into classes, and the user pairing process is completed. On the basis of considering the system bit error rate constraint, the invention adopts the minimum mean square error-sort-based continuous interference cancellation MMSE-OSIC technology at the receiving end, which can not only efficiently perform dynamic multi-user pairing, but also meet the system communication requirements. In the case of quality requirements, maximize the spectrum utilization of the communication system. Can be used to pair mobile phone users in MU‑MIMO systems.

Figure 201811600741

Description

MU-MIMO系统中基于聚类的用户配对方法Cluster-based User Pairing Method in MU-MIMO System

技术领域technical field

本发明属于通信技术领域,特别涉及一种基于聚类的用户配对方法,可用于多用户-多输入多输出-单载波-频分多址MU-MIMO-SC-FDMA系统。The invention belongs to the field of communication technology, and in particular relates to a clustering-based user pairing method, which can be used in a multi-user-multiple-input multiple-output-single-carrier-frequency division multiple access MU-MIMO-SC-FDMA system.

背景技术Background technique

在如今的4G移动通信系统和即将到来的5G移动通信系统中,多用户-多输入多输出MU-MIMO技术占有很重要的地位。MU-MIMO技术通过合理的用户配对准则,在发射端将多个只有1根天线的用户组合成一个用户配对,将该用户配对虚拟的看作一个配有多根天线的实体终端,将该实体终端与接收端基站侧装配的多个天线共同形成MU-MIMO阵列,从而显著提高系统频谱效率。在MU-MIMO系统中,最关键的研究问题就是选择合适的用户配对方法,衡量一个用户配对方法的优劣主要是看系统的频谱利用率这一指标。In today's 4G mobile communication system and the upcoming 5G mobile communication system, the multi-user-multiple-input multiple-output MU-MIMO technology occupies a very important position. MU-MIMO technology combines multiple users with only one antenna into one user pairing at the transmitting end through reasonable user pairing criteria, and the user pairing is regarded as a physical terminal with multiple antennas. The multiple antennas installed on the base station side of the terminal and the receiving end together form a MU-MIMO array, thereby significantly improving the spectral efficiency of the system. In the MU-MIMO system, the most critical research problem is to choose an appropriate user pairing method. To measure the pros and cons of a user pairing method, it mainly depends on the spectral utilization ratio of the system.

目前经典的用户配对算法有:随机配对准则、正交用户配对算法、行列式配对准则、正交缺陷度配对准则。这些基本的用户配对算法,尽管可以在一定程度上保证各用户之间干扰尽可能小,但是没有很明显的提升系统的频谱利用率。At present, the classical user pairing algorithms include: random pairing criterion, orthogonal user pairing algorithm, determinant pairing criterion, and orthogonal defect degree pairing criterion. Although these basic user pairing algorithms can ensure that the interference between users is as small as possible to a certain extent, they do not significantly improve the spectrum utilization of the system.

Xiaofeng Lu等人在其发表的论文“Dynamic User Grouping and JointResource Allocation With Multi-Cell Cooperation for Uplink Virtual MIMOSystems”(IEEE Transactions on Wireless Communications,vol.16,no.6,pp.3854-3869,Jun 2017.)中,针对MU-MIMO系统中的用户配对问题,提出了一种迭代匈牙利方法。该方法的具体步骤是:先将用户分组,生成完备的用户分组集合;再将资源块分组,生成完备的资源块分组集合;最后使用迭代匈牙利算法,得到最优的用户分组和资源块分组之间的组合情况和系统吞吐量。该方法存在的不足之处是,复杂度较高,且实现的频谱效率也较低。Xiaofeng Lu et al. published the paper "Dynamic User Grouping and JointResource Allocation With Multi-Cell Cooperation for Uplink Virtual MIMOSystems" (IEEE Transactions on Wireless Communications, vol.16, no.6, pp.3854-3869, Jun 2017. ), an iterative Hungarian method is proposed for the user pairing problem in MU-MIMO systems. The specific steps of the method are: firstly grouping users to generate a complete set of user groups; then grouping resource blocks to generate a complete set of resource block groups; finally using the iterative Hungarian algorithm to obtain the optimal combination of user grouping and resource block grouping the combination of situations and system throughput. The disadvantage of this method is that the complexity is high and the spectral efficiency achieved is also low.

发明内容SUMMARY OF THE INVENTION

本发明的目的在于针对上述现有技术的不足,提出一种MU-MIMO系统中基于聚类的用户配对方法,以降低复杂度,且提升系统的频谱利用率。The purpose of the present invention is to propose a clustering-based user pairing method in a MU-MIMO system to reduce the complexity and improve the spectrum utilization rate of the system in view of the above-mentioned shortcomings of the prior art.

为实现上述目的,本技术方案包括如下:To achieve the above purpose, the technical solution includes the following:

(1)生成资源块分拆完备集:(1) Generate a complete set of resource block splitting:

利用分拆法对系统中所有的资源块进行拆分,生成资源块分拆完备集,该资源块分拆完备集包含多个资源块分拆集,每种资源块分拆集中包含多个资源块组;Use the splitting method to split all resource blocks in the system to generate a complete set of resource block splitting, the complete set of resource block splitting includes multiple resource block splitting sets, and each resource block splitting set contains multiple resources block group;

(2)生成聚类个数并初始化每个类中的资源块组和用户:(2) Generate the number of clusters and initialize the resource block groups and users in each class:

将每个资源块分拆集中资源块组的个数定义为类的个数K,将K个类中资源块组依次定义为T1,…,Tm,…,TK,将每个资源块分拆集中资源块组依次放入T1,…,Tm,…,TK中,将K个类中用户组依次定义为Ω1,…,Ωm,…,ΩK,定义用户总个数为L,从L个用户中依次选取K个用户放入Ω1,…,Ωm,…,ΩK中;The number of resource block groups in each resource block split set is defined as the number of classes K, and the resource block groups in the K classes are defined as T 1 ,...,T m ,...,T K , and each resource block group is defined as T 1 ,...,T m ,...,T K The resource block groups in the block splitting set are placed in T 1 ,…,T m ,…,TK in turn, and the user groups in the K classes are defined as Ω 1 ,…,Ω m ,…,Ω K in turn, and the total user group is defined as Ω 1 ,…,Ω m ,…,Ω K . The number is L, and K users are sequentially selected from L users and put into Ω 1 ,…,Ω m ,…,Ω K ;

(3)根据最小均方误差-基于排序的连续干扰消除MMSE-OSIC检测方法和误比特率约束的自适应调制方法,计算每个类的中心Z1,…,Zm,…,ZK(3) Calculate the center Z 1 ,...,Z m ,...,Z K of each class according to the minimum mean square error-sort-based continuous interference cancellation MMSE-OSIC detection method and the bit error rate-constrained adaptive modulation method;

(4)执行用户移出操作:(4) Execute the user removal operation:

(4a)设定每次从一个类中移出的用户个数为η;(4a) set the number of users to be removed from a class to be n each time;

(4b)从未被选取的类中选取一个类,判断该类中用户的个数是否大于η,若是,则执行(4c),否则,执行(4e);(4b) select a class from the unselected classes, judge whether the number of users in this class is greater than n, if so, execute (4c), otherwise, execute (4e);

(4c)将第m个类中用户组Ωm中用户u占用资源块组Tm的传输效率定义为

Figure BDA0001922424800000023
计算该类中每个用户到该聚类中心的距离为
Figure BDA0001922424800000021
然后将到中心距离最小的用户移出该类,并根据(3)更新每个类的中心Z1,…,Zm,…,ZK;(4c) Define the transmission efficiency of the resource block group T m occupied by user u in the user group Ω m in the mth class as
Figure BDA0001922424800000023
Calculate the distance of each user in this class to the cluster center as
Figure BDA0001922424800000021
Then move the user with the smallest distance to the center out of the class, and update the center Z 1 ,…,Z m ,…,Z K of each class according to (3);

(4d)重复(4c),直到η个用户被移出该类;(4d) Repeat (4c) until n users are removed from the class;

(4e)重复(4b)-(4d),直到K个类都被选取;(4e) Repeat (4b)-(4d) until all K classes are selected;

(5)执行用户添加操作:(5) Execute user add operation:

(5a)设定每次向类中添加的用户个数为λ;(5a) Set the number of users added to the class as λ each time;

(5b)从待添加的用户中选取一个用户,计算该用户到所有聚类中心的距离为

Figure BDA0001922424800000022
并将该用户加到与其距离最小的聚类中心对应的类中;(5b) Select a user from the users to be added, and calculate the distance from the user to all cluster centers as
Figure BDA0001922424800000022
And add the user to the class corresponding to the cluster center with the smallest distance;

(5c)重复(5b),直到λ个用户都被添加到类中;(5c) Repeat (5b) until λ users are added to the class;

(5d)根据(3)更新每个类的中心Z1,…,Zm,…,ZK(5d) update the centers Z 1 ,...,Z m ,...,Z K of each class according to (3);

(6)重复(4)和(5),直到所有L个用户都被分配到类中,完成用户配对过程。(6) Repeat (4) and (5) until all L users are assigned to the class, completing the user pairing process.

本发明与现有技术相比具有以下优点:Compared with the prior art, the present invention has the following advantages:

第一,由于本发明采用在给定系统误比特率门限的情况下,根据信道状态动态地进行多小区用户配对和资源分配的方法,克服了现有技术在资源分配过程中不能保证系统通信质量的问题,使得本发明能在最大化系统的频率利用率的同时,保证系统的误比特率在门限值之下,进而提高了系统通信质量;First, because the present invention adopts the method of dynamically performing multi-cell user pairing and resource allocation according to the channel state under the condition of a given system bit error rate threshold, it overcomes the inability of the prior art to guarantee the system communication quality during the resource allocation process. Therefore, the present invention can ensure that the bit error rate of the system is below the threshold value while maximizing the frequency utilization rate of the system, thereby improving the communication quality of the system;

第二,由于本发明采用一种基于最小均方误差-排序串行干扰消除MMSE-OSIC技术的用户聚类算法,将联合用户配对和资源分配的大问题分解成若干个规模很小的子问题来并行求解,极大地减小了求解该问题的搜索空间,克服了现有技术不能充分利用频谱和求解复杂度高的问题,使得本发明在降低复杂度的同时,提高了频谱效率。Second, since the present invention adopts a user clustering algorithm based on the minimum mean square error-sorted serial interference elimination MMSE-OSIC technology, the large problem of joint user pairing and resource allocation is decomposed into several small-scale sub-problems It can be solved in parallel, which greatly reduces the search space for solving the problem, overcomes the problems that the existing technology cannot make full use of the frequency spectrum and has high solving complexity, so that the present invention improves the spectral efficiency while reducing the complexity.

附图说明Description of drawings

图1是本发明的实现流程图;Fig. 1 is the realization flow chart of the present invention;

图2是本发明方法与现有方法复杂度仿真结果;Fig. 2 is the simulation result of the complexity of the method of the present invention and the existing method;

图3是本发明方法与现有方法频谱效率仿真结果。FIG. 3 is the simulation result of the spectral efficiency of the method of the present invention and the existing method.

具体实施方式Detailed ways

以下结合附图对本发明作进一步详细描述。The present invention will be described in further detail below with reference to the accompanying drawings.

参照图1,本发明的实现步骤如下:1, the implementation steps of the present invention are as follows:

步骤1,生成资源块分拆完备集。Step 1: Generate a complete set of resource block splitting.

设定多用户-多输入多输出-单载波-频分多址MU-MIMO-SC-FDMA系统中资源块的个数为n,利用分拆法对资源块进行拆分,生成资源块分拆完备集,具体步骤如下:Set the number of resource blocks in the multi-user-multiple-input multiple-output-single-carrier-frequency division multiple access MU-MIMO-SC-FDMA system to n, and use the splitting method to split the resource blocks to generate resource block splitting Complete set, the specific steps are as follows:

(1a)将MU-MIMO-SC-FDMA系统中所有连续的资源块表示成{B1,B2,…,Bi,Bi+1,…,Bn}序列,其中,Bi表示第i个资源块,i是从1到n,n表示资源块的总数;(1a) Represent all consecutive resource blocks in the MU-MIMO-SC-FDMA system as a sequence of {B 1 ,B 2 ,...,B i ,B i+1 ,...,B n }, where B i represents the first i resource blocks, i is from 1 to n, n represents the total number of resource blocks;

(1b)用n-1个横线对资源块序列进行分隔,得到分隔后的资源块序列{B1,_,B2,_,…,Bi,_,Bi+1,…,_,Bn};(1b) Use n-1 horizontal lines to separate the resource block sequence to obtain the separated resource block sequence {B 1 ,_,B 2 ,_,…,B i ,_,B i+1 ,…,_ ,B n };

(1c)在n-1个横线上随机插入数字0或数字1,即将十进制数1至2n-1均转换成长度为n-1的二进制序列,将2n-1种二进制序列依次插入n-1个横线上,得到2n-1种资源块分拆集;(1c) Randomly insert a number 0 or a number 1 on the n-1 horizontal lines, that is, convert the decimal numbers 1 to 2n-1 into a binary sequence of length n-1, and insert 2n-1 kinds of binary sequences in turn n-1 horizontal lines, 2 n-1 resource block split sets are obtained;

(1d)在每种资源块分拆集中,判断Bi和Bi+1之间的横线上插入的数字是0,还是1:若是数字0,则用Bi和Bi+1组成一个资源块组;(1d) In each resource block split set, determine whether the number inserted on the horizontal line between B i and B i+1 is 0 or 1: if the number is 0, use B i and B i+1 to form a resource block group;

若是数字1,则用Bi和Bi+1组成两个不同的资源块组;If the number is 1, use B i and B i+1 to form two different resource block groups;

(1e)将2n-1种资源块分拆集组成一个集合,生成资源块分拆完备集。(1e) 2 n-1 resource block split sets are formed into a set, and a complete set of resource block split is generated.

步骤2,生成聚类个数并初始化每个类中的资源块组和用户组。Step 2, generate the number of clusters and initialize the resource block group and user group in each class.

(2a)从资源块分拆完备集中选取一个资源块分拆集,将该资源块分拆集中资源块组的个数定义为类的个数K;(2a) Select a resource block split set from the resource block split complete set, and define the number of resource block groups in the resource block split set as the number K of classes;

(2b)将K个类中资源块组依次定义为T1,…,Tm,…,TK,m是从1到K,将资源块分拆集中资源块组依次放入T1,…,Tm,…,TK中;(2b) Defining resource block groups in K classes as T 1 ,...,T m ,...,T K , m is from 1 to K, and put the resource block groups in the resource block splitting set into T 1 ,... ,T m ,…,T K in;

(2c)将K个类中用户组依次定义为Ω1,…,Ωm,…,ΩK,定义用户总个数为L,从L个用户中依次选取K个用户放入Ω1,…,Ωm,…,ΩK中。(2c) Define the user groups in the K classes as Ω 1 ,…,Ω m ,…,Ω K in turn, define the total number of users as L, and select K users from the L users into Ω 1 ,… ,Ω m ,…,Ω K.

步骤3,计算每个类的中心:Step 3, calculate the center of each class:

根据现有最小均方误差-基于排序的连续干扰消除MMSE-OSIC检测方法和误比特率约束的自适应调制方法,计算每个类的中心Z1,…,Zm,…,ZK,具体步骤如下:According to the existing minimum mean square error-ranking-based continuous interference cancellation MMSE-OSIC detection method and bit error rate constrained adaptive modulation method, the center Z 1 ,…,Z m ,…,Z K of each class is calculated, specifically Proceed as follows:

(3a)计算第m个用户组Ωm中用户u占用第e个子载波的信干噪比为:(3a) Calculate the signal-to-interference-noise ratio of user u occupying the e-th subcarrier in the m-th user group Ω m as:

Figure BDA0001922424800000041
Figure BDA0001922424800000041

其中,e是从1到|Tm|,|Tm|是资源块组Tm中子载波的数目,u是从1到|Ωm|,|Ωm|是用户组Ωm中用户的数目,

Figure BDA0001922424800000042
是用户组Ωm中用户u在第e个子载波上的检测矢量,
Figure BDA0001922424800000043
是用户组Ωm和第e个子载波之间信道矩阵的第u列对应的矢量,σ2是高斯噪声方差;where e is from 1 to |T m |, |T m | is the number of subcarriers in resource block group T m , u is from 1 to |Ω m |, |Ω m | number,
Figure BDA0001922424800000042
is the detection vector of user u on the e-th subcarrier in the user group Ω m ,
Figure BDA0001922424800000043
is the vector corresponding to the u-th column of the channel matrix between the user group Ω m and the e-th subcarrier, and σ 2 is the Gaussian noise variance;

(3b)计算第m个用户组Ωm中用户u占用第e个子载波的传输效率为:(3b) Calculate the transmission efficiency of user u occupying the e-th subcarrier in the m-th user group Ω m as:

Figure BDA0001922424800000044
Figure BDA0001922424800000044

其中,

Figure BDA0001922424800000045
是向下取舍操作,BERtar是信号传输的BER约束的上限;in,
Figure BDA0001922424800000045
is the round-down operation, and BER tar is the upper limit of the BER constraint for signal transmission;

(3c)计算第m个用户组Ωm中用户u占用资源块组Tm的传输效率为:(3c) Calculate the transmission efficiency of the resource block group T m occupied by user u in the mth user group Ω m as:

Figure BDA0001922424800000046
Figure BDA0001922424800000046

(3d)计算第m个用户组Ωm占用资源块组Tm的传输效率为:(3d) Calculate the transmission efficiency of the resource block group T m occupied by the mth user group Ω m as:

Figure BDA0001922424800000051
Figure BDA0001922424800000051

(3e)计算第m个类的中心为:(3e) Calculate the center of the mth class as:

Zm=RmZ m =R m .

步骤4,执行用户移出操作:Step 4, perform the user move out operation:

(4a)设定每次从一个类中移出的用户个数为η;(4a) set the number of users to be removed from a class to be n each time;

(4b)从未被选取的类中选取一个类,判断该类中用户的个数是否大于η,若是,则执行(4c),否则,执行(4e);(4b) select a class from the unselected classes, judge whether the number of users in this class is greater than n, if so, execute (4c), otherwise, execute (4e);

(4c)将第m个类中用户组Ωm中用户u占用资源块组Tm的传输效率定义为

Figure BDA0001922424800000052
计算该类中每个用户到该聚类中心的距离为
Figure BDA0001922424800000053
然后将到中心距离最小的用户移出该类,并根据(3)更新每个类的中心Z1,…,Zm,…,ZK;(4c) Define the transmission efficiency of the resource block group T m occupied by user u in the user group Ω m in the mth class as
Figure BDA0001922424800000052
Calculate the distance of each user in this class to the cluster center as
Figure BDA0001922424800000053
Then move the user with the smallest distance to the center out of the class, and update the center Z 1 ,…,Z m ,…,Z K of each class according to (3);

(4d)重复(4c),直到η个用户被移出该类;(4d) Repeat (4c) until n users are removed from the class;

(4e)重复(4b)-(4d),直到K个类都被选取。(4e) Repeat (4b)-(4d) until all K classes are selected.

步骤5,执行用户添加操作:Step 5, perform user add operation:

(5a)设定每次向类中添加的用户个数为λ;(5a) Set the number of users added to the class as λ each time;

(5b)从待添加的用户中选取一个用户,计算该用户到所有聚类中心的距离为

Figure BDA0001922424800000054
具体步骤如下:(5b) Select a user from the users to be added, and calculate the distance from the user to all cluster centers as
Figure BDA0001922424800000054
Specific steps are as follows:

(5b1)从待添加的用户中选取一个用户,加入到第m个类后,得到用户组为

Figure BDA0001922424800000055
(5b1) Select a user from the users to be added and add it to the mth class to obtain the user group as
Figure BDA0001922424800000055

(5b2)计算第m个用户组

Figure BDA0001922424800000056
中用户d占用第e个子载波的传输效率为:(5b2) Calculate the mth user group
Figure BDA0001922424800000056
The transmission efficiency of user d occupying the e-th subcarrier is:

Figure BDA0001922424800000057
Figure BDA0001922424800000057

其中,

Figure BDA0001922424800000058
是向下取舍操作,d是从1到
Figure BDA0001922424800000059
Figure BDA00019224248000000510
是用户组
Figure BDA00019224248000000511
中用户的数目,SINR(d)e,m+是用户组
Figure BDA00019224248000000512
中用户d占用第e个子载波的信干噪比,BERtar是信号传输的BER约束的上限;in,
Figure BDA0001922424800000058
is the round-down operation, and d is from 1 to
Figure BDA0001922424800000059
Figure BDA00019224248000000510
is a user group
Figure BDA00019224248000000511
The number of users in SINR(d) e,m+ is the user group
Figure BDA00019224248000000512
where user d occupies the signal-to-interference and noise ratio of the e-th subcarrier, and BER tar is the upper limit of the BER constraint for signal transmission;

(5b3)计算第m个用户组

Figure BDA00019224248000000513
中用户d占用资源块组Tm的传输效率为:(5b3) Calculate the mth user group
Figure BDA00019224248000000513
The transmission efficiency of the resource block group T m occupied by user d is:

Figure BDA00019224248000000514
Figure BDA00019224248000000514

其中,

Figure BDA0001922424800000061
是用户组
Figure BDA0001922424800000062
中用户d占用第e个子载波的传输效率;in,
Figure BDA0001922424800000061
is a user group
Figure BDA0001922424800000062
The transmission efficiency of user d occupying the e-th subcarrier;

(5b4)计算第m个用户组

Figure BDA0001922424800000063
占用资源块组Tm的传输效率为:(5b4) Calculate the mth user group
Figure BDA0001922424800000063
The transmission efficiency of the occupied resource block group T m is:

Figure BDA0001922424800000064
Figure BDA0001922424800000064

(5b5)计算选取的用户到第m个聚类中心的距离为:(5b5) Calculate the distance from the selected user to the mth cluster center as:

Figure BDA0001922424800000065
Figure BDA0001922424800000065

其中,Zm是第m个类的中心。where Z m is the center of the mth class.

(5c)将用户加到与其距离最小的聚类中心对应的类中;(5c) adding the user to the class corresponding to the cluster center with the smallest distance from it;

(5d)重复(5b)-(5c),直到λ个用户都被添加到类中;(5d) Repeat (5b)-(5c) until λ users are added to the class;

(5e)根据(3)更新每个类的中心Z1,…,Zm,…,ZK(5e) Update the centers Z 1 ,…,Z m ,…,Z K of each class according to (3).

步骤6,完成用户配对过程:Step 6, complete the user pairing process:

重复(4)和(5),直到所有L个用户都被分配到类中,完成用户配对过程。Repeat (4) and (5) until all L users are assigned to the class, completing the user pairing process.

本发明的效果可通过仿真进一步的说明The effect of the present invention can be further explained by simulation

1.仿真条件:1. Simulation conditions:

本发明的仿真在单个基站的无线通信场景中进行,资源块个数为6,系统误比特率的门限值为10-5,且本发明仿真实验设定信号接收机的检测方式为最小均方误差-基于排序的连续干扰消除MMSE-OSIC检测,并假设在单个时隙内信道矩阵是不变的。将现有的用户配对技术和本发明的方法在复杂度和系统频谱效率这两个方面的性能进行对比。The simulation of the present invention is carried out in the wireless communication scenario of a single base station, the number of resource blocks is 6, the threshold value of the system bit error rate is 10 -5 , and the detection mode of the signal receiver is set as the minimum average value in the simulation experiment of the present invention. Square Error-Sequential Interference Cancellation MMSE-OSIC detection based on ordering and assumes that the channel matrix is invariant within a single slot. The performance of the existing user pairing technology and the method of the present invention in terms of complexity and system spectral efficiency are compared.

2.仿真内容与结果分析2. Simulation content and result analysis

仿真1,按照上述仿真条件,对本发明方法与现有方法的复杂度进行仿真,结果如图2。从图2可见,当用户数目是10,20,30,40时,本发明方法有较低的运算复杂度。Simulation 1: According to the above simulation conditions, the complexity of the method of the present invention and the existing method is simulated, and the result is shown in FIG. 2 . It can be seen from FIG. 2 that when the number of users is 10, 20, 30, and 40, the method of the present invention has lower computational complexity.

仿真2,按照上述的仿真条件,对本发明方法与现有方法的频谱效率进行仿真,结果如图3。Simulation 2: According to the above simulation conditions, the spectrum efficiency of the method of the present invention and the existing method is simulated, and the result is shown in FIG. 3 .

从图3中可以看到,随着信噪比的不断增长本发明方法和现有方法的频谱效率都在上升,但是本发明方法的频谱效率曲线的斜率明显大于现有方法曲线的斜率,并且无论是在信噪比的高低,本发明方法的性能曲线一直在现有方法之上。因此所提用户配对方法可以充分地利用系统内的频谱资源,提高频谱效率。It can be seen from FIG. 3 that the spectral efficiency of the method of the present invention and the existing method are both rising with the continuous increase of the signal-to-noise ratio, but the slope of the spectral efficiency curve of the method of the present invention is significantly larger than the slope of the curve of the existing method, and Regardless of the level of signal-to-noise ratio, the performance curve of the method of the present invention is always above the existing method. Therefore, the proposed user pairing method can fully utilize the spectrum resources in the system and improve the spectrum efficiency.

Claims (3)

1. A user pairing method based on clustering in an MU-MIMO system is characterized by comprising the following steps:
(1) generating a complete split set of resource blocks:
splitting all resource blocks in the system by using a splitting method to generate a complete splitting set of the resource blocks, wherein the method is realized as follows:
(1a) all consecutive resource blocks in a MU-MIMO-SC-FDMA system are denoted as { B }1,B2,···,Bi,Bi+1,···,BnSequence of which B isiRepresents the ith resource block, and n represents the total number of resource blocks;
(1b) the resource block sequence is separated by n-1 transverse lines to obtain a separated resource block sequence { B1,_,B2,_,···,Bi,_,Bi+1,···,_,Bn};
(1c) Randomly inserting digit 0 or digit 1 on n-1 horizontal lines, i.e. decimal numbers 1-2n-1Are all converted into binary sequences of length n-1, 2n-1The binary sequence is inserted into n-1 horizontal lines in sequence to obtain 2n-1Splitting and collecting the seed resource blocks;
(1d) in each resource block split set, judge BiAnd Bi+1The number inserted on the horizontal line between them is 0 or 1, and if it is 0, BiAnd Bi+1Form a resource block group, if the number is 1, BiAnd Bi+1Forming two different resource block groups;
(1e) will 2n-1The seed resource block split sets form a set, and a complete resource block split set is generated;
the resource block complete splitting set comprises a plurality of resource block splitting sets, and each resource block splitting set comprises a plurality of resource block groups;
(2) generating cluster number and initializing resource block group and user in each cluster:
defining the number of resource block groups in each resource block splitting set as the number K of classes, and defining the resource block groups in the K classes as T in turn1,···,Tm,···,TKSequentially putting each resource block group in the T1,···,Tm,···,TKIn (3), sequentially defining the user groups in K classes as omega1,···,Ωm,···,ΩKDefining the total number of users as L, selecting K users from the L users in sequence and putting the K users into omega1,···,Ωm,···,ΩKPerforming the following steps;
(3) calculating the center Z of each class according to the minimum mean square error-ordering-based continuous interference cancellation MMSE-OSIC detection method and the bit error rate constraint adaptive modulation method1,···,Zm,···,ZK
(4) And executing user removal operation:
(4a) setting the number of users moved out of a class each time as eta;
(4b) selecting a class from the unselected classes, judging whether the number of users in the class is greater than eta, if so, executing (4c), otherwise, executing (4 e);
(4c) the user group omega in the mth classmResource block group T occupied by user umIs defined as a transmission efficiency of
Figure FDA0002970726400000021
Calculating the distance from each user in the cluster to the cluster center as
Figure FDA0002970726400000022
Then, the user with the minimum distance to the center is moved out of the class, and the center Z of each class is updated according to (3)1,···,Zm,···,ZK
(4d) Repeating (4c) until η users are moved out of the class;
(4e) repeating (4b) - (4d) until all K classes are selected;
(5) and executing user adding operation:
(5a) setting the number of users added to the class each time as lambda;
(5b) selecting one user from the users to be added, and calculating the distance from the user to all the cluster centers to obtain
Figure FDA0002970726400000023
Adding the user to the class corresponding to the clustering center with the minimum distance;
(5c) repeating (5b) until λ users are all added to the class;
(5d) updating the center Z of each class according to (3)1,···,Zm,···,ZK
(6) And (5) repeating the steps (4) and (5) until all L users are allocated to the class, and finishing the user pairing process.
2. The method of claim 1, wherein the step (3) calculates the center of each class according to the minimum mean square error-ordering-based successive interference cancellation (MMSE) -OSIC detection method and the bit error rate constrained adaptive modulation method, and the method is implemented as follows:
(3a) computing user group ΩmThe signal-to-interference-and-noise ratio of the sub-carrier e occupied by the user u is as follows:
Figure FDA0002970726400000024
wherein,
Figure FDA0002970726400000025
is a user group omegamThe detected vector of user u on the e-th subcarrier,
Figure FDA0002970726400000026
is a user group omegamAnd the vector corresponding to the u-th column of the channel matrix between the e-th subcarriers, | Ωm| is the user group ΩmNumber of users, σ2Is the gaussian noise variance;
(3b) computing user group ΩmThe transmission efficiency of the user u occupying the e-th subcarrier is as follows:
Figure FDA0002970726400000031
wherein,
Figure FDA0002970726400000032
is a downward cut operation, BERtarIs the upper bound of the BER constraint for signal transmission;
(3c) computing user group ΩmResource block group T occupied by user umThe transmission efficiency of (a) is:
Figure FDA0002970726400000033
(3d) computing user group ΩmOccupied resource block group TmThe transmission efficiency of (a) is:
Figure FDA0002970726400000034
(3e) the center of the mth class is calculated as:
Zm=Rm
3. the method of claim 1, wherein in step (5b), one user is selected from the users to be added, and the distances from the user to all cluster centers are calculated as follows:
(5b1) selecting one user from the users to be added, and adding the user into the mth category to obtain a user group of
Figure FDA0002970726400000035
(5b2) Computing user groups
Figure FDA0002970726400000036
The transmission efficiency of the user u occupying the e-th subcarrier is as follows:
Figure FDA0002970726400000037
wherein,
Figure FDA0002970726400000038
is a downward trade-off operation, SINR (u)e,m+Is a group of users
Figure FDA0002970726400000039
Signal to interference plus noise ratio (BER) of the e-th subcarrier occupied by user utarIs the upper bound of the BER constraint for signal transmission;
(5b3) computing user groups
Figure FDA00029707264000000310
Resource block group T occupied by user umThe transmission efficiency of (a) is:
Figure FDA00029707264000000311
wherein,
Figure FDA00029707264000000312
is a group of users
Figure FDA00029707264000000313
The transmission efficiency of the e sub-carrier occupied by the user u;
(5b4) computing user groups
Figure FDA00029707264000000314
Occupied resource block group TmThe transmission efficiency of (a) is:
Figure FDA00029707264000000315
(5b5) calculating the distance from the selected user to the mth clustering center as follows:
Figure FDA0002970726400000041
wherein Z ismIs the center of the mth class.
CN201811600741.8A 2018-12-26 2018-12-26 Cluster-based User Pairing Method in MU-MIMO System Active CN109728891B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811600741.8A CN109728891B (en) 2018-12-26 2018-12-26 Cluster-based User Pairing Method in MU-MIMO System

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811600741.8A CN109728891B (en) 2018-12-26 2018-12-26 Cluster-based User Pairing Method in MU-MIMO System

Publications (2)

Publication Number Publication Date
CN109728891A CN109728891A (en) 2019-05-07
CN109728891B true CN109728891B (en) 2021-05-18

Family

ID=66297157

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811600741.8A Active CN109728891B (en) 2018-12-26 2018-12-26 Cluster-based User Pairing Method in MU-MIMO System

Country Status (1)

Country Link
CN (1) CN109728891B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101958770A (en) * 2010-08-30 2011-01-26 北京邮电大学 Method and device for eliminating uplink multi-user multiple access interference in multiple-input multiple-output system
CN103024920A (en) * 2012-12-21 2013-04-03 中国科学技术大学 Method for pairing users in virtual multiple-input-multiple-output system
CN106793120A (en) * 2016-12-23 2017-05-31 西安电子科技大学 Fast joint resource allocation methods based on partition number in virtual MIMO system
CN108282888A (en) * 2018-03-05 2018-07-13 吉林大学 A kind of D2D resource allocation methods based on improvement fuzzy clustering

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10045352B2 (en) * 2016-01-13 2018-08-07 Futurewei Technologies, Inc. Channel estimation in large scale MIMO systems using iterative location based spatial filtering
US10374772B2 (en) * 2017-01-25 2019-08-06 Georgia Tech Research Corporation Method for slicing K-best detection in multiple-input multiple-output wireless communications system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101958770A (en) * 2010-08-30 2011-01-26 北京邮电大学 Method and device for eliminating uplink multi-user multiple access interference in multiple-input multiple-output system
CN103024920A (en) * 2012-12-21 2013-04-03 中国科学技术大学 Method for pairing users in virtual multiple-input-multiple-output system
CN106793120A (en) * 2016-12-23 2017-05-31 西安电子科技大学 Fast joint resource allocation methods based on partition number in virtual MIMO system
CN108282888A (en) * 2018-03-05 2018-07-13 吉林大学 A kind of D2D resource allocation methods based on improvement fuzzy clustering

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LTE上行虚拟MIMO用户配对算法研究;马松;《信息科技辑》;20160331;全文 *
Soft-output MMSE OSIC MIMO detector with reduced-complexity approximations;Jun Wang;《2007 IEEE 8th Workshop on Signal Processing Advances in Wireless Communications》;20071212;全文 *

Also Published As

Publication number Publication date
CN109728891A (en) 2019-05-07

Similar Documents

Publication Publication Date Title
CN109195214B (en) Genetic algorithm-based NOMA power allocation method
CN111132264A (en) User clustering method for downlink of multi-user MIMO-NOMA system
CN103596182B (en) A kind of dynamic spectrum resource management method in D2D communication
CN110418399A (en) A NOMA-based Resource Allocation Method for Internet of Vehicles
CN107547184B (en) A Dynamic Pilot Allocation Method in Massive MIMO System
CN112954798B (en) Multi-domain combined hybrid non-orthogonal multiple access model framework and resource allocation scheme
CN105554808A (en) D2D (Device-to-Device) resource distribution method and device in cellular network
CN107949061B (en) Multi-user grouping method based on non-orthogonal multiple access system
CN111294959B (en) An optimization method and optimization device for joint user grouping and power allocation
CN111182511B (en) AGA-based NOMA resource allocation method in mMTC scene
CN108990160B (en) 5G communication system capacity optimization method based on improved bat algorithm
CN105721123A (en) User matching and power allocation method and apparatus
Jamali et al. A low-complexity recursive approach toward code-domain NOMA for massive communications
CN110113118A (en) A kind of non-orthogonal multiple access system downlink user cluster-dividing method
CN113329418A (en) User clustering method, system and medium based on large-scale MIMO-NOMA system
CN112469113A (en) Resource allocation method and device of multi-carrier NOMA system
CN107734697A (en) Low-complexity multi-user group technology based on NOMA systems
CN106411796B (en) Multiple terminals signal detecting method and base station in a kind of access of non-orthogonal multiple
CN108282888B (en) A D2D Resource Allocation Method Based on Improved Fuzzy Clustering
CN109728891B (en) Cluster-based User Pairing Method in MU-MIMO System
CN106059734A (en) Massive MIMO system pilot frequency distribution method based on edge user interference measurement value
CN104780610A (en) A resource allocating method based on terminal direct communication
CN111935842B (en) A multi-user cluster scheduling method for non-orthogonal multiple access
CN114844754A (en) Massive Terminal Multiple Access Method Based on Packet Sequence Codebook Set
CN110300412B (en) Game theory-based resource allocation method in non-orthogonal cognitive radio network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant