CN102821476B - Multi-cell joint processing method based on weighed sum metric - Google Patents

Multi-cell joint processing method based on weighed sum metric Download PDF

Info

Publication number
CN102821476B
CN102821476B CN201210261547.8A CN201210261547A CN102821476B CN 102821476 B CN102821476 B CN 102821476B CN 201210261547 A CN201210261547 A CN 201210261547A CN 102821476 B CN102821476 B CN 102821476B
Authority
CN
China
Prior art keywords
point
pairing
launch point
cell edge
tolerance
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201210261547.8A
Other languages
Chinese (zh)
Other versions
CN102821476A (en
Inventor
周化雨
温文坤
江明
张昕
纪子超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Haiyun Technology Co. Ltd.
Original Assignee
New Postcom Equipment Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by New Postcom Equipment Co Ltd filed Critical New Postcom Equipment Co Ltd
Priority to CN201210261547.8A priority Critical patent/CN102821476B/en
Publication of CN102821476A publication Critical patent/CN102821476A/en
Application granted granted Critical
Publication of CN102821476B publication Critical patent/CN102821476B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a multi-point coordination joint processing method based on weighed sum metric, which is used for performing concentrated scheduling by a centre node which is physically or logically connected with each transmission point. The method comprises the following steps: firstly, the center node counts out user equipment (UE) at the edge of a cell and a candidate transmission point (TP) within a time space; then, in the scheduling period, the centre node collects the channel state information between the UE and the TP participating coordination; and finally, the centre node selects out the best UE pair which is the best totally according to the weighed sum metric. By using the method, the cell average capacity is kept, meanwhile, the cell edge capacity is increased, and an optimized balance between the enhancing of the coordination gain and the holding of the lower coordination difficulty is obtained; and the method has the following advantages of low upstream feedback cost, high flexibility, low difficulty, and the like.

Description

Based on the multi-plot joint processing method of weighted sum tolerance
Technical field
The present invention, towards moving communicating field, proposes a kind of multi-plot joint processing method based on weighted sum tolerance.
Technical background
New generation of wireless development communication technologies is rapid in recent years, compares third generation wireless communication technology, Technology of New Generation Mobile Communications has that the network architecture is simple, signal time delay is little, the high communication quality, fireballing plurality of advantages.
Collaborative multicast communication (Coordinated Multi-Point transmission, CoMP) is a kind of communication technology of multiple inter-cell downlink cooperation.Each community of general acquiescence adopts multiple-input and multiple-output (Multiple Input Multiple Output, MIMO) technology.Multiple community is connected by back haul link (Backhaul), exchange message, by coordinating to reach the object reducing presence of intercell interference, finally improves cell edge throughput.In concrete scene, the community participating in cooperation also may share a Physical Cell Identifier (Physical Cell ID, PCI), and therefore these communities are also referred to as launch point (Transmission Point, TP).Although it should be noted that " community " is called as launch point, each launch point can have the behavior of individual cell, comprises resource management, physical layer procedure etc.The launch point of indication of the present invention comprises the community having or do not have independent PCI.Multi-point cooperative technology mainly comprises Combined Treatment (Joint Processing, JP) and cooperative scheduling/collaborative beam forming (Coordinated Scheduling/Coordinated Beamforming, CS/CB).Combined Treatment technology comprises again combines transmitting (Joint Transmission, JT) and dynamic point is selected/mourned in silence (Dynamic Point Selection/Blanking, DPS/DPB).Combined Treatment requires each launch point data sharing and channel condition information (Channel State Information, CSI), therefore need capacity high, postpone low back haul link, often adopt the high speed medium such as optical fiber.
The present invention proposes a kind of multi-point cooperative combination treatment method based on weighted sum tolerance (Weighted Sum Metric, WSM).The method, while maintenance community average throughput, adds cell edge throughput, obtains a balance optimized promoting cooperative gain and maintain between lower cooperation complexity, has the advantages such as uplink feedback expense is little, flexibility good, complexity is low.
Summary of the invention
The present invention proposes a kind of multi-point cooperative combination treatment method based on weighted sum tolerance.The method requires to carry out centralized scheduling by " Centroid " that physically or in logic connect each launch point.First, " Centroid " counts subscriber equipment (UserEquipment, the UE) information of cell edge and participates in the candidate transmitting point of cooperation in a period of time interval.Then, between schedule periods, " Centroid " collects the channel condition information between UE with the TP participating in cooperating.UE and TP between channel condition information can come from the order that UE reports and indicate (Rank Indicator, RI), channel quality instruction (Channel Quality Indicator, and pre-coding matrix index (Precoding Matrix Index CQI), the information such as PMI), also can calculate acquisition by base station by modes such as channel reciprocity voluntarily.Finally, " Centroid " by weighting with tolerance optimize global optimum UE pairing.
The present invention has following characteristics:
1) the design achieves larger cooperative gain and less cooperation complexity (comprise uplink feedback expense, UE measures complexity, dispatch the aspects such as complexity), be mainly manifested in: " collection bunch " (Clustering) process that whole process includes " participating in the launch point set of cooperation " and " general scheduling process ", and scheduling is carried out within the scope of whole collaboration region; One, collaboration region fixing or the launch point set of dynamically/semi-static change, and for the launch point set participating in cooperation certain UE be a subset of collaboration region;
2) program is without the need to launch point information whole in all UE uplink feedback collaboration regions, thus has the advantage that feedback overhead is little.Be mainly manifested in: cell edge UE and non-cell edge UE can mix pairing, make system only need the UE feedback of cell edge to participate in the channel condition information of the launch point of cooperation, and allow different cell edge UE to measure and report the information of different cooperation launch point set;
3) program can measure by weighted sum the chance improving cell edge UE and be scheduled, and significantly improves the Consumer's Experience of cell edge;
4) according to different application scenarioss, channel condition, be supported in combine transmitting, dynamic point selects or dynamic point to be mourned in silence etc. between multiple Combined Treatment technology and carried out switching at runtime.
Key problem in technology point of the present invention and protection point
1. flow process of the present invention includes following process:
A) " collection bunch " process " participating in the launch point set of cooperation ", namely " Centroid " selects the launch point of cell edge UE and corresponding participation cooperation." Centroid " can select cooperation UE according to various principle, includes but are not limited to the received signal strength of UE, the path loss size of UE, the received signal quality of UE, etc.;
B) " general scheduling flow ", namely " Centroid " carries out Real-Time Scheduling according to the channel condition information of UE;
2. scheduling of the present invention is carried out within the scope of whole collaboration region.Collaboration region can be the launch point set of a fixing or dynamically/semi-static change.For certain UE, the launch point set participating in cooperation can be whole collaboration region or its subset;
3. " general scheduling flow " of the present invention comprises following process:
A) to each launch point, under selecting this single-shot exit point in advance, best UE is measured;
B) enumerating all possible multiple cell resource distribution mode, namely realizing based on combining the UE pairing of transmitting or UE based on dynamic emission point selection (comprising dynamic emission point to mourn in silence) matches;
C) each UE is matched, calculate its weighted sum tolerance;
D) the UE pairing of maximum metric is selected as scheduling result;
4. the present invention walks in " measuring best UE under selecting each single-shot exit point in advance " at its " general scheduling flow " 3.a, can take one of following two schemes:
A) scheme one: network is not enabled dynamic point and selected, and UE to be selected only need comprise non-cell edge UE;
B) scheme two: network enables dynamic point and selects, and UE to be selected comprises non-cell edge UE and cell edge UE;
5. the present invention walks in " measuring best UE under selecting each single-shot exit point in advance " at its " general scheduling flow " 3.a, to the processing procedure of scheme time " enabling dynamic point selection technique " is:
A) best non-cell edge UE is measured under selecting single-shot exit point;
B) best cell edge UE is measured under selecting single-shot exit point;
C) compare both, under selecting single-shot exit point, measure best UE;
6. the present invention walks in " enumerating all possible multiple cell resource distribution mode " at its " general scheduling flow " 3.b, and all possible UE pairing comprises:
A) best UE is measured under all single-shot exit points selected in 3.a step;
B) measure best UE under being mixed with some the single-shot exit point selected in 3.a step and combine with some reception the cooperation UE transmitted;
7. the present invention walks in " match to each UE, calculate its weighted sum tolerance " at its " general scheduling flow " 3.c, the tolerance of each UE is adopted to the mode of weighted sum.If certain UE receives and combines and transmit in certain pairing, although so this UE appears at for many times in this pairing, its tolerance only can be added and once;
8. the present invention walks in " match to each UE, calculate its weighted sum tolerance " at its " general scheduling flow " 3.c, and the scheme of computing metric has multiple.Wherein a kind of numerical procedure is equitable proportion metric scheme metric calculation scheme is equitable proportion tolerance;
9. the present invention walks in " match to each UE, calculate its weighted sum tolerance " at its " general scheduling flow " 3.c, and the two kinds of weight scheme that can take are:
A) weight is all 1;
B) weight is the number of the launch point of service current UE;
10. the present invention walks at the 3.b of its " general scheduling flow ", when enumerating the UE pairing of mixing, can comprise situation when certain or certain several launch point is mourned in silence.
Accompanying drawing explanation
Fig. 1: general flow chart
Fig. 2: general scheduling flow figure
Embodiment
Flow process of the present invention mainly comprises two parts, as shown below:
The present invention adopts centralized scheduling, and namely " Centroid " collects the channel condition information of each launch point, and then decision-making goes out cooperative scheduling scheme.
One, the launch point of cell edge UE and participation cooperation is selected
The height of the received signal power level that " Centroid " feeds back according to UE selects the launch point set of cell edge UE and corresponding participation cooperation.
The process of this selection course one often " long-term/broadband ".Decline from large scale, being suitably for the launch point set that certain cell edge UE carries out cooperative operation may be several launch points that this UE received signal power is the strongest, and the launch point set of the participation cooperation that therefore different cell edge UE is corresponding can be different.
Based on this " collection bunch " process, " Centroid " only needs to know the interior channel condition information of each launch point of launch point set of the participation cooperation that cell edge UE is corresponding and the channel condition information of the routine of non-cell edge UE.
Two, general scheduling flow
Scheduling of the present invention is carried out within the scope of whole collaboration region.Whole collaboration region can be the launch point set of a fixing or dynamically/semi-static change, and can be whole collaboration region or its subset for the launch point set participating in cooperation certain UE.
The channel condition information of UE comprises the channel condition information of the routine (namely when non-" Combined Treatment ") of all UE, such as PMI, CQI etc.Further, the channel condition information of UE comprises " after process the channel condition information " of cell edge UE.Should " process after channel condition information " channel condition information after Combined Treatment (comprising combine transmission or dynamic point selection/dynamic point the processing mode such as to mourn in silence) for calculating out according to different interference hypothesis, can be fed back by UE to obtain, or base station measurement, reckoning obtain.
The tolerance adopted in scheduling process is certain tolerance based on channel condition information, as equitable proportion tolerance etc.Scheduling flow of the present invention is as follows:
1. pair each launch point, measures best UE under selecting this single-shot exit point in advance.Here one of two schemes can be adopted:
A) scheme one: do not enable dynamic point as network and select, then UE to be selected only includes non-cell edge UE;
B) scheme two: select as network enables dynamic point, then UE to be selected comprises non-cell edge UE and cell edge UE.Processing procedure is:
I. best non-cell edge UE is measured under selecting single-shot exit point;
Ii. best cell edge UE is measured under selecting single-shot exit point;
Iii. compare both, under selecting single-shot exit point, measure best UE;
2. enumerate all possible multiple cell Resourse Distribute compound mode, namely candidate UE matches, and comprises and receives and do not receive the UE combining and transmit.Resourse Distribute generally with certain resource units (such as Resource Block, Resource Block group, subband or broadband) for smallest allocation granularity.All possible UE pairing comprises:
A) the UE pairing that single-point is best: measure best UE under all single-shot exit points selected in a first step;
B) the UE pairing mixed: measure best UE under being mixed with some the single-shot exit point selected in a first step and combine with some reception the cooperation UE transmitted.Wherein measure best UE under single-shot exit point and only take a resource, reception is combined the UE transmitted and is taken multiple resource.Table 1 gives the possible UE of part in three cooperation launch point situations and matches example:
Table 1: the possible UE pairing example in three cooperation launch point situations
Wherein be measure best UE under i-th launch point, for receiving i-th, j, k launch point combine the UE transmitted, wherein subscript x represents the mark of UE;
3. match to each UE, calculate the weighted sum tolerance of its correspondence, wherein the tolerance of each UE can only be added and once.If in certain pairing, certain UE receives is combine to transmit, although so this UE appears at for many times in this pairing, its tolerance only can be added and once.Weighted sum tolerance can be expressed as following formula:
Metric sum = Σ i λ i M i - - - ( 1 )
Wherein:
M ibeing the metric relevant with channel condition information of i-th UE, can be the situation that transmitting is combined in reception single transmitter or reception;
λ ifor weighted factor.
A) scheme of computing metric has multiple.
Wherein numerical procedure is an equitable proportion metric scheme, but is not limited only to this:
M i = R i α T i β - - - ( 2 )
Wherein:
R iit is the momentary rate represented by channel condition information of i-th UE;
T iit is the throughput in the past of i-th UE;
α, β are the Dynamic gene in proportional fair algorithm.
B) weight scheme can have multiple choices:
I. weight is all set to 1;
Ii. weight is set to the number to the launch point that current UE transmits.Combine because receive the running time-frequency resource that the UE transmitted occupies multiple launch point, simultaneously this UE is again cell edge UE, and it is also lower often to combine the Signal to Interference plus Noise Ratio after transmitting, therefore its corresponding UE pairing is also usually less with metric.This may cause this UE pairing to be difficult to be scheduled, and the weight therefore improving cell edge UE is significant in some cases;
4. the weighted metric addition of more all UE pairing, the maximum UE pairing of selectance value is as UE pairing of next step scheduling.
" general scheduling flow " of the present invention can be expressed as figure below:
Fig. 2: general scheduling flow figure
Three, the scheduling process being with dynamic point to mourn in silence
Dynamic point is mourned in silence (Dynamic Point Blanking) is a kind of special shape that dynamic point is selected, and it represents that certain launch point of scheduling decision does not send data on certain Resource Block, and this scheduling decision is dynamic.
The realization that dynamic point is mourned in silence requires that " Centroid " obtains " process after the channel condition information " of cell edge UE under certain interference hypothesis, such as cell edge UE, " Centroid " can obtain channel condition information when certain launch point is mourned in silence in certain resource.
To mourn in silence the base station of function for enabling dynamic point, the 2nd step in above-mentioned " general scheduling flow ": when enumerating the UE combinations of pairs of mixing, need consider the situation that launch point is mourned in silence.Table 2 gives enables dynamic point when mourning in silence, and the possible UE of three cooperation launch points matches example:
Table 2: possible UE pairing example (enabling dynamic point to mourn in silence) of three cooperation launch points
To mourn in silence the base station of function for enabling dynamic point, the 3rd step in above-mentioned " general scheduling flow ": for " the UE pairing of mixing includes the situation that launch point is mourned in silence ", measure M accordingly icorresponding channel condition information should be the channel condition information considering launch point and mourn in silence under situation.
The foregoing is only embodiments of the invention, be not limited to the present invention.The present invention can have various suitable change and change.All any amendments done within the spirit and principles in the present invention, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (10)

