WO2014190461A1

WO2014190461A1 - Coordinated multi-point transmission method and device

Info

Publication number: WO2014190461A1
Application number: PCT/CN2013/076243
Authority: WO
Inventors: 熊雄
Original assignee: 华为技术有限公司
Priority date: 2013-05-27
Filing date: 2013-05-27
Publication date: 2014-12-04
Also published as: CN104321993A; CN104321993B

Abstract

Disclosed are a coordinated multi-point transmission method and device. The calculation amount is reduced by respectively performing matrix decomposition on a downlink channel matrix corresponding to two coordinated points, and a launch weight matrix corresponding to the coordinated points is obtained according to the decomposed downlink channel matrix of the coordinated points, so that the receiving signals of each of the coordinated points, which arrive at a UE side, are partially coherent in direction, and a coherent combination gain is obtained, thereby still ensuring the coherent combination gain under a relatively low computation complexity.

Description

The present invention relates to the field of communications, and in particular, to a method and apparatus for coordinated multipoint transmission.

Background technique

At present, collaborative transmission is the focus of research in the industry. Coordinated Multiple Points (COMP), which is widely studied, is a cooperative transmission. Coordinated points here can be multiple cells, multiple sectors, and multiple Following nodes, different polarized antennas of the same antenna array, and so on.

There are more than 4 ways of cooperative transmission. One of the transmission methods is called Joint Transmission (JT), that is, two coordination points simultaneously transmit signals to the UE. According to whether the signals arriving at the UE are coherent, JT is divided into coherent JTs. And non-coherent JT.

In the joint transmission process, it is necessary to determine the transmission weight of each coordination point (for example, the transmission weight matrix), and perform cooperative transmission according to the transmission weight. At present, the method of determining the transmission weight uses the Global BF (Beamforming) scheme, which is equivalent to forming a large distributed antenna array of antennas of multiple coordination points, that is, combining the downlink channel matrices of the cooperation points, and combining the merged matrix. A Singular Value Decomposition (SVD) operation is performed, and then a transmission weight matrix is obtained from the decomposed matrix.

However, the Global BF scheme has a higher computational complexity and a poor channel capacity. Summary of the invention

technical problem

Embodiments of the present invention provide a method and apparatus for coordinated multipoint transmission to reduce the complexity of determining transmission weights and increase channel capacity.

Technical solution

In a first aspect, a method for coordinated multipoint transmission, the method comprising:

Obtaining a first downlink channel matrix of the first collaboration point and a second downlink channel matrix of the second collaboration point; Performing matrix decomposition on the first downlink channel matrix and the second downlink channel matrix respectively; obtaining the first transmission of the first collaboration point according to the decomposed first downlink channel matrix and the second downlink channel matrix a weight matrix and a second transmission weight matrix of the second collaboration point;

Coordinated multipoint transmission is performed according to the first transmission weight matrix and the second transmission weight matrix. With reference to the first aspect, in a first possible implementation manner of the first aspect, the performing the matrix decomposition on the first downlink channel matrix and the second downlink channel matrix respectively includes:

Performing matrix decomposition on the first downlink channel matrix and the second downlink channel matrix according to the following formula to obtain a first unitary matrix and a second unitary matrix,

H _{1 =} Q[C 0 _A ]U ^fl

H ₂ = Q[S 0 _B ]\ ^H where 1^ and 11 ₂ are the first downlink channel matrix and the second downlink channel matrix, respectively, and! ^ is /^^ matrix, ! ^ is /^^^ matrix; U and V are the first 酉 matrix and the second 酉 matrix, respectively! ! For ^^^ moment

Ρ, V is m ₂ X m ₂ matrix; Q is a non-singular matrix, and Q is a wxw matrix; 0 _A , 0 _B are further divided into a matrix of nm _l -nj and (m ₂ -«), C and S is a /ix/i real diagonal array,

C = diag (c _i ) = diag ( ... c _n ), 0 ≤ ≤...<c _n ≤1

S = diagis^ = diag(s _l ...s _n ), 1≥ 5 ≥...≥ s _n ≥ 0 and, C and S are satisfied

C ² +S ² =I„; and ml and m2 are the number of transmitting antennas of the first cooperation point and the second cooperation point, respectively, n is the number of receiving antennas of the user equipment, and l _n is an ηχη unit matrix. In a second possible implementation manner of the first aspect, the first collaboration point is obtained according to the decomposed first downlink channel matrix and the second downlink channel matrix The first transmission weight matrix and the second transmission weight matrix of the second coordination point, comprising: determining the first transmission weight matrix and the second emission according to the first 酉 matrix U and the second 酉 matrix V obtained after the decomposition a weight matrix, wherein, when the number of data streams is S, the first transmission weight matrix and the second transmission weight matrix are respectively the first s column of the first unitary matrix U and the first s column of the second unitary matrix V .

