CN110351051A

CN110351051A - A kind of method and device of determining search space

Info

Publication number: CN110351051A
Application number: CN201810301449.XA
Authority: CN
Inventors: 张旭; 薛丽霞; 成艳
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2018-04-04
Filing date: 2018-04-04
Publication date: 2019-10-18
Anticipated expiration: 2038-04-04
Also published as: CN110351051B

Abstract

A kind of method and device of determining search space, in application this method, the network equipment or terminal can determine the corresponding Y control channel unit CCE set of X aggregation level set, and based on Y CCE set and maximum CCE number, determine N number of search space.Wherein, N is the positive integer less than or equal to Y, one in each correspondence Y polymerization grade in N number of search space in N number of polymerization grade, all CCE for constituting N number of search space are the subset for the CCE that Y CCE set includes, the number for constituting all CCE of N number of search space is less than or equal to the maximum CCE number, the maximum number that the maximum CCE number is terminal CCE that can be detected described in each time slot.By the application, the requirement of channel estimation complexity, and the maximum capacity that can adequately reach using terminal as far as possible can satisfy.

Description

Method and device for determining search space

Technical Field

The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for determining a search space.

Background

In the next generation communication system (e.g., 5G or New Radio (NR)), the terminal acquires a control resource set (core set) configured by a high-level signaling, determines a search space set (search space set) according to the high-level signaling, and determines a Control Channel Element (CCE) in which the detected candidate control channel is located according to configuration information of the search space set.

Because the configuration information of the search space set acquired by the terminal includes the configuration information of the plurality of search space sets, the number of candidate control channels detected by the terminal is excessive, which exceeds the maximum capability of blind detection (blid decoding) for the control channels provided by the terminal, and further the terminal cannot detect the control information sent by the network device in time, and the delay of data reception is increased. Therefore, in the next generation communication system (for example: 5G or NR), the maximum value of blind detection of the control channel is defined for the terminal. The terminal needs to determine the detected candidate control channel according to the maximum value of the blind detection. For example, one common way to detect candidate control channels is: the predefined or high-layer signaling configuration search space comprises M maximum candidate control channels^(L) _full. Further, the high layer signaling configures a control channel parameter α, where a value range of α is a real number greater than or equal to 0 and less than or equal to 1. The terminal detects the candidate control channel in the predefined search space or the search space configured by the high-level signaling, and determines that the number is less than alpha.M^(L) _fullThe candidate control channel of (2) is used as the candidate control channel to be detected, and detection is performed.

The current method for determining the search space cannot ensure that the complexity of channel estimation meets the requirement.

Disclosure of Invention

The embodiment of the application provides a method for determining a search space, so as to meet the requirement of channel estimation complexity and fully utilize the maximum capability which can be achieved by a terminal as far as possible.

In a first aspect, an embodiment of the present application provides a method for determining a search space, in which a network device or a terminal determines a search space based on a set of CCEs in an aggregation level set included in a control channel resource set configured for the terminal and a maximum number of CCEs that the terminal can detect in each slot, all CCEs in the determined search space are subsets of the CCE set in the aggregation level set, and the number of all CCEs in the determined search space is less than or equal to the maximum number of CCEs that the terminal can detect in each slot.

In the embodiment of the application, the search space is determined based on the CCE set, and the number of all CCEs in the determined search space is less than or equal to the maximum number of CCEs which can be detected by the terminal in each time slot, so that the number of the CCEs in the search space meets the limitation of the maximum number of the CCEs for channel estimation, and the search space can be dynamically updated in real time in a manner of configuring a parameter alpha in a semi-static manner, and the requirement of channel estimation complexity is met; and to make the best possible use of the maximum capabilities that the terminal can achieve.

In one possible design, a terminal or a network device determines Y control channel element CCE sets corresponding to X aggregation level sets, where X is the number of all aggregation level sets corresponding to M control channel resource sets configured for the terminal, each aggregation level set includes one or more aggregation levels, X aggregation level sets include aggregation levels whose total sum is Y, each of the Y aggregation levels corresponds to one of the Y CCE sets, X is an integer greater than or equal to 1, M is an integer greater than or equal to 1, and Y is an integer greater than or equal to 1. And determining N search spaces based on the Y CCE sets and the maximum number of the CCEs, wherein N is a positive integer smaller than or equal to Y, each of the N search spaces corresponds to one of the N aggregation levels in the Y aggregation levels, all the CCEs forming the N search spaces are subsets of the CCEs included in the Y CCE sets, the number of all the CCEs forming the N search spaces is smaller than or equal to the maximum number of the CCEs, and the maximum number of the CCEs is the maximum number of the CCEs which can be detected by the terminal in each time slot.

In another possible design, all CCEs included in Y CCE sets include overlapping CCEs and non-overlapping CCEs, where the overlapping CCEs belong to at least two CCE sets and the non-overlapping CCEs belong to one CCE set. Each of the Y CCE sets includes one or more CCE subsets each consisting of a respective aggregation level number of CCEs, the respective aggregation level of each CCE subset being an aggregation level corresponding to the CCE set including the each CCE subset, and the CCE subset being a first-class subset or a second-class subset, where the first-class subset is a subset including overlapping CCEs and the second-class subset is a subset not including overlapping CCEs. The network device or the terminal may determine the CCEs included in the N search spaces according to the priority of the CCE subset included in the Y CCE sets and the maximum CCE number. For example, the CCEs corresponding to the second-class subset with a low aggregation level in the Y CCE sets are preferentially excluded until the number of the remaining CCEs included in the Y CCE sets is less than or equal to the maximum CCE number, and if the number of the remaining CCEs after all the second-class subsets included in the Y CCE sets are excluded is still greater than the maximum CCE number, the CCEs corresponding to the subset with a high aggregation level in the first-class subset are preferentially excluded until the remaining CCEs are less than or equal to the maximum CCE number; or, preferentially selecting the CCEs corresponding to the first-class subset with the high aggregation level in the Y CCE sets as the CCEs included in the N search spaces until the number of the selected CCEs meets the maximum number of the CCEs, and preferentially selecting the subset with the high aggregation level in the second-class subset if the number of the CCEs after all the first-class subsets are selected is still smaller than the maximum number of the CCEs until the number of the selected CCEs meets the maximum number of the CCEs.

In yet another possible design, all CCEs included in Y CCE sets include overlapping CCEs and non-overlapping CCEs, where the overlapping CCEs belong to at least two CCE sets and the non-overlapping CCEs belong to CCEs of one CCE set; each of the Y CCE sets includes one or more CCE subsets each made up of a respective aggregation level number of CCEs, the respective aggregation level of each CCE subset being an aggregation level corresponding to the CCE set including the each CCE subset, and the CCE subset is a third-class subset or a fourth-class subset, where the third-class subset is a subset including non-overlapping CCEs and the fourth-class subset is a subset not including non-overlapping CCEs. The network equipment or the terminal determines the CCEs included in the N search spaces based on the priority, the maximum number of the CCE and the maximum number of the candidate control channels of the CCE subset included in the Y CCE sets, wherein the maximum number of the candidate control channels is the maximum number of the candidate control channels which can be detected by the terminal in each time slot. For example, a subset of the fourth class with a low aggregation level from the Y CCE sets is preferentially excluded until the number of remaining CCE subsets is less than or equal to the maximum number of candidate control channels, and if the number of CCE subsets remaining after excluding all the subsets of the fourth class from the Y CCE sets is still greater than the maximum number of candidate control channels, a subset of CCEs with a low aggregation level from the subset of the third class is preferentially excluded until the number of remaining CCE subsets is less than or equal to the maximum number of candidate control channels; or preferentially selecting a third-class subset with a high aggregation level in the Y CCE sets until the number of the selected CCE subsets meets the maximum number of the candidate control channels, if the third-class subsets in the Y CCE sets are all selected, the number of the selected CCE subsets is still smaller than the maximum number of the candidate control channels, and preferentially selecting a fourth-class subset with a high aggregation level until the number of the selected CCE subsets meets the maximum number of the candidate control channels.

In yet another possible design, the network device or the terminal may determine CCEs included in N search spaces according to the priority of the CCE subset included in Y CCE sets, the maximum number of CCEs, and the maximum number of candidate control channels. For example, the network device or the terminal preferentially excludes the CCEs corresponding to the second-class subset with a low aggregation level in the Y CCE aggregations until the number of the remaining CCEs is less than or equal to the maximum CCE number, if the number of the CCEs remaining after the Y CCE sets comprise all the second-class subsets in the CCEs is excluded is still larger than the maximum number of the CCEs, the CCEs corresponding to the subsets with high aggregation levels in the first-class subsets are preferentially excluded until the number of the remaining CCEs is smaller than or equal to the maximum number of the CCEs, or preferentially selecting the CCEs corresponding to the first-class subset with high aggregation level in the Y CCE sets as the CCEs included in the N search spaces until the number of the selected CCEs meets the maximum number of the CCEs, if the number of CCEs after all the first-class subsets are selected is still smaller than the maximum number of CCEs, the subset with the high aggregation level in the second-class subsets is preferentially selected until the selected number of CCEs meets the maximum number of CCEs. It is assumed that CCE subsets including remaining CCEs in the Y CCE sets are W CCE subsets, where the W CCE subsets include third-class subsets and/or fourth-class subsets, where the third-class subsets are subsets including non-overlapping CCEs, the fourth-class subsets are subsets not including non-overlapping CCEs, and the fourth-class subsets have higher priority than the third-class subsets. The network device or terminal may determine the CCE subset satisfying the largest candidate number of control channels among the W CCE subsets determined to satisfy the largest number of CCEs, e.g., the network device or terminal may preferentially exclude a fourth-class subset having a low aggregation level among the W CCE subsets until the number satisfying the remaining CCE subsets is less than or equal to the largest candidate number of control channels, preferentially exclude a CCE subset having a low aggregation level among the third-class subset until the number remaining CCE subsets is less than or equal to the largest candidate number of control channels if the number satisfying the remaining CCE subset is still greater than the largest candidate number of control channels after all the fourth-class subsets among the W CCE subsets are excluded, or preferentially select a third-class subset having a high aggregation level among the Y CCE subsets until the selected number satisfies the largest candidate number of control channels, if all the third-class subsets among the Y CCE sets are selected, and preferentially selecting the fourth-class subset with high aggregation level until the number of the selected CCE subsets meets the maximum number of the candidate control channels.

In yet another possible design, the network device or the terminal may determine an index value for each CCE subset included in Y CCE sets corresponding to the X aggregation level sets, and then determine the search space based on the index value corresponding to each CCE subset in the Y CCE sets. For example, the N search spaces are determined based on the maximum number of CCEs and the index value corresponding to each CCE subset in the Y CCE sets. Or determining the N search spaces based on the maximum number of the control channels and the index value corresponding to each CCE subset in the Y CCE sets. Or determining the N search spaces based on the maximum number of CCEs, the maximum number of control channels and the index value corresponding to each CCE subset in the Y CCE sets.

In one possible implementation, the network device or the terminal may exclude CCE subsets from CCE subsets included in the Y CCE sets or select CCE subsets according to a size of an index value corresponding to each CCE subset in the Y CCE sets, and determine the search space such that the number of CCE subsets in the search space satisfies the maximum number of control channels and the number of CCEs in the search space satisfies the maximum number of CCEs.

In one possible embodiment, the index value corresponding to the CCE subset may be determined according to the CCE subset in which the CCE subset corresponding to the index value is locatedThe number of CCE subsets included in the group. For example, the index value R1 corresponding to the CCE subset satisfies the following formula R1 ═ m^(L)/M^(L)+ K. Wherein m is^(L)For the number of CCE subsets with aggregation level L in Y CCE sets, M^(L)The number of CCE subsets with aggregation level L in Y CCE sets is shown, and K is the number-1 of CCE subsets contained in a CCE subset group in which the CCE subset corresponding to the index value is located. Alternatively, the index value R1 corresponding to the CCE subset satisfies the following formula R1 ═ m^(L)/M^(L)+K_max. Wherein m is^(L)For the number of CCE subsets with aggregation level L in Y CCE sets, M^(L)For the number of CCE subsets with aggregation level L in Y CCE sets, K_maxThe value of K of the CCE subset with the largest aggregation level in the CCE subset group of the CCE subset corresponding to the index value is obtained, and K is the number-1 of the CCE subsets contained in the CCE subset group of the CCE subset corresponding to the index value. Or the index value R1 corresponding to the CCE subset satisfies the formula R1 ═ K_max. Wherein, K_maxThe value of K of the CCE subset with the largest aggregation level in the CCE subset group of the CCE subset corresponding to the index value is obtained, and K is the number-1 of the CCE subsets contained in the CCE subset group of the CCE subset corresponding to the index value. Or the index value R1 corresponding to the CCE subset satisfies the formula R1 ═ m^(L)/M^(L)+K(m^(L)) Or satisfy the formula R1 ═ K (m)^(L)). Wherein m is^(L)For the number of CCE subsets with aggregation level L in Y CCE sets, M^(L)The number of CCE subsets with aggregation level L in Y CCE sets is m^(L)Has an aggregation level of m with the number^(L)If there is an aggregation level where CCEs overlapping CCEs are largest in CCE subsets of (1), K (m)^(L)) For Y CCE sets numbered m^(L)There are overlapping CCE subset numbers of CCE in CCE subset of (c), otherwise, K (m)^(L)) Is 0.

In one possible implementation, when determining the N search spaces based on the maximum number of CCEs, the maximum number of control channels, and the index value corresponding to each CCE subset in the Y CCE sets, the network device or the terminal may determine the search spaces based on the first index value, the second index value, the Y CCE sets, the maximum number of CCEs, and the maximum number of control channels. For example, a search space in which the number of CCEs satisfies the maximum CCE number may be determined based on the maximum CCE number and a first index value corresponding to each CCE subset in the Y CCE collections, and then, a search space in which the number of CCE subsets satisfies the maximum control channel number may be determined in the search space in which the number of CCEs satisfies the maximum CCE number based on the maximum control channel number and a second index value corresponding to each CCE subset in the Y CCE collections, so as to obtain a search space satisfying the maximum CCE number and the maximum control channel number.

The first index value may be R1. The second index value R2 may satisfy the following formula R2 ═ m^(L)/M^(L)+K(m^(L)) Or R2 ═ K (m)^(L)) (ii) a Wherein m is^(L)For the number of CCE subsets with aggregation level L in Y CCE sets, M^(L)The number of CCE subsets with aggregation level L in Y CCE sets is m^(L)Is the maximum aggregation level, K (m)^(L)) For Y CCE sets numbered m^(L)There are overlapping CCE subset numbers of CCE in CCE subset of (c), otherwise, K (m)^(L)) Is 0. Wherein the first index value and the second index value are different index values.

In another possible implementation, the network device or the terminal may determine N search spaces based on the second index value, the Y CCE sets, the maximum number of CCEs, and the maximum number of candidate control channels, where the number of candidate control channels included in the N search spaces is less than or equal to the maximum number of candidate control channels, and the maximum number of candidate control channels is the maximum number of candidate control channels that the terminal can detect in each slot.

In yet another possible implementation, the network device or the terminal may determine N search spaces based on the Y CCE sets, the second index value, and the maximum number of candidate control channels, where the number of candidate control channels included in the N search spaces is less than or equal to the maximum number of candidate control channels, and the maximum number of candidate control channels is the maximum number of candidate control channels that the terminal can detect in each slot.

In yet another possible design, after determining the N search spaces, the network device may send downlink control information in the determined N search spaces, and send configuration information including the determined M control channel resource set information and the X aggregation level set information included in the M control channel resource sets through the downlink control information. And the terminal receives configuration information sent by the network equipment and determines Y Control Channel Element (CCE) sets corresponding to the X aggregation level sets according to the configuration information.

In another possible design, after the terminal determines the N search spaces, the candidate control channels may be detected in the determined N search spaces.

