CN102546088A - BD (block diagonalization) pre-coding method and device - Google Patents

BD (block diagonalization) pre-coding method and device Download PDF

Info

Publication number
CN102546088A
CN102546088A CN2010106221758A CN201010622175A CN102546088A CN 102546088 A CN102546088 A CN 102546088A CN 2010106221758 A CN2010106221758 A CN 2010106221758A CN 201010622175 A CN201010622175 A CN 201010622175A CN 102546088 A CN102546088 A CN 102546088A
Authority
CN
China
Prior art keywords
matrix
user
lower triangular
precoding
orthogonal
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.)
Granted
Application number
CN2010106221758A
Other languages
Chinese (zh)
Other versions
CN102546088B (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.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
NTT Docomo Inc
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 University of Electronic Science and Technology of China, NTT Docomo Inc filed Critical University of Electronic Science and Technology of China
Priority to CN201010622175.8A priority Critical patent/CN102546088B/en
Publication of CN102546088A publication Critical patent/CN102546088A/en
Application granted granted Critical
Publication of CN102546088B publication Critical patent/CN102546088B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

本发明公开了一种bd预编码方法及装置。其中，方法包括：根据系统中各用户的下行信道矩阵确定总的用户信道矩阵hs；对所述总的用户信道矩阵hs的共轭转置矩阵

Figure DSA00000410899100011
进行qr分解，得到正交矩阵q和上三角矩阵r的乘积，将所述总的用户信道矩阵hs表示为下三角矩阵l和正交矩阵q的共轭转置矩阵qh的乘积；对所述下三角矩阵l进行求逆计算，得到l-1；根据所述下三角矩阵l的逆l-1及所述正交矩阵q，得到各用户干扰信道矩阵的零空间正交基；根据各用户干扰信道矩阵的零空间正交基，构造每个用户的线性预编码矩阵；利用构造的线性预编码矩阵对各个用户的发射信号进行线性预编码。本发明所公开的技术方案，能够降低系统复杂度，提高编码效率。

Figure 201010622175

The invention discloses a bd precoding method and device. Wherein, the method includes: determining the total user channel matrix h s according to the downlink channel matrix of each user in the system; the conjugate transposition matrix of the total user channel matrix h s

Figure DSA00000410899100011
Carry out qr decomposition to obtain the product of the orthogonal matrix q and the upper triangular matrix r, and represent the total user channel matrix h s as the product of the lower triangular matrix l and the conjugate transpose matrix q h of the orthogonal matrix q; The lower triangular matrix l is inversely calculated to obtain l -1 ; according to the inverse l -1 of the lower triangular matrix l and the orthogonal matrix q, the zero-space orthogonal basis of the interference channel matrix of each user is obtained; according to Each user interferes with the null-space orthogonal basis of the channel matrix, and constructs a linear precoding matrix for each user; uses the constructed linear precoding matrix to linearly precode the transmitted signals of each user. The technical scheme disclosed by the invention can reduce system complexity and improve coding efficiency.

Figure 201010622175

Description

一种块对角化预编码方法及装置A block diagonal precoding method and device

技术领域 technical field

本发明涉及无线通信系统领域，尤其涉及一种块对角化(BD)预编码方法及装置。The present invention relates to the field of wireless communication systems, in particular to a block diagonal (BD) precoding method and device.

背景技术 Background technique

为了达到更高的数据速率，传统的多用户多输入单输出系统已经扩展到多用户多输入多输出(MU-MIMO)系统。然而由于MU-MIMO系统中多个用户共用同一时间与频率资源，必然会引入多用户的共信道干扰(CCI)，影响数据的可靠接收。To achieve higher data rates, traditional MU-MIMO systems have been extended to Multi-User-MIMO (MU-MIMO) systems. However, since multiple users in the MU-MIMO system share the same time and frequency resources, co-channel interference (CCI) of multiple users will inevitably be introduced, affecting reliable reception of data.

为了消除CCI，基站需要首先获得反映信道特性的信道状态信息(CSI)，例如通过信道估计获取信道传输矩阵。然后根据该信道状态信息，选取合适的线性预编码矩阵对发射信号进行消除CCI的线性预编码后发送给接收端。In order to eliminate CCI, the base station needs to first obtain channel state information (CSI) reflecting channel characteristics, for example, obtain channel transmission matrix through channel estimation. Then, according to the channel state information, an appropriate linear precoding matrix is selected to perform linear precoding for eliminating CCI on the transmitted signal, and then send it to the receiving end.

BD预编码算法是目前MU-MIMO系统中广泛使用的一种预编码算法，该算法的主要思想包括：(1)基站获取各用户的下行信道矩阵Hk，其中k为用户索引，k＝1，2，…，K，K为系统基站在同一频带范围内同时服务的用户数。在时分双工(TDD)模式下，基站可以通过信道互易性获知用户估计出的信道矩阵；在频分双工(FDD)模式下，基站可以通过终端的反馈获知基站到用户的信道矩阵。(2)根据获取的下行信道矩阵确定任意用户k的干扰信道矩阵并计算任意用户k的干扰信道矩阵

Figure BSA00000410899400012
的零空间正交基，即寻找与干扰信道矩阵
Figure BSA00000410899400013
中的列矢量正交的矢量。(3)根据计算的各用户的干扰信道矩阵的零空间正交基，构造每个用户的预编码矩阵。The BD precoding algorithm is a precoding algorithm widely used in MU-MIMO systems at present. The main idea of the algorithm includes: (1) The base station obtains the downlink channel matrix H k of each user, where k is the user index, k=1 , 2, ..., K, K is the number of users simultaneously served by the system base station within the same frequency band. In the time division duplex (TDD) mode, the base station can obtain the channel matrix estimated by the user through channel reciprocity; in the frequency division duplex (FDD) mode, the base station can obtain the channel matrix from the base station to the user through the feedback of the terminal. (2) Determine the interference channel matrix of any user k according to the obtained downlink channel matrix And calculate the interference channel matrix of any user k
Figure BSA00000410899400012
The null-space orthogonal basis of , that is, the seeking and interfering channel matrix
Figure BSA00000410899400013
A vector that is orthogonal to the column vectors in . (3) Construct a precoding matrix for each user according to the calculated zero-space orthogonal basis of the interference channel matrix of each user.

之后，便可利用构造好的线性预编码矩阵对各个用户的发射信号进行线性预编码处理。具体进行线性预编码处理的方式可以为：将任意用户对应的线性预编码矩阵与该用户的发射信号相乘，然后通过发射天线发射出去。Afterwards, the constructed linear precoding matrix can be used to perform linear precoding processing on the transmitted signals of each user. A specific manner of performing linear precoding processing may be as follows: multiplying a linear precoding matrix corresponding to any user by a transmit signal of the user, and then transmitting through a transmit antenna.

下面以一个具体的系统环境为例，说明两种现有的BD预编码方法。Taking a specific system environment as an example, two existing BD precoding methods are described below.

假定在多用户MIMO系统中，某小区的基站有Nt根发射天线，其中，任意用户k(k＝1，2，…，K)的接收天线数为nk，K为基站利用同一频带同时服务的用户数。K个用户终端上的接收天线总数为

Figure BSA00000410899400021
并且，基站的发射天线总数NT大于或等于用户终端的接收天线总数NR。Assume that in a multi-user MIMO system, the base station of a certain cell has N t transmitting antennas, wherein, the number of receiving antennas of any user k (k=1, 2, ..., K) is n k , and K is that the base station utilizes the same frequency band at the same time The number of users served. The total number of receiving antennas on K user terminals is
Figure BSA00000410899400021
Moreover, the total number NT of transmitting antennas of the base station is greater than or equal to the total number NR of receiving antennas of the user terminal.

方法1：传统的BD预编码方法。该方法包括：Method 1: traditional BD precoding method. The method includes:

步骤1，基站获取各用户的下行信道矩阵Hk，k(k＝1，2，…，K)。Step 1, the base station obtains the downlink channel matrix H k , k (k=1, 2, . . . , K) of each user.

步骤2，根据获取的下行信道矩阵确定任意用户k的干扰信道矩阵

Figure BSA00000410899400022
维度为(NR-nk)×NT；其中，[·]T表示矩阵的转置。Step 2, determine the interference channel matrix of any user k according to the acquired downlink channel matrix
Figure BSA00000410899400022
The dimension is (N R -n k )×N T ; where [·] T represents the transpose of the matrix.

步骤3，对任意用户k的干扰信道矩阵

Figure BSA00000410899400023
进行SVD分解得到
Figure BSA00000410899400025
的零空间正交基其中，
Figure BSA00000410899400027
是的左奇异矩阵，
Figure BSA00000410899400029
和
Figure BSA000004108994000210
分别是
Figure BSA000004108994000211
的右奇异矩阵的前
Figure BSA000004108994000212
列和后
Figure BSA000004108994000213
列，
Figure BSA000004108994000214
的维度为
Figure BSA000004108994000215
[·]H表示矩阵的共轭转置，其中
Figure BSA000004108994000216
rank(·)表示矩阵的取秩运算。Step 3, the interference channel matrix for any user k
Figure BSA00000410899400023
Perform SVD decomposition get
Figure BSA00000410899400025
The null-space orthonormal basis of in,
Figure BSA00000410899400027
yes The left singular matrix of ,
Figure BSA00000410899400029
and
Figure BSA000004108994000210
respectively
Figure BSA000004108994000211
The front of the right singular matrix of
Figure BSA000004108994000212
column and post
Figure BSA000004108994000213
List,
Figure BSA000004108994000214
has a dimension of
Figure BSA000004108994000215
[ ] H represents the conjugate transpose of the matrix, where
Figure BSA000004108994000216
rank(·) represents the rank operation of the matrix.

从上述零空间正交基

Figure BSA000004108994000217
中，选择任意nk个列矢量作为用户k的线性预编码矩阵的列矢量。或者，也可按照如下步骤4～步骤5构造预编码矩阵。From the above null space orthonormal basis
Figure BSA000004108994000217
In , any n k column vectors are selected as the column vectors of the linear precoding matrix of user k. Alternatively, the precoding matrix may also be constructed according to the following steps 4 to 5.

步骤4，利用

Figure BSA000004108994000218
的零空间正交基
Figure BSA000004108994000219
和用户k的下行信道矩阵Hk构造用户k的完全消除CCI(即零CCI)的等效信道矩阵：
Figure BSA000004108994000220
Step 4, use
Figure BSA000004108994000218
The null-space orthonormal basis of
Figure BSA000004108994000219
and the downlink channel matrix H k of user k to construct the equivalent channel matrix of user k that completely eliminates CCI (that is, zero CCI):
Figure BSA000004108994000220

步骤5，为获取零CCI的等效信道矩阵的最大预编码增益，对等效信道矩阵再次进行SVD分解

Figure BSA000004108994000221
根据分解结果构造每个用户的预编码矩阵为：
Figure BSA000004108994000222
其中
Figure BSA000004108994000223
为Vk的前nk列。相应地，整个系统的预编码矩阵为：Ws＝[W1 W2…WK]。Step 5, in order to obtain the maximum precoding gain of the equivalent channel matrix with zero CCI, perform SVD decomposition on the equivalent channel matrix again
Figure BSA000004108994000221
According to the decomposition results, the precoding matrix of each user is constructed as:
Figure BSA000004108994000222
in
Figure BSA000004108994000223
is the first n k columns of V k . Correspondingly, the precoding matrix of the whole system is: W s =[W 1 W 2 . . . W K ].

上述方法中，在求取任意用户k的干扰信道矩阵

Figure BSA000004108994000224
的零空间正交基时，是通过对干扰信道传输矩阵
Figure BSA000004108994000225
进行SVD分解求取的(如步骤3中所示)，而SVD分解本身的计算复杂度较大，因此造成在发送端对信号进行的线性预编码复杂度增大，线性预编码效率低。In the above method, when obtaining the interference channel matrix of any user k
Figure BSA000004108994000224
The null-space-orthogonal base time of , is the transmission matrix of the interfering channel by
Figure BSA000004108994000225
SVD decomposition is performed (as shown in step 3), and the calculation complexity of SVD decomposition itself is large, so the complexity of linear precoding performed on the signal at the sending end increases, and the efficiency of linear precoding is low.

方法2：基于QR分解的BD预编码算法。该方法与上述方法1相比较，不同之处在于：在求取任意用户k的干扰信道矩阵

Figure BSA00000410899400031
的零空间正交基时，利用QR分解代替SVD分解，即该方法在步骤3中，对任意用户k的干扰信道矩阵进行QR分解
Figure BSA00000410899400033
得到
Figure BSA00000410899400034
的零空间正交基
Figure BSA00000410899400035
之后根据计算的各用户干扰信道矩阵的零空间正交基，构造每个用户的预编码矩阵的过程可与方法1相同。Method 2: BD precoding algorithm based on QR decomposition. Compared with the above-mentioned method 1, this method differs in that: when obtaining the interference channel matrix of any user k
Figure BSA00000410899400031
When the zero-space orthogonal basis of , use QR decomposition instead of SVD decomposition, that is, in step 3 of this method, for any user k’s interference channel matrix Perform QR decomposition
Figure BSA00000410899400033
get
Figure BSA00000410899400034
The null-space orthonormal basis of
Figure BSA00000410899400035
Then, according to the calculated zero-space orthogonal basis of the interference channel matrix of each user, the process of constructing the precoding matrix of each user may be the same as method 1.

该方法2中，虽然用QR分解代替了SVD分解，算法复杂度有所降低；但由于其需要针对每个用户的干扰信道矩阵都进行一次QR分解，因此复杂度仍然很高，使得线性预编码效率仍然很低。In method 2, although the SVD decomposition is replaced by QR decomposition, the complexity of the algorithm is reduced; but because it needs to perform a QR decomposition for each user's interference channel matrix, the complexity is still very high, making linear precoding Still very inefficient.

可见，现有技术中的BD预编码方法的计算复杂度较高，使得采用该BD预编码算法消除CCI时的线性预编码效率较低。It can be seen that the computational complexity of the BD precoding method in the prior art is relatively high, so that the efficiency of linear precoding when the BD precoding algorithm is used to eliminate CCI is low.

发明内容 Contents of the invention

有鉴于此，本发明中一方面提供一种BD预编码方法，另一方面提供一种BD预编码装置，以便提高线性预编码的效率。In view of this, the present invention provides a BD precoding method on the one hand, and a BD precoding device on the other hand, so as to improve the efficiency of linear precoding.

本发明所提供的BD预编码方法，包括：The BD precoding method provided by the present invention includes:

根据系统中各用户的下行信道矩阵确定总的用户信道矩阵

Figure BSA00000410899400036
其中，Hk为用户k的下行信道矩阵，k＝1，2，…，K，K为系统基站在同一频带范围内同时服务的用户数；Determine the total user channel matrix according to the downlink channel matrix of each user in the system
Figure BSA00000410899400036
Wherein, H k is the downlink channel matrix of user k, k=1, 2, ..., K, K is the number of users simultaneously served by the system base station within the same frequency band;

对所述总的用户信道矩阵Hs的共轭转置矩阵

Figure BSA00000410899400037
进行QR分解，得到正交矩阵Q和上三角矩阵R的乘积，将所述总的用户信道矩阵Hs表示为下三角矩阵L和正交矩阵Q的共轭转置矩阵QH的乘积，其中，L为上三角矩阵R的共轭转置矩阵RH；The conjugate transpose matrix of the total user channel matrix H s
Figure BSA00000410899400037
Perform QR decomposition to obtain the product of the orthogonal matrix Q and the upper triangular matrix R, and the total user channel matrix H s is expressed as the product of the lower triangular matrix L and the conjugate transpose matrix Q H of the orthogonal matrix Q, where , L is the conjugate transpose matrix R H of the upper triangular matrix R;

对所述下三角矩阵L进行求逆计算，得到

Figure BSA00000410899400038
Carry out inverse calculation to described lower triangular matrix L, obtain
Figure BSA00000410899400038

根据所述下三角矩阵L的逆

Figure BSA00000410899400041
及所述正交矩阵Q，得到各用户干扰信道矩阵的零空间正交基；According to the inverse of the lower triangular matrix L
Figure BSA00000410899400041
And the orthogonal matrix Q, obtain the zero-space orthogonal basis of each user's interference channel matrix;

根据各用户干扰信道矩阵的零空间正交基，构造每个用户的线性预编码矩阵；Construct the linear precoding matrix of each user according to the zero-space orthogonal basis of the interference channel matrix of each user;

利用构造的线性预编码矩阵对各个用户的发射信号进行线性预编码。The constructed linear precoding matrix is used to linearly precode the transmitted signals of each user.

较佳地，所述对所述下三角矩阵L进行求逆计算，得到

Figure BSA00000410899400042
包括：Preferably, the inverse calculation is performed on the lower triangular matrix L to obtain
Figure BSA00000410899400042
include:

根据所述下三角矩阵L构造对角矩阵G，所述对角矩阵G的对角元素为所述下三角矩阵L对角元素的倒数；Construct a diagonal matrix G according to the lower triangular matrix L, and the diagonal elements of the diagonal matrix G are the reciprocals of the diagonal elements of the lower triangular matrix L;

根据所述下三角矩阵L和所述对角矩阵G，构造单位下三角矩阵B＝GL；According to the lower triangular matrix L and the diagonal matrix G, construct the unit lower triangular matrix B=GL;

按照公式

Figure BSA00000410899400043
E＝B-I计算所述单位下三角矩阵B的逆；其中，I为单位矩阵；according to the formula
Figure BSA00000410899400043
E=BI calculates the inverse of the lower triangular matrix B of the unit; wherein, I is the unit matrix;

根据L-1＝B-1G，得到所述下三角矩阵L的逆

Figure BSA00000410899400044
According to L -1 =B -1 G, the inverse of the lower triangular matrix L is obtained
Figure BSA00000410899400044

较佳地，所述根据下三角矩阵L的逆

Figure BSA00000410899400045
及所述正交矩阵Q，得到各用户干扰信道矩阵的零空间正交基包括：Preferably, according to the inverse of the lower triangular matrix L
Figure BSA00000410899400045
And described orthogonal matrix Q, obtain the zero-space orthogonal basis of interference channel matrix of each user and include:

计算所述

Figure BSA00000410899400046
中各个子矩阵
Figure BSA00000410899400047
的正交基
Figure BSA00000410899400048
Calculate the
Figure BSA00000410899400046
Each sub-matrix in
Figure BSA00000410899400047
Orthogonal basis of
Figure BSA00000410899400048

根据所述正交矩阵Q和所述正交基

Figure BSA00000410899400049
得到任意用户k的干扰信道矩阵
Figure BSA000004108994000410
的零空间正交基
Figure BSA000004108994000411
According to the orthogonal matrix Q and the orthogonal basis
Figure BSA00000410899400049
Get the interference channel matrix of any user k
Figure BSA000004108994000410
The null-space orthonormal basis of
Figure BSA000004108994000411

较佳地，所述计算所述

Figure BSA000004108994000412
中各个子矩阵
Figure BSA000004108994000413
的正交基
Figure BSA000004108994000414
包括：Preferably, the calculation described
Figure BSA000004108994000412
Each sub-matrix in
Figure BSA000004108994000413
Orthogonal basis of
Figure BSA000004108994000414
include:

对所述

Figure BSA000004108994000415
中的各个子矩阵进行施密特正交化，得到所述子矩阵
Figure BSA000004108994000417
的正交基 to the said
Figure BSA000004108994000415
Each sub-matrix in Perform Schmidt orthogonalization to obtain the sub-matrix
Figure BSA000004108994000417
Orthogonal basis of

较佳地，所述根据计算的各用户干扰信道矩阵的零空间正交基，构造每个用户的线性预编码矩阵包括：Preferably, the constructing the linear precoding matrix of each user according to the calculated zero-space orthogonal basis of the interference channel matrix of each user includes:

利用任意用户k干扰信道矩阵的零空间正交基及所述用户k的下行信道矩阵构造用户k的零共信道干扰的等效信道矩阵；Utilizing the zero space orthogonal basis of any user k interference channel matrix and the downlink channel matrix of user k to construct an equivalent channel matrix of zero co-channel interference for user k;

对所述等效信道矩阵进行SVD分解或对所述等效信道矩阵的共轭转置矩阵进行QR分解，根据分解结果构造所述用户k的预编码矩阵。Performing SVD decomposition on the equivalent channel matrix or performing QR decomposition on the conjugate transpose matrix of the equivalent channel matrix, and constructing the precoding matrix of the user k according to the decomposition result.

本发明所提供的BD预编码装置，包括：The BD precoding device provided by the present invention includes:

总信道矩阵确定模块，用于根据系统中各用户的下行信道矩阵确定总的用户信道矩阵

Figure BSA00000410899400051
其中，Hk为用户k的下行信道矩阵，k＝1，2，…，K，K为系统基站在同一频带范围内同时服务的用户数；The total channel matrix determination module is used to determine the total user channel matrix according to the downlink channel matrix of each user in the system
Figure BSA00000410899400051
Wherein, H k is the downlink channel matrix of user k, k=1, 2, ..., K, K is the number of users simultaneously served by the system base station within the same frequency band;

QR分解模块，用于对所述总的用户信道矩阵Hs的共轭转置矩阵进行QR分解，得到正交矩阵Q和上三角矩阵R的乘积，将所述Hs表示为下三角矩阵L和正交矩阵Q的共轭转置矩阵QH的乘积，其中，L为上三角矩阵R的共轭转置矩阵RH；QR decomposition module for the conjugate transpose matrix of the total user channel matrix H s Perform QR decomposition to obtain the product of the orthogonal matrix Q and the upper triangular matrix R, and express the H s as the product of the lower triangular matrix L and the conjugate transpose matrix Q H of the orthogonal matrix Q, where L is the upper triangular The conjugate transpose matrix R H of the matrix R;

下三角矩阵求逆模块，用于对所述下三角矩阵L进行求逆计算，得到 L - 1 = L ^ 1 L ^ 2 . . . L ^ K ; The lower triangular matrix inversion module is used to perform inverse calculation on the lower triangular matrix L to obtain L - 1 = L ^ 1 L ^ 2 . . . L ^ K ;

零空间正交基确定模块，用于根据所述QR分解模块得到的正交矩阵Q和所述下三角矩阵求逆模块得到的

Figure BSA00000410899400054
得到各用户干扰信道矩阵的零空间正交基；A null space orthogonal base determination module, used for obtaining the orthogonal matrix Q obtained from the QR decomposition module and the lower triangular matrix inversion module
Figure BSA00000410899400054
Obtain the zero-space orthogonal basis of each user's interference channel matrix;

预编码矩阵构造模块，用于根据所述零空间正交基确定模块确定的各用户干扰信道矩阵的零空间正交基，构造每个用户的线性预编码矩阵；A precoding matrix construction module, configured to construct a linear precoding matrix for each user according to the zero-space orthogonal basis of each user's interference channel matrix determined by the zero-space orthogonal basis determination module;

预编码处理模块，用于利用所述预编码矩阵构造模块构造的线性预编码矩阵对各个用户的发射信号进行线性预编码。The precoding processing module is configured to linearly precode the transmitted signals of each user by using the linear precoding matrix constructed by the precoding matrix construction module.

较佳地，所述下三角矩阵求逆模块包括：Preferably, the lower triangular matrix inversion module includes:

第一构造子模块，用于根据所述下三角矩阵L构造对角矩阵G，所述对角矩阵G的对角元素为所述下三角矩阵L对角元素的倒数；The first construction submodule is used to construct a diagonal matrix G according to the lower triangular matrix L, and the diagonal elements of the diagonal matrix G are the reciprocals of the diagonal elements of the lower triangular matrix L;

第二构造子模块，用于根据所述下三角矩阵L和所述对角矩阵G，构造单位下三角矩阵B＝GL；The second construction submodule is used to construct a unit lower triangular matrix B=GL according to the lower triangular matrix L and the diagonal matrix G;

第一求逆子模块，用于按照公式

Figure BSA00000410899400061
E＝B-I计算所述下三角矩阵B的逆；其中，I为单位矩阵；The first inversion submodule is used to follow the formula
Figure BSA00000410899400061
E=BI calculates the inverse of the lower triangular matrix B; wherein, I is an identity matrix;

第二求逆子模块，用于根据L-1＝B-1G，得到所述下三角矩阵L的逆 L - 1 = L ^ 1 L ^ 2 . . . L ^ K . The second inversion sub-module is used to obtain the inverse of the lower triangular matrix L according to L -1 =B -1 G L - 1 = L ^ 1 L ^ 2 . . . L ^ K .

较佳地，所述零空间正交基确定模块包括：Preferably, the null space orthogonal base determination module includes:

第一计算子模块，用于计算所述下三角矩阵求逆模块得到的

Figure BSA00000410899400063
中各个子矩阵
Figure BSA00000410899400064
的正交基
Figure BSA00000410899400065
The first calculation sub-module is used to calculate the obtained lower triangular matrix inversion module
Figure BSA00000410899400063
Each sub-matrix in
Figure BSA00000410899400064
Orthogonal basis of
Figure BSA00000410899400065

第二计算子模块，用于根据所述正交矩阵Q和所述正交基

Figure BSA00000410899400066
得到任意用户k的干扰信道矩阵
Figure BSA00000410899400067
的零空间正交基
Figure BSA00000410899400068
The second calculation sub-module is used to calculate according to the orthogonal matrix Q and the orthogonal basis
Figure BSA00000410899400066
Get the interference channel matrix of any user k
Figure BSA00000410899400067
The null-space orthonormal basis of
Figure BSA00000410899400068

较佳地，所述第一计算子模块对所述

Figure BSA00000410899400069
中的各个子矩阵
Figure BSA000004108994000610
进行施密特正交化，得到所述子矩阵的正交基
Figure BSA000004108994000612
Preferably, the first calculation sub-module is for the
Figure BSA00000410899400069
Each sub-matrix in
Figure BSA000004108994000610
Perform Schmidt orthogonalization to obtain the sub-matrix Orthogonal basis of
Figure BSA000004108994000612

较佳地，所述预编码矩阵构造模块包括：Preferably, the precoding matrix construction module includes:

等效信道矩阵构造子模块，用于利用任意用户k干扰信道矩阵的零空间正交基及所述用户k的下行信道矩阵构造用户k的零共信道干扰的等效信道矩阵；The equivalent channel matrix construction submodule is used to construct an equivalent channel matrix of zero co-channel interference for user k by using the zero-space orthogonal basis of any user k interference channel matrix and the downlink channel matrix of user k;

预编码矩阵构造子模块，用于对所述等效信道矩阵进行SVD分解或对所述等效信道矩阵的共轭转置矩阵进行QR分解，根据分解结果构造所述用户k的预编码矩阵。The precoding matrix construction submodule is configured to perform SVD decomposition on the equivalent channel matrix or perform QR decomposition on the conjugate transpose matrix of the equivalent channel matrix, and construct the precoding matrix of the user k according to the decomposition result.

从上述方案可以看出，本发明实施例中，通过只对总的用户信道矩阵进行一次QR分解，根据QR分解结果确定各用户干扰信道矩阵的零空间正交基，而无需对每个用户的干扰信道矩阵进行QR分解，从而降低了预编码过程中的计算复杂度，提高了预编码效率。It can be seen from the above scheme that in the embodiment of the present invention, only one QR decomposition is performed on the total user channel matrix, and the zero-space orthogonal basis of the interference channel matrix of each user is determined according to the QR decomposition result, without the need for each user's The interference channel matrix is decomposed by QR, thereby reducing the computational complexity in the precoding process and improving the precoding efficiency.

进一步地，本发明中通过对QR分解的下三角矩阵L进行简化的求逆运算，进一步降低了预编码过程中的计算复杂度，提高了预编码效率。Furthermore, in the present invention, by performing a simplified inversion operation on the lower triangular matrix L decomposed by QR, the computational complexity in the precoding process is further reduced, and the precoding efficiency is improved.

附图说明 Description of drawings

图1为本发明实施例中一种BD预编码方法的示例性流程图。Fig. 1 is an exemplary flowchart of a BD precoding method in an embodiment of the present invention.

图2为本发明实施例中一种BD预编码装置的示例性结构图。Fig. 2 is an exemplary structural diagram of a BD precoding apparatus in an embodiment of the present invention.

图3为本发明实施例的BD预编码装置中下三角矩阵求逆模块的内部结构示意图。FIG. 3 is a schematic diagram of an internal structure of a lower triangular matrix inversion module in a BD precoding device according to an embodiment of the present invention.

图4为本发明实施例的BD预编码装置中零空间正交基确定模块的内部结构示意图。Fig. 4 is a schematic diagram of the internal structure of a zero-space orthogonal base determination module in the BD precoding device according to an embodiment of the present invention.

图5为本发明实施例的BD预编码装置中预编码矩阵构造模块的内部结构示意图。Fig. 5 is a schematic diagram of an internal structure of a precoding matrix construction module in a BD precoding device according to an embodiment of the present invention.

图6为本发明实施例中的BD预编码方案与现有技术中的BD预编码方案的复杂度比较仿真图。Fig. 6 is a comparison simulation diagram of complexity between the BD precoding scheme in the embodiment of the present invention and the BD precoding scheme in the prior art.

图7为本发明实施例中的BD预编码方案与现有技术中的BD预编码方案的容量性能比较仿真图。Fig. 7 is a comparison simulation diagram of capacity performance between the BD precoding scheme in the embodiment of the present invention and the BD precoding scheme in the prior art.

具体实施方式 Detailed ways

为使本发明的目的、技术方案和优点更加清楚明白，下面结合实施例和附图，对本发明进一步详细说明。In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the embodiments and accompanying drawings.

本发明中首先考虑到当矩阵的零空间向量相互正交时，该零空间向量便可称之为矩阵的零空间正交基，因此为了求取任意用户k的干扰信道矩阵

Figure BSA00000410899400071
的零空间正交基，可首先求取任意用户k的干扰信道矩阵的零空间向量，而
Figure BSA00000410899400073
的零空间向量可通过计算总的用户信道矩阵
Figure BSA00000410899400074
的伪逆得到，即计算Hs的伪逆
Figure BSA00000410899400075
有
Figure BSA00000410899400076
且有
Figure BSA00000410899400077
即即为的零空间向量集，通过对
Figure BSA000004108994000710
进行正交化处理，便可得到
Figure BSA000004108994000711
的零空间正交基。其中，NT为小区基站的发射天线数，任意用户k(k＝1，2，…，K)的接收天线数为nk，K为基站利用同一频带同时服务的用户数。K个用户终端上的接收天线总数为
Figure BSA00000410899400081
并且，基站的发射天线总数NT大于或等于用户终端的接收天线总数NR，
Figure BSA00000410899400082
的维度NT×nk，
Figure BSA00000410899400083
的维度为(NR-nk)×NT。In the present invention, it is first considered that when the null space vectors of the matrix are orthogonal to each other, the null space vectors can be called the null space orthogonal basis of the matrix, so in order to obtain the interference channel matrix of any user k
Figure BSA00000410899400071
The null-space orthogonal basis of , the interference channel matrix of any user k can be obtained first The null space vector of , while
Figure BSA00000410899400073
The null space vector of the total user channel matrix can be calculated by
Figure BSA00000410899400074
The pseudo-inverse of H s is obtained by computing the pseudo-inverse of H s
Figure BSA00000410899400075
have
Figure BSA00000410899400076
and have
Figure BSA00000410899400077
Right now that is The null space vector set of
Figure BSA000004108994000710
Orthogonalization can be done to get
Figure BSA000004108994000711
The null-space orthonormal basis of . Wherein, NT is the number of transmitting antennas of the cell base station, the number of receiving antennas of any user k (k=1, 2, ..., K) is nk , and K is the number of users served by the base station using the same frequency band at the same time. The total number of receiving antennas on K user terminals is
Figure BSA00000410899400081
And, the total number of transmitting antennas N T of the base station is greater than or equal to the total number of receiving antennas NR of the user terminal,
Figure BSA00000410899400082
of dimension N T × n k ,
Figure BSA00000410899400083
The dimension of is (N R -n k )×N T .

基于上述思想，本发明实施例中采用了简化的Hs伪逆求解过程，参见图1，图1为本发明实施例中BD预编码方法的示例性流程图。如图1所示，该方法包括如下步骤：Based on the above idea, a simplified H s pseudo-inverse solution process is adopted in the embodiment of the present invention, see FIG. 1 , which is an exemplary flow chart of the BD precoding method in the embodiment of the present invention. As shown in Figure 1, the method includes the following steps:

步骤101，根据系统中各用户的下行信道矩阵确定总的用户信道矩阵

Figure BSA00000410899400084
其中，Hk为用户k的下行信道矩阵，k＝1，2，…，K，K为系统基站在同一频带范围内同时服务的用户数。Hs的维度为NR×NT。Step 101, determine the total user channel matrix according to the downlink channel matrix of each user in the system
Figure BSA00000410899400084
Wherein, H k is the downlink channel matrix of user k, k=1, 2, ..., K, K is the number of users simultaneously served by the base station of the system within the same frequency band. The dimension of H s is N R ×N T .

本步骤中，各用户下行信道矩阵的获取过程可与现有技术中一致，例如，各用户可根据接收的导频数据进行信道估计以获取基站到自身用户的下行信道矩阵，之后基站通过信道互易性获知各用户的下行信道矩阵。In this step, the acquisition process of each user's downlink channel matrix can be consistent with that in the prior art. For example, each user can perform channel estimation according to the received pilot data to obtain the downlink channel matrix from the base station to its own user, and then the base station communicates with each other through the channel. It is easy to know the downlink channel matrix of each user.

步骤102，对所述总的用户信道矩阵Hs的共轭转置矩阵

Figure BSA00000410899400085
进行QR分解，得到正交矩阵Q和上三角矩阵R的乘积，即
Figure BSA00000410899400086
将所述总的用户信道矩阵Hs表示为下三角矩阵L和正交矩阵Q的共轭转置矩阵QH的乘积，即
Figure BSA00000410899400087
其中，L为上三角矩阵R的共轭转置矩阵RH。Step 102, the conjugate transpose matrix of the total user channel matrix H s
Figure BSA00000410899400085
Perform QR decomposition to obtain the product of the orthogonal matrix Q and the upper triangular matrix R, namely
Figure BSA00000410899400086
The total user channel matrix H s is expressed as the product of the lower triangular matrix L and the conjugate transpose matrix Q H of the orthogonal matrix Q, namely
Figure BSA00000410899400087
Wherein, L is the conjugate transpose matrix R H of the upper triangular matrix R.

本实施例中，基于步骤102中的分解，可得到Hs＝LQH，此时，再计算总的用户信道矩阵Hs的伪逆时，则有

Figure BSA00000410899400089
开且有
Figure BSA000004108994000810
即
Figure BSA000004108994000811
便为
Figure BSA000004108994000812
的零空间向量集。为此，本实施例中只需继续求解
Figure BSA000004108994000813
即可，即执行如下步骤103。In this embodiment, based on the decomposition in step 102, H s =LQ H can be obtained, and at this time, the pseudo-inverse of the total user channel matrix H s can be calculated when
Figure BSA00000410899400089
open and have
Figure BSA000004108994000810
Right now
Figure BSA000004108994000811
just for
Figure BSA000004108994000812
The set of null-space vectors for . For this reason, in this embodiment, we only need to continue to solve
Figure BSA000004108994000813
That is, the following step 103 is executed.

步骤103，对所述下三角矩阵L进行求逆计算，得到

Figure BSA000004108994000814
其中，
Figure BSA000004108994000815
的维度为NR×nk。Step 103, performing an inverse calculation on the lower triangular matrix L to obtain
Figure BSA000004108994000814
in,
Figure BSA000004108994000815
The dimension of is N R ×n k .

本步骤中，可直接进行矩阵的求逆运算，得到下三角矩阵L的逆或者，本步骤中，也可采用如下简化的求逆运算过程，以便进一步降低计算复杂度。In this step, the inverse operation of the matrix can be directly performed to obtain the inverse of the lower triangular matrix L Alternatively, in this step, the following simplified inversion operation process may also be used, so as to further reduce the computational complexity.

1)根据所述下三角矩阵L构造对角矩阵G，所述对角矩阵G的对角元素为所述下三角矩阵L对角元素的倒数。其中，G的维度为NR×NR。1) Construct a diagonal matrix G according to the lower triangular matrix L, and the diagonal elements of the diagonal matrix G are reciprocals of the diagonal elements of the lower triangular matrix L. Wherein, the dimension of G is N R ×N R .

