Method for Assigning Number of Control Channel Candidates and Number of Blind Detection Times, Base Station, and User Equipment

• US 20150131591A1
• Filed: 01/19/2015
• Published: 05/14/2015
• Est. Priority Date: 11/02/2012
• Status: Active Grant

• Current Assignee: Huawei Technologies Co., Ltd. (Huawei Investment & Holding Co., Ltd.)
• Original Assignee: Huawei Technologies Co., Ltd. (Huawei Investment & Holding Co., Ltd.)
• Inventors: Liu, Jianqin, Liu, Kunpeng, Wu, Qiang, Zhou, Yongxing, Liu, Jianghua
• Granted Patent: US 9,730,203 B2
• Time in Patent Office: Days
• US Class Current: 370/329
• CPC Class Codes: H04L 5/00 Arrangements affording multiple use of the transmission path
• CPC Class Codes: H04L 5/0053 Allocation of signaling, i.e. of overhead other than pilot signals
• CPC Class Codes: H04W 72/04 Wireless resource allocation
• CPC Class Codes: H04W 72/23 in the downlink direction of a wireless link, i.e. towards a terminal
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

The present invention provides a method for assigning the number of control channel candidates and the number of blind detection times, a base station, and a user equipment. The method includes determining a first aggregation level set {L_1i} and determining the number of EPDCCH candidates corresponding to each aggregation level in the {L_1i}. {L_1i} is formed by N aggregation levels supported by an EPDCCH. A second aggregation level set {L_2j} is determined along with the number of EPDCCH candidates corresponding to each aggregation level in the {L_2j}. {L_2j} is formed by M aggregation levels supported by an EPDCCH to be detected, {L_2j} is a subset of {L_1i}, and the number of EPDCCH candidates corresponding to L_2j in {L_2j} is greater than or equal to the number of EPDCCH candidates corresponding to L_2j in {L_1i}.

Claims

1. A method for assigning the number of control channel candidates, the method comprising:

determining, by a base station, a first aggregation level set {L_1i};

determining, by the base station, the number of EPDCCH candidates corresponding to each aggregation level in the set {L_1i}, wherein the set {L_1i} is formed by N aggregation levels supported by an EPDCCH, where i is a positive integer that ranges from 1 to N;

determining, by the base station, a second aggregation level set {L_2j}; and

determining, by the base station, the number of EPDCCH candidates corresponding to each aggregation level in the set {L_2j}, wherein the set {L_2j} is formed by M aggregation levels supported by an EPDCCH to be detected, j is a positive integer that ranges from 1 to M, the set {L_2j} is a subset of the set {L_1i}, M≦

N, and the number of EPDCCH candidates corresponding to L_2j in the set {L_2j} is greater than or equal to the number of EPDCCH candidates corresponding to L_2j in the set {L_1i}.

2. The method according to claim 1, wherein determining the number of EPDCCH candidates corresponding to each aggregation level in the set {L_1j} comprises:

determining, by the base station, (N−

M) remaining aggregation level after the aggregation levels in the set {L_2j} are removed from the set {L_1i};

determining, by the base station, the total number P of EPDCCH candidates corresponding to the (N−

M) aggregation level in the set {L_1i}; and

assigning, by the base station, P EPDCCH candidates to the aggregation levels in the set {L_2j}.

3. The method according to claim 2, wherein assigning P EPDCCH candidates to the aggregation levels in the set {L_2j} comprises:

assigning, by the base station, P1 EPDCCH candidates to the aggregation levels in the set {L_2j} in a first time; and

assigning, by the base station, P2 EPDCCH candidates to the aggregation levels in the set {L_2j} in a second time, wherein P1+P2≦

P.

4. The method according to claim 3, wherein assigning P1 EPDCCH candidates to the aggregation levels in the set {L_2j} in a first time comprises evenly assigning, by the base station, the P1 EPDCCH candidates to the aggregation levels in the set {L_2j}.

5. The method according to claim 3, wherein assigning P1 EPDCCH candidates to the aggregation levels in the set {L_2j} in a first time comprises assigning, by the base station, the P1 EPDCCH candidates according to a ratio of the number of EPDCCH candidates corresponding to each aggregation level of the set {L_2j} in the set {L_1i} to the total number of EPDCCH candidates corresponding to all the aggregation levels of the set {L_2j} in the set {L_1i}.

6. The method according to claim 3, wherein assigning P1 EPDCCH candidates to the aggregation levels in the set {L_2j} in a first time comprises assigning, by the base station, the P1 EPDCCH candidates to the aggregation levels in the set {L_2j} according to a proportional relationship between N and M.

