CN102577567B - A kind of communication system, communication means, base station, subscriber equipment and program thereof - Google Patents

Abstract

It is an object of the invention to provide a kind of by considering the spectrum efficiency after there is the different channel dependent that may combine of CoMP point and dispatch, dynamically determine the technology of CoMP point.According to the present invention it is proposed that a kind of wireless communication system, it is characterised by by using the information relevant with scheduling, determines the quantity that the CoMP (multipoint cooperative is launched and receives) of subscriber equipment puts.

Description

A kind of communication system, communication means, base station, subscriber equipment and program thereof

Technical field

The present invention relates generally to communication, and more particularly, to for CoMP (coordinated multipoint Transmission and reception, multipoint cooperative is launched and receives) put the technology adjudicated, wherein said CoMP point judges Multipoint cooperative for using in the cellular system is launched.

Background technology

In order to meet the demand of the High-speed wireless access more than 3G cellular system, E-UTRA (Evolved UMTS Terrestrial Radio Access, evolution UMTS land wireless access) it is standardized as at 3GPP (3rd Generation Partnership Project, third generation partner program) in LTE (Long Term Evolution, Long Term Evolution) wireless access.Since in March, 2008,3GPP has begun to the senior IMT's as senior LTE Standardization.The Target peak rate of senior LTE is respectively for downlink and 1Gbps and 500Mbps [1] of up-link. Higher spectrum efficiency is needed compared with LTE.Meanwhile, senior LTE it is also contemplated that with the backward compatibility of rel.8LTE because its Exhibition is the enhancing of LTE.

Downlink CoMP is considered as to improve cell edge throughput and/or improve the system for the senior LTE of 3GPP The key technology [2] of handling capacity.

100 and 200 in FIG are shown respectively not to be possessed CoMP (w/o CoMP) and possesses the descending of CoMP (w/CoMP) The example that link (DL:downlink, downlink) transmits.In FIG, 1 (101) is only put for UE (user Equipment, subscriber equipment) 104 transmission in by evolution.UE 104 is from point 1 reception signal, but is affected by a little 2 (102) and point The interference of 3 (103).But, in 200, three points, i.e. put 1 (201), point 2 (202) and point 3 (203) and relate to cooperation transmission.I Use " CoMP point " to represent the point relating to cooperation transmission, it can be eNode-B (eNB), community or other kinds of joint Point, the remote antenna such as connected by optical fiber [3]." CoMP UE " is the UE with more than one CoMP point.

Joint transmission and cooperative scheduling/cooperative beam for downlink CoMP shape and have been agreed as senior The candidate scheme of LTE.In both cases, multiple CoMP points are with identical spectrum position Resources allocation block (RB:resource Block, Resource Block).In the case of joint transmission, multiple CoMP points transmit data to CoMP UE 204 simultaneously.Such as Figure 200 Example shown in, UE 204 is CoMP UE.Interference from point 2 (202) and point 3 (203) is converted into signal to improve CoMP The reception signal of UE 204.With regard to Signal to Interference plus Noise Ratio (SINR:signal-to-interfernce plus noise Ratio, Signal to Interference plus Noise Ratio) for CoMP gain from the diversity gain of all CoMP points, i.e. put 1 (201), point 2 (202) and point 3 (203).But, in the case of cooperative scheduling, only CoMP point 1 (201) transmit data to CoMP UE 204, And the interference from CoMP point 2 (202) and 3 (203) is cancelled.CoMP gain for SINR is from CoMP point 2 (202) With 3 (203) interference avoid.

How to select CoMP point that the CoMP gain for cell edge user throughput and average sector throughput is had Tremendous influence.When not having suitably selected CoMP point, (suitably selected CoMP point is potential in order to include for Combined Treatment Receive by force signal or in order to alleviate the strong jamming to cooperative scheduling) time, CoMP gain can be restricted.

The traditional method selecting CoMP point is to use fixing CoMP point to calculate and be arranged for channel dependent scheduling PF tolerance (proportional fairness metric, equitable proportion measure).Such as, Fig. 2 illustrates and holds in the scheduler The flow chart of the traditional method of row, is described as follows it:

In step 1, scheduler receives UE feedback.UE feedback includes that UE measures long-term average channel information, such as in [3] (RSRP:reference signal received power, reference signal receives merit to the Reference Signal Received Power of middle use Rate) or [4] in geometry (geometry).Community RSRP for considering is confirmed as the power of resource element and distributes (with W table Show) on linear averaging, wherein said resource element carries specific cell reference signal in the measurement frequency bandwidth considered.Several What is average signal and interference plus noise ratio (SINR) in the presence of shade and path loss.

Except information above, UE feedback also includes CQI (CQI:channel quality Indicator, CQI), it is used for representing the change of channel status, wherein said survey in measuring channel width Amount channel is on each RB in RS bandwidth.Such as, in LTE, the feedback cycle for RSRP can be 120～ 200ms etc. [5]；And the feedback cycle being used for CQI can be 2ms, 5ms, 10ms etc. [6].

In step 2, each UE is performed community (or other kinds of point) sequence.For each UE, to community (point) sequence is as follows:

X_{M, δ}≥X_{M, 1}≥X_{M, 2}…

Wherein

X_{M, δ}For the u the UE feedback RSRP represented with dB obtained from step 1 or the geometry of δ community.

In step 3, select candidate CoMP point for each UE, and the UE that will have more than a candidate CoMP point regards For candidate CoMP UE.For the u UE, will have the highest X_{M, δ}Point be elected to be Serving cell, it is always CoMP point.Except clothes Business community, also will have X_{M, δ}≥X_{M, 0}The community selected as candidates CoMP point of-Threshold, wherein Threshold is for represent with dB Predefined parameter.Such as, for Low threshold, the UE that only can will be close to cell edge is set to candidate CoMP UE, its energy CoMP is enough used to improve its handling capacity.

Step 4 includes step 306,307 and 308.Within step 306, for each candidate CoMP UE, by candidate N number of point in CoMP point is fixed as CoMP point.Correspondingly, when 1 CoMP point of N ＞ is chosen, candidate CoMP UE is judged as CoMP UE；It addition, as N=1, candidate CoMP UE is reduced to non-CoMP UE.

After judgement CoMP point, in step 307, scheduling metrics is calculated also by the preparation for channel dependent scheduling Sequence.For CoMP UE, the CoMP with fixing N number of CoMP point the CQI improved is for metric calculation；And, for other UE, uses the CQI not possessing CoMP (N=1).

In step S308, distribute RB to all of UE.Based on tolerance sequence, perform resource distribution.When UE has N ＞ 1 During individual CoMP point, channel dependent scheduling has the Resource Block of same frequency spectrum position in the distribution of each CoMP point.

In last step 5, scheduling result is notified to UE, the position of the RB such as distributed and quantity by scheduler.

Reference listing

Non-patent literature

[PTL 1] 3GPP, TR36.913 (V8.0.1), " Requirements for Further Advancements For E-UTRA (LTE-Advanced), " June 2008

[PTL 2] 3GPP, TR36.814 (V1.0.0), " Further Advancements for E-UTRA Physical Layer Aspects”

[PTL 3] R1-091484, NTT DOCOMO, 3GPP TSG-RAN WG1#56bis, March 23,27th 2009

[PTL 4] R1-084173, Samsung, 3GPP TSG-RAN WG1#55, November 10-14,2008

[PTL 5] 3GPP, TS 36.331 (V8.7.0)

[PTL 6] 3GPP, TS 36.213 (V8.4.0)

Summary of the invention

Technical problem

Although the environment adjacent that the quantity of CoMP point relies on base station is dynamic, traditional method sorts for scheduling metrics With the CoMP point that resource distribution arranges fixed qty.When UE has 1 CoMP point of N ＞, channel adjusts the use of dependency degree to pass through The CQI that CoMP improves, and there is the RB of same frequency spectrum position in the distribution of each CoMP point.By using at N number of CoMP point Common RB, CoMP UE increases due to the CQI of raising up to rate.But, it is insufficient to up to rate when having the instantaneous of CoMP Time big, i.e. less than when not possessing N times up to rate of CoMP instantaneous, and spectrum efficiency (rate-to-spectrum ratio, complete One-tenth rate frequency ratio) reduce.Therefore, traditional method has a problem in that fixing N number of CoMP point does not consider in channel dependent scheduling Whether spectrum efficiency increases afterwards.

By considering the spectrum efficiency after the channel dependent scheduling that the difference with CoMP point may combine, we Want dynamically to adjudicate CoMP point Resources allocation block effectively.