1., based on a multi-point cooperative combination treatment method for weighted sum tolerance, it is characterized in that:
Centralized scheduling is carried out by " Centroid " that physically or in logic connect each launch point;
First, " Centroid " counts the user equipment (UE) information of cell edge and participates in the candidate transmitting point TP of cooperation in a period of time interval;
Then, between schedule periods, " Centroid " collects the channel condition information between UE with the TP participating in cooperating;
Finally, " Centroid " optimizes the UE pairing of global optimum by weighted sum tolerance;
Wherein, described scheduling is carried out within the scope of whole collaboration region; Collaboration region is the launch point set of a fixing or dynamically/semi-static change; For certain UE, the launch point set participating in cooperation is whole collaboration region or its subset;
Its general scheduling flow comprises following process:
A) to each launch point, under selecting this launch point in advance, best UE is measured;
B) enumerating all possible multiple cell resource distribution mode, realizing based on combining the UE pairing of transmitting or UE based on dynamic emission point selection matches;
C) each UE is matched, calculate its weighted sum tolerance;
D) the UE pairing of maximum metric is selected as scheduling result.
2. the method for claim 1, it is characterized in that: wherein, UE and TP between channel condition information come from the order that UE reports and indicate (Rank Indicator, RI), channel quality instruction (Channel Quality Indicator, and pre-coding matrix index (Precoding Matrix Index, PMI), or calculate acquisition by base station voluntarily by channel reciprocity CQI).
3. the method for claim 1, is characterized in that: wherein, and " Centroid " selects cooperation UE according to various principle, comprises the received signal strength of UE, the path loss size of UE, the received signal quality of UE.
4. the method for claim 1, is characterized in that: during described step a " measures best UE under selecting each launch point in advance ", takes one of following two schemes:
A) scheme one: network is not enabled dynamic point and selected, and UE to be selected only need comprise non-cell edge UE;
B) scheme two: network enables dynamic point and selects, and UE to be selected comprises non-cell edge UE and cell edge UE.
5. method as claimed in claim 4, is characterized in that: described network is enabled the processing procedure of scheme when dynamic point is selected and is:
A) best non-cell edge UE is measured under selecting single-shot exit point;
B) best cell edge UE is measured under selecting single-shot exit point;
C) compare both, under selecting single-shot exit point, measure best UE.
6. the method for claim 1, is characterized in that: during described step b " enumerates all possible multiple cell resource distribution mode ", and all possible UE pairing comprises:
1) measure best UE under each launch point selected in a step to match as a UE;
2) measure best UE and receive under being mixed with the launch point selected in a step and combine the cooperation UE transmitted.
7. the method for claim 1, it is characterized in that: during described step c " matches to each UE; calculate its weighted sum tolerance ", the tolerance of each UE is adopted to the mode of weighted sum, if certain UE receives to combine and transmits in certain pairing, although so this UE appears at for many times in this pairing, its tolerance only can be added and once.
8. the method for claim 1, is characterized in that: during described step c " matches to each UE, calculates its weighted sum tolerance ", the scheme of computing metric has multiple, and wherein a kind of numerical procedure is equitable proportion metric scheme.
9. the method for claim 1, is characterized in that: during described step c " matches to each UE, calculates its weighted sum tolerance ", the two kinds of weight scheme taked are:
A) weight is all 1;
B) weight is that the individual counting method of launch point of service current UE is applicable to homogenous networks or heterogeneous network.
10. the method for claim 1, is characterized in that: in described step b, when enumerating the UE pairing of mixing, comprises situation when certain or certain several launch point is mourned in silence.
CN201210261547.8A 2012-07-26 2012-07-26 Multi-cell joint processing method based on weighed sum metric Active CN102821476B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210261547.8A CN102821476B (en) 2012-07-26 2012-07-26 Multi-cell joint processing method based on weighed sum metric

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210261547.8A CN102821476B (en) 2012-07-26 2012-07-26 Multi-cell joint processing method based on weighed sum metric