In a second aspect, the present application provides an apparatus for determining a search space, which is applied to a network device or a terminal, and includes a unit or means (means) for performing the steps performed by the network device or the terminal according to the first aspect.

In a third aspect, the present application provides an apparatus for determining a search space, which is applied to a network device or a terminal, and includes at least one processing unit and at least one storage unit, where the at least one storage unit is used to store programs and data, and the at least one processing unit is used to execute the method provided in the first aspect of the present application.

When the apparatus for determining the search space is applied to the network device, the apparatus may further include a sending unit, configured to send indication information, where the indication information is used to indicate the search space determined by the processing unit. When the apparatus for determining a search space is applied to a terminal, the apparatus may further include a receiving unit for detecting a candidate control channel within the search space determined by the processing unit.

Wherein the processing unit may be a controller/processor, the storage unit may be a memory, and the receiving unit/transmitting unit may be a transceiver. The means for determining a search space, as applied to a network device, for example, may comprise a controller or processor, and a transceiver. The controller/processor is sometimes referred to as a modem processor. The apparatus for determining a search space for a network device may also include a memory for storing program code and/or data for the network device. The apparatus for determining a search space for a network device may further include a communication unit supporting the network device to communicate with a network device of a core network, and the like. For example, the means for determining a search space for application to a terminal may include a transceiver, an application processor, a memory, and a modem processor.

In a fourth aspect, the present application provides an apparatus for determining a search space, which is applied to a network device or a terminal, and includes at least one processing element (or chip) for performing the method of the first aspect.

In a fifth aspect, the present application provides a program for determining a search space, which program, when executed by a processor, is operative to perform the method of the first aspect above.

A sixth aspect provides a program product, e.g. a computer readable storage medium, comprising the program of the fifth aspect.

It can be seen that, in the above aspects, the network device or the terminal determines, based on the CCE aggregation, that all CCEs are search spaces of a CCE aggregation subset in the aggregation level aggregation, and the number of all CCEs in the determined search space is less than or equal to the maximum number of CCEs that the terminal can detect in each time slot, so that the number of CCEs included in the search space meets the limitation of the maximum number of CCEs for channel estimation, and the search space can be dynamically updated in real time in a manner of configuring a parameter α in a semi-static manner, thereby meeting the requirement of channel estimation complexity; and makes full use of the maximum capability that the terminal can achieve as far as possible.

Drawings

Fig. 1 is a diagram of a communication system architecture for use with an embodiment of the present application;

fig. 2 is a schematic structural diagram of a network device according to an embodiment of the present application;

fig. 3 is a schematic structural diagram of a terminal according to an embodiment of the present application;

fig. 4 is a schematic distribution diagram of candidate control channels included in search spaces corresponding to different aggregation levels according to an embodiment of the present application;

fig. 5 is a schematic diagram of CCE sets corresponding to aggregation level sets according to an embodiment of the present disclosure;

FIG. 6 is a flowchart illustrating an implementation of determining a search space according to an embodiment of the present disclosure;

fig. 7 is an index diagram corresponding to CCE subsets according to an embodiment of the present disclosure;

FIG. 8 is a schematic diagram of a determined search space provided by an embodiment of the present application;

fig. 9 is another schematic diagram of an index corresponding to a CCE subset provided in an embodiment of the present application;

FIG. 10 is a schematic diagram of another determined search space provided by an embodiment of the present application;

fig. 11 is a schematic diagram of another index corresponding to a CCE subset provided in the embodiment of the present application;

FIG. 12 is a schematic diagram of another determined search space provided by an embodiment of the present application;

fig. 13 is a schematic diagram of another index corresponding to a CCE subset provided in the embodiment of the present application;

FIG. 14 is a schematic diagram of another determined search space provided by an embodiment of the present application;

FIG. 15 is a schematic diagram of another determined search space provided by an embodiment of the present application;

FIG. 16 is a schematic structural diagram of an apparatus for determining a search space according to an embodiment of the present application;

fig. 17 is a schematic structural diagram of another apparatus for determining a search space according to an embodiment of the present application.

Detailed Description

Hereinafter, the technical solutions in the embodiments of the present application will be described.

First, some terms in the present application are explained to facilitate understanding by those skilled in the art.

1) A terminal, also called a User Equipment (UE), a Mobile Station (MS), a Mobile Terminal (MT), etc., is a device that provides voice and/or data connectivity to a user and has a network access function, for example, a handheld device, a vehicle-mounted device, etc. with a wireless connection function. Currently, some examples of terminals are: a mobile phone (mobile phone), a tablet computer, a notebook computer, a palm top computer, a Mobile Internet Device (MID), a wearable device, a Virtual Reality (VR) device, an Augmented Reality (AR) device, a wireless terminal in industrial control (industrial control), a wireless terminal in self driving (self driving), a wireless terminal in remote surgery (remote medical supply), a wireless terminal in smart grid (smart grid), a wireless terminal in transportation safety (smart security), a wireless terminal in city (smart city), a wireless terminal in home (smart home), and the like.

2) The network device is a device in a wireless network, and may be, for example, a Radio Access Network (RAN) node that accesses a terminal to the wireless network, where the RAN node may also be referred to as a base station. Currently, some examples of RAN nodes are: a continuously evolved Node B (gnb), a Transmission Reception Point (TRP), an evolved Node B (eNB), a Radio Network Controller (RNC), a Node B (NB), a Base Station Controller (BSC), a Base Transceiver Station (BTS), a home base station (e.g., home evolved Node B, or home Node B, HNB), a Base Band Unit (BBU), or a wireless fidelity (Wifi) access point (access point, AP), etc. In one network configuration, a network device may include a Centralized Unit (CU) node, or a Distributed Unit (DU) node, or a RAN device including a CU node and a DU node.

3) The term "plurality" means two or more, and the other terms are similar. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.

4) "network" and "system" are often used interchangeably, but those skilled in the art will understand their meaning. "of", "related" and "corresponding" may sometimes be substituted for each other, and the intended meaning is consistent when the distinction is not emphasized.

In addition, it is to be understood that the terms first, second, etc. in the description of the present application are used for distinguishing between the descriptions and not necessarily for describing a sequential or chronological order.

In order to more clearly describe the technical solutions of the embodiments of the present application, the technical solutions of the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application. It should be noted that, in the case of no conflict, the technical solutions or features in the embodiments of the present application may be combined with each other.

Please refer to fig. 1, which is a schematic diagram of a communication system according to an embodiment of the present application. The communication system shown in fig. 1 may be a system applying various Radio Access Technologies (RATs), such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), or single carrier frequency division multiple access (SC-FDMA), among others. For example, the communication system may be a long term evolution system, a CDMA system, a Wideband Code Division Multiple Access (WCDMA) system, a global system for mobile communications (GSM) system, a Wireless Local Area Network (WLAN) system, a New Radio (NR) system, various evolution or convergence systems, and a system facing future communication technologies. The system architecture and the service scenario described in the embodiment of the present application are for more clearly illustrating the technical solution of the embodiment of the present application, and do not form a limitation on the technical solution provided in the embodiment of the present application, and as a person of ordinary skill in the art knows that along with the evolution of the network architecture and the appearance of a new service scenario, the technical solution provided in the embodiment of the present application is also applicable to similar technical problems.

For simplicity, one network device 102 (e.g., an access network device) is shown in fig. 1, as well as the communication of two terminals 101. In general, a wireless communication system may include any number of network devices and terminals. The communication system may further comprise one or more core network devices or devices for carrying virtualized network functions, etc. The network device 102 may provide services for the terminal 101 through one or more carriers. Network equipment and terminals are also referred to herein collectively as wireless devices.

The terminal 101 may support one or more wireless technologies for wireless communication, such as 5G, LTE, WCDMA, CDMA, time division-synchronous code division multiple access (TS-SCDMA), GSM, 802.11, etc., and may also support carrier aggregation technologies.

Multiple terminals may perform the same or different services. For example, mobile broadband service, enhanced mobile broadband (eMBB) service, terminal-set ultra-reliable and low-latency communication (URLLC) service, and so on.

Further, a schematic diagram of a possible structure of the network device 102 may be as shown in fig. 2. The network device 102 is capable of performing the methods provided by the embodiments of the present application. The network device 102 may include: a controller or processor 201 (the processor 201 is described below as an example), and a transceiver 202. Controller/processor 201 is also sometimes referred to as a modem processor (modem processor). Modem processor 201 may include a baseband processor (BBP) (not shown) that processes a digitized received signal to extract the information or data bits conveyed in the signal. As such, the BBP is typically implemented in one or more Digital Signal Processors (DSPs) within modem processor 201 or as a separate Integrated Circuit (IC) as needed or desired.

The transceiver 202 may be used to support both the transceiving of information between the network device 102 and the terminals, as well as the radio communication between the terminals. The processor 201 may also be used to perform various terminal communication functions with other network devices. In the uplink, uplink signals from the terminal are received via the antenna, demodulated by the transceiver 202, and further processed by the processor 201 to recover traffic data and/or signaling information sent by the terminal. On the downlink, traffic data and/or signaling messages are processed by the terminals and modulated by transceiver 202 to generate a downlink signal, which is transmitted via the antennas to the UEs. The network device 102 may also include a memory 203 that may be used to store program codes and/or data for the network device 102. The transceiver 202 may include separate receiver and transmitter circuits or may be the same circuit that performs the transceiving function. The network device 102 may further include a communication unit 204 for supporting the network device 102 to communicate with other network entities. For example, for supporting the network device 102 to communicate with a network device of a core network, etc.

Optionally, the network device may further include a bus. The transceiver 202, the memory 203, and the communication unit 204 may be connected to the processor 201 via a bus. For example, the bus may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus may include an address bus, a data bus, and a control bus, among others.

Fig. 3 is a schematic diagram of a possible structure of a terminal in the communication system. The terminal can execute the method provided by the embodiment of the application. The terminal may be either of the two terminals 101. The terminal includes a transceiver 301, an application processor (application processor)302, a memory 303, and a modem processor (modem processor) 304.

Transceiver 301 may condition (e.g., analog convert, filter, amplify, and upconvert, etc.) the output samples and generate an uplink signal, which is transmitted via an antenna to the base station as described in the above-described embodiments. On the downlink, an antenna receives a downlink signal transmitted by a network device. Transceiver 301 may condition (e.g., filter, amplify, downconvert, digitize, etc.) the received signal from the antenna and provide input samples.

Modem processor (modem processor)304, sometimes referred to as a controller or processor, may include a baseband processor (BBP) (not shown) that processes the digitized received signal to extract the information or data bits conveyed in the signal. The BBP is typically implemented in one or more numbers within modem processor 304 or as separate Integrated Circuits (ICs) as needed or desired.

In one design, modem processor 304 may include an encoder 3041, a modulator 3042, a decoder 3043, and a demodulator 3044. The encoder 3041 is configured to encode a signal to be transmitted. For example, the encoder 3041 can be used to receive traffic data and/or signaling messages to be sent on the uplink and process (e.g., format, encode, interleave, etc.) the traffic data and signaling messages. The modulator 3042 is configured to modulate an output signal of the encoder 3041. For example, the modulator may process symbol mapping and/or modulation, etc., of the encoder's output signals (data and/or signaling) and provide output samples. The demodulator 3044 is configured to perform demodulation processing on the input signal. For example, demodulator 3044 processes the input samples and provides symbol estimates. The decoder 3043 is configured to decode the demodulated input signal. For example, the decoder 3043 deinterleaves, decodes, or the like the demodulated input signal, and outputs a decoded signal (data and/or signaling). Encoder 3041, modulator 3042, demodulator 3044, and decoder 3043 may be implemented by a combined modem processor 304. These elements are processed according to the radio access technology employed by the radio access network.

Modem processor 304 receives digitized data, which may represent voice, data, or control information, from application processor 302 and processes the digitized data for transmission. The modem processor may support one or more of various wireless communication protocols of various communication systems, such as LTE, new air interface, Universal Mobile Telecommunications System (UMTS), High Speed Packet Access (HSPA), and so on. Optionally, one or more memories may also be included in modem processor 304.

Alternatively, the modem processor 304 and the application processor 302 may be integrated in a single processor chip.

The memory 303 is used to store program code (also sometimes referred to as programs, instructions, software, etc.) and/or data used to support communication for the terminals.

It should be noted that the memory 203 or the memory 303 may include one or more memory units, for example, a memory unit inside the processor 201 or the modem processor 304 or the application processor 302 for storing program codes, or an external memory unit independent from the processor 201 or the modem processor 304 or the application processor 302, or a component including a memory unit inside the processor 201 or the modem processor 304 or the application processor 302 and an external memory unit independent from the processor 201 or the modem processor 304 or the application processor 302.

Processor 201 and modem processor 301 may be the same type of processor or may be different types of processors. For example, the present invention may be implemented in a Central Processing Unit (CPU), a general purpose Processor, a Digital Signal Processor (DSP), an Application-specific integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a transistor logic device, a hardware component, other integrated circuits, or any combination thereof. The processor 201 and modem processor 301 may implement or execute the various illustrative logical blocks, modules, and circuits described in connection with the disclosure of the embodiments of the application. The processor may also be a combination of devices implementing computing functionality, including for example one or more microprocessor combinations, DSP and microprocessor combinations or system-on-a-chip (SOC) or the like.

Currently, a terminal needs to acquire Downlink Control Information (DCI) sent to the terminal by a network device to obtain uplink/downlink resource allocation information, hybrid automatic repeat request (HARQ) information, power control information, and the like, so as to receive or send communication data. In general, DCI is carried through a physical downlink control channel (pdcch) including one or more Control Channel Elements (CCEs). When acquiring the DCI, the terminal detects a downlink control channel in at least one time slot or subframe, receives signals of a plurality of candidate control channels (PDCCH candidates) on a Physical Downlink Control Channel (PDCCH), detects the plurality of candidate control channels according to the signals on the plurality of candidate control channels, demodulates and decodes the DCI carried on the plurality of candidate control channels, and finally acquires the DCI.

A Control Channel Element (CCE), which is a time-frequency resource that includes at least one candidate control channel and occupies a minimum number of resources in a frequency domain and a time domain, where the number of resources in the time domain is a number of consecutive symbols in the time domain; the number of resources in the frequency domain is the number of contiguous subcarriers in the frequency domain. The control channel element is also referred to as a control channel resource element, or as an enhanced control channel element (eCCE), or in 5G as a new radio control channel element (NR-CCE). The frequency domain resource units included in each control channel unit in the frequency domain may be mapped continuously or discretely in the frequency domain, and the mapping manner of the frequency domain resource units in the time domain is not limited.

In the embodiment of the present application, one candidate control channel is formed by L Control Channel Elements (CCEs), where L is referred to as an aggregation level of the candidate control channel. The numbers of L CCEs included in one candidate control channel are consecutive, wherein the starting CCE indicates a CCE with the smallest number (index) among the L CCEs. A set formed by a plurality of candidate control channels is also called a search space set, and meanwhile, the candidate control channels with the same number of control channel resource units included in the search space set can be grouped into one group, each group of candidate control channels forms a search space, and the number of the control channel resource units included in the candidate control channels in each group is defined as the aggregation level of the search space.

If the number of CCEs included in the candidate control channel is L, the aggregation level of the candidate control channel is called L, where L is an integer greater than or equal to 1, or a value of L belongs to a set {1, 2, 4, 8, 16} or {1, 2, 4, 8, 16, 32 }.

In this embodiment of the present application, the search space is a segment of logical resources defined according to CCEs, and is a set of control channels that need to be detected, and includes: the initial CCE number of the search space, the CCE number, and other parameters characterizing the search space are not limited in this application. It should be noted that each control channel corresponds to a search space. For the same control channel, the control channel resource cannot be larger than the search space, and the control channel resource described in this embodiment, that is, the candidate control channel set that the network device can configure for the terminal, is a segment of logic resource defined according to the CCE. It should be noted that each control channel corresponds to a candidate control channel set. For the same control channel, the candidate control channel resource cannot be larger than the search space, which may be understood as that the network device configurable set of candidate control channels is equal to the set of control channels that the terminal needs to detect, or that the network device configurable set of candidate control channels is a subset of the set of control channels that the terminal needs to detect.

