APPARATUS AND METHOD OF JOINT SEARCH SPACE SETTING FOR ENHANCED MULTI-BEAM PDCCH TRANSMISSION FROM MULTIPLE TRPs.

Abstract

Apparatus and methods for joint search space assembly for enhanced multi-beam, multi-TRP PDCCH transmission are described. The apparatus includes: a processor that generates a plurality of downlink control information (DCI) versions for transmission from a plurality of transceiver identities with a plurality of control resource sets (CORESETs), each CORESET being transmitted from one of the transceiver identities; and configures an information element (IE) indicating a joint search space assembly for the DCI, wherein the joint search space assembly comprises a plurality of component search space assemblies; and a transmitter that transmits the DCI and the IE using the plurality of transceiver identities; wherein each of the component search space assemblies is configured to monitor and detect a DCI version.

Description

JOINT SEARCH SPACE SET APPARATUS AND METHOD FOR ENHANCED PDCCH TRANSMISSION WITH MULTIPLE BEAMS FROM MULTIPLE TRPs or? αρηη / ζζηζ / Ε / γίΛΐ FIELD The subject matter described in this document relates generally to wireless communication and more particularly relates to, but is not limited to, joint search space ensemble apparatus and methods for enhanced transmission of the Physical Downlink Control Channel (PDCCH) with multiple beams from multiple transmitting and receiving points (TRPs). BACKGROUND The following abbreviations and acronyms are defined here, at least some of which are mentioned within the specification. Third Generation Partnership Project (3GPP), 5SGeneration (5G), New Radio (NR), 5G Node B (gNB), Long Term Evolution (LTE), LTE Advanced (LTE-A), E-UTRAN 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), receiver or receivers (RX), transmitter or transmitter (TX), acknowledgment (ACK), negative acknowledgment (NACK), physical downlink control channel (PDCCH), physical downlink shared channel (PDSCH), bandwidth share (BWP), channel element control (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). In wireless communication, such as a Third Generation Partnership Project (3GPP) mobile network, a wireless mobile network may provide continuous wireless communication service to a mobile wireless communication terminal, i.e., a user equipment (UE). The wireless mobile network may be formed by a plurality of base stations, and a base station may perform wireless communication with the UEs. 5G New Radio (NR) is the latest in the 3GPP series of standards that supports very high data rates with lower latency compared to its predecessor technology, LTE (4G). Two types of frequency range (FR) are defined in 3GPP. The sub-6 GHz frequency range (450 to 6000 MHz) is called FR1, and the millimeter wave range (24.25 GHz to 52.6 GHz) is called FR2. 5G NR supports both FR1 and FR2 frequency bands. Improvements in multi-TRP / panel transmission are studied, including improved reliability and robustness with ideal and non-ideal backhaul between these TRPs. A TRP is a device for transmitting and receiving signals, and is controlled by a gNB via the backhaul between the gNB and the TRP. A TRP may also be referred to as a transmit-receive identity, or simply an identity. In the current NR system, the physical downlink control channel (PDCCH) is transmitted from a single TRP. With multiple TRPs, time-frequency resources for PDCCH transmission can be sourced from multiple TRPs, thus increasing the resources for PDCCH transmission. Furthermore, space diversity can be exploited in addition to time-frequency diversity. There are many candidate schemes for exploiting the additional resources to improve the reliability and robustness of PDCCH transmission. One candidate scheme is one in which a DCI is transmitted with multiple versions, where each version is transmitted in a control resource set (CORESET) of each TRP. To better support such PDCCH transmission schemes, it is desired to improve the search space set and the related UE detection behavior. BRIEF DESCRIPTION OF THE INVENTION Joint search space ensemble apparatus and methods for enhanced PDCCH transmission with multiple TRP-multiple beams are described. According to a first aspect, there is provided an apparatus, including: a processor that generates a plurality of versions of downlink control information (DCI) for transmission from a plurality of transmitter-receiver identities with a plurality of control resource sets (CORESETs), each CORESET being transmitted from one of the transmitter-receiver identities; and configuring an information element (IE) indicating a set of joint search spaces for the DCI, wherein the set of joint search spaces comprises a plurality of sets of component search spaces; and a transmitter that transmits the DCI and the IE using the plurality of transmit-receive identities; wherein each of the sets of component search spaces is configured to monitor and detect a DCI version. qj αρηη / ζζηζ / Ε / γίΛΐ According to a second aspect, an apparatus is provided, including: a receiver that receives downlink control information (DCI) with a plurality of versions of a plurality of transmit-receive identities with a plurality of control resource sets (CORESETs), each CORESET being transmitted from one of the transmit-receive identities; and receives an information element (IE) indicating a set of joint search spaces for the DCI, wherein the set of joint search spaces comprises a plurality of sets of component search spaces; and a processor that decodes the DCI by blindly detecting Physical Downlink Control Channel (PDCCH) candidates in the set of joint search spaces based on the IE; wherein each of the sets of component search spaces is configured to monitor and detect a DCI version. According to a third aspect, a method is provided, including: generating, by a processor, a plurality of versions of downlink control information (DCI) for transmission from a plurality of transmitter-receiver identities with a plurality of control resource sets (CORESETs), each CORESET being transmitted from one of the transmitter-receiver identities; configuring, by means of the processor, an information element (IE) indicating a set of co-search spaces for the DCI, wherein the set of co-search spaces comprises a plurality of sets of component search spaces; and transmitting, by means of the transmitter, the DCI and the IE using the plurality of transmit-receive identities; wherein each of the sets of component search spaces is configured to monitor and detect a version of DCI. According to a fourth aspect, there is provided a method including: receiving, by a receiver, downlink control information (DCI) having a plurality of versions of a plurality of transmitter-receiver identities with a plurality of control resource sets (CORESETs), each CORESET being transmitted from one of the transmitter-receiver identities; and receiving, by the receiver, an information element (IE) indicating a set of joint search spaces 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 Physical Downlink Control Channel (PDCCH) candidates in the set of joint search spaces based on the IE;where each of the sets of component search spaces is configured to monitor and detect a DCI version; BRIEF DESCRIPTION OF THE DRAWINGS A more specific description of the modalities will be given with reference to the specific modalities illustrated in the accompanying drawings. Since these drawings represent only some modalities and are therefore not considered to limit their scope, the modalities will be described and explained with additional specificity and detail by using the accompanying drawings, in which: Figure 1 is a schematic diagram illustrating a wireless communication system in accordance with some implementations of the present disclosure. Figure 2 is a schematic block diagram illustrating user equipment (UE) components in accordance with some implementations of the present disclosure. Figure 3 is a schematic block diagram illustrating network equipment (NE) components in accordance with some implementations of the present disclosure. Figure 4 is a schematic diagram illustrating an example of a DCI transmission with multiple DCI versions of the multiple TRPs according to some implementations of the present disclosure. Figure 5 is a schematic diagram illustrating an example of a priority mapping scheme of search space sets according to some implementations of the present disclosure. Figure 6 is a schematic diagram illustrating examples of PDCCH transmission schemes with multiple TRPs according to some implementations of the present disclosure. Figure 7A is a schematic diagram illustrating an example of one-to-one mapping between candidate component search space sets with the same aggregation level according to some implementations of the present disclosure. Figure 7B is a schematic diagram illustrating an example of one-to-one mapping between candidates from the search space sets with different aggregation levels in accordance with some implementations of the present disclosure. Figure 8 is a flow diagram illustrating steps of transmitting enhanced PDCCH with multiple beams from multiple TRPs with a set of joint search space by means of NE according to some implementations of the present disclosure. Figure 9 is a flowchart illustrating steps of receiving enhanced PDCCH with multiple beams from multiple TRPs with a set of joint search space by UE according to some implementations of the present disclosure. DETAILED DESCRIPTION As one of skill in the art will appreciate, aspects of the embodiments may be represented as a system, an apparatus, a method, or a program product. Accordingly, the embodiments may take the form of an all-hardware embodiment, an all-software embodiment (including firmware, resident software, microcode, etc.), or an embodiment that combines aspects of both software and hardware. In addition, one or more embodiments may take the form of a program product embodied in one or more computer-readable storage devices that store computer-readable code, computer-readable code, and / or program code, hereinafter referred to as code. The storage devices may be tangible, non-transitory, and / or non-transmittable. Reference throughout this specification to an embodiment, the embodiment, an example, some embodiments, some examples, or similar language means that a particular feature, structure, or characteristic described is included in at least one embodiment or example. Thus, the phrases “in one embodiment,” “in an example,” “in some embodiments,” and similar language throughout this specification may, but need not, refer to the same embodiments. It may or may not include all of the described embodiments. Features, structures, elements, or functions described in connection with one or some embodiments also apply to other embodiments, unless otherwise specified. The terms including, comprising, having, and variations thereof mean including but not limited to, unless otherwise specified. A numbered list of items does not imply that any or all of the items are mutually exclusive, unless otherwise specified. The terms "a," "an," and "the" also refer to one or more items unless otherwise specified. Throughout the disclosure, the terms "first," "second," "third," etc., are used as nomenclature only for references to relevant devices, components, procedural steps, etc., without implying any spatial or chronological order, unless expressly specified otherwise. For example, a "first device" and a "second device" may refer to two separately formed devices, or two parts or components of the same device. In some cases, for example, a first device and a second device may be identical and may have arbitrary names. Similarly, a first step of a method or process may be carried out after or simultaneously with a second step. 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 enumerated elements. For example, A and / or B may refer to any of the following three combinations: existence of A only, existence of B only, and coexistence of A. QRnn / ZZnZ / E / YIAI and B. The 7 character generally indicates an “or” relationship between the associated elements. This, however, can also include a “and” relationship between the associated elements. For example, A / B means either A or B, which can also include the coexistence of both A and B, unless the context requires otherwise. Furthermore, the functions, structures, or features of the embodiments may be combined in any suitable manner. In the following description, numerous specific details, such as programming examples, software modules, user selections, network transactions, database queries, database structures, hardware modules, hardware circuits, hardware chips, etc., are provided to provide a complete understanding of the embodiments. One skilled in the relevant art will recognize, however, that the embodiments may be practiced without one or more of the specific details, or with other methods, components, materials, etc. In other cases, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of an embodiment. Aspects of various embodiments are described below with reference to schematic flowcharts and / or schematic block diagrams of methods, apparatus, systems, and program products. It will be understood that each block of the schematic flowcharts and / or schematic block diagrams, as well as combinations of blocks in the schematic flowcharts and / or schematic block diagrams, may be implemented by code. This code may be provided to a processor of a general-purpose computer, special-purpose computer, or other programmable data processing apparatus for producing a machine, such that instructions executed through the computer processor or other programmable data processing apparatus create a means for implementing the functions or acts specified in the schematic flowcharts and / or schematic block diagrams. The code may also be stored in a storage device that can direct a computer, other programmable data processing apparatus, or other device to operate in a particular manner, such that the instructions stored in the storage device produce an article of manufacture that includes instructions that implement the function / act specified in the schematic flowcharts and / or schematic block diagrams. The schematic flowcharts and / or schematic block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of different apparatus, systems, methods, and program products according to various embodiments. In this regard, each block in the schematic flowcharts and / or schematic block diagrams may represent a module, segment, or portion of code, comprising one or more executable instructions for implementing the specified logical functions. One skilled in the art will recognize, however, that the flowcharts need not necessarily be practiced in the sequence shown and are capable of being practiced without one or more of the specific steps, or with other steps not shown. It should also be noted that, in some alternative implementations, the functions observed in the identified blocks may occur out of the order indicated in the figures. For example, two blocks shown in succession may, in fact, execute substantially concurrently, or the blocks may sometimes execute in reverse order, depending on the functionality involved. Figure 1 is a schematic diagram illustrating a wireless communication system. It represents one 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. Although a specific number of UEs 102 and NE 104 are shown in Figure 1, one of skill in the art will recognize that any number of UEs 102 and NE 104 may be included in the wireless communication system 100. UEs 102 may be referred to as remote devices, remote units, subscriber units, mobiles, mobile stations, users, terminals, mobile terminals, fixed terminals, subscriber stations, user terminals, apparatus, devices, or by other terminology used in the art. In one embodiment, the UEs 102 may be autonomous sensor devices, alarm devices, actuator devices, remote control devices, or the like. In some other embodiments, the UEs 102 may include computing devices, such as desktop computers, laptop computers, personal digital assistants (PDAs), tablets, smartphones, smart TVs (e.g., Internet-connected TVs), set-top boxes, game consoles, security systems (including security cameras), in-vehicle computers, network devices (e.g., routers, switches, modems), or the like. In some embodiments, the UEs 102 include wearable devices, such as smartwatches, fitness bands, head-mounted optical displays, or the like. The UEs 102 may communicate directly with one or more of the NEs 104. The NE 104 may also be referred to as a base station, access point, access terminal, base, node B, eNB, gNB, home node B, relay node, apparatus, device, or by any other terminology used in the art. Throughout this specification, a reference to a base station may refer to any of the aforementioned types of network equipment 104, such as the eNB and the gNB. The NE 104 may be distributed over a geographic region. The NE 104 is generally part of a radio access network that includes one or more controllers communicatively coupled to one or more corresponding NE 104s. The radio access network is generally communicatively coupled to one or more core networks, which may be coupled to other networks, such as the Internet and public switched telephone networks. These and other elements of radio access and core networks are not illustrated, but are generally well known to those of ordinary skill in the art. In one implementation, the wireless communication system 100 complies with a 3GPP 5G Novel Radio (NR). In some implementations, the wireless communication system 100 complies with a 3GPP protocol, where the NEs 104 transmit using an OFDM modulation scheme in the DL and the UEs 102 transmit in the uplink (UL) using an SC-FDMA scheme or an OFDM scheme. However, more generally, the wireless communication system 100 may implement certain other open or proprietary communication protocols, e.g., WiMAX. The present disclosure is not intended to be limited to the implementation of any particular wireless communication system architecture or protocol. The NE 104 may serve multiple UEs 102 within a service area, e.g., a cell (or a cell sector), or multiple cells via a wireless communication link. The NE 104 transmits DL communication signals to serve the UEs 102 in the time, frequency, and / or spatial domains. Communication links are provided between NE 104 and UEs 102a, 102b, 102c, and 102d, which may be NR, UL, or DL ​​communication links, for example. Some UEs 102 may communicate simultaneously with different radio access technologies (RATs), such as NR and LTE. A direct or indirect communication link may be provided between two or more NEs 104. The NE 104 may also include one or more transmission reception points (TRPs) 104a. In some embodiments, the network equipment may be a gNB 104 that controls multiple TRPs 104a. In addition, there is a backhaul between two TRPs 104a. In other embodiments, the network equipment may be a TRP 104a that is controlled by a gNB. Communication links are provided between NE 104, 104a and UEs 102, 102a, respectively, which may, for example, be NR UL / DL communication links. Some UEs 102, 102a may simultaneously communicate with different radio access technologies (RATs), such as NR and LTE. In some embodiments, the UE 102a may communicate with two or more TRPs 104a using a non-ideal backhaul network simultaneously. A TRP may be a backhaul point. QRnn / ZZnZ / E / YIAI transmission of a gNB. The UE and / or TRP(s) may use multiple beams. The two or more TRPs may be TRPs from different gNBs or the same gNB. That is, different TRPs may have the same cell identifier or different cell identifiers. The terms TRP and transmit-receive identity may be used interchangeably throughout the disclosure. Figure 2 is a schematic block diagram illustrating user equipment (UE) components in accordance with one embodiment. A 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 certain embodiments, the UE 200 may not include any input devices 206 and / or display 208. In various embodiments, the UE 200 may include one or more processors 202 and may not include the input device 206 and / or the display 208. The processor 202, in one embodiment, 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. Memory 204, in one embodiment, is a computer-readable storage medium. In some embodiments, memory 204 includes volatile computer storage media. For example, memory 204 may include RAM, including dynamic RAM (DRAM), synchronous dynamic RAM (SDRAM), and / or static RAM (SRAM). In some embodiments, memory 204 includes non-volatile computer-readable media. For example, memory 204 may include a hard disk drive, flash memory, or any other suitable non-volatile computer storage device. In some embodiments, memory 204 includes both volatile and non-volatile computer-readable media. In some embodiments, memory 204 stores data related to trigger conditions for transmitting the measurement report to the network equipment. In some embodiments, memory 204 also stores program code and related data. The input device 206, in one embodiment, may include any known computer input device including a touchpad, a button, a keyboard, a stylus, a microphone, or the like. In some embodiments, the input device 206 may be integrated with the display 208, for example, as a touchscreen or similar touch-sensitive display. Display 208, in one embodiment, may include any known electronically controllable display or screen device. Display 208 may be designed to output visual, audio, and / or haptic signals. The transceiver 210, in one embodiment, is configured to communicate wirelessly with network equipment. In certain embodiments, the transceiver 210 comprises a transmitter 212 and a receiver 214. The transmitter 212 is used to transmit UL communication signals to the network equipment, and the receiver 214 is used to receive DL communication signals from the network equipment. The transmitter 212 and receiver 214 may be any suitable type of transmitters and receivers. Although only one transmitter 212 and one receiver 214 are illustrated, the transceiver 210 may have any suitable number of transmitters 212 and receivers 214. For example, in some embodiments, the UE 200 includes a plurality of transmitter 212 and receiver 214 pairs for communicating on a plurality of wireless networks and / or radio frequency bands, with each transmitter 212 and receiver 214 pair configured to communicate on a different wireless network and / or radio frequency band. Figure 3 is a schematic block diagram illustrating components of network equipment (NE) 300 in accordance with 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 seen, 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. In some embodiments, processor 302 controls transceiver 310 to transmit DL signals or data to UE 200. Processor 302 may also control transceiver 310 to receive UL signals or data from UE 200. In another example, processor 302 may control transceiver 310 to transmit DL signals containing various configuration data to UE 200. In some embodiments, the transceiver 310 comprises 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. The transceiver 310 may simultaneously communicate with a plurality of UEs 200. 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 receiver 314 may be any suitable type of transmitters and receivers. Although only one transmitter 312 and one receiver 314 are illustrated, 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, where the transceiver 310 includes a transmitter 312 and a receiver 314 for each cell or cell sector. In the current NR system, the PDCCH-Config Information Element (IE) is used to configure DE-specific PDCCH parameters, such as control resource sets (CORESET), search space sets, and additional parameters for acquiring the PDCCH. In a PDCCH-Config, a maximum of 3 CORESETs and a maximum of 10 search space sets per bandwidth portion (BWP) are supported for the serving cell. For multi-TRP operation based on multiple PDCCHs, the maximum number of CORESETs per “PDCCH-Config” can be increased to 5 depending on UE capacity in accordance with the agreements of RAN1 #97 meeting. The 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 number of candidates for each aggregation level can be flexibly configured. The related SearchSpace information element in the technical specification TS 38.331 is described below. A PDCCH is monitored in a search space set that is linked with a CORESET. No further information exists between multiple search space sets. Therefore, the IE SearchSpace described in TS 38.331 cannot support joint detection for repeated transmission or multiple DCI version transmission for a PDCCH. SearchSpace ::= SEQUENCE { searchSpaceld SearchSpaceld, control ResourceSetld ControIResourceSetld OPTIONAL, -- Cond SetupOnly monitoringSlotPeriodicityAndOffset CHOICE { sil NULL, sl2 INTEGER (0..1),} OPTIONAL, - Cond Setup duration INTEGER (2..2559) OPTIONAL, Need R QRnn / ZZnZ / E / YIAI monitoringSymbolsWithinSlot BIT STRING (SIZE (14)) OPTIONAL, -Cond Setup nrofCandidates SEQUENCE{ aggregationLevell aggregationLevel2 aggregationLevel4 aggregationLevel8 aggregationLevell 6} ENUMERATED {ηθ, n1, n2, n3, n4, n5, n6, n8}, ENUMERATED {n0, n1, n2, n3, n4, n5, n6, n8}, ENUMERATED {n0, n1, n2, n3, n4, n5, n6, n8}, ENUMERATED {n0, n1, n2, n3, n4, n5, n6, n8}, ENUMERATED {n0, n1, n2, n3, n4, n5, n6, n8} OPTIONAL, -Cond Setup searchSpaceType CHOICE { common SEQUENCE{ OPTIONAL, - Need R h ue-Specific dci-Formats 1}, SEQUENCE{ ENUMERATED {formatsO-O-And-1-0, formatsO-1-And-1- QAnn / ZZnZ / E / YIAI} } OPTIONAL - Cond Setup} For multi-TRP operation based on multiple PDCCHs, PDCCH can only support a single TRP transmission or multiple TRP transmissions similar to SFN (Single Frequency Network) transmissions. For PDSCH transmission 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, a search space set is associated with a CORESET, so it is not possible to support the use of a search space set to monitor a PDCCH transmitted from multiple CORESETs. In this description, a joint search space set is proposed to support PDCCH transmission from multiple TRPs. λ λ max,slot, / / In one example, the maximum number of monitored PDCCH candidates, mccn , for a subcarrier spacing (SCS) downlink (DL) BWP configuration for a UE per slot for single serving cell operation is defined in Table z^max^sloi / / below. The maximum number of non-overlapping CCEs, PDCCH, for a DL BWP with SOS configuration that a UE is expected to monitor corresponding PDCCH candidates per slot for single serving cell operation is defined in Table 2 below. For multiple DCI-based multiple panel / TRP transmission, a UE may support and report R with a range of [1 2] via UE Capability Signaling. » λ max.slot^ / Table 1: Maximum number of monitored PDCCH candidates per slot for a DL BWP with SCS configuration μ e'(λ1,2,3) for a single serving cell qj QRnn / zznz / E / YiAi μ Maximum number of PDCCH candidates monitored per slot and per serving cell · 0 44 1 36 2 22 3 20 Table 2: Maximum number of non-overlapping CCEs per slot for a DL BWP with SCS configuration μ e^0,1,2,3 for a single serving cell μ Maximum number of non-overlapping CCEs per xt max, slot, μ slot and per PDCCH serving cell 0 56 1 56 2 48 3 32 PDCCH overloading is a process that discards non-overlapping CCE and / or PDCCH candidates until the non-overlapping CCE and / or PDCCH candidate limits are reached. The mapping / dropping rule for UE-specific search space (USS) PDCCH candidates may be based on the search space ID. A higher priority is set for a set of search spaces with a lower ID. Figure 4 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 for transmission of 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 in a corresponding CORESET, i.e., PDCCH CORESET 0 and PDCCH CORESET 1, from each TRP. The DCI versions may be a simply repeated version or a polar coded bit portion. For example, DCI version 0 may be PDCCH repeat 0 or portion 0, and DCI version 1 may be PDCCH repeat 1 or portion 1. A set of joint search spaces is configured for DCI detection, which may consist of multiple component search space sets. In this example, the joint search space set consists of the k component search space set and the k+1 component search space set. The set of component search spaces with the first monitoring, i.e., the k component search space set, is defined as the anchor search space set. The other set of search spaces in the joint search space, i.e., the k+1 component search space set, is associated with the anchor search space set. Here, a set of search spaces is used to monitor the transmission of a DCI version, and their binding may be fixed or predefined.That is, each of the component search space sets is configured to monitor and detect a DCI version. For the joint search space set, the resource mapping / elimination rule for PDCCH candidates is to set or establish the same priority for all component search space sets. In particular, the joint search space set can be set to a higher priority compared to other normal UE-specific search space sets. Blind detection behavior can be aligned between gNB and UE with the help of signaling indication based on the UE Capability Report. For joint decoding, special configurations in component search space sets and candidate combinations are proposed to reduce the complexity of blind detection. Since a DCI is transmitted with multiple versions from multiple TRPs, a UE can monitor all versions and perform detection based on all monitored transmission versions. In the joint search space set consisting of multiple component search space sets, one of the component search space sets is an anchor search space set, and other component search space sets are associated with it, namely associated search space sets. An associated search space ID field may be entered in the SearchSpace of the IE of the anchor search space set. Other associated component search space IDs are included in this field, as shown below. - TAG-SEARCHSPACE-START SearchSpace ::= searchSpaceld controIResourceSetld SEQUENCE{ SearchSpaceld, ControIResourceSetld OPTIONAL, Cond SetupOnly associatedSearchSpaceID SEQUENCE (SIZE (1 ..maxNrofassociatedSearchSpaceSets)) OF SearchSpaceld OPTIONAL, -Cond Setup monitoringSlotPeriodicityAndOffset CHOICE {... } OPTIONAL, - Cond Setup duration INTEGER (2..2559) OPTIONAL, - Need R monitoringSymbolsWithinSlot BIT STRING (SIZE (14)) OPTIONAL, Cond Setup nrofCandidates SEQUENCE {} OPTIONAL, - Cond Setup searchSpaceType CHOICE {} OPTIONAL - Cond Setup} This shows an example configuration of the anchor search space set. The additional field associateSearchSpaceID is conditionally introduced only when 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. For this configuration, you can either reuse the anchor search space ID, i.e., the joint search space set ID is the anchor search space set ID, or define (i.e., specifically assign) a new search space ID for the joint search space set, i.e., a specifically assigned ID. If the new search space ID is imported, it can be defined as jointsearchSpaceID as an additional optional field. Monitoring behaviors for each set of component search spaces can be defined according to the corresponding configurations. Some of these behaviors may be the same across sets of component search spaces, such as the time domain configuration for monitoring. Some of these behaviors can be designed and configured jointly, such as the aggregation levels and the number of candidates. Figure 5 is a schematic diagram illustrating an example of a priority mapping scheme for search space sets. For monitored PDCCH candidates qj and non-overlapping CCEs, a mapping / dropping rule may be defined for the case where the number of monitored PDCCH candidates or non-overlapping CCEs exceeds the corresponding maximum supported number of non-overlapping candidates or CCEs. For example, the maximum supported number of non-overlapping candidates or CCEs may be determined based on the corresponding maximum number defined in the TS 38.213 technical specification for single TRP transmission, or a reported R for multiple TRP / panel transmission based on multiple DCIs per UE capability signaling. The counting scheme for monitored PDCCH candidates and non-overlapping CCEs defined in NR Release 15 may be reused. According to 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 this disclosure, the terms index and identification number may be used interchangeably and may be represented as IDs. The mapping / elimination priority for the joint search space set, which may consist of multi-component search space sets, may be defined accordingly. The same mapping / elimination behavior may be applied for multi-component search space sets as they are used to monitor and detect a DCI.Furthermore, link quality may not be as robust for PDCCH transmission, and a high level of aggregation may be required for transmission. The joint search set may have a higher priority for mapping / discarding compared to other normal UE-specific search space sets. The following principles, i.e., priority mapping rules, may be used to determine the mapping / discarding priority for the joint search space set: 1) the set of joint search spaces has a higher priority than the sets of normal UE-specific search spaces, but a lower priority than the sets of common search spaces; or alternatively 2) The priority for the joint search space set is determined based on the minimum component search space ID or the anchor search space ID. In the example shown in Figure 5, a UE is configured with eight search space sets, including four common search space sets (namely, search space sets 0-3, 502a, 502b, 502c, and 502d in Common Search Space Sets (CSS) 502) and four UE-specific search space sets (namely, search space set 4-7, 504a, 504b, 504c, and 504d in UE-Specific Search Space Sets (USS) 504). QRnn / ZZnZ / E / YIAI In this example, for UE-specific search sets 504, there is a set of joint search spaces 510, e.g., joint search space set 4, and two other sets of regular search spaces, 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 an anchor search space set, and component search space set 6 504b is an associated search space set. Search space set 6 is associated with anchor search space set 4. In principle 1), the joint search space set 4 504a shall be allocated after the common search space sets 0-3 if the total number of supervised PDCCH candidates or non-overlapping CCEs, including the common search space sets, does not exceed the maximum supported number of non-overlapping candidates or CCEs. Search space sets 4 and 6 have the same priority and are higher than that of search space sets 5 and 7. Here, a higher mapping priority is set for the joint search space set than for other UE-specific search space sets.Therefore, the final mapping priority is in the following order: 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 the UE-specific search space sets. If the remaining number of monitored PDCCH candidates or non-overlapping CCEs is not sufficient for search space sets 4 and 6, but is sufficient for one search space set, e.g., search space set 4, possible options may include: a) Do NOT map the search space set 4 or 6. That is, the search space sets 4 and 6 are not mapped. This can be used for the case of always-joint decoding. b) It only allocates the anchor space set 4 but does NOT allocate the search space set 6. This can be used for the case of possible separate / independent decoding. In principle 2), the joint search space set 4 as a whole is regarded as a normal search space set, and thus the mapping priority is determined based on the joint search space ID. Since there are two component search space IDs in the joint search space set, according to principle 2, the mapping priority for the joint search space qj QAnn / zznz / E / YiAi can be determined based on the anchor search space ID or the minimum component search space ID, that is, the joint search space 4 in Fig. 5.Here, the joint search space ID, if set (e.g., joint search space set 4) for the joint search space set, can be determined based on the anchor search space ID or the minimal component search space ID (i.e., the smallest component search space set ID). Therefore, the final mapping priority is in the following order: 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. Similar mapping schemes 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 having a smaller ID among a list of search space IDs, and the list of search space IDs includes the ID of the joint search space set and does not include any IDs of the component search space composites individually. Figure 6 is a schematic diagram illustrating examples of PDCCH transmission schemes with multiple TRPs. There are multiple possible transmission schemes for PDCCH transmission from multiple TRPs. Several exemplary PDCCH transmission schemes are shown in Figure 6, where transmission for variable DCI versions is considered. The DCI versions may include: a simple repeat, a polar coded bit portion, and / or a partial repeat based on an aggregation level of a corresponding TRP. In this example, DCI information bits 600 are encoded in two coded bit portions 602, namely, portion 0 602a and portion 1 602b. a. For the PDCCH 1 610 transmission scheme, simple repetition is used. The same time-frequency resource is used for DCI transmission from multiple TRPs. For example, DCI version 612 may be transmitted from TRP 0 with part 0, and DCI version 614 may be transmitted from TRP 1 with part 0. b. For PDCCH transmission scheme 2 620, it is a simple extension of Scheme 1, which can be called soft-aggregation-level repetition. The time-frequency resources for each set of search spaces are determined by the aggregation level which can be adaptively changed according to the channel quality and PDCCH load of the system. For example, DCI version 622 may be transmitted from TRP 0 with part 0 of aggregation level a (i.e. AL a), and DCI version 624 may be transmitted from TRP qj αρηη / ζζηζ / Ε / γίΛA with part 0 of aggregation level b (i.e. AL b). c. For the PDCCH 3 630 transmission scheme, different parts of coded bits are transmitted from different TRPs, which can be referred to as joint transmission. For example, DCI version 632 can be transmitted from TRP 0 with part 0, and DCI version 634 can be transmitted from TRP 1 with part 1. To support these PDCCH transmission schemes, several UE decoding behaviors can be defined for the set of joint search spaces as follows: d. UE decoding behavior 1: UE detects each set of component search spaces independently; e. UE Decoding Behavior 2: The UE detects each set of component search spaces independently and skips the last sets of component search spaces when it detects a DCI in a set of component search spaces; or f. UE Decoding Behavior 3: UE performs joint decoding for all sets of component search spaces. One of the UE decoding behaviors 1, 2 or 3 can be used, depending on the gNB configuration according to the reported capability of the UE. For UE decoding behavior 1, it achieves spatial domain diversity gain with moderate decoding complexity. It can serve as a decoding behavior for a normal requirement. It can be used for PDCCH transmission schemes 1 and 2. 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, e.g., fast feedback or power saving. It can be used for PDCCH transmission schemes 1 and 2. For UE decoding behavior 3, it has the best performance, i.e., it achieves the largest channel coding gain, such as repetition gain or polar coding gain. In addition, the ACK / NACK feedback time is fixed and is therefore friendly to system implementation. However, it has the highest decoding complexity and feedback delay. Since it has the best performance and the highest complexity, UE decoding behavior 3 can be used for UEs with the worst channel quality or high reliability requirements. It is most suitable for the PDCCH 3 transmission scheme where transmission with multiple DCI versions is required. QRnn / ZZnZ / E / YIAI specifically designed and can be considered as a lower code rate polar coded transmission. In summary, different UE decoding behaviors can be selected according to different UE requirements and capabilities, and the UE decoding behavior can be matched to the PDCCH transmission scheme. To align the decoding behavior between the gNB and the UE sides for the joint search space, the gNB may transmit signaling to the UE to configure the UE with one of the decoding behaviors according to the requirement and capability reported by the UE. Figure 7A is a schematic diagram illustrating an example of a one-to-one mapping between candidate component search space sets with the same aggregation level. Figure 7B is a schematic diagram illustrating an example of a one-to-one mapping between candidate search space sets with aggregation levels. The total receive complexity for a joint search space set is related to the channel estimation complexity, which is determined by the number of non-overlapping CCEs, and the blind detection complexity, which is determined by the number of supervised candidates. 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 markedly since there are many combinations among the candidates from the component search space sets. For example, if the candidate number for a one-component search space set is 44, the total blind detection number for a joint search space set that has two-component search space sets is 1936 (i.e., 44*44) without any restrictions. Therefore, some restriction on the combination of candidates is necessary to reduce the complexity of blind detection. To properly match transmission schemes to a PDCCH transmitted from multiple TRPs, a one-to-one mapping between candidate component search space sets can be defined. In detail, candidates for joint blind detection may have overlapping time-frequency resources but come from different TRP CORESETs. In this view, the time-domain monitor settings can be the same for the component search space sets. To ensure space-division multiplexing, the same start position is required for each component search space set. According to TS 38.213, the following can be used: QRnn / ZZnZ / E / YIAI different parameters for the Hash function for different CORESETs. In detail, A = 39827 pmod3 = 0 A„= 39829 , , |JcU d , pcll d ^mod3 = l!A„= 39839para pmod 3 = 2,y^5537,where pd^e| C0RESET indexyY A denotes the starting position. Therefore, if this is applied to the set of joint search spaces, it will randomize the starting position for different sets of component search spaces in the set of joint search spaces, which is not desirable. Therefore, a common parameter for the Hash function can be used for all sets of component search spaces. A simple scheme is that the common parameter for the Hash function is determined based on the CORESET index associated with the set of anchor search spaces.Alternatively, it may be determined based on the CORESET index associated with the set of component search spaces with the lowest ID, or the CORESET index associated with the set of joint search spaces. In addition to using a common parameter for the hash function, the same number of PDCCH candidates for joint detection is configured for each component search space set. In detail, for simple repetition or joint transmission cases (PDCCH transmission schemes 1 and 3), the aggregation level and the corresponding candidate number are configured equal for multi-component search space sets. Then, a one-to-one mapping between candidate component search space sets can be used for joint detection to reduce the total number of candidates and thus the decoding complexity. In this description, the terms joint detection and joint decoding may be used interchangeably unless otherwise specified. In the example shown in Figure 7A, a joint search space includes search space set 0 710a and search space set 1 720a. PDCCH candidates for joint detection include PDCCH candidate 1 701a, PDCCH candidate 2 702a, PDCCH candidate 3 703a, and PDCCH candidate 4 704a. Joint candidate 1 701a, for example, may include two sub-candidates 712a and 722a transmitted from the same time-frequency resource from different TRPs. In the example shown in Figure 7B, a joint search space includes search space set 0 710b and search space set 1 720b. PDCCH candidates for joint detection 700b include PDCCH candidate 1 701b, PDCCH candidate 2 702b, PDCCH candidate 3 703b, and PDCCH candidate 4 704b.The joint candidate 1 701b, for example, may include two sub-candidates 712b and 722b or? αρηη / ζζηζ / Ε / γίΛΐ transmitted from overlapping partial time-frequency resources from different TRPs. In both examples, the same starting position 730a and 730b can be derived using the same hash function parameter. A one-to-one mapping between candidates from two sets of component search spaces is provided. As shown in Figure 7A, for PDCCH 700a candidates, joint detection may be performed corresponding to an aggregation level, where the same time-frequency resource and one-to-one mapping are used for two-component search space set candidates. For the case of repetition with adaptive or flexible aggregation level, the aggregation level for each set of component search spaces can be determined and configured jointly. For example, it can be (2, 2), (2, 4), (4, 4), (4, 8), (8, 8), (8, 16), (16,16), where the first number indicates the aggregation level for the first component search space set and the second number indicates the aggregation level for the second component search space set. For a jointly configured aggregation level, the candidate number is configured as the same value for the sets of component search spaces. For example, it can be a value from the set {0, 1, 2, 3, 4, 5, 6, 8}.Thus, one-to-one mapping between candidates with different levels of aggregation of component search space sets can be used for joint detection to reduce the total number of candidates and thus the decoding complexity. As shown in Figure 7B, for PDCCH 700b candidates, detection with flexible aggregation level can be performed for each candidate, where partial overlapping time-frequency resources and one-to-one mapping are used for candidates from two-component search space sets. Figure 8 is a flow diagram illustrating steps of transmitting enhanced PDCCH with multiple beams from multiple TRPs with a set of joint search space by means of NE according to some implementations of the present disclosure. In step 802, the processor 302 of the NE 300 generates a plurality of versions of downlink control information (DCI) for transmission from a plurality of transmit-receive identities (e.g., TRPs) with a plurality of control resource sets (CORESETs), each CORESET being transmitted from one of the transmit-receive identities. In step 804, the processor 302 configures an information element (IE) indicating or? aρηη / ζζηζ / Ε / γίΛA a set of joint search spaces for the DCI, wherein the set of joint search spaces comprises a plurality of sets of component search spaces. In step 806, the transmitter 314 of the NE300 transmits the DCI and the IE using the plurality of transmit-receive identities; where each of the sets of component search spaces is configured to monitor and detect a DCI version. Figure 9 is a flowchart illustrating steps of receiving enhanced PDCCH with multiple beams from multiple TRPs with a set of joint search space by UE according to some implementations of the present disclosure. In step 902, the receiver 214 of the UE 200 receives downlink control information (DCI) with a plurality of versions of a plurality of transmit-receive identities with a plurality of control resource sets (CORESETs), each CORESET being transmitted from one of the transmit-receive identities. In step 904, the receiver 214 receives an information element (IE) indicating a set of joint search spaces for the DCI, wherein the set of joint search spaces comprises a plurality of sets of component search spaces. In step 906, the processor 202 of the UE 200 decodes the DCI by blindly detecting Physical Downlink Control Channel (PDCCH) candidates in the set of joint search spaces based on the IE; where each of the sets of component search spaces is configured to monitor and detect a DCI version. Various embodiments and / or examples are disclosed to provide illustrative and explanatory information to enable one of ordinary skill in the art to practice the disclosure. Features or components disclosed with reference to one embodiment or example are also applicable to all embodiments or examples unless specifically indicated otherwise. The embodiments may be practiced in other specific ways. The embodiments described should be considered in all respects only as illustrative and not restrictive. The scope is, therefore, indicated by the appended claims rather than by the foregoing description. All changes that fall within the meaning and range of equivalence of the claims should be included within their scope.

