Apparatus and method for joint search space set for enhanced PDCCH transmission using multiple beams from multiple TRPs

Abstract

An apparatus and method for a joint search space set for enhanced PDCCH transmissions utilizing multiple beams from multiple TRPs is disclosed. The apparatus includes: a processor that generates multiple versions of downlink control information (DCI) for transmissions from multiple transmit-receive identifiers having multiple control resource sets (CORESETs), each CORESET being transmitted from one of the transmit-receive identifiers; and configuring an information element (IE) indicating a joint search space set for the DCI, wherein the joint search space set includes multiple component search space sets; and a transmitter that transmits the DCI and the IE using multiple transmit-receive identifiers; wherein each component search space set in the component search space set is configured to monitor and detect a DCI version.

Description

Technical Field

[0001] The subject matter disclosed herein relates generally to wireless communications and, more particularly, to, but not limited to, apparatus and methods for a joint search space set for enhanced physical downlink control channel (PDCCH) transmissions utilizing multiple beams from multiple transmit and receive points (TRPs). Background Art

[0002] The following abbreviations and acronyms are defined herein, at least some of which are referred to in the specification.

[0003] 3rd Generation Partnership Project (3GPP), 5th Generation (5G), New Radio (NR), 5G Node B (gNB), Long Term Evolution (LTE), LTE-Advanced (LTE-A), E-UTRAN Node B / evolved Node B (eNB), Universal Mobile Telecommunications System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX), Evolved UMTS Terrestrial Radio Access Network (E-UTRAN), Wireless Local Area Network (WLAN), Orthogonal Frequency Division Multiplexing (OFDM), Single Carrier Frequency Division Multiple Access (SC-FDMA), Downlink (DL), Uplink (UL), User Equipment (UE), Network Equipment (NE), Radio Access Technology (RAT), Reception or receiver (RX), transmit or transmitter (TX), acknowledgement (ACK), negative acknowledgement (NACK), physical downlink control channel (PDCCH), physical downlink shared channel (PDSCH), bandwidth part (BWP), control channel element (CCE), control resource set (CORESET), common search space (CSS), downlink control information (DCI), frequency division multiple access (FDMA), identification (ID), information element (IE), subcarrier spacing (SCS), single frequency network (SFN), transmit reception point (TRP), UE-specific search space (USS), frequency range 1 (FR1), frequency range 2 (FR2), synchronization signal (SS).

[0004] In wireless communications such as the 3rd Generation Partnership Project (3GPP) mobile network, the wireless mobile network can provide seamless wireless communication services to wireless communication terminals with mobility, i.e., user equipment (UE). The wireless mobile network can be formed by a plurality of base stations and the base stations can perform wireless communications with the UE.

[0005] 5G New Radio (NR) is the latest in the 3GPP family of standards and supports very high data rates and lower latency compared to its predecessor LTE (4G) technology. Two types of frequency ranges (FR) are defined in 3GPP. Frequencies in the sub-6GHz range (from 450 to 6000MHz) are called FR1, and the millimeter wave range (from 24.25GHz to 52.6GHz) is called FR2. 5G NR supports both FR1 and FR2 frequency bands.

[0006] Enhancements to multi-TRP / panel transmissions are studied, including improved reliability and robustness with ideal and non-ideal backhaul between these TRPs. A TRP is a device that transmits and receives signals and is controlled by the gNB through the backhaul between the gNB and the TRP. A TRP may also be called a transmit-receive identity, or simply an identity.

[0007] In current NR systems, the Physical Downlink Control Channel (PDCCH) is transmitted from a single TRP. With multiple TRPs, the time-frequency resources for PDCCH transmission can come from multiple TRPs, and thereby increase the resources for PDCCH transmission. In addition, in addition to time-frequency diversity, spatial diversity can also be utilized. There are many candidate schemes to utilize additional resources to improve the reliability and robustness of PDCCH transmission. One of the candidate schemes is that a DCI is transmitted in multiple versions, where each version is transmitted on a control resource set (CORESET) from each TRP. In order to better support this PDCCH transmission scheme, enhancements to the search space set and related UE detection behavior are needed. Summary of the invention

[0008] Apparatus and methods are disclosed for a joint search space set for enhanced PDCCH transmission utilizing multiple beams from multiple TRPs.

[0009] According to a first aspect, a device is provided, comprising: a processor, which generates multiple versions of downlink control information (DCI) for transmission from multiple transmit-receive identifiers having multiple control resource sets (CORESETs), each CORESET being used for transmission of one of the transmit-receive identifiers; and an information element (IE) indicating a joint search space set is configured for the DCI, wherein the joint search space set includes multiple component search space sets; and a transmitter, which transmits the DCI using multiple transmit-receive identifiers and transmits the IE; wherein each component search space set in the component search space set is configured to monitor and detect a DCI version.

[0010] According to a second aspect, a device is provided, comprising: a receiver, which receives downlink control information (DCI) having multiple versions from multiple transmit-receive identifiers having multiple control resource sets (CORESETs), each CORESET being used for transmitting one of the transmit-receive identifiers; and receives an information element (IE) indicating a joint search space set for the DCI, wherein the joint search space set comprises multiple component search space sets; and a processor, which decodes the DCI by blindly detecting physical downlink control channel (PDCCH) candidates in the joint search space set based on the IE; wherein each component search space set in the component search space set is configured to monitor and detect a DCI version.

[0011] According to a third aspect, a method is provided, comprising: generating, by a processor, multiple versions of downlink control information (DCI) for transmissions from multiple transmit-receive identifiers having multiple control resource sets (CORESETs), each CORESET being used for transmissions of one of the transmit-receive identifiers; configuring, by the processor, an information element (IE) indicating a joint search space set for the DCI, wherein the joint search space set comprises multiple component search space sets; transmitting the DCI by a transmitter using multiple transmit-receive identifiers; and transmitting the IE by the transmitter; wherein each component search space set in the component search space set is configured to monitor and detect a DCI version.

[0012] According to a fourth aspect, a method is provided, comprising: receiving, by a receiver, downlink control information (DCI) having multiple versions from multiple transmit-receive identifiers having multiple control resource sets (CORESETs), each CORESET being used for transmission of one of the transmit-receive identifiers; and receiving, by the receiver, an information element IE indicating a joint search space set for the DCI, wherein the joint search space set comprises multiple component search space sets; and decoding, by a processor, the DCI by blindly detecting physical downlink control channel (PDCCH) candidates in the joint search space set based on the IE; wherein each component search space set in the component search space set is configured to monitor and detect a DCI version. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] A more specific description of the embodiments is provided below with reference to specific embodiments shown in the accompanying drawings. Given that these drawings depict only some embodiments and are therefore not to be considered limiting in scope, these embodiments are described and explained below with additional specificity and detail through the use of the accompanying drawings, in which:

