IP Library Granted Patent US 9,907,061
Granted Patent B2
US 9,907,061 · App. 14/439,930 · Granted Feb 27, 2018

ePDCCH transmitting and receiving method, base station and user equipment

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,907,061
App. No.
14/439,930
Granted
Feb 27, 2018
Kind
B2
Abstract

The embodiments of the present document relate to an enhanced Physical Downlink Control Channel (ePDCCH) transmitting and receiving method and device, base station and user equipment. The method includes: a base station determining a candidate enhanced Control Channel Element (eCCE) index for transmitting an ePDCCH in an ePDCCH resource set; the base station determining an enhanced Resource Element Group (eREG) index mapped by the candidate eCCE index for transmitting the ePDCCH; and the base station sending the ePDCCH to a terminal according to a determined result, wherein, an eCCE is a discretely mapped eCCE (D-eCCE).

Claims (385)

1. An enhanced physical downlink control channel (ePDCCH) transmitting method, comprising:

determining, by a base station, a candidate enhanced control channel element (eCCE) index for transmitting an ePDCCH in an ePDCCH resource set;

determining, by the base station, an enhanced resource element group (eREG) index to which the candidate eCCE index for transmitting the ePDCCH is mapped;

sending, by the base station, the ePDCCH to a terminal according to a determined result; and

wherein, the eCCE is a discretely mapped eCCE (D-eCCE), and a mapping relationship between the eCCE index and the eREG index comprises:

the ePDCCH resource set comprising k D-eCCE groups divided according to a sequence of D-eCCE indexes, in a same D-eCCE group, each D-eCCE being mapped to a same eREG index group, each eREG index group comprising a plurality of eREG indexes, and when different D-eCCEs of the same D-eCCE group are mapped to a same eREG index, the same eREG index corresponding to the different D-eCCEs being located on different resource blocks;

wherein: the eCCE is a discretely mapped eCCE (D-eCCE), when a number of corresponding resource blocks in one ePDCCH resource set is 8, a number of corresponding eCCEs in one resource block is 4, and one eCCE corresponds to 4 eREGs, the mapping relationship between the eCCE index and the eREG index comprises: one resource set comprising 16 D-eCCE groups, the D-eCCE groups being obtained by dividing every 2 D-eCCEs into one group according to the sequence of D-eCCE indexes, wherein, each group of D-eCCEs is mapped to 8 eREGs of 8 resource blocks;

wherein: the eCCE is a discretely mapped eCCE (D-eCCE), the method for determining the eREG index comprises:

PRBIndex=mod(eREGIndex, N );

eREGIndexInPRB=mod(floor(eCCEIndex/ N )+mod(eCCEIndex, N )* M +eREGIndex* M,k );

 wherein, the eCCEIndex is a D-eCCE index, the eREGIndex is an eREG index corresponding to the D-eCCE, N is the number of corresponding resource blocks in one ePDCCH resource set, M is the number of corresponding eCCEs in one resource block, and K is the number of eREGs comprised in one resource block;

or,

PRBIndex=eREGIndex+4*mod(eCCEIndex,2);

or,

PRBIndex=mod(eCCEIndex,8);

ReCCEIndex=floor(eCCEIndex/2)+mod(eCCEIndex,2)*8;

eREGIndexInPRB=mod(floor(ReCCEIndex/4)+ReCCEIndex* M +eREGIndex* M ,16);

or,

PRBIndex=eREGIndex+4*mod(eCCEIndex,2);

or,

PRBIndex=mod(eCCEIndex,8);

ReCCEIndex=floor(eCCEIndex/2);

eREGIndexInPRB=mod(floor(ReCCEIndex/4)+ReCCEIndex* M +eREGIndex* M ,16);

or,

PRBIndex=eREGIndex+4*floor(eCCEIndex/16);

or,

PRBIndex=mod(eCCEIndex,8);

