Data reception method, data transmission method, and apparatus

Abstract

An embodiment of the present invention provides a data receiving method, a data transmitting method and an apparatus, which includes: a processing unit for allocating a PDCCH candidate to a first search space, where the first search space is used for scheduling a cell in a first set; and a receiving unit for receiving DCI in the first search space, where the DCI is used for scheduling at least two cells in the first set.

Description

[Technical Field]

[0001] Embodiments of the present invention relate to the field of communication technology. [Background technology]

[0002] A Physical Downlink Shared Channel (PDSCH) is one of the physical downlink channels in a wireless communication system and is used to carry downlink data. A Physical Uplink Shared Channel (PUSCH) is one of the physical uplink channels in a wireless communication system and is used to carry uplink data. PDSCHs and PUSCHs may be scheduled by downlink control information (DCI). Current new radio (NR) systems define various DCI formats for scheduling PDSCHs or PUSCHs. Different DCI formats contain different specific information and / or sizes to meet different scheduling requirements.

[0003] NR introduces the concept of a Control Resource Set (CORESET). A CORESET is a time-frequency resource corresponding to a PDCCH monitoring occasion, while a search space (SS) defines the monitoring occasion and the search operations within that occasion. In other words, a PDCCH configuration is a combination of a CORESET and an SS.

[0004] A single serving cell can comprise one or more Bandwidth Parts (BWPs) for both the uplink and downlink. Coresets and service strings (SSs) are configured within the downlink bandwidth part (DL BWP), and the configured coresets and SSs are indexed within the entire serving cell. A single BWP can comprise multiple coresets and SSs. Except for coresets with index #0, the configuration of a coreset includes the index of that coreset. Except for SSs with index #0, the configuration of an SS includes the index of that SS and the index of the coreset corresponding to that SS. A single coreset can associate multiple SSs; that is, configurations of different SSs can include the same coreset index. According to the above configuration, terminal devices can understand the combination of coresets and SSs and determine the PDCCH configuration.

[0005] To transmit a DCI, a network device must perform processes such as cyclic redundancy check (CRC) attachment, channel coding, rate matching, scrambling, and modulation on the DCI payload, and then map it to a physical resource corresponding to a PDCCH candidate. Accordingly, a terminal device monitors PDCCH candidates to receive the DCI.

[0006] Furthermore, the above explanation of the background art is merely intended to provide a clearer and more complete explanation of the present invention and to facilitate understanding for those skilled in the art. These elements, as described in the background art section of the present invention, should not be construed as being well-known to those skilled in the art. [Overview of the project] [Problems that the invention aims to solve]

[0007] Currently, radio resource control is configured so that carriers (cells) perform either self-scheduling or cross-carrier scheduling. Self-scheduling means that PDSCH and / or PUSCH on one carrier are scheduled by DCI transmitted on that carrier. Cross-carrier scheduling means that PDSCH and / or PUSCH on one carrier (cell) are scheduled by DCI transmitted on other carriers (cells).

[0008] Currently, only one DCI is supported for scheduling one serving cell, including in the case of self-scheduling and cross-carrier scheduling. To reduce the burden of DCI monitoring by terminal devices and to reduce power consumption and complexity, the NR system will support scheduling PDSCH and / or PUSCH for multiple serving cells via a single DCI. However, there is currently no concrete scheme for how to support scheduling PDSCH and / or PUSCH for multiple serving cells via a single DCI. For example, when one DCI schedules multiple serving cells, there is no concrete scheme for how to determine which PDCCH candidates to monitor to detect DCIs transmitted in PDCCH candidates.

[0009] In view of at least one of the above-mentioned problems, embodiments of the present invention provide a data receiving method, a data transmission method, and an apparatus. [Means for solving the problem]

[0010] One embodiment of the present invention provides a data receiving device applicable to a terminal device, comprising: a processing unit for assigning PDCCH candidates to a first search space, the first search space being used for scheduling cells in a first set; and a receiving unit for receiving DCI in the first search space, the DCI being used for scheduling at least two cells in the first set.

[0011] In one embodiment of the present invention, a data transmission device is provided for application to a network device, comprising a transmitting unit that transmits DCI in a first search space, wherein the first search space is used to schedule cells in a first set, the DCI is used to schedule at least two cells in the first set, and the first search space is to which a PDCCH candidate for transmitting the DCI is assigned.

[0012] One embodiment of the present invention provides a communication system comprising a network device and / or a terminal device, wherein the network device includes a data transmission device as described in the above embodiment, and the terminal device includes a data receiving device as described in the above embodiment.

[0013] One of the advantageous effects of the embodiments of the present invention is as follows: When scheduling multiple cells through a single DCI, it is possible to support scheduling multiple cells through a single DCI by determining which PDCCH candidate to monitor in which search space, thereby reducing the burden of DCI monitoring on terminal devices and lowering power consumption and complexity.

[0014] As shown in the following description and drawings, specific embodiments of the present invention are disclosed in detail, illustrating methods in which the principles of the present invention can be employed. However, the scope of embodiments of the present invention is not limited to these. Embodiments of the present invention include modified, altered, and equivalent forms within the scope of the gist and items of the appended claims.

[0015] Features described and / or shown in one embodiment may be used in the same or similar manner in one or more other embodiments, may be combined with features in other embodiments, or may replace features in other embodiments.

[0016] In this text, the terms "contains / have" mean the presence of a feature, component, step, or constituent element, and do not exclude the presence or addition of one or more other features, components, steps, or constituent elements. [Brief explanation of the drawing]

[0017] Elements and features described in one drawing and one embodiment of the embodiments of the present invention may be combined with elements and features shown in one or more drawings or embodiments. In addition, similar reference numerals in the drawings may indicate corresponding elements in multiple drawings, and may indicate corresponding elements used in one or more embodiments. [Figure 1] This is a schematic diagram of a communication system according to an embodiment of the present invention. [Figure 2A] This is a schematic diagram of a CORESET according to an embodiment of the present invention. [Figure 2B] This is a schematic diagram of a PDCCH monitoring occasion according to an embodiment of the present invention. [Figure 3] This is a schematic diagram of the CCE configuration of a serving cell according to an embodiment of the present invention. [Figure 4] This is a schematic diagram of an example of a data receiving method according to an embodiment of the present invention. [Figure 5] This is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 6]It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 7] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 8] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 9] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 10] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 11] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 12] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 13] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 14] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 15] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 16] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 17] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 18] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 19] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 20] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 21] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 22] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 23] It is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 24] This is a schematic diagram of a first PDCCH candidate set according to an embodiment of the present invention. [Figure 25] This is a schematic diagram illustrating the meaning of each parameter in the embodiment of the present invention. [Figure 26] This is a schematic diagram of the assignment of PDCCH candidates according to an embodiment of the present invention. [Figure 27] This is a schematic diagram of the assignment of PDCCH candidates according to an embodiment of the present invention. [Figure 28] This is a schematic diagram of an example of a data transmission method according to an embodiment of the present invention. [Figure 29] This is a schematic diagram of a data receiving device according to an embodiment of the present invention. [Figure 30] This is a schematic diagram of a data transmission device according to an embodiment of the present invention. [Figure 31] This is a schematic diagram of a terminal device according to an embodiment of the present invention. [Figure 32] This is a schematic diagram of a network device according to an embodiment of the present invention. [Modes for carrying out the invention]

[0018] The above and other features of the present invention will become apparent from the following description. Specific embodiments of the present invention are disclosed in detail in the specification and drawings, and some embodiments in which the principles of the present invention can be employed are shown. However, the present invention is not limited to the embodiments described. The present invention includes all modified, altered and equivalent versions within the scope of the appended claims. Embodiments of the present invention will be described below with reference to the drawings. These embodiments are merely illustrative and do not limit the present invention.

[0019] In embodiments of the present invention, terms such as "first," "second," etc., are used in titles to distinguish different elements, but do not represent a spatial arrangement or temporal order of these elements, and these elements are not limited to these terms. The term "and / or" includes any one or more of the terms listed in the relevant list and all combinations thereof. The terms "include," "comprehensible," "have," etc., mean the presence of the listed features, elements, components, or components, but do not exclude the presence or addition of one or more other features, elements, components, or components.

[0020] In the embodiments of the present invention, singular nouns such as "one" and "the" should be understood broadly as "one type" or "one category," including plural forms, and not limited to "one." Furthermore, the term "the foregoing" should be understood to include both singular and plural forms unless the context explicitly indicates otherwise. Also, unless the context explicitly indicates otherwise, the term "as described" should be understood as "at least partially described," and the term "based on" should be understood as "based on at least partially."

[0021] In embodiments of the present invention, the terms "communication network" or "wireless communication network" may mean a network conforming to any communication standard such as Long Term Evolution (LTE), Advanced Long Term Evolution (LTE-A, LTE-Advanced), Wideband Code Division Multiple Access (WCDMA®), or High-Speed ​​Packet Access (HSPA).

[0022] Furthermore, communication between devices in a communication system may be carried out according to a communication protocol of any stage, and such communication protocol may include, but is not limited to, 1G (generation), 2G, 2.5G, 2.75G, 3G, 4G, 4.5G, and 5G, New Radio (NR), and / or other currently known communication protocols or other communication protocols to be developed in the future.

[0023] In embodiments of the present invention, the term "network device" means, for example, a device within a communication system that allows a terminal device to access the communication system and provides services to said terminal device. A network device may include, but is not limited to, a base station (BS), access point (AP), transmission / reception point (TRP), broadcast transmitter, mobile management entity (MME), gateway, server, radio network controller (RNC), base station controller (BSC), etc.

[0024] Here, base stations may include, but are not limited to, node B (NodeB or NB), evolutionary node B (eNodeB or eNB), and 5G base stations (gNB), as well as remote radio heads (RRH), remote radio units (RRU), relays, or low-power nodes (e.g., femto, pico). The term “base station” may also include some or all of their functions, and each base station may provide communication coverage to a specific geographic area. The term “cell” may mean a base station and / or its coverage area, depending on the context in which the term is used.