[0014] Figure 1 is a schematic diagram illustrating a wireless communication system according to some embodiments of the present disclosure;

[0015] Figure 2is a schematic block diagram illustrating components of a user equipment (UE) according to some embodiments of the present disclosure;

[0016] Figure 3 is a schematic block diagram illustrating components of a network equipment (NE) according to some embodiments of the present disclosure;

[0017] Figure 4 is a diagram illustrating an example of a DCI transmission with multiple DCI versions from multiple TRPs according to some embodiments of the present disclosure;

[0018] Figure 5 is a schematic diagram illustrating an example of a priority mapping scheme for a search space set according to some embodiments of the present disclosure;

[0019] Figure 6 is a schematic diagram illustrating an example of a PDCCH transmission scheme with multiple TRPs according to some embodiments of the present disclosure;

[0020] Fig. 7A is a schematic diagram illustrating an example of a one-to-one mapping between candidates from a set of component search spaces having the same aggregation level according to some embodiments of the present disclosure;

[0021] Figure 7B is a schematic diagram illustrating an example of a one-to-one mapping between candidates from component search space sets having different aggregation levels according to some embodiments of the present disclosure;

[0022] Figure 8 is a flow chart illustrating the steps of transmitting an enhanced PDCCH by a NE using multiple beams from multiple TRPs with a joint search space set according to some embodiments of the present disclosure; and

[0023] Fig. 9 is a flowchart illustrating the steps of receiving an enhanced PDCCH by a NE using multiple beams from multiple TRPs with a joint search space set according to some embodiments of the present disclosure. DETAILED DESCRIPTION

[0024] Those skilled in the art will appreciate that the various aspects of the embodiments may be embodied as systems, devices, methods or program products. Therefore, the embodiments may take the form of full hardware embodiments, full software embodiments (including firmware, resident software, microcode, etc.) or embodiments combining software and hardware aspects.

[0025] Furthermore, one or more embodiments may take the form of a program product embodied in one or more computer-readable storage devices storing machine-readable code, computer-readable code, and / or program code, hereinafter referred to as “code.” The storage device may be tangible, non-transitory, and / or non-transmitting.

[0026] References throughout this specification to "one embodiment," "an embodiment," "an example," "some embodiments," "some examples," or similar language mean that the particular feature, structure, or characteristic is included in at least one embodiment or example. Therefore, instances of the phrases "in one embodiment," "in an example," "in some embodiments," and similar language throughout the specification may, but do not necessarily, all refer to the same (multiple) embodiments. It may or may not include all disclosed embodiments. Unless expressly stated otherwise, features, structures, elements, or characteristics described in conjunction with one or some embodiments also apply to other embodiments. Unless expressly stated otherwise, the terms "include," "comprising," "having," and variations thereof mean "including but not limited to."

[0027] Unless expressly stated otherwise, the enumerated listing of items does not imply that any or all of the items are mutually exclusive. Unless expressly stated otherwise, the terms "a," "an," and "the" also mean "one or more."

[0028] Throughout the disclosure, the terms "first", "second", "third", etc. are used as terms that are used only to refer to related devices, components, procedural steps, etc., without indicating any spatial or temporal order, unless otherwise explicitly stated. For example, "first device" and "second device" may refer to two separately formed devices, or two parts or components of the same device. In some cases, for example, "first device" and "second device" may be the same and may be named arbitrarily. Similarly, the "first step" of a method or process may be performed or carried out after or at the same time as the "second step".

[0029] It should be understood that the term "and / or" as used herein refers to and includes any and all possible combinations of one or more of the associated listed items. For example, "A and / or B" may refer to any of the following three combinations: only A exists, only B exists, and A and B coexist. The character " / " generally indicates an "or" relationship of associated items, but may also include an "and" relationship of associated items. For example, "A / B" means "A or B", which may also include the coexistence of both A and B, unless the context indicates otherwise.

[0030] In addition, the features, structures or characteristics of the described embodiments can be combined in any suitable manner. In the following description, a plurality of specific details are provided, such as examples of programming, software modules, user selections, network transactions, database queries, database structures, hardware modules, hardware circuits, hardware chips, etc., to provide a thorough understanding of the embodiments. However, those skilled in the relevant art will recognize that the embodiments can be practiced without one or more specific details or by other methods, components, materials, etc. In other examples, known structures, materials or operations are not shown or described in detail to avoid confusing the various aspects of the embodiments.

[0031] Aspects of various embodiments are described below with reference to schematic flow charts and / or schematic block diagrams of methods, devices, systems, and program products. It will be understood that each step in the schematic flow charts and / or schematic block diagrams, as well as combinations of steps in the schematic flow charts and / or schematic block diagrams, can be implemented by code. The code can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device to produce a machine so that instructions executed via a processor of a computer or other programmable data processing device can create a means for implementing the functions or actions specified in the schematic flow charts and / or schematic block diagrams.

[0032] The code may also be stored in a storage device that can direct a computer, other programmable data processing device or other device to operate in a specific manner so that the instructions stored in the storage device produce a product including instructions for implementing the functions or actions specified in the schematic flowchart and / or schematic block diagram.

[0033] The schematic flow charts and / or schematic block diagrams in the accompanying drawings illustrate the architecture, functions and operations of possible implementations of different devices, systems, methods and program products according to various embodiments. In this regard, each step in the schematic flow charts and / or schematic block diagrams may represent a portion of a module, a fragment or a code, which includes one or more executable instructions for implementing the code of (multiple) specified logical functions. However, those skilled in the relevant art will recognize that the flow chart is not necessarily practiced in the order shown and can be practiced without one or more specific steps or by other steps not shown.

[0034] It should also be noted that in some alternative implementations, the functions mentioned in the identified blocks may not appear in the order mentioned in the drawings. For example, depending on the functions involved, two steps shown in succession may actually be performed simultaneously, or may sometimes be performed in the reverse order.

[0035] Figure 11 is a schematic diagram illustrating a wireless communication system. It depicts an embodiment of a wireless communication system 100. In one embodiment, the wireless communication system 100 may include a user equipment (UE) 102 and a network equipment (NE) 104. Figure 1 A specific number of UEs 102 and NEs 104 are depicted in FIG. 1 , but those skilled in the art will recognize that any number of UEs 102 and NEs 104 may be included in the wireless communication system 100 .

