Method for sending and detecting downlink control information, sending end, and receiving end

Abstract

A method for sending and detecting downlink control information, a sending end and a receiving end are described, the method for detecting the downlink control information may include: a User Equipment (UE)-specific search space of an enhance Physical Downlink Control Channel (ePDCCH) bearing downlink control information is determined according to a preset interval; wherein the preset interval is determined according to a number of candidate positions of one component carrier at a corresponding aggregation level in a corresponding resource set, or the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and a number of scheduled component carriers, or the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and a number of configured component carriers; and the downlink control information on a physical resource corresponding to the UE-specific search space is detected. Through the disclosure, a problem of detecting the ePDCCH can be solved.

Claims

1-36. (canceled)

37. A method for determining an Ack/Nack Resource Offset (ARO) scope, comprising: determining, in a Time Division Duplexing (TDD) system, an ARO scope of a Physical Uplink Control Channel (PUCCH) resource corresponding to a Physical Downlink Shared Channel (PDSCH) scheduled by an enhance Physical Downlink Control Channel (ePDCCH) according to preset information, wherein the preset information includes at least one of the followings: a sub-frame index; and the number of downlink sub-frames corresponding to an uplink sub-frame in which the PUCCH is located.

38. The method according to claim 37, wherein the ARO scope corresponds to n sets, n is 2, 3, 4, 5, 6, 7, 8 or 9.

39. The method according to claim 37, further comprising: when the preset information includes the sub-frame index, determining a value of the ARO according to a position h of a downlink sub-frame index k in which the ePDCCH is located in a downlink sub-frame window corresponding to the uplink sub-frame in which the PUCCH is located, wherein h is numbered from 0, which specifically comprises: h is 0, then the ARO is {2, −1, 0, −2}, h is 1, then the ARO is {2, 0, −1, −N.sub.eCCE(k-1, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)}, h is 2, then the ARO is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)−N.sub.eCCE(k-1, j)}, h is 3, then the ARO is {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)}; or, the ARO corresponding to a first sub-frame is {−2, 2, −1, 0}, the ARO corresponding to a last sub-frame is {2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)}, the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)}; or, the ARO corresponding to the first sub-frame is {−2, 2, −1, 0}, the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)}; or, the ARO corresponding to the first sub-frame is {−2, 2, −1, 0}, the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j), −N.sub.eCCE(k, j)}; or, the ARO is {0, 2, └D1>×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┘+T4}, wherein T1 and T2 are real numbers, T3 and T4 are integers, D1 is $\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or a first preset value , D2 is $\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or a second preset value, T5 and T6 are integers; or, his 0, then the ARO is {2, −1, 0, −2}, h is other values, the ARO is {0, 2, └D1>×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 and T2 are real numbers, T3 and T4 are integers, D1 $\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}$ is or the first preset value, D2 is $\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or the second preset value, T5 and T6 are integers; or, h is 0, then the ARO is {2, −1, 0, −2}, h is other values, the ARO is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D3×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 is −1, T2 is −1, T3 is −1, T4 is −2, D1 is $\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)},$ D2 is $\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)},$ T5 and T6 are integers; wherein k represents the sub-frame index, and j represents a resource set index.

40. The method according to claim 37, further comprising: when the preset information includes the number H of the downlink sub-frames corresponding to the uplink sub-frame in which the PUCCH is located, H is 1, then the ARO scope is {2, 2, −1, 0}; H is other values, then the ARO scope is {2, 0, N.sub.eCCE(j)*┌D/2┐, N.sub.eCCE(j)*D}, wherein D is H or H−1.

41. The method according to claim 37, further comprising: when the preset information includes the sub-frame index and the number H of the downlink sub-frames corresponding to the uplink sub-frame in which the PUCCH is located, determining a value of the ARO according to a position h of a downlink sub-frame index k in which the ePDCCH is located in a downlink sub-frame window corresponding to the uplink sub-frame in which the PUCCH is located, wherein h is numbered from 0, which specifically comprises: H is 1, then the ARO scope is {−2, 2, −1, 0}, H is 2, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −1, −N.sub.eCCE(k-1, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)}; H is 3, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)} or {2, 0, −1, −N.sub.eCCE(k-1, j)}, h is 3, then the ARO scope is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}, H is 4, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)} or {2, 0, −1, −N.sub.eCCE(k-1, j)}, h is 3, then the ARO scope is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}, h is 4, then the ARO scope is {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)} or {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}.

42. A receiving end, comprising: a memory storing programming instructions; and a processor configured to be capable of executing the stored programming instructions to: determine, in a Time Division Duplexing (TDD) system, an ARO scope of a Physical Uplink Control Channel (PUCCH) resource corresponding to a Physical Downlink Shared Channel (PDSCH) scheduled by an enhance Physical Downlink Control Channel (ePDCCH) according to preset information, wherein the preset information includes at least one of the followings: a sub-frame index; and the number of downlink sub-frames corresponding to an uplink sub-frame in which the PUCCH is located.

43. The receiving end according to claim 42, wherein the ARO scope corresponds to n sets, n is 2, 3, 4, 5, 6, 7, 8 or 9.

44. The receiving end according to claim 42, wherein the processor is further configured to, when the preset information includes the sub-frame index, determine a value of the ARO according to a position h of a downlink sub-frame index k in which the ePDCCH is located in a downlink sub-frame window corresponding to the uplink sub-frame in which the PUCCH is located, wherein h is numbered from 0, which specifically comprises: h is 0, then the ARO is {2, −1, 0, −2}, h is 1, then the ARO is {2, 0, −1, −N.sub.eCCE(k-1, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)}, h is 2, then the ARO is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}, h is 3, then the ARO is {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)}; or, the ARO corresponding to a first sub-frame is {−2, 2, −1, 0}, the ARO corresponding to a last sub-frame is {2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)}, the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)}; or, the ARO corresponding to the first sub-frame is {−2, 2, −1, 0}, the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)}; or, the ARO corresponding to the first sub-frame is {−2, 2, −1, 0}, the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)−N.sub.eCCE(k, j)}; or, the ARO is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 and T2 are real numbers, T3 and T4 are integers, D1 is $\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or a first preset value , D2 is $\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or a second preset value, T5 and T6 are integers; or, h is 0, then the ARO is {2, −1, 0, −2}, h is other values, the ARO is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 and T2 are real numbers, T3 and T4 are integers, D1 is $\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or the first preset value, D2 is $\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or the second preset value, T5 and T6 are integers; or, h is 0, then the ARO is {2, −1, 0, −2}, h is other values, the ARO is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 is −1, T2 is −1, T3 is −1, T4 is −2, D1 is $\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)},$ D2 is $\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)},$ T5 and T6 are integers; wherein k represents the sub-frame index, and j represents a resource set index.

45. The receiving end according to claim 42, wherein the processor is further configured to, when the preset information includes the number H of the downlink sub-frames corresponding to the uplink sub-frame in which the PUCCH is located, determine that: H is 1, then the ARO scope is {2, 2, −1, 0}; H is other values, then the ARO scope is {2, 0, N.sub.eCCE(j)*┌(D)/2┐, N.sub.eCCE(j)*D}, wherein D is H or H−1.