The two adjacent candidate control channels may be represented as candidate control channels numbered m and numbered m +1 in the search space. Two PDCCH candidates numbered adjacently in a search space of aggregation level L, the difference in the number (index) of the starting CCE is equal to a fixed value L, i.e., equal to the size of the aggregation level. I.e. M^(L)The number of CCEs included in each candidate PDCCH is consecutive. Wherein, the search space of PDCCH with aggregation level {1, 2, 4, 8} comprises the number of candidate control channels {6, 6, 2, 2}, respectively. Fig. 4 is a schematic diagram illustrating a distribution of candidate control channels included in search spaces corresponding to different Aggregation Levels (AL), and it can be seen that the search spaces corresponding to each aggregation level are independent. The search space corresponding to AL8 includes two PDCCH candidates, and the search space corresponding to AL4 includesThe search space corresponding to the two PDCCH candidates, AL2, includes six PDCCH candidates, and the search space corresponding to AL1 includes six PDCCH candidates all being contiguous.

Currently, a terminal needs to determine a search space. In a possible implementation manner, the terminal obtains a control resource set (core set) configured by a higher layer signaling, and determines the number of CCEs included in the control resource set. In addition, the terminal determines the size of the aggregation level in the Search space set and the number of candidate control channels corresponding to the aggregation level according to Search space set (Search space set) configuration information included in the higher layer signaling, for example, aggregation level configuration information and configuration information of the number of candidate control channels corresponding to the aggregation level. Because the configuration information of the search space set acquired by the terminal includes the configuration information of the plurality of search space sets, the number of candidate control channels detected by the terminal is excessive, which exceeds the maximum capability of blind detection (blid decoding) for the control channels provided by the terminal, and further the terminal cannot detect the control information sent by the network device in time, and the delay of data reception is increased. Therefore, in the next generation communication system (for example: 5G or NR), the maximum number of candidate control channels is defined for the terminal, and a control channel parameter α is configured through high-layer signaling, where α has a value in a real number greater than or equal to 0 and less than or equal to 1. The terminal detects the candidate control channel in the predefined search space or the search space configured by the high-level signaling, and determines that the number is less than alpha.M^(L) _fullThe candidate control channel of (2) is used as the candidate control channel to be detected, and detection is performed. For example, the terminal may determine the CCE index of the candidate control channel m as follows according to the configuration information of the search space set:

wherein,for a subcarrier width u, a resource set p is controlled, and a time slot number n^u _s，fThe parameters of (1); for common search spacesFor a UE-specific search space, the parameters vary as slot number changes,Y_p,-1＝n_RNTI≠0，A₀＝39827，A₁＝39829，A₂39839, and D65537; l is the size of the aggregation level; n is_CIThe value of a carrier indication domain configured for a high-level signaling; m^(L) _p，s，maxFor a corresponding carrier n_CIAnd a control resource set p, searching the number of candidate control channels in the aggregation level L in the space set s,has a value range of [0, M^(L) _p，s，max-1). E.g. N_CCE，p16, L ═ 4, 2, 1, and the corresponding number of candidate control channels is M^(L) _p，s，maxIf n is {2, 5, 7}, then_CI＝0，The CCE indexes corresponding to the candidate control channels are as shown in fig. 5. In fig. 5, in the search space of aggregation level 4,the candidate control channel of (2) contains CCE indexes of { CCE4, CCE5, CCE6, CCE7 };the candidate control channel of (2) contains CCE indexes of { CCE12, CCE13, CCE14, CCE15 }. In the search space of the aggregation level 2,the candidate control channel of (2) contains CCE indexes of { CCE2, CCE3 };the candidate control channel of (2) contains CCE indexes of { CCE4, CCE5 };the candidate control channel of (2) contains CCE indexes of { CCE8, CCE9 };the candidate control channel of (2) contains CCE indexes of { CCE10, CCE11 };the candidate control channel of (2) contains CCE indexes of { CCE14, CCE15 }. In the search space of the aggregation level 1,the candidate control channel of (2) contains a CCE index of { CCE1 };the candidate control channel of (2) contains a CCE index of { CCE3 };the candidate control channel of (2) contains a CCE index of { CCE5 };the candidate control channel of (2) contains a CCE index of { CCE7 };the candidate control channel of (2) contains a CCE index of { CCE10 };the candidate control channel of (2) contains a CCE index of { CCE12 };contains a CCE index of { CCE14 }.

In fig. 5, the number of candidate control channels to be detected is 14, the number of non-overlapping CCEs is 15, a parameter α corresponding to an aggregation level is configured for a high-level signaling, and a value of the parameter α is limited to a set {0, 0.33, 0.66, 1 }. For aggregation level 1 configuration parameter α of 0.66, the detected candidate control channel numbers range from Wherein M is^(L) _p，s，maxIs equal to 7, andtherefore, the terminal detects only the first 4 candidate control channels in the search space of aggregation level 1.

The method for determining the search space can reduce the number of the terminal blind detection candidate control channels, but the value set of the parameter alpha is limited, and is configured by high-level signaling in a semi-static manner, the real-time change of the channel estimation complexity is not considered, the reduced blind detection number does not change along with the time slot difference, and the requirement of the channel estimation complexity cannot be met.

In view of this, an embodiment of the present application provides a method for determining a search space, in which a search space is determined based on a set of CCEs in an aggregation level set included in a set of control channel resources configured for a terminal and a maximum number of CCEs that the terminal can detect in each slot, all CCEs in the determined search space are subsets of the set of CCEs in the aggregation level set, and the number of all CCEs in the determined search space is less than or equal to the maximum number of CCEs that the terminal can detect in each slot. In the embodiment of the application, all CCEs are determined to be the search space of a CCE set subset in an aggregation level set based on a CCE set, and the number of all CCEs in the determined search space is less than or equal to the maximum number of CCEs which can be detected by a terminal in each time slot, so that the number of the CCEs in the search space meets the limitation of the maximum number of the CCEs for channel estimation, and the search space can be dynamically updated in real time in a manner of configuring a parameter alpha in a semi-static manner, and the requirement of channel estimation complexity is met; and makes full use of the maximum capability that the terminal can achieve as far as possible.

The method for determining a search space according to the embodiments of the present application is described below with reference to practical applications. For convenience of description, in this embodiment, it is assumed that the number of control channel resource sets configured for the terminal is M, the number of all aggregation level sets corresponding to the M control channel resource sets is X, and the total number of CCE sets corresponding to the X aggregation level sets is Y. Each aggregation level set in X aggregation level sets comprises one or more aggregation levels, the sum of the aggregation levels in the X aggregation level sets is Y, and each aggregation level in the Y aggregation levels corresponds to one of the Y CCE sets. Wherein X is an integer greater than or equal to 1, M is an integer greater than or equal to 1, and Y is an integer greater than or equal to 1.

Referring to fig. 6, fig. 6 is a flowchart illustrating an implementation of a method for determining a search space according to an embodiment of the present application, where the method includes:

s601: the network equipment determines Y control channel element CCE sets corresponding to the X aggregation level sets.

S602: the network device sends configuration information to the terminal, wherein the configuration information comprises the determined M control channel resource set information and X aggregation level set information in the M control channel resource sets.

In one possible implementation, the network device may determine N search spaces based on the determined Y CCE sets and the maximum number of CCEs that the terminal can detect in each slot, and transmit downlink control information in the determined N search spaces, where the configuration information is transmitted through the downlink control information.

S603: and the terminal receives configuration information sent by the network equipment and determines Y Control Channel Element (CCE) sets corresponding to the X aggregation level sets according to the configuration information.

S604: and the terminal determines N search spaces based on the determined Y CCE sets and the maximum number of CCEs which can be detected by the terminal in each time slot.

S605: and the terminal detects candidate control channels in the determined N search spaces.

In the following, an implementation process of determining N search spaces by a network device or a terminal will be described as an example.

In this embodiment, it is assumed that fig. 5 shows one aggregation level set of X aggregation level sets, and aggregation levels included in the aggregation level set shown in fig. 5 are aggregation level 1, aggregation level 2, and aggregation level 4, which are three aggregation levels in total. The aggregation level set shown in fig. 5 has 3 CCE sets, which are { CCE4, CCE5, CCE6, CCE7, CCE12, CCE13, CCE14, CCE15}, { CCE2, CCE3, CCE4, CCE5, CCE8, CCE9, CCE10, CCE11, CCE14, CCE15}, { CCE1, CCE3, CCE5, CCE7, CCE10, CCE12, and CCE14 }. The CCE set corresponding to aggregation level 1 is { CCE1, CCE3, CCE5, CCE7, CCE10, CCE12, and CCE14}, the CCE set corresponding to aggregation level 2 is { CCE2, CCE3, CCE4, CCE5, CCE8, CCE9, CCE10, CCE11, CCE14, and CCE15}, and the CCE set corresponding to aggregation level 4 is { CCE4, CCE5, CCE6, CCE7, CCE12, CCE13, CCE14, and CCE15 }. It is understood that, in the embodiment of the present application, the X aggregation level sets include aggregation levels whose total sum is Y, and each aggregation level in the Y aggregation levels corresponds to one of the Y CCE sets.

In this application, multiple aggregation level sets of the X aggregation level sets may include the same aggregation level, for example, a first aggregation level set includes aggregation level 1, aggregation level 2, and aggregation level 4; the second aggregation level set comprises an aggregation level 2 and an aggregation level 4; wherein the first aggregation level set and the second aggregation level set each comprise an aggregation level 2 and an aggregation level 4; in this case, the sum total of the aggregation levels included in the first aggregation level set and the second aggregation level set is 6; and the CCE set corresponding to one aggregation level in each aggregation level set is denoted as 1 CCE set, and the total CCE sets are 6 CCE sets.

S602: and determining N search spaces based on the determined Y CCE sets and the maximum number of CCEs which can be detected by the terminal in each time slot.

In the embodiment of the present application, it is assumed that the number of search spaces determined based on a CCE set and a maximum CCE number is N, where N is a positive integer less than or equal to Y. Each of the N search spaces corresponds to one of the N aggregation levels of the Y aggregation levels determined above. The search space corresponding to one of N aggregation levels includes that the aggregation level of each search space is the aggregation level of one of N aggregation levels in the Y aggregation levels corresponding to the search space. For example, if the number of search spaces determined based on the 3 CCE sets and the maximum number of CCEs shown in fig. 5 is 2, the 2 search spaces correspond to 2 aggregation levels out of 3 aggregation levels, i.e., aggregation level 1, aggregation level 2, and aggregation level 4, and one search space corresponds to 1 aggregation level. For example, the determined 2 search spaces may be an aggregation level 2 and an aggregation level 4, where the aggregation level of one search space corresponds to the aggregation level 2, and the aggregation level of the other search space corresponds to the aggregation level 4.

Or, each search space corresponds to one of N aggregation levels in the Y aggregation levels, and the CCE included in each search space corresponds to one CCE set in the Y CCE sets. For example, if the number of search spaces determined based on the 3 CCE sets and the maximum number of CCEs shown in fig. 5 is 2, the CCE sets corresponding to the 2 search spaces are 2 CCE sets of aggregation level 1, CCE sets of aggregation level 2, and CCE sets of aggregation level 4, and one search space corresponds to 1 CCE set. For example, the determined 2 search spaces may be a subset or a full set of aggregation level 2 CCE sets, and a subset or a full set of aggregation level 4 CCE sets, where the aggregation level of one search space corresponds to the subset or the full set of aggregation level 2 CCE sets, and the aggregation level of the other search space corresponds to the subset or the full set of aggregation level 4 CCE sets.

In this embodiment of the present application, all CCEs constituting the N search spaces are subsets of CCEs included in the Y CCE sets, and the number of all CCEs constituting the N search spaces is less than or equal to the maximum number of CCEs that can be detected by the terminal in each slot. For example, assuming that the maximum CCE number is 10, a search space determined based on the 3 CCE sets shown in fig. 5 and the maximum CCE number in the embodiment of the present application corresponds to aggregation level 4, then CCEs in the search space are subsets of CCE sets { CCE1, CCE2, CCE3, CCE4, CCE5, CCE6, CCE7, CCE8, CCE9, CCE10, CCE11, CCE12, CCE13, CCE14, and CCE15}, and the number of CCEs is 8, and is less than or equal to the maximum CCE number 10 that can be detected by the terminal in each slot.

Further, in this embodiment of the present application, all CCEs included in the determined Y CCE sets include overlapping CCEs and non-overlapping CCEs, where the overlapping CCEs belong to at least two CCE sets, and the non-overlapping CCEs belong to one CCE set. For example, also taking the CCE set corresponding to the aggregation level set shown in fig. 5 as an example, it can be seen that the CCE set corresponding to aggregation level 4 { CCE4, CCE5, CCE6, CCE7, CCE12, CCE13, CCE14, CCE15}, the CCE set corresponding to aggregation level 2 { CCE2, CCE3, CCE4, CCE5, CCE8, CCE9, CCE10, CCE11, CCE14, CCE15}, the CCE set corresponding to aggregation level 1 { CCE1, CCE3, CCE5, CCE7, CCE10, CCE12, CCE14} are three aggregation level sets, CCE1 belongs to a CCE set corresponding to aggregation level 1, CCE2 belongs to a CCE set corresponding to aggregation level 2, CCE6 belongs to a CCE set corresponding to aggregation level 4, CCE8 belongs to a CCE set corresponding to aggregation level 2, CCE9 belongs to a CCE set corresponding to aggregation level 2, CCE11 belongs to a CCE set corresponding to aggregation level 2, and CCE13 belongs to a CCE set corresponding to aggregation level 4, so CCE1, CCE2, CCE6, CCE8, CCE9, CCE11, and CCE13 are non-overlapping CCEs and CCEs belonging to one CCE set. Among the three aggregation level sets, CCE3 belongs to a CCE set corresponding to aggregation level 1 and a CCE set corresponding to aggregation level 2, CCE4 belongs to a CCE set corresponding to aggregation level 2 and a CCE set corresponding to aggregation level 4, CCE5 belongs to a CCE set corresponding to aggregation level 1, a CCE set corresponding to aggregation level 2 and a CCE set corresponding to aggregation level 4, CCE7 belongs to a CCE set corresponding to aggregation level 1 and a CCE set corresponding to aggregation level 4, CCE10 belongs to a CCE set corresponding to aggregation level 1 and a CCE set corresponding to aggregation level 2, CCE12 belongs to a CCE set corresponding to aggregation level 1 and a CCE set corresponding to aggregation level 4, CCE14 belongs to a CCE set corresponding to aggregation level 1, a CCE set corresponding to aggregation level 2 and a CCE set corresponding to aggregation level 4, and CCE15 belongs to a CCE set corresponding to aggregation level 2 and a CCE set corresponding to aggregation level 4, and CCE3, CCE4, CCE5, CCE7 and CCE 3683, CCE10, CCE12, CCE14 and CCE15 are overlapping CCEs and belong to CCEs in at least two CCE sets. It should be noted that the overlapping CCEs and the non-overlapping CCEs belong to the same control channel resource set; and the starting OFDM symbols of the same control resource set on the time domain are the same; otherwise, even if CCEs in the plurality of CCE sets have the same number, the CCEs are not counted as overlapping CCEs.

