IP Library › Granted Patent US 9,136,918
Granted Patent B2
US 9,136,918 · App. 13/482,118 · Granted Sep 15, 2015

Dynamic clustering for coordinated transmission in wireless communication systems

Inventors: Elvis M. G. Stancanelli (Fortaleza, BR); Tarcisio Maciel (Fortaleza, BR); Yuri C. B. Silva (Fortaleza, BR); Walter da Cruz Freitas, Jr. (Fortaleza, BR); Francisco R. P. Cavalcanti (Fortaleza, BR)
Assignee: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
H04B7/024
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,136,918
App. No.
13/482,118
Granted
Sep 15, 2015
Kind
B2
Abstract

Systems and methods provide for applying a clustering based assignment algorithm (CbAA) in a telecommunication system. A method includes: receiving strength information for transmission points belonging to an associated Coordinated Multi-Point (CoMP)-cell; determining the clustering subsets, wherein the step of determining the clustering subsets includes: applying a k-means algorithm to the strength information to form K clusters; identifying the cluster associated with each UE; associating a cluster to each transmission point in accordance to a pre-defined rule; and selecting the UEs to be serviced; and reporting the clustering formations.

Claims (127)

1. A system for applying a clustering based assignment algorithm (CbAA) in a telecommunication system comprising:

means for receiving strength information for transmission points belonging to an associated Coordinated Multi-Point (CoMP)-cell;

means for determining the clustering subsets, wherein the means for determining the clustering subsets includes:

means for applying a k-means algorithm to the strength information to form K clusters so that the within-cluster sum of squares of the distances to their centroids is minimized, said k-means algorithm being in the form of the equation

min

𝒮

⁢

∑

k

⁢

∑

v

j

∈

𝒱

k

⁢

v

j

-

v

_

k

2

2

,

(

3

)

wherein ∥•∥ denotes Euclidean norm, v j is the jth strength vector, and v k is the kth prototype vector which corresponds to the centroid over all the strength vectors associated to cluster k;

means for identifying the cluster associated with each UE;

means for associating a cluster to each transmission point in accordance to a pre-defined rule; and

means for selecting the UEs to be serviced; and

means for reporting the clustering formations.

2. The system of claim 1 , wherein the means for selecting the UEs to be serviced further comprises:

means for starting from a first UE and using an algorithm to select a second UE which is most spatially compatible with the first UE and then the algorithm selects a third UE which is most spatially compatible with the first and second UEs which is performed successively until J k * UEs are selected, wherein J k represents a variable number J associated with a cluster k.

3. A method for dynamically determining clusters of user equipments (UEs) and transmission points (TPs) in a communication system comprising:

receiving signal strength information associated with a plurality of UEs and TPs;

dynamically determining clusters of the plurality of UEs and TPs using the received signal strength information so that strength vectors of UEs and/or TPs assigned to a same cluster are more similar to one another than strength vectors of UEs and/or TPs belonging to different clusters, wherein the determining includes

applying a k-means algorithm to the strength information to form K clusters so that the within-cluster sum of squares of the distances to their centroids is minimized, said k-means algorithm being in the form of the equation

min

𝒮

⁢

∑

k

⁢

∑

v

j

∈

𝒱

k

⁢

v

j

-

v

_

k

2

2

,

(

3

)

wherein ∥•∥ denotes Euclidean norm, v j is the jth strength vector, and v k is the kth prototype vector which corresponds to the centroid over all the strength vectors associated to cluster k,

identifying the cluster associated with each UE,

associating a cluster to each transmission point in accordance to a pre-defined rule, and

selecting the UEs to be serviced; and

reporting the clusters.

4. The method of claim 3 , wherein the received signal strength information is received strength vectors, wherein each strength vector depends on Received Signal Strength (RSS) estimates of each UE for all TPs belonging to an associated Coordinated Multi-Point (CoMP)-cell.

5. The method of claim 3 , wherein the step of dynamically determining clusters of the plurality of UEs and TPs determines a plurality of clusters simultaneously.

6. The method of claim 3 , wherein the clusters of the plurality of UEs and TPs are used for at least one of joint precoding and coordinated data transmission scheduling with the clusters of the plurality of UEs and TPs.

7. The method of claim 3 , wherein the communication system uses Time Division Duplexing (TDD).

8. The method of claim 3 , wherein the communication system uses Frequency Division Duplexing (FDD).

9. The method of claim 3 , further comprising:

enabling a subset of the clusters.

10. The method of claim 3 , wherein at least one of the TPs and UEs includes a plurality of antennas.

11. A central processing unit (CPU) for dynamically determining clusters of user equipments (UEs) and transmission points (TPs) in a communication system, the CPU comprising:

an interface configured to receive signal strength information associated with a plurality of UEs and TPs; and

a processor configured to dynamically determine clusters of the plurality of UEs and TPs using the received signal strength information so that strength vectors of UEs and/or TPs assigned to a same cluster are more similar to one another than strength vectors of UEs and/or TPs belonging to different clusters,

wherein the processor determines the clusters by:

applying a k-means algorithm to the strength information to form K clusters so that the within-cluster sum of squares of the distances to their centroids is minimized, said k-means algorithm being in the form of the equation

min

𝒮

⁢

∑

k

⁢

∑

v

j

∈

𝒱

k

⁢

v

j

-

v

_

k

2

2

,

(

3

)

wherein ∥•∥ denotes Euclidean norm, v j is the jth strength vector, and v k is the kth prototype vector which corresponds to the centroid over all the strength vectors associated to cluster k,

identifying the cluster associated with each UE,

associating a cluster to each transmission point in accordance to a pre-defined rule, and

selecting the UEs to be serviced, and

reports the clusters.

12. The CPU of claim 11 , wherein the received signal strength information is received strength vectors, wherein each strength vector depends on Received Signal Strength (RSS) estimates of each UE for all TPs belonging to an associated Coordinated Multi-Point (CoMP)-cell.

13. The CPU of claim 11 , wherein dynamically determining clusters of the plurality of UEs and TPs determines a plurality of clusters simultaneously.

14. The CPU of claim 11 , wherein the clusters of the plurality of UEs and TPs are used for at least one of joint precoding and coordinated data transmission scheduling with the clusters of the plurality of UEs and TPs.

15. The CPU of claim 11 , wherein the communication system uses Time Division Duplexing (TDD).

16. The CPU of claim 11 , wherein the communication system uses Frequency Division Duplexing (FDD).

17. The CPU of claim 11 , further comprising:

enabling a subset of the clusters.

18. The CPU of claim 11 , wherein at least one of the TPs and UEs includes a plurality of antennas.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 1, 2015
From: STANCANELLI, ELVIS M. G.; MACIEL, TARCISIO; SILVA, YURI C.B.; CRUZ FREITAS JUNIOR, WALTER DA; CAVALCANTI, FCO. RODRIGO P.
To: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
Reel/Frame 035999/0499 →
Continuity (2)
Provisional Application 61621647 · Apr 9, 2012
Related Publication 20130267239A1 · Oct 10, 2013