46. The receiving end according to claim 42, wherein the processor is further configured to, when the preset information includes the sub-frame index and the number H of the downlink sub-frames corresponding to the uplink sub-frame in which the PUCCH is located, determine a value of the ARO according to a position h of a downlink sub-frame index k in which the ePDCCH is located in a downlink sub-frame window corresponding to the uplink sub-frame in which the PUCCH is located, wherein h is numbered from 0, which specifically comprises: H is 1, then the ARO scope is {−2, 2, −1, 0}, H is 2, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −1, −N.sub.eCCE(k-1, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)}, H is 3, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)} or {2, 0, −1, −N.sub.eCCE(k-1, j)} h is 3, then the ARO scope is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}; H is 4, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)} or {2, 0, −1, −N.sub.eCCE(k-1, j)}, h is 3, then the ARO scope is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)} h is 4, then the ARO scope is {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)} or {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}.

47. A sending end, comprising: a memory storing programming instructions; and a processor configured to be capable of executing the stored programming instructions to: determine, in a Time Division Duplexing (TDD) system, an ARO scope of a Physical Uplink Control Channel (PUCCH) resource corresponding to a Physical Downlink Shared Channel (PDSCH) scheduled by an enhance Physical Downlink Control Channel (ePDCCH) according to preset information, wherein the preset information includes at least one of the followings: a sub-frame index; and the number of downlink sub-frames corresponding to an uplink sub-frame in which the PUCCH is located.

48. The sending end according to claim 47, wherein the ARO scope corresponds to n sets, n is 2, 3, 4, 5, 6, 7, 8 or 9.

49. The sending end according to claim 47, wherein the processor is further configured to, when the preset information includes the sub-frame index, determine a value of the ARO according to a position h of a downlink sub-frame index k in which the ePDCCH is located in a downlink sub-frame window corresponding to the uplink sub-frame in which the PUCCH is located, wherein h is numbered from 0, which specifically comprises: h is 0, then the ARO is {2, −1, 0, −2}, h is 1, then the ARO is {2, 0, −1, −N.sub.eCCE(k-1, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)}, h is 2, then the ARO is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}, h is 3, then the ARO is {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)}; or, the ARO corresponding to a first sub-frame is {−2, 2, −1, 0}, the ARO corresponding to a last sub-frame is {2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)}, the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)}; or, the ARO corresponding to the first sub-frame is {−2, 2, −1, 0}, the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)}; or, the ARO corresponding to the first sub-frame is {−2, 2, −1, 0}, the ARO corresponding to other sub-frames is { 2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)−N.sub.eCCE(k, j)}; or, the ARO is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 and T2 are real numbers, T3 and T4 are integers, D1 is $\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or a first preset value , D2 is $\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or a second preset value, T5 and T6 are integers; or, h is 0, then the ARO is { 2, −1, 0, −2}, h is other values, the ARO is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 and T2 are real numbers, T3 and T4 are integers, D1 is $\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or the first preset value, D2 is $\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)}$ or the second preset value, T5 and T6 are integers; or, h is 0, then the ARO is { 2, −1, 0, −2}, h is other values, the ARO is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 is −1, T2 is −1, T3 is −1, T4 is −2, D1 is $\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)},$ D2 is $\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)},$ T5 and T6 are integers; wherein k represents the sub-frame index, and j represents a resource set index.

50. The sending end according to claim 47, wherein the processor is further configured to, when the preset information includes the number H of the downlink sub-frames corresponding to the uplink sub-frame in which the PUCCH is located, determine that: H is 1, then the ARO scope is {2, 2, −1, 0}; H is other values, then the ARO scope is {2, 0, N.sub.eCCE(j)*┌(D)/2┐, N.sub.eCCE(j)*D}, wherein D is H or H−1.

51. The sending end according to claim 47, wherein the processor is further configured to, when the preset information includes the sub-frame index and the number H of the downlink sub-frames corresponding to the uplink sub-frame in which the PUCCH is located, determine a value of the ARO according to a position h of a downlink sub-frame index k in which the ePDCCH is located in a downlink sub-frame window corresponding to the uplink sub-frame in which the PUCCH is located, wherein h is numbered from 0, which specifically comprises: H is 1, then the ARO scope is {−2, 2, −1, 0}, H is 2, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −1, −N.sub.eCCE(k-1, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)}, H is 3, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)} or {2, 0, −1, −N.sub.eCCE(k-1, j)}, h is 3, then the ARO scope is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}; H is 4, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)} or {2, 0, −1, −N.sub.eCCE(k-1, j)}, h is 3, then the ARO scope is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}, h is 4, then the ARO scope is {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)} −N.sub.eCCE(k-1, j) or {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0029] FIG. 1 is a structure diagram of an ePDCCH in the related art;

[0030] FIG. 2 is a flowchart of a method for sending downlink control information of an embodiment of the disclosure;

[0031] FIG. 3 is a flowchart of a method for detecting downlink control information of an embodiment of the disclosure;

[0032] FIG. 4 is a structure diagram of a sending end of an embodiment of the disclosure; and

[0033] FIG. 5 is a structure diagram of a receiving end of an embodiment of the disclosure.

DETAILED DESCRIPTION

[0034] A technical scheme of the disclosure is further explained in detail below in combination with the drawings and specific embodiments.

[0035] An embodiment of the disclosure provides a method for sending downlink control information, an execution body of the method may be a base station, as shown in FIG. 2, mainly including:

[0036] Step 201: generating a UE-specific search space of an ePDCCH bearing downlink control information according to a preset interval; and

[0037] Step 202: sending the downlink control information to a UE on a physical resource corresponding to the UE-specific search space.

[0038] Wherein the preset interval is determined according to the number of candidate positions of one component carrier at a corresponding aggregation level in a corresponding resource set; or the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the number of scheduled component carriers; or the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the number of configured component carriers.

[0039] Preferably, when the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, the preset interval is

[00001]$.Math.\frac{N_{\mathrm{ECCE}}}{L\times M_{\mathrm{set}}^{\left(L\right)}}.Math..Math..Math.\mathrm{or}.Math..Math..Math.\frac{N_{\mathrm{ECCE}}}{L\times \left(M_{\mathrm{set}}^{\left(L\right)}+X\right)}.Math..Math..Math.\mathrm{or}.Math..Math..Math.\frac{M_{\mathrm{set}}^{\left(L\right)}}{2}.Math..Math..Math.\mathrm{or}.Math..Math..Math.\frac{M_{\mathrm{set}}^{\left(L\right)}}{2}.Math.+1,$

wherein X=(M.sub.set.sup.(L)+1)mod 2, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in a search space S.sub.k.sup.(L) having an aggregation level L and corresponding to a resource set set on a sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set.

[0040] Preferably, when the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the number of the scheduled component carriers, or when the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the number of the configured component carriers, the preset interval is

[00002]$.Math.\frac{N_{\mathrm{ECCE}}}{L\times M_{\mathrm{set}}^{\left(L\right)}\times N}.Math..Math..Math.\mathrm{or}.Math..Math..Math.\frac{N_{\mathrm{ECCE}}}{L\times \left(M_{\mathrm{set}}^{\left(L\right)}+X\right)\times N}.Math.,$

wherein X=(M.sub.set.sup.(L)+1)mod 2, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, N represents the number of the scheduled component carriers or the number of configured component carriers.

[0041] Preferably, based on the above basis, the preset interval may also be determined according to a component carrier index and/or a candidate set index;

[0042] when the preset interval is further determined according to the candidate set index, the preset interval is

[00003]$.Math.\frac{mN_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}}.Math..Math..Math.\mathrm{or}.Math..Math..Math.\frac{mN_{\mathrm{ECCE}}}{L\left(M_{\mathrm{set}}^{\left(L\right)}+X\right)}.Math..Math..Math.\mathrm{or}.Math..Math..Math.\frac{mN_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}N}.Math..Math..Math.\mathrm{or}$$.Math.\frac{mN_{\mathrm{ECCE}}}{L\left(M_{\mathrm{set}}^{\left(L\right)}+X\right)N}.Math.,$