2)根据所述下三角矩阵L和所述对角矩阵G，构造单位下三角矩阵 B N R × N R = G N R × N R L N R × N R . 2) According to the lower triangular matrix L and the diagonal matrix G, construct the unit lower triangular matrix B N R × N R = G N R × N R L N R × N R .

3)基于单位下三角矩阵的特殊性，按照

Figure BSA00000410899400092
Figure BSA00000410899400093
的简化方法求取单位下三角矩阵B的逆。其中，I为单位矩阵。3) Based on the particularity of the unit lower triangular matrix, according to
Figure BSA00000410899400092
Figure BSA00000410899400093
The simplified method of finds the inverse of the unit lower triangular matrix B. Among them, I is the identity matrix.

4)根据L-1＝B-1G，得到所述下三角矩阵L的逆

Figure BSA00000410899400094
4) Obtain the inverse of the lower triangular matrix L according to L -1 = B -1 G
Figure BSA00000410899400094

步骤104，根据所述下三角矩阵L的逆

Figure BSA00000410899400095
及所述正交矩阵Q，得到各用户干扰信道矩阵的零空间正交基。Step 104, according to the inverse of the lower triangular matrix L
Figure BSA00000410899400095
and the orthogonal matrix Q to obtain the zero-space orthogonal basis of the interference channel matrix of each user.