Claims

1. An apparatus characterized in that it comprises: a processor that generates a plurality of downlink control information (DCI) versions for transmission from a plurality of transmit-receive identities with a plurality of control resource sets (CORESETs), each CORESET being used for transmission from one of the transmit-receive identities; and configures an information element (IE) indicating a set of joint search spaces for the DCI, wherein the set of joint search spaces comprises a plurality of component search space sets; and a transmitter that transmits the DCI using the plurality of transmit-receive identities and transmits the IE; wherein each of the component search space sets is configured to monitor and detect a DCI version.

2. The apparatus according to claim 1, characterized in that the plurality of component search space assemblies comprises an anchor search space assembly and an associated search space assembly; and the IE is configured to establish the anchor search space and includes an identification number (ID) of the associated search space assembly.

3. The apparatus according to claim 1, characterized in that the IE includes a joint search space set ID, the joint search space set ID is an anchor search space set ID, or a specifically assigned ID.

4. The apparatus according to claim 1, characterized in that a priority mapping rule for the monitored physical downlink control channel (PDCCH) candidates and non-overlapping control channel elements (CCE) is defined for the set of joint search spaces, and a higher mapping priority is established for the set of joint search spaces than for other UE-specific search space sets. QRnn / ZZnZ / E / YIAI 5. The apparatus according to claim 3, characterized in that a priority mapping rule is defined for monitored PDCCH and CCE candidates that do not overlap for the joint search space set, based on the principle that a higher priority is associated with a search space set that has a smaller ID among a list of search space IDs; wherein the list of search space IDs includes the ID of the joint search space set and does not include any IDs of the search space sets of individual components.