In a second aspect, a device for coordinated multipoint transmission, the device includes: An acquiring unit, configured to acquire a first downlink channel matrix of the first collaboration point and a second downlink channel matrix of the second collaboration point;

a decomposing unit, configured to respectively perform matrix decomposition on the first downlink channel matrix and the second downlink channel matrix;

a processing unit, configured to obtain, according to the decomposed first downlink channel matrix and the second downlink channel matrix, a first transmit weight matrix of the first collaboration point and a second transmit weight matrix of the second collaboration point And a transmitting unit, configured to perform coordinated multi-point transmission according to the first transmit weight matrix and the second transmit weight matrix.

In conjunction with the second aspect, in a first possible implementation of the second aspect, the decomposition unit is specifically configured to:

H _{1 =} Q[C 0 _A ]U ^H

H ₂ =Q[S 0 _B ]Y ^H

Wherein, 1^ and 11 ₂ are a first downlink channel matrix and a second downlink channel matrix, respectively, and ^ is /^^ matrix, 11 ₂ is nxm ₂ U and V are the first 酉 matrix and the second 酉 matrix, respectively! ! For the ^^^ matrix,

V is a matrix; Q is a non-singular matrix, and Q is a wxw matrix; 0 _A and 0 _B are further divided into 零( _w) and a zero matrix, and both C and S are MX M real diagonal matrices.

C = diag (c _i ) = diag ( ... c _n ), 0<≤...<c _n <1

C ² +S ² =I„; and ml and m2 are the number of transmitting antennas of the first cooperation point and the second cooperation point, respectively, n is the number of receiving antennas of the user equipment, and l _n is an ηχη unit matrix.

In conjunction with the first possible implementation of the second aspect, the second possible implementation of the second aspect In the mode, the processing unit is specifically configured to: determine, according to the first unitary matrix U and the second unitary matrix V obtained after the decomposition, a first transmission weight matrix and a second transmission weight matrix, where, when the number of data streams is In the case of s, the first transmission weight matrix and the second transmission weight matrix are respectively the first s column of the first unitary matrix U and the first s column of the second unitary matrix V. [Advantageous Effects] The present invention provides a method and a device for cooperative multi-point transmission, which respectively perform matrix decomposition on two downlink multi-point corresponding channel matrices to reduce the amount of calculation, and according to the decomposed cooperative multi-point The downlink channel matrix obtains the transmission weight matrix corresponding to the coordinated multi-point, so that the direction of the received signal of each coordinated multi-point reaching the UE side is coherent, and the coherent combining gain is obtained, so that at a lower computational complexity, The coherent combining gain can be guaranteed.

BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are incorporated in the claims Other drawings may also be obtained from these drawings without the use of creative labor.

1 is an application scenario diagram of collaborative transmission;

2 is a flowchart of a method for cooperative multipoint transmission according to an embodiment of the present invention;

FIG. 3 is a structural diagram of a device for cooperative multipoint transmission according to an embodiment of the present invention; FIG.

FIG. 4 is a structural diagram of a device for cooperative multipoint transmission according to an embodiment of the present invention. detailed description

The technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention. Referring to FIG. 1, FIG. 1 is a schematic diagram of an application scenario of cooperative transmission according to an embodiment of the present invention. As shown in Figure 1, it is assumed that two collaboration points perform coordinated transmission to the same user equipment (User Equipment, UE).

In the scenario of Figure 1, two collaboration points jointly transmit to one UE at the same time. The two coordination points need to calculate their respective transmission weight matrix for coordinated multipoint transmission.

The number of transmitting antennas of each coordinated point is different, respectively, "3⁄4 and "3⁄4, the number of receiving antennas of the UE is two downlinks. The downlink channel matrix of the UE is H ₂ , and the transmission weight matrix of the two coordinated points is W ₂ respectively. The transmit signals of the two cooperation points are all X, X is the column vector sxl, s is the number of data streams, and the noise vector of the UE side is N, then the UE receives the signal as:

Y = (H ₁ W ₁ +H ₂ W ₂ )X + N ( 1 )

For the cylindrical model of Figure 1, first write the formula (1) as follows