本步骤中，可以根据下三角矩阵L的逆

Figure BSA00000410899400096
及正交矩阵Q，得到
Figure BSA00000410899400097
由于其中的各子矩阵
Figure BSA00000410899400098
(k＝1，2，…，K)的列之间并不正交，因此
Figure BSA00000410899400099
还不是
Figure BSA000004108994000910
的零空间正交基，还需对其进行正交化，如施密特正交化(GSO)，得到
Figure BSA000004108994000911
的正交基，即得到对应用户k的干扰信道矩阵
Figure BSA000004108994000912
的零空间正交基。其中，
Figure BSA000004108994000913
的维度为NT×nk。In this step, according to the inverse of the lower triangular matrix L
Figure BSA00000410899400096
And the orthogonal matrix Q, get
Figure BSA00000410899400097
Since each sub-matrix
Figure BSA00000410899400098
The columns of (k=1, 2, ..., K) are not orthogonal, so
Figure BSA00000410899400099
not yet
Figure BSA000004108994000910
Orthogonal basis of the null space, it also needs to be orthogonalized, such as Schmidt Orthogonalization (GSO), get
Figure BSA000004108994000911
Orthogonal base of , that is, the interference channel matrix corresponding to user k is obtained
Figure BSA000004108994000912
The null-space orthonormal basis of . in,
Figure BSA000004108994000913
The dimension of is N T ×n k .