7. The method according to claim 3, wherein assigning P1 EPDCCH candidates to the aggregation levels in the set {L_2j} in a first time comprises assigning, by the base station, the P1 EPDCCH candidates to one aggregation level in the set {L_2j}.

8. A base station, comprising:

a processor; and

a memory coupled to the processor, wherein the memory stores instructions to program the processor to;

determine a first aggregation level set {L_1i};

determine the number of EPDCCH candidates corresponding to each aggregation level in the set {L_1i}, wherein the set {L_1i} is formed by N aggregation levels supported by an EPDCCH and i is a positive integer that ranges from 1 to N;

determine a second aggregation level set {L_2j}; and

determine the number of EPDCCH candidates corresponding to each aggregation level in the set {L_2j}, wherein the set {L_2j} is formed by M aggregation levels supported by an EPDCCH to be detected, j is a positive integer that ranges from 1 to M, the set {L_2j} is a subset of the set {L_1i}, M≦

N, and the number of EPDCCH candidates corresponding to L_2j in the set {L_2j} is greater than or equal to the number of EPDCCH candidates corresponding to L_2j in the set {L_1i}.

9. The base station according to claim 8, wherein the processor is programmed to:

determine (N−

M) remaining aggregation level after the aggregation levels in the set {L_2j} are removed from the set {L_1i};

determine the total number P of EPDCCH candidates corresponding to the (N−

M) aggregation level in the set {L_1i}; and

assign P EPDCCH candidates to the aggregation levels in the set {L_2j}.

10. The base station according to claim 9, wherein the processor is programmed to:

assign P1 EPDCCH candidates to the aggregation levels in the set {L_2j} in a first time; and

assign P2 EPDCCH candidates to the aggregation levels in the set {L₂} in a second time, wherein P1+P2≦

P.

11. The base station according to claim 10, wherein the processor is programmed to evenly assign the P1 EPDCCH candidates to the aggregation levels in the set {L_2j}.

12. The base station according to claim 10, wherein the processor is programmed to assign the P1 EPDCCH candidates according to a ratio of the number of EPDCCH candidates corresponding to each aggregation level of the set {L_2j} in the set {L_1i} to the total number of EPDCCH candidates corresponding to all the aggregation levels of the set {L_2j} in the set {L_1i}.

13. The base station according to claim 10, wherein the processor is programmed to assign the P1 EPDCCH candidates to the aggregation levels in the set {L_2j} according to a proportional relationship between N and M.

14. The base station according to claim 10, wherein the processor is programmed to assign the P1 EPDCCH candidates to one aggregation level in the set {L_2j}.

15. A user equipment (UE), comprising:

a processor; and

a memory coupled to the processor, wherein the memory stores instructions to program the processor to;

determine a first aggregation level set {L_1i};

determine the number of blind detection times corresponding to each aggregation level in the set {L_1i}, wherein the set {L_1i} is formed by N aggregation levels supported by an EPDCCH, i is a positive integer that ranges from 1 to N;

determine a second aggregation level set {L_2j}; and

determine the number of blind detection times corresponding to each aggregation level in the set {L_2j}, wherein the set {L_2j} is formed by M aggregation levels supported by an EPDCCH to be detected, j is a positive integer that ranges from 1 to M, the set {L_2j} is a subset of the set {L_1i}, M≦

N, and the number of blind detection times corresponding to L_2j in the set {L_2j} is greater than or equal to the number of blind detection times corresponding to L_2j in the set {L_1i}.

16. The UE according to claim 15, wherein the processor is programmed to:

determine (N−

M) remaining aggregation level after the aggregation levels in the set {L_2j} are removed from the set {L_1i};

determine the number P of blind detection times corresponding to the (N−

M) aggregation level in the set {L_1i}; and

assign P times of blind detection to the aggregation levels in the set {L_2j}.

17. The UE according to claim 16, wherein the processor is programmed to:

assign P1 times of blind detection to the aggregation levels in the set {L_2j} in a first time; and

assign P2 times of blind detection to the aggregation levels in set {L_2j} in a second time, wherein P1+P2≦

P.

18. The UE according to claim 17, wherein the processor is programmed to evenly assign the P1 times of blind detection to the aggregation levels in the set {L_2j}.

19. The UE according to claim 17, wherein the processor is programmed to assign the P1 times of blind detection to the aggregation levels in the set {L_2j} according to a proportional relationship between N and M.

20. The UE according to claim 17, wherein the programmed is configured to assign the P1 times of blind detection to one aggregation level in set {L_2j}.