The method of solution problem

It is wireless communication system for solving first invention of the problems referred to above, it is characterised in that relevant with scheduling by using Information determine the quantity that the CoMP (multipoint cooperative launch and receive) of subscriber equipment puts.

It is base station for solving second invention of the problems referred to above, it is characterised in that by using the information relevant with scheduling true Surely the quantity that the CoMP (multipoint cooperative is launched and receives) of subscriber equipment puts is arrived.

It is subscriber equipment for solving the 3rd invention of the problems referred to above, it is characterised in that use the CoMP of quantification (many Point cooperation launch and receive) point communicate, the quantity of wherein said CoMP point be based on use and the scheduling carried out by base station Relevant information determines.

It is coordinator for solving the 4th invention of the problems referred to above, it is characterised in that by using the information relevant with scheduling Determine the quantity that the CoMP (multipoint cooperative is launched and receives) of subscriber equipment puts.

It is wireless communications method for solving the 5th invention of the problems referred to above, it is characterised in that relevant with scheduling by using Information determine the quantity that the CoMP (multipoint cooperative launch and receive) of subscriber equipment puts.

For solving the record medium that the 6th invention of the problems referred to above is storage signal procedure, described program makes computer Perform following process: by using the information relevant with scheduling to determine CoMP (the multipoint cooperative transmitting and connecing of subscriber equipment Receive) quantity put.

For solving the record medium that the 7th invention of the problems referred to above is storage signal procedure, described program makes computer Perform following process: use CoMP (multipoint cooperative is launched and the receives) point of quantification to communicate, wherein said CoMP point Quantity be based on use the information relevant with the scheduling carried out by base station determine.

The beneficial effect of the invention

Dynamic CoMP point judgement and efficient resource distribution suppose that all or part of CoMP point combines the tune that calculates and sort Degree tolerance.By comparing the channel dependent scheduling result of the scheduling metrics using different calculating, improve spectrum efficiency.To carry The method gone out compares with traditional method, can obtain for cell edge user throughput and average sector throughput Bigger CoMP gain.

Accompanying drawing explanation

In order to the present invention and its advantage are more fully understood, description below are combined with accompanying drawing and carries out reference, its In identical reference number represent identical parts:

Fig. 1 illustrates possess CoMP and do not possess the example that the DL of CoMP transmits.

Fig. 2 illustrates the flow chart of traditional method.

Fig. 3 illustrates an example of the block diagram of the present invention.

Fig. 4 illustrates the generalized flow chart of the method for proposition.

Fig. 5 illustrates the flow chart of example 1.

Fig. 6 illustrates the flow chart of example 2.

Fig. 7 illustrates the flow chart of example 3.

Fig. 8 illustrates the flow chart of example 4.

Fig. 9 illustrates the flow chart of example 5.

Figure 10 illustrates the flow chart of example 6.

Figure 11 illustrates the flow chart of example 7.

Figure 12 illustrates the flow chart of example 8.

Figure 13 illustrates the flow chart of example 9.

The explanation of reference number

310UE (subscriber equipment)

311 reference signal transmitters

312 data sources

313 controllers

314 antennas

315 receivers

320eNodeB

321 reference signal receivers

322 data receivers

323 controllers

324 schedulers

325 transmitters

326 antennas

Detailed description of the invention

Fig. 4 discussed below to 13 and be used for illustrating that the embodiment of principle of the present invention is merely intended to be illustrative of, and not Limitation of the scope of the invention should be construed to by any way.It will be appreciated by those skilled in the art that can be in any suitable configurations Wireless network in perform the principle of the present invention.

First, the structure of this embodiment will be explained.Fig. 3 is the schematic diagram of the wireless communication system 300 of the present invention.Channel radio Communication system 300 includes multiple UE (User Equipment, subscriber equipment) 310 and multiple eNodeB 320.

UE 310 includes UE feedback transmitter 311, data transmitter 312, controller 313, antenna 314 and receiver 315.

UE feedback transmitter 311 generates UE feedback, and is transmitted to as each of Serving cell via antenna 314 eNodeB 320.UE feedback includes the long-term average channel information of the measurement of each for all eNodeB, such as RSRP.

Data transmitter 312 generates real data, and is transmitted to eNodeB 320 via antenna 314.

When receiving the pilot signal from eNodeB, RSRP (reference signal measured by controller 313 Received power, Reference Signal Received Power), (channel quality index, channel quality refers to for geometry or CQI Number) be used as eNodeB UE feedback.

Receiver 315 receives the various data or control information launched from eNodeB 320.

ENodeB 320 is the point of such as base station.ENodeB 320 includes feedback receiver 321, data receiver 322, control Device 323 processed, scheduler 324, transmitter 325 and antenna 326.

Feedback receiver 321 receives the feedback information generated by UE.UE feedback can be exchanged between eNodeB be used for assisting Make launch or receive.Data receiver 322 receives the real data generated by UE.Each in the enodeb of controller 323 Several controls of individual function executing, such as, launch the control of power etc..Scheduler 324 performs resource distribution, and distributes based on resource Generate schedule information.It addition, perform the cooperation launched or receive also for CoMP UE, will be described hereinafter its details.Launch Machine 325 launches schedule information via antenna 326.

It follows that the method that will explain that the present invention proposes.

First, the generalized flow chart of method figure 4 illustrates, and is described as follows it.

In step 401, scheduler 324 receives the UE feedback information about all of point (such as, community) near UE.

In step 402, community (or other kinds of point) sequence is performed for each UE.For each UE, right Ranking cells is as follows.

X_{M, δ}≥X_{M, 1}≥X_{M, 2}…

Wherein

X_{M, δ}The u UE feedback information (u and δ is as natural number) of δ the community for representing with dB.

Work as X_{M, δ}During for UE feedback RSRP or geometry, UE feedback RSRP or geometry obtain from step 401.

Work as X_{M, δ}During for the CQI information of RB of distribution, the position of the RB of distribution obtains (explained later on) from step 404.

In step 403, select candidate CoMP point for each UE, and will there is the UE more than a candidate CoMP point It is considered as candidate CoMP UE.For the u UE, will have the highest X_{M, δ}Point be elected to be Serving cell, its always CoMP point.Also will tool There is X_{M, δ}≥X_{M, 0}The community selected as candidates CoMP point of-Threshold, wherein Threshold is the predefined ginseng represented with dB Number.

In step 404, for tolerance sequence, the CoMP point of candidate CoMP UE is not fixing.Firstly, for scheduling degree Amount calculates and sequence, initializes the quantity of CoMP point.It follows that for CoMP candidate UE, combine execution CoMP point judgement and money Source is distributed.Correspondingly, the CoMP point determined and allocation result for carrying out the renewal of tolerance sequence to the distribution of ensuing resource. Step 406 includes initialization and the tolerance sequence of CoMP point.By using initialized N number of CoMP point when starting, sequence is adjusted Degree tolerance, then by using CoMP point and the scheduling result of the determination from step 407 output, updates scheduling metrics.In step In rapid 407, perform the judgement of CoMP point and resource distribution for each UE.The result of step 407 will be for updating in step 406 Tolerance sequence.

In step 405, scheduling result is notified to UE, the such as position of the RB distributed and quantity by scheduler.

It follows that following discussion provides the method that example 1～9 illustrates to propose.The flow chart of 9 examples is based on Fig. 4 In generalized flow chart, but there is different steps 404.By respectively to example 1～9 interpretation procedure 404 in Fig. 5～13 In step 406 and the flow chart of step 407.Judgement quantity " N about CoMP point₀", example 1～9 uses relevant with scheduling Information.The information relevant with scheduling is the information used by scheduling, such as, and PF tolerance, CQI or QoS etc..Note as example We calculate scheduling metrics according to PF tolerance.Scheduling metrics can be based on maximum CQI standard, service quality (QoS) etc..Preferably The information relevant with scheduling calculated in the case of scheduling in the enodeb.It addition, about distribution, example 1～9 considers supposing The partly or entirely information relevant with scheduling in the case of CoMP point.

In example 1 below～3, first the step 404 in Fig. 4 is performed Resources allocation block, followed by judgement CoMP point. Select the best of breed of CoMP point to obtain the norme superieure summation rate of the RB of distribution.Since step 406 suppose different at the beginning of Beginningization, then respective handling in step 407 is the most different for each example.

In example 4～6, first the step 404 in Fig. 4 is performed judgement CoMP point, followed by Resources allocation block.Select The best of breed of CoMP point to obtain highest spectral efficiency specification based on the RB with the maximum metric belonging to candidate CoMPUE Rate.After this, by using the CoMP point of quantification to allocate resources to this UE.

In example 7～9, the step 404 in Fig. 4 is performed recursively judgement CoMP point and Resources allocation block.Scheduler 324 first distribution have the RB RB based on this distribution of maximum metric and adjudicate quantity N of CoMP point provisionally.Then, scheduling Device 324 distributes another RB as possible and regulates N₀To obtain the norme superieure summation rate of the RB of distribution.By using latest update N₀, RB is individually assigned to candidate CoMP UE.Until all of RB with the maximum metric belonging to this UE is allocated, and And the quantity of CoMP point is also determined, this repeats to process and stops.

Correspondingly, when the structure that exemplary dispatch device is sorted to community UE by UE in the above explanation, it is possible to use Sequence community, UE side and be transmitted to the structure of eNode B.

<example 1>

It is explained below example 1.The scheduler 324 in example 1 will be explained.

Scheduler 324 calculates the tolerance of each Resource Block (RB) of all UE.For such as near center of housing estate UE's Non-CoMP UE, only uses unicast, i.e. N=1.For candidate CoMP UE, such as near the UE of cell edge, by using Assuming that the CQI of all combinations of CoMP point, computation measure.Here, the combination of CoMP point refers to select the CoMP of varying number Point.Quantity N of CoMP point is from " 1 to N_max" numerical value, wherein can predefine the maximum N of CoMP point_max。

Scheduler 324 RB one by one gives on ground the tolerance sequence calculated.Among the tolerance calculated, scheduler 324 finds the highest Tolerance, and its owner UE is considered as observed UE, also referred to as the highest UE.It addition, when its tolerance is the highest, scheduler 324 RB is distributed to observed UE.

When observed UE is candidate CoMP UE, first the RB of the distribution of this observed UE is divided into not by scheduler 324 Same group, each group has the tolerance of the CoMP point supposing equal number.It follows that scheduler 324 calculates belongs to each group The specification summation rate of distribution RB.When RB is simultaneously allocated on N number of CoMP point, it will be assumed that the specification of the group of N number of CoMP point Summation rate (T (N)) is defined as the summation led by the estimated data of f (N) specification.Here, f (N) is the function of N, such as

F (N)=max (1, α N), and 0 ＜ α ＜ 1 is correction factor.

The comparison of the specification summation rate according to the CoMP point supposing varying number, scheduler 324 is finally based on norme superieure Summation rate, determines the quantity " N of the CoMP point for this observed UE₀”.Then CoMP point is also determined, because said process is Through supposing the combination of CoMP point.The quantity of the CoMP point determined is " N₀" below.

After CoMP point is adjudicated, scheduler 324 release has the allocated RB of the tolerance of N, and wherein N is not equal to observed The N of UE₀.It addition, have the tolerance of N by deletion to update tolerance sequence, wherein N is not equal to the N of observed UE₀。

Scheduler 324 performs said process, until the allocated or all of UE of all of RB is allocated, and wherein candidate CoMP UE has had also determined that their CoMP point.

Ground, community performs said process one by one.After all of community has been completed said process, scheduler 324 is right CoMP UE coordinated resource allocation.When CoMP UE is allocated different RB from its CoMP point, scheduler 324 is this improper point The RB joined coordinates different owner UE.One method coordinated is discharge the RB of improper distribution to another UE, described separately One UE can be the UE with less for UE tolerance than distribution in the tolerance sorted lists of this RB.When as coordinating result When CoMP UE is not previously allocated the RB of CoMP point, scheduler will distribute CoMP UE within next scheduling time.

The operation of this example is described below.For example 1, the step 406 in step 404 and the detailed process of step 407 In fig. 5 it is shown that and be described as follows.In the step 406 of Fig. 5, there is two steps, step 501 and step 502.At Fig. 5 Step 407 in have 10 steps, i.e. step 503 is to step 512.

In step 501, the quantity of the CoMP point of candidate CoMP UE is initialized as N=1～N_max；And for other UE, N=1.Here, cell index is from the beginning of 0.It is optional for starting cell index.

It follows that in step 502, metric calculation and sequence use have the different UE's of initialized N number of CoMP point CQI is to carry out channel dependent scheduling.Here, PF tolerance is construed to following example:

PF#N={PF^#N(u, k) }