[0036] UE 102 may be referred to as a remote device, a remote unit, a subscriber unit, a mobile station, a mobile station, a user, a terminal, a mobile terminal, a fixed terminal, a subscriber station, a user terminal, a device, an apparatus or other terminology used in the art.

[0037] In one embodiment, the UE 102 may be an autonomous sensor device, an alarm device, an actuator device, a remote control device, etc. In some other embodiments, the UE 102 may include a computing device such as a desktop computer, a laptop computer, a personal digital assistant (PDA), a tablet computer, a smart phone, a smart TV (e.g., a TV connected to the Internet), a set-top box, a game console, a security system (including security cameras), a vehicle-mounted computer, a network device (e.g., a router, a switch, a modem), etc. In some embodiments, the UE 102 includes a wearable device such as a smart watch, a fitness band, an optical head-mounted display, etc. The UE 102 may communicate directly with one or more NEs 104.

[0038] NE 104 may also be referred to as a base station, access point, access terminal, base station, Node-B, eNB, gNB, home Node-B, relay node, device, equipment, or any other term used in the art. Throughout this specification, references to base stations may refer to any of the above reference types of network devices 104 such as eNBs and gNBs.

[0039] The NEs 104 may be distributed over a geographic area. The NEs 104 are typically part of a radio access network that includes one or more controllers communicatively coupled to one or more corresponding NEs 104. The radio access network is typically communicatively coupled to one or more core networks, which may be coupled to other networks, such as the Internet and a public switched telephone network. These and other elements of the radio access and core networks are not illustrated, but are well known to those of ordinary skill in the art.

[0040] In one embodiment, the wireless communication system 100 complies with 3GPP 5G New Radio (NR). In some embodiments, the wireless communication system 100 complies with the 3GPP protocol, wherein the NE 104 transmits on the DL using an OFDM modulation scheme, and the UE 102 transmits on the UL using an SC-FDMA scheme or an OFDM scheme. However, more generally, the wireless communication system 100 may implement some other open or proprietary communication protocols, such as WiMAX. The present disclosure is not intended to be limited to any particular wireless communication system architecture or protocol implementation.

[0041] NE 104 can serve multiple UEs 102 within a service area of, for example, a cell (or cell sector) or more cells via wireless communication links. NE 104 transmits DL communication signals to serve UE 102 in time, frequency, and / or spatial domains.

[0042] A communication link is provided between the NE 104 and the UEs 102a, 102b, 102c, and 102d, which may be, for example, a NR UL or DL ​​communication link. Some UEs 102 may communicate with different radio access technologies (RATs) simultaneously, such as NR and LTE. A direct or indirect communication link between two or more NEs 104 may be provided.

[0043] NE 104 may also include one or more transmit receive points (TRPs) 104a. In some embodiments, the network device may be a gNB 104 that controls multiple TRPs 104a. In addition, there is a backhaul between two TRPs 104a. In some other embodiments, the network device may be a TRP 104a controlled by a gNB.

[0044] A communication link is provided between the NE 104, 104a and the UE 102, 102a, respectively, which may be, for example, a NR UL / DL communication link. Some UEs 102, 102a may communicate with different radio access technologies (RATs), such as NR and LTE, simultaneously.

[0045] In some embodiments, the UE 102a may be able to simultaneously communicate with two or more TRPs 104a utilizing a non-ideal backhaul. A TRP may be a transmission point of a gNB. The UE and / or (multiple) TRPs may use multiple beams. The two or more TRPs may be TRPs of different gNBs, or may be the same gNB. That is, different TRPs may have the same cell-ID or different cell-IDs. Throughout this disclosure, the terms "TRP" and "transmitting-receiving identity" may be used interchangeably.

[0046] Figure 2 2 is a schematic block diagram illustrating components of a user equipment (UE) according to one embodiment. UE 200 may include a processor 202, a memory 204, an input device 206, a display 208, and a transceiver 210. In some embodiments, the input device 206 and the display 208 are combined into a single device, such as a touch screen. In some embodiments, UE 200 may not include any input device 206 and / or display 208. In various embodiments, UE 200 may include one or more processors 202 and may not include an input device 206 and / or display 208.

[0047] In one embodiment, the processor 202 may include any known controller capable of executing computer-readable instructions and / or capable of performing logical operations. For example, the processor 202 may be a microcontroller, a microprocessor, a central processing unit (CPU), a graphics processing unit (GPU), an auxiliary processing unit, a field programmable gate array (FPGA), or a similar programmable controller. In some embodiments, the processor 202 executes instructions stored in the memory 204 to perform the methods and routines described herein. The processor 202 is communicatively coupled to the memory 204 and the transceiver 210.

[0048] In one embodiment, the memory 204 is a computer-readable storage medium. In some embodiments, the memory 204 includes a volatile computer storage medium. For example, the memory 204 may include a RAM, which includes a dynamic RAM (DRAM), a synchronous dynamic RAM (SDRAM), and / or a static RAM (SRAM). In some embodiments, the memory 204 includes a non-volatile computer storage medium. For example, the memory 204 may include a hard drive, a flash memory, or any other suitable non-volatile computer storage device. In some embodiments, the memory 204 includes both volatile and non-volatile computer storage media. In some embodiments, the memory 204 stores data related to the triggering conditions for transmitting the measurement report to the network device. In some embodiments, the memory 204 also stores program code and related data.

[0049] In one embodiment, input device 206 may include any known computer input device, including a touch panel, buttons, keyboard, stylus, microphone, etc. In some embodiments, input device 206 may be integrated with display 208, for example, as a touch screen or similar touch-sensitive display.

[0050] In one embodiment, the display 208 may include any known electronically controllable display or display device. The display 208 may be designed to output visual, audio, and / or tactile signals.

[0051] In one embodiment, transceiver 210 is configured to communicate wirelessly with a network device. In certain embodiments, transceiver 210 includes a transmitter 212 and a receiver 214. Transmitter 212 is used to transmit UL communication signals to a network device and receiver 214 is used to receive DL communication signals from a network device.

[0052] The transmitter 212 and the receiver 214 may be any suitable type of transmitter and receiver. Although only one transmitter 212 and one receiver 214 are shown, the transceiver 210 may have any suitable number of transmitters 212 and receivers 214. For example, in some embodiments, the UE 200 includes multiple transmitter 212 and receiver 214 pairs for communicating on multiple wireless networks and / or radio frequency bands, and each transmitter 212 and receiver 214 pair is configured to communicate on a different wireless network and / or radio frequency band.

[0053] Figure 3 3 is a schematic block diagram illustrating components of a network device (NE) 300 according to one embodiment. The NE 300 may include a processor 302, a memory 304, an input device 306, a display 308, and a transceiver 310. As can be appreciated, the processor 302, the memory 304, the input device 306, the display 308, and the transceiver 310 may be similar to the processor 202, the memory 204, the input device 206, the display 208, and the transceiver 210 of the UE 200, respectively.