Furthermore, each CCE set in the Y CCE sets determined in the embodiment of the present application includes one or more CCE subsets, each CCE subset is formed by a corresponding aggregation level number of CCEs, and the corresponding aggregation level of each CCE subset is an aggregation level corresponding to the CCE set including the each CCE subset. For example, still taking the CCE sets corresponding to the aggregation level set shown in fig. 5 as an example, it can be seen that the CCE set { CCE4, CCE5, CCE6, CCE7, CCE12, CCE13, CCE14, CCE15} corresponding to the aggregation level 4 includes two CCE subsets, each CCE subset in the two CCE subsets is composed of 4 CCEs, and the aggregation level corresponding to the CCE set including two CCE subsets of { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15}, is 4, where { CCE4, CCE5, CCE7}, CCE 465, CCE14, CCE15, and { CCE6, CCE7}, and { CCE12, CCE13, CCE14, CCE15} corresponds to the aggregation level 4. The CCE aggregation level 2 corresponds to a CCE set { CCE2, CCE3, CCE4, CCE5, CCE8, CCE9, CCE10, CCE11, CCE14, and CCE15} including five CCE subsets, each CCE subset of the five CCE subsets being composed of 2 CCEs, and the aggregation level corresponding to a CCE aggregation level 2 of the five CCE subsets including { CCE2, CCE3}, { CCE4, CCE5}, { CCE8, CCE9}, { CCE10, CCE11}, { CCE14, CCE15}, and the CCE aggregation level corresponding to a CCE set including { CCE2, CCE3}, { CCE4, CCE5}, { CCE8, 9}, { 10, CCE11}, { 14, 15} are 2. The CCE aggregation set { CCE1, CCE3, CCE5, CCE7, CCE10, CCE12, and CCE14} corresponding to aggregation level 1 includes seven CCE subsets, each CCE subset of the seven CCE subsets being constituted by 1 CCE, and the aggregation levels corresponding to the CCE aggregation sets of the seven CCE subsets are 1, where each CCE subset is { CCE1}, { CCE3}, { CCE5}, { CCE7}, { CCE10}, { CCE12}, { CCE14}, and each CCE set of the seven CCE subsets is { CCE1}, { CCE3}, { CCE5}, { CCE7}, { CCE10}, { CCE12}, and { CCE14 }.

Further, through the above description of overlapping CCEs and CCE subsets, it can be seen that, for convenience of description in this embodiment, CCE subsets included in each of the Y CCE sets determined in this embodiment are CCE subsets including overlapping CCEs, or CCE subsets including no overlapping CCEs. For example, in the aggregation level set shown in fig. 5, CCE subsets { CCE3}, { CCE5}, { CCE7}, { CCE10}, { CCE12}, and { CCE14} in the CCE set corresponding to aggregation level 1 are first-class subsets, and CCE subset { 1} in the CCE set corresponding to aggregation level 1 is a second-class subset. CCE subsets { CCE2, CCE3}, { CCE4, CCE5}, { CCE10, CCE11}, { CCE14, CCE15} in the CCE set corresponding to aggregation level 2 are the first-class subset, and CCE subsets { CCE8, CCE9} in the CCE set corresponding to aggregation level 2 are the second-class subset. CCE subsets { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15} in the CCE set corresponding to aggregation level 4 are first-type subsets.

Specifically, in the embodiment of the present application, when determining the N search spaces based on the Y CCE sets and the maximum CCE number, the CCEs included in the N search spaces may be determined according to the first-class subset and/or the second-class subset and the maximum CCE number. For example, in the embodiment of the present application, the CCEs corresponding to the second-class subset in the Y CCE sets may be preferentially excluded until the number of the remaining CCEs included in the Y CCE sets is less than or equal to the maximum CCE number, and if the number of the remaining CCEs after the Y CCE sets include all the CCEs corresponding to the second-class subset in the CCEs are excluded is still greater than the maximum CCE number, the CCEs corresponding to the first-class subset may be excluded until the remaining CCEs are less than or equal to the maximum CCE number. Or, in this embodiment of the present application, the CCEs corresponding to the first-class subset in the Y CCE collections may also be preferentially selected as the CCEs included in the N search spaces, until the number of the selected CCEs satisfies the maximum CCE number, and if the number of the CCEs after all the CCEs corresponding to the first-class subset are selected is still smaller than the maximum CCE number, the CCEs corresponding to the CCE subset in the second-class subset may be selected until the number of the selected CCEs satisfies the maximum CCE number.

Wherein the number of up to selected CCEs satisfies the maximum number of CCEs, equivalently, the number of up to selected CCEs is equal to a first value, the first value is the maximum achievable number of CCEs, and the maximum achievable number of CCEs is less than or equal to the maximum number of CCEs.

For example, if the total number of CCEs selected is greater than the maximum CCE number when a CCE corresponding to any CCE subset among the remaining CCE subsets in the Y CCE sets is selected, the selected CCE number may be defined as the maximum achievable CCE number.

Optionally, in this embodiment of the application, when determining the N search spaces based on the Y CCE sets and the maximum CCE number, the CCEs included in the N search spaces may be determined according to the aggregation level and the maximum CCE number. For example: in the embodiment of the present application, CCEs corresponding to a CCE subset with a large aggregation level in the same aggregation level set of Y CCE sets may also be preferentially selected as CCEs included in N search spaces until the number of the selected CCEs satisfies the maximum CCE number.

Or, the Y CCE sets include a plurality of aggregation level sets, and then the CCEs included in the N search spaces are selected in sequence according to the order of the aggregation level sets. The sequence of the aggregation level sets can be the numbering sequence of the aggregation level sets or the sequence corresponding to the types of the aggregation level sets; for example, the CCEs corresponding to the CCE subset with the high aggregation level in the aggregation level set corresponding to the common search space in the aggregation level set are preferentially selected as the CCEs included in the N search spaces until the number of the selected CCEs satisfies the maximum CCE number; and if the number of the CCEs after all the aggregation level sets corresponding to the common search spaces are selected is still smaller than the maximum number of the CCEs, preferentially selecting the CCEs corresponding to the CCE subsets with high aggregation levels in the aggregation level set corresponding to the exclusive space of the terminal equipment as the CCEs included in the N search spaces until the number of the selected CCEs meets the maximum number of the CCEs.

In a possible implementation manner, in this embodiment of the present application, different priorities may be set for the first-class subset and the second-class subset, and according to the priorities of the first-class subset and the second-class subset and the maximum number of CCEs, the CCEs included in the N search spaces are determined. For example, in the above embodiment of preferentially excluding CCEs corresponding to the subset of the second class and then excluding CCEs corresponding to the subset of the first class, the exclusion priority of the subset of the second class may be set higher than the exclusion priority of the subset of the first class. In the above embodiment of preferentially selecting CCEs corresponding to the first-type subset and then selecting CCEs corresponding to the second-type subset, the selection priority of the first-type subset may be set to be higher than that of the second-type subset.

Further, in this embodiment of the application, when the CCEs included in the N search spaces are determined according to the priorities of the first-class subset and the second-class subset and the maximum number of CCEs, the CCEs included in the N search spaces may be further determined according to the aggregation level corresponding to the first-class subset or the second-class subset. In a possible implementation manner, in the implementation manner that the CCEs corresponding to the second-class subset are preferentially excluded before the CCEs corresponding to the first-class subset are excluded in the embodiment of the present application, the CCEs corresponding to the second-class subset with a low aggregation level in Y CCE sets may be preferentially excluded according to a descending order of the aggregation level of the second-class subset until the number of remaining CCEs included in the Y CCE sets is less than or equal to the maximum CCE number. If the number of the remaining CCEs after all the second-class subsets in the CCE sets are excluded is still larger than the maximum number of the CCEs, the CCEs corresponding to the subsets with high aggregation levels in the first-class subsets can be preferentially excluded according to the sequence from high aggregation levels to low aggregation levels of the first-class subsets until the remaining CCEs are smaller than or equal to the maximum number of the CCEs. For example, in the embodiment of the present application, the process of determining CCEs in a search space is still described with the aggregation level set shown in fig. 5 as an example. In fig. 5, the second-class subset includes the CCE subset { CCE8, CCE9} corresponding to aggregation level 2 and the CCE subset { CCE1} corresponding to aggregation level 1, so CCEs in the CCE subset { CCE1} corresponding to aggregation level 1 may be preferentially excluded, and then CCEs in the CCE subset { CCE8, CCE9} corresponding to aggregation level 2 may be excluded. If the number of the remaining CCEs is still greater than the maximum CCE number, the CCE subsets in the first-type subset may be excluded. In the process of excluding CCEs corresponding to CCE subsets of the first-class subset, CCEs corresponding to CCE subset { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15} of aggregation level 4 may be preferentially excluded, CCEs corresponding to CCE subset { CCE2, CCE3}, { CCE4, CCE5}, { CCE10, CCE11}, { CCE14, CCE15} of aggregation level 2 may be excluded, and CCEs corresponding to CCE subset { CCE3}, { CCE5}, { 7}, { CCE10}, { CCE12}, and { CCE14} of aggregation level 1 may be finally excluded.

The above embodiment corresponds to a case where Y CCE sets include one aggregation level set; if the Y CCE sets include a plurality of aggregation level sets, the above method may be applied to each of the plurality of aggregation level sets in turn; for example, the Y CCE sets include two aggregation level sets, denoted as a first aggregation level set and a second aggregation level set; selecting CCEs in the first aggregation level set in the above method in priority until the number of the selected CCEs meets the maximum number of the CCEs; if the number of CCEs after all the CCEs in the first aggregation level set are selected is still smaller than the maximum number of CCEs, the CCEs are selected in the second aggregation level set in the above method until the number of the selected CCEs meets the maximum number of CCEs.

In the embodiment of the present application, in the implementation where the CCE corresponding to the first-class subset is preferentially selected and then the CCE corresponding to the second-class subset is selected, according to the order from the highest aggregation level of the first-class subsets to the lowest aggregation level, the CCE corresponding to the first-class subset with the highest aggregation level in the Y CCE collections is preferentially selected as the CCE included in the N search spaces until the number of the selected CCEs satisfies the maximum CCE number. Wherein, the number of CCEs satisfying the maximum CCE number may be understood as the number of CCEs being less than or equal to the maximum CCE number. In the embodiment of the present application, if the number of CCEs satisfies the maximum CCE number, it may also be understood that, when a CCE is selected this time, the number of the selected CCEs is less than or equal to the maximum CCE number, and when a CCE continues to be selected next time, the number of the CCEs satisfying the maximum CCE number is greater than the maximum CCE number, and then the number of the CCEs satisfying the maximum CCE number is the number of the CCE selected this time. If the number of CCEs after all the first-class subsets are selected is still smaller than the maximum number of CCEs, the subsets with high aggregation levels in the second-class subsets can be preferentially selected according to the order of the aggregation levels of the second-class subsets from high to low until the selected number of CCEs meets the maximum number of CCEs. For example, in the embodiment of the present application, the process of determining CCEs in a search space is still described with the aggregation level set shown in fig. 5 as an example. In fig. 5, the first-class subset includes CCE subsets { CCE4, CCE5, CCE6, CCE7} and { CCE12, CCE13, CCE14, CCE15}, CCE subsets { CCE2, CCE3} corresponding to aggregation level 2, { CCE4, CCE5}, { CCE5, CCE5} corresponding to aggregation level 1, { 5}, { CCE5} and { CCE5} corresponding to aggregation level 4, CCE subsets { 5, CCE5} corresponding to aggregation level 4, CCE5} CCE subsets of { CCE5} and { 5} corresponding to aggregation level 5, and { 5} CCE subsets of { 5} CCE5} are selected. If the number of CCEs after all the first-class subsets are selected is still less than the maximum number of CCEs, the CCEs corresponding to the CCE subset { CCE8, CCE9} corresponding to aggregation level 2 in the second-class subset can be preferentially selected, and then the CCEs corresponding to the CCE subset { CCE1} corresponding to aggregation level 1 are selected.

The above embodiment corresponds to a case where Y CCE sets include one aggregation level set; if the Y CCE sets include a plurality of aggregation level sets, the above method may be applied to each of the plurality of aggregation level sets in turn. In the case that the Y CCE sets include a plurality of aggregation level sets, the method is as described above, and is not described here again.

In the embodiment of the present application, in the implementation where the CCE corresponding to the first-class subset is preferentially selected and then the CCE corresponding to the second-class subset is selected, the CCEs corresponding to the CCE subset with a high aggregation level in the same aggregation level set of Y CCE sets may be preferentially selected as the CCEs included in the N search spaces in an order from high aggregation level to low aggregation level until the number of the selected CCEs satisfies the maximum CCE number. Wherein, the number of CCEs satisfying the maximum CCE number may be understood as the number of CCEs being less than or equal to the maximum CCE number. In the embodiment of the present application, if the number of CCEs satisfies the maximum CCE number, it may also be understood that, when a CCE is selected this time, the number of the selected CCEs is less than or equal to the maximum CCE number, and when a CCE continues to be selected next time, the number of the CCEs satisfying the maximum CCE number is greater than the maximum CCE number, and then the number of the CCEs satisfying the maximum CCE number is the number of the CCE selected this time. For example, in the embodiment of the present application, the process of determining CCEs in a search space is still described with the aggregation level set shown in fig. 5 as an example. In fig. 5, aggregation level 1, aggregation level 2, and aggregation level 4 constitute one aggregation level set, with aggregation level 4 having the largest aggregation level and aggregation level 1 having the smallest aggregation level; when selecting CCEs in the aggregation level, CCEs corresponding to CCE subsets { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15} corresponding to aggregation level 4 may be preferentially selected, CCEs corresponding to CCE subset { CCE2, CCE3}, { CCE4, CCE5}, { CCE8, CCE9}, { CCE10, CCE11}, { CCE14, CCE15} corresponding to aggregation level 2 may be selected, and CCEs corresponding to CCE subsets { CCE1}, { CCE3}, { CCE5}, { CCE7}, { CCE10}, { 12}, and { CCE14} corresponding to aggregation level 1 may be selected.

Further, through the above description of overlapping CCEs and CCE subsets, it can be seen that each CCE set in the Y CCE sets determined in the embodiment of the present application includes CCE subsets including non-overlapping CCEs, or CCE subsets including no non-overlapping CCEs. For convenience of description in the embodiments of the present application, CCE subsets including non-overlapping CCEs are referred to as third-class subsets, and CCE subsets including no non-overlapping CCEs are referred to as fourth-class subsets. In other words, each CCE set in the Y CCE sets determined in the embodiment of the present application includes a CCE subset of the third class subset or the fourth class subset. For example, in the aggregation level set shown in fig. 5, the third class subset includes CCE subsets { CCE1} in a CCE set corresponding to aggregation level 1, CCE subsets { CCE2, CCE3}, { CCE8, CCE9}, { CCE10, CCE11} in a CCE set corresponding to aggregation level 2, and CCE subsets { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15} in a CCE set corresponding to aggregation level 4. The fourth class subset includes CCE subsets { CCE3}, { CCE5}, { CCE7}, { CCE10}, { CCE12}, { CCE14} corresponding to aggregation level 1, and CCE subsets { CCE4, CCE5}, { CCE14, CCE15} corresponding to aggregation level 2.

Specifically, in the embodiment of the present application, when determining N search spaces based on Y CCE sets and the maximum number of CCEs, the CCEs included in the N search spaces may be determined based on the third-class subset and/or the fourth-class subset, the maximum number of CCEs, and the maximum number of candidate control channels. The maximum number of candidate control channels is the maximum number of candidate control channels that the terminal can detect in each time slot. For example, in the embodiment of the present application, the subsets of the fourth class may be preferentially excluded until the number of the remaining CCE subsets is less than or equal to the maximum number of candidate control channels, and if the number of the remaining CCE subsets after all the subsets of the Y CCE sets of the fourth class are excluded is still greater than the maximum number of candidate control channels, the CCE subsets of the third class may be preferentially excluded until the number of the remaining CCE subsets is less than or equal to the maximum number of candidate control channels.