In the prior art, two cooperation points respectively acquire respective downlink channel matrices, combine two downlink channel matrices, and perform singular value decomposition (SVD) on the combined matrices to obtain respective transmission weights. The matrix and the coordinated multi-point transmission according to the respective transmission weight matrix, the computational complexity of this method is relatively high, and the channel capacity is not good.

In the embodiment of the present invention, two cooperation points respectively acquire respective downlink channel matrices, and respectively perform matrix decomposition on two downlink channel matrices, for example, Generalized Singular Value Decomposition (GSVD), to obtain respective transmission rights. The value matrix is then coordinated multi-point transmission according to the respective transmission weight matrix. This method has a small amount of computation and a high channel capacity.

Referring to FIG. 2, FIG. 2 is a flowchart of a method for cooperative multipoint transmission according to an embodiment of the present invention. As shown in FIG. 2, the method includes the following steps:

Step 201: Acquire a first downlink channel matrix of the first collaboration point and a second downlink channel of the second collaboration point. Road matrix

Step 202: Perform matrix decomposition on the first downlink channel matrix and the second downlink channel matrix, respectively.

Specifically, the matrix is respectively decomposed into the first downlink channel matrix and the second downlink channel matrix, and may be in a GSVD manner, including:

H _{1 =} Q[C 0 _A ]U ^H

H ₂ =Q[S 0 _B ]Y ^H

Wherein, H^PH ₂ is a first downlink channel matrix and a second downlink channel matrix, respectively! ^ is /^^ matrix, ! ^ is /^^^ matrix; U and V are the first 酉 matrix and the second 酉 matrix, respectively! ! For ^^^ moment

P car, V is m ₂ X m ₂ matrix; Q is a non-singular matrix, and Q is a wxw matrix; 0 _A , 0 _B are further divided into ΜΧ ( _ and _WX (m ₂ -«;) zero matrix, C And S are both real diagonal arrays.

C = diag (c _i ) = diag ( ... c _n ), 0<≤...<c _n <1

S = diagis^ = diag(s _l ...s _n ), 1≥ 5 ≥...≥ s _n ≥ 0

And, C and S are satisfied

Step 203: Obtain a first transmit weight matrix of the first collaboration point and a second transmit weight matrix of the second collaboration point according to the decomposed first downlink channel matrix and the second downlink channel matrix.

Specifically, the first transmit weight matrix of the first collaboration point and the second transmit weight matrix of the second collaboration point are obtained according to the decomposed first downlink channel matrix and the second downlink channel matrix. , including:

Determining the first transmission weight matrix and the first 酉 matrix U and the second 酉 matrix V obtained after the decomposition a second transmission weight matrix, wherein, when the number of data streams is S, the first transmission weight matrix and the second transmission weight matrix are respectively the first s column and the second 酉 matrix V of the first unitary matrix U The first s column.

Specifically, if the number of data streams is s ( s ≤ w ), the transmitted weight is

1: ,

W ₂ =V (:, 1:^), that is, the first S columns of the matrices U and V, respectively.

Step 204: Perform coordinated multi-point transmission according to the first transmit weight matrix and the second transmit weight matrix.

In the embodiment of the present invention, the downlink channel matrix of the cooperation point is not merged, but the downlink channel matrix of each cooperation point is separately decomposed, and the transmission weight matrix is obtained according to the decomposed matrix. In this way, the matrix decomposition process is completed.

Moreover, when using this transmission weight matrix, the signal received by the UE is as follows: Y = {H ₁ U (:, l: i) + H ₂ V (:, 1: ί)} Χ + Ν

={Q[C o _A ]u ^H u (:, i:i)+Q[so _B ]\ ^H y(:, ι: }X+N

= {[QI q ₂ ... q^diagic^^c^ + ^ q ₂ ... q _s ] agi )}X + N

= {[q! q ₂ ... q _s ]diag(c _l +s _l ... c _s +i _S )}X + N

As shown in the above formula, the receiving vectors of the two cooperation points reaching the UE are both q _; and are coherent combining.

In addition, the channel gain for each data stream is (ς· ₊ )| _ί · . According to C ² + S ² = I „, the phase difference between (ς· + )|^ is not too large, so that a larger channel capacity can be obtained.

In the prior art, the downlink channel matrix of the cooperation point is combined to obtain a joint channel matrix, and the joint channel matrix [H ₂ ] is subjected to Singular Value Decomposition (SVD).

H ₂ ] = U∑ _r V _r ^H where r is the rank of the matrix [ H ₂ ], l ^ the left singular vector _Ui ( U _f corresponding to r non-zero singular values The left singular matrix consisting of a right singular matrix composed of r non-zero singular values corresponding to the right singular vector _Vi (column). Assuming that the number of data streams is s, the emission weight is y _r (-., i : s), that is, the first s column of v _r

At this time, the signal received by the UE is,

V . .. V + N

Where ^ is the data stream i (the first element of X), σ _; is the singular value of the joint channel matrix. Under this weighting algorithm, the channel gain of each stream is its corresponding singular value σ _; Since the channel gain of each data stream is the singular value _{σ of} its corresponding joint matrix _; and the difference between x X:.2sI

Depending on the correlation of the joint channel, this may cause a difference between the signal to interference-plus-noise ratio (SINR) of the data stream, which affects the channel capacity.

It can be seen that the above embodiment can not only determine the process of determining the transmission weight, but also ensure the coherent combining gain.

That is, the above method performs matrix decomposition on the downlink channel matrices corresponding to the two coordinated multi-points to reduce the amount of calculation, and obtains the transmission weight corresponding to the coordinated multi-point according to the decomposed downlink multi-point downlink channel matrix. The matrix is such that the direction of the received signal of each coordinated multi-point reaching the UE side is coherent, and the coherent combining gain is obtained, so that the coherent combining gain can still be guaranteed at a lower computational complexity. Referring to FIG. 3, FIG. 3 is a structural diagram of a device for cooperative multipoint transmission according to an embodiment of the present invention. As shown in FIG. 3, the device includes the following units:

The obtaining unit 301 is configured to acquire a first downlink channel matrix of the first collaboration point and a second downlink channel matrix of the second collaboration point;

The decomposing unit 302 is configured to separately perform matrix decomposition on the first downlink channel matrix and the second downlink channel matrix;

Specifically, the decomposing unit 302 is specifically configured to:

H _{1 =} Q[C 0 _A ]U ^H

H ₂ =Q[S 0 _B ]V ^H where 1^ and 11 ₂ are the first downlink channel matrix and the second downlink channel matrix, respectively, and! ^ is /^^ matrix, ! ^ is /^^^ matrix; U and V are the first 酉 matrix and the second 酉 matrix, respectively! ! For ^^^ moment

Ρ, V is m ₂ X m ₂ matrix; Q is a non-singular matrix, and Q is a wxw matrix; 0 _A , 0 _B are further divided into a matrix of nm _l -nj and (m ₂ -«), C and S is the "x« real diagonal array,

C = diag (c _i ) = diag ( ... c„ ), 0≤ ≤...<c _n ≤1

S = diag ( _t ) = diag ... s _n ), 1≥ 3⁄4≥...≥s _n ≥ 0 and, C and S are satisfied

