CN102438260B - A kind of generation method of collaboration region, device and terminal device - Google Patents
A kind of generation method of collaboration region, device and terminal device Download PDFInfo
- Publication number
- CN102438260B CN102438260B CN201110278637.3A CN201110278637A CN102438260B CN 102438260 B CN102438260 B CN 102438260B CN 201110278637 A CN201110278637 A CN 201110278637A CN 102438260 B CN102438260 B CN 102438260B
- Authority
- CN
- China
- Prior art keywords
- base station
- adjacent base
- gain
- edge customer
- precoding vector
- 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
Abstract
The invention discloses a kind of generation method of collaboration region, device and terminal device, including：Each base station calculates the cooperative gain between each adjacent base station respectively, and interact the mutual cooperative gain being each calculated with each adjacent base station, wherein, the user throughput upper limit that the cooperative gain is equal under cooperation mode subtracts the user throughput under non tie up system；Each base station each adjacent base station is calculated respectively be sent to the cooperative gain of adjacent base station with from receive cooperative gain of the adjacent base station and, select to send cooperation to cooperative gain and maximum adjacent base station and ask.The present invention improves CoMP cooperative gains, and cooperate the feedback of the edge customer in set is the cooperative gain with adjacent sectors, and in the collaboration set conjunction generation method for aiding in network to determine with user in contrast scheme, user needs to feed back.
Description
Technical field
The present invention relates to cooperative multipoint transmission and reception technique field, more particularly to a kind of generation method of collaboration region,
Device and terminal device.
Background technology
Cooperative multipoint transmission and reception (CoMP) technology are to be based on collaboration MIMO (Multiple Input Multiple
Output, multiple-input and multiple-output) concept propose a kind of technology, it can be effectively improved community marginal user performance, according to
The data for being transmitted to particular UE (User Equipment, user equipment) are all bases in serving BS or cooperation set
Stand, can be cooperative scheduling, beam shaping technology (CS/CB) and joint processing technology (JP) by descending CoMP points.
In CoMP system, cooperation is carried out between all cells can provide very big cell edge and average system frequency
Utilization rate is composed, still, if the data sharing in all base stations, CSI (channel condition information) needs very high passback to hold
Amount, complexity are too high-leveled and difficult in realization.To reduce complexity, cooperation can only be carried out between a limited number of cell, therefore, it is necessary to
Determine which cell (sector) forms a cooperation set and what principle to form the cooperation set according to.
CoMP collaboration sets, which close generation method, at present following sorting criterion：
According to the changeability of set, it is divided into static cooperation set and dynamic cooperative set.
According to the determining method of set generation, it is divided into network decision, user's decision and user and aids in network to determine, three's
Definition is respectively：
1) network determines：According to the statistical information such as the radiofrequency characteristicses of neighbor cell, network planning scheme generation association in network
Work is gathered.
2) user determines：All users are required to letters such as the received interfered cell set of serving cell report
Breath, cooperation set is then divided according to report information.
3) user aids in network to determine：Network provides the candidate scheme of some cooperation set in advance, further according to user report
The feedback such as interference information, final cooperation set is determined by network.
The division to cooperation set mainly has following several ways at present：
Method 1：Fixed (network decision) cooperation set；
Fixed (network decisions) cooperate set be called do it is network-centric.Identical is used to user all in set
Cooperation set allocation plan, is usually static cooperation set.Fixed cooperation set considers the network planning, and merging has between each other
Most strongly disturbing cell.In the fixed collection approach that cooperates, network is divided into disjoint cooperation set, and scheduling only need to be in set
Carried out between base station, the base station in identical set is only the user service in set.
Method 2：The cooperation set that user determines；
Each UE cooperation set is determined according to the most strong interference sources of each UE.Need the UE using CoMP must measure and
The serving cell of oneself is given in report most strong jamming set, and serving cell selects suitable number of cell conduct according to certain threshold value
The cooperation set of the user.Information according to from user to network-feedback, cooperation set can be it is semi-static can also be dynamic
's.
Method 3：User aids in the cooperation set that network determines；
Network predefines an alternative regional ensemble, it is necessary to which CoMP user measures instead in the set
Feedback, serving cell is reported based on such as RSRP, CSI average for a long time or short-term CSI, determines the cooperation set of the user.
Three of the above method is respectively present problems with：
1) cooperation set is fixed in method 1, and implementation complexity is low, but the set that cooperates immobilizes, and can not embody
Network dynamic changes, and cooperation performance gain is limited.
2) cooperation set is the most suitable cooperation set obtained according to each user's measurement in method 2, thus has and compare
High performance gain, but the size of cooperation set or shape are arbitrary, and be possible to corresponding to different UE cooperation set
It is overlapping, the coordination carried out in the range of whole network between cooperation set will be extremely complex.
3) the cooperation set of user is the subset of a predetermined regional ensemble in method 3, and each CoMP user is equal
The channel conditions or disturbed condition of multiple cells in measured zone set are needed, and are fed back.
The content of the invention
The technical problem to be solved in the present invention is to provide a kind of generation method of collaboration region, device and terminal device, energy
The maximum adjacent sector of cooperative gain is enough selected to improve the systematic function under CoMP system CS/CB scenes as cooperation sector.
In order to solve the above technical problems, a kind of generation method of collaboration region of the present invention, including：
Each base station calculates the cooperative gain between each adjacent base station respectively, and interacts with each adjacent base station and each calculate
The mutual cooperative gain arrived, wherein, the user throughput upper limit that the cooperative gain is equal under cooperation mode subtracts non-
User throughput under cooperation mode；
Each base station calculates each adjacent base station the cooperative gain for being sent to adjacent base station with being received from the adjacent base station respectively
Cooperative gain sum, select to send cooperation request to cooperative gain and maximum adjacent base station.
Further, in addition to：
Each base station calculates the number of users of each precoding vector in code book, and interacts with adjacent base station and each calculate
The number of users of each precoding vector arrived；
Each base station calculates and each adjacent base respectively according to the number of users of each precoding vector received from adjacent base station
Cooperative gain between standing.
Further, the cooperative gain that each base station calculates between each adjacent base station respectively includes：
Each base station notifies the number of users of each precoding vector received from adjacent base station to each edge customer, and
The cooperative gain of the edge customer is received from the edge customer；
Each edge customer is added by each base station to the cooperative gain of same adjacent base station, is obtained between the adjacent base station
Cooperative gain.
Further, after the edge customer receives the number of users of each precoding vector of adjacent base station, the side is calculated
Orthogonal coefficient α between the precoding vector that edge user uses to the channel matrix of the base station and the edge customer, and
The edge customer to adjacent base station channel matrix and the adjacent base station each precoding vector between orthogonal coefficient βi, according to
Described α, βiWith the number of users of each precoding vector of adjacent base station, the edge customer is calculated in serving BS and the adjacent base
The user throughput upper limit stood under cooperation modeWith the user throughput C under non tie up systemun-co, subtract each other to obtain the side
The cooperative gain of edge user.
Further, user throughput of the edge customer under serving BS and the adjacent base station non tie up system
For：Wherein, P be the adjacent base station code book in precoding vector quantity,
For the precoding vector w in the adjacent base stationBiNumber of users, k be the adjacent base station total number of users amount.
Further, the user throughput upper limit of the edge customer under serving BS and the adjacent base station cooperation mode
For：Wherein, the βbest=min { β1,β2,...,βP}。
Further, the edge customer to the precoding that channel matrix and the edge customer of the base station use to
Orthogonal coefficient between amount is：Wherein, the wAThe precoding vector used for the edge customer, institute
State HA,0Channel matrix for the edge customer to the base station；
The edge customer to adjacent base station channel matrix and the adjacent base station each precoding vector between rhombic system
Number is：Wherein, it is describedFor the channel matrix of the edge customer to adjacent base station, the wBiFor institute
State the precoding vector of adjacent base station.
Further, after each base station sends cooperation request to cooperative gain and maximum adjacent base station, if received
Cooperation response, then form the set that cooperates with the adjacent base station of the cooperative gain and maximum；If cooperation response, Shen are not received
It please add the cooperative gain and the established cooperation set of maximum adjacent base station.
Further, the number of users that each base station calculates each precoding vector in code book includes：
Each base station receives the channel condition information of user feedback, and the user is calculated according to the channel condition information
The number of users of each precoding vector is calculated in the precoding vector of use, the precoding vector used according to each user
Amount.
Further, a kind of generating means of collaboration region, including：Cooperative gain computing unit, cooperative gain interaction are single
Unit is initiated in member, gain and computing unit and cooperation, wherein：
The cooperative gain computing unit, for calculating the cooperative gain between each adjacent base station respectively, the cooperation increases
The user throughput upper limit that benefit is equal under cooperation mode subtracts the user throughput under non tie up system；
The cooperative gain interactive unit, calculated for interacting respective cooperative gain computing unit with each adjacent base station
The cooperative gain arrived；
The gain and computing unit, for each adjacent base station is calculated respectively be sent to the cooperative gain of the adjacent base station with from
The sum for the cooperative gain that the adjacent base station receives；
Unit is initiated in the cooperation, for selecting to send cooperation request to cooperative gain and maximum adjacent base station.
Further, the cooperative gain computing unit is the user according to each precoding vector received from adjacent base station
Quantity, the cooperative gain between each adjacent base station is calculated respectively, including：
The number of users of each precoding vector received from adjacent base station is notified to each edge customer, and from the edge
User receives the cooperative gain of the edge customer；Each edge customer is added to the cooperative gain of same adjacent base station, obtain with it is described
Cooperative gain between adjacent base station.
Further, a kind of user equipment, including：Terminal cooperation gain calculating unit and cooperative gain transmitting element, its
In：
The terminal cooperation gain calculating unit, for the number of users in each precoding vector for receiving adjacent base station
Afterwards, between the precoding vector that the edge customer belonging to calculating uses to the channel matrix of the base station and the edge customer
Orthogonal coefficient α, and the edge customer to adjacent base station channel matrix and the adjacent base station each precoding vector between
Orthogonal coefficient βi, according to described α, βiWith the number of users of each precoding vector of adjacent base station, calculate the edge customer and servicing
Base station and the user throughput upper limit under the adjacent base station cooperation modeWith the user throughput C under non tie up systemun-co,
Subtract each other to obtain the cooperative gain of the edge customer；
Further, the edge customer that the terminal cooperation gain calculating unit calculates is in serving BS and the neighbour
User throughput under the non tie up system of base station is：Wherein, P is the adjacent base station
Code book in precoding vector quantity,For the precoding vector w in the adjacent base stationBiNumber of users, k is the neighbour
The total number of users amount of base station；
The edge customer is in serving BS and the user throughput upper limit under the adjacent base station cooperation mode：Wherein, the βbest=min { β1,β2,...,βP}。
In summary, the present invention has the advantages that：
1) cooperation set is adjusted correspondingly with intra-cell users changes in distribution, is not changeless.
2) interference caused by considering adjacent sector precoding selection, defines the concept of cooperative gain, and is increased using cooperation
Benefit selection cooperation set, improves CoMP cooperative gains.What the edge customer in cooperation set fed back is the association with adjacent sectors
Make gain, the collaboration set for aiding in network to determine with user in contrast scheme is closed in generation method, and user needs to feed back to all phases
The CSI information of adjacent sector is compared, and embodies influence of the adjacent sectors interference to cooperative gain.
Brief description of the drawings
Fig. 1 is the schematic diagram of CS/CB scene systems model in the prior art；
Fig. 2 is the flow chart of the generation method of the collaboration region of present embodiment；
Fig. 3 is the Organization Chart of the generating means of the collaboration region of present embodiment；
Fig. 4 is the Organization Chart of the user equipment of present embodiment.
Embodiment
The related notion that present embodiment is related to first is introduced below, is defined as follows：
Serving sector：It is defined as sending Physical Downlink Control Channel (Physical Downlink Control to user
Channel, referred to as PDCCH) sector.
Cooperate sector：Refer to and directly or indirectly participate in the sector that cooperation is sent.
Cooperative gain G：The user throughput upper limit brought of being cooperated between the sector of estimation and user throughput during non-cooperating it
Between difference.
Present embodiment calculates the cooperative gain of each adjacent sectors using subscriber channel distribution situation in CS/CB systems,
Generate collaboration region (cooperation set), interference variations and this fan with reference to caused by the user of adjacent sectors selects precoding vector
Subscriber channel is counted to embody influence of the user distribution to cooperative gain in area, selects the maximum adjacent sector of cooperative gain as association
Make sector, improve the systematic function under CoMP system CS/CB scenes.
Present embodiment using subscriber channel distribution situation in each sector characteristic, when counting non-cooperating edge customer by
To the disturbed condition of adjacent sector signals, the user throughput C under non tie up system is estimatedun-co, and the user that brings of cooperation gulps down
The amount of the telling upper limitAfterwards by the cooperative gain of estimationAs the index for weighing CoMP cooperation performance gains, enter
Row cooperation Resource selection.Handshake Protocol is used between sector, determines collaboration object, generation cooperation set.As user point in sector
When cloth changes, cooperation set is adjusted correspondingly, real-time ensuring algorithm performance.
The generation method of the collaboration region of present embodiment includes：
Step 1：Each sector (base station) counts the number of users of each precoding vector；
User in each sector precoding vector according to corresponding to CSI long-time statisticals mean value computation itself, and feed back to fan
Area.Sector calculates total number of users in the number of users and sector of each precoding vector.
Step 2：The number of users and total number of users of each precoding vector of interaction between sector；
Total number of users is sent to adjacent in the number of users for each precoding vector that each sector obtains step 1 and sector
Base station.The quantity of adjacent base station is no more than the measurement collection size of user in sector not less than the number of members that cooperation is gathered, and can
To set the upper limit according to network condition.
Step 3：Each sector calculates the cooperative gain of its adjacent sector；
Sector number of users according to corresponding to each precoding vector in adjacent sector received calculates the cooperative gain with the sector
G。
Step 4：Each sector and its adjacent sector interactive cooperation gain；
The cooperative gain G that step 3 is calculated is notified its adjacent sector by each sector, and receives the association from adjacent sector
Make gain.
Step 5：Sector sends cooperation request and generates cooperation set by Handshake Protocol.
Each sector selects bi-directional gain and maximum adjacent sector to send by calculating the cooperative gain G sent and received
Cooperation request, by the interaction of inter-base station interface, selection cooperation set, carry out cooperation transmission.
, it is necessary to using the space channel orthogonality between sector on identical running time-frequency resource under CS/CB modes, reduce edge and use
The adjacent sectors interference signal intensity that family is subject to, so as to improve the performance gain acquired in cooperative system.Due to space channel
Correlation is different, and for adjacent base station when being transmitted using different precoding vectors, interference that this sector-edge user is subject to can be with
Change.Meanwhile the transmission of adjacent base station precoding vector is determined by the channel distribution situation of user in the base station.Therefore,
For edge customer, when cooperative base station is tended to be transmitted using the less precoding vector of inter-sector interference, CS/
The performance gain that CB cooperations are brought is larger.
In Fig. 1, any one edge customer in the A of sector is UE0, sector A and B to UE0Channel matrix be respectively HA,0
WithWherein, subscript I represents that the latter is interference channel matrix.K user in the B of sector is respectively labeled as { 1,2 ..., k }.
System uses the code book containing P precoding vector.Grey parts represent the sensing of precoding vector in figure.
Assuming that under the scene shown in Fig. 1, the specific implementation flow of the collaboration region generation method based on user distribution is shown in
Fig. 2, step are as follows：
201：Consider the correlation and randomness of channel, user is calculated the CSI information in certain time average in sector
Value, obtains CSI long-time statistical averages；
202：Each user determines precoding vector corresponding to itself by CSI long-time statistical averages in the B of sector, and feeds back to
Sector B；
Step 203：Sector B counts the total number of users of each precoding vectorAnd by between base station
Interactive interfacing is to adjacent base station A；
Step 204：Sector A willNotify to give its edge customer；
Step 205：Sector A inward flange users UE0Determine precoding vector w corresponding to itselfA, and calculate HA,0With wAJust
Hand over factor alpha, while UE0Calculate interference matrixOrthogonal coefficient β between sector B P precoding vectori；
Step 206：Sector A passes through α, βiValue and sequenceCalculate UE0Non tie up system under
User throughput Cun-coAnd the user throughput upper limit under cooperation modeAnd thus calculateCarry out table
Levy UE0Cooperative gain after sector A and B cooperation；
Step 207：To edge customer repeat step 205~206 all in the A of sector, the cooperation of each edge customer is increased
Benefit is added, and is the cooperative gain that sector A is brought as sector B after cooperation, i.e.,：GB→A=∑ Gedge-ue；
Step 208：Each sector to nearby sectors (scope is no more than the measurement collection of user in sector) repeat step 201~
207, calculate cooperative gain G and notify the adjacent sector, and cooperation request is initiated to the maximum adjacent sector of cooperative gain.
The computational methods of cooperative gain are illustrated below.
Present embodiment can be carried by the cooperative gain between sector to characterize CS/CB to the performance that edge customer is brought
Rise.The performance bottleneck of edge customer is that adjacent sector is disturbed caused by same frequency resource, and the jamming power is adopted with adjacent sector
Precoding vector and change.By counting the service condition of each precoding vector in adjacent sector, and non-cooperating side is estimated accordingly
Average throughput C of the formula lower edge user in the case where adjacent sector interference be presentun-co.Meanwhile under preferable CS/CB scenes, neighbour's fan
Area uses the precoding vector for interfering minimum to this sector to be transmitted, and estimates accordingly in cooperation mode lower edge user
The handling capacity upper limitThus obtaining being capable of caused cooperative gain with the adjacent sector cooperation
(1) cooperative gain of single edge customer is calculated；
1) UE is calculated0To sector A channel matrix and UE0Precoding vector orthogonal coefficient；
Any one edge customer in the A of sector is taken, is designated as UE0, UE0Determined according to CSI information as UE0What is serviced is pre-
Coding vector is wA, and obtain UE with following formula0To sector A channel matrix HA,0With UE0Precoding vector wAOrthogonal coefficient：
Wherein, if HA,0With wAParallel then α=1, orthogonal then α=0.
2) UE is calculated0To the orthogonal coefficient of sector B channel matrix and each interference precoding vector；
Sector A is obtained the number of users that P precoding vector services respectively in the B of sector, met by interaction between base stationWhereinRepresent sector B and use precoding vector wBiNumber of users, k be sector B use
Family sum.
Sector A willNotify UE0, UE0Channel matrix is calculated respectively(interference matrix) and fan
Orthogonal coefficient between area B P precoding vector：
The orthogonal coefficient β of acquisitioniCharacterize the interference precoding vector that uses of base station by after inter-sector interference channel to
Family UE0The degree of interference is produced, is due to precoding vector wBiWith interference channelPhase difference caused by, therefore can also recognize
To be a kind of phase feedback.
3) cooperation of A, B sector is calculated to UE0Performance gain G0；
Under non tie up system, sector B user is dispatched independently of sector A.For A, it is believed that sector B is adopted
With precoding vector wBiProbability and wBiThe number of users of serviceIt is relevant.If number of users is more in the B of sector, can recognize
For wBiBe using probability
A, B are sent using constant power for sector, and transmit power and precoding vector are normalized, then UE0Receive
Available signal power is α2, from B sectors precoding vector wBiJamming power be βi 2.Obtain under non tie up system, UE0Gulp down
The amount of telling estimate is：
Ideally, dispatched by CS, UE0Stronger interference precoding can be avoided by sending every time, and the sector that cooperates
All with to UE0The minimum precoding vector of interference is transmitted.Order：
βbest=min { β1,β2,...,βP} (4)
Then pass through cooperation, UE0The handling capacity upper limit can be estimated as：
It will be apparent thatAnd the extreme case that equal sign is set up is
Then, sector A, B cooperation, UE are passed through0Obtainable performance gain is：
(2) cooperative gain Gs of the sector B to sector A is calculatedB→A；
Unique user UE0Calculate the cooperative gain G that sector B can be provided0, and feed back to sector A.Sector A is by all edges
The cooperative gain of user feedback is added, that is, obtains the overall cooperative gain that sector B is provided sector A：
GB→A=∑ Gedge-ue (7)
The flow of pair determination cooperation set illustrates below：
From Fig. 1 system model, each sector is adjacent in the presence of 4 borders, and adheres to different eNB adjacent sector separately
(Intra-cell scenes are not in this algorithm limit of consideration under identical eNB).For any sector A, following steps are a distribution
The collaboration region generation method of formula：
1) adjacent sets of sectors Ω={ B, C, D, E }.Calculate the bi-directional gain sum of A and 4 adjacent sector：GA+B, GA+C, GA+D,
GA+E, wherein, GA+B=GB→A+GA→B, other are similarly；
2) sort GA+B, GA+C, GA+D, GA+E；
3) selection wherein gain and maximum sector M=arg max { GA+B,GA+C,GA+D,GA+E, sector A is sent out to sector M
Go out cooperation request；
If 4) receive adjacent sector M cooperation response, set Π={ A, the M } that cooperated with neighbours formation informs respective
Adjacent sector；
If 5) do not receive M cooperation response, application adds the cooperation set that adjacent sector has generated；
6) addition that other adjacent sectors are received such as cooperation set Π is asked, and now Π is not reaching to cooperation set member's number
The upper limit, then the sector for receiving to make Π member's yield value maximum is member；If Π reaches the number of members upper limit, refusal receives new fan
Area；
If 7) A neighbours refuse A addition request, or without any neighbours add it is any cooperation set, then Ω=Ω-
M, repeat step 1), until Ω=Φ.
Add User interaction analysis between feedback and base station
1) Add User feedback content：
A) all users are both needed to the corresponding precoding vector w of feedback channel statistics.
B) edge customer needs to feed back the cooperative gain G for each adjacent sectoredge-ue。
2) interaction content between newly-increased base station：
A) notify that each precoding vector corresponds to number of users in this sector to adjacent sectorSend sequence
B) cooperative gain G of the sector to this sector is notified to adjacent sector.
C) information that Handshake Protocol needs between base station.
Fig. 3 is the generating means of the collaboration region of present embodiment, including：Cooperative gain computing unit, cooperative gain are handed over
Unit is initiated in mutual unit, gain and computing unit and cooperation, wherein：
Cooperative gain computing unit, for calculating the cooperative gain between each adjacent base station respectively, cooperative gain is equal to association
Make the user throughput upper limit under mode and subtract user throughput under non tie up system；
Cooperative gain interactive unit, for being cooperated with what the respective cooperative gain computing unit of each adjacent base station interaction was calculated
Gain；
Gain and computing unit, for each adjacent base station is calculated respectively be sent to the cooperative gain of the adjacent base station with from the neighbour
The sum for the cooperative gain that base station receives；
Unit is initiated in cooperation, for selecting to send cooperation request to cooperative gain and maximum adjacent base station.
Cooperative gain computing unit is according to the number of users of each precoding vector received from adjacent base station, is calculated respectively
With the cooperative gain between each adjacent base station, including：By the number of users of each precoding vector received from adjacent base station notify to
Each edge customer, and receive from edge customer the cooperative gain of the edge customer；Association by each edge customer to same adjacent base station
Make gain addition, obtain the cooperative gain between adjacent base station.
Fig. 4 is the user equipment of present embodiment, including：Terminal cooperation gain calculating unit and cooperative gain send single
Member, wherein：
Terminal cooperation gain calculating unit, for after the number of users of each precoding vector of adjacent base station is received, counting
Orthogonal coefficient α between the precoding vector that edge customer belonging to calculating uses to the channel matrix and edge customer of base station, with
And edge customer to adjacent base station channel matrix and adjacent base station each precoding vector between orthogonal coefficient βi, according to α, βiWith
The number of users of each precoding vector of adjacent base station, calculate user of the edge customer under serving BS and adjacent base station cooperation mode
The handling capacity upper limitWith the user throughput C under non tie up systemun-co, subtract each other to obtain the cooperative gain of edge customer；
Cooperative gain transmitting element, for the cooperative gain of obtained edge customer to be sent into serving BS.
Use of the edge customer that terminal cooperation gain calculating unit calculates under serving BS and adjacent base station non tie up system
Family handling capacity is：Wherein, P be adjacent base station code book in precoding vector number
Amount,For the precoding vector w in adjacent base stationBiNumber of users, k be adjacent base station total number of users amount；
Edge customer is in serving BS and the user throughput upper limit under adjacent base station cooperation mode：
Wherein, βbest=min { β1,β2,...,βP}。
Obviously, those skilled in the art should be understood that above-mentioned each module of the invention or each step can be with general
Computing device realize that they can be concentrated on single computing device, or be distributed in multiple computing devices and formed
Network on, alternatively, they can be realized with the program code that computing device can perform, it is thus possible to they are stored
Performed in the storage device by computing device, and in some cases, can be with different from shown in order execution herein
The step of going out or describing, they are either fabricated to each integrated circuit modules respectively or by multiple modules in them or
Step is fabricated to single integrated circuit module to realize.So, the present invention is not restricted to any specific hardware and software combination.
The preferred embodiments of the present invention are the foregoing is only, are not intended to limit the invention, for the skill of this area
For art personnel, the present invention can have various modifications and variations.Within the spirit and principles of the invention, that is made any repaiies
Change, equivalent substitution, improvement etc., should be included in the scope of the protection.
Claims (13)
- A kind of 1. generation method of collaboration region, it is characterised in that including：Each base station calculates the cooperative gain between each adjacent base station respectively, and interacts what is be each calculated with each adjacent base station Mutual cooperative gain, wherein, the user throughput upper limit that the cooperative gain is equal under cooperation mode subtracts non-cooperating User throughput under mode；Each base station calculates each adjacent base station the cooperative gain for being sent to adjacent base station and the association received from the adjacent base station respectively Make the sum of gain, select to send cooperation request to cooperative gain and maximum adjacent base station.
- 2. the method as described in claim 1, it is characterised in that also include：Each base station calculates the number of users of each precoding vector in code book, and interacts what is be each calculated with adjacent base station The number of users of each precoding vector；Each base station according to the number of users of each precoding vector received from adjacent base station, calculate respectively with each adjacent base station it Between cooperative gain.
- 3. method as claimed in claim 2, it is characterised in that each base station calculates cooperating between each adjacent base station respectively Gain includes：Each base station notifies the number of users of each precoding vector received from adjacent base station to each edge customer, and from institute State the cooperative gain that edge customer receives the edge customer；Each edge customer is added by each base station to the cooperative gain of same adjacent base station, obtains the association between the adjacent base station Make gain.
- 4. method as claimed in claim 3, it is characterised in that：After the edge customer receives the number of users of each precoding vector of adjacent base station, the edge customer is calculated to the base Orthogonal coefficient α between the precoding vector that the channel matrix stood and the edge customer use, and the edge customer arrive Orthogonal coefficient β between the channel matrix of adjacent base station and each precoding vector of the adjacent base stationi, according to described α, βiWith adjacent base The number of users for each precoding vector stood, the edge customer is calculated under serving BS and the adjacent base station cooperation mode The user throughput upper limitWith the user throughput C under non tie up systemun-co, subtract each other to obtain the cooperation increasing of the edge customer Benefit.
- 5. method as claimed in claim 4, it is characterised in that：The edge customer is in serving BS and the user throughput under the adjacent base station non tie up system：Wherein, P be the adjacent base station code book in precoding vector quantity,For institute State the precoding vector w in adjacent base stationBiNumber of users, k be the adjacent base station total number of users amount.
- 6. method as claimed in claim 5, it is characterised in that：The edge customer is in serving BS and the user throughput upper limit under the adjacent base station cooperation mode：Wherein, the βbest=min { β1, β2..., βP}。
- 7. method as claimed in claim 6, it is characterised in that：The edge customer is to orthogonal between the channel matrix and the precoding vector that the edge customer uses of the base station Coefficient is：Wherein, the wAThe precoding vector used for the edge customer, the HA, 0To be described Channel matrix of the edge customer to the base station；The edge customer to adjacent base station channel matrix and the adjacent base station each precoding vector between orthogonal coefficient be：Wherein, it is describedFor the channel matrix of the edge customer to adjacent base station, the wBiFor the adjacent base The precoding vector stood.
- 8. the method as described in claim 1, it is characterised in that each base station is sent to cooperative gain and maximum adjacent base station After cooperation request, if receiving cooperation response, the set that cooperates is formed with the adjacent base station of the cooperative gain and maximum；If Cooperation response is not received, then application adds the cooperative gain and the established cooperation set of maximum adjacent base station.
- 9. method as claimed in claim 2, it is characterised in that each base station calculates the user of each precoding vector in code book Quantity includes：Each base station receives the channel condition information of user feedback, and calculating the user according to the channel condition information uses Precoding vector, the number of users of each precoding vector is calculated in the precoding vector used according to each user.
- A kind of 10. generating means of collaboration region, it is characterised in that including：Cooperative gain computing unit, cooperative gain interaction are single Unit is initiated in member, gain and computing unit and cooperation, wherein：The cooperative gain computing unit, for calculating the cooperative gain between each adjacent base station, the cooperative gain etc. respectively The user throughput upper limit under cooperation mode subtracts the user throughput under non tie up system；The cooperative gain interactive unit, for interacting what respective cooperative gain computing unit was calculated with each adjacent base station Cooperative gain；The gain and computing unit, for each adjacent base station is calculated respectively be sent to the cooperative gain of the adjacent base station with from the neighbour The sum for the cooperative gain that base station receives；Unit is initiated in the cooperation, for selecting to send cooperation request to cooperative gain and maximum adjacent base station.
- 11. device as claimed in claim 10, it is characterised in that：The cooperative gain computing unit is according to the number of users of each precoding vector received from adjacent base station, is calculated respectively With the cooperative gain between each adjacent base station, including：The number of users of each precoding vector received from adjacent base station is notified to each edge customer, and from the edge customer Receive the cooperative gain of the edge customer；Each edge customer is added to the cooperative gain of same adjacent base station, obtained and the adjacent base Cooperative gain between standing.
- A kind of 12. user equipment, it is characterised in that including：Terminal cooperation gain calculating unit and cooperative gain transmitting element, its In：The terminal cooperation gain calculating unit, for after the number of users of each precoding vector of adjacent base station is received, counting Edge customer belonging to calculating is to orthogonal between the channel matrix and the precoding vector that the edge customer uses of the base station Factor alpha, and the edge customer is to orthogonal between the channel matrix and each precoding vector of the adjacent base station of adjacent base station Factor betai, according to described α, βiWith the number of users of each precoding vector of adjacent base station, the edge customer is calculated in serving BS With the user throughput upper limit under the adjacent base station cooperation modeWith the user throughput C under non tie up systemun-co, subtract each other Obtain the cooperative gain of the edge customer；The cooperative gain transmitting element, for the cooperative gain of the obtained edge customer to be sent into serving BS.
- 13. user equipment as claimed in claim 12, it is characterised in that：The edge customer that the terminal cooperation gain calculating unit calculates is in serving BS and the adjacent base station non-cooperating side User throughput under formula is：Wherein, P is to be prelisted in the code book of the adjacent base station The quantity of code vector,For the precoding vector w in the adjacent base stationBiNumber of users, k be the adjacent base station user it is total Quantity；The edge customer is in serving BS and the user throughput upper limit under the adjacent base station cooperation mode：Wherein, the βbest=min { β1, β2..., βP}。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110278637.3A CN102438260B (en) | 2011-09-19 | 2011-09-19 | A kind of generation method of collaboration region, device and terminal device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110278637.3A CN102438260B (en) | 2011-09-19 | 2011-09-19 | A kind of generation method of collaboration region, device and terminal device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102438260A CN102438260A (en) | 2012-05-02 |
| CN102438260B true CN102438260B (en) | 2017-11-28 |
Family
ID=45986093
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110278637.3A Active CN102438260B (en) | 2011-09-19 | 2011-09-19 | A kind of generation method of collaboration region, device and terminal device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102438260B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103068056A (en) * | 2012-07-23 | 2013-04-24 | 东南大学 | Collaboration dispatching and beamforming method based on three-neighborhood collaboration cluster |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101860389A (en) * | 2009-04-09 | 2010-10-13 | 中兴通讯股份有限公司 | Implementation method of multi-cell cooperation |
| CN101917217A (en) * | 2010-08-20 | 2010-12-15 | 中兴通讯股份有限公司 | Method and device for choosing cooperation point |
| CN101951307A (en) * | 2010-09-24 | 2011-01-19 | 西安电子科技大学 | Method for selecting cell cooperation set under CoMP |
| EP2343947A1 (en) * | 2010-01-08 | 2011-07-13 | Research in Motion Limited | System and method for coordinated multi-point network operation to reduce radio link failure during handover |
| CN102158310A (en) * | 2011-02-15 | 2011-08-17 | 中兴通讯股份有限公司 | Method and device for realizing multi-cell precoding |
-
2011
- 2011-09-19 CN CN201110278637.3A patent/CN102438260B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101860389A (en) * | 2009-04-09 | 2010-10-13 | 中兴通讯股份有限公司 | Implementation method of multi-cell cooperation |
| EP2343947A1 (en) * | 2010-01-08 | 2011-07-13 | Research in Motion Limited | System and method for coordinated multi-point network operation to reduce radio link failure during handover |
| CN101917217A (en) * | 2010-08-20 | 2010-12-15 | 中兴通讯股份有限公司 | Method and device for choosing cooperation point |
| CN101951307A (en) * | 2010-09-24 | 2011-01-19 | 西安电子科技大学 | Method for selecting cell cooperation set under CoMP |
| CN102158310A (en) * | 2011-02-15 | 2011-08-17 | 中兴通讯股份有限公司 | Method and device for realizing multi-cell precoding |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102438260A (en) | 2012-05-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107196728B (en) | Communication means, communication device, terminal | |
| CN104025656B (en) | Method and central base station for the interference management in cellular network | |
| JP5621934B2 (en) | Scheduling for cooperative multi-cell MIMO systems | |
| Du et al. | “Wireless networks without edges”: Dynamic radio resource clustering and user scheduling | |
| CN102065465B (en) | Method, system and device for transmitting data | |
| CN103620974A (en) | Method and apparatus for interference mitigation in wireless systems | |
| US9876539B2 (en) | Method and apparatus for scalable load balancing across wireless heterogeneous MIMO networks | |
| CN101997583A (en) | Method and device for pairing uplink multi-user multi-input multi-output (MIMO) users supporting cooperation multi-point transmission | |
| CN103444251A (en) | Coordinated scheduling for time division duplex network | |
| CN105745985B (en) | A kind of method and device of Adaptive Modulation and Coding | |
| CN103906253B (en) | A kind of user scheduling method, apparatus and system | |
| JP5318021B2 (en) | Multi-cell cooperative transmission method | |
| CN103249160B (en) | A kind of resource allocation methods in lte-a system under CoMP | |
| JP5915774B2 (en) | Apparatus, system, wireless communication method and device readable medium used for wireless communication | |
| US20160270073A1 (en) | Method and apparatus for resource allocation and for scheduling cellular and coordinated multipoint transmissions in heterogeneous wireless networks | |
| CN114423028A (en) | CoMP-NOMA (coordinated multi-point-non-orthogonal multiple Access) cooperative clustering and power distribution method based on multi-agent deep reinforcement learning | |
| CN102790739B (en) | The up coordinated dispatching method of multi-plot joint and base station | |
| CN103491639A (en) | Multipoint coordinated user scheduling method | |
| CN102438260B (en) | A kind of generation method of collaboration region, device and terminal device | |
| KR101765127B1 (en) | Apparatus and method for clustering for coordinated multi point ommunication in cellular communication system | |
| CN103716079B (en) | Method and apparatus for coordinated multipoint downlink transmission between two cells | |
| CN108322271A (en) | The dynamic clustering method of customer-centric based on load | |
| CN105007628A (en) | Wireless resource distribution method and apparatus | |
| CN105323777A (en) | Method, system and related apparatus for controlling downlink JT | |
| CN105813217B (en) | The quick sub-clustering dispatching method of co-channel full duplex user simultaneously |
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 |