[0025] In embodiments of the present invention, the terms "User Equipment" (UE) or "Terminal Equipment" (TE) refer to equipment that accesses a communication network and receives network services, for example, via a network device. Terminal equipment may be fixed or mobile and may be referred to as a mobile station (MS), terminal, subscriber station (SS), access terminal (AT), station, etc.

[0026] Here, terminal devices may include, but are not limited to, mobile phones (cellular phones), personal digital assistants (PDAs), radio modulators / demodulators, wireless communication devices, handheld devices, machine-type communication devices, laptop computers, cordless phones, smartphones, smartwatches, digital cameras, and the like.

[0027] Furthermore, in scenarios such as the Internet of Things (IoT), the user device may be a monitoring or measurement device or apparatus, and may include, but is not limited to, machine-type communication (MTC) terminals, in-vehicle communication terminals, industrial wireless devices, surveillance cameras, device-to-device (D2D) terminals, and machine-to-machine (M2M) terminals.

[0028] Furthermore, the terms “Network side” or “Network device side” mean the side of the network, which may be a base station or include one or more of the above-mentioned network devices. The terms “User side” or “Terminal side” or “Terminal device side” mean the side of the user or terminal, which may be a UE or include one or more of the above-mentioned terminal devices. In this specification, unless otherwise specified, “device” may mean network device or terminal device.

[0029] In the following explanation, the terms “uplink control signal” and “uplink control information (UCI)” or “physical uplink control channel (PUCCH)” may be substituted for each other, unless to avoid confusion. The terms “uplink data signal” and “uplink data information” or “physical uplink shared channel (PUSCH)” may be substituted for each other. “Cell” and “carrier” and “serving cell” and “carrier component” may be substituted for each other. The terms “downlink control signal” and “downlink control information (DCI)” or “physical downlink control channel (PDCCH)” may be substituted for each other. The terms “downlink data signal” and “downlink data information” or “physical downlink shared channel (PDSCH)” may be substituted for each other. DCI and DCI format may be substituted for each other.

[0030] Furthermore, the transmission or reception of PUSCH may be understood as the transmission or reception of uplink data carried by PUSCH, the transmission or reception of PUCCH may be understood as the transmission or reception of uplink information (e.g., UCI) carried by PUCCH, and the transmission or reception of PRACH may be understood as the transmission or reception of preamble carried by PRACH. The transmission or reception of PDSCH may be understood as the transmission or reception of downlink data carried by PDSCH, and PDCCH may be understood as the transmission or reception of downlink information (e.g., DCI) carried by PDCCH.

[0031] In embodiments of the present invention, the upper-layer signaling may be, for example, a radio resource control (RRC) signaling. The RRC signaling includes, for example, an RRC message, and includes, for example, a master information block (MIB), system information, a dedicated RRC message, or an RRC information element (RRC IE), or an information field (or an information field contained in an information field) included in the RRC message or RRC information element. The upper-layer signaling may also be, for example, a medium access control (MAC) signaling, or may be referred to as a MAC control element (MAC CE). However, the present invention is not limited to these.

[0032] The following describes a scenario of an embodiment of the present invention with reference to an example, but the present invention is not limited thereto.

[0033] Figure 1 is a schematic diagram of a communication system according to an embodiment of the present invention, schematically showing examples of terminal devices and network devices. As shown in Figure 1, the communication system 100 may include a network device 101 and terminal devices 102 and 103. For the sake of explanation, Figure 1 is described using two terminal devices and one network device as an example, but embodiments of the present invention are not limited thereto.

[0034] In embodiments of the present invention, existing services or services that can be implemented in the future can be provided between the network device 101 and the terminal devices 102 and 103. For example, these services include, but are not limited to, enhanced mobile broadband (eMBB), massive machine type communication (mMTC), ultra-reliable and low-latency communication (URLLC), and related communications for terminal devices with reduced capabilities.

[0035] Although Figure 1 shows that both terminal devices 102 and 103 are located within the coverage area of ​​network device 101, the present invention is not limited to this. Neither of the two terminal devices 102 and 103 are located within the coverage area of ​​network device 101, or one terminal device 102 may be located within the coverage area of ​​network device 101 and the other terminal device 103 may be located outside the coverage area of ​​network device 101.

[0036] The PDCCH candidate is determined based on the CORESET configuration and SS configuration.

[0037] The following provides an illustrative explanation of the CORESET configuration, SS configuration, and the method for determining PDCCH candidates.

[0038] The CORESET configuration is as follows:

[0039] CORESET configurations other than CORESET#0 may include at least the following information fields.

[0040] controlResourceSetId indicates the CORESET index.

[0041] frequencyDomainResources indicates CORESET resources in the frequency domain.

[0042] The duration refers to the CORESET duration, for example, the duration of symbolic data.

[0043] cce-REG-MappingType indicates how CCEs are mapped to REGs, for example, whether interleaved mapping or non-interleaved mapping is used.

[0044] `precoderGranularity` indicates the mapping method for DMRS in a PDCCH. For example, if `precoderGranularity` indicates allContiguousRBs, the corresponding DMRS associated with the PDCCH is a broadband mapping, meaning the DMRS associated with the PDCCH occupies all REGs in the CORESET. Otherwise, the corresponding DMRS associated with the PDCCH is a narrowband mapping, meaning the DMRS associated with the PDCCH occupies only the REGs occupied by the PDCCH.

[0045] Furthermore, other related information fields in the configuration of CORESETs other than CORESET#0 may refer to prior art, and the present invention is not limited thereto.

[0046] Figure 2A is a schematic diagram of a CORESET according to an embodiment of the present invention. A Control Channel Element (CCE) assigned by a PDCCH channel resource is a fundamental element constituting a PDCCH. In NR, one CCE occupies six REGs, and each REG corresponds to 12 Resource Elements (REs) on a physical resource block (RB). Here, one REG has nine PDCCH data REs and three DRMS ​​REs, so REG0 and REG1 shown in Figure 2 have 18 PDCCH data REs and 6 DRMS ​​REs. Methods such as interleaved mapping and non-interleaved mapping can be used for mapping between CCEs and REGs, but the present invention is not limited to this, and prior art may be referenced for specific mapping methods.

[0047] Furthermore, the number of CCEs in PDCCH is referred to as the aggregation level (AL). When the network device 101 specifically transmits PDCCH, it may decide what aggregation level to use to transmit the control information depending on the actual radio channel environment. For example, if the radio channel environment is relatively poor, better demodulation performance can be obtained by using a high aggregation level. If the radio channel environment is relatively good, a low aggregation level can be used.

[0048] As shown in Figure 2A, for example, the relevant parameters in the CORESET configuration are: (outside 1) TIFF0007913596000001.tif10170, (outside 2) This is TIFF0007913596000002.tif10170. That is, assuming that one CORESET occupies six RBs in the frequency domain and two symbols in the time domain, and that AL=2 for a total of two CCEs in the current CORESET, then one transmitted PDCCH contains two CCEs, and when mapping CCE-to-REG, the interleaved mapping method and the non-interleaved mapping method are identical.

[0049] The SS configuration is as follows:

[0050] The configuration of SS other than SS#0 may include at least the following information fields.

[0051] The searchSpaceId indicates the SS index.

[0052] monitoringSlotPeriodicityAndOffset indicates the PDCCH monitoring period (in slots) and the slot offset from the start of the monitoring period until the search space is actually detected.

[0053] The controlResourceSetId indicates the CORESET index corresponding to the SS index.

[0054] The duration indicates the number of consecutive PDCCH monitoring slots in the PDCCH monitoring cycle, where a PDCCH monitoring slot represents the time slot in which a PDCCH candidate needs to be monitored.

[0055] `monitoringSymbolsWithinSlot` indicates the start symbol for a PDCCH monitoring occasion in a single PDCCH monitoring slot. For example, it has 14 bits in total, with the most significant bit indicating the first symbol, and so on.

[0056] nrofCandidates indicates the number of PDCCH candidates, for example, the number of corresponding PDCCH candidates for different ALs.

[0057] `searchSpaceType` indicates the type of search space, such as a common search space (CSS) or a device-specific search space (UE-specific search space: USS).

[0058] Figure 2B is a schematic diagram of a PDCCH monitoring occasion according to an embodiment of the present invention. Figure 2B is a schematic diagram of the PDCCH monitoring example of the present invention.

[0059] As shown in Figure 2B, the following assumptions are made.

[0060] The CORESET corresponding to controlResourceSetId contains two symbols.

[0061] Periodicity: 4 slots Duration: 2 slots monitoringSymbolsWithinSlot:10001000100000.

[0062] The terminal device can determine the PDCCH monitoring occasion.

[0063] Furthermore, prior art may be referenced for other related information fields in the configuration of SS other than SS#0, and the present invention is not limited thereto.

[0064] For a single search space configuration and its associated CORESET configuration, the terminal device can determine which time-frequency domain resources to monitor the PDCCH. To reduce the complexity of blind detection of PDCCH by the UE, the search space configuration is further provided with configuration information for configuring the number of PDCCH candidates. Furthermore, when the UE blindly detects a PDCCH / DCI on one PDCCH monitoring occasion in a single search space, it can determine that one or more aggregation levels each correspond to multiple PDCCH candidates, and each PDCCH candidate corresponds to a CCE.

[0065] For example, the active DL BWP of the subcarrier spacing μ of serving cell f, slot n s,f μ Regarding the relevant CORESET p, the PDCCH candidate for aggregation level L in the search space (or set of search spaces) s. (Outside 3) The CCE index corresponding to TIFF0007913596000003.tif8170 is given by the following formula:

[0066]

number

[0067] for example, (Outside 11) TIFF0007913596000012.tif10170, (Outside 12) Assuming TIFF0007913596000013.tif10170, the number of PDCCH candidates in each AL of each serving cell (there are a total of two service cells) (assuming that each serving cell consists only of AL=4,8) is as shown in Table 1. According to equation (1), the CCE index corresponding to each PDCCH candidate corresponding to each serving cell is as shown in Figure 3.