Or, preferably selecting the CCE subsets in the third-class subsets of the Y CCE sets until the number of the selected CCE subsets meets the maximum number of the candidate control channels. Wherein, the CCE subset number satisfying the maximum candidate control channel number may be understood as the CCE subset number being less than or equal to the maximum candidate control channel number. In this embodiment of the present application, if the number of CCE subsets satisfies the maximum number of candidate control channels, it may also be understood that, when a CCE subset is selected this time, the number of the selected CCE subsets is less than or equal to the maximum number of the candidate control channels, and when a CCE subset is continuously selected next time, the number of the CCE subsets satisfying the maximum number of the candidate control channels is greater than the maximum number of the candidate control channels, and then the number of the CCE subsets satisfying the maximum number of the candidate control channels is the number of the CCE subsets selected this time. If the number of the selected CCE subsets is still less than the maximum number of the candidate control channels after all the third-class subsets in the Y CCE sets are selected, the CCE subsets in the fourth-class subsets are preferentially selected until the number of the selected CCE subsets meets the maximum number of the candidate control channels.

Wherein the up-to-selected number of CCE subsets satisfies the maximum number of candidate control channels, equivalently, the up-to-selected number of CCE subsets is equal to a second value, the second value is the maximum achievable number of CCE subsets, and the maximum achievable number of CCE subsets is less than or equal to the maximum number of candidate control channels.

For example, if any of the remaining CCE subsets of the Y CCE sets is selected such that the total number of CCE subsets selected is such that the terminal detects the control information more times than the maximum number of times that the terminal can detect the control information, the number of CCE subsets selected may be defined as the maximum achievable number of CCE subsets. And the maximum times that the terminal can detect the control information is more than or equal to the maximum candidate control channel number.

In a possible implementation manner, in this embodiment of the present application, different priorities may be set for the third-class subset and the fourth-class subset, and according to the priorities of the third-class subset and the fourth-class subset, the maximum number of CCEs, and the maximum number of candidate control channels, the CCEs included in the N search spaces are determined. For example, in the above embodiment of preferentially excluding the fourth-class subset and then excluding the third-class subset, the exclusion priority of the fourth-class subset may be set higher than the exclusion priority of the third-class subset. In the above embodiment of preferentially selecting the third-class subset and then selecting the fourth-class subset, the selection priority of the third-class subset may be set to be higher than that of the fourth-class subset.

Further, in this embodiment of the application, when determining the CCEs included in the N search spaces according to the priorities of the third-class subset and the fourth-class subset, the maximum number of CCEs, and the maximum number of candidate control channels, the CCEs included in the N search spaces may be further determined according to the aggregation levels corresponding to the third-class subset or the fourth-class subset.

In a possible implementation manner, in the implementation manner of preferentially excluding the fourth-class subset and then excluding the third-class subset in this embodiment of the application, the fourth-class subset with a low aggregation level in the Y CCE collections may be preferentially excluded in an order from a low aggregation level to a high aggregation level of the fourth-class subset until the number of remaining CCE subsets is less than or equal to the maximum number of candidate control channels. If the number of the remaining CCE subsets after excluding all the fourth-class subsets of the Y CCE sets is still greater than the maximum number of candidate control channels, the CCE subsets having a low aggregation level in the third-class subsets may be preferentially excluded in order from a low aggregation level to a high aggregation level of the third-class subsets until the number of the remaining CCE subsets is less than or equal to the maximum number of candidate control channels. For example, in the embodiment of the present application, the process of determining CCEs in a search space is still described with the aggregation level set shown in fig. 5 as an example. In fig. 5, CCE subsets { CCE3}, { CCE5}, { CCE7}, { CCE10}, { CCE12}, and { CCE14} corresponding to aggregation level 1 in the fourth-class subset may be preferentially excluded, and CCE subsets { CCE4, CCE5}, { CCE14, CCE15} corresponding to aggregation level 2 in the fourth-class subset may be excluded. If the number of the remaining CCE subsets is still greater than the maximum number of candidate control channels after all the fourth-class subsets in the Y CCE sets are excluded, the CCE subset { CCE1} in the CCE set corresponding to aggregation level 1 in the third-class subset can be preferentially excluded, then the CCE subset { CCE2, CCE3}, { CCE8, CCE9}, { CCE10, CCE11} in the CCE set corresponding to aggregation level 2 is excluded, and finally the CCE subset { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15} in the CCE set corresponding to aggregation level 4 is excluded until the number of the remaining CCE subsets is less than or equal to the maximum number of candidate control channels.

In another possible implementation manner, in the implementation manner of preferentially selecting the third-class subset and then selecting the fourth-class subset in this embodiment of the application, the third-class subset with the higher aggregation level in the Y CCE sets may be preferentially selected according to the order from the highest aggregation level to the lowest aggregation level of the third-class subset until the number of the selected CCE subsets satisfies the maximum number of candidate control channels. If the number of the selected CCE subsets is still smaller than the maximum number of the candidate control channels after all the third-class subsets of the Y CCE sets are selected, the fourth-class subsets having a higher aggregation level may be preferentially selected in the order from the highest aggregation level to the lowest aggregation level of the fourth-class subsets until the number of the selected CCE subsets satisfies the maximum number of the candidate control channels. For example, in the embodiment of the present application, the process of determining CCEs in a search space is still described with the aggregation level set shown in fig. 5 as an example. In fig. 5, CCE subsets { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15} in a CCE set corresponding to aggregation level 4 in a third-class subset may be preferentially selected, CCE subsets { CCE2, CCE3}, { CCE8, CCE9}, { CCE10, CCE11} in a CCE set corresponding to aggregation level 2 may be selected, and CCE subsets { CCE1} in a CCE set corresponding to aggregation level 1 may be selected. If the number of CCE subsets selected after all the third-class subsets of the Y CCE sets are selected is still smaller than the maximum number of candidate control channels, the CCE subsets { CCE4, CCE5}, { CCE14, CCE15} corresponding to aggregation level 2 in the fourth-class subset can be preferentially selected, and then the CCE subsets { CCE3}, { CCE5}, { CCE7}, { CCE10}, { CCE12}, and { CCE14} corresponding to aggregation level 1 in the fourth-class subset are selected until the number of the selected CCE subsets meets the maximum number of candidate control channels.

In one possible example of the present application, when determining N search spaces based on Y CCE sets and the maximum number of CCEs, the CCEs included in the N search spaces may be determined based on the first-class subset and/or the second-class subset, the third-class subset and/or the fourth-class subset, the maximum number of CCEs, and the maximum number of candidate control channels. For example, in the embodiment of the present application, the CCEs of the search space satisfying the maximum CCE number may be determined based on the first-class subset and/or the second-class subset and the maximum CCE number, and then the CCE subset satisfying the maximum candidate control channel number may be determined among the CCEs of the search space satisfying the maximum CCE number.

Optionally, in this embodiment of the present application, the number of CCEs of the search space equal to the first size, which is an integer that is reachable and smaller than the maximum number of CCEs, may be determined based on the first-class subset and/or the second-class subset and the maximum number of CCEs.

In this embodiment of the application, the CCE in the search space satisfying the maximum number of CCEs is determined based on the first-class subset and/or the second-class subset and the maximum number of CCEs, reference may be made to the relevant description in the above embodiment, an implementation manner of preferentially excluding the CCE corresponding to the second-class subset and then excluding the CCE corresponding to the first-class subset may be adopted, an implementation manner of preferentially selecting the CCE corresponding to the first-class subset and then selecting the CCE corresponding to the second-class subset may also be adopted, and a specific implementation process is not described in detail herein.

In the embodiment of the present application, it may be assumed that, based on the first-class subset and/or the second-class subset and the maximum CCE number, CCE subsets included in CCEs of a search space that satisfies the maximum CCE number are determined as W CCE subsets. Here, the W CCE subsets may be defined as CCE subsets of CCEs remaining in Y CCE sets after CCE determination is performed in a search space satisfying the maximum CCE number. Wherein the W CCE subsets comprise subsets of a third class and/or subsets of a fourth class.

In the embodiment of the present application, the CCE subsets satisfying the largest number of candidate control channels may be determined based on the third-class subset and/or the fourth-class subset included in the W CCE subsets. The embodiment of determining CCE subsets satisfying the maximum number of candidate control channels based on the third-class subset and/or the fourth-class subset included in the W CCE subsets and the maximum number of control channels is similar to the embodiment of determining CCEs included in the N search spaces based on the third-class subset and/or the fourth-class subset, the maximum number of CCEs, and the maximum number of candidate control channels described in the above embodiment. For example, a subset of the fourth category with a low aggregation level from among the W CCE subsets may be preferentially excluded until the number of remaining CCE subsets is less than or equal to the maximum number of candidate control channels, a subset of CCEs with a low aggregation level from among the subsets of the third category may be preferentially excluded until the number of remaining CCE subsets is less than or equal to the maximum number of candidate control channels if the number of CCE subsets remaining after all the subsets of the fourth category from among the W CCE subsets are excluded is still greater than the maximum number of candidate control channels, or a subset of the third category from among the Y CCE sets with a high aggregation level may be preferentially selected until the number of selected CCE subsets satisfies the maximum number of candidate control channels, and a subset of the fourth category with a high aggregation level may be preferentially selected if all the subsets of the third category from among the Y CCE sets are selected, until the selected number of CCE subsets meets the maximum number of candidate control channels. In this embodiment, a specific implementation process for determining the CCE subset satisfying the maximum number of candidate control channels based on the third-class subset and/or the fourth-class subset included in the W CCE subsets and the maximum number of control channels is not described in detail herein.

In the embodiment of the present application, based on the aggregation level and the maximum number of CCEs, determining the CCE satisfying the search space of the maximum number of CCEs may refer to the related description in the above embodiment, and an implementation manner of preferentially selecting a CCE corresponding to a CCE subset with a high aggregation level and then selecting a CCE corresponding to a CCE subset with a low aggregation level may be adopted, and a specific implementation process is not described in detail herein.

In the embodiment of the present application, it may be assumed that, based on the aggregation level and the maximum CCE number, CCE subsets included in CCEs of the search space satisfying the CCE number of the search space of the maximum CCE number are determined to be W CCE subsets. Here, the W CCE subsets may be defined as CCE subsets of CCEs remaining in Y CCE sets after CCE determination is performed in a search space satisfying the maximum CCE number. Wherein the W CCE subsets comprise subsets of a third class and/or subsets of a fourth class.

Optionally, in this embodiment of the present application, the CCE subset that satisfies the maximum number of candidate control channels may be determined based on the aggregation level of CCE subsets included in the W CCE subsets. In the embodiment of determining the CCE subsets satisfying the maximum candidate number of control channels based on the aggregation levels included in the W CCE subsets and the maximum number of control channels, the CCE subsets having a larger aggregation level in the W CCE subsets may be preferentially selected until the number satisfying the remaining CCE subsets is less than or equal to the maximum candidate number of control channels.

In an implementation of specifically implementing the determination of the search space according to the foregoing embodiment of the present application, an index value may be determined for each CCE subset included in Y CCE collections corresponding to X aggregation level collections, and then N search spaces may be determined based on the index value corresponding to each CCE subset in the Y CCE collections and the maximum CCE number. In this embodiment of the present application, it is assumed that Y CCE sets corresponding to X aggregation level sets include Q CCE subsets, where Q is an integer greater than or equal to 0, and each CCE subset corresponds to one index value. It is further assumed in the embodiment of the present application that the Q CCE subsets include P CCE subset groups, where P is an integer greater than or equal to 0, each CCE subset group of the P CCE subset groups includes one or more CCE subsets, and one CCE subset included in the CCE subset group is a CCE subset that does not include overlapping CCEs. Any one of the plurality of CCE subsets comprises at least one overlapping CCE. For example, the CCE subset groups included in the aggregation level set shown in fig. 5 may be: { CCE1 }; { { CCE2, CCE3}, { CCE3} }; { { CCE4, CCE5, CCE6, CCE7}, { CCE4, CCE5}, { CCE3}, { CCE5} }; { CCE8, CCE9 }; { { CCE10, CCE11}, { CCE10} }; { { CCE12, CCE13, CCE14, CCE15}, { CCE14, CCE15}, { CCE12}, and { CCE14} }.

In one possible implementation, the index value corresponding to the CCE subset may be determined according to the number of CCE subsets included in the CCE subset group in which the CCE subset corresponding to the index value is located.

In one possible example, the index value corresponding to the CCE subset in the embodiment of the present application is represented by R1, where R1 satisfies the following formula:

R1＝m^(L)/M^(L)+K；

wherein m is^(L)For the number of CCE subsets with aggregation level L in the Y CCE sets, M^(L)And K is the number-1 of CCE subsets with aggregation level L in the Y CCE sets, where the CCE subset group in which the CCE subset corresponding to the index value is located includes CCE subset groups.

In this embodiment of the present application, a formula may be respectively adopted for each CCE subset of the Q CCE subsets: r1 ═ m^(L)/M^(L)+ K, determining the index value corresponding to the CCE subset. The determination process of the index values of CCE subsets is described, for example, with CCE subsets included in the aggregation level set shown in fig. 5 as an example. In fig. 5, the index values of CCE subsets { CCE4, CCE5, CCE6, CCE7} are determined as follows: determining the number of CCE subset { CCE4, CCE5, CCE6, CCE7} in aggregation level 4 as m^(L)0 and determining the number of CCE subsets M in aggregation level 4^(L)2. CCE subset groups where CCE subsets { CCE4, CCE5, CCE6 and CCE7} are { { CCE4, CCE5, CCE6, CCE7}, { CCE4, CCE5}, { CCE3}, and { CCE5} }, where the number of CCE subsets included in the CCE subset group is 4, and then K-4-1-3 may be determined. M is to be^(L)＝0，M^(L)Substituting 2, K, 4 into formula R1, m^(L)/M^(L)+ K may be R1 ═ 0/2+3 ═ 3. In a similar manner, the index values of the CCE subsets shown in fig. 5 may be determined, and the specific determined index value size and K value may be as shown in fig. 7.