[0054] In some embodiments, the processor 302 controls the transceiver 310 to transmit a DL signal or data to the UE 200. The processor 302 may also control the transceiver 310 to receive a UL signal or data from the UE 200. In another example, the processor 302 may control the transceiver 310 to transmit a DL signal containing various configuration data to the UE 200.

[0055] In some embodiments, the transceiver 310 includes a transmitter 312 and a receiver 314. The transmitter 312 is used to transmit DL communication signals to the UE 200 and the receiver 314 is used to receive UL communication signals from the UE 200.

[0056] The transceiver 310 may communicate with multiple UEs 200 simultaneously. For example, the transmitter 312 may transmit DL communication signals to the UE 200. As another example, the receiver 314 may simultaneously receive UL communication signals from the UE 200. The transmitter 312 and the receiver 314 may be any suitable type of transmitter and receiver. Although only one transmitter 312 and one receiver 314 are shown, the transceiver 310 may have any suitable number of transmitters 312 and receivers 314. For example, the NE 300 may serve multiple cells and / or cell sectors, wherein the transceiver 310 includes a transmitter 312 and / or a receiver 314 for each cell or cell sector.

[0057] In current NR systems, the PDCCH-Config Information Element (IE) is used to configure UE-specific PDCCH parameters such as the control resource set (CORESET), search space set, and additional parameters for acquiring PDCCH.

[0058] In one PDCCH-Config, each bandwidth part (BWP) of the serving cell supports up to 3 CORESETs and up to 10 search space sets. For multi-PDCCH based multi-TRP operation, according to the agreement in the RAN1#97 meeting, the maximum number of CORESETs per "PDCCH-Config" can be increased to 5 based on UE capabilities.

[0059] IE SearchSpace defines how and / or where to search for PDCCH candidates. Each search space set is associated with a ControlResourceSet. The time domain behavior for monitoring is defined by the parameters monitoringSlotPeriodicity-AndOffset, duration, and monitoringSymbolsWithinSlot. The supported aggregation levels and the candidate numbers for each aggregation level can be flexibly configured. The relevant SearchSpace information elements in technical specification TS 38.331 are described as follows. PDCCH is monitored in a search space set linked to a CORESET. There is no more information in multiple search space sets. Therefore, for the IE SearchSpace described in TS 38.331, it cannot support repeated transmissions of a PDCCH or joint detection of multiple DCI version transmissions.

[0060]

[0061] For multi-TRP operation based on multi-PDCCH, PDCCH can only be supported by a single TRP transmission or multiple TRP transmissions similar to SFN (single frequency network) transmission. For PDSCH transmissions from multiple TRPs, multiple CORESETs can be configured for multiple DCI transmissions. Similar to PDSCH, multiple CORESETs can be used for one PDCCH transmission. According to the search space set configuration defined in Release 15, one search space set is associated with one CORESET, so it is not possible to support the use of one search space set to monitor one PDCCH transmitted from multiple CORESETs. In the present disclosure, a joint search space set is proposed to support PDCCH transmissions from multiple TRPs.

[0062] In one example, the maximum number of monitored PDCCH candidates for a downlink (DL) BWP with a subcarrier spacing (SCS) configuration μ for each time slot UE operating with a single serving cell is defined in the following Table 1, The maximum number of non-overlapping CCEs for a DL BWP with SCS configuration μ for which a UE is expected to monitor corresponding PDCCH candidates for each slot operating with a single serving cell is defined in the following Table 2 For multiple TRP / panel transmissions based on multiple DCIs, the UE is able to support and report R with the range [1 2] through UE capability signaling.

[0063] Table 1: Maximum number of monitored PDCCH candidates per slot for DL ​​BWP with SCS configuration μ∈{0,1,2,3} for a single serving cell

[0064]

[0065] Table 2: Maximum number of non-overlapping CCEs per slot for DL ​​BWP with SCS configuration μ∈{0,1,2,3} for a single serving cell

[0066]

[0067] PDCCH overbooking is the process of discarding non-overlapping CCE and / or PDCCH candidates until the non-overlapping CCE and / or PDCCH candidate restrictions are met. The mapping / discarding rules for UE-specific search space (USS) PDCCH candidates can be based on the search space ID. A higher priority is placed or set for search space sets with lower IDs.

[0068] Figure 44 is a schematic diagram illustrating an example of a DCI transmission with multiple DCI versions from multiple TRPs. In this example, two TRPs 402 and 404 are used to transmit a DCI 400 to a UE 410. The DCI 400 is transmitted with multiple DCI versions (i.e., DCI version 0 and DCI version 1), each version being transmitted on a corresponding CORESET from each TRP (i.e., PDCCH CORESET 0 and PDCCH CORESET 1). The DCI version can be a simple repeated version or a portion of a polarity coded bit. For example, DCI version 0 can be repetition 0 or PDCCH part 0, and DCI version 1 can be repetition 1 or PDCCH part 1.

[0069] A joint search space set is configured for DCI detection, which may consist of multiple component search space sets. In this example, the joint search space set consists of component search space set k and component search space set k+1. The component search space set with the first monitoring, i.e., component search space set k, is defined as the anchor search space set. Another search space set in the joint search space, i.e., component search space set k+1, is associated with the anchor search space set. Here, one search space set is used to monitor the transmission of one DCI version and their association may be fixed or predefined. That is, each component search space set in the component search space set is configured to monitor and detect one DCI version. For the joint search space set, the resource mapping / dropping rule for PDCCH candidates is to place or set the same priority for all component search space sets. In particular, a higher priority may be set for the joint search space set compared to other normal UE-specific search space sets. With the help of signaling indication based on UE capability report, the blind detection behavior may be aligned between the gNB and the UE. For joint decoding, a specific configuration for component search space sets and candidate combinations is proposed to reduce blind detection complexity.

[0070] Because DCI is transmitted in multiple versions from multiple TRPs, the UE can monitor all versions and perform detection based on all monitored transmission versions. In a joint search space set consisting of multiple component search space sets, one component search space set in the component search space set is an anchor search space set, and the other component search space sets are associated with it, that is, associated search space sets. The field associatedSearchSpaceID can be introduced in the IE SearchSpace of the anchor search space set. Other associated component search space IDs are included in this field, as shown below.

[0071]

[0072] This shows an exemplary configuration of an anchor search space set. The additional field associatedSearchSpaceID is conditionally introduced only if this search space set is an anchor search set. The maximum number of associated search space sets is equal to the maximum number of component search space sets minus one.