[0068] In conventional technology, one serving cell can schedule two serving cells, but one DCI can only schedule one serving cell. For example, (Outside 13) TIFF0007913596000014.tif11170, (Outside 14) Assuming TIFF0007913596000015.tif9170, the number of PDCCH candidates in each AL for each serving cell (there are a total of two service cells) is as shown in Table 1. The CCEs for the PDCCH candidates corresponding to each serving cell are as shown in Figure 3. Table 1. Number of AL PDCCH candidates for each serving cell

[0069] [Table 1] The above method is designed for one DCI to schedule only one cell, configuring and determining a corresponding set of PDCCH candidates for each serving cell, and sending / receiving DCIs to schedule PDSCH / PUSCH for each serving cell with the PDCCH candidates in the corresponding set.

[0070] In the technology for monitoring PDCCH candidates, limits are defined for a single cell, including the maximum number of PDCCH candidates and the maximum number of non-overlapping CCEs within a single time unit. This time unit can be, for example, one slot, a span (containing some symbols within one slot), or a slot group (containing multiple slots). Assuming the first time unit is one slot, the maximum number of PDCCH candidates is... (Outside 15) Limitations and maximum number of unique CCEs for TIFF0007913596000017.tif11170 (Outside 16) There is a limit in TIFF0007913596000018.tif10170, where μ represents the SCS of a PDCCH and slot means one slot corresponding to that μ. If the number of configured PDCCH candidates and the number of non-overlapping CCEs exceeds the above limit, it is called overbooking. The terminal device discards the search space set of the highest index until the PDCCH candidate and non-overlapping CCE limit is met. In the R15 NR system, a slot-level limit on the number of PDCCH candidates and non-overlapping CCEs is adopted; that is, the network device or terminal device determines whether the above limit is met within a single slot, and if not, discards the search space set of the highest index within that slot. In the R16 / R17 NR system, a span-level / slot-group-level limit on the number of PDCCH candidates and non-overlapping CCEs may also be adopted. Accordingly, the network device or terminal device determines whether the corresponding PDCCH candidate number (maximum) limit and the non-overlapping CCE number (maximum) limit are met within a single span / slot group. If they are not met, the search space set of the highest index within that span / slot group is discarded.

[0071] The NR system supports single-carrier or carrier aggregation (CA / DC). Currently, only the case where one DCI can schedule only one cell is considered, so the number of PDCCH candidates and the number of non-overlapping CCEs are statistically or allocated per cell. The following is an example based on the slot level. For example, for one cell, within one slot (PDCCH monitoring slot), terminal devices are ordered in ascending order of CSS, USS index (which is unrelated to the order of specific monitoring time domains in terms of priority), (Outside 17) TIFF0007913596000019.tif13170 or fewer non-duplicate CCE monitoring (outside 18) The terminal device monitors PDCCH candidates below TIFF0007913596000020.tif13170. That is, for each cell, the terminal device prioritizes monitoring CSS(s) and USS(s) with small index values, and the total number of PDCCH candidates included in the USS, USS(s) with index values ​​smaller than that of the USS, and CSS is determined by the number of PDCCH candidates in one USS and the number of non-overlapping CCEs. (Outside 19) The total number of CCEs that exceeds TIFF0007913596000021.tif14170 and / or do not overlap (outside 20) If the number exceeds TIFF0007913596000022.tif14170, the PDCCH candidate for the USS will not be monitored, or the PDCCH candidate will not be monitored in the USS, or a PDCCH candidate will not be assigned for the USS (for the USS).

[0072] However, the monitoring method described above is for the case where a single DCI can only schedule one cell. Currently, when a single DCI schedules multiple serving cells, there is no way to determine which PDCCH candidate to monitor in which search space (set).

[0073] The following will be explained with reference to the examples.

[0074] <Example 1> An embodiment of the present invention provides a data reception method, which will be described from the perspective of the terminal device.

[0075] Figure 4 is a schematic diagram of an example of a data receiving method according to an embodiment of the present invention. As shown in Figure 4, the method includes the following steps.

[0076] Step 401: The terminal device assigns a PDCCH candidate to a first search space, which is used to schedule cells in a first set.

[0077] Step 402: The terminal device receives a DCI in the first search space, which is used to schedule at least two cells in the first set.

[0078] In some embodiments, a terminal device receives search space configuration information and CORESET configuration information transmitted by a network device, and based on this search space configuration information and CORESET configuration information, can determine the set of PDCCH candidates included in the first search space, or the set of PDCCH candidates included in the CORSET corresponding to the first search space, that is, it can determine the CCE index (CCE start position and number of CCEs) in the CORSET for each PDCCH candidate in the set of PDCCH candidates. The first search space is used to schedule cells in the first set. The first search space is either in a cell in the first set or not in any cell in the first set. At least one PDCCH candidate in the PDCCH candidate set is used to transmit the DCI, which schedules at least two cells in the first set. The first search space may be a terminal device-specific search space (USS) or a common search space (CSS).

[0079] In some embodiments, the use of a first search space to schedule cells in a first set means that the UE monitors PDCCH candidates in the first search space to receive DCIs for scheduling one or more cells in the first set, without exceeding the PDCCH candidate limit and the non-overlapping CCE limit. Accordingly, the network device can map or transmit DCIs for scheduling one or more cells in the first set to PDCCH candidates in the first search space. After determining the set of PDCCH candidates to be included in the first search space, in step 401, it is necessary to assign PDCCH candidates to the first search space. For example, it is determined whether to assign a PDCCH candidate to the first search space (i.e., whether to monitor the PDCCH candidate in the first search space, or whether to monitor the PDCCH candidate in the first search space), and / or the number N of PDCCH candidates to be assigned to the first search space (or the number N of PDCCH candidates to be monitored in the first search space), or whether to monitor the PDCCH candidates in the PDCCH candidate set, or which PDCCH candidates in the PDCCH candidate set to monitor. In step 402, the assigned PDCCH candidate corresponding to the first search space is monitored in order to receive the DCI that is mapped to the above PDCCH candidate and transmitted.

[0080] For the sake of clarity, the following will first explain the concepts of set, group, combination, and cell in this invention.

[0081] In some embodiments, the first set comprises all the cells of a first search space for scheduling and may include a scheduling cell and at least one scheduled cell (i.e., the first search space lies on one cell in the first set, and that cell is the scheduling cell), or it may include at least two scheduled cells (i.e., the first search space does not reside in any cell in the first set). If a scheduling cell is included, the scheduling cell can schedule PDSCH and / or PUSCH on the scheduled cells, or the scheduling cell can schedule its own PDSCH and / or PUSCH (self-scheduling). The cell on which the first search space lies may be a primary or secondary cell, and the scheduling cell and scheduled cell may be primary or secondary cells, and embodiments of the present invention are not limited thereto.

[0082] In some embodiments, being used to schedule a cell may be referred to as being used to schedule PDSCH and / or PUSCH on a cell, or a DCI received on a cell scheduling PDSCH and / or PUSCH on a cell. Alternatively, a DCI used to schedule a cell may be referred to as a DCI used to schedule PDSCH and / or PUSCH on a cell. A DCI used to schedule a PDSCH may be referred to as a downlink assignment (DL assignment), and a DCI used to schedule a PUSCH may be referred to as an uplink grant (UL grant).

[0083] In some embodiments, the first cell means any cell in the first set, the second cell means the first reference cell in the first set, the first reference cell is the reference cell used to assign PDCCH candidates, and different second cells may or may not be related to the same cell. The third cell means the second reference cell in the first set, the second reference cell is the reference cell used to determine the cells in the first set, and different third cells may or may not be related to the same cell. This third cell, second cell and first cell may be the same or different. The first group and second group mean subsets (divided in any way) of the first set, and the first group and second group may be understood as specific subsets. Cells within a combination may be scheduled simultaneously (in one step) by the same DCI, the first group and / or first combination is used when assigning PDCCH candidates, the second group and / or second combination is used when determining PDCCH candidates, the first group and the second group may be the same or different, and the first combination and the second combination may be the same or different. A group or combination may contain one or more cells, different first groups may have common parts or not, different first combinations may have common parts or not, different second groups may have common parts or not, and different second combinations may have common parts or not. Different second groups or second combinations may or may not contain the same cells.

[0084] The following describes the PDCCH candidate set included in the first search space (containing a total of M4 PDCCH candidates).

[0085] In some embodiments, the PDCCH candidate set includes one or more first PDCCH candidate sets, where different first PDCCH candidate sets may or may not include PDCCH candidates having the same CCE. Here, each first PDCCH candidate set is for a single cell or a group of cells. For example, all first PDCCH candidate sets are for a single cell, or all first PDCCH candidate sets are for a group of cells, or some PDCCH candidate sets are for a single cell and others are for a group of cells.

[0086] For example, the first PDCCH candidate set is for the first set, or the first cell in the first set, or the third cell in the first set, or the second group in the first set, or the second combination in the first set, or the second combination set. Alternatively, the first PDCCH candidate set is divided into the first set, or the first cell in the first set, or the third cell in the first set, or the second group in the first set, or the second combination in the first set, or the second combination set.

[0087] For example, the first set means that it includes the first set, and / or all first cells in the first set, and / or all third cells in the first set, and / or all second groups in the first set, or all PDCCH candidates corresponding to all second combinations in the first set or all second groups.

[0088] The term for the first cell means that it includes all PDCCH candidates corresponding to the first cell.

[0089] The term for the third cell means that it includes all PDCCH candidates corresponding to the third cell.

[0090] For the second group, this means including the second group, or all first cells in the second group, or all third cells in the second group, or all PDCCH candidates corresponding to the second combination in the second group.

[0091] For the first set or the second combination in the second group, it means that all candidates corresponding to the second combination are included.