或者，考虑Q为正交矩阵，即Q的列之间已经正交，因此本步骤中为了求取

Figure BSA000004108994000914
的零空间正交基，可仅求出
Figure BSA000004108994000915
的正交基
Figure BSA000004108994000916
即可，即对
Figure BSA000004108994000917
应用GSO算法求取
Figure BSA000004108994000918
的正交基
Figure BSA000004108994000919
相应地，本步骤中，可首先计算所述中各个子矩阵
Figure BSA000004108994000921
(k＝1，2，…，K)的正交基
Figure BSA000004108994000922
之后根据所述正交矩阵Q和所述正交基
Figure BSA000004108994000923
得到任意用户k的干扰信道矩阵
Figure BSA000004108994000924
的零空间正交基
Figure BSA000004108994000925
Alternatively, consider that Q is an orthogonal matrix, that is, the columns of Q are already orthogonal, so in this step, in order to obtain
Figure BSA000004108994000914
The null-space orthonormal basis of , we can only find
Figure BSA000004108994000915
Orthogonal basis of
Figure BSA000004108994000916
that's right
Figure BSA000004108994000917
Apply the GSO algorithm to obtain
Figure BSA000004108994000918
Orthogonal basis of
Figure BSA000004108994000919
Correspondingly, in this step, the above-mentioned Each sub-matrix in
Figure BSA000004108994000921
Orthogonal basis of (k=1, 2, ..., K)
Figure BSA000004108994000922
Then according to the orthogonal matrix Q and the orthogonal basis
Figure BSA000004108994000923
Get the interference channel matrix of any user k
Figure BSA000004108994000924
The null-space orthonormal basis of
Figure BSA000004108994000925