wherein X=(M.sub.set.sup.(L)+1)mod 2, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, m represents the candidate set index, and N represents the number of the scheduled component carriers or the number of the configured component carriers;

[0043] when the preset interval is further determined according to the component carrier index, the preset interval is

[00004]$.Math.\frac{N_{\mathrm{ECCE}}n_{\mathrm{CI}}}{LM_{\mathrm{set}}^{\left(L\right)}N}.Math..Math..Math.\mathrm{or}.Math..Math..Math.\frac{N_{\mathrm{ECCE}}n_{\mathrm{CI}}}{L\left(M_{\mathrm{set}}^{\left(L\right)}+X\right)N}.Math.,$

X=(M.sup.(L)+1)mod 2, wherein N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, n.sub.CI represents the component carrier index, and N represents the number of the scheduled component carriers or the number of the configured component carriers;

[0044] when the preset interval is further determined according to the component carrier index and the candidate set index, the preset interval is

[00005]$.Math.\frac{\left(n_{\mathrm{CI}}+mN_{\mathrm{CC}}^{\mathrm{Num}}\right)N_{\mathrm{ECCE}}}{L\left(M_{\mathrm{set}}^{\left(L\right)}+X\right)}.Math..Math..Math.\mathrm{or}.Math..Math..Math.\frac{\left(n_{\mathrm{CI}}+mN_{\mathrm{CC}}^{\mathrm{Num}}\right)N_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}N}.Math..Math..Math.\mathrm{or}$$.Math.\frac{\left(n_{\mathrm{CI}}M_{\mathrm{set}}^{\left(L\right)}+m\right)N_{\mathrm{ECCE}}}{L\left(M_{\mathrm{set}}^{\left(L\right)}+X\right)}.Math..Math..Math.\mathrm{or}.Math..Math..Math.\frac{\left(m+M_{\mathrm{set}}^{\left(L\right)}n_{\mathrm{CI}}\right)N_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}N}.Math.,$

wherein X=(M.sub.set.sup.(L)+1)mod2, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, m represents the candidate set index, n.sub.CI represents the component carrier index, and N.sub.CC.sup.Num represents the number of the component carriers scheduled on the target component carrier or represents the number of the configured component carriers.

[0045] Preferably, the preset interval meets at least one of the following conditions:

[0046] A: the preset interval of a target component carrier in a cross carrier scheduling scene is the same as that of the target component carrier in a non-cross carrier scheduling scene;

[0047] B: the preset interval of the target component carrier in the cross carrier scheduling scene is the same as that of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene; and

[0048] C: the preset interval of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene is determined according to the number of the candidate positions of N component carriers at the corresponding aggregation level in the corresponding resource set; the preset interval of the target component carrier in the non-cross carrier scheduling scene is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, wherein N is a natural number.

[0049] Preferably, candidate sets of each component carrier scheduled by the target component carrier adopt the same candidate set index;

[0050] or, the candidate sets of each component carrier scheduled by the target component carrier are cross-mapped in accordance with the component carrier index;

[0051] or, the candidate sets of each component carrier scheduled by the target component carrier are sequentially mapped in accordance with the component carrier index.

[0052] Based on the above preset interval and condition, preferably, when performing the cross carrier scheduling, one way for generating the UE-specific search space is:

[00006]$L.Math.\left\{\left(Y_k+n_{\mathrm{CI}}+.Math.\frac{mN_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i$

[0053] wherein Y.sub.k represents an initial candidate position of the UE-specific search space, n.sub.CI represents the component carrier index, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, i=0, . . . ,L−1, m represents the candidate set index, and m=0, . . . ,M.sub.set.sup.(L)−1;

[0054] this way may achieve an effect that the candidate sets of each component carrier scheduled by the target component carrier adopt the same candidate set index; this way may also achieve the effect that the preset interval of the target component carrier in the cross carrier scheduling scene is the same as that of the target component carrier in the non-cross carrier scheduling scene; this way may also achieve the effect that the preset interval of the target component carrier in the cross carrier scheduling scene is the same as that of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene.

[0055] Preferably, when performing the cross carrier scheduling, another way for generating the UE-specific search space is:

[00007]$L.Math.\left\{\left(Y_k+.Math.\frac{\left(n_{\mathrm{CI}}M_{\mathrm{set}}^{\left(L\right)}+m\right)N_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}N_{\mathrm{CC}}^{\mathrm{Num}}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i$

[0056] wherein Y.sub.k represents the initial candidate position of the UE-specific search space, n.sub.CI represents the component carrier index, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, N.sub.CC.sup.Num represents the number of the component carriers scheduled on the target component carrier or represents the number of the configured component carriers, i=0, . . . ,L−1, m represents the candidate set index, and m=0, . . . ,M.sub.set.sup.(L)−1;

[0057] this way may achieve the effect that the candidate sets of each component carrier scheduled by the target component carrier are sequentially mapped in accordance with the component carrier index; this way may also achieve the effect that the preset interval of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene is determined according to the number of the candidate positions of N component carriers at the corresponding aggregation level in the corresponding resource set.

[0058] Preferably, when performing the cross carrier scheduling, another way for generating the UE-specific search space is:

[00008]$L.Math.\left\{\left(Y_k+.Math.\frac{\left(n_{\mathrm{CI}}+mN_{\mathrm{CC}}^{\mathrm{Num}}\right)N_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}N_{\mathrm{CC}}^{\mathrm{Num}}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i$

[0059] wherein Y.sub.k represents the initial candidate position of the UE-specific search space, n.sub.CI represents the component carrier index, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, N.sub.CC.sup.Num represents the number of the component carriers on scheduled the target component carrier or represents the number of the configured component carriers, i=0, . . . ,L−1, m represents the candidate set index, and m=0, . . . ,M.sub.set.sup.(L)−1;

[0060] this way may achieve the effect that the candidate set of each component carrier scheduled by the target component carrier is cross-mapped in accordance with the component carrier index.

[0061] Preferably, when performing the cross carrier scheduling, another way for generating the UE-specific search space is:

[00009]$\left\{\left(Y_k+.Math.\frac{\left(n_{\mathrm{CI}}M_{\mathrm{set}}^{\left(L\right)}+m+G\right)N_{\mathrm{ECCE}}}{LZN_{\mathrm{CC}}^{\mathrm{Num}}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i$

[0062] wherein Y.sub.k represents the initial candidate position of the UE-specific search space, n.sub.CI represents the component carrier index, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, N.sub.CC.sup.Num represents the number of the component carriers scheduled on the target component carrier or represents the number of the configured component carriers, i=0, . . . ,L−1, X=(M.sub.set.sup.(L)+1)mod 2, Z=M.sub.set.sup.(L)+X, G is 0 or X, m represents the candidate set index, and m=0, . . . ,M.sub.set.sup.(L)−1;

[0063] this way may achieve the effect that the candidate sets of each component carrier scheduled by the target component carrier are sequentially mapped in accordance with the component carrier index; this way may also achieve the effect that the preset interval of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene is determined according to the number of the candidate positions of N component carriers at the corresponding aggregation level in the corresponding resource set.

[0064] Preferably, when performing the cross carrier scheduling, another way for generating the UE-specific search space is:

[00010]$\left\{\left(Y_k+n_{\mathrm{CI}}+.Math.\frac{\left(m+G\right)N_{\mathrm{ECCE}}}{LZ}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,$

X=(M.sub.set.sup.(L)+1)mod 2, Z=M.sub.set.sup.(L)+X, G is 0 or X;

[0065] wherein Y.sub.k represents the initial candidate position of the UE-specific search space, n.sub.CI represents the component carrier index, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, i=0, . . . ,L−1, m represents the candidate set index, and m=0, . . . ,M.sub.set.sup.(L)−1.

[0066] This way may achieve the effect that the candidate sets of each component carrier scheduled by the target component carrier adopt the same candidate set index; this way may also achieve the effect that the preset interval of the target component carrier in the cross carrier scheduling scene is the same as that of the target component carrier in the non-cross carrier scheduling scene; this way may also achieve the effect that the preset interval of the target component carrier in the cross carrier scheduling scene is the same as that of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene.

[0067] Preferably, when performing the cross carrier scheduling, another way for generating the UE-specific search space is:

[00011]$\left\{N_{\mathrm{eCCE}}^{\mathrm{RB}}\left(.Math.A/N_{\mathrm{eCCE}}^{\mathrm{RB}}.Math.+n_{\mathrm{CI}}\right)+L\left(Y_k+m+n_{\mathrm{CI}}\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}^{\mathrm{RB}}/L.Math.\right\}+i$$.Math.A=L.Math.\left\{\left(Y_k+.Math.\frac{mN_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}$

[0068] wherein Y.sub.k represents the initial candidate position of the UE-specific search space, n.sub.CI represents the component carrier index, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, N.sub.CC.sup.Num represents the number of the component carriers scheduled on the target component carrier or represents the number of the configured component carriers, i=0, . . . ,L−1, m represents the candidate set index, and m=0, . . . ,M.sub.set.sup.(L)−1.

[0069] This way may achieve the effect that the preset interval of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the candidate positions of each component carrier scheduled by the target component carrier are in adjacent resource blocks.

[0070] Preferably, when performing the cross carrier scheduling, another way for generating the UE-specific search space is: the way for generating the UE-specific search space when performing the cross carrier scheduling is the same as that of generating the UE-specific search space when performing the non-cross carrier scheduling, and the resource sets corresponding the UE-specific search space of all component carriers scheduled by the target component carrier are configured by different signallings.

[0071] Based on the above preset interval and conditions, preferably, one way for generating the UE-specific search space when performing the non-cross carrier scheduling:

[00012]$L.Math.\left\{\left(Y_k+.Math.\frac{mN_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i$

[0072] wherein Y.sub.k represents the initial candidate position of the UE-specific search space, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, i=0, . . . ,L−1, m represents the candidate set index, and m=0, . . . ,M.sub.set.sup.(L)−1.

[0073] Preferably, when performing the non-cross carrier scheduling, another way for generating the UE-specific search space is:

[00013]$\left\{\left(Y_k+.Math.\frac{\left(m+X\right)N_{\mathrm{ECCE}}}{LZ}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i$

[0074] wherein Y.sub.k represents the initial candidate position of the UE-specific search space, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, i=0, . . . ,L−1, m represents the candidate set index, m=0, . . . ,M.sub.set.sup.(L)−1, X=(M.sub.set.sup.(L)+1)mod 2, Z=M.sub.set.sup.(L)+X, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set.

[0075] Preferably, when performing the non-cross carrier scheduling, another way for generating the UE-specific search space is:

[00014]$\left\{N_{\mathrm{eCCE}}^{\mathrm{RB}}.Math.A/N_{\mathrm{eCCE}}^{\mathrm{RB}}.Math.+L\left(Y_k+m\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}^{\mathrm{RB}}/L.Math.\right\}+i$$A=L.Math.\left\{\left(Y_k+.Math.\frac{mN_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}$

[0076] wherein Y.sub.k represents the initial candidate position of the UE-specific search space, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, i=0, . . . ,L−1, m represents the candidate set index, m=0, . . . ,M.sub.set.sup.(L)−1, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame S.sub.k.sup.(L) namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and N.sub.eCCE.sup.RB the number of the eCCEs contained in one resource block.

[0077] When performing the above non-cross carrier scheduling, the way for generating the UE-specific search space may achieve the effect that the preset interval of the target component carrier in the non-cross carrier scheduling scene is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set.

[0078] Preferably, an initial position of the UE-specific search space corresponding the same resource set index of the component carrier adopts the same configuration, Embodiment 1 thereof is: the initial position of the UE-specific search space corresponding to each component carrier adopts the following configuration:

[0079] the initial position on the sub-frame k is: Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0080] wherein Y.sub.−1=n.sub.RNTI≠0, A=39827, 39829, 39825, 39823, 39821, 39831 or 39837, D=65537, k=└n.sub.s/2┘, └ ┘ represents rounding down, n.sub.s represents a timeslot number in one radio frame, and n.sub.RNTI represents a corresponding Radio Network Temporary Identifier (RNTI);

[0081] wherein different resource sets correspond to different values of A, for example, a resource set 0 corresponds to A=39827 and a resource set 1 corresponds to A=39829, or the resource set 0 corresponds to A=39827 and the resource set 1 corresponds to A=39823;

[0082] Embodiment 2 is: the initial position of the UE-specific search space corresponding to each component carrier adopts the following configuration:

[0083] the initial position on the sub-frame k is: Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0084] wherein Y.sub.−1=n.sub.RNTI+s×2.sup.16≠0, A=39827, D=65537, k=└n.sub.2/2┘, └ ┘ represents rounding down, n.sub.s, represents the timeslot number in one radio frame, n.sub.RNTI represents the corresponding RNTI, and s represents the resource set index;

[0085] Embodiment 3 is: the initial position of the UE-specific search space corresponding to each component carrier adopts the following configuration:

[0086] the initial position of a resource set s on the sub-frame k is: Y.sub.K.sup.S=Y.sub.K+S or Y.sub.K.sup.s=Y.sub.K×2+S or Y.sub.k.sup.s=Y.sub.K+B, B is 1 or M.sub.set.sup.(L), Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0087] wherein Y.sub.−1=n.sub.RNTI≠0, A=39827, D=65537, k=└n.sub.s/2┘, └ ┘ represents rounding down, n.sub.s, represents the timeslot number in one radio frame, and n.sub.RNTI represents the corresponding RNTI.

[0088] Preferably, the initial positions of the UE-specific search space corresponding to the same resource set index of the component carrier adopt separate configurations, Embodiment 1 thereof is:

[0089] the initial position on the sub-frame k is: Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0090] wherein Y.sub.−1=n.sub.RNTI≠0, A=39827, 39829, 39825, 39823, 39821, 39831 or 39837, D=65537 , k=└n.sub.s/2┘, └ ┘ represents rounding down, n.sub.s, represents the timeslot number in one radio frame, n.sub.RNTI represents the corresponding RNTI; different component carriers correspond to different values of A;

[0091] Embodiment 2 is:

[0092] the initial position on the sub-frame k is: Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0093] wherein Y.sub.−1=n.sub.RNTI+n.sub.CI×2.sup.17+s×2.sup.16≠0, A=39827, 39829, 39825, 39823, 39821, 39831 or 39837, D=65537, k=└n.sub.s/2┘, └ ┘ represents rounding down, n.sub.s represents the timeslot number in one radio frame, n.sub.RNTI represents the corresponding RNTI, n.sub.CI represents the component carrier index, and s represents the resource set index;

[0094] Embodiment 3 is:

[0095] the initial position on the sub-frame k is: Y′.sub.k=Y.sub.k+n.sub.CI, Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0096] wherein Y.sub.−1=n.sub.RNTI≠0, A=39827, 39829, 39825, 39823, 39821, 39831 or 39837, D=65537, k=└n.sub.s/2┘, └ ┘ represents rounding down, n.sub.s the timeslot number in one radio frame, and n.sub.RNTI represents the corresponding RNTI.

[0097] Several preferred embodiments of the disclosure are also provided below for further explanation.

[0098] In Embodiment 1 of the disclosure, when performing the non-cross carrier scheduling, the UE-specific search space is determined as:

[00015]$L.Math.\left\{\left(Y_k+.Math.\frac{mN_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,$

[0099] when performing the cross carrier scheduling, the UE-specific search space is determined as:

[00016]$L.Math.\left\{\left(Y_k+n_{\mathrm{CI}}+.Math.\frac{mN_{\mathrm{ECCE}}}{LM_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,$

[0100] the initial position on the sub-frame k is: Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0101] wherein Y.sub.k represents the initial candidate position of the UE-specific search space, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, i=0, . . . ,L−1, m represents the candidate set index, n.sub.CI represents the component carrier index; Y.sub.−1=n.sub.RNTI≠0, A=39827, 39829, 39825, 39823, 39821, 39831 or 39837, D=65537 k=└n.sub.s/2┘, └ ┘ represents rounding down, n.sub.s the timeslot number in one radio frame, n.sub.RNTI represents the corresponding RNTI, different resource sets correspond to different values of A; the aggregation level may be 1, 2, 4, 8, 16, 32, the number of the candidate positions may be 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, and the total number of the eCCEs in one resource set may be 4, 8, 16, 32, 64.

[0102] In Embodiment 2 of the disclosure, when performing the non-cross carrier scheduling, the UE-specific search space is determined as:

[00017]$\left\{\left(Y_k+.Math.\frac{\left(m+X\right)N_{\mathrm{ECCE}}}{LZ}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,$

X=(M(.sub.set.sup.(L)+1)mod 2, Z=M.sub.set.sup.(L)+X,

[0103] when performing the cross carrier scheduling, the UE-specific search space is determined as:

[00018]$\left\{\left(Y_k+.Math.\frac{\left(n_{\mathrm{CI}}\times M_{\mathrm{set}}^{\left(L\right)}+m+G\right)\times N_{\mathrm{ECCE}}}{L\times Z\times N_{\mathrm{CC}}^{\mathrm{Num}}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,$

X=(M.sub.set.sup.(L)+1)mod 2, Z=M.sub.set.sup.(L)+X, G is 0 or X,

[0104] the initial position of the resource set s on the sub-frame k: Y.sub.K.sup.S=Y.sub.K+S or Y.sub.K.sup.s=Y.sub.K×2+S or Y.sub.K.sup.s=Y.sub.K+B, B is 1 or M.sub.set.sup.(L), and Y.sub.k=(A.Math.Y.sub.k-1)mod D;

[0105] wherein Y.sub.k represents the initial candidate position of the UE-specific search space, n.sub.CI represents the component carrier index, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, N.sub.CC.sup.Num represents the number of the component carriers scheduled on the target component carrier or represents the number of the configured component carriers, i=0, . . . ,L−1, m represents the candidate set index, m=0, . . . ,M.sub.set.sup.(L)−1; Y.sub.−1=n.sub.RNTI≠0, A=39827, D=65537, k=└n.sub.s/2┘, └ └ represents rounding down, n.sub.s the timeslot number in one radio frame, n.sub.RNTI represents the corresponding RNTI; the aggregation level may be 1, 2, 4, 8, 16, 32, the number of the candidate positions may be 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, the total number of the eCCEs in one resource set may be 4, 8, 16, 32, 64.

[0106] In embodiment 3 of the disclosure, when performing the non-cross carrier scheduling, the UE-specific search space is determined as:

[00019]$\left\{N_{\mathrm{eCCE}}^{\mathrm{RB}}\times .Math.A/N_{\mathrm{eCCE}}^{\mathrm{RB}}.Math.+L\times \left(Y_k+m\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}^{\mathrm{RB}}/L.Math.\right\}+i,.Math.A=L.Math.\left\{\left(Y_k+.Math.\frac{m\times N_{\mathrm{ECCE}}}{L\times M_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\},$

[0107] when performing the cross carrier scheduling, the UE-specific search space is determined as:

[00020]$\left\{N_{\mathrm{eCCE}}^{\mathrm{RB}}\times \left(.Math.A/N_{\mathrm{eCCE}}^{\mathrm{RB}}.Math.+n_{\mathrm{CI}}\right)+L\times \left(Y_k+m+n_{\mathrm{CI}}\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}^{\mathrm{RB}}/L.Math.\right\}+i,.Math..Math.A=L.Math.\left\{\left(Y_k+.Math.\frac{m\times N_{\mathrm{ECCE}}}{L\times M_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\},$

[0108] the initial position of the resource set s on the sub-frame k is: Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0109] wherein Y.sub.−1=n.sub.RNTI+n.sub.CI×2.sup.17+s×2.sup.16≠0, A=39827, 39829, 39825, 39823, 39821, 39831 or 39837, D=65537 k=└n.sub.s/2┘, └ ┘ represents rounding down, n.sub.s the timeslot number in one radio frame, n.sub.RNTI represents the corresponding RNTI, n.sub.CI represents the component carrier index, s represents the resource set index; Y.sub.k represents the initial candidate position of the UE-specific search space, n.sub.CI represents the component carrier index, N.sub.eCCE represents the total number of the eCCEs in one resource set, L represents the aggregation level, M.sub.set.sup.(L) represents the number of the candidate positions to be detected in the search space S.sub.k.sup.(L) having the aggregation level L and corresponding to the resource set set on the sub-frame k, namely the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, N.sub.CC.sup.Num represents the number of the component carriers scheduled on the target component carrier or represents the number of the configured component carriers, i=0, . . . ,L−1, m represents the candidate set index, m=0, . . . ,M.sub.set.sup.(L)−1; the aggregation level may be 1, 2, 4, 8, 16, 32, the number of the candidate positions may be 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, the total number of the eCCEs in one resource set may be 4, 8, 16, 32, 64.

[0110] In Embodiment 4 of the disclosure, in a TDD system, a relating ARO scope when determining a PUCCH resource corresponding to the PDSCH scheduled by the ePDCCH transmitted by the candidate position according to the preset information, and the preset information includes at least one of the followings: a sub-frame index, and the number H of downlink sub-frames corresponding to an uplink sub-frame in which the PUCCH is located;

Embodiment 1

[0111] the preset information includes the sub-frame index, specifically:

[0112] the ARO scope is determined according to a position h of a downlink sub-frame index k in which the ePDCCH is located in a downlink sub-frame window corresponding to the uplink sub-frame in which the PUCCH is located; h is numbered from 0;

[0113] the ARO scope corresponds to n sets, n is 4, a specific determination way is:

[0114] h is 0, then an ARO is {2, −1, 0, −2},

[0115] h is 1, then the ARO is {2, 0, −1, −N.sub.eCCE(k-1, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)},

[0116] h is 2, then the ARO is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)},

[0117] h is 3, then the ARO is {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)};

[0118] or, the ARO scope corresponds to n sets, n is 3, the specific determination way is:

[0119] the ARO scope corresponding to a first sub-frame in H sub-frames is: {−2, 2, −1, 0},

[0120] the ARO scope corresponding to a last sub-frame in H sub-frames is: {2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)},

[0121] the ARO scope corresponding to other sub-frames in H sub-frames is: {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)};

[0122] or, the ARO scope corresponds to n sets, n is 3, the specific determination way is:

[0123] the ARO scope corresponding to the first sub-frame in H sub-frames is: {−2, 2, −1, 0},

[0124] the ARO scope corresponding to the second sub-frame in H sub-frames is: {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)},

[0125] the ARO scope corresponding to other sub-frames in H sub-frames is: {2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)};

[0126] or, the ARO scope corresponds to n sets, n is 2, the specific determination way is:

[0127] the ARO scope corresponding to the first sub-frame in H sub-frames is: {−2, 2, −1, 0}

[0128] the ARO scope corresponding to other sub-frames in H sub-frames is: {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)};

[0129] or, the ARO scope corresponds to n sets, n is 2, the specific determination way is:

[0130] the ARO scope corresponding to the first sub-frame in H sub-frames is: {−2, 2, −1, 0},

[0131] the ARO scope corresponding to other sub-frames in H sub-frames is: {2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)−N.sub.eCCE(k, j)};

Embodiment 2

[0132] the preset information includes the sub-frame index and the number H of the downlink sub-frames corresponding to the uplink sub-frame in which the PUCCH is located;

[0133] the ARO scope is determined according to the position h of the downlink sub-frame index k in which the ePDCCH is located in the downlink sub-frame window corresponding to the uplink sub-frame in which the PUCCH is located; h is numbered from 0;

[0134] when H is 1, the ARO scope is {−2, 2, −1, 0},

[0135] when H is 2, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −1, −N.sub.eCCE(k-1, j)} or {2, 0, −2, N.sub.eCCE(k-1, j)},

[0136] when H is 3, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)} or {2, 0, −1, −N.sub.eCCE(k-1, j)}, h is 3, then the ARO scope is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)};

[0137] when H is 4, h is 1, then the ARO scope is {−2, 2, −1, 0}, h is 2, then the ARO scope is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)} or {2, 0, −1, −N.sub.eCCE(k-1, j)}, h is 3, then the ARO scope is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)}, h is 4, then the ARO scope is {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)} or {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)};

[0138] Embodiment 3: the preset information includes the number H of the downlink sub-frames corresponding to the uplink sub-frame in which the PUCCH is located, specifically:

[0139] when H is 1, the ARO scope is {2, 2, −1, 0},

[0140] when H is other values, the ARO scope is {2, 0, N.sub.eCCE(j)*┌(D)/2┐, N.sub.eCCE(j)*D}, wherein D is H or H−1.

Embodiment 4

[0141] the preset information includes the sub-frame index and the number H of the downlink sub-frames corresponding to the uplink sub-frame in which the PUCCH is located;

[0142] the preset information includes the sub-frame index, specifically:

[0143] the ARO scope is determined according to the position h of the downlink sub-frame index k in which the ePDCCH is located in the downlink sub-frame window corresponding to the uplink sub-frame in which the PUCCH is located; h is numbered from 0; the specific determination way is:

[0144] the ARO scope is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 and T2 are real numbers, T3 and T4 are integers, D1 is

[00021]$\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)}$

or a first preset value, D2 is

[00022]$\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math.N_{\mathrm{eCCE}\left(k,j\right)}$

or a second preset value, T5 and T6 are integers;

[0145] preferably, the corresponding values of T1 and T2 are T1=−⅓, T2=−1, or T1=−½, T2=−1, or T1=−⅔, T2=−1, or T1=−⅓, T2=−⅔, or T1=−⅓, T2=−½, or T1=−½, T2=−⅔, or T1=−½, T2=−¾, or T1=−⅓, T2=−¾, or T1=−1, T2=−1, or T1=−1, T2=−2; the corresponding values of T3 and T4 are T3=0, T4=0, or T3=−1, T4=−2, or T3=−2, T4=−1; the corresponding values of T5 and T6 are T5=h, T6=h, or T5=h−1, T6=h, or T5=1, T6=2, or T5=0, T6=1, or T5=1, T6=1;

[0146] the first preset value is the number of the eCCEs corresponding to w1 resource sets, the second preset value is the number of the eCCEs corresponding to w2 resource sets; the values of w1 and w2 may be the same, or may be not the same, for example a specific value is: 0, 1, 2, 3, 4, 9; wherein the number of the eCCEs corresponding to the resource set is a maximum number or a minimum number of the eCCEs corresponding to a resource set j in the downlink sub-frame corresponding to the uplink sub-frame in which the PUCCH is located under a current configuration, or is the number of the eCCEs corresponding to the first downlink sub-frame resource set j, and the resource set j is the resource set in which the ePDCCH corresponding to the PUCCH is located.

[0147] or, the first preset value and the second preset value may also separately be one constant value, such as 0, 4, 8, 16, 32, and etc.;

[0148] H is a positive integer, and a preferred value range is 1, 2, 3, 4, 9;

[0149] it shall be explained that a rounding down operation └ ┘ when determining the value of the AOR in Embodiment 4 may also be substituted with a rounding up operation ┌ ┐.

[0150] The above formula is specifically exampled below:

[0151] the ARO is {0, 2,

[00023]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}/2.Math.,-\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\},$

or the ARO is {0, 2,

[0152] [00024]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times 2/3.Math.,-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}/3.Math.\},$

or the ARO is {0, 2,

[0153] [00025]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times 2/3.Math.,-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}/2.Math.\},$

or the ARO is {0, 2,

[0154] [00026]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}/2.Math.-1,-\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}-2\},$

or the ARO is {0, 2,

[0155] [00027]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}/3.Math.-1,-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times 2/3.Math.-2\},$

or the ARO is {0, 2,

[0156] [00028]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}/2.Math.-1,.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times 2/3.Math.-2\};$