[0073] For this configuration, it is possible to reuse the anchor search space ID, i.e., the ID of the joint search space set as the ID of the anchor search space set, or define (i.e., specifically assign) a new search space ID for the joint search space set, i.e., as a specially assigned ID. If a new search space ID is introduced, it can be defined as jointsearchSpaceID as an additional optional field.

[0074] The monitoring behavior of each component search space set can be defined according to the corresponding configuration. Some of them may be the same between component search space sets, such as the time domain configuration for monitoring. Some of them may be jointly designed and configured, such as the aggregation level and the number of candidates.

[0075] Figure 5 is a schematic diagram illustrating an example of a priority mapping scheme for a search space set.For monitored PDCCH candidates and non-overlapping CCEs, mapping / dropping rules may be defined for situations where the number of monitored PDCCH candidates or non-overlapping CCEs exceeds the maximum supported number of corresponding candidates or non-overlapping CCEs.

[0076] For example, the maximum supported number of candidate or non-overlapping CCEs may be determined by UE capability signaling based on the corresponding maximum number for a single TRP transmission defined in technical specification TS 38.213 or the reported R for multiple TRP / panel transmissions based on multiple DCIs.

[0077] The counting scheme for monitored PDCCH candidates and non-overlapping CCEs defined in NR Release 15 can be reused. Based on TS38.213, a common search space (CSS) set has a higher priority than a USS set, and a USS set with a lower search space (SS) set index or search space ID has a higher priority. In the present disclosure, the terms "index" and "identification number" can be used interchangeably and can be expressed as "ID". The mapping / discarding priority of a joint search space set can be defined accordingly, and the joint search space set can be composed of multiple component search space sets. The same mapping / discarding behavior can be applied to multiple component search space sets because they are used to monitor and detect one DCI. In addition, for PDCCH transmission, the link quality may not be so robust, and a high aggregation level may be used for transmission. A joint search set may have a higher mapping / discarding priority than other normal UE-specific search space sets. The following principles, i.e., priority mapping rules, can be used to determine the mapping / discarding priority of a joint search space set:

[0078] 1) The priority of the joint search space set is higher than the normal UE-specific search space set, but lower than the priority of the common search space set; or alternatively

[0079] 2) Determine the priority of the joint search space set based on the minimum component search space ID or the anchor search space ID.

[0080] exist Figure 5 In the example shown, the UE is configured with 8 search space sets, including 4 common search space sets (i.e., search space sets 0-3, 502a, 502b, 502c and 502d in the common search space (CSS) set 502), and four UE-specific search space sets (i.e., search space sets 4-7, 504a, 504b, 504c and 504d in the UE-specific search space (USS) set 504).

[0081] In this example, for UE-specific search sets 504, there is one joint search space set 510, e.g., joint search space set 4, and two other normal search space sets, e.g., search space set 5 504c and search space set 7 504d. Joint search space set 4 consists of component search space set 4 and component search space set 6. Component search space set 4 504a is the anchor search space set, and component search space set 6 504b is the associated search space set. Search space set 6 is associated with anchor search space set 4.

[0082] In principle 1), if the total number of monitored PDCCH candidates or non-overlapping CCEs including the common search space set is not greater than the maximum supported number of candidates or non-overlapping CCEs, the joint search space set 4 504a will be mapped after the common search space sets 0-3. Search space sets 4 and 6 have the same priority, and the priority is higher than the priority of search space sets 5 and 7. Here, a higher mapping priority is set for the joint search space set than other UE-specific search space sets. Therefore, the final order of mapping priority is: joint search space set 4 (including component search space set 4 and component search space set 6)>search space set 5>search space set 7 for UE-specific search space set. If the remaining number of monitored PDCCH candidates or non-overlapping CCEs is insufficient for both search space sets 4 and 6, but is sufficient for one search space set (e.g., search space set 4), possible options may include:

[0083] a) Do not map search space sets 4 or 6. That is, search space sets 4 and 6 are not mapped. This can be used in the case of always joint decoding.

[0084] b) Only the anchor space set 4 is mapped, but not the search space set 6. This can be used in case of possible separate / independent decoding.

[0085] In principle 2), the joint search space set 4 as a whole is considered to be a normal search space set, and therefore the mapping priority is determined based on the joint search space ID. Because there are two component search space IDs in the joint search space set, according to principle 2, the mapping priority of the joint search space can be based on the anchor search space ID or the minimum component search space ID, that is, Figure 5 4 in the search space set 4. Here, the ID of the joint search space configured for the joint search space set (e.g., joint search space set 4) can be determined based on the ID of the anchor search space or the minimum component search space ID (i.e., the minimum ID of the component search space set). Therefore, the final mapping priority order is: joint search space set 4 (including component search space set 4 and component search space set 6)>search space set 5>search space set 7. A similar mapping scheme as defined in principle 1) can be applied to component search space sets 4 and 6. Here, a higher priority is associated with a search space set with a smaller ID in the search space ID list, and the search space ID list includes the ID of the joint search space set and does not include any ID of the component search space set separately.

[0086] Figure 6 is a schematic diagram illustrating an example of a PDCCH transmission scheme utilizing multiple TRPs. For PDCCH transmission from multiple TRPs, there are multiple possible transmission schemes. Figure 6Several exemplary PDCCH transmission schemes are shown in FIG. 6 , which consider the transmission of variable DCI versions. The versions of DCI may include: simple repetition, a portion of polarity coded bits, and / or partial repetition based on the aggregation level of the corresponding TRP. In this example, the DCI information bit 600 is encoded into two parts of the coded bit 602, namely, part 0 602a and part 1 602b.

[0087] a. For PDCCH transmission scheme 1 610, simple repetition is used. The same time-frequency resource is used for DCI transmission from multiple TRPs. For example, DCI version 612 can be transmitted from TRP 0 with part 0, and DCI version 614 can be transmitted from TRP 1 with part 0.

[0088] b. For PDCCH transmission scheme 2 620, it is a simple extension of scheme 1, which may refer to repetition with flexible aggregation level. The time-frequency resources of each search space set are determined by the aggregation level that can be adaptively changed according to the channel quality and the system PDCCH load. For example, DCI version 622 may be transmitted from TRP 0 of part 0 with aggregation level a (i.e., AL a), and DCI version 624 may be transmitted from TRP 1 of part 0 with aggregation level b (i.e., AL b).

[0089] c. For PDCCH transmission scheme 3 630, different parts of the coded bits are transmitted from different TRPs, which can be called joint transmission. For example, DCI version 632 can be transmitted from TRP 0 with part 0, while DCI version 634 can be transmitted from TRP 1 with part 1.