C ² + S ² = I „; and ml and m2 are the number of transmitting antennas of the first cooperation point and the second cooperation point, respectively, n is the number of receiving antennas of the user equipment, and l _n is a π χ unit matrix.

Specifically, for (nxm, ), H ₂ ( nxm ₂ ) respectively, generalized singular value decomposition, then there is 酉 The matrices U e C ^miXn and V e and the non-singular matrix Q e C" ^x " make

H _{1 =} Q[C 0 _A ]U ^H

H ₂ =Q[S 0 _B ]V ^H processing unit 303, configured to obtain a first transmission weight matrix of the first coordination point according to the decomposed first downlink channel matrix and the second downlink channel matrix And a second transmission weight matrix of the second collaboration point;

Specifically, the processing unit 303 is specifically configured to:

Determining, according to the first 酉 matrix U and the second 酉 matrix V obtained after the decomposition, the first transmission weight matrix and the second transmission weight matrix, wherein when the number of data streams is s, the first transmission weight matrix And the second transmission weight matrix are the first s column of the first unitary matrix U and the first s column of the second unitary matrix V, respectively.

1: , W ₂ =V (:, 1:^), that is, the front S columns of the matrices U and V are respectively taken.

The transmitting unit 304 is configured to perform coordinated multi-point transmission according to the first transmit weight matrix and the second transmit weight matrix.

At this time, the signal received by the UE can be expressed as follows:

Y = {H ₁ U (:, 1: + H ₂ V (:, l:s)} x + N

={Q[C 0 _A ]U ^ff U (:, l:s) + Q[S 0 _B ]V ^H V (:, 1: }X + N

={[qi q ₂ ··· q ]^3⁄4(c .. + [qi q ₂ ... qJi agO ·Α)}Χ + Ν

= {[qi q ₂ ··· qjiiiagi + s _l ... c _s +s _s )JX + N

s

=∑(c _i +s _i )x _i q _i

As shown in the above formula, the receiving vectors of the two cooperation points reaching the UE are both q, which are coherent combining. In addition, the channel gain for each data stream is ( _ς · + ·)|| _ί . According to C ² + S ² = I, it can be seen that the phase difference between + is not too large, so that a larger channel capacity can be obtained. Compared with the prior art, the signal received by the UE is

0 0 0

["IU ₂ ... U _r ] V ... V-+ N

0 0 0

Where _χ is the data stream ί (the first element of χ), _σ , which is the singular value of the joint channel matrix. Under this weighting algorithm, the channel gain of each stream is its corresponding singular value _σ .

Since the channel gain of each data stream is the singular value _{σ of} its corresponding joint matrix, and the difference depends on the correlation of the joint channel, which may result in a signal-to-interference and noise ratio between data streams.

(Signal to Interference-plus-Noise Ratio, SINR) The difference is 4艮, which affects the channel capacity.

It can be seen that the above coordinated multi-point transmission equipment performs matrix decomposition on the downlink x-signal: .2 sI track matrix corresponding to two coordinated multi-points to reduce the amount of calculation, and according to the decomposed coordinated multi-point downlink channel matrix Obtaining a transmission weight matrix corresponding to the coordinated multi-point, so that the direction of the received signal of each coordinated multi-point reaching the UE side is coherent, and the coherent combining gain is obtained, so that the coherence can be guaranteed at a lower computational complexity. Combine gain.

FIG. 4 is a structural diagram of a device for cooperative multipoint transmission according to an embodiment of the present invention. Referring to FIG. 4, FIG. 4 is a device 400 for cooperative multi-point transmission according to an embodiment of the present invention. The specific embodiment of the present invention does not limit the specific implementation of the device. The device 400 includes:

The processor 401, a communication interface 402, a memory 403, and a bus 404. The processor 401, the communication interface 402, and the memory 403 complete communication with each other via the bus 404. a communication interface 402, configured to communicate with other devices;

The processor 401 is configured to execute program code.

The processor 401 may be a central processing unit (CPU), or an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits configured to implement embodiments of the present invention.

The memory 403 is configured to store program code. The memory 403 may be a volatile memory, a 'J-port random-access memory (RAM), or a non-volatile memory. Read-only memory (ROM), flash memory, hard disk drive (HDD) or solid-state drive (SSD). The processor 401 performs the following methods according to the program code stored in the memory 403: acquiring a first downlink channel matrix of the first cooperation point and a second downlink channel matrix of the second cooperation point; and the first downlink channel matrix and the The two downlink channel matrices are respectively subjected to matrix decomposition; according to the decomposed first downlink channel matrix and the second downlink channel matrix, obtaining a first transmission weight matrix of the first cooperation point and a second cooperation point second Transmit weight matrix;

Coordinated multipoint transmission is performed according to the first transmission weight matrix and the second transmission weight matrix. Performing matrix decomposition on the first downlink channel matrix and the second downlink channel matrix respectively, including:

H _{1 =} Q[C 0 _A ]U ^H

H ₂ = Q[S 0 _B ]\ ^H where ^H l and ^H 2 are the first downlink channel matrix and the second downlink channel matrix, respectively, and are The matrix is " ^xw 3⁄4 matrix; U and V are the first and second 酉 matrices, respectively, and U is a "3⁄4 x "3⁄4 matrix, V is a matrix; Q is a nonsingular matrix, and Q is an "X"matrix; 0 _Α , 0 _β are the zero matrix of " ^χ ("3⁄4 -") and " x (m ₂ - "), respectively (and ₈ are; real diagonal matrix,

C = diag (c _i ) = diag ( ... c _n ), 0 ≤ ≤... < c _n ≤1

S = diag (5·; ) = diag ... s _n ), 1≥ 3⁄4≥...≥s _n ≥ 0 and, C and S are satisfied

C ² + S ² = I„; and _ml and !^ are the number of transmitting antennas of the first cooperation point and the second cooperation point, respectively, _n is the number of receiving antennas of the user equipment, and ¹ "is an X" unit matrix.

Obtaining, according to the decomposed first downlink channel matrix and the second downlink channel matrix, a first transmission weight matrix of the first coordination point and a second transmission weight matrix of the second collaboration point, including: Determining, according to the first 酉 matrix U and the second 酉 matrix V obtained after the decomposition, the first transmission weight matrix and the second transmission weight matrix, wherein when the number of data streams is s, the first transmission weight matrix And the second transmission weight matrix are the first s column of the first unitary matrix U and the first s column of the second unitary matrix V, respectively.

A person skilled in the art can understand that all or part of the process of implementing the above embodiment method can be completed by a computer program to instruct related hardware, and the program can be stored in a computer readable storage medium. In execution, the flow of an embodiment of the methods as described above may be included. The storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

The above is only the preferred embodiment of the present invention, and the scope of the present invention is not limited thereto, and the equivalent changes made by the claims of the present invention are still within the scope of the present invention.

Claims

Claim

A method for cooperative multipoint transmission, the method comprising:

Obtaining a first downlink channel matrix of the first cooperation point and a second downlink channel matrix of the second cooperation point; performing matrix decomposition on the first downlink channel matrix and the second downlink channel matrix respectively; according to the decomposed Determining, by the first downlink channel matrix and the second downlink channel matrix, a first transmission weight matrix of the first coordination point and a second transmission weight matrix of the second cooperation point;

Coordinated multipoint transmission is performed according to the first transmission weight matrix and the second transmission weight matrix.

2. The method according to claim 1, wherein the performing matrix decomposition on the first downlink channel matrix and the second downlink channel matrix respectively comprises:

The first downlink channel matrix and the second downlink channel matrix are respectively matrix-decomposed according to the following formula to obtain a first unitary matrix and a second unitary matrix, H _{1 =} Q[C ο _Α ]υ ^Η

H ₂ =Q[S 0 _B ]V ^H

Wherein, 11 and ₂₁ are respectively a first downlink channel matrix and a second downlink channel matrix, and ^ is a /^^ matrix, ^ is a /^^^ matrix; U and V are a first and second matrix, respectively , and! ;^^^ moment

P car, V is a matrix of m ₂ X m ₂ ; Q is a non-singular matrix, and Q is a wxw matrix; 0 _A , 0 _B are further divided into zero matrices of ΜΧ ( _w) and _WX (m ₂ -«;), Both C and S are /ixM real diagonal arrays,

C = diag (c _i ) = diag ( ... c _n ), 0 ≤ ≤...<c _n ≤1

C ² + S ² = I „; and ml and m2 are the number of transmitting antennas of the first cooperation point and the second cooperation point, respectively, n is the number of receiving antennas of the user equipment, and I _n is a π χ unit matrix.

The method according to claim 2, wherein the first transmission weight matrix of the first coordination point is obtained according to the decomposed first downlink channel matrix and the second downlink channel matrix And a second transmission weight matrix of the second collaboration point, including:

A device for cooperative multi-point transmission, characterized in that the device comprises:

An acquiring unit, configured to acquire a first downlink channel matrix of the first collaboration point and a second downlink channel matrix of the second collaboration point;

The device according to claim 4, wherein the decomposing unit is specifically configured to: perform matrix decomposition on the first downlink channel matrix and the second downlink channel matrix according to the following formula to obtain a first defect Matrix and second matrix,

H _{1 =} Q[C 0 _A ]U ^H

H ₂ =Q[S 0 _B ]V ^H where H^PH ₂ is the first downlink channel matrix and the second downlink channel matrix, respectively, and ^ is a /^^ matrix, ! ^ is /^^^ matrix; U and V are the first 酉 matrix and the second 酉 matrix, respectively! For the moment

Ρ, V is m ₂ X m ₂ matrix; Q is a non-singular matrix, and Q is a wxw matrix; 0 _A , 0 _B are further divided into zero matrix of nm _l -nj and wx( ₂ -/i;), Both C and S are nxw real diagonal arrays.

C = diag ( . ) = diag 0 < < ... < c < 1

S = diagis^ = diag ( ··· ), 1≥ 5 ≥...≥ ≥ 0 And, C and s meet

C ² + S ² = I „; and ml and m2 are the number of transmitting antennas of the first cooperation point and the second cooperation point, respectively, n is the number of receiving antennas of the user equipment, and 1 is the unit matrix of "><«.

The device according to claim 5, wherein the processing unit is specifically configured to: determine, according to the first unitary matrix U and the second unitary matrix V obtained after the decomposition, the first transmission weight matrix and the second a weighting matrix, wherein, when the number of data streams is s, the first transmission weight matrix and the second transmission weight matrix are respectively the first s column of the first unitary matrix U and the front s of the second unitary matrix V Column.