CN104321993B - A kind of method and apparatus of cooperative multipoint transmission - Google Patents
A kind of method and apparatus of cooperative multipoint transmission Download PDFInfo
- Publication number
- CN104321993B CN104321993B CN201380000633.6A CN201380000633A CN104321993B CN 104321993 B CN104321993 B CN 104321993B CN 201380000633 A CN201380000633 A CN 201380000633A CN 104321993 B CN104321993 B CN 104321993B
- Authority
- CN
- China
- Prior art keywords
- matrix
- down channel
- emission value
- channel matrix
- unitary matrice
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/022—Site diversity; Macro-diversity
- H04B7/024—Co-operative use of antennas of several sites, e.g. in co-ordinated multipoint or co-operative multiple-input multiple-output [MIMO] systems
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Radio Transmission System (AREA)
Abstract
The embodiment of the invention discloses a kind of method and apparatus of cooperative multipoint transmission, by carrying out matrix decomposition respectively to the corresponding down channel matrix of two cooperative multi-points, to reduce calculation amount, and the corresponding emission value matrix of the cooperative multi-point is obtained according to the down channel matrix of the cooperative multi-point after decomposition, so that each cooperative multi-point reaches the reception sense partially coherent of the sides UE, and obtain relevant merging gain, so that under lower computation complexity, it can still ensure relevant merging gain.
Description
Technical field
The present invention relates to the communications field more particularly to a kind of method and apparatus of cooperative multipoint transmission.
Background technology
Currently, cooperation transmitting is industry research emphasis, the cooperative multi-point studied extensively（Coordinated Multiple
Points, COMP）It is a kind of cooperation transmitting, cooperation point here（Coordinated Points）Can be multiple cells, more
A sector, multiple relay nodes, same antenna array different poliarizing antennas etc..
The mode of cooperation transmitting has very much, wherein there is a kind of radiation pattern to be known as combining transmitting（Joint
Transmission, JT）, i.e. whether two cooperation points give UE to emit signal, be concerned with according to the signal for reaching UE, JT is divided into simultaneously
For the JT and incoherent JT that is concerned with.
In combining emission process, it is thus necessary to determine that the emission value of each cooperation point（For example, emission value matrix）, and root
Cooperation transmission is carried out according to the emission value.Currently, determining that the mode of emission value uses Global BF（Beamforming）Side
Case is equivalent to the antenna of multiple cooperation points constituting a big distributed aerial array, i.e., by the down channel of cooperation point
Matrix merges, and singular value decomposition is carried out to the matrix after merging（Singular Value Decomposition, SVD）Fortune
It calculates, emission value matrix is then obtained according to the matrix after decomposition.
However, the computational complexity of Global BF schemes is relatively high, and channel capacity and bad.
Invention content
Technical problem
An embodiment of the present invention provides a kind of method and apparatus of cooperative multipoint transmission, and answering for emission value is determined to reduce
Miscellaneous degree simultaneously improves channel capacity.
Technical solution
In a first aspect, a kind of method of cooperative multipoint transmission, the method includes：
Obtain the first down channel matrix of the first cooperation point and the second down channel matrix of the second cooperation point；
Matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix；
According to the first down channel matrix and the second down channel matrix after decomposition, first cooperation point is obtained
The first emission value matrix and the second cooperation point the second emission value matrix；
According to the first emission value matrix and the second emission value matrix, cooperative multipoint transmission is carried out.
With reference to first aspect, described that first downlink is believed in the first possible realization method of first aspect
Road matrix and the second down channel matrix carry out matrix decomposition respectively, including：
Matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix according to following formula,
The first unitary matrice and the second unitary matrice are obtained,
H1=Q[C 0A]UH
H2=Q[S 0B]VH
Wherein, H1And H2Respectively the first down channel matrix and the second down channel matrix, and H1For n × m1Matrix, H2
For n × m2Matrix；U and V is respectively the first unitary matrice and the second unitary matrice, and U is m1×m1Matrix, V m2×m2Matrix；Q is
Nonsingular matrix, and Q is n × n matrix；0A、0BRespectively n × (m1- n) and n × (m2- n) null matrix, C and S are n × n
Real diagonal matrix,
C=diag(ci)=diag(c1…cn),0≤c1≤…≤cn≤1
S=diag(si)=diag(s1…sn),1≥s1≥…≥sn≥0
Also, C and S meets
C2+S2=In；And m1 and m2 are respectively the transmitting antenna number of the first cooperation point and the second cooperation point, n is user equipment
Reception antenna number, InFor n × n unit matrixs.
The possible realization method of with reference to first aspect the first, in second of possible realization method of first aspect
In, the first down channel matrix and the second down channel matrix according to after decomposition obtains first cooperation point
The first emission value matrix and the second cooperation point the second emission value matrix, including：
According to the first unitary matrice U and the second unitary matrice V obtained after decomposition, the first emission value matrix and the second hair are determined
Penetrate weight matrix, wherein when data fluxion is s, the first emission value matrix and the second emission value matrix are respectively
The preceding s row of first unitary matrice U and the preceding s of the second unitary matrice V are arranged.
Second aspect, a kind of equipment of cooperative multipoint transmission, the equipment include：
Acquiring unit, the second downlink letter of the first down channel matrix and the second cooperation point for obtaining the first cooperation point
Road matrix；
Resolving cell, for dividing into row matrix respectively the first down channel matrix and the second down channel matrix
Solution；
Processing unit, for according to the first down channel matrix and the second down channel matrix after decomposition, obtaining
First emission value matrix of first cooperation point and the second emission value matrix of the second cooperation point；
Transmission unit, for according to the first emission value matrix and the second emission value matrix, carrying out cooperative multi-point
Transmission.
In conjunction with second aspect, in the first possible realization method of second aspect, the resolving cell is specifically used for：
Matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix according to following formula,
The first unitary matrice and the second unitary matrice are obtained,
H1=Q[C 0A]UH
H2=Q[S 0B]VH
Wherein, H1And H2Respectively the first down channel matrix and the second down channel matrix, and H1For n × m1Matrix, H2
For n × m2；U and V is respectively the first unitary matrice and the second unitary matrice, and U is m1×m1Matrix, V m2×m2Matrix；Q is non-strange
Different matrix, and Q is n × n matrix；0A、0BRespectively n × (m1- n) and n × (m2- n) null matrix, C and S are that n × n is right in fact
Angle battle array,
C=diag(ci)=diag(c1…cn),0≤c1≤…≤cn≤1
S=diag(si)=diag(s1…sn),1≥s1≥…≥sn≥0
Also, C and S meets
C2+S2=In；And m1 and m2 are respectively the transmitting antenna number of the first cooperation point and the second cooperation point, n is user equipment
Reception antenna number, InFor n × n unit matrixs.
In conjunction with the first possible realization method of second aspect, in second of possible realization method of second aspect
In, the processing unit is specifically used for：
According to the first unitary matrice U and the second unitary matrice V obtained after decomposition, the first emission value matrix and the second hair are determined
Penetrate weight matrix, wherein when data fluxion is s, the first emission value matrix and the second emission value matrix are respectively
The preceding s row of first unitary matrice U and the preceding s of the second unitary matrice V are arranged.
Advantageous effect
The present invention provides a kind of method and apparatus of cooperative multipoint transmission, by the corresponding downlink of two cooperative multi-points
Channel matrix carries out matrix decomposition respectively, to reduce calculation amount, and according to the down channel square of the cooperative multi-point after decomposition
Battle array obtains the corresponding emission value matrix of the cooperative multi-point so that each cooperative multi-point reaches the reception sense part of the sides UE
It is relevant, and relevant merging gain is obtained, so that under lower computation complexity, it can still ensure that relevant merging increases
Benefit.
Description of the drawings
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
Obtain other attached drawings according to these attached drawings.
Fig. 1 is a kind of application scenario diagram of cooperation transmitting；
Fig. 2 is a kind of method flow diagram of cooperative multipoint transmission provided in an embodiment of the present invention；
Fig. 3 is a kind of equipment structure chart of cooperative multipoint transmission provided in an embodiment of the present invention；
Fig. 4 is a kind of equipment structure chart of cooperative multipoint transmission provided in an embodiment of the present invention.
Specific implementation mode
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other without creative efforts
Embodiment shall fall within the protection scope of the present invention.
With reference to figure 1, Fig. 1 is a kind of application scenario diagram of cooperation transmitting provided in an embodiment of the present invention.As shown in Figure 1, false
If two cooperation points are to the same user equipment（User Equipment, UE）Carry out cooperation transmitting.
Under the scene of Fig. 1, two cooperation points carry out joint transmitting to a UE simultaneously, and two cooperation points need to calculate each
From emission value matrix, carry out cooperative multipoint transmission.
Each cooperation point transmitting antenna number is different, respectively m1And m2, the reception antenna number of UE is n, and two cooperation points arrive UE's
Down channel matrix is respectively H1、H2, the emission value matrix of two cooperation points is respectively W1、W2, the transmitting signal of two cooperation points is equal
It is column vector s × 1 for X, X, s is data fluxion, and the noise vector of the sides UE is N, then UE receptions signal is：
Y=(H1W1+H2W2)X+N （1）
For the simplified model of Fig. 1, first by formula（1）It is written as form
In the prior art, two cooperation points obtain respective down channel matrix respectively, by two down channel matrixes
It is combined, and singular value decomposition is carried out to the matrix after combination（Singular Value Decomposition, SVD）It obtains
Respective emission value matrix carries out cooperative multipoint transmission further according to respective emission value matrix, and the operation of this method is multiple
Miscellaneous degree is relatively high, and channel capacity is bad.
In embodiments of the present invention, two cooperation points obtain respective down channel matrix respectively, to two down channels
Matrix does matrix decomposition respectively, for example, generalized singular value decomposition（Generalized Singular Value
Decomposition, GSVD）, respective emission value matrix is obtained, is cooperated further according to respective emission value matrix more
Point transmission, the operand of this method is small, and channel capacity is high.
With reference to figure 2, Fig. 2 is a kind of method flow diagram of cooperative multipoint transmission provided in an embodiment of the present invention.Such as Fig. 2 institutes
Show, the described method comprises the following steps：
Step 201, the second down channel square of the first down channel matrix and the second cooperation point of the first cooperation point is obtained
Battle array；
Step 202, matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix；
Specifically, described carry out matrix decomposition respectively to the first down channel matrix and the second down channel matrix,
The mode of GSVD may be used, including：
Matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix according to following formula,
The first unitary matrice and the second unitary matrice are obtained,
H1=Q[C 0A]UH
H2=Q[S 0B]VH
Wherein, H1And H2Respectively the first down channel matrix and the second down channel matrix, and H1For n × m1Matrix, H2
For n × m2Matrix；U and V is respectively the first unitary matrice and the second unitary matrice, and U is m1×m1Matrix, V m2×m2Matrix；Q is
Nonsingular matrix, and Q is n × n matrix；0A、0BRespectively n × (m1- n) and n × (m2- n) null matrix, C and S are n × n
Real diagonal matrix,
C=diag(ci)=diag(c1…cn),0≤c1≤…≤cn≤1
S=diag(si)=diag(s1…sn),1≥s1≥…≥sn≥0
Also, C and S meets
C2+S2=In；And m1 and m2 are respectively the transmitting antenna number of the first cooperation point and the second cooperation point, n is user equipment
Reception antenna number, InFor n × n unit matrixs.
Step 203, according to the first down channel matrix and the second down channel matrix after decomposition, described is obtained
First emission value matrix of one cooperation point and the second emission value matrix of the second cooperation point；
Specifically, the first down channel matrix and the second down channel matrix according to after decomposition, obtains institute
The first emission value matrix of the first cooperation point and the second emission value matrix of the second cooperation point are stated, including：
According to the first unitary matrice U and the second unitary matrice V obtained after decomposition, the first emission value matrix and the second hair are determined
Penetrate weight matrix, wherein when data fluxion is s, the first emission value matrix and the second emission value matrix are respectively
The preceding s row of first unitary matrice U and the preceding s of the second unitary matrice V are arranged.
Specifically, assuming that data fluxion is s（s≤n）, then emission value is W1=U(:,1:s)、W2=V(:,1:S), that is, divide
The preceding s of unitary matrice U and V is not taken to arrange.
Step 204, according to the first emission value matrix and the second emission value matrix, cooperative multipoint transmission is carried out.
The embodiment of the present invention no longer merges the down channel matrix of cooperation point, but respectively to each cooperation point
Down channel matrix is decomposed, and emission value matrix is obtained according to the matrix after decomposition.With this, matrix decomposition mistake is simplified
Journey.
And when using this emission value matrix, UE received signals are as follows：
As shown in above formula, the received vector that two cooperation points reach UE is qi, merge to be relevant.
In addition, the channel gain of each data flow is (ci+si)||qi||.According to C2+S2=InIt is found that (ci+si)||qi||
Between differ not too large, therefore larger channel capacity can be obtained.
And in the prior art, the down channel matrix of cooperation point is merged, combined channel matrix is obtained, and to joint
Channel matrix [H1 H2] carry out singular value decomposition（Singular Value Decomposition, SVD）, obtain
Wherein r is matrix [H1 H2] order, UrBy the corresponding left singular vector u of r non-zero singular valuei（UrRow）Composition
Left singular matrix, VrBy the corresponding right singular vector v of r non-zero singular valuei（VrRow）The right singular matrix of composition.
At this point, UE received signals are,
Wherein, xiFor data flow i（I-th of element of X）, σiFor the singular value of combined channel matrix.Under this Weights-selected Algorithm,
The channel gain each flowed is its corresponding singular value σi。
Since the channel gain of each data flow corresponds to the singular value σ of confederate matrix for iti, and σiBetween difference depend on
The correlation of combined channel, this may can cause the signal between data flow and interference and noise ratio (Signal to
Interference-plus-Noise Ratio, SINR) difference is very big, influence channel capacity.
As it can be seen that above example can not only simplify the determination process of emission value, but also it ensure that relevant merging gain.
That is above method by carrying out matrix decomposition respectively to the corresponding down channel matrix of two cooperative multi-points, to reduce
Calculation amount, and the corresponding emission value of the cooperative multi-point is obtained according to the down channel matrix of the cooperative multi-point after decomposition
Matrix so that each cooperative multi-point reaches the reception sense partially coherent of the sides UE, and obtains relevant merging gain, to make
It obtains under lower computation complexity, can still ensure relevant merging gain.
With reference to figure 3, Fig. 3 is a kind of equipment structure chart of cooperative multipoint transmission provided in an embodiment of the present invention.Such as Fig. 3 institutes
Show, the equipment includes with lower unit：
Acquiring unit 301, for obtaining under the first down channel matrix of the first cooperation point and the second of the second cooperation point
Row channel matrix；
Resolving cell 302 is used for the first down channel matrix and the second down channel matrix respectively into row matrix
It decomposes；
Specifically, the resolving cell 302 is specifically used for：
Matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix according to following formula,
The first unitary matrice and the second unitary matrice are obtained,
H1=Q[C 0A]UH
H2=Q[S 0B]VH
Wherein, H1And H2Respectively the first down channel matrix and the second down channel matrix, and H1For n × m1Matrix, H2
For n × m2Matrix；U and V is respectively the first unitary matrice and the second unitary matrice, and U is m1×m1Matrix, V m2×m2Matrix；Q is
Nonsingular matrix, and Q is n × n matrix；0A、0BRespectively n × (m1- n) and n × (m2- n) null matrix, C and S are n × n
Real diagonal matrix,
C=diag(ci)=diag(c1…cn),0≤c1≤…≤cn≤1
S=diag(si)=diag(s1…sn),1≥s1≥…≥sn≥0
Also, C and S meets
C2+S2=In；And m1 and m2 are respectively the transmitting antenna number of the first cooperation point and the second cooperation point, n is user equipment
Reception antenna number, InFor n × n unit matrixs.
The embodiment of the present invention no longer merges the down channel matrix of cooperation point, but respectively to each cooperation point
Down channel matrix is decomposed, and emission value matrix is obtained according to the matrix after decomposition.With this, matrix decomposition mistake is simplified
Journey.
Specifically, to H1（n×m1）、H2（n×m2）Generalized singular value decomposition is carried out respectively, then there is unitary matrice
WithAnd nonsingular matrix Q ∈ Cn×nSo that
H1=Q[C 0A]UH
H2=Q[S 0B]VH
Processing unit 303, for according to the first down channel matrix and the second down channel matrix after decomposition, obtaining
To the first emission value matrix of first cooperation point and the second emission value matrix of the second cooperation point；
Specifically, the processing unit 303 is specifically used for：
According to the first unitary matrice U and the second unitary matrice V obtained after decomposition, the first emission value matrix and the second hair are determined
Penetrate weight matrix, wherein when data fluxion is s, the first emission value matrix and the second emission value matrix are respectively
The preceding s row of first unitary matrice U and the preceding s of the second unitary matrice V are arranged.
Specifically, assuming that data fluxion is s（s≤n）, then emission value is W1=U(:,1:s)、W2=V(:,1:S), that is, divide
The preceding s of unitary matrice U and V is not taken to arrange.
Transmission unit 304, for according to the first emission value matrix and the second emission value matrix, being cooperated more
Point transmission.
At this point, UE received signals can be indicated with such as under type：
As shown in above formula, the received vector that two cooperation points reach UE is qi, merge to be relevant.
In addition, the channel gain of each data flow is (ci+si)||qi||.According to C2+S2=InIt is found that (ci+si)||qi||
Between differ not too large, therefore larger channel capacity can be obtained.
The prior art is compared, UE received signals are
Wherein, xiFor data flow i（I-th of element of X）, σiFor the singular value of combined channel matrix.Under this Weights-selected Algorithm,
The channel gain each flowed is its corresponding singular value σi。
Since the channel gain of each data flow corresponds to the singular value σ of confederate matrix for iti, and σiBetween difference depend on
The correlation of combined channel, this may can cause the signal between data flow and interference and noise ratio (Signal to
Interference-plus-Noise Ratio, SINR) difference is very big, influence channel capacity.
As it can be seen that the above cooperative multipoint transmission equipment, by the corresponding down channel matrix of two cooperative multi-points respectively into
Row matrix is decomposed, and to reduce calculation amount, and obtains the cooperation according to the down channel matrix of the cooperative multi-point after decomposition
The corresponding emission value matrix of multiple spot so that each cooperative multi-point reaches the reception sense partially coherent of the sides UE, and obtains
It is relevant to merge gain, so that under lower computation complexity, it can still ensure relevant merging gain.
Fig. 4 is a kind of equipment structure chart of cooperative multipoint transmission provided in an embodiment of the present invention.With reference to figure 4, Fig. 4 is this hair
A kind of equipment 400 for cooperative multipoint transmission that bright embodiment provides, the specific embodiment of the invention is not to the specific of the equipment
Realization limits.The equipment 400 includes：
Processor 401, communication interface (Communications Interface) 402, memory (memory) 403, always
Line 404.
Processor 401, communication interface 402, memory 403 complete mutual communication by bus 404.
Communication interface 402, for being communicated with other equipment；
Processor 401, for executing program code.
Processor 401 may be a central processing unit（Central processing unit, CPU）Or it is specific
Integrated circuit ASIC（Application Specific Integrated Circuit）, or be arranged to implement this hair
One or more integrated circuits of bright embodiment.
Memory 403, for storing program code.Memory 403 can be volatile memory（volatile
memory）, such as random access memory（Random-access memory, RAM）Or nonvolatile memory（non-
volatile memory）, such as read-only memory（Read-only memory, ROM）, flash memory（flash
memory）, hard disk（Hard disk drive, HDD）Or solid state disk（Solid-state drive, SSD）.Processor 401
According to the program code that memory 403 stores, following methods are executed：
Obtain the first down channel matrix of the first cooperation point and the second down channel matrix of the second cooperation point；
Matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix；
According to the first down channel matrix and the second down channel matrix after decomposition, first cooperation point is obtained
The first emission value matrix and the second cooperation point the second emission value matrix；
According to the first emission value matrix and the second emission value matrix, cooperative multipoint transmission is carried out.
It is described that matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix, including：
Matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix according to following formula,
The first unitary matrice and the second unitary matrice are obtained,
H1=Q[C 0A]UH
H2=Q[S 0B]VH
Wherein, H1And H2Respectively the first down channel matrix and the second down channel matrix, and H1For n × m1Matrix, H2
For n × m2Matrix；U and V is respectively the first unitary matrice and the second unitary matrice, and U is m1×m1Matrix, V m2×m2Matrix；Q is
Nonsingular matrix, and Q is n × n matrix；0A、0BRespectively n × (m1- n) and n × (m2- n) null matrix, C and S are n × n
Real diagonal matrix,
C=diag(ci)=diag(c1…cn),0≤c1≤…≤cn≤1
S=diag(si)=diag(s1…sn),1≥s1≥…≥sn≥0
Also, C and S meets
C2+S2=In；And m1 and m2 are respectively the transmitting antenna number of the first cooperation point and the second cooperation point, n is user equipment
Reception antenna number, InFor n × n unit matrixs.
The first down channel matrix and the second down channel matrix according to after decomposition obtains first association
Make the second emission value matrix of the first emission value matrix and the second cooperation point of point, including：
According to the first unitary matrice U and the second unitary matrice V obtained after decomposition, the first emission value matrix and the second hair are determined
Penetrate weight matrix, wherein when data fluxion is s, the first emission value matrix and the second emission value matrix are respectively
The preceding s row of first unitary matrice U and the preceding s of the second unitary matrice V are arranged.
One of ordinary skill in the art will appreciate that realizing all or part of flow in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the program can be stored in a computer read/write memory medium
In, the program is when being executed, it may include such as the flow of the embodiment of above-mentioned each method.Wherein, the storage medium can be magnetic
Dish, CD, read-only memory（Read-Only Memory, ROM）Or random access memory（Random Access
Memory, abbreviation RAM）Deng.
The above disclosure is only the preferred embodiments of the present invention, cannot limit the right model of the present invention with this certainly
It encloses, therefore equivalent changes made in accordance with the claims of the present invention, is still within the scope of the present invention.
Claims (4)
1. a kind of method of cooperative multipoint transmission, which is characterized in that the method includes：
Obtain the first down channel matrix of the first cooperation point and the second down channel matrix of the second cooperation point；
Matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix；
According to the first down channel matrix and the second down channel matrix after decomposition, the of first cooperation point is obtained
Second emission value matrix of one emission value matrix and the second cooperation point；
According to the first emission value matrix and the second emission value matrix, cooperative multipoint transmission is carried out；
It is described that matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix, including：
Matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix according to following formula, is obtained
First unitary matrice and the second unitary matrice,
H1=Q [C 0A]UH
H2=Q [S 0B]VH
Wherein, H1And H2Respectively the first down channel matrix and the second down channel matrix, and H1For n × m1Matrix, H2For n ×
m2Matrix；U and V is respectively the first unitary matrice and the second unitary matrice, and U is m1×m1Matrix, V m2×m2Matrix；Q is nonsingular
Matrix, and Q is n × n matrix；0A、0BRespectively n × (m1- n) and n × (m2- n) null matrix, C and S are that n × n is diagonal in fact
Battle array,
C=diag (ci)=diag (c1...cn),0≤c1≤...≤cn≤1
S=diag (si)=diag (s1...sn),1≥s1≥...≥sn≥0
Also, C and S meets
C2+S2=In；And m1 and m2 are respectively the transmitting antenna number of the first cooperation point and the second cooperation point, n is connecing for user equipment
Receive antenna number, InFor n × n unit matrixs.
2. according to the method described in claim 1, it is characterized in that, the first down channel matrix according to after decomposition
With the second down channel matrix, the first emission value matrix of first cooperation point and the second transmitting of the second cooperation point are obtained
Weight matrix, including：
According to the first unitary matrice U and the second unitary matrice V obtained after decomposition, the first emission value matrix and the second Launch Right are determined
Value matrix, wherein when data fluxion is s, the first emission value matrix and the second emission value matrix are respectively first
The preceding s row of unitary matrice U and the preceding s of the second unitary matrice V are arranged.
3. a kind of equipment of cooperative multipoint transmission, which is characterized in that the equipment includes：
Acquiring unit, the second down channel square of the first down channel matrix and the second cooperation point for obtaining the first cooperation point
Battle array；
Resolving cell, for carrying out matrix decomposition respectively to the first down channel matrix and the second down channel matrix；
Processing unit, it is described for according to the first down channel matrix and the second down channel matrix after decomposition, obtaining
First emission value matrix of the first cooperation point and the second emission value matrix of the second cooperation point；
Transmission unit, for according to the first emission value matrix and the second emission value matrix, carrying out cooperative multipoint transmission；
The resolving cell is specifically used for：
Matrix decomposition is carried out respectively to the first down channel matrix and the second down channel matrix according to following formula, is obtained
First unitary matrice and the second unitary matrice,
H1=Q [C 0A]UH
H2=Q [S 0B]VH
Wherein, H1And H2Respectively the first down channel matrix and the second down channel matrix, and H1For n × m1Matrix, H2For n ×
m2Matrix；U and V is respectively the first unitary matrice and the second unitary matrice, and U is m1×m1Matrix, V m2×m2Matrix；Q is nonsingular
Matrix, and Q is n × n matrix；0A、0BRespectively n × (m1- n) and n × (m2- n) null matrix, C and S are that n × n is diagonal in fact
Battle array,
C=diag (ci)=diag (c1...cn),0≤c1≤...≤cn≤1
S=diag (si)=diag (s1...sn),1≥s1≥...≥sn≥0
Also, C and S meets
C2+S2=In；And m1 and m2 are respectively the transmitting antenna number of the first cooperation point and the second cooperation point, n is connecing for user equipment
Receive antenna number, InFor n × n unit matrixs.
4. equipment according to claim 3, which is characterized in that the processing unit is specifically used for：
According to the first unitary matrice U and the second unitary matrice V obtained after decomposition, the first emission value matrix and the second Launch Right are determined
Value matrix, wherein when data fluxion is s, the first emission value matrix and the second emission value matrix are respectively first
The preceding s row of unitary matrice U and the preceding s of the second unitary matrice V are arranged.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2013/076243 WO2014190461A1 (en) | 2013-05-27 | 2013-05-27 | Coordinated multi-point transmission method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104321993A CN104321993A (en) | 2015-01-28 |
| CN104321993B true CN104321993B (en) | 2018-07-13 |
Family
ID=51987826
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201380000633.6A Active CN104321993B (en) | 2013-05-27 | 2013-05-27 | A kind of method and apparatus of cooperative multipoint transmission |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN104321993B (en) |
| WO (1) | WO2014190461A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113972934B (en) * | 2020-07-22 | 2023-09-08 | 华为技术有限公司 | Data transmission method, device and system and readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101882951A (en) * | 2009-05-05 | 2010-11-10 | 普天信息技术研究院有限公司 | Multi-cell joint transmission method |
| CN102055563A (en) * | 2010-12-24 | 2011-05-11 | 清华大学 | Adaptive joint linear precoding method applicable to multi-base station coordination |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101378277B (en) * | 2007-08-29 | 2016-04-06 | 上海贝尔股份有限公司 | Multi-user pre-coding and dispatching method and realize the base station of the method |
| CN101820334B (en) * | 2009-12-29 | 2012-11-07 | 北京邮电大学 | Method and equipment for feeding back unitary matrix |
| CN102332946B (en) * | 2011-10-13 | 2014-12-17 | 西安电子科技大学 | Cooperated multipoint (CoMP) downlink joint transmission method capable of eliminating inter-cell interference and inter-flow interference at same time |
-
2013
- 2013-05-27 CN CN201380000633.6A patent/CN104321993B/en active Active
- 2013-05-27 WO PCT/CN2013/076243 patent/WO2014190461A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101882951A (en) * | 2009-05-05 | 2010-11-10 | 普天信息技术研究院有限公司 | Multi-cell joint transmission method |
| CN102055563A (en) * | 2010-12-24 | 2011-05-11 | 清华大学 | Adaptive joint linear precoding method applicable to multi-base station coordination |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104321993A (en) | 2015-01-28 |
| WO2014190461A1 (en) | 2014-12-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106209195B (en) | Channel state information acquisition method, channel state information feedback method and device | |
| EP3094010A1 (en) | Coordinated beamforming method and apparatus based on partial interference alignment | |
| JP7412461B2 (en) | Transmission system using channel estimation based on neural networks | |
| CN110870216B (en) | Beam forming method and device | |
| EP3298430B1 (en) | Direct closed-form covariance matrix and finite alphabet constant-envelope waveforms for planar array beampatterns | |
| CN106575989A (en) | Data transmission method and apparatus | |
| CN105450343B (en) | A kind of method, apparatus and system of precoding | |
| JP6723369B2 (en) | Feedback information transmission method and apparatus | |
| CN105203989B (en) | A kind of method of estimation of L-type array coherent signal direction of arrival | |
| CN104321993B (en) | A kind of method and apparatus of cooperative multipoint transmission | |
| CN108462519A (en) | A kind of channel state information feedback method, UE and access network entity | |
| CN112054824B (en) | Channel measurement method and communication device | |
| WO2015016331A1 (en) | A computer implemented simulator and method | |
| CN103580813B (en) | A kind of minizone multi-antenna cooperative system interference channel codebook method and device | |
| CN107872262B (en) | Method and device for improving data forming gain, base station and communication system | |
| CN114355293A (en) | Self-adaptive beam generation method and system | |
| CN114499612A (en) | Beam forming processing method and device and readable storage medium | |
| CN107135026A (en) | Robust ada- ptive beamformer method based on matrix reconstruction in the presence of unknown mutual coupling | |
| CN112260735A (en) | Codebook determination method, terminal and storage medium | |
| CN112311489A (en) | Method and device for determining channel transmission matrix and storage medium | |
| KR20150090822A (en) | Simultaneous Nulling and Beamfocusing from Disparate Antennas | |
| CN111669189B (en) | Signal detection method and device | |
| CN113872650B (en) | Wireless communication method, device, equipment, system and storage medium | |
| US12021667B2 (en) | Transmission system with channel estimation based on a neural network | |
| CN102035624A (en) | Pre-coding method and device based on dual-space time transmit diversity (STTD) system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |