The example 2 will be explained. The explanation of a configuration similar to that of the
above-mentioned example is omitted.

[0072]
The scheduler 324 calculates the metric of each RB by assuming that the number of CoMP points is simply initialized as single point, i.e., N=1 for candidate CoMP UEs as well as for other non-CoMP UEs.

[0073]
The scheduler 324 calculates the metrics of all UEs on each RB and ranks the calculated metrics RB by RB.

[0074]
Among the calculated metrics, the scheduler 324 finds the highest metric and regards its owner UE as the watched UEV also called the highest. U.E. According to, the metric ranking on each unallocated. RBs, the scheduler can allocate the RB to the highest UE when the top metric is belong to this UE.

[0075]
When the watched UE is a candidate CoMP UE, the scheduler 324 calculates T(N=1) of highest RB based on the CQI assuming N=1 CoMP point. Further, the scheduler 324 calculates T(N+1) by using combined CQI when N+1 CoMP points are used for synchronous transmission on the allocated RBs of the watched UE.

[0076]
The scheduler 324 compares the calculated T(N=1) and T(N+1). If T(N+1)>T(N), the scheduler
increases N as N=N+1. This iteration process will stop only if the maximum T(N0) is achieved.
Therefore, the number of the CoMP points is decided as N=N0. Then, CoMP points are decided too, since above process have already assumed combination of CoMP point.

[0077]
After CoMP point decision, the scheduler 324 updates the metric ranking when N0 is unequal to the initialized N (N=1 in this example). Firstly, the metrics of the watched UE with initialized N is deleted and then replaced by the metric as N=N0. The metric ranking is updated by using the new metric with N=N0 of the watched UE.

[0078]
The scheduler 324 performs the above-mentioned process until all the RBs are allocated or all UEs are allocated, where the candidate CoMP UEs have also decided their CoMP point(s).

[0079]
The above-mentioned process is carried out cell-by-cell. After all cells have finished the above
mentioned process, the scheduler 324 coordinates the resource allocation for the CoMP UEs. When a CoMP UE is allocated different RB(s) from its CoMP points, the scheduler 324 makes coordination for this uncommonly allocated RB. One coordination method is to release the uncommonly allocated RB to another UE, who can be the UE with lower metric than the allocated UE in the metric ranking list of this RB. When a CoMP UE is not allocated the RB of CoMP points as a result of coordination, the scheduler will allocate the CoMP UE in the next scheduling time.

[0080]
An operation of this example is described below. For Example 2, the detailed flowchart of step 406 and step 407 in the Step 404 is shown in Fig. 6 and described as follows.

[0081]
In step 406 of Fig. 6, there are two steps, step 601 and 602. In step 601, the number of CoMP points is initialized as N=1 and the cell index starts from 0. Next, in step 602, the metric calculation and ranking use CQI assuming initialized N=1 CoMP point for CoMP UE candidates as well as for other non-CoMP UE to carry out channel-dependent scheduling. Here, the PF metric is explained in Math.
1.

[0082]
In step 407 of Fig. 6, the step 603 firstly allocates each unallocated RB to the UE with highest metric.
Among the allocated RBs, the scheduler 324 finds the RB with highest metric and regards its owner UE-as the watched UE,also called the, highest UE..Then,Jhe step .604 checks whether the highfst UE (the UE with highest PF metric) is a candidate CoMP UE or not. If yes, go to step 605; otherwise, go to step 609. The step 605 checks whether this candidate CoMP UE has already decided N or not.

[0083]
If yes, go to step 609; otherwise, go to step 606. In step 606, the achievable T(N) of this candidate
CoMP UE is calculated based on CQI of the allocated RB(s). T(N) and T(N+1) are calculated by
assuming N and N+1 CoMP points, respectively. Next, the step 607 compares T(N) and T(N+1) and checks whether NT(N) or not.

[0084]
If yes, go to step 608, where N is increased as N=N+1; otherwise, go to step 609. Accordingly, the number of CoMP points is decided as N=N0 to achieve highest T(N0). Then, CoMP points are decided too. After the CoMP point decision, the step 609 checks whether all RBs or UEs are allocated.

[0085]
If yes, go to step 610; otherwise, go to step 602 in step 406 to update the metric ranking. The step
610 checks whether the current cell is the last cell. If yes, go to step 611; otherwise, go to step 612 to move to the next UE and then go to step 602 in step 606 to update the metric ranking. In step 611, the coordination after resource allocation for each cell is carried out. For each CoMP UE, if the allocated RB is not commonly allocated at each CoMP point, the scheduler will replace the owner of this RB by the next UE with lower metric. The output of step 611 is the information about allocated RBs for each UE.

[0086]
Making a configuration like this example enables to improve both average sector throughput and
cell-edge user throughput.

[0087]

The scheduler 324 in the example 3 will be explained. The explanation of a configuration similar to that of the above-mentioned example is omitted.

[0088]
The scheduler 324 calculates the metric of each RB of the UE by assuming that the number of CoMP points is simply initialized as single point, i.e., N=Nmax (Nmax: maximum number of CoMP points) for candidate CoMP UEs but N=1 for other non-CoMP UE.

[0089]
The scheduler 324 calculates the metrics of all UEs on each RB and ranks the calculated metrics RB by RB. Among the allocated RBs, the scheduler 324 finds the RB with highest metric and regards its owner UE as the watched UE, also called the highest UE. According to the metric ranking on each unallocated RBs, the scheduler can allocate the RB to the highest UE when the top metric is belong to this UE.

[0090]
Over the allocated RBs, the scheduler 324 calculates T(N=Nmax) of the watched UEs based on the CQI assuming Nmax CoMP point. Further, the scheduler 324 calculates T(N-1) by using combined CQI when N-.1 CoMP.points !are,used for „synchronous-transmission, on the allocated RB.s of.the watched UE.

[0091]
The scheduler 324 compares the calculated T(N) and T(N-1). If N>1 and T(N)1 and T(N)
The scheduler 324 in the example 4 will be explained. The explanation of a configuration similar to that of the above-mentioned example is omitted.

[0103]
The scheduler 324 calculates the metric of each of the resource blocks (RBs) of all UEs. For a
candidate CoMP UE, the metrics are calculated by using the CQl assuming all combinations of the CoMP points.

[0104]
The scheduler 324 ranks the calculated metrics RB by RB.

[0105]
Among the cafcufated metrics, the scheduler 324 finds the RB with the highest metric and regards its owner UE as the watched UE, also called the highest UE.

[0106]
When the watched UE is a candidate CoMP UE, the scheduler 324 decides the number of CoMP
points "N0" for this watched UE based on the RB with the highest metric. Then, CoMP points are
decided too, since above process have already assumed combination of CoMP point.

[0107]
After CoMP point decision, the scheduler 324 deletes the metric with N unequal to N0 and updates the metric ranking by using the metric of N=N0. In addition, the scheduler 324 allocates the RBs to the watched UE when the top metric belongs to this UE.

[0108]
The scheduler 324 perform the above mentioned process until.all the RBs are allocated, or all UEst are allocated, where the candidate CoMP UEs have also decided their CoMP point(s).

[0109]
The above-mentioned process is carried out cell-by-cell. After all cells have finished the above
mentioned process, the scheduler 324 coordinates the resource allocation for the CoMP UEs. When a CoMP UE is allocated different RB(s) from its CoMP points, the scheduler 324 coordinates different owner UEs on this uncommonly allocated RB. One coordination method is to release the uncommonly allocated RB to another UE, who can be the UE with lower metric than the allocated UE in the metric ranking list of this RB. When a CoMP UE is not allocated the RB of CoMP points as a result of coordination, the scheduler will allocate the CoMP UE in the next scheduling time.

[0110]
An operation of this example is described below. For Example 4, the detailed flowchart of step 406 and 407 in the Step 404 is shown in Fig. 8 and described as follows. In step 406 of Fig 8, there are two steps, step 801 and 802. In step 407 of Fig. 8, there are ten steps, step 803 to 812.

[0111]
In step 801, the number of CoMP points of candidate CoMP UEs is initialized as N=1~Nmax, while for other UEs, N=1. Here, the cell index starts from 0. The starts cell index is optional.

[0112]
Next, in step 802, the metric calculation and ranking use CQI of different UEs with initialized N CoMP points for channel-dependent scheduling. Here, the PF metric is explained in Math. 1.