or, h is 0, then the ARO is {2, −1, 0, −2},
when h is other values, the ARO is {0, 2,

[00029]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times \frac{1}{2}.Math.,-\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\},$

or ARO is {0, 2,

[0157] [00030]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times \frac{1}{3}.Math.,-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times \frac{2}{3}.Math.\},$

or the ARO is {0, 2,

[0158] [00031]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times \frac{1}{2}.Math.,-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times \frac{2}{3}.Math.\},$

or the ARO is {0, 2,

[0159] [00032]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times \frac{1}{2}.Math.,-\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}-2\},$

or the ARO is {0, 2,

[0160] [00033]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times \frac{1}{3}.Math.-1,-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times \frac{2}{3}.Math.-2\},$

or the ARO is {0, 2,

[0161] [00034]$-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times \frac{1}{2}.Math.-1,-.Math.\underset{k=0}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}\times \frac{3}{4}.Math.-2\}.$

[0162] In the above Embodiment 4 of the disclosure, k represents the sub-frame index, j identifies the resource set index, N.sub.eCCE(k, j) represents the number of the eCCEs corresponding to the resource set j of the sub-frame k.

[0163] An embodiment of the disclosure further provides a method for detecting downlink control information, an execution body thereof may be a UE, as shown in FIG. 3, mainly including:

[0164] Step 301: determining a UE-specific search space of an ePDCCH bearing downlink control information according to a preset interval; wherein the preset interval is determined according to the number of candidate positions of one component carrier at a corresponding aggregation level in a corresponding resource set, or the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the number of scheduled component carriers, or the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the number of configured component carriers;

[0165] Step 302: detecting the downlink control information on a physical resource corresponding to the UE-specific search space.

[0166] Preferably, the preset interval may also be determined according to a component carrier index and/or a candidate set index.

[0167] Preferably, the preset interval meets at least one of the following conditions:

[0168] the preset interval of a target component carrier in a cross carrier scheduling scene is the same as that of the target component carrier in a non-cross carrier scheduling scene;

[0169] the preset interval of the target component carrier in the cross carrier scheduling scene is the same as that of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene; and

[0170] the preset interval of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene is determined according to the number of the candidate positions of N component carriers at the corresponding aggregation level in the corresponding resource set; the preset interval of the target component carrier in the non-cross carrier scheduling scene is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, wherein N is a natural number.

[0171] Preferably, candidate sets of each component carrier scheduled by the target component carrier adopt the same candidate set index;

[0172] or, the candidate sets of each component carrier scheduled by the target component carrier are cross-mapped in accordance with the component carrier index;

[0173] or, the candidate sets of each component carrier scheduled by the target component carrier are sequentially mapped in accordance with the component carrier index.