6. The apparatus according to claim 5, characterized in that the ID of the joint search space set is determined based on the ID of the anchor search space set or the smallest ID of the component search space sets.

7. The apparatus according to claim 1, characterized in that a one-to-one mapping rule between two of the component search space sets is predefined or preconfigured for PDCCH candidates to reduce joint detection complexity.

8. The apparatus according to claim 2, characterized in that a single Hash function parameter is defined which is determined by at least one selected from a group consisting of: a CORESET index associated with the anchor search space set, a CORESET index associated with one of the component search space sets with the lowest ID, and a CORESET index associated with the joint search space set.

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

10. The apparatus according to claim 1, characterized in that the plurality of IDC versions comprise: a simple repeat, a polar encoding bit portion, and / or a partial repeat based on an aggregation level of a respective transmit-receive identity. qj QAnn / zznz / E / YiAi 11. The apparatus according to claim 1, characterized in that the transmitter further transmits a signal to a receiving device to configure the receiving device to perform at least one selected from a group consisting of: detecting each of the component search space sets independently; detecting each of the component search space sets independently and skipping the last component search space sets when it detects a DCI in a component search space set; and performing joint detection for all component search space sets.

12. An apparatus characterized in that it comprises: a receiver that receives Downlink Control Information (DCI) with a plurality of versions of a plurality of transmit-receive identities with a plurality of control resource sets (CORESETs), each CORESET being transmitted from one of the transmit-receive identities; and receives an information element (IE) indicating a set of joint search spaces for the DCI, wherein the set of joint search spaces comprises a plurality of component search space sets; and a processor that decodes the DCI by blindly detecting the Physical Downlink Control Channel (PDCCH) candidates in the joint search space set in the IE; wherein each of the component search space sets is configured to monitor and detect a version of the DCI.