Wherein ${\mathrm{PF}}^{\#N}(u,k)=\frac{1}{f\left(N\right)}\frac{{\mathrm{Rate}}^{\#N}(u,k)}{\stackrel{\&OverBar;}{\mathrm{Rate}\left(u\right)}}---(\mathrm{Math}.1)$

And

In step 503, first scheduler finds the UE with maximum metric, and it is considered as the highest UE.When top degree When amount belongs to this UE, sorting according to the tolerance on each unappropriated RB, RB can be assigned to the highest UE by scheduler.

In step 504, scheduler verifies whether the highest UE is candidate CoMP UE.If it is, to step 505；No Then, to step 509.

In step 505, whether scheduler verifies this candidate CoMP UE it has been determined that N₀(quantity of N:CoMP point).False In this way, to step 509；Otherwise, to step 506.

In step 506, scheduler is to each N=1～N_maxCalculate T (N).Due to for current candidate CoMP UE's Tolerance is by supposing N=1～N_maxCalculate, therefore the RB of distribution can include the RB with the tolerance of various N.

In step 507, work as N₀Individual CoMP point can obtain the highest T (N₀) time, scheduler determines N=N₀.Then CoMP Point is also determined.

In step 508, it is known that the N determined₀, scheduler release supposes that N is not equal to N₀The RB distributing to UE.

In step 509, scheduler verifies whether all of RB or UE is allocated.If it is, to step 510；Otherwise arrive Step 502 in step 406 is to update tolerance sequence.

After being complete resource distribution and some judgement in current area, the step 510 of scheduler verifies current area Whether it is last community.If it is, to step 511；Otherwise arrive step 512 to move to next community, then arrive step Step 502 in 406 is to calculate and the tolerance of the UE belonging to this community that sorts.

In step 511, after the resource for each community is distributed, scheduler coordinates.For each CoMP UE, if the RB of distribution is not normally allocated at each CoMP point, then use is had lower PF degree by scheduler The next UE of amount replaces the owner of this RB.Step 511 is output as the information about the RB distributed for each UE.

Use this such structure of this example can improve average ceU throughput and cell edge user throughput.

<example 2>

Example 2 will be explained.The explanation of the structure similar with above-mentioned example will be omitted.

Being simply initialized as a single point by the quantity supposing CoMP point, scheduler 324 calculates the tolerance of each RB, I.e. for candidate CoMP UE and for other non-CoMP UE, N=1.

Scheduler 324 calculates the tolerance of all UE on each RB the tolerance calculated that sorts one by one RB.

Among the tolerance calculated, the highest tolerance found out by scheduler 324, and is considered as observed by its owner UE UE, also referred to as the highest UE.When the tolerance on top belongs to this UE, sort according to the tolerance on each unappropriated RB, adjust RB can be distributed to the highest UE by degree device.

When observed UE is candidate CoMP UE, scheduler 324 CQI based on N=1 CoMP point of supposition, calculate The T (N=1) of high RB.And, when N+1 CoMP point for observed UE distribution RB on synchronous transfer time, scheduler 324 calculate T (N+1) by use combination CQI.

T (N=1) and the T (N+1) calculated is compared by scheduler 324.If T (N+1) ＞ T (N), then scheduler increases Adding N is N=N+1.As long as obtaining maximum T (N₀), then this repetitive process will stop.Therefore, the quantity of CoMP point is confirmed as N= N₀.Then, CoMP point is also determined, because above procedure has assumed that the combination of CoMP point.

After CoMP point is adjudicated, work as N₀When being not equal to initialized N (N=1 in this example), scheduler 324 updates Tolerance sequence.First, delete the tolerance of the observed UE with initialized N, then use N=N₀Tolerance replace.Pass through Use has N=N₀The new tolerance of observed UE update tolerance sequence.

Scheduler 324 performs said process, until the allocated or all of UE of all of RB is allocated, and wherein candidate CoMP UE also determines their CoMP point.

Ground, community performs said process one by one.After all of community is complete said process, scheduler 324 for CoMP UE coordinated resource allocation.When CoMP UE is allocated different RB from its CoMP point, scheduler 324 is improper to this The RB of distribution coordinates.One coordination approach is that the RB of improper distribution is released to another UE, wherein said another UE can be to have the UE that less measures of UE than distribution in the tolerance sorted lists of this RB.When as coordinating result CoMP When UE is not previously allocated the RB of CoMP point, scheduler will distribute CoMP UE within next scheduling time.

The operation of this example is described below.For example 2, the step 406 in step 404 and the detailed process of step 407 Figure 6 illustrates and be described as follows.

In the step 406 of Fig. 6, there is two steps, step 601 and step 602.In step 601, by CoMP point Quantity is initialized as N=1, and cell index is from the beginning of 0.It follows that in step 602, scheduling calculates and sequence uses vacation The CQI of fixed initialized N=1 CoMP point performs channel dependent to be dispatched, wherein for CoMP UE candidate and other is non- CoMP UE, N=1.Here, PF tolerance is explained in Math.1.

In the step 407 of Fig. 6, first each unappropriated RB is distributed to the UE with maximum metric by step 603. Among allocated RB, the RB with maximum metric found out by scheduler 324, and its owner UE is considered as observed UE, Also referred to as the highest UE.Then, step 406 verifies whether the highest UE (having the UE of the highest PF tolerance) is candidate CoMP UE.If It is, to step 605；Otherwise, to step 609.Whether step 605 verifies this candidate CoMP UE it has been determined that N.

If it is, to step 609；Otherwise, to step 606.In step 606, the CQI of RB based on distribution, calculating should The retrievable T (N) of candidate CoMP UE.By supposing N number of and N+1 CoMP point respectively, calculate T (N) and T (N+1).Connect down Coming, T (N) and T (N+1) is compared by step 607, and verifies whether N ＜ N_maxAnd T (N+1) ＞ T (N).

If it is, to step 608, wherein N is increased to N=N+1；Otherwise arrive step 609.Correspondingly, the number of CoMP point Amount is confirmed as N=N₀To obtain the highest T (N₀).Then, CoMP point is also determined.After CoMP point is adjudicated, step 609 school Test whether all of RB or UE is allocated.

If it is, to step 610；Otherwise, to the step 602 in step 406 to update tolerance sequence.Step 610 verifies Whether current area is last community.If it is, to step 611；Otherwise arrive step 612 to move to next UE, then Step 602 in step 606 is to update tolerance sequence.In step 611, it is distributed in the resource for each community After, perform coordination.For each CoMP UE, if the RB of distribution is not normally distributed at each CoMP point, then Use is had the next UE of lower tolerance to replace the owner of this RB by scheduler.Step 611 is output as about to often The information of the RB of one UE distribution.

Use the such structure of this example can improve average sector throughput and cell edge user throughput.

<example 3>

The scheduler 324 in example 3 will be explained.Omit the explanation of the structure identical with above-mentioned example.

Being simply initialized to a single point by the quantity supposing CoMP point, scheduler 324 calculates the degree of each RB of UE Amount, i.e. for candidate CoMP UE, N=N_max(N_max: the maximum quantity of CoMP point), and for other non-CoMP UE, N=1.

Scheduler 324 calculates the tolerance of all of UE at each RB, and the tolerance sequence calculated is given on RB ground one by one.In distribution RB in, scheduler 324 finds the RB with maximum metric, and its owner UE is considered as observed UE, also referred to as the highest UE. Sorting according to the tolerance on each unappropriated RB, when top tolerance belongs to this UE, RB can be distributed to by scheduler High UE.

On the RB of distribution, scheduler 324 is based on supposing N_maxThe CQI of individual CoMP point, calculates the T (N=of observed UE N_max).Further, when N-1 CoMP point synchronous transfer on the RB of the distribution of observed UE, scheduler 324 is by using The CQI of combination calculates T (N-1).

T (N) and the T (N-1) calculated is compared by scheduler 324.If N ＞ 1 and T (N) ＜ T (N-1), then dispatch Device updates N=N-1.As long as obtaining maximum T (N₀), then this process will stop.Therefore, N is confirmed as N₀.Then, CoMP point also by Determine, because above procedure has assumed that the combination of CoMP point.

After CoMP point is adjudicated, work as N₀It is not equal to initialized N (N=N in this example_max) time, scheduler 324 is more Newly measure sequence.First, delete the tolerance of the observed UE with initialized N, and use N=N₀Tolerance replace.Logical Cross use and there is N=N₀The new tolerance of observed UE update tolerance sequence.

Scheduler 324 performs said process, until the allocated or all of UE of all of RB is allocated, and wherein candidate CoMP UE also determines their CoMP point.

Ground, community performs said process one by one.After all of community completes said process, scheduler 324 for CoMP UE coordinated resource allocation.When CoMP UE is allocated different RB from its CoMP point, scheduler 324 is to this improper point The RB joined coordinates.One method coordinated is discharge the RB of improper distribution to another UE, and another UE described is permissible It is, in the tolerance sorted lists of this RB, there is the UE of the less tolerance of UE than distribution.When as the result CoMP UE coordinated When being not previously allocated the RB of CoMP point, scheduler will distribute CoMP UE within next scheduling time.

The operation of this example is described below.For example 3, the step 406 in step 404 and the detailed process of step 407 Figure 7 illustrates, and be described as follows.

In the step 406 of Fig. 7, there is two steps, step 701 and step 702.In step 701, by CoMP point Quantity is initialized as N=N_max, and cell index is from the beginning of 0.It follows that in a step 702, metric calculation and sequence use Assuming that initialized N=N_maxThe CQI of individual CoMP point with perform channel dependent scheduling, wherein for CoMP UE candidate and its Its non-CoMP UE, N=N_max.Here, PF tolerance is explained in Math.1.

In the step 407 of Fig. 7, first step 703 finds the RB with maximum metric, and is considered as by its owner UE Observed UE, also referred to as the highest UE.Sort according to the tolerance on each unappropriated RB, when top tolerance belongs to this UE, RB can be distributed to the highest UE by scheduler.

Then, step 904 verifies whether the highest UE (having the UE of the highest PF tolerance) is candidate CoMP UE.If it is, arrive Step 705；Otherwise arrive step 709.Whether step 705 verifies this candidate CoMP UE it has been determined that N₀。

If it is, to step 709；Otherwise arrive step 706.In step 706, the CQI of RB based on distribution, calculate this time Select the retrievable specification summation rate of CoMP UE.By supposing that N and N-1 CoMP point calculates T (N) and T (N-1) respectively.Connect down Coming, step 707 compares T (N) and T (N+1), and verifies whether N ＞ 1 and T (N) ＜ T (N-1).

If it is, to step 708, wherein N is reduced to N=N-1；Otherwise arrive step 709.Correspondingly, the number of CoMP point Amount is confirmed as N=N₀To obtain norme superieure summation rate.After CoMP point is adjudicated, step 709 verifies all of RB or UE Whether it is allocated.

If it is, to step 710；Otherwise, to the step 702 in step 406 to update tolerance sequence.Step 710 verifies Whether current area is last community.If it is, to step 711；Otherwise arrive step 712 to move to next UE, then Step 702 in step 706 is to update tolerance sequence.In step 711, it is distributed in the resource for each community After, perform coordination.For each CoMP UE, if the RB of distribution is normally distributed at each CoMP point, then use There is the next UE of lower tolerance to replace the owner of this RB.Step 711 is output as about distributing each UE The information of RB.

Use the such structure of this example can improve average sector throughput and cell edge user throughput.

<example 4>

The scheduler 324 in example 4 will be explained.Omit the explanation of the structure identical with above-mentioned example.

Scheduler 324 calculates the tolerance of each Resource Block (RB) of all UE.For candidate CoMP UE, by using vacation Determine the CQI of all combinations of CoMP point, computation measure.

Scheduler 324 RB one by one gives on ground the tolerance sequence calculated.

Among the tolerance calculated, scheduler 324 finds the RB with maximum metric, and is considered as being seen by its owner UE Examine UE, also referred to as the highest UE.

When observed UE is candidate CoMP UE, scheduler 324, based on having the RB of maximum metric, determines for this quilt Observe the quantity " N of the CoMP point of UE₀”.Then, CoMP point is also determined, because said process has had assumed that the group of CoMP point Close.

After CoMP point is adjudicated, scheduler 324 deletion has N and is not equal to N₀Tolerance, and use N=N₀Tolerance Update tolerance sequence.It addition, when top tolerance belongs to this UE, RB is distributed to observed UE by scheduler 324.

Scheduler 324 performs said process, until the allocated or all of UE of all of RB is allocated, and wherein candidate CoMP UE also determines their CoMP point.

Ground, community performs said process one by one.After all of community completes said process, scheduler 324 for CoMP UE coordinated resource allocation.When CoMP UE is allocated different RB from its CoMP point, scheduler 324 is this improper point The RB joined coordinates different owner UE.One coordination approach is that the RB of improper distribution is released to another UE, described separately One UE can be the UE with less for UE tolerance than distribution in the tolerance sorted lists of this RB.When as coordination When result CoMP UE is not previously allocated the RB of CoMP point, scheduler will distribute CoMP UE within next scheduling time.

The operation of this example is described below.Detailed stream for example 4, step 406 in step 404 and step 407 Journey figure 8 illustrates, and is described as follows.In the step 406 of Fig. 8, there is two steps, step 801 and step 802.? The step 407 of Fig. 8 exists 10 steps, step 803 to step 812.

In step 801, the quantity of the CoMP point of candidate CoMP UE is initialized as N=1～N_max, and for other UE, N=1.Here cell index is from the beginning of 0.The index of the community started is optional.

In step 802, metric calculation and sequence use the CQI of the different UE with initialized N number of CoMP point to enter Row channel dependent is dispatched.Here PF tolerance is explained in Math.1.

In step 803, first scheduler finds the RB with maximum metric, and is considered as observed by its owner UE UE, also referred to as the highest UE.

In step 804, scheduler verifies whether the highest UE is candidate CoMP UE.If it is, to step 805；Otherwise arrive Step 808.

In step 805, whether scheduler verifies this candidate CoMP UE it has been determined that N₀.If it is, to step 808；No Then arrive step 806.

In step 806, because N₀Individual CoMP point can obtain the highest tolerance, quantity N of CoMP point₀It is confirmed as N= N₀.Then CoMP point is also determined.

After CoMP point is adjudicated, in step 807, scheduler deletion from tolerance sorted lists has N and is not equal to N₀ The tolerance of UE.If the maximum metric of unappropriated RB belongs to current UE, distribute this RB the most in step 808.

In step 809, scheduler verifies whether all of RB or UE is allocated.If it is, to step 810；Otherwise, arrive Step 802 in square frame 406 is to update tolerance sequence.

After being complete resource distribution and some judgement in current area, the step 810 of scheduler verifies current area Whether it is last community.If it is, to step 811；Otherwise arrive step 812 to move to next community, then arrive square frame Step 802 in 406 is to calculate and the tolerance of the UE belonging to this community that sorts.

In step 811, after the resource for each community is distributed, scheduler coordinates.For each CoMP UE, if the RB of distribution is not normally distributed at each CoMP point, then use is had more low by scheduler The next UE of amount replaces the owner of this RB.Step 811 is output as about the information to the RB that each UE distributes.

Use the such structure of this example can improve average sector throughput and cell edge user throughput.

<example 5>

The scheduler 324 in example 5 will be explained.The explanation of the structure identical with above-mentioned example will be omitted.

Scheduler 324 is by supposing that the quantity of CoMP point is simply initialized to a single point calculates the degree of each RB Amount, i.e. for candidate CoMP UE and other non-CoMP UE, N=1.

Among the tolerance calculated, scheduler 324 finds the RB with maximum metric, and is considered as being seen by its owner UE Examine UE, also referred to as the highest UE.

When observed UE is candidate CoMP UE, first scheduler 324 finds has the topnotch belonging to this observed UE The RB of amount, and based on supposing the CQI of N=1 CoMP point, calculate T (N).Further, when N+1 CoMP point is at this RB Synchronous transfer time, scheduler 324 calculates T (N+1) by the CQI that use is combined.

Scheduler 324 compares the T (N) and T (N+1) of calculating.If ratio T (N+1) ＞ T (N), then scheduler increases N is N =N+1.As long as obtaining maximum T (N), then this repetitive process will stop.Therefore, the quantity of CoMP point is confirmed as N=N₀.So After, CoMP point is also determined, because above procedure has assumed that the combination of CoMP point.

After CoMP point is adjudicated, scheduler 324 discharges the N that has of observed UE and is not equal to N₀The distribution of tolerance RB.It addition, by deleting the tolerance of observed UE or calculating N=N₀Tolerance, update tolerance sequence.Updating tolerance sequence Afterwards, RB is assigned to tolerance for the highest observed UE by scheduler 324.

Scheduler 324 performs said process, until the allocated or all of UE of all of RB is allocated, and wherein candidate CoMP UE also determines their CoMP point.

Ground, community performs said process one by one.After all of community completes said process, scheduler 324 for CoMP UE coordinated resource allocation.When CoMP UE is allocated different RB from its CoMP point, scheduler 324 is to this improper point The RB joined coordinates.One coordination approach is that the RB of improper distribution is released to another UE, another UE wherein said Can be the UE in the tolerance sorted lists of this RB with less for the UE tolerance than distribution.When as result CoMP coordinated When UE is not previously allocated the RB of CoMP point, scheduler will distribute CoMP UE within next scheduling time.

The operation of this example is described below.For example 5, the detailed process of square frame 406 and 407 in step 404 exists Shown in Fig. 9, and it is described as follows.In the square frame 406 of Fig. 9, there is two steps, step 901 and step 902.Fig. 9's In square frame 407, there is 11 steps, step 903 to step 912.

In step 901, the quantity of CoMP point is initialized as N=1, and cell index is from the beginning of 0.It follows that In step 902, metric calculation and sequence use the CQI supposing initialized N=1 CoMP point to adjust to perform channel dependent Degree, wherein for CoMP UE candidate and other non-CoMP UE, N=1.Here PF tolerance is explained in Math.1.

In the square frame 407 of Fig. 9, first step 903 finds the RB with maximum metric.Among the RB of distribution, scheduling Device 324 finds the RB with maximum metric, and its owner UE is considered as observed UE, also referred to as the highest UE.Then, step 904 verify whether the highest UE (having the UE of the highest PF tolerance) is candidate CoMP UE.If it is, to step 905；Otherwise arrive step Rapid 909.Whether step 905 verifies this candidate CoMP UE it has been determined that N₀.If it is, to step 909；Otherwise arrive step 906. In step 906, RB based on distribution, calculate the retrievable specification summation rate of this candidate CoMP UE.By supposing N respectively With N+1 CoMP point, calculate T (N) and T (N+1).It follows that step 907 compares T (N) and T (N+1), and verify whether N ＜ N_maxAnd T (N+1) ＞ T (N).

If it is, to step 908, wherein N is increased to N=N+1；Otherwise arrive step 909.Correspondingly, the number of CoMP point Amount is confirmed as N=N₀To obtain maximum metric.If the maximum metric of unappropriated RB is for having N₀The current UE of individual CoMP point Tolerance, then in step 909, distribute this RB.

After the distribution, step 910 verifies whether all of RB or UE is allocated.If it is, to step 911；Otherwise, arrive Step 902 in square frame 406 is to update tolerance sequence.

After being complete resource distribution and some judgement in current area, step 911 verifies whether current area is After community.If it is, to step 912；Otherwise arrive step 913 to move to next community, then to the step in square frame 406 Rapid 902 to calculate and the tolerance of the UE belonging to this community that sorts.

In step 912, after the resource for each community is distributed, scheduler performs coordination.For each CoMP UE, if the RB of distribution is not normally distributed at each CoMP point, then use is had lower PF by scheduler The next UE of tolerance replaces the owner of this RB.Step 912 is output as about the information to the RB that each UE distributes.

Use the such structure of this example can improve average sector throughput and cell edge user throughput.

<example 6>

Scheduler 324 in example 6 will be explained.The explanation of the structure identical with above-mentioned example will be omitted.

Scheduler 324 calculates each RB of UE by supposing to be simply initialized to the quantity of CoMP point a single point Tolerance, i.e. for candidate CoMP UE, N=N_max, and for other non-CoMP UE, N=1.

Scheduler 324 RB one by one gives on ground the tolerance sequence calculated.In the tolerance calculated, scheduler 324 finds to be had The RB of amount of height, and its owner UE is considered as observed UE, also referred to as the highest UE.

When observed UE is candidate CoMP UE, first scheduler 324 finds has the topnotch belonging to this observed UE The RB of amount.Scheduler is based on supposing N_maxThe CQI of individual CoMP point, calculates the T (N=N of observed UE_max).Further, when N-1 CoMP point for observed UE distribution RB on synchronous transfer time, the CQI that scheduler 324 is combined by use calculates always With rate T (N-1).

T (N) and the T (N-1) calculated is compared by scheduler 324.If N ＞ 1 and T (N) ＜ T (N-1), then dispatch Device updates N=N-1.As long as obtaining maximum T (N₀), then this process will stop.Therefore, N is confirmed as N₀.Then, CoMP point also by Determine, because above procedure has assumed that the combination of CoMP point.

After CoMP point is adjudicated, scheduler 324 discharges the N that has of observed UE and is not equal to N₀The RB of distribution.It addition, By deleting the tolerance of observed UE or calculating N=N₀Tolerance update tolerance sequence.It addition, RB is distributed by scheduler 324 Give the observed UE that tolerance is the highest.

Scheduler 324 performs said process, until the allocated or all of UE of all of RB is allocated, and wherein candidate CoMP UE also determines their CoMP point.

Ground, community performs said process one by one.After all of community completes said process, scheduler 324 for CoMP UE coordinated resource allocation.When CoMP UE is allocated different RB from its CoMP point, scheduler 324 is improper to this The RB of distribution coordinates.One coordination approach is that the RB of improper distribution is released to another UE, and another UE described can To be the UE in the tolerance sorted lists of this RB with less for the UE tolerance than distribution.When as result CoMP coordinated When UE is not previously allocated the RB of CoMP point, scheduler will distribute CoMP UE within next scheduling time.

The operation of this example is described below.For example 6, the detailed process of square frame 406 and 407 in step 404 exists Shown in Figure 10, and it is described as follows.In the square frame 406 of Figure 10, there is two steps, step 1001 and step 1002.? In the square frame 407 of Figure 10, there is 11 steps, step 1003 to step 1013.

In the square frame 406 of Figure 10, there are two steps, step 1001 and 1002.In step 1001, by CoMP point Quantity is initialized as N=N_max, and cell index is from the beginning of 0.It follows that in step 1002, metric calculation and sequence use Assuming that initialized N=N_maxThe CQI of individual CoMP point performs channel dependent scheduling, wherein, for CoMP UE candidate and Other non-CoMP UE, N=N_max.Here PF tolerance is explained in Math.1.

In the square frame 407 of Figure 10, first step 1003 finds the RB with the highest PF.In the RB of distribution, scheduler 324 find the RB with maximum metric, and its owner UE is considered as observed UE, also referred to as the highest UE.Then, step 1004 verify whether the highest UE is candidate CoMP UE.

If it is, to step 1005；Otherwise arrive step 1009.It is the most true that step 1005 verifies this candidate CoMP UE Determine N₀.If it is, to step 1009；Otherwise arrive step 1006.In step 1006, the CQI of RB based on distribution, calculate this time Select the retrievable specification summation rate of CoMP UE.By supposing that N and N-1 CoMP point calculates T (N) and T (N-1) respectively.Connect Getting off, step 1007 compares T (N) and T (N+1), and verifies whether N ＞ 1 and T (N) ＜ T (N-1).

If it is, to step 1008, wherein N is reduced to N=N-1；Otherwise arrive step 1009.Correspondingly, CoMP point Quantity is confirmed as N=N₀To obtain maximum metric.Then CoMP point is also determined.If the maximum metric of unappropriated RB is There is N₀The tolerance of the current UE of individual CoMP point, then distribute this RB in step 1009.

After the distribution, step 1010 verifies whether all of RB or UE is allocated.If it is, to step 1011；Otherwise, Step 1002 in square frame 406 is to update tolerance sequence.

After being complete resource distribution and some judgement in current area, step 1011 verifies whether current area is After community.If it is, to step 1012；Otherwise arrive step 1013 to move to next community, then in square frame 406 Step 1002, scheduler calculates and the tolerance of the UE belonging to this community that sorts.

In step 1012, after distributing for each local resource, scheduler performs coordination.For each CoMP UE, if the RB of distribution is not normally distributed at each CoMP point, then use is had lower PF by scheduler The next UE of tolerance replaces the owner of this RB.Step 1012 is output as about the letter to the RB that each UE distributes Breath.

Use the such structure of this example can improve average sector throughput and cell edge user throughput.

<example 7>

Explained later example 7.The scheduler 324 in example 7 will be explained.The knot identical with the structure of above-mentioned example will be omitted The explanation of structure.

Scheduler 324 calculates the tolerance of each Resource Block (RB) of all UE.For non-CoMPUE, such as in community The UE of the heart, only uses the transmission of a single point, i.e. N=1.For candidate CoMP UE, by using all combinations supposing CoMP point CQI carry out computation measure.Here, the combination of CoMP point means to select the CoMP point of varying number.Quantity N of CoMP point be from " 1 arrives N_max" numerical value of value, wherein can predefine the maximum N of CoMP point_max。

The tolerance that the sequence of scheduler 324 RB one by one ground calculates.In the tolerance calculated, scheduler 324 finds and distributes tool There is the RB of maximum metric, and its owner UE is considered as observed UE, also referred to as the highest UE.

When observed UE is candidate CoMP UE, scheduler 324 is based only upon the RB of this distribution and temporarily determines CoMP point Quantity.The quantity of the CoMP temporarily determined point is referred to as N₀.It follows that scheduler 324 is deleted in tolerance sorted lists supposes N It is not equal to N₀Tolerance, then find the unappropriated RB for distributing afterwards, its maximum metric is for supposing that N is equal to N₀.Then, Another RB is distributed to observed UE by scheduler 324 as possible, and regulates N₀To obtain the norme superieure summation of the RB of distribution Rate.RB is distributed one by one for candidate CoMP UE, and to N₀Do following regulation.

It follows that scheduler 324 is based on supposing N₀The CQI of individual CoMP point, calculates the T (N of the RB of all distribution₀).Further, Work as N₀During synchronous transfer on the RB of the distribution of observed UE of-1 CoMP point, the CQI that scheduler 324 is combined by use Calculate summation rate T (N₀-1).Ratio T (the N that scheduler 324 will calculate₀) and T (N₀-1) compare.If N₀＞ 1 and T (N₀) ＜ T (N₀-1), then scheduler updates N₀=N₀-1.As long as obtaining maximum T (N₀), then this process will stop.This circulation repeats Resource distribution and the process of CoMP point regulation, until all of RB with the maximum metric belonging to this observed UE is allocated, And the quantity of CoMP point is also determined.It addition, CoMP point is also determined, because said process has assumed that the group of CoMP point Close.

Scheduler 324 performs said process, until the allocated or all of UE of all of RB is allocated, and wherein candidate CoMP UE also determines their CoMP point.

Ground, community performs said process one by one.After all of community completes said process, scheduler 324 for CoMP UE coordinated resource allocation.When CoMP UE is allocated different RB from its CoMP point, scheduler 324 is this improper point The RB joined coordinates different owner UE.One coordination approach is that the RB of improper distribution is released to another UE, described separately One UE can be this RB tolerance sorted lists in there is the UE of less for UE tolerance than distribution.When as the result coordinated When CoMP UE is not previously allocated the RB of CoMP point, scheduler will distribute CoMP UE within next scheduling time.

The operation of this example is described below.For example 7, the detailed process of the square frame 406 and 407 in step 404 is at figure Shown in 11, and it is described as follows.In the square frame 406 of Figure 11, there is two steps, step 1101 and step 1102.At figure In the square frame 407 of 11, there is 12 steps, step 1103 to 1104.

In step 1101, the quantity of the CoMP point of candidate CoMP UE is initialized as N=1～N_max, and for other UE, N=1.Here, cell index is from the beginning of 0.The index starting community is optional.

It follows that in step 1102, metric calculation and sequence use have the different UE's of initialized N number of CoMP point CQI is to carry out channel dependent scheduling.Here PF tolerance is explained in Math.1.

In step 1103, first scheduler finds and distributes the highest unappropriated RB (having the RB of maximum metric) to all Person UE.This owner UE is also referred to as the highest UE.

Then, in step 1104, scheduler verifies whether the highest UE is candidate CoMP UE.If it is, to step 1105；Otherwise arrive step 1111.

In step 1105, when the RB finding distribution is for the RB of first distribution of current candidate CoMP UE, arrive Step 1106；Otherwise, to step 1108.

In the case of the RB of first distribution, step 1106 can temporarily determine N=N₀To obtain maximum metric.? Before performing step 1111, step 1107 deletes, from tolerance sorted lists, the N having with determining temporarily₀The UE of unequal N Tolerance.

When the RB of distribution is not first, in step 1108, the CQI of scheduler RB based on all distribution, calculate The retrievable specification summation rate of this candidate CoMP.By supposing that N and N-1 CoMP point calculates T (N) and T (N-1) respectively. It follows that step 1109 compares T (N) and T (N-1), and verify whether N ＞ 1 and T (N) ＜ T (N-1).

If it is, to step 1110, wherein by N₀It is reduced to N₀=N₀-1；Otherwise arrive step 1111.Correspondingly, N₀By really Fixed to obtain the norme superieure summation rate of all distribution RB.After a judgement, whether step 1111 verifies all of RB or UE Allocated.

If it is, to step 1112；Otherwise, to the step 1102 in square frame 406 to update tolerance sequence.In current area In be complete resource distribution and some judgement after, step 1112 verifies whether current area is last community.

If it is, to step 1113；Otherwise arrive step 1114 to move to next community, then in square frame 406 Step 1102 is to calculate and the tolerance of the UE belonging to this community that sorts.In step 1113, in the resource for each community After distribution, perform coordination.For each CoMP UE, if the RB of distribution at each CoMP point not by normally minute Join, then use is had the next UE of lower tolerance to replace the owner of this RB by scheduler.Step 1113 is output as About the information to the RB that each UE distributes.

Use the such structure of this example can improve average sector throughput and cell edge user throughput.

<example 8>

Explained later example 8.The scheduler 324 in example 8 will be explained.Identical with the structure of above-mentioned example by omitting The explanation of structure.

Scheduler 324 calculates the tolerance of each RB of all UE.For candidate CoMP UE, suppose N=1's by using CQI carrys out computation measure.

The tolerance that the sequence of scheduler 324 RB one by one ground calculates.

In the tolerance calculated, scheduler 324 finds and distributes the RB with maximum metric, and is regarded by its owner UE For observed UE, also referred to as the highest UE.

When observed UE is candidate CoMP UE, scheduler 324 is primarily based on the CQI supposing N=1 CoMP point, calculates The T (N=1) of observed UE.Further, when N+1 CoMP point for observed UE distribution RB on synchronous transfer time, scheduling Device 324 calculates T (N+1) by the CQI that use is combined.T (N=1) and the T (N+1) calculated is compared by scheduler 324. If T (N+1) ＞ T (N), then N is increased to N=N+1 by scheduler.As long as obtaining maximum T (N₀), then this process will stop.Cause This, be temporarily defined as N by N₀.It follows that scheduler 324 is by using tolerance N=N for observed UE₀Update tolerance row Sequence, then finds the unappropriated RB with the maximum metric belonging to observed UE.Then, scheduler 324 is as possible by another RB distributes to observed UE, and regulates N₀To obtain the highest summation rate of the RB of distribution.Candidate CoMP UE is one by one distributed RB, and by N₀Regulate as follows.

It follows that scheduler 324 is based on supposing N₀The CQI of individual CoMP point, calculates the T (N of the RB of distribution₀).And, work as N₀- When 1 CoMP point is used for the synchronous transfer on the distribution RB of observed UE, the CQI that scheduler 324 is combined by use calculates T (N₀-1).T (the N that scheduler 324 will calculate₀) and T (N₀-1) compare.If N₀＞ 1 and T (N₀) ＜ T (N₀-1), then adjust Degree device updates N₀=N₀-1.As long as obtaining maximum specification summation rate, then this process will stop.This circulation repeat resource distribution and The process of CoMP point regulation, until all of RB with the maximum metric belonging to this observed UE is allocated, and CoMP point Quantity be also determined.It addition, CoMP point is also determined, because said process has assumed that the combination of CoMP point.

Scheduler 324 performs said process, until the allocated or all of UE of all of RB is allocated, and wherein candidate CoMP UE also determines their CoMP point.

Ground, community performs said process one by one.After all of community completes said process, scheduler 324 for CoMP UE coordinated resource allocation.When CoMP UE is allocated different RB from its CoMP point, scheduler 324 is this improper point The RB joined coordinates the different owners.One coordination approach is that the RB of improper distribution is released to another UE, described another Individual UE can be the UE in the tolerance sorted lists of this RB with less for the UE tolerance than distribution.When as the result coordinated When CoMP UE is not previously allocated the RB of CoMP point, scheduler will distribute CoMP UE within next scheduling time.

The operation of this example is described below.For example 8, the detailed process of the square frame 406 and 407 in step 404 is at figure Shown in 12, and it is described as follows.In the square frame 406 of Figure 12, there is two steps, step 1201 and step 1202.At figure In the square frame 407 of 12, there is 13 steps, step 1203 to 1215.

In step 1201, the quantity of the CoMP point of candidate CoMP UE is initialized as N=1, and cell index is from 0 Start.The index starting community is optional.

It follows that in step 1202, metric calculation and sequence use have the different UE's of initialized N number of CoMP point CQI is to carry out channel dependent scheduling.Here PF tolerance is explained in Math.1.

In step 1203, scheduler finds and distributes the highest RB (having the RB of the highest PF) to owner UE.This owns Person UE is also referred to as the highest UE.

Then, in step 1204, scheduler verifies whether the highest UE is candidate CoMP UE.If it is, to step 1205；Otherwise arrive step 1213.

In step 1205, when the RB finding distribution is for the RB of first distribution of current candidate CoMP UE, arrive Step 1206；Otherwise, to step 1210.

In the case of the RB of first distribution, in step 1206, scheduler RB's based on this first distribution CQI, calculates the retrievable specification summation rate of this candidate CoMP.By supposing N and N+1 CoMP point respectively, calculate T (N) and T (N+1).It follows that step 1207 compares T (N) and T (N+1), and verify whether N ＜ N_MAXAnd T (N+1) ＞ T (N).If It is, to step 1208, wherein N to be increased to N=N+1；Otherwise, N is temporarily defined as by step 1209 N₀。

When the RB of distribution is not first, the CQI of step 1210 RB based on all distribution, calculate this candidate CoMP's Retrievable specification summation rate.By supposing N respectively₀And N₀-1 CoMP point calculates T (N₀) and T (N₀-1).It follows that step Rapid 1211 compare T (N₀) and T (N₀, and verify whether N-1)₀＞ 1 and T (N₀) ＜ T (N₀-1).If it is, to step 1212, its Middle by N₀It is reduced to N₀=N₀-1；Otherwise arrive step 1213.

Correspondingly, the quantity of CoMP point is determined.After a judgement and resource distribution, step 1213 verifies all of Whether RB or UE is allocated.If it is, to step 1214；Otherwise, to the step 1202 in square frame 406 to update tolerance sequence. After being complete resource distribution and some judgement in current area, whether step 1214 verifies current area is last little District.

If it is, to step 1215；Otherwise arrive step 1216 to move to next community, then in square frame 406 Step 1202 is to calculate and the tolerance of the UE belonging to this community that sorts.In step 1215, in the resource for each community After distribution, perform coordination.For each CoMP UE, if the RB of distribution at each CoMP point not by normally minute Join, then use is had the next UE of lower tolerance to replace the owner of this RB by scheduler.Step 1215 is output as About the information to the RB that each UE distributes.

Use the such structure of this example can improve average sector throughput and cell edge user throughput.

<example 9>

The scheduler 324 in example 9 will be explained.Omit the explanation of the structure identical with the structure of above-mentioned example.

Scheduler 324 calculates each RB of UE by supposing to be simply initialized to the quantity of CoMP point a single point Tolerance, i.e. for candidate CoMP UE, N=N_max(N_max: the maximum quantity of CoMP point), and for other non-CoMP UE, N=1.

Scheduler 324 calculates the tolerance of all UE on each RB, and the tolerance sequence calculated is given on RB ground one by one.

In the RB of distribution, scheduler 324 finds and distributes the RB with maximum metric, and its owner UE is considered as by Observe UE, also referred to as the highest UE.

When observed UE is candidate CoMP UE, scheduler 324 is based on supposing N_maxThe CQI of individual CoMP point, calculates and is seen Examine the T (N=N of UE_max).Further, when N-1 CoMP point for observed UE distribution RB on synchronous transfer time, scheduler 324 CQI combined by use calculate T (N-1).T (N) and the T (N-1) calculated is compared by scheduler 324.If N ＞ 1 and T (N) ＜ T (N-1), then scheduler updates N=N-1.As long as obtaining maximum T (N₀), then this process will stop.Therefore, N is temporarily defined as N₀.Then, another RB is assigned to observed UE and regulates N by scheduler 324 as possible₀Allocated to obtain The norme superieure summation rate of RB.RB is distributed one by one to candidate CoMP UE, and to N₀Do following regulation.

It follows that scheduler 324 is based on supposing N₀The CQI of individual CoMP point, calculates the T (N of the RB of distribution₀).Further, N is worked as₀- During synchronous transfer on the RB of the distribution of observed UE of 1 CoMP point, the CQI that scheduler 324 is combined by use counts Calculate T (N₀-1).Ratio T (the N that scheduler 324 will calculate₀) and T (N₀-1) compare.If N₀＞ 1 and T (N₀) ＜ T (N₀- 1), then scheduler updates N₀=N₀-1.As long as obtaining maximum specification summation rate, then this process will stop.This circulation repeats resource and divides Join and the process of CoMP point regulation, until all of RB with the maximum metric belonging to this observed UE is allocated, and The quantity of CoMP point is also determined.It addition, CoMP point is also determined, because said process has assumed that the combination of CoMP point.

After CoMP point is adjudicated, scheduler 324 discharges having of observed UE and is not equal to N₀The distribution of tolerance of N RB.It addition, by deleting the tolerance of observed UE or calculating N=N₀Tolerance update tolerance sequence.

Scheduler 324 performs said process, until the allocated or all of UE of all of RB is allocated, and wherein candidate CoMP UE also determines their CoMP point.

Ground, community performs said process one by one.After all of community completes said process, scheduler 324 for CoMP UE coordinated resource allocation.When CoMP UE is allocated different RB from its CoMP point, scheduler 324 is this improper point Join RB and coordinate different owner UE.One coordination approach is that the RB of improper distribution is released to another UE, described another Individual UE can be the UE in the tolerance sorted lists of this RB with less for the UE tolerance than distribution.When as the result coordinated When CoMP UE is not previously allocated the RB of CoMP point, scheduler will distribute CoMP UE within next scheduling time.

The operation of this example is described below.For example 9, the detailed process of the square frame 406 and 407 in step 404 is at figure Shown in 13, and it is described as follows.

In step 1301, the quantity of CoMP point is initialized as N=N_max, and cell index is from the beginning of 0.It follows that In step 1302, metric calculation and sequence use and suppose initialized N=N_maxThe CQI of individual CoMP point is to carry out channel dependent Property scheduling.Here PF tolerance is explained in Math.1.

In the square frame 407 of Figure 13, step 1303 finds and distributes the highest RB (having the RB of the highest PF) to owner UE. This owner UE is also referred to as the highest UE.

Then, in step 1304, scheduler verifies whether the highest UE is candidate CoMP UE.If it is, to step 1305；Otherwise arrive step 1313.

In step 1305, when the RB finding distribution is for the RB of first distribution of current candidate CoMP UE, arrive Step 1306；Otherwise, to step 1310.

In the case of the RB of first distribution, in step 1306, scheduler is based on this first RB distributed CQI, calculates the retrievable specification summation rate of this candidate CoMP.By suppose respectively N and N-1 CoMP point calculate T (N) and T(N-1).It follows that step 1307 compares T (N) and T (N-1), and verify whether N ＞ 1 and T (N) ＜ T (N-1).If It is, to step 1208, wherein N to be reduced to N=N-1；Otherwise, N is temporarily defined as by step 1309 N₀。

When the RB of distribution is not first, the CQI of step 1310 RB based on all distribution, calculate this candidate CoMP's Retrievable specification summation rate.By supposing N respectively₀And N₀-1 CoMP point calculates T (N₀) and T (N₀-1).It follows that step Rapid 1311 compare T (N₀) and T (N₀, and verify whether N-1)₀＞ 1 and T (N₀) ＜ T (N₀-1).If it is, to step 1312, Wherein by N₀It is reduced to N₀=N₀-1；Otherwise arrive step 1313.

Correspondingly, the quantity of CoMP point is determined.Then, CoMP point is also determined.It is distributed in a judgement and resource After, step 1313 verifies whether all of RB or UE is allocated.If it is, to step 1314；Otherwise, to the step in square frame 406 Rapid 1302 to update tolerance sequence.After being complete resource distribution and some judgement in current area, step 1314 verification is worked as Whether front community is last community.

If it is, to step 1315；Otherwise arrive step 1316 to move to next community, then in square frame 406 Step 1302 is to calculate and the tolerance of the UE belonging to this community that sorts.In step 1315, in the resource for each community After distribution, perform coordination.For each CoMP UE, if the RB of distribution at each CoMP point not by normally minute Join, then use is had the next UE of lower tolerance to replace the owner of this RB by scheduler.Step 1315 is output as About the information to the RB that each UE distributes.

Use the such structure of this example can improve average sector throughput and cell edge user throughput.

For example 1～9, it is possible to perform the step 402 in the flow chart of Fig. 4 in two different ways.One simple Mode be to use the step 402 identical with the step 2302 of traditional method, as shown in Figure 33 00.In this case, service Community is defined as the community [1] of maximum RSRP.In this case, according to geometry, RSRP or RSRQ, step 402 is only The result using step 401 obtains ranking cells.Serving cell is always selected as CoMP point.

Another mode is different from traditional method, i.e. come by the result using the step 402 in Fig. 4 and step 404 It is dynamically updated the ranking cells of the result being previously assigned by use.Require that the scheduling result in previously subframe exists to update Ranking cells in present sub-frame.When Serving cell the instantaneous quality of reception be deteriorated time, Serving cell can not be elected to be for The CoMP point of current CoMP joint transmission.Therefore, Serving cell is the most always chosen as CoMP point.

The situation of the communication plan of LTE in 3 gpp used above explains.Communication plan is not limited to these, and And communication plan can such as WiMAX or wireless communication system etc..

Correspondingly, above-mentioned is the situation using scheduler to sort by calculating PF to measure.This is not limited to this, and dispatches QoS, CQI that device can be received by use or spectrum efficiency etc. sort.

It addition, the above-mentioned structure being to perform in the enodeb judgement CoMP point.This is not limited to this, and coordinator can connect By institute's necessary information, and perform.

It addition, each scheduling time or the most fixing cycle can be performed by the judging process of CoMP point.

Present invention can apply to up-link and downlink.

Claims (7)

1. a wireless communication system, it is characterised in that this wireless communication system includes:

Sequence based on the information relevant with scheduling determines that the multipoint cooperative of the hypothesis of user equipment (UE) is launched and receives CoMP The device of the quantity of point；

Based on a determination that the quantity of CoMP point of described hypothesis to the device of UE Resources allocation block；And

The summation rate of Resource Block based on described distribution determines the device of the quantity of described CoMP point.

2. wireless communication system as claimed in claim 1, wherein by supposing that some or all combinations of CoMP point consider Described determining, wherein said CoMP point is and the transmitting and receive relevant point of cooperating to UE.

3. a base station, it is characterised in that this base station includes:

Sequence based on the information relevant with scheduling determines that the multipoint cooperative of the hypothesis of user equipment (UE) is launched and receives CoMP The device of the quantity of point；

Based on a determination that the quantity of CoMP point of described hypothesis to the device of UE Resources allocation block；And

The summation rate of Resource Block based on described distribution determines the device of the quantity of described CoMP point.

4. base station as claimed in claim 3, wherein by supposing that some or all combinations of CoMP point consider described to determine, Wherein said CoMP point is to launch with to cooperating of UE and receive relevant point.

5. a coordinator, it is characterised in that this coordinator includes:

Sequence based on the information relevant with scheduling determines that the multipoint cooperative of the hypothesis of user equipment (UE) is launched and receives CoMP The device of the quantity of point；

Based on a determination that the quantity of CoMP point of described hypothesis to the device of UE Resources allocation block；And

The summation rate of Resource Block based on described distribution determines the device of the quantity of described CoMP point.

6. a wireless communications method, it is characterised in that sequence based on the information relevant with scheduling, determines subscriber equipment The multipoint cooperative assumed is launched and receives the quantity of CoMP point；

Based on a determination that the quantity of CoMP point of described hypothesis, to UE Resources allocation block；And

The summation rate of Resource Block based on described distribution, determines the quantity of described CoMP point.

7. wireless communications method as claimed in claim 6, wherein by supposing that some or all combinations of CoMP point consider Described determining, wherein said CoMP point is and the transmitting and receive relevant point of cooperating to UE.