[0092] Here, a PDCCH candidate corresponding to a first cell refers to a PDCCH candidate for sending a DCI to schedule the first cell. Here, scheduling a first cell includes scheduling the first cell alone and / or scheduling the first cell together with other cells in the first set. Different PDCCH candidates corresponding to first cells may or may not have common parts.

[0093] A PDCCH candidate corresponding to a third cell means a candidate for sending a DCI for scheduling the third cell and / or cells associated with the third cell. Here, scheduling the third cell and / or cells associated with the third cell includes scheduling only the third cell and / or cells associated with the third cell, and / or scheduling the third cell and / or cells associated with the third cell together with other cells in the first set. PDCCH candidates corresponding to different third cells may or may not have common parts.

[0094] A PDCCH candidate corresponding to the first set means a candidate to send a DCI for scheduling a cell in the first set, or a candidate to send a DCI for scheduling the first set, or a candidate to send a DCI for scheduling any second combination of the first set, or a candidate to send a DCI for scheduling any second set of the first set.

[0095] A PDCCH candidate corresponding to a second group means a PDCCH candidate for sending a DCI to schedule cells in the second group, or a PDCCH candidate for sending a DCI to schedule the second group, or a PDCCH candidate for sending a DCI to schedule any second combination of the second group. Here, scheduling cells in the second group includes scheduling only cells in the second group, and / or scheduling cells in the second group and other cells in the first set simultaneously.

[0096] The PDCCH candidate corresponding to the second combination is the PDCCH candidate for sending the DCI to schedule the second combination.

[0097] The following will be explained using examples with reference to the drawings.

[0098] (1) The following describes the first PDCCH candidate set for the first cell with reference to Figures 5 to 8.

[0099] As shown in Figures 5 to 8, the PDCCH candidate set of the first search space includes four first PDCCH candidate sets. First PDCCH candidate set 0: Includes a candidate for sending a DCI to schedule Cell 0. First PDCCH candidate set 1: Includes a PDCCH candidate for sending a DCI to schedule Cell 1. First PDCCH candidate set 2: Includes a PDCCH candidate for sending a DCI to schedule Cell 2. First PDCCH candidate set 3: Includes a PDCCH candidate for sending a DCI to schedule Cell 3. The above sets have a common part.

[0100] As shown in Figures 5 and 6, if one PDCCH candidate corresponds to multiple first cells, the PDCCH candidate sends a DCI to schedule multiple cells simultaneously. As shown in Figures 7 and 8, if one PDCCH candidate corresponds to one first cell, the PDCCH candidate sends a DCI to schedule one cell or combination of multiple cells, and that one cell or combination is not any cell or any combination of multiple cells.

[0101] (2) The following describes the first PDCCH candidate set for the third cell with reference to Figures 9 to 12.

[0102] As shown in Figures 9 to 10, the PDCCH candidate set of the first search space includes two first PDCCH candidate sets. First PDCCH candidate set 0: includes Cell 0 (third cell 0) and a candidate for sending DCI for scheduling the associated cell. First PDCCH candidate set 1: includes Cell 2 (third cell 1) and a candidate for sending DCI for scheduling the associated cell. Cells associated with different third cells may or may not have common parts. The above sets may or may not have common parts.

[0103] As shown in Figure 9, if the above sets have common parts, one third cell and its associated cells are always scheduled simultaneously. That is, cell0&1 are always scheduled simultaneously, and cell2&3 are always scheduled simultaneously; that is, the third cell cannot be scheduled individually via a single DCI. As shown in Figure 10, if the above sets do not have common parts, one third cell and its associated cells may be scheduled simultaneously or individually. That is, the third cell or its associated cells may be scheduled individually via a single DCI.

[0104] As shown in Figures 11 and 12, the PDCCH candidate set of the first search space includes the first PDCCH candidate set, which consists of PDCCH candidates for sending DCIs for scheduling Cell 0 (the third cell 0) and its associated cells.

[0105] (3) The following describes the first PDCCH candidate set for the second combination with reference to Figures 13 to 15.

[0106] As shown in Figures 13 and 14, the PDCCH candidate set of the first search space includes two first PDCCH candidate sets. First PDCCH candidate set 0: includes a candidate for sending a DCI to schedule combination 0. First PDCCH candidate set 1: includes a candidate for sending a DCI to schedule combination 1. Sets 0 and 1 may or may not have common parts. As shown in Figure 13, they have common parts, with combination 0 including cell 0 & 1 and combination 1 including cell 2 & 3. As shown in Figure 14, they do not have common parts, with combination 0 including cell 0 & 2 and combination 1 including cell 1 & 3.

[0107] As shown in Figure 15, the PDCCH candidate set of the first search space shown in the figure below contains one first PDCCH candidate set. The first PDCCH candidate set is a PDCCH candidate for sending DCI to schedule the cell of combination 0, which includes cell0, 1, 2, and 3.

[0108] (4) The following describes the first PDCCH candidate set for the second group with reference to Figures 16 to 22.

[0109] As shown in Figures 16 to 20, the PDCCH candidate set of the first search space shown in the figure below includes two first PDCCH candidate sets. First PDCCH candidate set 0: Includes PDCCH candidates for sending DCIs to schedule cells in group 0. First PDCCH candidate set 1: Includes PDCCH candidates for sending DCIs to schedule cells in group 1. Sets 0 and 1 may or may not have common parts.

[0110] As shown in Figures 16 to 18, sets 0 and 1 have a common part. Here, the PDCCH candidate in the common part sends cells in the union for scheduling group 0 (cell 0 & 1) and group 1 (cell 2 & 3). As shown in Figure 16, one cell in group 0 and one cell in group 1 may be scheduled by the same DCI, and as shown in Figures 17 and 18, one cell in group 0 and one cell in group 1 cannot be scheduled by the same DCI.

[0111] As shown in Figures 19 and 20, sets 0 and 1 have no common parts. As shown in Figure 19, group 0 includes cell 0 and 2, and group 1 includes cell 1 and 3. As shown in Figure 20, the PDCCH candidate in set 0 is used to send DCIs to schedule cells or group 0, and the PDCCH candidate in set 1 is used to send DCIs to schedule cells or group 1.

[0112] As shown in Figures 21 and 22, the PDCCH candidate set of the first search space includes one first PDCCH candidate set. The first PDCCH candidate set includes a PDCCH candidate for sending DCIs to schedule cells in group 0 (cells 0, 1, 2, and 3).

[0113] (5) The following describes the first PDCCH candidate set for the first cell and the second combination with reference to Figure 23.

[0114] As shown in Figure 23, the PDCCH candidate set of the first search space includes four first PDCCH candidate sets. First PDCCH candidate set 0: Includes a PDCCH candidate for sending a DCI to schedule Cell 0 (first cell 0). First PDCCH candidate set 1: Includes a PDCCH candidate for sending a DCI to schedule Cell 1 (first cell 1). First PDCCH candidate set 2: Includes a PDCCH candidate for sending a DCI to schedule combination 0 (Cell 0 & 1). First PDCCH candidate set 3: Includes a PDCCH candidate for sending a DCI to schedule combination 1 (Cell 2 & 3). The above sets may or may not have common parts.

[0115] (6) The following describes the first PDCCH candidate set for the first cell and the second group with reference to Figure 24.

[0116] As shown in Figure 24, the PDCCH candidate set of the first search space includes four first PDCCH candidate sets. First PDCCH candidate set 0: Includes a PDCCH candidate for sending a DCI to schedule Cell 0 (first cell 0). First PDCCH candidate set 1: Includes a PDCCH candidate for sending a DCI to schedule Cell 1 (first cell 1). First PDCCH candidate set 2: Includes a PDCCH candidate for sending a DCI to schedule group 0. First PDCCH candidate set 3: Includes a PDCCH candidate for sending a DCI to schedule group 1. The above sets may or may not have common parts. Groups 0 and 1 may or may not include Cell 0 and / or 1. For example, if group 0 includes Cell 0, and the PDCCH candidates in the first PDCCH candidate set corresponding to group 0 are not used to schedule Cell 0 individually, or if there is a common part with the first PDCCH candidate set corresponding to Cell 0, then only the PDCCH candidates in the common part may be used to schedule Cell 0 individually.

[0117] The above explanation uses (1) to (6) as an example, and aggregate level L=2 as an example, but the embodiments of the present invention are not limited to these, and further explanation is omitted here.

[0118] The above explains that when determining a PDCCH candidate set, each first PDCCH candidate set is divided into single cells and / or cell groups at a granularity. For example, a first PDCCH candidate set is a set of a first set, or a first cell in the first set, or a third cell in the first set, or a second group in the first set, or a set of a second combination in the first set or the second group.

[0119] When assigning PDCCH, a single cell or group of cells may also be used as the granularity. For example, PDCCH candidates may be assigned to one or more of the following: a first set, a first cell (in the first set), a second cell (in the first set), a first group (in the first set), a first combination (in the first set or the first set), or a set of first combinations (in the first set or the first group).

[0120] In some embodiments, the dimension for determining PDCCH candidates and the dimension for assigning PDCCH candidates are the same. For example, if the first set of PDCCH candidates is determined using the first set as the dimension, then the PDCCH candidates are assigned using the first set as the dimension. It should be noted that the embodiments of the present invention are not limited to those described here, but are merely illustrative.

[0121] In some embodiments, the terminal device assigns a PDCCH character based on one or more of the following parameters: a first parameter, a second parameter, a third parameter, a fourth parameter, a fifth parameter, and a sixth parameter. The first parameter and / or the second parameter and / or the third parameter and / or the fourth parameter and / or the fifth parameter and / or the sixth parameter are for a first set, a first cell in the first set, a second cell in the first set, a first group in the first set, a first combination in the first set or first group, or a first set of combinations (in the first set or first group).

[0122] The following explains the parameters mentioned above.