13. The apparatus according to claim 12, characterized in that the plurality of component search space assemblies comprises an anchor search space assembly and an associated search space assembly; and the IE is configured to establish the anchor search space and includes an identification number (ID) of the associated search space assembly.

14. The apparatus according to claim 12, characterized in that the IE includes a joint search space set ID, the joint search space set ID being an anchor search space set ID, or a specifically assigned ID. QAnn / ZZnZ / E / YIAI 15. The apparatus according to claim 12, characterized in that a priority mapping rule for monitored physical downlink control channel (PDCCH) candidates and non-overlapping control channel (CCE) elements is defined for the joint search space set, and a higher mapping priority is established for the joint search space set than for other UE-specific search space sets.

16. The apparatus according to claim 14, characterized in that a priority mapping rule is defined for monitored PDCCH and CCE candidates that do not overlap for the joint search space set, based on the principle that a higher priority is associated with a search space set that has a smaller ID among a list of search space IDs; wherein the list of search space IDs includes the ID of the joint search space set and does not include any IDs of the search space sets of individual components.

17. The apparatus according to claim 16, characterized in that the ID of the joint search space set is determined based on the ID of the anchor search space set or the smallest ID of the component search space sets.

18. The apparatus according to claim 12, characterized in that a one-to-one mapping rule between two of the component search space sets is predefined or preconfigured for PDCCH candidates.