[0113]
In step 803, the scheduler firstly finds the RB with the highest metric and regards its owner UE as the watched UE called the highest UE.

[0114]
In step 804, the scheduler checks whether the highest UE is a candidate CoMP UE or not. If yes, go to step 805; otherwise, go to step 808.

[0115]
In step 805, the scheduler checks whether this candidate CoMP UE has already decided N0 or not. If yes, go to step 808; otherwise, go to step 806.

[0116]
In step 806, the number N0 of CoMP points is decided as N=N0 since N0 CoMP points can achieve the highest metric. Then, CoMP points are decided too.

[0117]
After the CoMP point decision, in step 807, the scheduler deletes the UE's metric with N unequal to N0 from the metric ranking list. If the highest metric of unallocated RB belongs to the current UE, this RB is allocated in the step 808.

[01181
In step 809, scheduler checks whether all RBs or UEs are allocated. If yes, go to step 810; otherwise, go to step 802 in block 406 to update the metric ranking.

[0119]

After the-reseurce-allocation and point decision have been completed in the current cell.the step 810.. _ of the scheduler checks whether the current cell is the last cell. If yes, go to step 811; otherwise, go to step 812 to move to the next cell and then go to step 802 in block 406 to calculate and rank the metrics of the UEs belong to the cell.

[0120]
In step 811, the scheduler coordinates after resource allocation for each cell. For each CoMP UE, if the allocated RB is not commonly allocated at each CoMP point, the scheduler will replace the owner of this RB by the next UE with lower PF metric. The output of step 811 is the information about allocated RBs for each UE.

[0121]

Making a configuration like this example enables to improve both average sector throughput and cell-edge user throughput.

[0122]

The scheduler 324 in the example 5 will be explained. The explanation of a configuration similar to that of the above-mentioned example is omitted.

[0123]
The scheduler 324 calculates the metric of each RB by assuming that the number of CoMP points is simply initialized as single point, i.e., N=1 for candidate CoMP UEs as well as for other non-CoMP UEs.

[0124]
Among the calculated metrics, the scheduler 324 finds the RB with highest metric and regards its owner UE as the watched UE, also called the highest UE.

[0125]
When the watched UE is a candidate CoMP UE, the scheduler 324 firstly finds out the RB with the highest metric belong to this watched UE and calculates the T(N) based on the CQI assuming N=1 CoMP point. Further, the scheduler 324 calculates T(N+1) by using combined CQI when N+1 CoMP points are used for synchronous transmission on this RB.

[0126]
The scheduler 324 compares the calculated T(N) and T(N+1). If the rate T(N+1)>T(N), the scheduler increases N as N=N+1. This iteration process will stop only if the maximum T(N) is achieved. Therefore, the number of the CoMP points is decided as N=N0. Then, CoMP points are decided too, since above process have already assumed combination of CoMP point.

[0127]
After CoMP point decision, the scheduler 324 releases the allocated RBs with metric of N unequal to No of watched UE. In addition, the metric ranking is updated by deleting the metrics of the watched UE or calculating the metric as N=N0. After updating the metric ranking, the scheduler 324 allocates the RBs to the watched UE of which the metric is highest.

[0128] The scheduler 324 performs the above-mentioned process until all the RBs are allocated or all UEs are allocated, where the candidate CoMp LIEs have decided their CoM P. point(s).,., „:. _

[0129]
The above-mentioned process is carried out cell-by-ce!l. After all cells have finished the above
mentioned process, the scheduler 324 coordinates the resource allocation for the CoMP UEs. When a CoMP UE is allocated different RB(s) from its CoMP points, the scheduler 324 makes coordination for this uncommonly allocated RB. One coordination method is to release the uncommonly allocated RB to another UE, who can be the UE with lower metric than the allocated UE in the metric ranking list of this RB. When a CoMP UE is not allocated the RB of CoMP points as a result of coordination, the scheduler will allocate the CoMP UE in the next scheduling time.

[0130]
An operation of this example is described below. For Example 5, the detailed flowchart of block 406 and 407 in the Step 404 is shown in Fig. 9 and described as follows. In block 406 of Fig 9, there are two steps, step 901 and 902. In block 407 of Fig. 9, there are eleven steps, step 903 to 912.

[0131]
In step 901, the number of CoMP points is initialized as N=1 and the cell index starts from 0. Next, in step 902, the metric calculation and ranking use CQI assuming initialized N=1 CoMP points for CoMP UE candidates as well as for other non-CoMP UE to carry out channel-dependent scheduling. Here, the PF metric is explained in Math. 1.

[0132]
In block 407 of Fig. 9, the step 903 firstly finds the RB with highest metric. Among the allocated RBs, the scheduler 324 finds the RB with highest metric and regards its owner UE as the watched UE, also called the highest UE. Then, the step 904 checks whether the highest UE (the UE with highest PF metric) is a candidate CoMP UE or not. If yes, go to step 905; otherwise, go to step 909. The step 905 checks whether this candidate CoMP UE has already decided N0 or not. If yes, go to step 909; otherwise, go to step 906. In step 906, the achievable normalized sum rate of this candidate CoMP UE is calculated based on the allocated RB(s). T(N) and T(N+1) are calculated by assuming N and N+1 CoMP points, respectively. Next, the step 907 compares T(N) and T(N+1) and checks whether NT(N) or not.

[0133]
If yes, go to step 908, where N is increased as N=N+1; otherwise, go to step 909. Accordingly, the number of CoMP points is decided as N=N0 to achieve highest metric. If the highest metric of
unallocated RB is the metric of the current UE with N0 CoMP points, this RB is allocated in the step 909.

[0134]
After the allocation, the step 910 checks whether all RBs or UEs are allocated. If yes, go to step 911;

otherwise, go to step 902 in block 406 to update the metric ranking.

[0135]
After the resource allocation and point decision have been completed in the current cell, the step 911 checks whether the current cell is the last cell. If yes, go to step 912; otherwise, go to step 913 to move to the next cell and then go to step 902 in block 406 to calculate and rank the metrics of the UEs belong to the, cell.

[0136]
In step 912, the scheduler coordinates after resource allocation for each cell. For each CoMP UE, if the allocated RB is not commonly allocated at each CoMP point, the scheduler will replace the owner of this RB by the next UE with lower PF metric. The output of step 912 is the information about allocated RBs for each UE.

[0137]
Making a configuration like this example enables to improve both average sector throughput and
cell-edge user throughput.

[0138]

The scheduler 324 in the example 6 will be explained. The explanation of a configuration similar to that of the above-mentioned example is omitted.

[0139]
The scheduler 324 calculates the metric of each RB by assuming that the number of CoMP points is simply initialized as single point, i.e., N= Nmax for candidate CoMP UEs but N=1 for other non-CoMP UE.

[0140]
The scheduler 324 ranks the calculated metrics RB by RB. Among the calculated metrics, the
scheduler 324 finds the RB with highest metric and regards its owner UE as the watched UE, also
called the highest UE.

[0141]
When the watched UE is a candidate CoMP UE, the scheduler 324 firstly finds the RB with highest metric belong to this watched UE. The scheduler 324 calculates T(N=Nmax) of the watched UEs based on the CQI assuming Nmax CoMP point. Further, the scheduler 324 calculates a sum rate T(N-1) by using combined CQI when N-1 CoMP points are used for synchronous transmission on the allocated RBs of the watched UE.

[0142]
The scheduler 324 compares the calculated T(N) and T(N-1). If N>1 and T(N)1 and T(N)
The example 7 is explained below. The scheduler 324 in the example 7 will be explained. The
explanation of a configuration similar to that of the above-mentioned example is omitted.

[0156]
The scheduler 324 calculates the metric of each of the resource blocks (RBs) of all UEs. For a
non-CoMP UE, e.g., a UE close to cell-center, only single point transmission is used, i.e., N=1. For a candidate CoMP UE, the metrics are calculated by using the CQI assuming all combinations of the CoMP points. Here, the combination of the CoMP points means to select different number of CoMP points. The number of the CoMP points, N, is a numerical value ranging from "1 to Nmax°, where the maximum value Nmax of the CoMP point may be pre-decided.

[0157]
The scheduler 324 ranks the calculated metrics RB by RB. Among the calculated metrics, the
scheduler 324 finds and allocates the RB with the highest metric and regards its owner UE as the
watched UE, also called the highest UE.

[0158]
When the watched UE is a candidate CoMP UE, the scheduler 324 temporarily decides number of
CoMP points based on this allocated RB only. The temporarily decided number of CoMP points is called N0. Next, the scheduler 324 deletes the metrics assuming N unequal to N0 in the metric ranking list and then finds out the unallocated RBs for the following allocation, whose highest metric is assuming N equal to N0. Then, the scheduler 324 tries to allocate one more RB to the watched UE and adjust N0 to achieve highest normalized sum rate of allocated RBs. The RBs are allocated one-by-one for a candidate CoMP UE and the N0 is adjusted as followings.

[0159]
Next, the scheduler 324 calculates T(N0) of all the allocated RBs based on the CQI assuming N0 CoMP points. Further, the scheduler 324 calculates the sum rate T(N0-1) by using combined CQI when N0-1 CoMP points are used for synchronous transmission on the allocated RBs of the watched UE. The scheduler 324 compares the calculated rate T(N0) and T(N0-1). If N0>1 and the rate T(No)1 and T(N)
The example 8 is explained below. The scheduler 324 in the example 8 will be explained. The explanation of a configuration similar to that of the above-mentioned example is omitted.

[0175]
The scheduler 324 calculates the metric of each RB of all UEs. For a candidate CoMP UE, the metrics are calculated by using the CQI assuming N=1.

[0176]
The scheduler 324 ranks the calculated metrics RB by RB.

[0177]
Among the calculated metrics, the scheduler 324 finds and allocates the RB with the highest metric and regards its owner UE as the watched UE, also called the highest UE.

[0178]
When the watched UE is a candidate CoMP UE, the scheduler 324 firstly calculates T(N=1) of the watched UEs based on the CQI assuming N=1 CoMP point. Further, the scheduler 324 caicuiates T(N+1) by using combined CQI when N+1 CoMP points are used for synchronous transmission on the allocated RBs of the watched UE. The scheduler 324 compares the calculated T(N=1) and T(N+1). If T(N+1)>T(N), the scheduler increases N as N=N+1. This iteration process will stop only if the maximum T(N0) is achieved. Therefore, N is temporally decided as N0. Next, the scheduler 324 ..-.,,...,-.,updates-the .metric ranking list by,using.metric ktefcle-for the watched .UE and then finds ,.finds out ..the unallocated RBs with the highest metric belongs to the watched UE. Then, the scheduler 324 tries to allocate one more RB to the watched UE and adjust N0 to achieve highest sum rate of allocated RBs. The RBs are allocated one-by-one for a candidate CoMP UE and the N0 is adjusted as followings.

[0179]
Next, the scheduler 324 calculates T(N0) of the allocated RBs based on the CQI assuming N0 CoMP points. Further, the scheduler 324 calculates T(N0-1) by using combined CQI when N0-1 CoMP points are used for synchronous transmission on the allocated RBs of the watched UE. The scheduler 324 compares the calculated T(N0) and T(N0-1). If N0>1 and T(N0)T(N) or not. If yes, go to step 1208, where N is increased as N=N+1; otherwise, N is temporally decided as N0 in step 1209.

[0189]
When the allocated RB is not the first one, the step 1210 calculates the achievable normalized sum rate of this candidate CoMP based on CQI of all the allocated RBs. T(N0) and T(N0-1) are calculated by assuming N0 and N0-1 CoMP points, respectively. Next, the step 1211 compares T(N0) and T(N0-1) and checks whether N0>1 and T(N0)
The scheduler 324 in the example 9 will be explained. The explanation of a configuration similar to that of the above-mentioned example is omitted.

[0194]
The scheduler 324 calculates the metric of each RB of the UE by assuming that the number of CoMP points is simply initialized as single point, i.e., N=Nmax (Nmax: maximum number of CoMP points) for eandidate-CoMP-UEs but N=1 for other non-CoMP~UE

[0195]
The scheduler 324 calculates the metrics of all UEs on each RBs and ranks the calculated metrics
RB by RB.

[0196]
Among the allocated RBs, the scheduler 324 finds and allocates the RB with highest metric and
regards its owner UE as the watched UE, also called the highest UE.