Publications (2)

Publication Number Publication Date
CN102821476A CN102821476A (en) 2012-12-12
CN102821476B true CN102821476B (en) 2014-12-31

Family

ID=47305246

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210261547.8A Active CN102821476B (en) 2012-07-26 2012-07-26 Multi-cell joint processing method based on weighed sum metric

Country Status (1)

Country Link
CN (1) CN102821476B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103167617B (en) * 2013-03-12 2016-03-16 华南师范大学 A kind of multi-cell dynamic resource allocation method
US10455590B2 (en) * 2013-08-22 2019-10-22 Huawei Technologies Co., Ltd. System and method for boundaryless service in wireless networks with cooperative transmission points
EP3442287B1 (en) 2016-04-29 2020-09-02 Huawei Technologies Co., Ltd. Multi-user multi-input multi-output (mu-mimo) data transmission method and base station
CN117177376B (en) * 2023-09-19 2024-04-16 深圳大学 Multi-cell cooperative scheduling method, equipment and medium considering backhaul delay

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101841356A (en) * 2009-03-18 2010-09-22 大唐移动通信设备有限公司 Method, device and system for feeding back channel quality information
CN101873282A (en) * 2009-04-24 2010-10-27 大唐移动通信设备有限公司 Multi-cell data transmission method and device
CN101931993A (en) * 2009-06-22 2010-12-29 华为技术有限公司 Cell selection method, auxiliary cell selection method, device and communication system
CN102186212A (en) * 2011-04-08 2011-09-14 中兴通讯股份有限公司 Intercell cooperation scheduling method, system and user equipment
CN102457964A (en) * 2010-10-20 2012-05-16 中兴通讯股份有限公司 Coordinated multipoint method and apparatus thereof

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2613178C2 (en) * 2011-01-07 2017-03-15 Интердиджитал Пэйтент Холдингз, Инк. Method, system and device for receiving downlink shared channel in cooperative multi-point transmissions

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101841356A (en) * 2009-03-18 2010-09-22 大唐移动通信设备有限公司 Method, device and system for feeding back channel quality information
CN101873282A (en) * 2009-04-24 2010-10-27 大唐移动通信设备有限公司 Multi-cell data transmission method and device
CN101931993A (en) * 2009-06-22 2010-12-29 华为技术有限公司 Cell selection method, auxiliary cell selection method, device and communication system
CN102457964A (en) * 2010-10-20 2012-05-16 中兴通讯股份有限公司 Coordinated multipoint method and apparatus thereof
CN102186212A (en) * 2011-04-08 2011-09-14 中兴通讯股份有限公司 Intercell cooperation scheduling method, system and user equipment