[0090] To be compatible with these PDCCH transmission schemes, several UE decoding behaviors for the joint search space set can be defined as follows:

[0091] a.UE decoding behavior 1: UE detects each component search space set independently;

[0092] b. UE decoding behavior 2: The UE detects each component search space set independently, and when DCI is detected in one component search space set, skips the following component search space sets; or

[0093] c. UE decoding behavior 3: UE performs joint decoding on all component search space sets.

[0094] Depending on the gNB configuration based on the UE reported capabilities, one of UE decoding behaviors 1, 2 or 3 may be used.

[0095] For UE decoding behavior 1, it achieves diversity gain in the spatial domain with moderate decoding complexity. It can be used as a decoding behavior for normal needs. It can be used for PDCCH transmission schemes 1 and 2.

[0096] For UE decoding behavior 2, it has the lowest decoding complexity and the shortest delay. Therefore, it has relatively low latency and low detection complexity, and can therefore be used for special requirements, such as fast feedback or power saving. It can be used for PDCCH transmission schemes 1 and 2.

[0097] For UE decoding behavior 3, it has the best performance, that is, it achieves the maximum channel coding gain, such as repetition gain or polar coding gain. In addition, the ACK / NACK feedback time is fixed and friendly to system implementation. However, it has the highest decoding complexity and feedback delay. Because UE decoding behavior 3 has the best performance and the greatest complexity, it can be used for UEs with poor channel quality or high reliability requirements. It is more suitable for PDCCH transmission scheme 3 in which transmission with multiple DCI versions is specially designed, and can be regarded as a transmission with low code rate polar coding.

[0098] In summary, different UE decoding behaviors can be selected based on different requirements and UE capabilities, and the UE decoding behaviors can be matched with the PDCCH transmission scheme. In order to align the decoding behaviors between the gNB and UE sides of the joint search space, the gNB can transmit signaling to the UE to configure the UE with one of the decoding behaviors based on the requirements and the capabilities reported by the UE.

[0099] Fig. 7A is a schematic diagram illustrating an example of a one-to-one mapping between candidates from component search space sets having the same aggregation level. Figure 7B is a schematic diagram illustrating an example of a one-to-one mapping between candidates from component search space sets with different aggregation levels. The total reception complexity of the joint search space set is related to the channel estimation complexity determined by the number of non-overlapping CCEs and the blind detection complexity determined by the number of monitored candidates.

[0100] For each component search space set, the total number of candidates for blind detection is determined by the supported aggregation levels and the candidates for each supported aggregation level. For the joint search space set, the number of candidates increases significantly because there are multiple combinations between the candidates of the component search space sets. For example, if the number of candidates for one component search space set is 44, the total number of blind detections for the joint search space set with two component search space sets without any restrictions is 1936 (i.e., 44*44). Therefore, certain restrictions on the candidate combinations are necessary to reduce the complexity of blind detection.

[0101] In order to match the transmission scheme well with one PDCCH transmitted from multiple TRPs, a one-to-one mapping between candidates from component search space sets can be defined. Specifically, candidates for joint blind detection may have overlapping time-frequency resources, but come from different CORESETs of a TRP. In this way, the time domain monitor configurations of the component search space sets may be the same. In order to ensure spatial division multiplexing, the starting position of each component search space set is required to be the same. According to TS 38.213, different parameters of the hash function can be used for different CORESETs. In detail, Y p,-1 =n RNTI ≠0, for pmod3=0, A p =39827, for pmod3 = 1, A p =39829, for pmod3 = 2, A p =39839, and D = 65537, where p represents the CORESET index and represents the starting position. Therefore, if this is applied to the joint search space set, it will randomize the starting positions of different component search space sets in the joint search space set, which is undesirable. Therefore, one common parameter of the hash function can be used for all component search space sets. A simple scheme is that the common parameter of the hash function is determined based on the CORESET index associated with the anchor search space set. Alternatively, it can be determined based on the CORESET index associated with the component search space set with the lowest ID, or the CORESET index associated with the joint search space set.

[0102] In addition to using common parameters of the hash function, the same number of PDCCH candidates for joint detection is configured for each component search space set. Specifically, for the case of simple repetition or joint transmission (PDCCH transmission schemes 1 and 3), the aggregation level and the corresponding number of candidates for multiple component search space sets are configured to be the same. Then, a one-to-one mapping between candidates from the component search space sets can be used for joint detection to reduce the total number of candidates and thereby reduce decoding complexity. In the present disclosure, unless otherwise stated, the terms "joint detection" and "joint decoding" can be used interchangeably.

[0103] exist Fig. 7AIn the example shown, the joint search space includes search space set 0 710a and search space set 1 720a. The PDCCH candidates used for joint detection include PDCCH candidate 1 701a, PDCCH candidate 2 702a, PDCCH candidate 3 703a, and PDCCH candidate 4 704a. For example, joint candidate 1 701a may include two sub-candidates 712a and 722a transmitted from the same time-frequency resources from different TRPs. Figure 7B In the example shown, the joint search space includes search space set 0 710b and search space set 1 720b. PDCCH candidates 700b for joint detection include PDCCH candidate 1 701b, PDCCH candidate 2 702b, PDCCH candidate 3 703b, and PDCCH candidate 4 704b. For example, joint candidate 1 701b may include two sub-candidates 712b and 722b transmitted from partially overlapping time-frequency resources from different TRPs.

[0104] In both examples, the same starting position 730a and 730b may be derived by the same hash function parameters.A one-to-one mapping between candidates from the two component search space sets is provided.

[0105] like Fig. 7A As shown in , for a PDCCH candidate 700a, a joint detection corresponding to one aggregation level may be performed, where the same time-frequency resources and one-to-one mapping are used for candidates from two component search space sets.

[0106] For the case of repetition with adaptive or flexible aggregation level, the aggregation level of each component search space set can be jointly determined and configured. For example, it can be (2,2), (2,4), (4,4), (4,8), (8,8), (8,16), (16,16), where the first number represents the aggregation level of the first component search space set and the second number represents the aggregation level of the second component search space set. For one jointly configured aggregation level, the number of candidates is configured to be the same value of the component search space set. For example, it may be a value from the set {0,1,2,3,4,5,6,8}. Then, a one-to-one mapping between candidates with different aggregation levels from the component search space sets can be used for joint detection to reduce the total number of candidates and thereby reduce the decoding complexity.

[0107] like Figure 7B As shown, for PDCCH candidates 700b, joint detection with flexible aggregation level may be performed on each candidate, where partially overlapping time-frequency resources and one-to-one mapping may be used for candidates from two component search space sets.