[0123] In some embodiments, the first parameter M1 represents the first PDCCH issue number, where the first PDCCH issue number is the number of assignable PDCCH issues. The first parameter M1 is for a first set, a first cell in the first set, a second cell in the first set, a first group in the first set, a first combination in the first set or first group, or a first set of combinations (in the first set or first group). For example, the first parameter is determined as a granularity of a first set, a first cell in the first set, a second cell in the first set, a first group in the first set, a first combination in the first set or first group, or a first set of combinations (in the first set or first group).

[0124] In some embodiments, the second parameter M2 represents the second PDCCH candidate number, which is the number of PDCCH candidates assigned before the first search space. The second parameter M2 is for a first set, a first cell in the first set, a second cell in the first set, a first group in the first set, a first combination in the first set or first group, or a set of first combinations (in the first set or first group). For example, the second parameter may be the number of PDCCH candidates assigned before the first search space on the first set, a first cell in the first set, a second cell in the first set, a first group in the first set, a first combination in the first set, or a set of first combinations (in the first set or first group), and the second parameter M2 is equal to the sum of the number of PDCCH candidates assigned to each search space before the first search space.

[0125] In some embodiments, the third parameter M3 represents the third PDCCH candidate number, which is the number of PDCCH candidates that can be assigned to the first search space. The third parameter M3 can be a first set, a first cell in the first set, a second cell in the first set, a first group in the first set, a first combination in the first set or first group, or a set of first combinations (in the first set or first group). For example, the third parameter M3 may be equal to the number of PDCCH candidates remaining after subtracting the number of PDCCH candidates previously assigned to the first search space from the number of assignable PDCCH candidates.

[0126] In some embodiments, the fourth parameter M4 represents the fourth PDCCH candidate number, which is the number of PDCCH candidates contained in the first search space. The fourth parameter M4 is for a first set, a first cell in the first set, a second cell in the first set, a first group in the first set, a first combination in the first set or the first set, or a first set of combinations (in the first set or the first group).

[0127] The following describes how to count the number of PDCCH candidates (the fourth parameter) in the PDCCH candidate set contained in the first search space.

[0128] In some embodiments, the terminal device assigns a PDCCH candidate to a first cell or second cell or first group in a first set, at least one cell in the first cell or second cell or first group is included in a plurality of second groups or second combinations, and a fourth parameter for the first cell or second cell or first group is determined based on a first set of PDCCH candidates corresponding to the plurality of second groups or second combinations.

[0129] For example, the fourth parameter is equal to the number of PDCCH candidates in the union of the first PDCCH candidate sets corresponding to multiple second groups or second combinations (the second PDCCH candidate set), that is, it is incremented by 1 for each PDCCH candidate with the same CCE in each first PDCCH candidate set. Alternatively, it is equal to the sum of the number of PDCCH candidates in each of the first PDCCH candidate sets corresponding to multiple second groups or second combinations, and each PDCCH candidate with the same CCE in each first PDCCH candidate set is counted accordingly.

[0130] In some embodiments, the terminal device assigns PDCCH candidates to a first group in a first set, the first group comprising a plurality of second groups or a second combination, and the fourth parameter for the first group is determined based on the first set of PDCCH candidates corresponding to the plurality of second groups or a second combination.

[0131] For example, the fourth parameter is equal to the number of PDCCH candidates in the union of the first PDCCH candidate sets corresponding to multiple second groups or second combinations (the second PDCCH candidate set), that is, it is incremented by 1 for each PDCCH candidate with the same CCE in each first PDCCH candidate set. Alternatively, it is equal to the sum of the number of PDCCH candidates in each of the first PDCCH candidate sets corresponding to multiple second groups or second combinations, and each PDCCH candidate with the same CCE in each first PDCCH candidate set is counted accordingly.

[0132] The following describes the first, second, third, and fourth parameters mentioned above, with reference to Figure 25. As shown in Figure 25, USS2 is the first search space, CSS(s) (including one or more), USS0, and USS1 are the search spaces preceding the first search space, the number of PDCCH candidates allocated for CSS is N1, the number of PDCCH candidates allocated for USS0 is N2, and the number of PDCCH candidates allocated for USS1 is N3. The first parameter M1 is the number of assignable PDCCH candidates, determined for a first set, a first cell in the first set, a second cell in the first set, a first group in the first set, or a first combination in the first set or first group. The second parameter M2 is the number of PDCCH candidates already allocated before the first search space, i.e., equal to N1 + N2 + N3. The third parameter M3 is the number of PDCCH candidates that can be assigned to the first search space, i.e., equal to M1-M2. The fourth parameter M4 is the number of PDCCH candidates included in the determined first search space.

[0133] In some embodiments, the first parameter may be configured, or the fifth parameter may be used to determine the first parameter and / or the sixth parameter may be used to determine the fourth parameter, and the fifth and sixth parameters may be the same or different. The fifth parameter and / or the sixth parameter may be predefined or configured. The fifth parameter and / or the sixth parameter may relate to the first group and / or the first combination.

[0134] In some embodiments, the terminal device assigns PDCCH candidates to a first group. The terminal device determines a first parameter for the first group based on a fifth parameter and / or the number of cells in the first group and / or the number of PDCCHs that can be assigned to a cell. For example, the number of PDCCHs that can be assigned to a single cell. (outside 21) TIFF0007913596000023.tif11170 (predefined or configured) has a first parameter for the first group determined based on the number of cells N in the first group, (outside 22) TIFF0007913596000024.tif9170 (Equation (2)), or the fifth parameter is a parameter related to the first group, and the first parameter for the first group is determined based on the fifth parameter. For example, the fifth parameter may be a scaling factor related to a predefined or configured first group, and the scaling factor and (outside 23) TIFF0007913596000025.tif10170 and / or (outside 24) The first parameter is determined based on the product with TIFF0007913596000026.tif10170. Also, for example, the first parameter is, (Outside 25) TIFF0007913596000027.tif12170 or (outside 26) This is equal to TIFF0007913596000028.tif13170, where P1 is the number of cells in the first group, and a i This is the value of the fifth parameter corresponding to cell i in the first group. Also, for example, the fifth parameter is (outside 27) TIFF0007913596000029.tif11170 or (outside 28) may be a predefined or configured scaling factor for adjusting TIFF0007913596000030.tif9170, and the adjusted (Outside 29) TIFF0007913596000031.tif9170 or (Outside 30) TIFF0007913596000032.tif10170 can be substituted into Equation (2) to determine the first parameter. The above μ represents the subcarrier spacing SCS of PDCCH, and T Unit means one time unit corresponding to said μ, and the time unit is, for example, one slot, one span (including some symbols in one slot), or one slot group (including a plurality of slots). (Outside 31) TIFF0007913596000033.tif10170 represents the maximum number of PDCCH candidates for one cell in a predefined time unit T Unit , (Outside 32) TIFF0007913596000034.tif10170 represents the maximum number of PDCCH candidates for one cell in a time unit T determined based on cell configuration (e.g., the number of configured downlink cells) Unit .

[0135] In some embodiments, the terminal device allocates PDCCH candidates for a first combination. The terminal device determines the first parameter for the first combination based on a fifth parameter and / or the number of cells in the first combination and / or the number of PDCCHs that can be allocated to one cell. The determination method is the same as that for allocating PDCCH candidates to a first group, and the description thereof is omitted herein.

[0136] The method for determining a fourth parameter based on a sixth parameter is the same, for example, the sixth parameter is a scaling factor. The description thereof is omitted herein.

[0137] In the above embodiments, the first, second, third, and fourth parameters are all related parameters representing the number of PDCCH candidates, but the embodiments of the present invention are not limited thereto. The first, second, third, and fourth parameters may also be parameters representing the number of non-overlapping CCEs, and the above-mentioned number of PDCCH candidates may be replaced with the number of non-overlapping CCEs, and the explanation of this is omitted here.

[0138] In some embodiments, the method may further include a step in which the terminal device reports its capabilities, which include the number of PDCCH cells and / or the number of first groups and / or the number of first combinations that the terminal device can monitor. Network devices may refer to the capabilities of the terminal device when making the relevant configuration. For example, a network device may (Outside 33) TIFF0007913596000035.tif10170, (Outside 34) When configuring the fifth and sixth parameters of TIFF0007913596000036.tif9170, you may refer to the capabilities of the terminal device, etc.

[0139] The following describes how PDCCH candidates are assigned.

[0140] In some embodiments, the terminal device monitors for PDCCH candidates in the first search space if the third parameter of the first search space is greater than or equal to the fourth parameter. For example, the third parameter for a first set, a first cell in the first set, a second cell in the first set, a first group in the first set, or a first combination in the first set is greater than or equal to the fourth parameter. Thus, PDCCH candidates can be monitored in the first search space.

[0141] For example, if M4 is less than or equal to M3 (for example, the number of remaining assignable PDCCH candidates is greater than or equal to the number of PDCCH candidates included in the first search space, and / or the number of remaining assignable non-overlapping CCEs is greater than or equal to the number of non-overlapping CCEs included in the first search space), then PDCCH candidates may be monitored in the first search space. That is, M4 PDCCH candidates for monitoring are assigned to the first search space.

[0142] In some embodiments, if the third parameter of the first search space is less than the fourth parameter, the terminal device either monitors for PDCCH candidates in the first search space or does not monitor for PDCCH candidates in the first search space. For example, if the third parameter for a first set, a first cell in the first set, a second cell in the first set, a first group in the first set, or a first combination in the first set is greater than or equal to the fourth parameter, then the device either monitors for PDCCH candidates in the first search space or does not monitor for PDCCH candidates in the first search space.

[0143] For example, if M4 is greater than M3 (for example, the number of remaining assignable PDCCH candidates is less than the number of PDCCH candidates included in the first search space, and / or the number of remaining assignable non-overlapping CCEs is less than the number of non-overlapping CCEs included in the first search space), then no PDCCH candidates are monitored in the first search space. That is, no PDCCH candidates for monitoring are allocated to the first search space, or zero PDCCH candidates are allocated to the first search space. Figure 26 is a schematic diagram of the allocation of PDCCH candidates. As shown in Figure 26, USS2 is the first search space, CSS, USS0, and USS1 are the search spaces prior to the first search space, the number of PDCCH candidates already allocated for CSS is N1, the number of PDCCH candidates already allocated for USS0 is N2, the number of PDCCH candidates already allocated for USS1 is N3, the number of PDCCH candidates allocated prior to the first search space is N1 + N2 + N3 = M2, the third parameter M3 = M1 - M2, M3 is less than M4, and USS2 does not monitor for PDCCH candidates.