In one possible example, in the embodiment of the present application, the search space may be determined according to the size of the index value of the CCE subset. One possible example may be to determine the search space based on the maximum number of CCEs and/or the maximum number of control channels, and the size of the index value for the CCE subset. For example, in the embodiment of the present application, assuming that the maximum number of CCEs is 10 and the maximum number of control channels is 10, 10 CCE subsets may be selected from the Q CCE subsets in an order from a large index value to a small index value of the CCE subsets, and the number of CCEs included in the selected 10 CCE subsets is 10. Or, the CCE subsets may be excluded from the Q CCE subsets in the order of the index values of the CCE subsets from small to large, so that the finally reserved CCE subsets include 10 CCE subsets, and the number of CCEs included in the 10 CCE subsets is 10. For example, the index values of the CCE subsets shown in fig. 7 are {0, 2/5, 1, 1/7+1, 1+3/7, 1+4/7, 1+5/7, 1+3/5, 2+1/5, 2+2/7, 2+4/5, 2+6/7, 3, 1/2+3} respectively, and the index values of the CCE subsets included in the search space may be determined to be {1+3/7, 1+4/7, 1+5/7, 1+3/5, 2+1/5, 2+2/7, 2+4/5, 2+6/7, 3, 1/2+3} in the order of the index values of the CCE subsets, and the corresponding CCE subsets are { 7}, { 10}, { CCE12}, { CCE10, CCE11}, { CCE4, CCE5}, { CCE5}, and { CCE5}, respectively, and { CCE4, CCE5}, and { CCE # are included in the search space. { CCE14, CCE15}, { CCE14}, { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15}, in particular, see fig. 8.

In the embodiment of the application, the number of the CCEs in the search space can be the maximum number of the CCEs by determining the N search spaces according to the index value of each CCE subset in the Q CCE subsets, and the number of the CCE subsets is the maximum number of the control channels, so that the maximum capacity limit (the maximum number of the CCEs for channel estimation and the maximum number of the control channels for blind detection) of the terminal can be met by the method provided by the embodiment of the application, and the maximum capacity of the terminal is fully utilized.

In another possible example, the index value corresponding to the CCE subset in the embodiment of the present application is represented by R1, where R1 satisfies the following formula:

R1＝m^(L)/M^(L)+K_max；

wherein m is^(L)For the number of CCE subsets with aggregation level L in the Y CCE sets, M^(L)For the number of CCE subsets with aggregation level L in the Y CCE sets, K_maxThe CCE subset group corresponding to the index value has the highest aggregation levelAnd K is the number-1 of CCE subsets contained in the CCE subset group where the CCE subset corresponding to the index value is located.

In this embodiment of the present application, a formula may be respectively adopted for each CCE subset of the Q CCE subsets: r1 ═ m^(L)/M^(L)+K_maxAnd determining the index value corresponding to the CCE subset. The determination process of the index values of CCE subsets is described, for example, with CCE subsets included in the aggregation level set shown in fig. 5 as an example. In fig. 5, the number of CCE subset { CCE4, CCE5, CCE6, CCE7} is determined to be m in aggregation level 4^(L)0 and determining the number of CCE subsets M in aggregation level 4^(L)2. CCE subsets { CCE4, CCE5, CCE6 and CCE7} are located in CCE subset groups of { { CCE4, CCE5, CCE6, CCE7}, { CCE4, CCE5}, { CCE5}, and { CCE7} }, and the CCE subset with the largest aggregation level in the CCE subsets is { CCE4, CCE5, CCE6 and CCE7}, so K is the carrier of the CCE subset group of the largest aggregation level in the CCE subsets of the { CC_maxK values for CCE subset { CCE4, CCE5, CCE6, CCE7 }. K_maxThe K value for CCE subset { CCE4, CCE5, CCE6, CCE7} is the CCE subset number included in CCE subset set { CCE4, CCE5, CCE6, CCE7} and the CCE subset number included in this CCE subset set is 4, so it is determined that the K value for CCE subset { CCE4, CCE5, CCE6, CCE7} is K-4-1-3. M is to be^(L)＝0，M^(L)＝2，K_maxSubstituting 4 into formula R1 ═ m^(L)/M^(L)+K_maxR1 ═ 0/2+3 ═ 3 can be obtained. The process of determining the index values of CCE subsets { CCE4 and CCE5} will be described as an example. The number of CCE subset { CCE4, CCE5} in aggregation level 2 is m^(L)The number of CCE subsets included in aggregation level 2 is M ═ 1^(L)5. The CCE subset group in which the CCE subsets { CCE4 and CCE5} are located is { { CCE4, CCE5, CCE6, CCE7}, { CCE4, CCE5}, { CCE5}, and { CCE7} }, and the CCE subset with the highest aggregation level in the CCE subset group is { CCE4, CCE5, CCE6 and CCE7}, then K is selected from the CCE subset group_maxThe K value of CCE subset { CCE4, CCE5, CCE6, CCE7}, the K value of CCE subset { CCE4, CCE5, CCE6, CCE7} is 3, so K is the same as K_maxThen m is equal to 3^(L)＝1，M^(L)＝5，K_maxSubstituting formula R1 ═ m into 3^(L)/M^(L)+K_maxR1 may be obtained as 1/5+ 3. In a similar manner, the numbers in FIG. 5 can be determined separatelyThe index values of the CCE subsets, specifically, the determined sizes of the index values and the K values may be as shown in fig. 9.

For example, in the embodiment of the present application, assuming that the maximum number of CCEs is 10, and the maximum number of control channels is 10, similarly, 10 CCE subsets may be selected from the Q CCE subsets in an order from large to small of the index values of the CCE subsets, and the number of CCEs included in the selected 10 CCE subsets is 10. Or, the CCE subsets may be excluded from the Q CCE subsets in the order of the index values of the CCE subsets from small to large, so that the finally reserved CCE subsets include 10 CCE subsets, and the number of CCEs included in the 10 CCE subsets is 10. For example, the index values of the CCE subsets shown in fig. 9 are {0, 2/5, 1, 1/7+1, 1+4/7, 1+5/7, 1+3/5, 3, 1/5+3, 2/7+3, 3/7+3, 1/2+3, 4/7+3, 5/7+3, 4/5+3, 6/7+3}, respectively, the index values of the CCE subsets included in the search space may be determined to be {1+3/5, 3, 1/5+3, 2/7+3, 3/7+3, 1/2+3, 4/7+3, 5/7+3, 4/5+3, 6/7+3} in the order of the index values of the CCE subsets, and the corresponding CCE subsets are { 10, 11}, { CCE4, CCE5, CCE6, CCE7}, { CCE4, CCE5}, { CCE5}, { CCE7}, { CCE12, CCE13, CCE14, CCE15}, { CCE10}, { CCE12}, { CCE14, CCE15}, and { CCE14}, which are specifically shown in fig. 10.

R1＝K_max；

wherein, K_maxAnd the value K of the CCE subset with the largest aggregation level in the CCE subset group of the CCE subset corresponding to the index value is obtained, wherein the K is the number-1 of the CCE subsets contained in the CCE subset group of the CCE subset corresponding to the index value.

In this embodiment of the present application, a formula may be respectively adopted for each CCE subset of the Q CCE subsets: r1 ═ K_maxAnd determining the index value corresponding to the CCE subset. The determination process of the index values of CCE subsets is described, for example, with CCE subsets included in the aggregation level set shown in fig. 5 as an example. In FIG. 5, CCE subsets { CCE4, CCE5, CCE6, CCE7} are determined as { { CCE4, CCE5, CCE6, CCE7}, and a great mouthCCE4, CCE5}, { CCE5}, and { CCE7} }, where CCE subset groups of { { CCE4, CCE5, CCE6, CCE7}, { CCE4, CCE5}, { CCE5}, and { CCE7} } have the largest aggregation level CCE subset among { CCE4, CCE5, CCE6, and CCE7}, and therefore K is K_maxK values for CCE subset { CCE4, CCE5, CCE6, CCE7 }. The K value of CCE subset { CCE4, CCE5, CCE6, CCE7} is the CCE subset number included in CCE subset { CCE4, CCE5, CCE6, CCE7}, and the CCE subset number included in the CCE subset group is 4, so that the K value of CCE subset { CCE4, CCE5, CCE6, CCE7} can be determined to be K-4-1-3, and further K value can be determined to be K7 }_max3, the index value R1 of the CCE subset { CCE4, CCE5, CCE6, CCE7} is 3. Similarly, the index values of the CCE subsets in fig. 5 may be determined, and the specific determined index value size and K value may be as shown in fig. 11.

In the embodiment of the application, R1 ═ K is adopted_maxThe manner of determining the index values of the CCE subsets may be such that the index values corresponding to the CCE subsets in one CCE subset group are the same, that is, each CCE subset group corresponds to one index value. For example, in fig. 7, the index value corresponding to CCE subset set { CCE1} is 0. The index value corresponding to CCE subset group { { CCE2, CCE3}, { CCE3} } is 1. The index value corresponding to CCE subset group { { CCE4, CCE5, CCE6, CCE7}, { CCE4, CCE5}, { CCE5}, { CCE7} } is 3. The CCE subset set { CCE8, CCE9} corresponds to an index value of 0. The index value corresponding to CCE subset group { { CCE10, CCE11}, { CCE10} } is 1. The index value corresponding to CCE subset group { { CCE12, CCE13, CCE14, CCE15}, { CCE14, CCE15}, { CCE12}, { CCE14} } is 3.

Similarly, in the embodiment of the present application, according to the size of the index value of the CCE subset, the CCE subset may be excluded from the Q CCE subsets, or the CCE subset may be selected to determine the search space, so that the number of CCE subsets in the search space satisfies the maximum control channel number, and the number of CCEs in the search space satisfies the maximum CCE number. For example, in the embodiment of the present application, assuming that the maximum number of CCEs is 10, and the maximum number of control channels is 10, similarly, 10 CCE subsets may be selected from the Q CCE subsets in an order from large to small of the index values of the CCE subsets, and the number of CCEs included in the selected 10 CCE subsets is 10. Or, the CCE subsets may be excluded from the Q CCE subsets in the order of the index values of the CCE subsets from small to large, so that the finally reserved CCE subsets include 10 CCE subsets, and the number of CCEs included in the 10 CCE subsets is 10. For example, the index values of the CCE subsets shown in fig. 11 are {0, 1, 3} respectively, and the CCE subsets are excluded in the order of the smaller index values to the larger index values, so that 10 CCE subsets are included in the finally reserved CCE subsets, and the number of CCEs included in the 10 CCE subsets is 10, which is specifically shown in fig. 12. The CCE subsets reserved in fig. 12 are: { CCE4, CCE5, CCE6, CCE7}, { CCE4, CCE5}, { CCE5}, { CCE7}, { CCE10, CCE11}, { CCE10}, { CCE12}, { CCE12, CCE13, CCE14, CCE15}, { CCE14, CCE15}, and { CCE14}, where CCEs included are CCE4, CCE5, CCE6, CCE7, CCE10, CCE11, CCE12, CCE13, CCE14, CCE15, and 10 CCEs in total.

R1＝m^(L)/M^(L)+K(m^(L))；

wherein m is^(L)For the number of CCE subsets with aggregation level L in the Y CCE sets, M^(L)The number of CCE subsets with aggregation level L in the Y CCE sets is m^(L)Has an aggregation level of m with the number^(L)The CCEs in the CCE subset of (1) have the CCE subset with the largest aggregation level in the overlapping CCE subsets, and then K (m)^(L)) For the number m of Y CCE sets^(L)There are overlapping CCE subset numbers of CCE in CCE subset of (c), otherwise, K (m)^(L)) Is 0.

In this embodiment of the present application, a formula may be respectively adopted for each CCE subset of the Q CCE subsets: r1 ═ m^(L)/M^(L)+K(m^(L)) And determining the index value corresponding to the CCE subset.

The determination process of the index values of CCE subsets is described, for example, with CCE subsets included in the aggregation level set shown in fig. 5 as an example. In fig. 5, the number of CCE subset { CCE4, CCE5, CCE6, CCE7} is determined to be m in aggregation level 4^(L)0 and determining the number of CCE subsets M in aggregation level 4^(L)2. With CCE sub-groups in Y CCE setsThe CCE subsets where overlapping sets { CCE4, CCE5, CCE6, CCE7} exist include { CCE4, CCE5, CCE6, CCE7}, { CCE4, CCE5}, { CCE5}, and { CCE7}, where the maximum value of the aggregation level of the overlapping CCE subsets exists is 4; the aggregation level 4 is equal to the aggregation level of CCE subset { CCE4, CCE5, CCE6, CCE7}, and K (m) corresponding to CCE subset { CCE4, CCE5, CCE6, CCE7}^(L)) That is, the number of CCE subsets overlapping CCE subsets { CCE4, CCE5, CCE6, CCE7} in the Y CCE sets. For CCE subsets { CCE4, CCE5}, CCE subsets overlapping CCE subsets { CCE4, CCE5} include { CCE4, CCE5, CCE6, CCE7}, { CCE4, CCE5}, and { CCE5}, and the largest aggregation level of CCE subsets overlapping is 4, which is greater than aggregation level 2 of CCE subset { CCE4, CCE5}, so that the CCE subsets { CCE4, CCE5} correspond to K (m) of CCE subset { CCE4, CCE5}^(L)) 0. In a similar manner, the index values of the CCE subsets shown in fig. 5 may be determined, and the specific determined index value size and K value may be as shown in fig. 13.

For example, in the embodiment of the present application, assuming that the maximum number of CCEs is 10, and the maximum number of control channels is 10, similarly, 10 CCE subsets may be selected from the Q CCE subsets in an order from large to small of the index values of the CCE subsets, and the number of CCEs included in the selected 10 CCE subsets is 10. Or, the CCE subsets may be excluded from the Q CCE subsets in the order of the index values of the CCE subsets from small to large, so that the finally reserved CCE subsets include 10 CCE subsets, and the number of CCEs included in the 10 CCE subsets is 10. For example, the index values of the CCE subsets shown in fig. 13 are {1/7, 1/5, 2/7, 3/7, 4/7, 5/7, 6/7, 4/5, 1, 2, 2/5+1, 3/5+2, 4, 1/2+4}, respectively, and the CCEs corresponding to CCE subsets satisfying the largest CCE value are determined in the descending order of the index values of the CCE subsets; for example, CCE subsets with index values of {3/5+2, 4, 1/2+4} are determined as { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15}, { CCE10, CCE11 }; according to the CCEs included in the determined CCE subset, it may be determined that the CCEs of the search space include { CCE4, CCE5, CCE6, CCE7, CCE10, CCE11, CCE12, CCE13, CCE14, CCE15 }; the number of CCEs included therein is 10 to satisfy the requirement of maximum 10;

further, determining CCE subsets included in the N search spaces among CCE subsets included in { CCE4, CCE5, CCE6, CCE7, CCE10, CCE11, CCE12, CCE13, CCE14, and CCE15 }; wherein CCE subsets overlapping with { CCE4, CCE5, CCE6, CCE7, CCE10, CCE11, CCE12, CCE13, CCE14, CCE15} include { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15}, { CCE10, CCE11}, { CCE4, CCE5}, { CCE5}, { CCE7}, { CCE10}, { CCE14, CCE15}, { CCE14}, and { CCE12 }; the indices in the overlapping CCE subsets comprise {2/7, 1/5, 3/7, 4/7, 5/7, 4/5, 6/7, 3/5+2, 4, 1/2+4 }; the CCE subset with a large index is preferentially selected as the candidate control channels in the selected search space until the number of the largest candidate control channels reaches 10. In this example, the index of the selected CCE subset is {2/7, 1/5, 3/7, 4/7, 5/7, 4/5, 6/7, 3/5+2, 4, 1/2+4}, i.e., the selected CCE subset includes { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15}, { CCE10, CCE11}, { CCE4, CCE5}, { CCE5}, { CCE7}, { CCE10}, { CCE14, CCE15}, { CCE14}, and { CCE12}, and in particular, see fig. 14.

In the above embodiment, K (m)^(L)) According to Y CCE sets and the number m^(L)Determining the number of CCE subsets with CCEs overlapped in the CCE subsets; k (m)^(L)) The value can also be m according to the sum of the numbers in the Y CCE sets^(L)The CCE subsets of (a) are not limited herein, and the overlapping CCEs may be CCE subsets of other sizes.

In yet another possible example, in the embodiment of the present application, for each CCE subset of the W CCE subsets, a formula may be respectively adopted: r1 ═ m^(L)/M^(L)+K(m^(L)) And determining the index value corresponding to the CCE subset. The W CCE subsets are CCE subsets satisfying a CCE maximum value. The N search spaces may be determined by the index value and the maximum number of candidate control channels for each of the W CCE subsets.

For example, CCE subset index sizes in W CCE subsets satisfying the largest number of CCEs are as shown in fig. 14. And sequentially excluding CCE subsets in the W CCE subsets according to the sequence of the indexes from small to large. Wherein the W CCE subsets include { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15}, { CCE10, CCE11}, { CCE4, CCE5}, { CCE5}, { CCE7}, { CCE10}, { CCE14, CCE15}, { CCE14}, and { CCE12 }; the indices in the overlapping CCE subsets comprise {2/7, 1/5, 3/7, 4/7, 5/7, 4/5, 6/7, 3/5+2, 4, 1/2+4 }; the CCE subsets with small indices are preferentially excluded as candidate control channels in the selected search space until the number of the largest candidate control channels reaches 9. In this example, the index of the selected CCE subset is {2/7, 3/7, 4/7, 5/7, 4/5, 6/7, 3/5+2, 4, 1/2+4}, i.e., the selected CCE subset includes { CCE4, CCE5, CCE6, CCE7}, { CCE12, CCE13, CCE14, CCE15}, { CCE10, CCE11}, { CCE5}, { CCE7}, { CCE10}, { CCE14, CCE15}, { CCE14}, and { CCE12}, and specifically, see fig. 15.

