Method for improving the success rate of reception of control channels in an LTE system
View Patent ↗In some examples, a method for allocating a Cell Identity (CELL-ID) to a particular cell in a radio communication network is described. The method may include assigning a first Cell Identity (CELL-ID) i to a first cell i in a radio communication network. The method also includes determining an element δ m of an aggregate δ n which makes a sum of conflict probability in a common search space of the first cell i and in a common search space of one or more adjacent cells k have a minimum value P min . δ m may be an integer. The method may also include assigning a second Cell Identity (CELL-ID) j to a particular adjacent cell j selected from the one or more adjacent cells k such that an absolute value of (CELL-ID) i −(CELL-ID) j equals δ m .
1. A method for allocating a Cell Identity (CELL-ID) to a particular cell in a radio communication network, the method comprising:
assigning a first Cell Identity (CELL-ID) i to a first cell i in a radio communication network;
determining an element δ m of an aggregate δ n which makes a sum of conflict probability in a common search space of the first cell i and in a common search space of one or more adjacent cells k have a minimum value P min , wherein δ m is an integer; and
assigning a second Cell Identity (CELL-ID) j to a particular adjacent cell j selected from the one or more adjacent cells k such that an absolute value of (CELL-ID) i −(CELL-ID) j equals δ m .
2. The method of claim 1 , wherein determining the element δ m of the aggregate δ n includes determining the element δ m according to the following formula:
δ
m
=
δ
n
❘
[
∑
j
=
1
k
P
(
(
L
Comm
-
PDCCH
)
i
=
(
L
Comm
-
PDCCH
)
j
)
=
P
m
i
n
]
,
wherein:
(L Comm-PDCCH ) i is a time-frequency resource location of a physical downlink control channel (“PDCCH”) in the common search space of the first cell i;
(L Comm-PDCCH ) j is a time-frequency resource location of a PDCCH in a common search space of the particular adjacent cell j; and
P((L Comm-PDCCH ) i =(L Comm-PDCCH ) j ) is a conflict probability at a time-frequency position of the PDCCHs in the common search spaces of the first cell i and the particular adjacent cell j.
3. The method of claim 2 , wherein δ m is in a range between 0 and 503 inclusive.
4. The method of claim 3 , wherein δ m is in a range between 3 and 11 inclusive.
5. The method of claim 4 , wherein the conflict probability P((L Comm-PDCCH ) i =(L Comm-PDCCH ) j ) is less than or equal to about 20%.
6. The method of claim 2 , wherein:
the time-frequency resource location of the PDCCH in the common search space of the first cell i, (L Comm-PDCCH ) i , depends on the first Cell Identity (CELL-ID) i as defined by the 3rd Generation Partnership Project (“3GPP”) Long Term Evolution (“LTE”) standard; and
the time-frequency resource location of the PDCCH in the common search space of the particular adjacent cell j, (L Comm-PDCCH ) j , is a function of the second Cell Identity (CELL-ID) j as defined by the 3GPP LTE standard.
7. A computer-readable storage medium having computer-executable instructions stored thereon that are executable by a computing device to perform operations comprising:
assigning a first Cell Identity (CELL-ID) i to a first cell i in a radio communication network;
determining an element δ m of an aggregate δ n which makes a sum of conflict probability in a common search space of the first cell i and in a common search space of one or more adjacent cells k have a minimum value P min , wherein δ m is an integer; and
assigning a second Cell Identity (CELL-ID)) j to a particular adjacent cell j selected from the one or more adjacent cells k such that an absolute value of (CELL-ID) i −(CELL-ID) j equals δ m .
8. The computer-readable storage medium of claim 7 , wherein determining the element δ m of the aggregate δ n includes determining the element δ m according to the following formula:
δ
m
=
δ
n
|
[
∑
j
=
1
k
P
(
(
L
Comm
-
PDCCH
)
i
=
(
L
Comm
-
PDCCH
)
j
)
=
P
m
i
n
]
,
wherein:
(L Comm-PDCCH ) i is a time-frequency resource location of a physical downlink control channel (“PDCCH”) in the common search space of the first cell i;
(L Comm-PDCCH ) j is a time-frequency resource location of a PDCCH in a common search space of the particular adjacent cell j; and
P((L Comm-PDCCH ) i =(L Comm-PDCCH ) j ) is a conflict probability at a time-frequency position of the PDCCHs in the common search spaces of the first cell i and the particular adjacent cell j.
9. The computer-readable storage medium of claim 8 , wherein δ m is in a range between 0 and 503 inclusive.
10. The computer-readable storage medium of claim 9 , wherein δ m is in a range between 3 and 11 inclusive.
11. The computer-readable storage medium of claim 10 , wherein the conflict probability P((L Comm-PDCCH ) i =(L Comm-PDCCH ) j ) is less than or equal to about 20%.
12. The computer-readable storage medium of claim 8 , wherein:
the time-frequency resource location of the PDCCH in the common search space of the first cell i, (L Comm-PDCCH ) i , is determined by the first Cell Identity (CELL-ID) i as defined by the 3rd Generation Partnership Project (“3GPP”) Long Term Evolution (“LTE”) standard; and
the time-frequency resource location of the PDCCH in the common search space of the particular adjacent cell j, (L Comm-PDCCH ) j , is determined by the second Cell Identity (CELL-ID) j as defined by the 3GPP LTE standard.
13. A method for allocating Cell Identities (CELL-IDs) to cells in a radio communication network, the method comprising:
assigning a first Cell Identity (CELL-ID) i to a first cell i in a radio communication network;
determining, for each element of an aggregate δ n , a sum of conflict probability in a common search space of the first cell i and in a common search space of one or more adjacent cells k that are adjacent to the first cell i, to generate a plurality of conflict probability values P l , . . . , P n ;
identifying a minimum conflict probability value P min from the plurality of conflict probability values P l , . . . , P n , wherein P min corresponds to an element δ m of the aggregate δ n ; and
assigning a second Cell Identity (CELL-ID) j to a particular adjacent cell j selected from the one or more adjacent cells k such that an absolute value of (CELL-ID) i −(CELL-ID) j equals δ m .
14. The method of claim 13 , wherein δ m is in a range between 0 and 503 inclusive.
15. The method of claim 14 , wherein δ m is in a range between 3 and 11 inclusive.
16. The method of claim 13 , wherein the minimum conflict probability P min is less than or equal to about 20%.
17. A computer-readable storage medium having computer-executable instructions stored thereon that are executable by a computing device to perform operations for allocating Cell Identities (CELL-IDs) to cells in a radio communication network, the operations comprising:
assigning a first Cell Identity (CELL-ID) i to a first cell i in a radio communication network;
determining, for each element of an aggregate δ n , a sum of conflict probability in a common search space of the first cell i and in a common search space of one or more adjacent cells k that are adjacent to the first cell i, to generate a plurality of conflict probability values P l , . . . , P n ;
identifying a minimum conflict probability value P min from the plurality of conflict probability values P l , . . . , P n , wherein P min corresponds to an element δ m of the aggregate δ n ; and
assigning a second Cell Identity (CELL-ID) j to a particular adjacent cell j selected from the one or more adjacent cells k such that an absolute value of (CELL ID) i −(CELL-ID) j equals δ m .
18. The computer-readable storage medium of claim 17 , wherein δ m is in a range between 0 and 503 inclusive.
19. The computer-readable storage medium of claim 18 , wherein δ m is in a range between 3 and 11 inclusive.
20. The computer-readable storage medium of claim 17 , wherein the minimum conflict probability P min is less than or equal to about 20%.