19. The apparatus according to claim 13, characterized in that a single Hash function parameter is defined which is determined by at least one selected from a group consisting of: a CORESET index associated with the anchor search space set, or a CORESET index associated with one of the component search space sets with the lowest ID and a CORESET index associated with the joint search space set.

20. The apparatus according to claim 13, characterized in that the same number of monitored PDCCH candidates are configured for each of the component search space sets for joint detection, and the component search space sets are configured with the same level of QRnn / ZZnZ / E / YIAI 28 aggregation or different levels of aggregation.

21. The apparatus according to claim 12, characterized in that the plurality of DCI versions comprise: a simple repetition, a polar encoding bit part and / or a partial repetition based on an aggregation level of a respective transmit-receive identity.

22. The apparatus according to claim 12, characterized in that the receiver further receives a signal from a transmitting device to configure the apparatus to perform at least one selected from a group consisting of: detecting each of the component search space sets independently; detecting each of the component search space sets independently and skipping the last component search space sets upon detecting an IDC in a component search space set; and performing joint detection for all component search space sets.

23. A method characterized in that it comprises: generating, by means of a processor, a plurality of downlink control information (DCI) versions for transmission from a plurality of transmit-receive identities with a plurality of control resource sets (CORESETs), each CORESET being used for transmission from one of the transmit-receive identities; configuring, by means of the processor, an information element (IE) indicating a set of joint search spaces for the DCI, wherein the set of joint search spaces comprises a plurality of component search space sets; transmitting, by means of the transmitter, the DCI used by the plurality of transmit-receive identities; and transmitting, by means of the transmitter, the IE; wherein each of the component search space sets is configured to monitor and detect a DCI version.