步骤105，根据各用户干扰信道矩阵的零空间正交基，构造每个用户的线性预编码矩阵。Step 105, construct a linear precoding matrix for each user according to the zero-space orthogonal basis of the interference channel matrix of each user.

本步骤中，根据各用户干扰信道矩阵的零空间正交基，构造每个用户的线性预编码矩阵时，可采用多种实现形式。In this step, when constructing the linear precoding matrix of each user according to the zero-space orthogonal basis of the interference channel matrix of each user, various implementation forms may be adopted.

例如，可从上述零空间正交基(如

Figure BSA00000410899400101
)中选择任意nk个列矢量作为用户k的线性预编码矩阵的列矢量。For example, from the above-mentioned null-space orthonormal basis (such as
Figure BSA00000410899400101
) select any n k column vectors as the column vectors of the linear precoding matrix of user k.

又如，可利用

Figure BSA00000410899400102
的零空间正交基(如
Figure BSA00000410899400103
)和用户k的下行信道矩阵Hk构造用户k的零CCI的等效信道矩阵(如
Figure BSA00000410899400104
)；对所述等效信道矩阵进行SVD分解，获取所述等效信道矩阵的右酉矩阵前nk列；对用户k的干扰信道矩阵
Figure BSA00000410899400105
的零空间正交基(如
Figure BSA00000410899400106
)和其相应的等效信道矩阵的右酉矩阵前nk列作相乘运算，将乘积的结果作为用户k的预编码矩阵。As another example, available
Figure BSA00000410899400102
Orthonormal basis of the null space (such as
Figure BSA00000410899400103
) and the downlink channel matrix Hk of user k to construct the equivalent channel matrix of zero CCI of user k (such as
Figure BSA00000410899400104
); The equivalent channel matrix is carried out SVD decomposition, obtains the first n k columns of the right unitary matrix of the equivalent channel matrix; the interference channel matrix of user k
Figure BSA00000410899400105
Orthonormal basis of the null space (such as
Figure BSA00000410899400106
) and the first n k columns of the right unitary matrix of the corresponding equivalent channel matrix are multiplied, and the result of the product is used as the precoding matrix of user k.

再如，可利用

Figure BSA00000410899400107
的零空间正交基(如
Figure BSA00000410899400108
)和用户k的下行信道矩阵Hk构造用户k的零CCI的等效信道矩阵(如
Figure BSA00000410899400109
)；对所述等效信道矩阵的共轭转置矩阵进行QR分解，得到正交矩阵Q1k和上三角矩阵R1k的乘积，获取所述正交矩阵Q1k的前nk列；对所述正交矩阵Q1k的前nk列和用户k的干扰信道矩阵
Figure BSA000004108994001010
的零空间正交基(如)作相乘运算，将乘积的结果作为用户k的预编码矩阵。Again, available
Figure BSA00000410899400107
Orthonormal basis of the null space (such as
Figure BSA00000410899400108
) and the downlink channel matrix H k of user k to construct the equivalent channel matrix of zero CCI of user k (such as
Figure BSA00000410899400109
); performing QR decomposition on the conjugate transpose matrix of the equivalent channel matrix, obtaining the product of the orthogonal matrix Q1 k and the upper triangular matrix R1 k , obtaining the first n k columns of the orthogonal matrix Q1 k ; The first n k columns of the orthogonal matrix Q1 k and the interference channel matrix of user k
Figure BSA000004108994001010
Orthonormal basis of the null space (such as ) is multiplied, and the result of the product is used as the precoding matrix of user k.

步骤106，利用构造的线性预编码矩阵对各个用户的发射信号进行线性预编码。Step 106, use the constructed linear precoding matrix to perform linear precoding on the transmitted signal of each user.

本步骤的具体处理过程可与现有技术中一致，此处不再赘述。The specific processing process of this step may be consistent with that in the prior art, and will not be repeated here.

上面对本发明实施例中的BD预编码方法进行了详细描述，下面再对本发明实施例中的BD预编码装置进行详细描述。The BD precoding method in the embodiment of the present invention has been described in detail above, and the BD precoding apparatus in the embodiment of the present invention will be described in detail below.

参见图2，图2为本发明实施例中BD预编码装置的示例性结构图。与图1所示方法相对应，本发明实施例中的装置包括：总信道矩阵确定模块、QR分解模块、下三角矩阵求逆模块、零空间正交基确定模块、预编码矩阵构造模块和预编码处理模块。Referring to FIG. 2, FIG. 2 is an exemplary structural diagram of a BD precoding apparatus in an embodiment of the present invention. Corresponding to the method shown in Figure 1, the device in the embodiment of the present invention includes: a total channel matrix determination module, a QR decomposition module, a lower triangular matrix inversion module, a null space orthogonal base determination module, a precoding matrix construction module and a precoding matrix construction module. Encoding processing module.

其中，总信道矩阵确定模块用于根据系统中各用户的下行信道矩阵确定总的用户信道矩阵

Figure BSA00000410899400111
其中，Hk为用户k的下行信道矩阵，k＝1，2，…，K，K为系统基站在同一频带范围内同时服务的用户数。Hs的维度为NR×NT。Wherein, the total channel matrix determination module is used to determine the total user channel matrix according to the downlink channel matrix of each user in the system
Figure BSA00000410899400111
Wherein, H k is the downlink channel matrix of user k, k=1, 2, ..., K, K is the number of users simultaneously served by the base station of the system within the same frequency band. The dimension of H s is N R ×N T .

QR分解模块用于对所述总的用户信道矩阵Hs的共轭转置矩阵进行QR分解，得到正交矩阵Q和上三角矩阵R的乘积，即

Figure BSA00000410899400113
将所述Hs表示为下三角矩阵L和正交矩阵Q的共轭转置矩阵QH的乘积，即
Figure BSA00000410899400114
其中，L为上三角矩阵R的共轭转置矩阵RH。The QR decomposition module is used for the conjugate transpose matrix of the total user channel matrix H s Perform QR decomposition to obtain the product of the orthogonal matrix Q and the upper triangular matrix R, namely
Figure BSA00000410899400113
Express said H s as the product of the lower triangular matrix L and the conjugate transpose matrix Q H of the orthogonal matrix Q, namely
Figure BSA00000410899400114
Wherein, L is the conjugate transpose matrix R H of the upper triangular matrix R.

下三角矩阵求逆模块，用于对所述下三角矩阵L进行求逆计算，得到

Figure BSA00000410899400115
其中，
Figure BSA00000410899400116
的维度为NR×nk。The lower triangular matrix inversion module is used to perform inverse calculation on the lower triangular matrix L to obtain
Figure BSA00000410899400115
in,
Figure BSA00000410899400116
The dimension of is N R ×n k .

零空间正交基确定模块用于根据所述QR分解模块得到的正交矩阵Q和所述下三角矩阵求逆模块得到的

Figure BSA00000410899400117
得到各用户干扰信道矩阵的零空间正交基。The null space orthogonal base determination module is used to obtain the orthogonal matrix Q obtained by the QR decomposition module and the lower triangular matrix inversion module.
Figure BSA00000410899400117
The zero-space orthogonal basis of each user's interference channel matrix is obtained.

预编码矩阵构造模块用于根据所述零空间正交基确定模块确定的各用户干扰信道矩阵的零空间正交基，构造每个用户的线性预编码矩阵。The precoding matrix construction module is used to construct a linear precoding matrix for each user according to the zero space orthogonal basis of each user's interference channel matrix determined by the zero space orthogonal basis determination module.

预编码处理模块用于利用所述预编码矩阵构造模块构造的线性预编码矩阵对各个用户的发射信号进行线性预编码。The precoding processing module is configured to perform linear precoding on the transmitted signals of each user using the linear precoding matrix constructed by the precoding matrix construction module.

具体实现时，所述下三角矩阵求逆模块可以直接对下三角矩阵L进行求逆运算，得到下三角矩阵L的逆

Figure BSA00000410899400118
或者，所述下三角矩阵求逆模块也可如图3所示，包括：第一构造子模块、第二构造子模块、第一求逆子模块和第二求逆子模块。During specific implementation, the lower triangular matrix inversion module can directly perform an inverse operation on the lower triangular matrix L to obtain the inverse of the lower triangular matrix L
Figure BSA00000410899400118
Alternatively, the lower triangular matrix inversion module may also be shown in FIG. 3 , including: a first construction submodule, a second construction submodule, a first inversion submodule, and a second inversion submodule.