[0144] For example, when a terminal device monitors a PDCCH candidate in a first search space, the terminal device monitors a third parameter PDCCH candidate in the first search space. That is, if M4 is greater than M3 (for example, the number of remaining assignable PDCCH candidates is less than the number of PDCCH candidates included in the first search space, and / or the number of remaining assignable non-overlapping CCEs is less than the number of non-overlapping CCEs included in the first search space), then PDCCH candidates may be monitored in the first search space, that is, M3 PDCCH candidates for monitoring may be allocated to the first search space, or M3 PDCCH candidates may be monitored in the first search space. Figure 27 is a schematic diagram of the allocation of PDCCH candidates. As shown in Figure 27, USS2 is the first search space, CSS, USS0, and USS1 are the search spaces prior to the first search space, the number of PDCCH candidates allocated to CSS is N1, the number of PDCCH candidates allocated to USS0 is N2, the number of PDCCH candidates allocated to USS1 is N3, and the number of PDCCH candidates already allocated to the first search space is N1 + N2 + N3 = M2. The third parameter M3 = M1 - M2, where M3 is less than M4, means that PDCCH candidates are monitored in USS2, but only M3 PDCCH candidates in USS2 are monitored.

[0145] According to this embodiment, when scheduling multiple cells via a single DCI, it is possible to support scheduling multiple cells via a single DCI by determining which PDCCH candidate to monitor in which search space. This reduces the burden of DCI monitoring on terminal devices and lowers power consumption and complexity.

[0146] <Example 2> The embodiments of the present invention provide a data transmission method and will be described from the perspective of the network device. Parts that overlap with Embodiment 1 will be omitted from the explanation.

[0147] Figure 28 is a schematic diagram of an example of a data transmission method according to an embodiment of the present invention. As shown in Figure 28, the method includes the following steps.

[0148] Step 2801: The network device transmits a DCI in a first search space. The first search space is used to schedule cells in a first set, and the DCI is used to schedule at least two cells in the first set.

[0149] In some embodiments, the first search space is assigned a PDCCH candidate for sending DCI. For example, a PDCCH candidate is assigned to one or more of the following: a first set, a first cell (in the first set), a second cell (in the first set), a first group (in the first set), a first combination (in the first set or the first group), or a first set of combinations (in the first set or the first group).

[0150] For information on how to assign PDCCH candidates, refer to Example 1. Step 2801 corresponds to steps 401-402 of Example 1, and the explanation of any overlapping content will be omitted.

[0151] According to this embodiment, when scheduling multiple cells via a single DCI, it is possible to support scheduling multiple cells via a single DCI by determining which PDCCH candidate to monitor in which search space. This reduces the burden of DCI monitoring on terminal devices and lowers power consumption and complexity.

[0152] <Example 3> Embodiments of the present invention provide a data receiving device. This device may be, for example, a terminal device, or one or more components configured within a terminal device. Descriptions of aspects similar to those in Embodiment 1 are omitted.

[0153] Figure 29 is a schematic diagram of a data receiving device according to an embodiment of the present invention. As shown in Figure 29, the data receiving device 2900 includes the following parts.

[0154] The processing unit 2901 assigns a PDCCH candidate to a first search space. This first search space is used to schedule cells in a first set.

[0155] The receiving unit 2902 receives the DCI in the first search space. The DCI is used to schedule at least two cells in the first set.

[0156] In some embodiments, the first search space is located in one cell in the first set of cells, or it is not located in any cell in the first set of cells.

[0157] In some embodiments, the first search space includes a set of PDCCH candidates, and at least one PDCCH candidate in the set is used to send a DCI.

[0158] In some embodiments, the assignment unit assigns a PDCCH candidate to one or more of the following: a first set, a first cell (in the first set), a second cell (in the first set), a first group (in the first set), a first combination (in the first set or the first group), or a first set of combinations (in the first set or the first group).

[0159] In some embodiments, the assignment unit assigns PDCCH candidates based on one or more of the first, second, third, fourth, fifth, and sixth parameters.

[0160] In some embodiments, the first parameter and / or the second parameter and / or the third parameter and / or the fourth parameter and / or the fifth parameter and / or the sixth parameter are for a first set, a first cell (in the first set), a second cell (in the first set), a first group (in the first set), a first combination (in the first set or the first group), and a first set of combinations (in the first set or the first group).

[0161] In some examples, the first parameter represents the first number of PDCCH candidates, where the first number of PDCCH candidates is the number of assignable PDCCH candidates and / or The second parameter represents the second PDCCH candidate number, which is the number of PDCCH candidates assigned before the first search space, and / or The third parameter represents the third PDCCH candidate number, which is the number of PDCCH candidates that can be allocated to the first search space, and / or The fourth parameter represents the number of fourth PDCCH candidates, which is the number of PDCCH candidates included in the first search space.

[0162] In some embodiments, the fifth parameter is used to determine the first parameter and / or the sixth parameter is used to determine the fourth parameter, and the fifth and sixth parameters are either the same or different.

[0163] In some embodiments, the fifth and / or sixth parameters are predefined or configured.

[0164] In some embodiments, the fifth parameter and / or the sixth parameter relate to the first group and / or the first combination.

[0165] In some embodiments, the apparatus further includes the following parts:

[0166] A first determination unit (not shown) determines a first parameter for the first group based on a fifth parameter and / or the number of cells in the first group and / or the number of PDCCHs that can be assigned to the cells.

[0167] In some embodiments, the apparatus further includes the following parts:

[0168] A second determination unit (not shown) determines a first parameter for the first combination based on the fifth parameter and / or the number of cells in the first combination and / or the number of PDCCHs that can be assigned to the cells.

[0169] In some embodiments, the PDCCH candidate sets included in the first search space include one or more first PDCCH candidate sets, where the first PDCCH candidate set is for a first set, or a first cell in the first set, or a third cell in the first set, or a second cell group in the first set, or a second combination in the first set or the second group.

[0170] In some embodiments, the third cell and the second cell are identical or different, and / or the second group and the first group are identical or different, and / or the second combination and the first combination are identical or different.

[0171] In some embodiments, different second groups or second combinations may or may not include the same cell.

[0172] In some embodiments, different third cells may or may not be related to the same cell.

[0173] In some embodiments, the two first PDCCH candidate sets may or may not include PDCCH candidates having the same CCE.

[0174] In some embodiments, the apparatus further includes the following parts:

[0175] A reporting unit (not shown) reports the capabilities of the terminal device. This capability includes the number of PDCCH cells and / or the number of first groups and / or the number of first combinations that the terminal device can monitor.

[0176] In some embodiments, the assignment unit assigns a PDCCH candidate to a first cell or a second cell or a first group in a first set. At least one cell in the first cell or second cell or first group is included in a plurality of second groups or a second combination, and a fourth parameter for the first cell or second cell or first group is determined based on a first set of PDCCH candidates corresponding to the plurality of second groups or a second combination.

[0177] In some embodiments, the fourth parameter is equal to the number of PDCCH candidates in the union of the first PDCCH candidate sets corresponding to multiple second groups or second combinations, or the sum of the number of PDCCH candidates in each of the first PDCCH candidate sets corresponding to multiple second groups or second combinations.

[0178] In some embodiments, the assignment unit assigns PDCCH candidates to a first group in a first set. The first group includes a plurality of second groups or second combinations, and the fourth parameter for the first group is determined based on the first set of PDCCH candidates corresponding to the plurality of second groups or second combinations.

[0179] In some embodiments, the fourth parameter is equal to the number of PDCCH candidates in the union of the first PDCCH candidate sets corresponding to multiple second groups or second combinations, or the sum of the number of PDCCH candidates in each of the first PDCCH candidate sets corresponding to multiple second groups or second combinations.

[0180] In some embodiments, the apparatus further includes the following parts:

[0181] The first monitoring unit (not shown) monitors for PDCCH candidates in the first search space (for the first set, the first cell (in the first set), the second cell (in the first set), the first group (in the first set), the first combination (in the first set or the first group), and the first set of combinations (in the first set or the first group)) if the third parameter of the first search space is greater than or equal to the fourth parameter.

[0182] In some embodiments, the apparatus further includes the following parts:

[0183] The first monitoring unit (not shown) monitors for PDCCH candidates in the first search space, or does not monitor for PDCCH candidates in the first search space, if the third parameter of the first search space is smaller than the fourth parameter.

[0184] In some embodiments, when a terminal device monitors a PDCCH candidate in a first search space, a second monitoring unit monitors a number of PDCCH candidates equal to the number of third parameters in the first search space.

[0185] The above embodiments are merely illustrative examples of the present invention, and the present invention is not limited thereto. Appropriate modifications may be made based on the above embodiments. For example, each of the above embodiments may be used individually, or one or more of the above embodiments may be used in combination.

[0186] Although the above description only concerns components or modules related to the present invention, the present invention is not limited thereto. The data receiving device 2900 may further include other components or modules. For specific details of these components or modules, refer to related technologies.

[0187] Furthermore, for the sake of clarity, Figure 29 merely illustrates the connection relationships or signal directions between various components or modules, but it will be apparent to those skilled in the art that various related techniques, such as bus connections, can be used. The various components or modules described above may also be implemented by hardware devices such as processors, memory, transmitters, and receivers, and the present invention is not limited thereto.

[0188] According to this embodiment, when scheduling multiple cells via a single DCI, it is possible to support scheduling multiple cells via a single DCI by determining which PDCCH candidate to monitor in which search space. This reduces the burden of DCI monitoring on terminal devices and lowers power consumption and complexity.