24. The method according to claim 23, characterized in that the plurality of component search space assemblies comprises an anchor search space assembly and an associated search space assembly; and the IE is configured to establish the anchor search space and includes an identification number (ID) of the associated search space assembly.

25. The method according to claim 23, characterized in that the IE includes a joint search space set ID, the joint search space set ID is an anchor search space set ID, or a specifically assigned ID.

26. The method according to claim 23, characterized in that a priority mapping rule for monitored physical downlink control channel (PDCCH) candidates and non-overlapping control channel elements (CCE) is defined for the joint search space set, and a higher mapping priority is established for the joint search space set than for other UE-specific search space sets.

27. The method according to claim 25, characterized in that a priority mapping rule is defined for monitored PDCCH and CCE candidates that do not overlap for the joint search space set, based on the principle that a higher priority is associated with a search space set that has a smaller ID among a list of search space IDs; wherein the list of search space IDs includes the ID of the joint search space set and does not include any IDs of the search space sets of individual components.

28. The method according to claim 27, characterized in that the ID of the joint search space set is determined based on the ID of the anchor search space set or the smallest ID of the component search space sets.

29. The method according to claim 23, characterized in that a one-to-one mapping rule between any two of the component search space sets is predefined or preconfigured for PDCCH candidates to reduce joint detection complexity.