In this embodiment, in a possible implementation manner, the network device or the terminal may determine the CCEs meeting the number of CCEs first, and then determine the CCE subset meeting the maximum number of control channels from CCE subsets (W CCE subsets) included in the CCEs meeting the number of CCEs.

In one possible example, when determining the search space based on the index values of the CCE subsets, the network device or the terminal may determine, based on the maximum number of CCEs and the index value corresponding to each CCE subset in the Y CCE sets, the search space in which the number of CCEs satisfies the maximum number of CCEs, and then determine N search spaces based on the maximum number of control channels and the index value corresponding to each CCE subset in the search space in which the number of CCEs satisfies the maximum number of CCEs. For convenience of description in the embodiment of the present application, the index value corresponding to the CCE subset related to the search space determined based on the number of CCEs may be referred to as a first index value, and the index value corresponding to each CCE subset in the search space where the number of CCEs satisfies the maximum CCE number may be referred to as a second index value. That is, the network device or the terminal may determine, based on the maximum CCE number and the first index value corresponding to each CCE subset in the Y CCE sets, a search space in which the CCE number satisfies the maximum CCE number, and then determine, based on the maximum CCE number and the second index value corresponding to each CCE subset in the Y CCE sets, a search space in which the CCE subset number satisfies the maximum control channel number in the search space in which the CCE number satisfies the maximum CCE number, thereby obtaining the search space satisfying the maximum CCE number and the maximum control channel number.

The first index value may be R1 referred to in the above embodiments. The second index value is an index value different from the first index value, for example, the second index value is denoted by R2. In one possible embodiment, the second index value R2 may satisfy the following formula R2 ═ m^(L)/M^(L)+K(m^(L)) (ii) a Wherein m is^(L)The number of CCE subsets with aggregation level L in Y CCE sets, M (L) the number of CCE subsets with aggregation level L in Y CCE sets, if the number is m^(L)Has an aggregation level of m with the number^(L)The CCEs in the CCE subset of (1) have the CCE subset with the largest aggregation level in the overlapping CCE subsets, and then K (m)^(L)) The number of CCE subsets overlapping with CCE in the CCE subsets numbered m (L) in the Y CCE sets is set, otherwise, K (m (L)) is 0.

In another possible example, the network device or the terminal may determine the CCE index using an existing function for determining the CCE index, for example, using the method described in the above embodimentAnd determining a CCE index according to the function, and then determining the CCE meeting the maximum number of the CCEs according to the CCE index.

In one possible example, the CCEs meeting the maximum CCE number may be selected according to the descending order of aggregation levels corresponding to CCE subsets where the CCEs are located and the ascending order of numbers of the CCE subsets where the CCEs are located in the corresponding aggregation levels. And then determining N search spaces based on the maximum number of the control channels and the index value corresponding to each CCE subset in the CCE subsets (W CCE subsets) of which the number of the CCEs meets the maximum number of the CCEs. The implementation manner related to the above embodiment may be adopted for determining the N search spaces based on the maximum number of control channels and the index value corresponding to each CCE subset in the CCE subset (W CCE subsets) where the number of CCEs satisfies the maximum CCE number, and details are not described herein again. For example, a second index value corresponding to each CCE subset of the Y CCE sets based on a maximum number of control channels may be selectedAnd determining the search space with the number of CCE subsets meeting the maximum number of control channels in the search space with the number of CCEs meeting the maximum number of CCEs, and further obtaining the search space meeting the maximum number of CCEs and the maximum number of control channels. In one possible embodiment, the second index value R2 may satisfy the following formula R2 ═ m^(L)/M^(L)+K(m^(L)) (ii) a Wherein m is^(L)For the number of CCE subsets with aggregation level L in Y CCE sets, M^(L)The number of CCE subsets with aggregation level L in Y CCE sets is m^(L)Is the maximum aggregation level, K (m)^(L)) For Y CCE sets numbered m^(L)There are overlapping CCE subset numbers of CCE in CCE subset of (c), otherwise, K (m)^(L)) Is 0.

It should be noted that in this embodiment of the present application, the precoding granularity of the M control channel resource sets configured for the terminal may be the size of a Resource Element Group (REG) bundle (bundle), or may also be the frequency domain size of CORESET. If the precoding granularity is different, the CCE subsets included in the search space determined according to the embodiment of the present application are different. When determining the search space corresponding to different precoding granularities, different manners may be adopted, for example, when the precoding granularity is the REG bundle size, a CCE subset with a high aggregation level may be preferentially selected, and when the precoding granularity is the frequency domain size of CORESET, a CCE subset with a low aggregation level may be preferentially selected.

In the embodiment of the application, a search space is determined based on a CCE set, and the number of all CCEs in the determined search space is less than or equal to the maximum number of CCEs which can be detected by a terminal in each time slot and/or less than or equal to the maximum number of control channels which can be detected by the terminal in each time slot, so that the number of the CCEs in the search space meets the limitation of the maximum number of the CCEs for channel estimation, and the search space can be dynamically updated in real time in a manner of configuring a parameter alpha in a semi-static manner, and the requirement of channel estimation complexity is met; and the number of all CCEs in the search space is less than or equal to the maximum number of CCEs which can be detected by the terminal in each time slot, and/or less than or equal to the maximum number of control channels which can be detected by the terminal in each time slot, so that the maximum capability which can be reached by the terminal can be fully utilized as far as possible.

It is understood that the terminal and the network device include corresponding hardware structures and/or software modules for performing the respective functions in order to implement the above-described functions. The elements and algorithm steps of the various examples described in connection with the embodiments disclosed herein may be embodied in hardware or in a combination of hardware and computer software. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present teachings.

In the embodiment of the present application, the terminal and the network device may be divided according to the above method examples, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

Based on the same inventive concept, the present application also provides an apparatus for implementing any one of the above methods for determining a search space, for example, the present application provides an apparatus for determining a search space, which includes a unit (or means) for implementing each step performed by a network device in any one of the above methods.

In a possible implementation manner, the apparatus for determining a search space provided by the embodiment of the present application may be applied to a terminal or a network device. The apparatus for determining a search space includes a processing unit, where the processing unit is configured to determine Y control channel element CCE sets corresponding to X aggregation level sets, X is the number of all aggregation level sets corresponding to M control channel resource sets configured for a terminal, each aggregation level set includes one or more aggregation levels, the X aggregation level sets include aggregation levels whose total sum is Y, each of the Y aggregation levels corresponds to one of the Y CCE sets, X is an integer greater than or equal to 1, M is an integer greater than or equal to 1, and Y is an integer greater than or equal to 1. And determining N search spaces based on the Y CCE sets and the maximum number of the CCEs, wherein N is a positive integer smaller than or equal to Y, each of the N search spaces corresponds to one of the N aggregation levels in the Y aggregation levels, all the CCEs forming the N search spaces are subsets of the CCEs included in the Y CCE sets, the number of all the CCEs forming the N search spaces is smaller than or equal to the maximum number of the CCEs, and the maximum number of the CCEs is the maximum number of the CCEs which can be detected by the terminal in each time slot.

In one possible embodiment, the processing unit determines N search spaces based on the Y CCE sets and the maximum CCE number by:

determining CCEs included in the N search spaces according to the priority levels of CCE subsets included in the Y CCE sets and the maximum number of the CCEs, wherein the CCEs corresponding to the second-class subset with low aggregation level in the Y CCE sets are preferentially excluded until the number of the rest CCEs included in the Y CCE sets is less than or equal to the maximum number of the CCEs, and if the number of the CCEs remaining after all the second-class subsets in the Y CCE sets are excluded is still greater than the maximum number of the CCEs, the CCEs corresponding to the subsets with high aggregation level in the first-class subset are preferentially excluded until the rest CCEs are less than or equal to the maximum number of the CCEs; or preferentially selecting the CCEs corresponding to the first-class subset with the high aggregation level in the Y CCE sets as the CCEs included in the N search spaces until the number of the selected CCEs meets the maximum number of the CCEs, and preferentially selecting the subset with the high aggregation level in the second-class subset if the number of the CCEs after all the first-class subsets are selected is still smaller than the maximum number of the CCEs until the number of the selected CCEs meets the maximum number of the CCEs.

In another possible implementation, the processing unit determines N search spaces based on the Y CCE sets and the maximum CCE number in the following manner:

determining CCEs included in the N search spaces based on the priority of the CCE subsets included in the Y CCE sets, the maximum number of the CCEs, and the maximum number of candidate control channels, wherein the maximum number of the candidate control channels is the maximum number of the candidate control channels which can be detected by the terminal in each time slot; preferentially excluding the fourth-class subsets with low aggregation level from the Y CCE sets until the number of the remaining CCE subsets is less than or equal to the maximum number of the candidate control channels, and preferentially excluding the CCE subsets with low aggregation level from the third-class subsets until the number of the remaining CCE subsets is less than or equal to the maximum number of the candidate control channels if the number of the remaining CCE subsets is still greater than the maximum number of the candidate control channels after all the fourth-class subsets from the Y CCE sets are excluded; or preferentially selecting a third-class subset with a high aggregation level in the Y CCE sets until the number of the selected CCE subsets meets the maximum number of the candidate control channels, if the third-class subsets in the Y CCE sets are all selected, the number of the selected CCE subsets is still smaller than the maximum number of the candidate control channels, and preferentially selecting a fourth-class subset with a high aggregation level until the number of the selected CCE subsets meets the maximum number of the candidate control channels.

In another possible implementation, the processing unit determines N search spaces based on the Y CCE sets and the maximum CCE number in the following manner: determining the CCEs included in the N search spaces according to the priority of the CCE subset included in the Y CCE sets, the maximum CCE number, and the maximum candidate control channel number, and the specific determination manner may refer to the above description. Preferentially excluding a fourth-class subset with a low aggregation level from the W CCE subsets until the number of remaining CCE subsets is less than or equal to the maximum number of candidate control channels is satisfied, preferentially excluding a CCE subset with a low aggregation level from the third-class subset until the number of remaining CCE subsets is less than or equal to the maximum number of candidate control channels if the number of CCE subsets remaining after excluding all the fourth-class subsets from the W CCE subsets is still greater than the maximum number of candidate control channels, or preferentially selecting a third-class subset with a high aggregation level from the Y CCE sets until the number of selected CCE subsets satisfies the maximum number of candidate control channels, and preferentially selecting a fourth-class subset with a high aggregation level if all the third-class subsets from the Y CCE sets are selected, the number of selected CCE subsets is still less than the maximum number of candidate control channels, until the selected number of CCE subsets meets the maximum number of candidate control channels.

In yet another possible implementation, the processing unit may determine N search spaces based on the first index value corresponding to each CCE subset, the Y CCE sets, and the maximum CCE number.

In yet another possible implementation, the processing unit determines N search spaces based on the Y CCE sets, a maximum CCE number, and a maximum candidate control channel number, where the number of candidate control channels included in the N search spaces is less than or equal to the maximum candidate control channel number.

In yet another possible implementation, the processing unit determines N search spaces based on the second index value, the Y CCE aggregation, the maximum CCE number, and the maximum candidate control channel number, where all CCE numbers in the N search spaces are less than or equal to the maximum CCE number, and the number of candidate control channels included in the N search spaces is less than or equal to the maximum candidate control channel number.

In yet another possible implementation manner, the processing unit may determine N search spaces based on the second index value, the Y CCE sets, and a maximum number of candidate control channels, where the number of candidate control channels included in the N search spaces is less than or equal to the maximum number of candidate control channels.

Wherein the second index value R2 satisfies the formula: r2 ═ m^(L)/M^(L)+K(m^(L)) Or R2 ═ K (m)^(L))。

In one possible implementation, the apparatus for determining a search space provided by the above example of the present application includes a unit (or means) for implementing each step performed by the terminal or the network device in any one of the above methods. For example, the present application provides an apparatus for determining a search space, and the apparatus for determining a search space may be applied to a terminal or a network device.

Fig. 16 is a schematic structural diagram of an apparatus for determining a search space according to an embodiment of the present application, where the apparatus for determining a search space is applicable to a terminal. Referring to fig. 16, the apparatus for determining a search space applied to a terminal may include a processing unit 1601 and a receiving unit 1602, wherein the processing unit 1601 has the functions of the processing unit mentioned above. A receiving unit 1602, configured to receive configuration information sent by a network device. The processing unit 1601 determines Y control channel element CCE sets corresponding to the X aggregation level sets based on information included in the configuration information. The receiving unit 1602 is also configured to detect candidate control channels within the search space determined by the processing unit 1601.

Fig. 17 is a schematic structural diagram of another apparatus for determining a search space according to an embodiment of the present application, where the apparatus for determining a search space is applicable to a network device. Referring to fig. 17, the apparatus for determining a search space applied to a network device may include a processing unit 1701 and a transmitting unit 1702, wherein the processing unit 1701 has the functions of the processing unit mentioned above. A sending unit 1702, configured to send configuration information to the terminal, where the configuration information includes the above determined M control channel resource set information and X aggregation level set information included in the M control channel resource sets. In one possible implementation, the sending unit 1702 may send the downlink control information in the search space determined by the processing unit 1701, and send the configuration information through the downlink control information.

The apparatus for determining a search space provided in the embodiment of the present application has a method for determining a search space in the embodiment of the foregoing method, and therefore, for a place where the description of the apparatus for determining a search space in the embodiment of the present application is not exhaustive, reference may be made to the related description of the embodiment of the foregoing method.

It should be understood that the division of the units in the above apparatus is only a division of logical functions, and the actual implementation may be wholly or partially integrated into one physical entity or may be physically separated. And the units in the device can be realized in the form of software called by the processing element; or may be implemented entirely in hardware; part of the units can also be realized in the form of software called by a processing element, and part of the units can be realized in the form of hardware. For example, each unit may be a processing element separately set up, or may be implemented by being integrated into a chip of the apparatus, or may be stored in a memory in the form of a program, and a function of the unit may be called and executed by a processing element of the apparatus. In addition, all or part of the units can be integrated together or can be independently realized. The processing element described herein may in turn be a processor, which may be an integrated circuit having signal processing capabilities. In the implementation process, the steps of the method or the units above may be implemented by integrated logic circuits of hardware in a processor element or in a form called by software through the processor element.

In one example, the units in any of the above apparatuses may be one or more integrated circuits configured to implement the above methods, such as: one or more Application Specific Integrated Circuits (ASICs), or one or more microprocessors (DSPs), or one or more Field Programmable Gate Arrays (FPGAs), or a combination of at least two of these integrated circuit forms. As another example, when a unit in a device may be implemented in the form of a processing element scheduler, the processing element may be a general-purpose processor, such as a Central Processing Unit (CPU) or other processor capable of invoking programs. As another example, these units may be integrated together and implemented in the form of a system-on-a-chip (SOC).

The above unit for receiving is an interface circuit of the apparatus for receiving signals from other apparatuses. For example, when the device is implemented in the form of a chip, the receiving unit is an interface circuit for the chip to receive signals from other chips or devices. The above unit for transmitting is an interface circuit of the apparatus for transmitting a signal to other apparatuses. For example, when the device is implemented in the form of a chip, the transmitting unit is an interface circuit for the chip to transmit signals to other chips or devices.

In one implementation, the unit of the network device or the terminal for implementing the steps in the above method may be implemented in the form of a processing element scheduler, for example, an apparatus applied to the network device or the terminal includes a processing element and a storage element, and the processing element calls a program stored in the storage element to execute the method executed by the network device in the above method embodiment. The memory elements may be memory elements on the same chip as the processing element, i.e. on-chip memory elements, or may be memory elements on a different chip than the processing element, i.e. off-chip memory elements.

In another implementation, the unit for implementing the steps in the above method by a device applied to a network device or a terminal may be configured as one or more processing elements disposed on a baseband device, where the processing elements may be integrated circuits, for example: one or more ASICs, or one or more DSPs, or one or more FPGAs, or a combination of these types of integrated circuits. These integrated circuits may be integrated together to form a chip.