[0189] <Example 4> Embodiments of the present invention provide a data transmission device. This device may be, for example, a network device, or one or more components configured within a network device. Descriptions of aspects similar to those in Embodiment 2 are omitted.

[0190] Figure 30 is a schematic diagram of a data transmission device according to an embodiment of the present invention. As shown in Figure 30, the data transmission device 3000 includes the following parts.

[0191] The transmitting unit 3001 transmits a DCI in a first search space. The first search space is used to schedule cells in a first set, and the DCI is used to schedule at least two cells in the first set.

[0192] In some embodiments, a first search space is assigned a PDCCH candidate for sending the DCI. For example, a PDCCH candidate is assigned to one or more of the following: a first set, a first cell (in the first set), a second cell (in the first set), a first group (in the first set), a first combination (in the first set or the first group), or a first set of combinations (in the first set or the first group).

[0193] For example, regarding the method of assigning PDCCH candidates, you may refer to the examples, and the transmitting unit 3001 corresponds to the receiving unit 2902 in Example 3, and the explanation of redundant content will be omitted.

[0194] The above embodiments are merely illustrative examples of the present invention, and the present invention is not limited thereto. Appropriate modifications may be made based on the above embodiments. For example, each of the above embodiments may be used individually, or one or more of the above embodiments may be used in combination.

[0195] Although the above description only concerns components or modules related to the present invention, the present invention is not limited thereto. The data transmission device 3000 may further include other components or modules. For specific details of these components or modules, refer to related technologies.

[0196] Furthermore, for the sake of clarity, Figure 30 merely illustrates the connection relationships or signal directions between various components or modules, but it will be apparent to those skilled in the art that various related techniques, such as bus connections, can be used. The above-mentioned components or modules may be implemented by hardware devices such as processors, memory, transmitters, and receivers, and the present invention is not limited thereto.

[0197] According to this embodiment, when scheduling multiple cells via a single DCI, it is possible to support scheduling multiple cells via a single DCI by determining which PDCCH candidate to monitor in which search space. This reduces the burden of DCI monitoring on terminal devices and lowers power consumption and complexity.

[0198] <Example 5> Embodiments of the present invention further provide a communication system, and may refer to Figure 1. The description of the same content as in Embodiments 1 to 4 will be omitted.

[0199] In some embodiments, the communication system 100 may include at least a terminal device 102 and a network device 101.

[0200] In some embodiments, the configuration of the terminal device 102 may refer to the terminal device 3100, and the configuration of the network device 101 may refer to the network device 3200, and their descriptions are omitted here.

[0201] Embodiments of the present invention further provide a network device, which may be, for example, a base station, but the present invention is not limited thereto and may be other network devices.

[0202] Figure 32 is a schematic diagram of a network device according to an embodiment of the present invention. As shown in Figure 32, the network device 3200 may include a processor 3210 (for example, a central processing unit (CPU)) and a memory 3220, the memory 3220 being connected to the processor 3210. The memory 3220 may store various types of data, and may also store an information processing program 3230, and execute the program 3230 under the control of the processor 3210.

[0203] For example, the processor 3210 may execute a program to implement the data transmission method described in Example 2.

[0204] Furthermore, as shown in Figure 32, the network device 3200 may further include a transceiver 3240 and an antenna 3250, etc. The functions of the above components are similar to those of the prior art, and their explanation is omitted here. Note that the network device 3200 does not need to include all the units shown in Figure 32. Also, the network device 3200 may further include units not shown in Figure 32, and prior art may be referenced.

[0205] The embodiments of the present invention further provide terminal devices, but the present invention is not limited thereto and may include other devices.

[0206] Figure 31 is a schematic diagram of a terminal device according to an embodiment of the present invention. As shown in Figure 31, the terminal device 3100 may include a processor 3110 and a memory 3120, the memory 3120 which stores data and programs and is connected to the processor 3110. Note that this figure is illustrative, and this structure may be supplemented or replaced with other types of structures to realize communication functions or other functions.

[0207] For example, the processor 3110 may execute a program to implement the data reception method described in Example 1.

[0208] Furthermore, as shown in Figure 31, the terminal device 3100 may further include a communication module 3130, an input unit 3140, a display 3150, and a power supply 3160, etc. The functions of the above units are the same as in the prior art, and their explanation is omitted here. Note that the terminal device 3100 does not need to include all the units shown in Figure 31. Also, the terminal device 3100 may further include units not shown in Figure 31, and prior art may be referenced.

[0209] In embodiments of the present invention, a computer-readable program is further provided that, when the program is executed on a terminal device, causes the terminal device to execute the data reception method described in Embodiment 1.

[0210] Embodiments of the present invention further provide a storage medium in which a computer-readable program is stored, and which causes a terminal device to execute the data reception method described in Embodiment 1 when the program is executed.

[0211] In embodiments of the present invention, a computer-readable program is further provided that, when executed on a network device, causes the network device to execute the data transmission method described in Embodiment 2.

[0212] Embodiments of the present invention further provide a storage medium in which a computer-readable program is stored, and which causes a network device to execute the data transmission method described in Embodiment 2 when the program is executed.

[0213] The above-described apparatus and method of the present invention may be implemented by hardware, or by combining hardware and software. The present invention relates to a computer-readable program, and when the program is executed by a logic unit, the logic unit may implement the above-described apparatus or configuration requirements, or the logic unit may implement the above-described methods or steps. The present invention relates to a storage medium for storing the above-described program, such as a hard disk, magnetic disk, optical disk, DVD, flash memory, etc.

[0214] Each processing method in each apparatus described with reference to embodiments of the present invention may be implemented using hardware, software modules executed by a processor, or a combination of both. For example, one or more functional block diagrams shown in the drawings, or one or more combinations of functional block diagrams, may correspond to each software module in the computer program flow, or to each hardware module. These software modules may correspond to each step shown in the drawings. These hardware modules may be implemented by hardwareizing these software modules, for example, using a field-programmable gate array (FPGA).

[0215] The software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, mobile hard disk, CD-ROM, or any other form of storage medium known to those skilled in the art. The storage medium may be connected to the processor so that the processor can read information from or write information to the storage medium, or the storage medium may be a component of the processor. The processor and the storage medium may reside in an ASIC. The software module may be stored in the memory of the mobile terminal or on a memory card inserted into the mobile terminal. For example, if the device (e.g., a mobile terminal) uses a relatively large capacity MEGA-SIM card or a high-capacity flash memory device, the software module may be stored on the MEGA-SIM card or high-capacity flash memory device.

[0216] One or more functional blocks and / or one or more combinations of functional blocks in the functional block diagrams shown in the drawings may be implemented by 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 discrete gate or transistor logic unit, a discrete hardware component, or any suitable combination thereof for performing the functions described herein. One or more functional blocks and / or one or more combinations of functional blocks in the functional block diagrams shown in the drawings may be implemented, for example, by a combination of computing equipment, such as a combination of a DSP and a microprocessor, a combination of multiple microprocessors, one or more microprocessors combined with DSP communication, or any other configuration.

[0217] Although the present invention has been described above with reference to specific embodiments, the above description is merely illustrative and does not limit the scope of protection of the present invention. Various modifications and changes can be made to the present invention as long as they do not deviate from the spirit and principles of the present invention, and these modifications and changes are also within the scope of the present invention.