[0174] Preferably, when performing cross carrier scheduling, the UE-specific search space is generated by adopting the following way:

[00035]$L.Math.\left\{\left(Y_k+n_{\mathrm{CI}}+.Math.\frac{m\times N_{\mathrm{ECCE}}}{L\times M_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,\mathrm{or},.Math.L.Math.\left\{\left(Y_k+.Math.\frac{\left(n_{\mathrm{CI}}\times M_{\mathrm{set}}^{\left(L\right)}+m\right)\times N_{\mathrm{ECCE}}}{L\times M_{\mathrm{set}}^{\left(L\right)}\times N_{\mathrm{CC}}^{\mathrm{Num}}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,\mathrm{or},.Math.L.Math.\left\{\left(Y_k+.Math.\frac{\left(n_{\mathrm{CI}}+m\times N_{\mathrm{CC}}^{\mathrm{Num}}\right)\times N_{\mathrm{ECCE}}}{L\times M_{\mathrm{set}}^{\left(L\right)}\times N_{\mathrm{CC}}^{\mathrm{Num}}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,\mathrm{or},\text{.Math.}.Math.\left\{\left(Y_k+.Math.\frac{\left(n_{\mathrm{CI}}\times M_{\mathrm{set}}^{\left(L\right)}+m+G\right)\times N_{\mathrm{ECCE}}}{L\times Z\times N_{\mathrm{CC}}^{\mathrm{Num}}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,$

X=(M.sub.set.sup.(L)+1)mod 2, Z=M.sub.set.sup.(L)+X, G is 0 or X; or,

[00036]$\left\{\left(Y_k+n_{\mathrm{CI}}+.Math.\frac{\left(m+G\right)\times N_{\mathrm{ECCE}}}{L\times Z}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,$

X=(M.sub.set.sup.(L)+1)mod 2, Z=M.sub.set.sup.(L)+X, G is 0 or X;

[0175] or, {N.sub.eCCE.sup.RB×(└A/N.sub.eCCE.sup.RB┘+n.sub.CI)+L×(Y.sub.k+m+n.sub.CI)mod └N.sub.eCCE.sup.RB/L┘}+i,

[00037]$A=L.Math.\left\{\left(Y_k+.Math.\frac{m\times N_{\mathrm{ECCE}}}{L\times M_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\},$

[0176] or, the way for generating the UE-specific search space when performing the cross carrier scheduling is the same as that for generating the UE-specific search space when performing non-cross carrier scheduling, and the resource sets corresponding the UE-specific search spaces of all component carriers scheduled by the target component carrier are configured by different signallings.

[0177] Preferably, wherein when performing non-cross carrier scheduling, the UE-specific search space is generated by adopting the following way:

[00038]$L.Math.\left\{\left(Y_k+.Math.\frac{m\times N_{\mathrm{ECCE}}}{L\times M_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,\mathrm{or},.Math.\left\{\left(Y_k+.Math.\frac{\left(m+X\right)\times N_{\mathrm{ECCE}}}{L\times Z}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}+i,.Math.X=\left(M_{\mathrm{set}}^{\left(L\right)}+1\right).Math.\mathrm{mod}.Math..Math.2,Z=M_{\mathrm{set}}^{\left(L\right)}+X,\mathrm{or},.Math.\left\{N_{\mathrm{eCCE}}^{\mathrm{RB}}\times .Math.A/N_{\mathrm{eCCE}}^{\mathrm{RB}}.Math.+L\times \left(Y_k+m\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}^{\mathrm{RB}}/L.Math.\right\}+i,.Math.A=L.Math.\left\{\left(Y_k+.Math.\frac{m\times N_{\mathrm{ECCE}}}{L\times M_{\mathrm{set}}^{\left(L\right)}}.Math.\right).Math.\mathrm{mod}.Math..Math.N_{\mathrm{eCCE}}/L.Math.\right\}.$

[0178] Preferably, this method further includes: making initial positions of the UE-specific search space corresponding to the same resource set index of all component carriers configured to the UE to adopt the same configuration or separate configurations.

[0179] Making the initial positions of the UE-specific search space corresponding to the same resource set index of the component carriers to adopt separate configurations includes:

[0180] the initial position on a sub-frame k is: Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0181] Y.sub.−k=n.sub.RNTI≠0, A=39827, 39829, 39825, 39823 39821, 39831 or 39837, D=65537, k=└n.sub.s/2┘, └ ┘ represents rounding down, n.sub.s represents a timeslot number in one radio frame, n.sub.RNTI represents a RNTI corresponding to the UE, wherein different component carriers correspond to different values of A;

[0182] or, the initial position on the sub-frame k is: Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0183] Y.sub.−1=n.sub.RNTI+n.sub.CI×2.sup.17+s×2.sup.16≠0, or Y.sub.−1+n.sub.RNTI+n.sub.CI×2.sup.16+s×2.sup.19≠0, or, Y.sub.−1=n.sub.RNTI+n.sub.CI×2.sup.16≠0, A=39827, 39829, 39825, 39823, 39821, 39831 or 39837, D=65537, k=└n.sub.s/2┘, └ ┘ represents rounding down, n.sub.s represents the timeslot number in one radio frame, n.sub.RNTI represents the RNTI corresponding to the UE, n.sub.CI represents the component carrier index, s represents the resource set index;

[0184] or, the initial position on the sub-frame k is: Y′.sub.k=Y.sub.k+n.sub.CI, or, Y′.sub.k=Y.sub.k+n.sub.CI×2+s, wherein Y.sub.k=(A.Math.Y.sub.k-1)mod D,

[0185] Y.sub.−1=n.sub.RNTI≠0, A=39827, 39829, 39825, 39823, 39821, 39831 or 39837, D=65537, k=└n.sub.s/2┘, └ ┘ represents rounding down, n.sub.s represents the timeslot number in one radio frame, n.sub.RNTI represents the RNTI corresponding to the UE, n.sub.CI represents the component carrier index, and s represents the resource set index.

[0186] Preferably, this method further includes: determining, in a TDD system, an ARO scope of a PUCCH resource corresponding to a PDSCH scheduled by the ePDCCH according to preset information, wherein the preset information includes at least one of the followings:

[0187] a sub-frame index; and the number of downlink sub-frames corresponding to an uplink sub-frame in which the PUCCH is located.

[0188] The ARO scope corresponds to n sets, n is 2, 3, 4, 5, 6, 7, 8 or 9.

[0189] Preferably, this method further includes: determining a value of the ARO according to a position h of a downlink sub-frame index k in which the ePDCCH is located in a downlink sub-frame window corresponding to the uplink sub-frame in which the PUCCH is located, wherein h is numbered from 0, which specifically includes:

[0190] h is 0, then the ARO is {2, −1, 0, −2},

[0191] h is 1, then the ARO is {2, 0, −1, −N.sub.eCCE(k-1, j)} or {2, 0, −2, −N.sub.eCCE(k-1, j)},

[0192] h is 2, then the ARO is {2, 0, −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)},

[0193] h is 3, then the ARO is {2, 0, −N.sub.eCCE(k-3, j)−N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)};

[0194] or,

[0195] the ARO corresponding to a first sub-frame is {−2, 2, −1, 0},

[0196] the ARO corresponding to a last sub-frame is {2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-2, j)−N.sub.eCCE(k-1, j)},

[0197] the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)};

[0198] or,

[0199] the ARO corresponding to the first sub-frame is {−2, 2, −1, 0},

[0200] the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), N.sub.eCCE(k, j)};

[0201] or,

[0202] the ARO corresponding to the first sub-frame is {−2, 2, −1, 0},

[0203] the ARO corresponding to other sub-frames is {2, 0, −N.sub.eCCE(k-1, j), −N.sub.eCCE(k-1, j)−N.sub.eCCE(k, j)};

[0204] or,

[0205] the ARO is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 and T2 are real numbers, T3 and T4 are integers, D1 is

[00039]$\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}$

or a first preset value, D2 is

[00040]$\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}$

or a second preset value, T5 and T6 are integers;

[0206] or,

[0207] h is 0, then the ARO is {2, −1, 0, −2},

[0208] h is other values, the ARO is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┌+T4}, wherein T1 and T2 are real numbers, T3 and T4 are integers, D1 is

[00041]$\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}$

or the first preset value, D2 is

[00042]$\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)}$

or the second preset value, T5 and T6 are integers;

[0209] or,

[0210] h is 0, then the ARO is {2, −1, 0, −2},

[0211] h is other values, the ARO is {0, 2, └D1×T1┘+T3, └D2×T2┘+T4} or {0, 2, ┌D1×T1┐+T3, ┌D2×T2┐+T4}, wherein T1 is −1, T2 is −1, T3 is −1, T4 is −2, D1 is

[00043]$\underset{k=h-T_5}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)},$

D2 is

[0212] [00044]$\underset{k=h-T_6}{\overset{h-1}{.Math.}}.Math..Math.N_{\mathrm{eCCE}\left(k,j\right)},$

T5 and T6 are integers;

[0213] wherein k represents the sub-frame index, and j represents a resource set index.

[0214] Corresponding to the method for sending the downlink control information of the embodiment of the disclosure, the disclosure further provides an embodiment of a sending end, this sending end is located at a base station side, as shown in FIG. 4, this sending end mainly includes:

[0215] a search space determining module, configured to determine a UE-specific search space of an ePDCCH bearing downlink control information according to a preset interval; wherein the preset interval is determined according to the number of candidate positions of one component carrier at a corresponding aggregation level in a corresponding resource set, or the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the number of scheduled component carriers, or the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the number of configured component carriers; and

[0216] an information sending module, configured to send the downlink control information to the UE on a physical resource corresponding to the UE-specific search space of the ePDCCH.

[0217] Preferably, the search space determining module is further configured to determine the preset interval according to a component carrier index and/or a candidate set index.

[0218] Preferably, the preset interval meets at least one of the following conditions:

[0219] the preset interval of a target component carrier in a cross carrier scheduling scene is the same as that of the target component carrier in a non-cross carrier scheduling scene;

[0220] the preset interval of the target component carrier in the cross carrier scheduling scene is the same as that of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene; and

[0221] the preset interval of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene is determined according to the number of the candidate positions of N component carriers at the corresponding aggregation level in the corresponding resource set; the preset interval of the target component carrier in the non-cross carrier scheduling scene is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, wherein N is a natural number.

[0222] Candidate sets of each component carrier scheduled by the target component carrier adopt the same candidate set index;

[0223] or, the candidate sets of each component carrier scheduled by the target component carrier are cross-mapped in accordance with the component carrier index;

[0224] or, the candidate sets of each component carrier scheduled by the target component carrier are sequentially mapped in accordance with the component carrier index.

[0225] Preferably, the sending end further includes: an ARO determining module configured to, determine, in a TDD system, an ARO scope of a PUCCH resource corresponding to a PDSCH scheduled by the ePDCCH according to preset information, wherein the preset information includes at least one of the followings: a sub-frame index; and the number of downlink sub-frames corresponding to an uplink sub-frame in which the PUCCH is located.

[0226] Corresponding to the method for detecting the downlink control information of the embodiment of the disclosure, the disclosure further provides an embodiment of a receiving end, this receiving end is located at a UE side, as shown in FIG. 5, this receiving end mainly includes:

[0227] a search space determining module, configured to determine a UE-specific search space of an ePDCCH bearing downlink control information according to a preset interval; wherein the preset interval is determined according to the number of candidate positions of one component carrier at a corresponding aggregation level in a corresponding resource set, or the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the number of scheduled component carriers, or the preset interval is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, and the number of configured component carriers; and

[0228] an information detecting module, configured to detect the downlink control information on a physical resource corresponding to the search space.

[0229] Preferably, the search space determining module is further configured to determine the preset interval according to a component carrier index and/or a candidate set index.

[0230] Preferably, the preset interval meets at least one of the following conditions:

[0231] the preset interval of a target component carrier in a cross carrier scheduling scene is the same as that of the target component carrier in a non-cross carrier scheduling scene;

[0232] the preset interval of the target component carrier in the cross carrier scheduling scene is the same as that of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene; and

[0233] the preset interval of the component carrier scheduled by the target component carrier in the cross carrier scheduling scene is determined according to the number of the candidate positions of N component carriers at the corresponding aggregation level in the corresponding resource set; the preset interval of the target component carrier in the non-cross carrier scheduling scene is determined according to the number of the candidate positions of one component carrier at the corresponding aggregation level in the corresponding resource set, wherein N is a natural number.

[0234] Candidate sets of each component carrier scheduled by the target component carrier adopt the same candidate set index;

[0235] or, the candidate sets of each component carrier scheduled by the target component carrier are cross-mapped in accordance with the component carrier index;

[0236] or, the candidate sets of each component carrier scheduled by the target component carrier are sequentially mapped in accordance with the component carrier index.

[0237] Preferably, the search space determining module is further configured to make initial positions of the UE-specific search space corresponding to the same resource set index of all component carriers configured to the UE to adopt the same configuration or separate configurations.

[0238] Preferably, the receiving end further includes: an ARO determining module configured to, determine, in a TDD system, an ARO scope of a PUCCH resource corresponding to a PDSCH scheduled by the ePDCCH according to preset information, wherein the preset information includes at least one of the followings:

[0239] a sub-frame index; and the number of downlink sub-frames corresponding to an uplink sub-frame in which the PUCCH is located

[0240] In conclusion, the embodiment of the disclosure solves a problem about how to determine the UE-specific search space of the ePDCCH in the cross carrier scheduling scene, facilitates detection of the ePDCCH, and the embodiment of the disclosure can reduce overlap between candidate positions of each component carrier scheduled on a target component carrier, guarantee obtaining scheduling gain of the candidate position of scheduled each component carrier, and reduce a scheduling blocking rate of the ePDCCH.

[0241] Each module in the above embodiment may be implemented by adopting a form of hardware, and may also be implemented by adopting the form of a software function module, and disclosure is not limited to any specific form of combination of hardware and software. All those described above are only preferred embodiments of the disclosure, and are not used to limit the scope of protection of the disclosure, any alternation or substitution which can easily be conceived by those skilled in the art within a technical scope disclosed by the disclosure, shall be covered within the scope of protection of the disclosure.