eREGIndexInPRB=mod(floor(eCCEIndex/4)+eCCEIndex* M +eREGIndex* M ,16);

 wherein, the eCCEIndex is a D-eCCE index, the eREGIndex is an eREG index corresponding to the D-eCCE, N is the number of corresponding resource blocks in one ePDCCH resource set, M is the number of corresponding eCCEs in one resource block, and 16 is the number of eREGs comprised in one resource block.

2. The method according to claim 1 , wherein: an eREG corresponding to the eCCE group is one of the following:

{0, 2, 4, 6, 8, 10, 12, 14};

{1, 3, 5, 7, 9, 11, 13, 15};

{0, 4, 8, 12};

{1, 5, 9, 13};

{2, 6, 10, 14};

{3, 7, 11, 15}.

3. The method according to claim 1 , wherein: with regard to an aggregation level L, the candidate eCCE index for transmitting the ePDCCH in the ePDCCH resource set comprises:

with regard to M (L) candidate locations of the ePDCCH of the aggregation level L, eCCEs of two adjacent candidate locations being located in different eCCE groups in the resource set, a method for determining the eCCE groups comprising sequentially dividing all eCCEs in the ePDCCH resource set into n groups, wherein each group comprises 2 or 4 eCCEs;

wherein: a sequence of the eCCEs of the two adjacent candidate locations selecting the eCCE groups is one of the following:

when N=8, the n is 8, the sequence of selecting the eCCE groups is {0, 5, 2, 7, 4, 1, 6, 3}, or {0, 4, 2, 6, 1, 5, 3, 7}, or {0, 3, 6, 1, 4, 7, 2, 5}, or {0, 1, 2, 3, 4, 5, 6, 7};

when N=4, the n is 4, the sequence of selecting the eCCE groups is {0, 1, 2, 3}, or {0, 2, 1, 3}, or {0, 3, 2, 1};

when N=2, the n is 2, the sequence of selecting the eCCE groups is {0, 1}, or {1, 0};

wherein, N is the number of corresponding resource blocks in one ePDCCH resource set.

4. The method according to claim 1 , wherein: the candidate eCCE index is calculated according to the following formula:

L

{

(

Y

+

m

)

mod

N

eCCE

/

L

}

+

i

,

or

,

L

{

(

(

m

×

k

+

Y

T

L

)

×

T

L

+

(

Y

+

m

+

m

N

)

mod

T

L

)

mod

N

eCCE

/

L

}

+

i

,

wherein, L is the aggregation level, N is the number of resource blocks comprised in the resource set, N eCCE is the number of eCCEs comprised in the resource set, Y is an initial candidate location index for transmitting the ePDCCH in the ePDCCH resource set, m′=m×T L ×k, T L is |M/L|, M is the number of eCCEs comprised in one resource block, k is 1, 3 and 5; i represents an index of an eCCE corresponding to an ePDCCH whose aggregation level is L, i=0, . . . , L−1, M (L) is a number of candidate locations corresponding to the ePDCCH of the aggregation level L in the correspondingly configured resource set, m represents a candidate location index corresponding to the ePDCCH, and m=0, . . . , M (L) −1.

5. The method according to claim 1 , comprising:

determining, by a terminal, an enhanced control channel element (eCCE) index to be detected in an ePDCCH resource set;

determining, by the terminal, an enhanced resource element group (eREG) index to which the eCCE index to be detected is mapped;

detecting an ePDCCH sent by a base station according to a determined result.

6. A base station, comprising:

a processor, and

a non-transitory computer-readable storage medium storing programs that when executed by the processor cause the processor to:

determine a candidate enhanced control channel element (eCCE) index for transmitting an enhanced physical downlink control channel (ePDCCH) in an ePDCCH resource set;

determine an enhanced resource element group (eREG) index to which the candidate eCCE index for transmitting the ePDCCH is mapped; and

detect the ePDCCH sent by the base station according to a determined result;

wherein, the eCCE is a discretely mapped eCCE (D-eCCE), and a mapping relationship between the eCCE index and the eREG index comprises:

the ePDCCH resource set comprising k D-eCCE groups divided according to a sequence of D-eCCE indexes, in a same D-eCCE group, each D-eCCE being mapped to a same eREG index group, each eREG index group comprising a plurality of eREG indexes, and when different D-eCCEs of the same D-eCCE group are mapped to a same eREG index, the same eREG index corresponding to the different D-eCCEs being located on different resource blocks;

wherein: the eCCE is a discretely mapped eCCE (D-eCCE), when a number of corresponding resource blocks in one ePDCCH resource set is 8, a number of corresponding eCCEs in one resource block is 4, and one eCCE corresponds to 4 eREGs, the mapping relationship between the eCCE index and the eREG index comprises: one resource set comprising 16 D-eCCE groups, the D-eCCE groups being obtained by dividing every 2 D-eCCEs into one group according to the sequence of D-eCCE indexes, wherein, each group of D-eCCEs is mapped to 8 eREGs of 8 resource blocks;

wherein: the eCCE is a discretely mapped eCCE (D-eCCE), the eREG index determination module determines the eREG index by means of;

PRBIndex=mod(eREGIndex, N );

eREGIndexInPRB=mod(floor(eCCEIndex/ N )+mod(eREGIndex, N )* M +eREGIndex* M,k );

wherein, the eCCEIndex is a D-eCCE index, the eREGIndex is an eREG index corresponding to the D-eCCE, N is the number of corresponding resource blocks in one ePDCCH resource set, M is the number of corresponding eCCEs in one resource block, and K is the number of eREGs comprised in one resource block;

or,

PRBIndex=eREGIndex+4*mod(eCCEIndex,2);

or,

PRBIndex=mod(eCCEIndex,8);

ReCCEIndex=floor(eCCEIndex/2)+mod(eCCEIndex,2)*8;