[0218] Furthermore, the following additional information is disclosed regarding embodiments including the above-described examples. (Note 1) A data reception method applicable to a terminal device, The steps include: the terminal device assigning a PDCCH candidate to a first search space, wherein the first search space is used to schedule cells in a first set; A method comprising the steps of: the terminal device receiving a DCI in the first search space, wherein the DCI is used to schedule at least two cells in the first set. (Note 2) The method according to Appendix 1, wherein the first search space is located in one cell in the first cell set, or is not located in any cell in the first cell set. (Note 3) The method according to Appendix 1 or 2, wherein the first search space includes a set of PDCCH candidates, and at least one PDCCH candidate in the set of PDCCH candidates is used to transmit the DCI. (Note 4) The method according to any one of Appendix 1 to 3, further comprising the step of assigning a PDCCH candidate to one or more of the following: the first set, the first cell (in the first set), the second cell (in the first set), the first group (in the first set), the first combination (in the first set or the first group), or the first combination set (in the first set or the first group). (Note 5) The method according to any one of Appendix 1 to 5, further comprising the step of assigning the PDCCH candidate based on one or more of the first parameter, second parameter, third parameter, fourth parameter, fifth parameter, and sixth parameter. (Note 6) The method according to Appendix 5, wherein the first parameter and / or the second parameter and / or the third parameter and / or the fourth parameter and / or the fifth parameter and / or the sixth parameter are for the first set, the first cell (in the first set), the second cell (in the first set), the first group (in the first set), the first combination (in the first set or the first group), and the first set of combinations (in the first set or the first group). (Note 7) The first parameter represents the first number of PDCCH candidates, and the first number of PDCCH candidates is the number of assignable PDCCH candidates, and / or The second parameter represents the second number of PDCCH candidates, which is the number of PDCCH candidates allocated before the first search space, and / or The third parameter represents the third number of PDCCH candidates, which is the number of PDCCH candidates that can be allocated to the first search space, and / or The method according to Appendix 5 or 6, wherein the fourth parameter represents the number of fourth PDCCH candidates, and the number of fourth PDCCH candidates is the number of PDCCH candidates included in the first search space. (Note 8) The method according to Appendix 5, 6, or 7, wherein the fifth parameter is used to determine the first parameter, and / or the sixth parameter is used to determine the fourth parameter, and the fifth parameter and the sixth parameter are the same or different. (Note 9) The fifth and / or sixth parameters are predefined or configured in any of the methods described in Appendix 5 to 8. (Note 10) The fifth parameter and / or the sixth parameter are related to the first group and / or the first combination as described in any of the methods in Appendix 5 to 9. (Note 11) The method according to any one of Appendix 4 to 10, further comprising the step of the terminal device determining a first parameter for the first group based on the fifth parameter and / or the number of cells in the first group and / or the number of PDCCHs that can be assigned to the cells. (Note 12) The method according to any one of Appendix 4 to 10, further comprising the step of the terminal device determining a first parameter for the first combination based on the fifth parameter and / or the number of cells in the first combination and / or the number of PDCCHs that can be assigned to the cells. (Note 13) The PDCCH candidate set included in the first search space comprises one or more first PDCCH candidate sets. The method according to any one of the appendices 1 to 12, wherein the first PDCCH candidate set is for the first set, or the first cell in the first set, or the third cell in the first set, or the second cell group in the first set, or the second combination in the first set or the second group. (Note 14) The method according to Appendix 13, wherein the third cell and the second cell are the same or different, and / or the second group and the first group are the same or different, and / or the second combination and the first combination are the same or different. (Note 15) The method according to Appendix 13 or 14, wherein different second groups or second combinations include or do not include the same cell. (Note 16) The different third cells are related to or not related to the same cell, as described in Appendix 13. (Note 17) The method according to Appendix 13, wherein the two aforementioned first PDCCH candidate sets include or do not include PDCCH candidates having the same CCE. (Note 18) The method according to Appendix 1, further comprising the step of the terminal device reporting the capabilities of the terminal device, wherein the capabilities include the number of PDCCH cells that the terminal device can monitor and / or the number of first groups and / or the number of first combinations. (Note 19) The method according to any one of Appendix 1 to 18, further comprising the step of assigning a PDCCH candidate to a first cell or second cell or first group in the first set, wherein at least one cell in the first cell or second cell or first group is included in a plurality of second groups or second combinations, and a fourth parameter for the first cell or second cell or first group is determined based on a first PDCCH candidate set corresponding to the plurality of second groups or second combinations. (Note 20) The method according to Appendix 19, wherein the fourth parameter is equal to the number of PDCCH candidates in the union of the first PDCCH candidate sets corresponding to the plurality of second groups or second combinations, or the sum of the number of PDCCH candidates in each of the first PDCCH candidate sets corresponding to the plurality of second groups or second combinations. (Note 21) The method according to any one of Appendix 1 to 18, further comprising the step of assigning a PDCCH candidate to a first group in the first set, wherein the first group includes a plurality of second groups or second combinations, and a fourth parameter for the first group is determined based on a first set of PDCCH candidates corresponding to the plurality of second groups or second combinations. (Note 22) The method according to Appendix 21, wherein the fourth parameter is equal to the number of PDCCH candidates in the union of the first PDCCH candidate sets corresponding to the plurality of second groups or second combinations, or the sum of the number of PDCCH candidates in each of the first PDCCH candidate sets corresponding to the plurality of second groups or second combinations. (Note 23) The method according to any one of Appendix 1 to 18, further comprising the step of the terminal device monitoring a PDCCH candidate in the first search space if the third parameter of the first search space is equal to or greater than the fourth parameter (for the first set, the first cell in the first set, the second cell in the first set, the first group in the first set, the first combination in the first set or the first group, and the first combination set in the first set or the first group). (Note 24) The method according to any one of the appendices 1 to 18, further comprising the step that, if the third parameter of the first search space is smaller than the fourth parameter, the terminal device monitors for a PDCCH candidate in the first search space, or does not monitor for a PDCCH candidate in the first search space. (Note 25) The method according to Appendix 24, wherein when the terminal device monitors PDCCH candidates in the first search space, the terminal device monitors a number of PDCCH candidates equal to the number of third parameters in the first search space. (Note 26) A data transmission method applicable to network devices, A method comprising the steps of a network device transmitting a DCI in a first search space, wherein the first search space is used to schedule cells in a first set, the DCI is used to schedule at least two cells in the first set, and the first search space is assigned a PDCCH candidate for transmitting the DCI. (Note 27) The method according to Supplementary Note 26, wherein a PDCCH candidate is allocated to one or more of a first set, a first cell (in said first set), a second cell (in said first set), a first group (in said first set), a first combination (in said first set or first group), and a first combination set (in said first set or first group). (Supplementary Note 28) A network device, comprising a memory storing a computer program and a processor, wherein the processor is configured to, by executing the computer program, implement the data transmission method according to Supplementary Note 26 or 27. (Supplementary Note 29) A terminal device, comprising a memory storing a computer program and a processor, wherein the processor is configured to, by executing the computer program, implement the data reception method according to any one of Supplementary Notes 1 to 25. (Supplementary Note 30) A communication system, comprising the terminal device according to Supplementary Note 29 and / or the network device according to Supplementary Note 28.

Claims

1. A data receiving device applicable to a terminal device, A transceiver that receives information (nrofCandidates) used to determine a fourth number (M4) of PDCCH candidates in a first search space set for DCI detection for scheduling cells from a first set of cells, A processor that assigns the fourth number (M4) of PDCCH candidates for monitoring to the first search space set, The transceiver monitors the PDCCH candidates in the first search space set and receives the DCI if the fourth number (M4) of PDCCH candidates is less than or equal to the third number (M3) of PDCCH candidates for the second cell in the first set of cells. The third number of PDCCH candidates is the number of PDCCH candidates that can be allocated to the first search space set, The apparatus wherein the fourth number of PDCCH candidates is the number of PDCCH candidates included in the first search space set.

2. The apparatus according to claim 1, wherein the fourth number (M4) of PDCCH candidates is less than or equal to the third number (M3) of PDCCH candidates for the second cell in the first set of cells, and the fourth number of non-overlapping CCEs is less than or equal to the third number of non-overlapping CCEs for the second cell in the first set of cells, the processor assigns the fourth number (M4) of PDCCH candidates for monitoring to the first search space set, and the transceiver monitors the PDCCH candidates in the first search space set and receives the DCI.

3. If the fourth number (M4) of PDCCH candidates in a time unit is greater than the third number (M3) of PDCCH candidates for the second cell in the first set of cells, or if the fourth number of non-overlapping CCEs in a time unit is greater than the third number of non-overlapping CCEs for the second cell in the first set of cells, the processor does not allocate the fourth number (M4) of PDCCH candidates for monitoring in the time unit to the first search space set, and the transceiver does not monitor PDCCH candidates in the first search space set in the time unit, the apparatus according to claim 1.

4. The processor assigns the PDCCH candidate based on one or more of the first parameter, the second parameter, the third parameter, and the fourth parameter. The first parameter includes a first number (M1) of PDCCH candidates and / or a first number of non-overlapping CCEs, wherein the first number of PDCCH candidates is the number of assignable PDCCH candidates, and the first number of non-overlapping CCEs is the number of assignable non-overlapping CCEs, and / or The second parameter includes a second number of PDCCH candidates (M2) and / or a second number of non-overlapping CCEs, wherein the second number of PDCCH candidates is the number of PDCCH candidates allocated before the first search space set, and the second number of non-overlapping CCEs is the number of non-overlapping CCEs allocated before the first search space set, and / or The third parameter includes the third number (M3) of PDCCH candidates and / or the third number of non-overlapping CCEs, the third number of non-overlapping CCEs being the number of non-overlapping CCEs that can be allocated to the first search space set, and / or The apparatus according to claim 1, wherein the fourth parameter includes the fourth number (M4) of PDCCH candidates and / or the fourth number of non-overlapping CCEs, the fourth number of non-overlapping CCEs being the number of non-overlapping CCEs included in the first search space set.

5. The apparatus according to claim 4, wherein the first parameter and / or the second parameter and / or the third parameter and / or the fourth parameter are for the second cell (in the first set).

6. The third number (M3) of the PDCCH candidate is equal to the number obtained by subtracting the second number of the PDCCH candidate from the first number of the PDCCH candidate, and / or The apparatus according to claim 4, wherein the third number of non-overlapping CCEs is equal to the number obtained by subtracting the second number of non-overlapping CCEs from the first number of non-overlapping CCEs.

7. The second number of PDCCH candidates is equal to the total number of PDCCH candidates assigned to one or more common search space sets and / or one or more UE-specific search space sets having smaller indices than the first search space set, and / or The apparatus according to claim 6, wherein the second number of non-overlapping CCEs is equal to the total number of non-overlapping CCEs assigned to one or more common search space sets and / or one or more UE-specific search space sets having smaller indices than the first search space set.

8. The first number (M1) of the PDCCH candidate is, (Outside 1) Equivalent to, and / or, The aforementioned first number of non-overlapping CCEs is, (Outside 2) The apparatus according to claim 7, which is equivalent to the apparatus according to claim 7.

9. The apparatus according to claim 7, wherein the second number of non-overlapping CCEs is the number of non-overlapping CCEs corresponding to the PDCCH candidate assigned before the first search space set.

10. The apparatus according to claim 1, wherein the first search space set includes a PDCCH candidate set, and at least one PDCCH candidate in the PDCCH candidate set is used to transmit the DCI.

11. The PDCCH candidate set includes one or more first PDCCH candidate sets. The apparatus according to claim 10, wherein the first PDCCH candidate set is for the first set.

12. The apparatus according to claim 11, wherein the two sets of the first PDCCH candidate include or do not include a PDCCH candidate having the same CCE.

13. The apparatus according to claim 1, wherein the transceiver reports the capability of the terminal device, and the capability includes the number of cells on which the terminal device can monitor PDCCH.

14. A data transmission device applicable to network equipment, A transmitter that transmits information (nrofCandidates) constituting a fourth number (M4) of PDCCH candidates for the detection of DCIs for scheduling cells from a first set of cells, and transmits DCIs in PDCCH candidates in a first search space set, wherein if the fourth number (M4) of PDCCH candidates is less than or equal to the third number (M3) of PDCCH candidates for a second cell in the first set of cells, the PDCCH candidates are assigned to the first search space set, and includes the transmitter The third number of PDCCH candidates is the number of PDCCH candidates that can be allocated to the first search space set, The apparatus wherein the fourth number of PDCCH candidates is the number of PDCCH candidates included in the first search space set.

Images