其中，第一构造子模块用于根据所述下三角矩阵L构造对角矩阵G，所述对角矩阵G的对角元素为所述下三角矩阵L对角元素的倒数。其中，G的维度为NR×NR。Wherein, the first construction sub-module is used to construct a diagonal matrix G according to the lower triangular matrix L, and the diagonal elements of the diagonal matrix G are reciprocals of the diagonal elements of the lower triangular matrix L. Wherein, the dimension of G is N R ×N R .

第二构造子模块用于根据所述下三角矩阵L和所述对角矩阵G，构造单位下三角矩阵

Figure BSA00000410899400119
The second construction submodule is used to construct a unit lower triangular matrix according to the lower triangular matrix L and the diagonal matrix G
Figure BSA00000410899400119

第一求逆子模块用于按照公式

Figure BSA00000410899400122
计算所述下三角矩阵B的逆。其中，I为单位矩阵。The first inversion submodule is used to follow the formula
Figure BSA00000410899400122
Compute the inverse of the lower triangular matrix B. Among them, I is the identity matrix.

第二求逆子模块用于根据L-1＝B-1G，得到所述下三角矩阵L的逆

Figure BSA00000410899400123
其中，
Figure BSA00000410899400124
的维度为NR×nk。The second inversion sub-module is used to obtain the inverse of the lower triangular matrix L according to L -1 =B -1 G
Figure BSA00000410899400123
in,
Figure BSA00000410899400124
The dimension of is N R ×n k .

具体实现时，零空间正交基确定模块可以如图4所示，包括：第一计算子模块和第二计算子模块。During specific implementation, the null space orthogonal base determination module may be shown in FIG. 4 , including: a first calculation submodule and a second calculation submodule.

其中，第一计算子模块用于根据下三角矩阵L的逆

Figure BSA00000410899400125
及正交矩阵Q，得到
Figure BSA00000410899400126
第二计算子模块用于对
Figure BSA00000410899400127
中的各子矩阵
Figure BSA00000410899400128
(k＝1，2，…，K)进行正交化，如施密特正交化，得到的正交基，即得到对应用户k的干扰信道矩阵的零空间正交基。其中，
Figure BSA000004108994001211
的维度为NT×nk。Among them, the first calculation sub-module is used for the inverse of the lower triangular matrix L
Figure BSA00000410899400125
And the orthogonal matrix Q, get
Figure BSA00000410899400126
The second calculation sub-module is used for
Figure BSA00000410899400127
Each sub-matrix in
Figure BSA00000410899400128
(k=1, 2, ..., K) carry out orthogonalization, such as Schmidt orthogonalization, to obtain Orthogonal basis of , that is, the interference channel matrix corresponding to user k is obtained The null-space orthonormal basis of . in,
Figure BSA000004108994001211
The dimension of is N T ×n k .

或者，所述第一计算子模块用于计算所述下三角矩阵求逆模块得到的

Figure BSA000004108994001212
中各个子矩阵
Figure BSA000004108994001213
的正交基
Figure BSA000004108994001214
第二计算子模块用于根据所述正交矩阵Q和所述正交基
Figure BSA000004108994001215
得到任意用户k的干扰信道矩阵
Figure BSA000004108994001216
的零空间正交基
Figure BSA000004108994001217
其中，第一计算子模块可对所述
Figure BSA000004108994001218
中的各个子矩阵
Figure BSA000004108994001219
进行施密特正交化，以得到所述子矩阵
Figure BSA000004108994001220
的正交基
Figure BSA000004108994001221
Alternatively, the first calculation submodule is used to calculate the obtained lower triangular matrix inversion module
Figure BSA000004108994001212
Each sub-matrix in
Figure BSA000004108994001213
Orthogonal basis of
Figure BSA000004108994001214
The second calculation submodule is used for
Figure BSA000004108994001215
Get the interference channel matrix of any user k
Figure BSA000004108994001216
The null-space orthonormal basis of
Figure BSA000004108994001217
Among them, the first calculation sub-module can be used for the
Figure BSA000004108994001218
Each sub-matrix in
Figure BSA000004108994001219
Perform Schmidt orthogonalization to obtain the submatrix
Figure BSA000004108994001220
Orthogonal basis of
Figure BSA000004108994001221

具体实现时，所述预编码矩阵构造模块可从上述零空间正交基(如

Figure BSA000004108994001222
)中选择任意nk个列矢量作为用户k的线性预编码矩阵的列矢量。或者，所述预编码矩阵构造模块也可如图5所示，包括：等效信道矩阵构造子模块和预编码矩阵构造子模块。During specific implementation, the precoding matrix construction module can be obtained from the above-mentioned null space orthogonal basis (such as
Figure BSA000004108994001222
) select any n k column vectors as the column vectors of the linear precoding matrix of user k. Alternatively, the precoding matrix construction module may also be shown in FIG. 5 , including: an equivalent channel matrix construction submodule and a precoding matrix construction submodule.

其中，等效信道矩阵构造子模块用于利用任意用户k干扰信道矩阵

Figure BSA000004108994001223
的零空间正交基(如
Figure BSA000004108994001224
)及用户k的下行信道矩阵Hk构造用户k的零CCI的等效信道矩阵(如
Figure BSA000004108994001225
)。Among them, the equivalent channel matrix construction sub-module is used to use any user k to interfere with the channel matrix
Figure BSA000004108994001223
Orthonormal basis of the null space (such as
Figure BSA000004108994001224
) and the downlink channel matrix H k of user k to construct the equivalent channel matrix of zero CCI of user k (such as
Figure BSA000004108994001225
).

预编码矩阵构造子模块用于对所述等效信道矩阵(如

Figure BSA000004108994001226
)进行SVD分解，获取所述等效信道矩阵的右酉矩阵前nk列；对用户k的干扰信道矩阵
Figure BSA00000410899400131
的零空间正交基(如
Figure BSA00000410899400132
)和其相应的等效信道矩阵的右酉矩阵前nk列作相乘运算，将乘积的结果作为用户k的预编码矩阵。The precoding matrix construction submodule is used for the equivalent channel matrix (such as
Figure BSA000004108994001226
) carry out SVD decomposition to obtain the first n k columns of the right unitary matrix of the equivalent channel matrix; to the interference channel matrix of user k
Figure BSA00000410899400131
Orthonormal basis of the null space (such as
Figure BSA00000410899400132
) and the first n k columns of the right unitary matrix of the corresponding equivalent channel matrix are multiplied, and the result of the product is used as the precoding matrix of user k.

或者，所述预编码矩阵构造子模块也可用于对所述等效信道矩阵的共轭转置矩阵进行QR分解，得到正交矩阵Q1k和上三角矩阵R1k的乘积，获取所述正交矩阵Q1k的前nk列；对所述正交矩阵Q1k的前nk列和用户k的干扰信道矩阵

Figure BSA00000410899400133
的零空间正交基(如
Figure BSA00000410899400134
)作相乘运算，将乘积的结果作为用户k的预编码矩阵。Alternatively, the precoding matrix construction submodule can also be used to perform QR decomposition on the conjugate transpose matrix of the equivalent channel matrix to obtain the product of the orthogonal matrix Q1 k and the upper triangular matrix R1 k , and obtain the orthogonal The first n k columns of matrix Q1 k ; the interference channel matrix for the first n k columns of said orthogonal matrix Q1 k and user k
Figure BSA00000410899400133
Orthonormal basis of the null space (such as
Figure BSA00000410899400134
) is multiplied, and the result of the product is used as the precoding matrix of user k.

以上对本发明实施例中的BD预编码方法及装置进行了详细描述。本发明实施例中的技术方案可用于用户接收天线数和用户进行通信的数据流数相同的情况，也可用于用户接收天线数和用户进行通信的数据流数不相同的情况。对于不相同的情况，只需在接收端进行接收天线的合并处理即可。常用的接收天线处理技术有天线选择技术、MRC(maximum ratio combining)技术和QBC(quantization-based combining)技术。The BD precoding method and device in the embodiments of the present invention have been described in detail above. The technical solutions in the embodiments of the present invention can be used in the case that the number of antennas received by the user is the same as the number of data streams communicated by the user, and can also be used in the case that the number of antennas received by the user is different from the number of data streams communicated by the user. For different situations, it is only necessary to combine the receiving antennas at the receiving end. Commonly used receiving antenna processing technologies include antenna selection technology, MRC (maximum ratio combining) technology and QBC (quantization-based combining) technology.

本发明实施例中通过只对总的用户信道矩阵进行一次QR分解，无需对每个用户的干扰信道矩阵进行QR分解，从而降低了预编码过程中的计算复杂度，提高了预编码效率。In the embodiment of the present invention, only one QR decomposition is performed on the total user channel matrix, and there is no need to perform QR decomposition on the interference channel matrix of each user, thereby reducing the computational complexity in the precoding process and improving the precoding efficiency.

进一步地，本发明中通过对QR分解的下三角矩阵L进行简化的求逆运算，进一步降低了预编码过程中的计算复杂度，提高了预编码效率。Furthermore, in the present invention, by performing a simplified inversion operation on the lower triangular matrix L decomposed by QR, the computational complexity in the precoding process is further reduced, and the precoding efficiency is improved.

下面对本发明实施例中的BD预编码方案与现有技术中的BD预编码方案的复杂度及容量性能进行仿真比较。The following simulates and compares the complexity and capacity performance of the BD precoding scheme in the embodiment of the present invention and the BD precoding scheme in the prior art.