[0108] Figure 8is a flowchart illustrating the steps of transmitting an enhanced PDCCH by a NE using multiple beams from multiple TRPs with a joint search space set according to some embodiments of the present disclosure.

[0109] At step 802, the processor 302 of the NE 300 generates multiple versions of downlink control information (DCI) for transmission from multiple transmit-receive identities (e.g., TRPs) with multiple control resource sets (CORESETs), each CORESET being used for transmission of one of the transmit-receive identities.

[0110] At step 804, the processor 302 configures an information element (IE) indicating a joint search space set for DCI, wherein the joint search space set includes a plurality of component search space sets.

[0111] At step 806, the transmitter 312 of the NE 300 transmits DCI and transmits IE using a plurality of transmit-receive identifiers; wherein each of the component search space sets is configured to monitor and detect one DCI version.

[0112] Fig. 9 is a flowchart illustrating steps for receiving an enhanced PDCCH by a UE utilizing multiple beams from multiple TRPs with a joint search space set according to some embodiments of the present disclosure.

[0113] At step 902, the receiver 214 of the UE 200 receives downlink control information (DCI) having multiple versions from multiple transmit-receive identities having multiple control resource sets (CORESETs), each CORESET being used for transmission of one of the transmit-receive identities.

[0114] At step 904, the receiver 214 receives an information element (IE) indicating a joint search space set for a DCI, wherein the joint search space set includes a plurality of component search space sets.

[0115] At step 906, the processor 202 of the UE 200 decodes the DCI by blindly detecting physical downlink control channel (PDCCH) candidates in a joint search space set based on the IE; wherein each of the component search space sets is configured to monitor and detect one DCI version.

[0116] Various embodiments and / or examples are disclosed to provide exemplary and explanatory information to enable those skilled in the art to put the disclosure into practice. Unless otherwise specifically indicated, features or components disclosed with reference to one embodiment or example also apply to all embodiments or examples.

[0117] Embodiments may be practiced in other specific forms. The described embodiments should be considered in all respects as merely illustrative and not restrictive. Therefore, the scope of the present invention is indicated by the appended claims rather than by the foregoing description. All changes within the meaning and scope of the equivalents of the claims are encompassed within their scope.

Claims

1. A network device (NE), comprising: processor, the processor generating multiple versions of downlink control information (DCI) for transmissions from multiple transmit-receive points having multiple control resource sets (CORESETs), each CORESET being used for transmissions from one of the transmit-receive points, wherein the multiple versions of DCI include: simple repetitions, partial polarity coded bits, and / or partial repetitions based on aggregation levels of corresponding transmit-receive points; and configuring an information element (IE) indicating a joint search space set for the DCI, wherein the joint search space set includes a plurality of component search space sets; and a transmitter that transmits the DCI using the plurality of transmit-receive points and transmits the IE; Each of the component search space sets is configured to monitor and detect a DCI version.

2. The NE according to claim 1, wherein: The plurality of component search space sets include an anchor search space set and a context search space set; and the IE is configured for the anchor search space set and includes an identification number (ID) of the context search space set.

3. The NE according to claim 2, wherein: The IE includes an ID of the joint search space set, where the ID of the joint search space set is the ID of the anchor search space set or a specifically assigned ID.

4. The NE according to claim 1, wherein: A priority mapping rule for monitored physical downlink control channel (PDCCH) candidates and non-overlapping control channel elements (CCEs) is defined for the joint search space set, and a higher mapping priority is set for the joint search space set than other UE-specific search space sets.

5. The NE according to claim 3, wherein: Based on the principle that a higher priority is associated with a search space set having a smaller ID in a search space ID list, priority mapping rules for monitored PDCCH candidates and non-overlapping CCEs are defined for the joint search space set; wherein the search space ID list includes the ID of the joint search space set and does not include any ID of the component search space sets separately.

6. The NE according to claim 5, wherein: The ID of the joint search space set is determined based on the ID of the anchor search space set or the minimum ID of the component search space sets.

7. The NE according to claim 1, wherein: A one-to-one mapping rule between two of the component search space sets is predefined or preconfigured for PDCCH candidates.

8. The NE according to claim 2, wherein: The same hash function parameters are defined, and the hash function parameters are determined by at least one selected from the group consisting of: a CORESET index associated with the anchor search space set, a CORESET index associated with a component search space set with a lowest ID in the component search space set, and a CORESET index associated with the joint search space set.

9. The NE according to claim 2, wherein: The same number of monitored PDCCH candidates is configured for each of the component search space sets for joint detection, and the component search space sets are configured with the same aggregation level or different aggregation levels.

10. The NE according to claim 1, wherein: The transmitter further transmits a signaling to the receiving device for configuring the receiving device to perform at least one selected from the group consisting of: independently detecting each of the component search space sets; independently detecting each of the component search space sets and skipping a later component search space set when a DCI is detected in an earlier component search space set; as well as Joint detection is performed on all of the component search space sets.

11. A user equipment (UE), comprising: receiver, the receiver Receiving downlink control information (DCI) having multiple versions from multiple transmit-receive points having multiple control resource sets (CORESETs), each CORESET being used for transmission by one of the transmit-receive points, wherein the multiple versions of DCI include: Simple repetition, partial polarity coded bits, and / or partial repetition based on the aggregation level of the corresponding transmit-receive points; and receiving an information element (IE) indicating a joint search space set for the DCI, wherein the joint search space set comprises a plurality of component search space sets; and a processor that decodes the DCI by blindly detecting a physical downlink control channel (PDCCH) candidate in the joint search space set based on the IE; Each of the component search space sets is configured to monitor and detect a DCI version.

12. The UE according to claim 11, wherein: The plurality of component search space sets include an anchor search space set and a context search space set; and the IE is configured for the anchor search space set and includes an identification number (ID) of the context search space set.

13. The UE according to claim 12, wherein: The IE includes an ID of the joint search space set, where the ID of the joint search space set is the ID of the anchor search space set or a specifically assigned ID.

14. The UE according to claim 11, wherein: A priority mapping rule for monitored physical downlink control channel (PDCCH) candidates and non-overlapping control channel elements (CCEs) is defined for the joint search space set, and a higher mapping priority is set for the joint search space set than other UE-specific search space sets.

15. The UE according to claim 13, wherein: Based on the principle that higher priority is associated with a search space set with a smaller ID in a list of search space IDs, priority mapping rules for monitored PDCCH candidates and non-overlapping CCEs are defined for the joint search space set; wherein the search space ID list includes the ID of the joint search space set and does not include any ID of the component search space sets separately.