30. The method according to claim 24, characterized in that a single Hash function parameter is defined which is determined by at least one QRnn / ZZnZ / E / YIAI selected from a group consisting of: a CORESET index associated with the anchor search space set, a CORESET index associated with one of the component search space sets with the lowest ID, and a CORESET index associated with the joint search space set.

31. The method according to claim 24, characterized in that the same number of monitored PDCCH candidates are configured for each of the component search space sets for joint detection, and the component search space sets are configured with the same level of aggregation or different levels of aggregation.

32. The method according to claim 23, characterized in that the plurality of DCI versions comprise: a simple repetition, a polar encoding bit part and / or a partial repetition based on an aggregation level of a respective transmit-receive identity.

33. The method according to claim 23, further characterized in that it comprises: transmitting a signal to a receiving device to configure the receiving device to perform at least one selected from a group consisting of: detecting each of the component search space sets independently; detecting each of the component search space sets independently and skipping the last component search space sets when it detects a DCI in a component search space set; and performing joint detection for all component search space sets.

34. A method characterized in that it comprises: receiving, by means of a receiver, downlink control information (DCI) with a plurality of transmit-receive identities with a plurality of control resource sets (CORESETs), each CORESET being transmitted from its use for transmission by one of the transmit-receive identities; and receiving, by means of the receiver, an information element (IE) indicating a set of joint search spaces for the DCI, wherein the set of joint search spaces comprises a plurality of component search space sets; and decoding, by means of a processor, the DCI by blindly detecting candidates for QRnn / ZZnZ / E / YIAI Physical Downlink Control Channel (PDCCH) in the joint search space set in the IE; wherein each of the component search space sets is configured to monitor and detect a version of the DCI.