图6为本发明实施例中的BD预编码方案与现有技术中的BD预编码方案的复杂度比较仿真图。如图6所示，传统的BD预编码方案的复杂度最高，基于QR分解的BD预编码方案的复杂度次之。而本发明实施例中的BD预编码方案与之相比较，有明显降低复杂度的性能优势。可以看出，即使在基站所服务的用户数不断增加的情况下，本发明实施例中的BD预编码方案在降低复杂度性能上仍具有明显的优势。Fig. 6 is a comparison simulation diagram of complexity between the BD precoding scheme in the embodiment of the present invention and the BD precoding scheme in the prior art. As shown in Fig. 6, the complexity of the traditional BD precoding scheme is the highest, and the complexity of the BD precoding scheme based on QR decomposition is next. Compared with the BD precoding scheme in the embodiment of the present invention, it has the performance advantage of obviously reducing the complexity. It can be seen that even when the number of users served by the base station is continuously increasing, the BD precoding scheme in the embodiment of the present invention still has obvious advantages in reducing complexity.

图7为在不同的信噪比条件下，本发明实施例中的BD预编码方案与现有技术中的BD预编码方案的容量性能比较仿真图。其中，仿真条件为：基站天线数为6，每个用户的天线数为2，用户数为3，信道模型建模为完美的单径瑞利信道。BS端信号发射功率为1。如图7所示，本发明实施例中的BD预编码方案和现有的BD预编码方案具有相同的系统容量性能。所以，使用本发明实施例中的技术方案进行线性预编码处理，在减少系统算法复杂度的同时，并没有对系统带来性能上的损失。Fig. 7 is a simulation diagram of capacity performance comparison between the BD precoding scheme in the embodiment of the present invention and the BD precoding scheme in the prior art under different signal-to-noise ratio conditions. Among them, the simulation conditions are: the number of base station antennas is 6, the number of antennas for each user is 2, the number of users is 3, and the channel model is modeled as a perfect single-path Rayleigh channel. The transmit power of the signal at the BS is 1. As shown in FIG. 7 , the BD precoding scheme in the embodiment of the present invention has the same system capacity performance as the existing BD precoding scheme. Therefore, using the technical solutions in the embodiments of the present invention to perform linear precoding processing reduces system algorithm complexity and does not bring performance loss to the system.

可见，本发明实施例中的技术方案在保证系统性能不受任何损失的情况，能有效的降低算法复杂度，这无疑能够降低基站侧、尤其能够降低用户端硬件配置的复杂度，此外也符合通信系统设计的原则。It can be seen that the technical solution in the embodiment of the present invention can effectively reduce the complexity of the algorithm without any loss of system performance, which can undoubtedly reduce the complexity of the base station side, especially the hardware configuration of the user end, and also conform to Principles of communication system design.

本领域技术人员可以理解实施例中的装置中的模块可以按照实施例描述分布于实施例的装置中，也可以进行相应变化位于不同于本实施例的一个或多个装置中。上述实施例的模块可以合并为一个模块，也可以进一步拆分成多个子模块。Those skilled in the art can understand that the modules in the device in the embodiment can be distributed in the device in the embodiment according to the description in the embodiment, and can also be changed and located in one or more devices different from the embodiment. The modules in the above embodiments can be combined into one module, and can also be further split into multiple sub-modules.

本发明实施例中的部分步骤，可以利用软件实现，相应的软件程序可以存储在可读取的存储介质中，如光盘或硬盘等。Part of the steps in the embodiments of the present invention can be realized by software, and the corresponding software program can be stored in a readable storage medium, such as an optical disk or a hard disk.

以上所述的具体实施例，对本发明的目的、技术方案和有益效果进行了进一步详细说明，所应理解的是，以上所述仅为本发明的较佳实施例而已，并非用于限定本发明的保护范围，凡在本发明的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。The specific embodiments described above have further described the purpose, technical solutions and beneficial effects of the present invention in detail. It should be understood that the above descriptions are only preferred embodiments of the present invention and are not intended to limit the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principles of the present invention shall be included within the protection scope of the present invention.

Claims (10)

1. A block diagonalizing precoding method, the method comprising:
determining a total user channel matrix according to a downlink channel matrix of each user in the system
Figure FSA00000410899300011
Wherein HkA downlink channel matrix of a user K, where K is 1, 2, …, and K is the number of users served by the system base station in the same frequency band;
for the total user channel momentMatrix HsConjugate transpose matrix of
Figure FSA00000410899300012
QR decomposition is carried out to obtain the product of an orthogonal matrix Q and an upper triangular matrix R, and the total user channel matrix H is obtainedsConjugate transpose matrix Q represented as lower triangular matrix L and orthogonal matrix QHWhere L is the conjugate transpose of the upper triangular matrix RH；
Performing inversion calculation on the lower triangular matrix L to obtain
Figure FSA00000410899300013
According to the inverse of the lower triangular matrix L
Figure FSA00000410899300014
Obtaining a zero space orthogonal base of each user interference channel matrix;
constructing a linear precoding matrix of each user according to a zero-space orthogonal basis of each user interference channel matrix;
and performing linear precoding on the transmitting signals of each user by using the constructed linear precoding matrix.
2. The method of claim 1, wherein the inverse computation of the lower triangular matrix L results in
Figure FSA00000410899300015
The method comprises the following steps:
constructing a diagonal matrix G according to the lower triangular matrix L, wherein diagonal elements of the diagonal matrix G are reciprocal of the diagonal elements of the lower triangular matrix L;
constructing a unit lower triangular matrix B (GL) according to the lower triangular matrix L and the diagonal matrix G;
according to the formulaCalculating the inverse of the unit lower triangular matrix B; wherein I is an identity matrix;
according to L-1＝B-1G, obtaining the inverse of the lower triangular matrix L
Figure FSA00000410899300017
3. The method of claim 1, wherein the inverse of L is based on a lower triangular matrixAnd the orthogonal matrix Q, obtaining the zero space orthogonal basis of each user interference channel matrix comprises:
calculating the said
Figure FSA00000410899300022
In each sub-matrix
Figure FSA00000410899300023
Of (2) orthogonal basis
Figure FSA00000410899300024
According to the orthogonal matrix Q and the orthogonal base
Figure FSA00000410899300025
Obtaining an interference channel matrix for an arbitrary user kZero space orthogonal basis of
4. The method of claim 3, wherein said calculating said
Figure FSA00000410899300028
In each sub-matrix
Figure FSA00000410899300029
Of (2) orthogonal basis
Figure FSA000004108993000210
The method comprises the following steps:
to the above
Figure FSA000004108993000211
Each sub-matrix in
Figure FSA000004108993000212
Performing Schmidt orthogonalization to obtain the sub-matrix
Figure FSA000004108993000213
Of (2) orthogonal basis
Figure FSA000004108993000214
5. The method according to any of claims 1 to 4, wherein said constructing a linear precoding matrix for each user based on the computed zero-space orthogonal basis of the interfering channel matrices of the respective users comprises:
constructing an equivalent channel matrix of zero co-channel interference of a user k by using a zero space orthogonal basis of an interference channel matrix of any user k and a downlink channel matrix of the user k;
and carrying out SVD on the equivalent channel matrix or QR on a conjugate transpose matrix of the equivalent channel matrix, and constructing a precoding matrix of the user k according to a decomposition result.
6. A block diagonalizing precoding apparatus, comprising:
total channel matrix determination module for rootDetermining a total user channel matrix according to a downlink channel matrix of each user in a system
Figure FSA000004108993000215
Wherein HkA downlink channel matrix of a user K, where K is 1, 2, …, and K is the number of users served by the system base station in the same frequency band;
QR decomposition module for said overall user channel matrix HsConjugate transpose matrix of
Figure FSA000004108993000216
QR decomposition is carried out to obtain the product of an orthogonal matrix Q and an upper triangular matrix R, and the H issConjugate transpose matrix Q represented as lower triangular matrix L and orthogonal matrix QHWhere L is the conjugate transpose of the upper triangular matrix RH；
A lower triangular matrix inversion module for performing inversion calculation on the lower triangular matrix L to obtain L - 1 = L ^ 1 L ^ 2 . . . L ^ K ;
Zero space orthogonalityA base determination module for obtaining the orthogonal matrix Q obtained by the QR decomposition module and the lower triangular matrix inversion module
Figure FSA00000410899300031
Obtaining a null space orthogonal basis of each user interference channel matrix;
a precoding matrix constructing module, configured to construct a linear precoding matrix for each user according to the null-space orthogonal basis of each user interference channel matrix determined by the null-space orthogonal basis determining module;
and the precoding processing module is used for performing linear precoding on the transmitting signals of each user by utilizing the linear precoding matrix constructed by the precoding matrix constructing module.
7. The apparatus of claim 6, wherein the lower triangular matrix inversion module comprises:
the first construction submodule is used for constructing a diagonal matrix G according to the lower triangular matrix L, and diagonal elements of the diagonal matrix G are inverses of the diagonal elements of the lower triangular matrix L;
a second constructing submodule, configured to construct a unit lower triangular matrix B ═ GL according to the lower triangular matrix L and the diagonal matrix G;
a first inversion submodule for expressing
Figure FSA00000410899300032
Calculating the inverse of the lower triangular matrix B; wherein I is an identity matrix;
a second inversion submodule for inverting the output signal according to L-1＝B-1G, obtaining the inverse of the lower triangular matrix L L - 1 = L ^ 1 L ^ 2 . . . L ^ K .
8. The apparatus of claim 6, wherein the zero-space orthogonal basis determining module comprises:
a first calculation submodule for calculating the inverse of the lower triangular matrix
Figure FSA00000410899300034
In each sub-matrix
Figure FSA00000410899300035
Of (2) orthogonal basis
Figure FSA00000410899300036
A second computation submodule for computing the orthogonal matrix Q and the orthogonal basis
Figure FSA00000410899300037
Obtaining an interference channel matrix for an arbitrary user k
Figure FSA00000410899300038
Zero space orthogonal basis of
Figure FSA00000410899300039
9. The apparatus of claim 8, wherein the first computation submodule pairs theEach sub-matrix inPerforming Schmidt orthogonalization to obtain the sub-matrix
Figure FSA000004108993000312
Of (2) orthogonal basis
10. The apparatus of any of claims 6-9, wherein the precoding matrix construction module comprises:
the equivalent channel matrix construction submodule is used for constructing an equivalent channel matrix of zero co-channel interference of a user k by utilizing a zero space orthogonal basis of an interference channel matrix of any user k and a downlink channel matrix of the user k;
and the precoding matrix constructing submodule is used for carrying out SVD (singular value decomposition) on the equivalent channel matrix or carrying out QR (quick response) decomposition on a conjugate transpose matrix of the equivalent channel matrix and constructing the precoding matrix of the user k according to a decomposition result.
CN201010622175.8A 2010-12-28 2010-12-28 A kind of block diagonalization method for precoding and device Expired - Fee Related CN102546088B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201010622175.8A CN102546088B (en) 2010-12-28 2010-12-28 A kind of block diagonalization method for precoding and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201010622175.8A CN102546088B (en) 2010-12-28 2010-12-28 A kind of block diagonalization method for precoding and device