eREGIndexInPRB=mod(floor(ReCCEIndex/4)+ReCCEIndex* M +eREGIndex* M, 16;

or,

PRBIndex=eREGIndex+4*mod(eCCEIndex,2);

or,

PRBIndex=mod(eCCEIndex,8);

ReCCEindex=floor(eCCEIndex/2);

eREGIndexInPRB=mod(floor(ReCCEIndex/4)+ReCCEIndex* M +eREGIndex* M, 16);

or,

PRBIndex=eREGIndex+4*floor(eCCEIndex/16);

or,

PRBIndex=mod(eCCEINdex,8);

eREGIndexInPRB=mod(floor(eCCEIndex/4)+eCCEIndex* M +eREGIndex* M, 16);

wherein, the eCCEIndex is a D-eCCE index, the eREGIndex is an eREG index corresponding to the D-eCCE, N is the number corresponding resource blocks in one ePDCCH resource set, M is the number of corresponding eCCEs in one resource block, and 16 is the number of eREGs comprises in one resource block.

7. The base station according to claim 6 , wherein: an eREG corresponding to the eCCE group is one of the following:

{0, 2, 4, 6, 8, 10, 12, 14};

{1, 3, 5, 7, 9, 11, 13, 15};

{0, 4, 8, 12};

{1, 5, 9, 13};

{2, 6, 10, 14};

{3, 7, 11, 15}.

8. The base station according to claim 6 , wherein: with regard to an aggregation level L, the eCCE index determination module determines the candidate eCCE index for transmitting the ePDCCH in the ePDCCH resource set with the following method:

with regard to M (L) candidate locations of the ePDCCH of the aggregation level L, eCCEs of two adjacent candidate locations being located in different eCCE groups in the resource set, a method for determining the eCCE groups comprising sequentially dividing all eCCEs in the ePDCCH resource set into n groups, wherein each group comprises 2 or 4 eCCEs.

9. The base station according to claim 8 , wherein: a sequence of the eCCEs of the two adjacent candidate locations selecting the eCCE groups is one of the following:

when N=8, the n is 8, the sequence of selecting the eCCE groups is {0, 5, 2, 7, 4, 1, 6, 3}, or {0, 4, 2, 6, 1, 5, 3, 7}, or {0, 3, 6, 1, 4, 7, 2, 5}, or {0, 1, 2, 3, 4, 5, 6, 7};

when N=4, the n is 4, the sequence of selecting the eCCE groups is {0, 1, 2, 3}, or {0, 2, 1, 3}, or {0, 3, 2, 1};

when N=2, the n is 2, the sequence of selecting the eCCE groups is {0, 1}, or {1, 0};

wherein, N is the number of corresponding resource blocks in one ePDCCH resource set.

10. The base station according to claim 6 , wherein: the eCCE index determination module calculates the candidate eCCE index for transmitting the ePDCCH according to the following formula:

L

{

(

Y

+

m

)

mod

N

eCCE

/

L

}

+

i

,

or

,

L

{

(

(

m

×

k

+

Y

T

L

)

×

T

L

+

(

Y

+

m

+

m

N

)

mod

T

L

)

mod

N

eCCE

/

L

}

+

i

,

wherein, L is the aggregation level, N is the number of resource blocks comprised in the resource set, N eCCE is the number of eCCEs comprised in the resource set, Y is an initial candidate location index for transmitting the ePDCCH in the ePDCCH resource set, m′=m×T L ×k, T L is |M/L|, M is the number of eCCEs comprised in one resource block, k is 1, 3 and 5; i represents an index of an eCCE corresponding to an ePDCCH whose aggregation level is L, i=0, . . . , L−1, M (L) is a number of candidate locations corresponding to the ePDCCH of the aggregation level L in the correspondingly configured resource set, m represents a candidate location index corresponding to the ePDCCH, and m=0, . . . , M (L) −1.

11. A terminal, comprising:

a processor, and

a non-transitory computer-readable storage medium storing programs that when executed by the processor cause the processor to:

determine an enhanced control channel element (eCCE) index to be detected in an enhanced physical downlink control channel (ePDCCH) resource set;

determine an enhanced resource element group (eREG) index to which the eCCE index to be detected is mapped;

detect and receive an ePDCCH sent by a base station according to a determined result;

wherein, the eCCE is a discretely mapped eCCE (D-eCCE), and a mapping relationship between the eCCE index and the eREG index comprises: the ePDCCH resource set comprising k D-eCCE groups divided according to a sequence of D-eCCE indexes, in a same D-eCCE group, each D-eCCE being mapped to a same eREG index group, each eREG index group comprising a plurality of eREG indexes, and when different D-eCCEs of the same D-eCCE group are mapped to a same eREG index, the same eREG index corresponding to the different D-eCCEs being located on different resource blocks;

wherein: the eCCE is a discretely mapped eCCE (D-eCCE), when a number of corresponding resource blocks in one ePDCCH resource set is 8, a number of corresponding eCCEs in one resource block is 4, and one eCCE corresponds to 4 eREGs, the mapping relationship between the eCCE index and the eREG index comprises: one resource set comprising 16 D-eCCE groups, the D-eCCE groups being obtained by dividing every 2 D-eCCEs into one group according to the sequence of D-eCCE indexes, wherein, each group of D-eCCEs is mapped to 8 eREGs of 8 resource blocks;

wherein: the eCCE is a discretely mapped eCCE (D-eCCE), the eREG index determination module determines the eREG index by means of:

PRBIndex=mod(eREGIndex, N );

eREGIndexPRB=mod(floor(eCCEIndex/ N )+mod(eCCEIndex, N )* M +eREGIndex* M,k );

wherein, the eCCEIndex is a D-eCCE index, the eREGIndex is an eREG index corresponding to the D-eCCE, N is the number of corresponding resource blocks in one ePDCCH resource set, M is the number of corresponding eCCEs in one resource block, and K is the number of eREGs comprised in one resource block;

or,

PRBIndex=eREGIndex+4*mod(eCCEIndex,2);

or,

PRBIndex=mod(eCCEIndex,8);

ReCCEIndex=floor(eCCEIndex/2)+mod(eCCEIndex,2)*8;

eREGIndexInPRB=mod(floor(ReCCEIndex/4)+ReCCEIndex* M +eREGIndex* M, 16);

or,

PRBIndex=eREGIndex+4*mod(eCCEIndex,2);

or,

PRBIndex=mod(eCCEIndex,8);

ReCCEIndex=floor(eCCEIndex/2);

eREGIndexInPRB=mod(floor(ReCCEIndex/4)+ReCCEIndex* M +eREGIndex* M, 16);

or,

PRBIndex=eREGIndex+4*floor(eCCEIndex/16);

or,

PRBIndex=mod(eCCEIndex,8);

eREGIndexInPRB=mod(floor(eCCEIndex/4)+eCCEIdex* M +eREGIndex* M, 16);

wherein, the eCCEIndex is a D-eCCE index, the eREGIndex is an eREG index corresponding to the D-eCCE, N is the number of correspsonding resource blocks in on ePDCCH resource set, M is the number of corresponding eCCEs in one resource block, and 16 is the number of eREGs comprised in one resource book.

12. The terminal according to claim 11 , wherein: an eREG corresponding to the eCCE group is one of the following:

{0, 2, 4, 6, 8, 10, 12, 14};

{1, 3, 5, 7, 9, 11, 13, 15};

{0, 4, 8, 12};

{1, 5, 9, 13};

{2, 6, 10, 14};

{3, 7, 11, 15}.

13. The terminal according to claim 11 , wherein: with regard to an aggregation level L, the eCCE index determination module determines the candidate eCCE index for transmitting the ePDCCH in the ePDCCH resource set with the following method:

with regard to M (L) candidate locations of the ePDCCH of the aggregation level L, eCCEs of two adjacent candidate locations being located in different eCCE groups in the resource set, a method for determining the eCCE groups comprising sequentially dividing all eCCEs in the ePDCCH resource set into n groups, wherein each group comprises 2 or 4 eCCEs.

14. The terminal according to claim 13 , wherein: a sequence of the eCCEs of the two adjacent candidate locations selecting the eCCE groups is one of the following:

when N=8, the n is 8, the sequence of selecting the eCCE groups is {0, 5, 2, 7, 4, 1, 6, 3}, or {0, 4, 2, 6, 1, 5, 3, 7}, or {0, 3, 6, 1, 4, 7, 2, 5}, or {0, 1, 2, 3, 4, 5, 6, 7};

when N=4, the n is 4, the sequence of selecting the eCCE groups is {0, 1, 2, 3}, or {0, 2, 1, 3}, or {0, 3, 2, 1};

when N=2, the n is 2, the sequence of selecting the eCCE groups is {0, 1}, or {1, 0};

wherein, N is the number of corresponding resource blocks in one ePDCCH resource set.

15. The terminal according to claim 11 , wherein: the candidate eCCE index for transmitting the ePDCCH is calculated according to the following formula:

L

{

(

Y

+

m

)

mod

N

eCCE

/

L

}

+

i

,

or

,

L

{

(

(

m

×

k

+

Y

T

L

)

×

T

L

+

(

Y

+

m

+

m

N

)

mod

T

L

)

mod

N

eCCE

/

L

}

+

i

,

wherein, L is the aggregation level, N is the number of resource blocks comprised in the resource set, N eCCE is the number of eCCEs comprised in the resource set, Y is an initial candidate location index for detecting the ePDCCH in the ePDCCH resource set, m′=m×T L ×k T L is |M/L|, M is the number of eCCEs comprised in one resource block, k is 1, 3 and 5; i represents an index of an eCCE corresponding to an ePDCCH whose aggregation level is L, i=0, . . . , L−1, M (L) is a number of candidate locations corresponding to the ePDCCH of the aggregation level L in the correspondingly configured resource set, m represents a candidate location index corresponding to the ePDCCH, and m=0, . . . , M (L) −1.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 17, 2023
From: ZTE CORPORATION
To: EIGHT DEER VENTURES, LLC
Reel/Frame 063341/0351 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 30, 2015
From: DAI, BO; CHEN, YIJIAN; ZUO, ZHISONG
To: ZTE CORPORATION
Reel/Frame 035539/0941 →