Also Published As

Publication number Publication date
CN102821476A (en) 2012-12-12

Similar Documents

Publication Publication Date Title
CN101931993B (en) Cell selection method, auxiliary cell selection method, device and communication system
CN107294583B (en) Channel state measuring method, device and storage medium
CN101989868B (en) Multi-cell cooperative transmission method, central controller and user equipment
CN101651880B (en) Multi-cell coordination sending method
CN109891963A (en) System and method for the reference signal of wave beam forming in three-dimensional multiple-input-multiple-output communication system
US9337906B2 (en) Feedback and scheduling for coordinated multi-point (CoMP) joint transmission (JT) in orthogonal frequency division multiple access (OFDMA)
CN104038319A (en) Channel state information (CSI) feedback method and user equipment
CN107733500B (en) Channel state information measurement feedback method and device
CN101997587A (en) Method and device for determining channel quality indicator (CQI) value in coordinated multi-point transmission/reception (COMP)
KR20110033079A (en) Methods of mitigating interference in wireless system having multiple-transmitting/receiving nodes using received channel information
KR20130130593A (en) Method and apparatus for measuring reference signal in wireless communication system comprising a plurality base station using a distributed antenna
KR101280854B1 (en) Method and device for multiple-cell collaborative communication in mimo system
CN104813730A (en) Method and apparatus for performing scheduling in wireless communication system
WO2021249515A1 (en) Channel information feedback method, communication apparatus and storage medium
CN102186212A (en) Intercell cooperation scheduling method, system and user equipment
CN101854201B (en) Multicell cooperative transmission method
CN103326764A (en) Method and device for obtaining downlink channel quality information
CN101990307A (en) Method for lowering implicit feedback overhead by dynamic threshold under multiple user-multiple input multiple output (MU-MIMO)
CN102821476B (en) Multi-cell joint processing method based on weighed sum metric
CN107872260B (en) Communication method and network equipment
CN103402260B (en) Method and system for selecting cooperative set in cooperative multipoint communication
CN102170328B (en) CoMP terminal capable of supporting double system and feedback method
KR20120097028A (en) Method and apparatus for precoding mode selection with joint processing/transmission based on linited feedback in mobile communication system
CN102325375A (en) Resource allocation method and device
JP6143790B2 (en) Data transmission method and apparatus in wireless communication 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
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20170829

Address after: 100070, No. 188, building 25, No. eighteen, South Fourth Ring Road, Fengtai District, Beijing, 1, 101

Patentee after: Beijing Haiyun Technology Co. Ltd.

Address before: 510663, No. 3, color road, Science City, Guangdong, Guangzhou

Patentee before: New Post Communication Equipment Co., Ltd.