Publications (2)

Publication Number Publication Date
CN102546088A true CN102546088A (en) 2012-07-04
CN102546088B CN102546088B (en) 2016-08-24

Family

ID=46352121

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201010622175.8A Expired - Fee Related CN102546088B (en) 2010-12-28 2010-12-28 A kind of block diagonalization method for precoding and device

Country Status (1)

Country Link
CN (1) CN102546088B (en)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103067123A (en) * 2012-12-13 2013-04-24 深圳清华大学研究院 Nonlinear precoding method, device and system based on downlink multiuser-multiple-input single-output (MU-MISO)
CN103346867A (en) * 2013-07-29 2013-10-09 重庆邮电大学 Multi-cell and multi-user co-channel interference suppression method based on triangular decomposition and SLNR (Signal Leakage Noise Ratio) algorithm
CN103888312A (en) * 2014-03-04 2014-06-25 京信通信系统（广州）有限公司 Alarm method and device of pre-distortion system
CN103927290A (en) * 2014-04-18 2014-07-16 南京大学 Inverse operation method for lower triangle complex matrix with any order
CN103957086A (en) * 2014-04-11 2014-07-30 电子科技大学 Achieving method for MU-MIMO precoding
CN103997499A (en) * 2014-05-30 2014-08-20 中国科学技术大学苏州研究院 Matrix QR decomposing method based on matrix privacy protection
CN104021306A (en) * 2014-06-19 2014-09-03 哈尔滨工业大学 Orthogonal basis training method based on Schmidt orthogonalization
CN106789781A (en) * 2017-01-12 2017-05-31 西安电子科技大学 The interference elimination method of block diagonalization precoding is converted based on Givens
CN108111205A (en) * 2016-11-25 2018-06-01 中国电信股份有限公司 Eliminate the method and apparatus disturbed in extensive mimo system between grouping user
CN108123740A (en) * 2016-11-28 2018-06-05 中国电信股份有限公司 The method and apparatus for eliminating inter-user interference using extensive MIMO in HetNet networks
CN108964734A (en) * 2018-06-29 2018-12-07 电子科技大学 A kind of antenna selecting method for nonlinear precoding
CN109088664A (en) * 2018-09-06 2018-12-25 西安电子科技大学 Self-interference suppressing method based on block diagonalization and triangle decomposition
WO2020135534A1 (en) * 2018-12-26 2020-07-02 华为技术有限公司 Precoding method and device and information transmission method and device

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101150877A (en) * 2007-05-09 2008-03-26 中国科学技术大学 An Improved Norm-Based Multi-user Selection Method for Block Diagonalized MIMO Systems
CN101291192A (en) * 2007-04-18 2008-10-22 中兴通讯股份有限公司 Pre-coding method under time division duplex mode with multi-users, MIMO on downlink
CN101374034A (en) * 2007-08-20 2009-02-25 中兴通讯股份有限公司 Down and up multi-user multi-input multi-output pre-coding method and codebook thereof
CN101378282A (en) * 2007-08-31 2009-03-04 中兴通讯股份有限公司 Method and apparatus for processing signal of multi-input multi-output system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101291192A (en) * 2007-04-18 2008-10-22 中兴通讯股份有限公司 Pre-coding method under time division duplex mode with multi-users, MIMO on downlink
CN101150877A (en) * 2007-05-09 2008-03-26 中国科学技术大学 An Improved Norm-Based Multi-user Selection Method for Block Diagonalized MIMO Systems
CN101374034A (en) * 2007-08-20 2009-02-25 中兴通讯股份有限公司 Down and up multi-user multi-input multi-output pre-coding method and codebook thereof
CN101378282A (en) * 2007-08-31 2009-03-04 中兴通讯股份有限公司 Method and apparatus for processing signal of multi-input multi-output system

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103067123B (en) * 2012-12-13 2015-07-29 深圳清华大学研究院 Based on nonlinear precoding method, the Apparatus and system of descending MU-MISO
CN103067123A (en) * 2012-12-13 2013-04-24 深圳清华大学研究院 Nonlinear precoding method, device and system based on downlink multiuser-multiple-input single-output (MU-MISO)
CN103346867A (en) * 2013-07-29 2013-10-09 重庆邮电大学 Multi-cell and multi-user co-channel interference suppression method based on triangular decomposition and SLNR (Signal Leakage Noise Ratio) algorithm
CN103346867B (en) * 2013-07-29 2016-12-28 重庆邮电大学 Multiple cell multi-user's co-channel interference suppression method based on triangle decomposition and SLNR algorithm
CN103888312A (en) * 2014-03-04 2014-06-25 京信通信系统（广州）有限公司 Alarm method and device of pre-distortion system
CN103957086A (en) * 2014-04-11 2014-07-30 电子科技大学 Achieving method for MU-MIMO precoding
CN103957086B (en) * 2014-04-11 2017-03-29 电子科技大学 MU MIMO precoding implementation methods
CN103927290A (en) * 2014-04-18 2014-07-16 南京大学 Inverse operation method for lower triangle complex matrix with any order
CN103997499A (en) * 2014-05-30 2014-08-20 中国科学技术大学苏州研究院 Matrix QR decomposing method based on matrix privacy protection
CN104021306A (en) * 2014-06-19 2014-09-03 哈尔滨工业大学 Orthogonal basis training method based on Schmidt orthogonalization
CN108111205A (en) * 2016-11-25 2018-06-01 中国电信股份有限公司 Eliminate the method and apparatus disturbed in extensive mimo system between grouping user
CN108123740A (en) * 2016-11-28 2018-06-05 中国电信股份有限公司 The method and apparatus for eliminating inter-user interference using extensive MIMO in HetNet networks
CN106789781A (en) * 2017-01-12 2017-05-31 西安电子科技大学 The interference elimination method of block diagonalization precoding is converted based on Givens
CN108964734A (en) * 2018-06-29 2018-12-07 电子科技大学 A kind of antenna selecting method for nonlinear precoding
CN109088664A (en) * 2018-09-06 2018-12-25 西安电子科技大学 Self-interference suppressing method based on block diagonalization and triangle decomposition
CN109088664B (en) * 2018-09-06 2021-02-02 西安电子科技大学 Self-interference suppression method based on block diagonalization and triangular decomposition
WO2020135534A1 (en) * 2018-12-26 2020-07-02 华为技术有限公司 Precoding method and device and information transmission method and device
US11943017B2 (en) 2018-12-26 2024-03-26 Huawei Technologies Co., Ltd. Precoding method and apparatus, and information transmission method and apparatus

Also Published As

Publication number Publication date
CN102546088B (en) 2016-08-24

Similar Documents

Publication Publication Date Title
CN102546088B (en) A kind of block diagonalization method for precoding and device
CN107438957B (en) Method and apparatus for indicating precoder parameters in a wireless communication network
CN103312389B (en) A kind of multiuser interference suppression method, terminal and base station
EP3672095B1 (en) Method and device for indicating and determining precoding matrix
CN101984571B (en) Pre-coding method for multi-user MIMO system
EP2469747B1 (en) Method and device for constructing codebook, method, device and system for precoding
US20220385343A1 (en) Information transmission method and apparatus
CN103825678B (en) A kind of method for precoding amassing 3D MU MIMO based on Khatri Rao
CN106209195A (en) Channel state information acquisition method, channel state information feedback method and device
CN101854236B (en) Method and system for feeding back channel information
TW201212570A (en) A method and system for orthogonalized beamforming in multiple user multiple input multiple output (MU-MIMO) communication systems
CN101252383B (en) System and method of multi-user multi-aerial transmission
CN102710390B (en) The method and apparatus of precoding in a kind of multi-user MIMO system
CN103378945A (en) Pre-coding method for multi-user multi-input multi-output system and apparatus thereof
CN104917559A (en) Precoding matrix index measurement device and method
CN103634071B (en) Pre-coding matrix selection method, device and system
CN102412933B (en) Precoding method and matrix generating device of CoMP (coordinated multi-point) multiple-user MIMO (multiple-input multi output) system
CN101729460A (en) Multi-user precoding method and device
JP2009268106A (en) Method for determining signal to interference plus noise ratio (sinr) and apparatus therefor
CN103117839A (en) Pre-coding method under non-accurate channel information of multi-user multiple-input-multiple-output system
CN109309517B (en) Signal transmission method and device, computer readable storage medium, and base station
CN102957468B (en) MU-MIMO (multi-user multiple-input multiple-output) user pairing method
CN102594489B (en) Pre-coded vector determination method, device, base station and user terminal
CN108462518A (en) Data transmission method and device based on user's scheduling
CN103338066A (en) Multichannel data stream transmission method based on minimum distance maximization criterion

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C41 Transfer of patent application or patent right or utility model
TA01 Transfer of patent application right

Effective date of registration: 20160113

Address after: 610054 No. 2, Jianshe North Road, Chengdu, Sichuan, 4

Applicant after: University of Electronic Science and Technology of China

Address before: 610054 No. 2, Jianshe North Road, Chengdu, Sichuan, 4

Applicant before: University of Electronic Science and Technology of China

Applicant before: NTT Docomo, Inc.

C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160824

Termination date: 20161228