16. The UE according to claim 15, wherein: The ID of the joint search space set is determined based on the ID of the anchor search space set or the minimum ID of the component search space sets.

17. The UE according to claim 11, wherein: A one-to-one mapping rule between two of the component search space sets is predefined or preconfigured for PDCCH candidates.

18. The UE according to claim 12, wherein: The same hash function parameters are defined, and the hash function parameters are determined by at least one selected from the group consisting of: a CORESET index associated with the anchor search space set, a CORESET index associated with a component search space set with a lowest ID in the component search space set, and a CORESET index associated with the joint search space set.

19. The UE according to claim 12, wherein: The same number of monitored PDCCH candidates is configured for each of the component search space sets for joint detection, and the component search space sets are configured with the same aggregation level or different aggregation levels.

20. The UE according to claim 11, wherein: The receiver further receives signaling from a transmitting device for configuring the UE to perform at least one selected from the group consisting of: independently detecting each of the component search space sets; independently detecting each of the component search space sets and skipping a later component search space set when a DCI is detected in an earlier component search space set; as well as Joint detection is performed on all of the component search space sets.

21. A method performed by a network device (NE), comprising: generating, by a processor, multiple versions of downlink control information (DCI) for transmissions from multiple transmit-receive points having multiple control resource sets (CORESETs), each CORESET being used for transmissions from one of the transmit-receive points, wherein the multiple versions of DCI include: simple repetitions, partial polarity coded bits, and / or partial repetitions based on aggregation levels of corresponding transmit-receive points; configuring, by the processor, for the DCI, an information element (IE) indicating a joint search space set, wherein the joint search space set comprises a plurality of component search space sets; transmitting, by a transmitter, the DCI using the plurality of transmit-receive points; and The IE is transmitted by a transmitter; wherein each of the component search space sets is configured to monitor and detect a DCI version.

22. The method according to claim 21, wherein: The plurality of component search space sets include an anchor search space set and a context search space set; and the IE is configured for the anchor search space set and includes an identification number (ID) of the context search space set.

23. The method according to claim 22, wherein: The IE includes an ID of the joint search space set, where the ID of the joint search space set is the ID of the anchor search space set or a specifically assigned ID.

24. The method according to claim 21, wherein: A priority mapping rule for monitored physical downlink control channel (PDCCH) candidates and non-overlapping control channel elements (CCEs) is defined for the joint search space set, and a higher mapping priority is set for the joint search space set than other UE-specific search space sets.

25. The method according to claim 23, wherein: Based on the principle that a higher priority is associated with a search space set having a smaller ID in a search space ID list, priority mapping rules for monitored PDCCH candidates and non-overlapping CCEs are defined for the joint search space set; wherein the search space ID list includes the ID of the joint search space set and does not include any ID of the component search space sets separately.

26. The method according to claim 25, wherein: The ID of the joint search space set is determined based on the ID of the anchor search space set or the minimum ID of the component search space sets.

27. The method of claim 21, wherein: A one-to-one mapping rule between two of the component search space sets is predefined or preconfigured for PDCCH candidates.

28. The method of claim 22, wherein: The same hash function parameters are defined, and the hash function parameters are determined by at least one selected from the group consisting of: a CORESET index associated with the anchor search space set, a CORESET index associated with a component search space set with a lowest ID in the component search space set, and a CORESET index associated with the joint search space set.

29. The method of claim 22, wherein: The same number of monitored PDCCH candidates is configured for each of the component search space sets for joint detection, and the component search space sets are configured with the same aggregation level or different aggregation levels.

30. The method of claim 21, further comprising: Transmitting signaling to a receiving device for configuring the receiving device to perform at least one selected from the group consisting of: independently detecting each of the component search space sets; independently detecting each of the component search space sets and skipping a later component search space set when a DCI is detected in an earlier component search space set; as well as Joint detection is performed on all of the component search space sets.

31. A method performed by a user equipment (UE), comprising: Receiving, by a receiver, downlink control information (DCI) having multiple versions from multiple transmit-receive points having multiple control resource sets (CORESETs), each CORESET being used for transmission by one of the transmit-receive points, wherein the multiple versions of DCI include: simple repetition, partial polarity coded bits, and / or partial repetition based on an aggregation level of the corresponding transmit-receive point; and receiving, by the receiver, an information element (IE) indicating a joint search space set for the DCI, wherein the joint search space set comprises a plurality of component search space sets; and decoding, by a processor, the DCI by blindly detecting a physical downlink control channel (PDCCH) candidate in the joint search space set based on the IE; Each of the component search space sets is configured to monitor and detect a DCI version.

32. The method according to claim 31, wherein: The plurality of component search space sets include an anchor search space set and a context search space set; and the IE is configured for the anchor search space set and includes an identification number (ID) of the context search space set.

33. The method of claim 32, wherein: The IE includes an ID of the joint search space set, where the ID of the joint search space set is the ID of the anchor search space set or a specifically assigned ID.

34. The method of claim 31, wherein: A priority mapping rule for monitored physical downlink control channel (PDCCH) candidates and non-overlapping control channel elements (CCEs) is defined for the joint search space set, and a higher mapping priority is set for the joint search space set than other UE-specific search space sets.

35. The method of claim 33, wherein: Based on the principle that higher priority is associated with a search space set with a smaller ID in a list of search space IDs, priority mapping rules for monitored PDCCH candidates and non-overlapping CCEs are defined for the joint search space set; wherein the search space ID list includes the ID of the joint search space set and does not include any ID of the component search space sets separately.

36. The method of claim 35, wherein: The ID of the joint search space set is determined based on the ID of the anchor search space set or the minimum ID of the component search space sets.

37. The method of claim 31, wherein: A one-to-one mapping rule between two of the component search space sets is predefined or preconfigured for PDCCH candidates.

38. The method of claim 32, wherein: The same hash function parameters are defined, and the hash function parameters are determined by at least one selected from the group consisting of: a CORESET index associated with the anchor search space set, a CORESET index associated with a component search space set with a lowest ID in the component search space set, and a CORESET index associated with the joint search space set.

39. The method of claim 32, wherein: The same number of monitored PDCCH candidates is configured for each of the component search space sets for joint detection, and the component search space sets are configured with the same aggregation level or different aggregation levels.

40. The method of claim 31 further comprising: The device further receives signaling from the transmitting device, and upon receiving the signaling, performs at least one selected from the group consisting of: independently detecting each of the component search space sets; independently detecting each of the component search space sets and skipping a later component search space set when a DCI is detected in an earlier component search space set; as well as Joint detection is performed on all of the component search space sets.

Images