35. The method according to claim 34, characterized in that the plurality of component search space assemblies comprises an anchor search space assembly and an associated search space assembly; and the IE is configured to establish the anchor search space and includes an identification number (ID) of the associated search space assembly.

36. The method according to claim 34, further characterized in that the IE includes a joint search space set ID, the joint search space set ID being an anchor search space set ID, or a specifically assigned ID.

37. The method according to claim 34, characterized in that a priority mapping rule for the monitored physical downlink control channel (PDCCH) candidates and non-overlapping control channel elements (CCE) is defined for the joint search space set, and a higher mapping priority is established for the joint search space set than for other UE-specific search space sets.

38. The method according to claim 36, characterized in that a priority mapping rule is defined for monitored PDCCH and CCE candidates that do not overlap for the joint search space set, based on the principle that a higher priority is associated with a search space set that has a smaller ID among a list of search space IDs; wherein the list of search space IDs includes the ID of the joint search space set and does not include any IDs of the search space sets of individual components.

39. The method according to claim 38, characterized in that the ID of the joint search space set is determined based on the ID of the anchor search space set or the smallest ID of the component search space sets. QRnn / ZZnZ / E / YIAI 40. The method according to claim 34, characterized in that a one-to-one mapping rule between two of the component search space sets is predefined or preconfigured for PDCCH candidates.

41. The method according to claim 35, characterized in that a single Hash function parameter is defined which is determined by at least one selected from a group consisting of: a CORESET index associated with the anchor search space set, or a CORESET index associated with one of the component search space sets with the lowest ID and a CORESET index associated with the joint search space set.

42. The method according to claim 35, characterized in that the same number of monitored PDCCH candidates are configured for each of the component search space sets for joint detection, and the component search space sets are configured with the same level of aggregation or different levels of aggregation.

43. The method according to claim 34, characterized in that the plurality of DCI versions comprise: a simple repetition, a polar encoding bit part and / or a partial repetition based on an aggregation level of a respective transmit-receive identity.

44. The method according to claim 34, further characterized in that it comprises: receiving a signal from a transmitting device, and upon receiving the signal, performing at least one selected from a group consisting of: detecting each of the component search space sets independently; detecting each of the component search space sets independently and skipping the last component search space sets upon detecting a DCI in a component search space set; and performing a joint detection for all component search space sets.

Images