The network device or the terminal may be integrated together to implement the units of the above method, and may be implemented in the form of a system-on-a-chip (SOC), for example, a baseband device including the SOC chip for implementing the above method. At least one processing element and a storage element can be integrated in the chip, and the processing element calls the stored program of the storage element to realize the method executed by the network equipment or the terminal; or, at least one integrated circuit may be integrated in the chip, for implementing the method executed by the above network device; alternatively, the above implementation modes may be combined, the functions of the partial units are implemented in the form of a processing element calling program, and the functions of the partial units are implemented in the form of an integrated circuit.

It is seen that the above apparatus, which may be applied to a network device or a terminal, may comprise at least one processing element and an interface circuit, wherein the at least one processing element is configured to perform the method performed by any one of the network devices provided by the above method embodiments. The processing element may: namely, calling the program stored in the storage element to execute part or all of the steps executed by the network equipment; it is also possible to: that is, some or all of the steps performed by the network device are performed by integrated logic circuitry of hardware in the processor element in combination with the instructions; of course, some or all of the steps performed by the above network device may also be performed in combination with the first manner and the second manner. For example, in the embodiment of the present application, the apparatus applied to the network device may be the network device shown in fig. 2. The device applied to the terminal may be the terminal shown in fig. 3.

The processing elements herein, like those described above, may be a general purpose processor, such as a CPU, or one or more integrated circuits configured to implement the above methods, such as: one or more ASICs, or one or more microprocessors DSP, or one or more FPGAs, etc., or a combination of at least two of these integrated circuit forms. The storage element may be a memory or a combination of a plurality of storage elements.

According to the method provided by the embodiment of the present application, the embodiment of the present application further provides a communication system, which includes the foregoing network device and one or more terminals.

The embodiment of the present application further provides an apparatus for determining a search space, which is applied to a network device or a terminal, and includes at least one processing element (or chip) for performing the above method embodiment.

The present application provides a program for determining a search space, which program, when executed by a processor, is adapted to perform the method of the above embodiment.

The present application also provides a program product, such as a computer-readable storage medium, comprising a program of the above-mentioned method of determining a search space.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various changes and modifications may be made in the embodiments of the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the embodiments of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to encompass such modifications and variations.

Claims

1. A method of determining a search space, comprising:

determining Y Control Channel Element (CCE) sets corresponding to X aggregation level sets, wherein X is the number of all aggregation level sets corresponding to M control channel resource sets configured for a terminal, each aggregation level set comprises one or more aggregation levels, the sum of the X aggregation level sets comprises aggregation levels is Y, each of the Y aggregation levels corresponds to one of the Y CCE sets, X is an integer greater than or equal to 1, M is an integer greater than or equal to 1, and Y is an integer greater than or equal to 1;

determining N search spaces based on the Y CCE sets and the maximum number of CCEs, wherein N is a positive integer smaller than or equal to Y, each of the N search spaces corresponds to one of the N aggregation levels in the Y aggregation levels, all the CCEs forming the N search spaces are subsets of the CCEs included in the Y CCE sets, the number of all the CCEs forming the N search spaces is smaller than or equal to the maximum number of the CCEs, and the maximum number of the CCEs is the maximum number of the CCEs which can be detected by the terminal in each time slot.

2. The method of claim 1, wherein all CCEs comprised by the Y sets of CCEs comprise overlapping CCEs and non-overlapping CCEs, wherein the overlapping CCEs belong to at least two sets of CCEs, and the non-overlapping CCEs belong to one set of CCEs;

each of the Y CCE subsets comprises one or more CCE subsets, each CCE subset being composed of a respective aggregation level number of CCEs, the respective aggregation level of each CCE subset being an aggregation level corresponding to the CCE set containing said each CCE subset, the CCE subsets being either first-class subsets, which are subsets including overlapping CCEs, or second-class subsets, which are subsets not including overlapping CCEs;

determining N search spaces based on the Y CCE sets and the maximum CCE number includes:

determining CCEs included in the N search spaces according to the priorities of the CCE subsets included in the Y CCE sets and the maximum number of CCEs, wherein,

preferentially excluding CCEs corresponding to a second-class subset with a low aggregation level from Y CCE sets until the number of the remaining CCEs included in the Y CCE sets is less than or equal to the maximum number of the CCEs, and preferentially excluding CCEs corresponding to subsets with a high aggregation level from the first-class subset until the remaining CCEs are less than or equal to the maximum number of the CCEs if the number of the remaining CCEs included in the Y CCE sets after all the second-class subsets in the CCEs are excluded is still greater than the maximum number of the CCEs; or,

and preferentially selecting CCEs corresponding to the first-class subset with high aggregation level in the Y CCE sets as the CCEs included in the N search spaces until the number of the selected CCEs meets the maximum number of the CCEs, and preferentially selecting the subset with high aggregation level in the second-class subset if the number of the CCEs after all the first-class subsets are selected is still smaller than the maximum number of the CCEs until the number of the selected CCEs meets the maximum number of the CCEs.

3. The method of claim 1, wherein all CCEs comprised by the Y sets of CCEs comprise overlapping CCEs and non-overlapping CCEs, wherein the overlapping CCEs belong to at least two sets of CCEs, and the non-overlapping CCEs belong to CCEs of one set of CCEs;

each of the Y CCE sets comprises one or more CCE subsets each consisting of a respective aggregation level number of CCEs, the respective aggregation level of each CCE subset being an aggregation level corresponding to the CCE set containing said each CCE subset, the CCE subsets being either third-class subsets, which are subsets including non-overlapping CCEs, or fourth-class subsets, which are subsets including no non-overlapping CCEs;

determining CCEs included in the N search spaces based on the priority of the CCE subsets included in the Y CCE sets, the maximum number of the CCEs, and the maximum number of candidate control channels, wherein the maximum number of the candidate control channels is the maximum number of the candidate control channels which can be detected by the terminal in each time slot;

preferentially excluding the fourth-class subsets with low aggregation level from the Y CCE sets until the number of the remaining CCE subsets is less than or equal to the maximum number of the candidate control channels, and preferentially excluding the CCE subsets with low aggregation level from the third-class subsets until the number of the remaining CCE subsets is less than or equal to the maximum number of the candidate control channels if the number of the remaining CCE subsets is still greater than the maximum number of the candidate control channels after all the fourth-class subsets from the Y CCE sets are excluded; or,

and preferentially selecting the third-class subsets with high aggregation level in the Y CCE sets until the number of the selected CCE subsets meets the maximum number of the candidate control channels, if the third-class subsets in the Y CCE sets are all selected, the number of the selected CCE subsets is still smaller than the maximum number of the candidate control channels, and preferentially selecting the fourth-class subsets with high aggregation level until the number of the selected CCE subsets meets the maximum number of the candidate control channels.

4. The method of claim 1, wherein all CCEs comprised by the Y sets of CCEs comprise overlapping CCEs and non-overlapping CCEs, wherein the overlapping CCEs belong to at least two sets of CCEs, and the non-overlapping CCEs belong to CCEs of one set of CCEs;

each of the Y CCE subsets comprises one or more CCE subsets, each CCE subset being composed of a respective aggregation level number of CCEs, the respective aggregation level of each CCE subset being an aggregation level corresponding to the CCE set including the each CCE subset, the CCE subsets being either first-class subsets, which are subsets including overlapping CCEs, or second-class subsets, which are subsets not including overlapping CCEs, and the first-class subsets having a higher priority than the second-class subsets;

determining CCEs included in the N search spaces according to the priority of the CCE subsets included in the Y CCE sets, the maximum number of CCEs, and the maximum number of candidate control channels, wherein,

preferably, the CCEs corresponding to the second-class subset with low aggregation level in the Y CCE sets are excluded until the number of the remaining CCEs is less than or equal to the maximum number of the CCEs, if the number of the CCEs remaining after the Y CCE sets comprise all the second-class subsets in the CCEs is excluded is still larger than the maximum number of the CCEs, the CCEs corresponding to the subsets with high aggregation levels in the first-class subsets are preferentially excluded until the number of the remaining CCEs is smaller than or equal to the maximum number of the CCEs, or preferentially selecting the CCEs corresponding to the first-class subset with high aggregation level in the Y CCE sets as the CCEs included in the N search spaces until the number of the selected CCEs meets the maximum number of the CCEs, if the number of CCEs after all the first-class subsets are selected is still smaller than the maximum number of CCEs, preferentially selecting the subset with a high aggregation level in the second-class subsets until the number of the selected CCEs meets the maximum number of the CCEs;

the CCE subsets containing the rest CCEs in the Y CCE sets are W CCE subsets, wherein the W CCE subsets comprise third-class subsets and/or fourth-class subsets, the third-class subsets comprise non-overlapping CCEs, the fourth-class subsets comprise non-overlapping CCEs, and the fourth-class subsets have higher priority than the third-class subsets;

and the number of the first and second groups,

preferentially excluding a fourth-class subset with a low aggregation level from the W CCE subsets until the number of remaining CCE subsets is less than or equal to the maximum number of candidate control channels is satisfied, preferentially excluding a CCE subset with a low aggregation level from the third-class subset until the number of remaining CCE subsets is less than or equal to the maximum number of candidate control channels if the number of CCE subsets remaining after excluding all the fourth-class subsets from the W CCE subsets is still greater than the maximum number of candidate control channels, or preferentially selecting a third-class subset with a high aggregation level from the Y CCE sets until the number of selected CCE subsets satisfies the maximum number of candidate control channels, and preferentially selecting a fourth-class subset with a high aggregation level if all the third-class subsets from the Y CCE sets are selected, the number of selected CCE subsets is still less than the maximum number of candidate control channels, until the selected number of CCE subsets meets the maximum number of candidate control channels;

the maximum number of candidate control channels is the maximum number of candidate control channels that the terminal can detect in each time slot.

5. The method of claim 1,

the X aggregation level sets comprise Q CCE subsets, each CCE subset corresponds to a first index value, and Q is an integer greater than or equal to 0;

and determining N search spaces based on the first index value corresponding to each CCE subset, the Y CCE sets and the maximum number of CCEs.

6. The method of claim 5, wherein the Q CCE subsets comprise P CCE subset groups, P being an integer greater than or equal to 0, each of the P CCE subset groups comprising one or more CCE subsets, any one of the plurality of CCE subsets comprising at least one overlapping CCE, the overlapping CCEs belonging to at least two CCE sets;

the first index value is related to the number of CCE subsets included in a CCE subset group in which the CCE subset corresponding to the first index value is located.

7. The method of claim 6, wherein the first index value is a number of CCE subsets included in a CCE subset group in which a CCE subset corresponding to the first index value is located.

8. The method of claim 6, wherein the first index value R1 satisfies the following formula:

R1＝m^(L)/M^(L)+K；

wherein m is^(L)For the number of CCE subsets with aggregation level L in the Y CCE sets, M^(L)The number of CCE subsets with an aggregation level L in the Y CCE sets is denoted by K, which is the number of CCE subsets included in a CCE subset group in which a CCE subset corresponding to the first index value is located.

9. The method of any one of claims 1, or 5 to 8, wherein determining N search spaces based on the Y sets of CCEs and a maximum number of CCEs comprises:

determining N search spaces based on the Y CCE sets, the maximum number of CCEs and the maximum number of candidate control channels;

the number of candidate control channels included in the N search spaces is less than or equal to the maximum number of candidate control channels, and the maximum number of candidate control channels is the maximum number of candidate control channels that can be detected by the terminal in each time slot.

10. The method of claim 9, wherein determining N search spaces based on the Y sets of CCEs, the maximum number of CCEs, and the maximum number of candidate control channels comprises:

determining N search spaces based on a second index value, the Y CCE sets, the maximum number of CCEs and the maximum number of candidate control channels;

the second index value R2 satisfies the following formula:

R2＝m^(L)/M^(L)+K(m^(L)) Or R2 ═ K (m)^(L))；

Wherein m is^(L)For the number of CCE subsets with aggregation level L in the Y CCE sets, M^(L)The number of CCE subsets with aggregation level L in the Y CCE sets is m^(L)Has an aggregation level of m with the number^(L)If there is an aggregation level where CCEs overlapping CCEs are largest in CCE subsets of (1), K (m)^(L)) For the number m of Y CCE sets^(L)CCE of the CCE subset ofThere are CCE subset numbers of overlapping CCEs, otherwise, K (m)^(L)) Is 0.

11. The method of any of claims 1 to 9, wherein after determining the N search spaces, the method further comprises:

detecting candidate control channels in the determined N search spaces.

12. The method of any of claims 1 to 9, wherein after determining the N search spaces, the method further comprises:

and sending the downlink control information in the determined N search spaces.

13. An apparatus for determining a search space, comprising at least one processing unit and at least one memory unit, wherein,

the at least one storage unit is used for storing programs and data;

the at least one processing unit calls the program in the at least one storage unit to execute:

14. The apparatus of claim 13, wherein all CCEs comprised by the Y sets of CCEs comprise overlapping CCEs and non-overlapping CCEs, wherein the overlapping CCEs belong to at least two sets of CCEs, and the non-overlapping CCEs belong to one set of CCEs;

the processing unit determines N search spaces based on the Y CCE sets and the maximum number of CCEs in the following mode:

15. The apparatus of claim 13, wherein all CCEs comprised by the Y sets of CCEs comprise overlapping CCEs and non-overlapping CCEs, wherein the overlapping CCEs belong to at least two sets of CCEs, and the non-overlapping CCEs belong to CCEs of one set of CCEs;

16. The apparatus of claim 13, wherein all CCEs comprised by the Y sets of CCEs comprise overlapping CCEs and non-overlapping CCEs, wherein the overlapping CCEs belong to at least two sets of CCEs, and the non-overlapping CCEs belong to CCEs of one set of CCEs;

and the number of the first and second groups,

17. The apparatus of claim 13, wherein the X aggregation level sets comprise Q CCE subsets, each CCE subset corresponding to a first index value, Q being an integer greater than or equal to 0;

18. The apparatus of claim 17, wherein the Q CCE subsets comprise P CCE subset groups, P being an integer greater than or equal to 0, each CCE subset group of the P CCE subset groups comprising one or more CCE subsets, any one CCE subset of the plurality of CCE subsets comprising at least one overlapping CCE, the overlapping CCE belonging to at least two CCE sets;

19. The apparatus of claim 18, wherein the first index value is a number of CCE subsets included in a CCE subset group in which a CCE subset corresponding to the first index value is located.

20. The apparatus of claim 18, wherein the first index value R1 satisfies the following formula:

R1＝m^(L)/M^(L)+K；

21. The apparatus of any one of claims 13, or 17 to 20, wherein the processing unit determines N search spaces based on the Y sets of CCEs and a maximum number of CCEs in the following manner:

22. The apparatus of claim 21, wherein the processing unit determines N search spaces based on the Y sets of CCEs, a maximum number of CCEs, and a maximum number of candidate control channels in the following manner:

the second index value R2 satisfies the following formula:

R2＝m^(L)/M^(L)+K(m^(L)) Or R2 ═ K (m)^(L))；

Wherein m is^(L)For the number of CCE subsets with aggregation level L in the Y CCE sets, M^(L)The number of CCE subsets with aggregation level L in the Y CCE sets is m^(L)Has an aggregation level of m with the number^(L)If there is an aggregation level where CCEs overlapping CCEs are largest in CCE subsets of (1), K (m)^(L)) For the number m of Y CCE sets^(L)The CCEs in the CCE subset have the number of CCE subsets overlapping the CCEs, otherwise, K (m)^(L)) Is 0.

23. The method of any of claims 13 to 22, wherein the apparatus further comprises a receiving unit configured to:

detecting candidate control channels in the N search spaces determined by the processing unit.

24. The method of any of claims 13 to 22, wherein the apparatus further comprises a transmitting unit configured to:

and sending downlink control information in the N search spaces determined by the processing unit.

25. A computer storage medium for storing a program for performing the method of any one of claims 1 to 12.