UE l1 energy saving with enhanced 6g HASH function

Abstract

A user equipment (UE) includes means for monitoring, by the UE, one or more PDCCH candidates associated with a first number of regions of a control resource set (CORESET), wherein the first number of regions is larger than or equal to a maximum number of the one or more PDCCH candidates configured to the UE; and receiving, by the UE, one or more downlink control information messages in the one or more PDCCH candidates from a network apparatus for transmission by the UE.

Description

UE L1 ENERGY SAVING WITH ENHANCED 6G HASH FUNCTIONFIELD

[0001] Various example embodiments relate generally to wireless networks and, more particularly, for UE L1 Energy Saving with Enhanced 6G hash function.BACKGROUND

[0002] Dynamic scheduling of data channels (e.g. uplink data (PUSCH) and downlink data (PDSCH)), is performed via layer- 1 signaling, where physical a downlink control channel (PDCCH) provides necessary information for transmission of PUSCH and reception of PDSCH such as resource allocation parameters.SUMMARY

[0003] In accordance with aspects of the disclosure, a user equipment (UE) includes at least one processor and at least one memory storing instructions which, when executed by the at least one processor, cause the UE at least to perform: monitoring by a user equipment (UE), one or more PDCCH candidates associated with a first number of regions of a control resource set (CORESET); and receiving, by the UE, one or more downlink control information messages in the one or more PDCCH candidates from a network apparatus for transmission by the UE. The first number of regions is larger than or equal to a maximum number of the one or more PDCCH candidates configured to the UE

[0004] In an aspect of the UE, a second number of regions may be selected by a network function from the first number of regions. The second number of regions may be for placing one or more downlink control information messages. The second number of regions may be equal to a number of the one or more PDCCH candidates monitored by the UE.

[0005] In an aspect of the UE, the first number of regions may be a fixed number independent of a carrier frequency.

[0006] In an aspect of the UE, the first number of regions may be based on a UE radio network temporary identifier (RNTI).

[0007] In an aspect of the UE, the second number of regions may be generated with variable spacing.

[0008] In an aspect of the UE, the second number of regions is nonuniformly spaced over the CORESET.

[0009] In an aspect of the UE, the second number of regions may be selected sequentially.

[0010] In an aspect of the UE, the second number of regions may be equally spaced within the CORESET.

[0011] In an aspect of the UE, indexes of the one or more PDCCH candidates may be computed.

[0012] In an aspect of the UE, the indexes of the one or more PDCCH candidates may be subsets of control channel elements (CCEs) of the CORESET computed in accordance with a hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the hash function is defined in accordance with the following:AD. ivsyvCCE,pL ■ + nCImod |NCCEJP / L| + iL •where L is a PDCCH aggregation level, Yp nis a pseudo-random value for USS or 0 forCSS, iVCCEp is a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1,nCIis a carrier indicator field, R^ is the first number of regions, and rL')is the second number of regions.

[0013] In an aspect of the UE, the network apparatus may be a gNB.

[0014] In an aspect of the UE, the first number of regions may be determined based on: R = Mmax+ [nRNTImod (pp] - Mmax+ 1)].

[0015] In an aspect of the UE, the first number of regions may be configured by the gNB.

[0016] In an aspect of the UE, the gNB may configure a plurality of the second number of regions via RRC and indicate a particular region via MAC-CE / DCI.

[0017] In an aspect of the UE, the second number of regions to be chosen (r^') may be sequentially selected from (R^) regions (r = m = 0,..., M — 1).

[0018] In an aspect of the UE, the second number of regions may be equally spaced within the CORESET (r = [^] mod R,m = 0,..., M - 1).

[0019] In accordance with aspects of the disclosure, a method includes: monitoring by a user equipment (UE), one or more PDCCH candidates associated with a first number of regions of a control resource set (CORESET); and receiving, by the UE, one or more downlink control information messages in the one or more PDCCH candidates from a network apparatus for transmission by the UE. The first number of regions is larger than or equal to a maximum number of the one or more PDCCH candidates configured to the UE

[0020] In an aspect of the method, a second number of regions may be selected by a network function, from the first number of regions. The second number of regions may be for placing one or more downlink control information messages. The second number of regions may be equal to a number of the one or more PDCCH candidates monitored by the UE.

[0021] In an aspect of the method, the first number of regions may be a fixed number independent of a carrier frequency.

[0022] In an aspect of the method, the first number of regions may be based on a UE radio network temporary identifier (RNTI).

[0023] In an aspect of the method, the second number of regions may be generated with variable spacing.

[0024] In an aspect of the method, the one or more PDCCH candidate is nonuniformly spread over the CORESET.

[0025] In an aspect of the method, the second number of regions may be selected sequentially.

[0026] In an aspect of the method, the second number of regions may be equally spaced within the CORESET.

[0027] In an aspect of the method, indexes of the one or more PDCCH candidates may be computed.

[0028] In an aspect of the method, the indexes of the one or more PDCCH candidates may be subsets of control channel elements (CCEs) of the CORESET computed in accordance with a hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the hash function is defined in accordance with the following:syvCCE,p+ nCImod |NCCEJP / L| + iL ■where L is a PDCCH aggregation level, Yp nis a pseudo-random value for USS or 0 for s,fCSS, NCCE pis a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1,nCIis a carrier indicator field,is the first number of regions, and rL')is the second number of regions.

[0029] In an aspect of the method, the network apparatus may be a gNB.

[0030] In an aspect of the method, the first number of regions may be determined based on R = Mmax+ [nRNTImod (pp] - Mmax+ 1)].

[0031] In an aspect of the method, the first number of regions may be configured by the gNB.

[0032] In an aspect of the method, the gNB may configure a plurality of the second number of regions via RRC and indicates a particular region via MAC-CE / DCI.

[0033] In an aspect of the method, the second number of regions to be chosen (rs(L)) are sequentially selected from (R^) regions (r = m = 0,..., M — 1).

[0034] In an aspect of the method, the second number of regions may be equally spaced within the CORESET (r = mod R, m = 0,..., M — 1).

[0035] In accordance with aspects of the disclosure, a processor-readable medium stores instructions which, when executed by at least one processor of a user equipment (UE), cause the UE at least to perform a method as in any one of the foregoing methods.

[0036] In accordance with aspects of the disclosure, a method includes: applying, by a network function of a network apparatus, a hashing function for associating one or more physical downlink control channel (PDCCH) candidates to a first number of regions of a control resource set (CORESET); and selecting, by the network function, a second number of regions from the first number of regions. The first number of regions is larger than a number of the one or more PDCCH candidates to be monitored by a user equipment (UE). The second number of regions is equal to the number of the one or more PDCCH candidates to be monitored by the UE.

[0037] In an aspect of the method, the method may further include selecting, by the network function, one or more PDCCH candidates from the second number of regions for placing one or more downlink control information messages for scheduling the UE.

[0038] In an aspect of the method, the method may further include transmitting, by the network function to the UE, the one or more downlink control information messages in the selected one or more PDCCH candidates.

[0039] In an aspect of the method, the first number of regions may be a fixed number independent of a carrier frequency.

[0040] In an aspect of the method, the first number of regions may be based on a UE radio network temporary identifier (RNTI).

[0041] In an aspect of the method, the second number of regions may be generated with variable spacing.

[0042] In an aspect of the method, the second number of regions may be nonuniformly spread over the CORESET.

[0043] In an aspect of the method, the second number of regions may be selected sequentially.

[0044] In an aspect of the method, the second number of regions may be equally spaced within the CORESET.

[0045] In an aspect of the method, indexes of the one or more PDCCH candidates may be computed.

[0046] In an aspect of the method, the indexes of the one or more PDCCH candidates may be are subsets of control channel elements (CCEs) of the CORESET computed in accordance with a hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the hash function is defined in accordance with the following:AO.⌊NCCE,pL ■ mod |NCCEP / LJ + iwhere L is a PDCCH aggregation level, Yp nis a pseudo-random value for USS or 0 for s,fCSS, NCCE pis a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1,nCIis a carrier indicator field,is the first number of regions, and rL')is the second number of regions.

[0047] In an aspect of the method, the network apparatus may be a gNB.

[0048] In an aspect of the method, the method may further include selecting, by the network apparatus, one or more regions for placing a PDCCH candidate.

[0049] In accordance with aspects of the disclosure, a network apparatus includes at least one processor and at least one memory storing instructions which, when executed by the at least one processor, cause the network apparatus at least to perform a method as in any one of the foregoing methods.

[0050] In accordance with aspects of the disclosure, a processor-readable medium stores instructions which, when executed by at least one processor of a network apparatus, cause the network apparatus at least to perform a method as in any one of the foregoing methods.

[0051] According to some aspects, there is provided the subject matter of the independent claims. Some further aspects are defined in the dependent claims.BRIEF DESCRIPTION OF THE DRAWINGS

[0052] Some example embodiments will now be described with reference to the accompanying drawings.

[0053] FIG. 1 is a diagram of an example embodiment of wireless networking between a network system and a user equipment (UE), according to one illustrated aspect of the disclosure;

[0054] FIG. 2 is a diagram of example components of a network system, according to one illustrated aspect of the disclosure;

[0055] FIG. 3 is a diagram of an example embodiment of signals and operations among a gNB and a UE, according to one illustrated aspect of the disclosure;

[0056] FIG. 4 is an example diagram of a maximum value table, according to one illustrated aspect of the disclosure;

[0057] FIGS. 5A-5D are diagrams depicting example UE PDCCH candidates within a CORESET, according to one illustrated aspect of the disclosure; and

[0058] FIG. 6 is a diagram of an example block diagram of a wireless station or node (e.g., network node (such as gNB), user node or UE, relay node, or other node), according to one illustrated aspect of the present disclosure.DETAILED DESCRIPTION

[0059] In the following description, certain specific details are set forth in order to provide a thorough understanding of disclosed aspects. However, one skilled in the relevant art will recognize that aspects may be practiced without one or more of these specific details or with other methods, components, materials, etc. In other instances, well-known structures associated with transmitters, receivers, or transceivers have not been shown or described in detail to avoid unnecessarily obscuring descriptions of the aspects.

[0060] Reference throughout this specification to “one aspect” or “an aspect” means that a particular feature, structure, or characteristic described in connection with the aspect is included in at least one aspect. Thus, the appearances of the phrases “in one aspect” or “in an aspect” in various places throughout this specification are not necessarily all referring to the same aspect. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more aspects.

[0061] Embodiments described in the present disclosure may be implemented in wireless networking apparatuses, such as, without limitation, apparatuses utilizing Worldwide Interoperability for Microwave Access (WiMAX), Global System for Mobile communications (GSM, 2G), GSM EDGE radio access Network (GERAN), General Packet Radio Service (GRPS), Universal Mobile Telecommunication System (UMTS, 3G) based on basic wideband-code division multiple access (W-CDMA), high-speed packet access (HSPA), Long Term Evolution (LTE), LTE-Advanced, enhanced LTE (eLTE), 5G New Radio (5G NR), 5GAdvance, 6G (and beyond) and 802.11ax (Wi-Fi 6), among other wireless networking systems. The term ‘eLTE’ here denotes the LTE evolution that connects to a 5G core. LTE is also known as evolved UMTS terrestrial radio access (EUTRA) or as evolved UMTS terrestrial radio access network (EUTRAN).

[0062] The present disclosure may use the term “serving network device” to refer to a network node or network device (or a portion thereof) that services a UE. As used herein, the terms “transmit to,” “receive from,” and “cooperate with,” (and their variations) include communications that may or may not involve communications through one or more intermediate devices or nodes. The term “acquire” (and its variations) includes acquiring in the first instance or reacquiring after the first instance. The term “connection” may mean a physical connection or a logical connection.

[0063] The present disclosure uses 5G NR as an example of a wireless network and may use smartphones and / or extended reality headsets as an example of UEs. It is intended and shall be understood that such examples are merely illustrative, and the present disclosure is applicable to other wireless networks and user equipment.

[0064] FIG. 1 is a diagram depicting an example of wireless networking between a network system 100 and a user equipment (UE) 150. The network system 100 may include one or more network nodes 120, one or more servers 110, and / or one or more network equipment 130 (e.g., test equipment). The network nodes 120 will be described in more detail below. As used herein, the term “network apparatus” may refer to any component of the network system 100, such as the server 110, the network node 120, the network equipment 130, any component(s) of the foregoing, and / or any other component(s) of the network system 100. Examples of network apparatuses include, without limitation, apparatuses implementing aspects of 5G NR, among others. The present disclosure describes embodiments related to 5GNR and embodiments that involve aspects defined by 3rd Generation Partnership Project (3GPP). However, it is contemplated that embodiments relating to other wireless networking technologies are encompassed within the scope of the present disclosure.

[0065] The following description provides further details of examples of network nodes. In a 5G NR network, a gNodeB (also known as gNB) may include, e.g., a node that provides new radio (NR) user plane and control plane protocol terminations towards the UE and that is connected via a NG interface to the 5Gcore (5GC), e.g., according to 3GPP TS 38.300 V16.6.0 (2021-06) section 3.2, which is hereby incorporated by reference herein.

[0066] A gNB supports various protocol layers, e.g., Layer 1 (LI) - physical layer, Layer 2 (L2), and Layer 3 (L3).

[0067] The layer 2 (L2) of NR is split into the following sublayers: Medium Access Control (MAC), Radio Link Control (RLC), Packet Data Convergence Protocol (PDCP) and Service Data Adaptation Protocol (SDAP), where, e.g.:o The physical layer offers to the MAC sublayer transport channels; o The MAC sublayer offers to the RLC sublayer logical channels;o The RLC sublayer offers to the PDCP sublayer RLC channels;o The PDCP sublayer offers to the SDAP sublayer radio bearers;o The SDAP sublayer offers to 5GC quality of service (QoS) flows; o Control channels include broadcast control channel (BCCH) and physical control channel (PCCH).

[0068] Layer 3 (L3) includes, e.g., radio resource control (RRC), e.g., according to 3GPP TS 38.300 V16.6.0 (2021-06) section 6, which is hereby incorporated by reference herein.

[0069] A gNB central unit (gNB-CU) includes, e.g., a logical node hosting, e.g., radio resource control (RRC), service data adaptation protocol (SDAP), and packet data convergence protocol (PDCP) protocols of the gNB or RRC and PDCP protocols of the en-gNB, that controls the operation of one or more gNB distributed units (gNB-DUs). The gNB-CU terminates the Fl interface connected with the gNB-DU. A gNB-CU may also be referred to herein as a CU, a central unit, a centralized unit, or a control unit.

[0070] A gNB Distributed Unit (gNB-DU) includes, e.g., a logical node hosting, e.g., radio link control (RLC), media access control (MAC), and physical (PHY) layers of the gNB or en-gNB, and its operation is partly controlled by the gNB-CU. One gNB-DU supports one or multiple cells. One cell is supported by only one gNB-DU. The gNB-DU terminates the Fl interface connected with the gNB-CU. A gNB-DU may also be referred to herein as DU or a distributed unit.

[0071] As used herein, the term “network node” may refer to any of a gNB, a gNB-CU, or a gNB-DU, or any combination of them. A RAN (radio access network) node or network node such as, e.g., a gNB, gNB-CU, or gNB-DU, or parts thereof, may be implemented using, e.g., an apparatus with at least one processor and / or at least one memory with processor-readable instructions (“program”) configured to support and / or provision and / or process CU and / or DU related functionality and / or features, and / or at least one protocol (sub-)layer of a RAN (radio access network), e.g., layer 2 and / or layer 3. Different functional splits between the central and distributed unit are possible. An example of such an apparatus and components will be described in connection with FIG. 6 below.

[0072] The gNB-CU and gNB-DU parts may, e.g., be co-located or physically separated. The gNB-DU may even be split further, e.g., into two parts, e.g., one including processing equipment and one including an antenna. A central unit (CU) may also be called baseband unit / radio equipment controller / cloud-RAN / virtual-RAN (BBU / REC / C-RAN / V-RAN), open-RAN (O-RAN), or part thereof. A distributed unit (DU) may also be called remote radio head / remote radio unit / radio equipment / radio unit (RRH / RRU / RE / RU), or part thereof. Hereinafter, in various example embodiments of the present disclosure, a network node, which supports at least one of central unit functionality or a layer 3 protocol of a radio access network, may be, e.g., a gNB-CU. Similarly, a network node, which supports at least one of distributed unit functionality or a layer 2 protocol of the radio access network, may be, e.g., a gNB-DU.

[0073] A gNB-CU may support one or multiple gNB-DUs. A gNB-DU may support one or multiple cells and, thus, could support a serving cell for a user equipment (UE) or support a candidate cell for handover, dual connectivity, and / or carrier aggregation, among other procedures.

[0074] The user equipment (UE) 150 may be or include a wireless or mobile device, an apparatus with a radio interface to interact with a RAN (radio access network), a smartphone, an in-vehicle apparatus, an loT device, or a M2M device, among other types of user equipment. Such UE 150 may include: at least one processor; and at least one memory including program code; where the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform certain operations, such as, e.g., RRC connection to the RAN. An example of components of a UE will be described in connection with FIG. 6. In embodiments, the UE 150 may be configured to generate a message (e.g., including a cell ID) to be transmitted via radio towards a RAN (e.g., to reach and communicate with a serving cell). In embodiments, the UE 150 may generate and transmit and receive RRC messages containing one or more RRC PDUs (packet data units). Persons skilled in the art will understand RRC protocol as well as other procedures a UE may perform.

[0075] With continuing reference to FIG. 1, in the example of a 5G NR network, the network system 100 provides one or more cells, which define a coverage area of the network system 100. As described above, the network system 100 may include a gNB of a 5G NR network or may include any other apparatus configured to control radio communication and manage radio resources within a cell. As used herein, the term “resource” may refer to radio resources, such as a resource block (RB), a physical resource block (PRB), a radio frame, a subframe, a time slot, a sub-band, a frequency region, a sub-carrier, a beam, etc. In embodiments, the network node 120 may be called a base station.

[0076] FIG. 1 provides an example and is merely illustrative of a network system 100 and a UE 150. Persons skilled in the art will understand that the network system 100 includes components not illustrated in FIG. 1 and will understand that other user equipment may be in communication with the network system 100.

[0077] FIG. 2 is a block diagram of example components of the network system 100 of FIG. 1. A 5G NR network may be described as an example of the network system 100, and it is intended that aspects of the following description shall be applicable to other types of network systems, as well. The network system may operate in accordance with the signals and connections shown in FIG. 1 such that the UE 150 is in communication with the network system 100 through the radio access network 225. Additionally, the network system may be divided into user plane components and functions and control plane components and functions, as shown and described herein. Unless indicated otherwise, the terms “component”, “function”, and “service” may be used interchangeably herein, and they may refer to and be implemented by instructions executed by one or more processors.

[0078] Example functions of the components are described below. The example functions are merely illustrative, and it shall be understood that additional operations and functions may be performed by the components described herein. Additionally, the connections between components may be virtual connections over service-based interfaces such that any component may communicate with any other component. In this manner, any component may act as a service “producer,” for any other component that is a service “consumer,” to provide services for network functions.

[0079] For example, a core network 210 is described in the control plane of the network system. The core network 210 may include an authentication server function (AUSF) 211, an access and mobility function (AMF) 212, and a session management function (SMF) 213. The core network 210 may also include a network slice selection function (NSSF) 214, a network exposure function (NEF) 215, a network repository function (NRF) 216, and a unified data management function (UDM) 217, which may include a uniform data repository (UDR) 224.

[0080] Additional components and functions of the core network 210 may include an application function 218, policy control function (PCF) 219, network data analytics function (NWDAF) 220, analytics data repository function (ADRF) 221, management data analytics function (MDAF) 222, and operations and management function (0AM) 223.

[0081] The user plane includes the UE 150, a radio access network (RAN) 225, a user plane function (UPF) 226, and a data network (DN) 227. The RAN 225 may include one or more components described in connection with FIG. 1, such as one or more network nodes. However,the RAN 225 may not be limited to such components. The UPF 226 provides connection for data being transmitted over the RAN 225. The DN 226 identifies services from service providers, Internet access, and third party services, for example.

[0082] The AMF 212 processes connection and mobility tasks. The AUSF 211 receives authentication requests from the AMF 212 and interacts with UDM 217 to authenticate and validate network responses for determination of successful authentication. The SMF 213 conducts packet data unit (PDU) session management, as well as manages session context with the UPF 226.

[0083] The NSSF 214 may select a network slicing instance (NSI) and determine the allowed network slice selection assistance information (NSSAI). This selection and determination is utilized to set the AMF 212 to provide service to the UE 150. The NEF 215 secures access to network services for third parties to create specialized network services. The NRF 216 acts as a repository to store network functions to allow the functions to register with and discover each other.

[0084] The UDM 217 generates authentication vectors for use by the AUSF 211 and ADM 212 and provides user identification handling. The UDM 217 may be connected to the UDR 224 which stores data associated with authentication, applications, or the like. The AF 218 provides application services to a user (e.g., streaming services, etc.). The PCF 219 provides policy control functionality. For example, the PCF 219 may assist in network slicing and mobility management, as well as provide quality of service (QoS) and charging functionality.

[0085] The NWDAF 220 collects data (e.g., from the UE 150 and the network system) to perform network analytics and provide insight to functions that utilize the analytics in the providing of services. The ADRF 221 allows the storage, retrieval, and removal of data and analytics by consumers. The MDAF 222 provides additional data analytics services for network functions. The 0AM 223 provides provisioning and management processing functions to manage elements in or connected to the network (e.g., UE 150, network nodes, etc.).

[0086] FIG. 2 is merely an example of components of a network system, and variations are contemplated to be within the scope of the present disclosure. In embodiments, the network system may include other components not illustrated in FIG. 2. In embodiments, the network system may not include every component illustrated in FIG. 2. In embodiments, the components and connections may be implemented with different connections than those illustrated in FIG.2. Such and other embodiments are contemplated to be within the scope of the present disclosure.

[0087] As mentioned above, dynamic scheduling of data channels, (e.g., uplink data -physical uplink shared channel (PUSCH) and downlink data - physical downlink shared channel (PDSCH)), is performed via layer-1 signaling, where physical downlink control channel (PDCCH) provides necessary information for transmission of PUSCH and reception of PDSCH such as resource allocation parameters.

[0088] Unlike PUSCH and PDSCH where UE acquires the time-frequency resources for transmission and reception via downlink control information (DCI) that is carried via PDCCH prior to PUSCH transmission and PDSCH reception, in 5GNR, no prior channel is transmitted for scheduling of PDCCH. Therefore, UE performs blind decoding attempts in a set of control resources called “control resource set (CORESET)” and in specific time-frequency locations within CORESET.

[0089] In various embodiments, each CORESET can span over one, two, or three contiguous orthogonal frequency-division multiplexing (OFDM) symbols over multiple resource blocks (RBs), where each RB consists of, for example, 12 subcarriers. In the frequency domain, a CORESET spans over one or multiple chunks of 6 RBs. A PDCCH candidate is carried by 1, 2, 4, 8 or 16 control channel elements (CCEs). Each CCE is composed of 6 resource element groups (REGs), and each REG is 12 resource elements (REs) in one OFDM symbol.

[0090] The specific PDCCH locations are referred to as PDCCH candidates. UE performs blind decoding over the configured dedicated PDCCH candidates, wherein gNB may transmit DCI via PDCCH in one of the PDCCH candidates. In current 3GPP specifications, PDCCH candidates are determined by the so-called hash function, as a function of several configuration parameters.

[0091] PDCCH candidates which need to be monitored by UEs are configured using so-called search space (SS) sets with each SS being associated with one CORESET. In NR, there are two types of SS: 1) common SS (CSS) set, commonly monitored by a group of UEs, and 2) UE-specific SS (USS), monitored by a specific UE. Within a search space configuration, various PDCCH monitoring parameters such as number of candidates, and possible number of CCEs in each candidate can be set.

[0092] One important criterion for the design of the hash function is the UE blocking probability. UE blocking probability is defined as the probability that all PDCCH candidates configured for a UE to monitor are blocked by candidates used by other UEs. For example, all PDCCH candidates of UE2 and UE8 may be blocked by allocated PDCCH candidates of the other UEs. Therefore, typically, hash function is designed such that it reduces UE blocking probability.

[0093] Described herein, is a method of UE energy saving for LI control operations in 6G systems and for improving 5G NR hash function. Accordingly, described herein is a hashing function for 6G systems (e.g., based on 5GNR hashing function). In particular, unequal spacing is introduced between PDCCH candidates.

[0094] Based on the current 5G NR hash function, for a given AL, an entire CORESET is first divided intosections, whereinis maximum value among all configured M(L)s,max, i e-,carriers, where M(L)s,maxis the maximum number of PDCCH candidates for aggregation level (AL) L that that UE is configured to monitor via the RRC parameter “SearchSpace” information element (IE), as discussed below. Now, the first feature of our proposal is to replace M(L)s,maxwith a new variable R(L)swhich does not depend on nCI, but rather on the desired number of CORESET sections.

[0095] In an embodiment, the number of CORESET sections increases, wherein we define the increased number of CORESET sections by R(L)swhich is a value comprised in M^max |ACCE, p / L] The increased number of sections within the CORESET leads to a more granular selection on where to place the PDCCH candidates.

[0096] In various embodiments, the PDCCH candidates are chosen from a larger set of possible locations, which is defined by the increased number of CORESET sections. This assists to have an unequal PDCCH candidates’ distributions across the whole CORESET.

[0097] In another embodiment, the set of PDCCH candidates’ indexes=0,— 1 is changed to r^Lwhich is a set of size M(L)s,maxand with elements taken randomly as one of the combinations of indexes taken from o,..., R^ — lj. The selection of specific indexes allows to exploit the increased number of sections described in the previous embodiment, by selecting them in a smart way.

[0098] FIG. 3 is a diagram of an example embodiment of signals and operations among a gNB and a UE, according to one illustrated aspect of the disclosure. In various embodiments, the components depicted in FIG. 3 may correspond to similar components described above in FIGS. 1-2. It will be understood that a described signal may have associated operations and a described operation may have associated signals. Further details relating to the signals and operations shown in FIG. 3 are described herein below.

[0099] At operation 301, the UE performs a band scan, reads the SSB, and acquires the SIB.

[0100] At operation 302, the UE performs RACH and connects to the network.

[0101] At operation 303, the UE acquires the CORESET configuration parameters and search space set configuration parameters from the “PDCCH-Config” information element (IE). In various embodiments, a CORESET with 48 CCE is configured and from the “SearchSpace” IE, a maximum number of PDCCH candidates for aggregation level (AL)=1, 2, 4, 8, and 16 are set to be 6, 5, 2, 0, and 0, respectively.

[0102] At operation 304, the gNB configures multiple (at least one) groups of {R(L)s, r(L)s} with L ∈ {1, 2, 4, 8, 16} (that is associated with different UE scheduling loads). Here, we assumed two groups are configured (for different loads of 10-UEs and 20 UEs) namely, Group A and Group B. Moreover, a Group C is defined as per current specifications. In various embodiments, the gNB transmits the R(L) and r(L) RRC configuration and indication to the UE, which receives it.

[0103] It should be noted that the groups are exemplary only and that described herein is an enhanced hash function by applying the embodiments described above. The indexes of the one or more PDCCH candidates may be subsets of control channel elements (CCEs) of the CORESET computed in accordance with the hash function, which may be configured to map the first number of regions and the second number of regions to the CCEs of the CORESET. In particular, the indexes of the PDCCH candidates are to be computed via the following enhanced hash function:L' v +RS,DSE'P+ nc / ) mod ⌊NCCE,p / L⌋ + i,l\ ’SJ L RS / J

[0104] where L is the PDCCH AL value, Yp,nis a pseudo-random number for USS and 0 for CSS, NCCE pis the number of CCEs from 0 to NCCE,p-1 in CORESET p and, if any, per RB set, nclis an NR cell identity (e.g., a unique identifier), and R^and are the first number of regions and the second number of regions, respectively, and are derived according to the following different solutions. These solutions are potential implementations of the proposed embodiments contributing to novel implementation of our idea. Furthermore, for the sake of clarity, the notation for the below may be simplified as follows: m= M = Mmax= M^ax,r = r^, R = R^:

[0105] In various embodiments, the solutions for a number of sections R may include the following. In one sample implementation, Rp^ is a fixed number of sections, i.e., R ∈ {⌈NCCE,p / L⌉Mmax, ⌊NCCE,p / L⌋} where Mmaxis as defined in the current 5G hash function specification.

[0106] In various embodiments, depending on UE’s RNTI (i.e., the same nRNTIused by 5G hash function), the first number of regions may be derived from the UE RNTI and computed as a maximum number of the one or more PDCCH candidates for an aggregation level and a size of the CORESET defined by a number of CCEs:(iVccE,p \j Mmaxd” 1 )

[0107] where R is a number of CORESET sections, Mmaxis a maximum number, nRNTIis an RNTI, NCCE pis a number of CCEs from 0 to NCCE,p-1 in CORESET p, and L is the PDCCH aggregation level.

[0108] In various embodiments, R may be configured by the gNB, e.g., assigning to each UE a different number of sections R. For example, the gnB may configure a plurality of the first number of regions via RRC and indicate a particular region via MAC-CE / DCI.

[0109] In various embodiments, R can be configured as a multiple of the currently defined Mmax, that is, R = K · Mmax, where K = 1,2,3,... is the multiplying factor configured by gNB. For example, given that Mmax= {1, 2, 3, 4, 5, 6, 8}, if K = 2, then R = {2,4,6,8,10,12,16}.

[0110] In various embodiments, Mmaxcan be configured as the possible maximum value for each AL, that is, R = FIG- 4 is an example diagram of a maximum value table 400,according to one illustrated aspect of the disclosure. As an illustration, FIG. 4 shows the maximum value which R can assume for different NCCE,pand L.

[0111] In various embodiments, solutions for the indexes of the sections r may include the following (referred to for example as solution 2):a. Sequential indexes: r = m = 0,..., M — 1.b. Indexes equally or not spaced within the CORESET: r = I-— I mod R, m = 0,..., M - 1.c. Depending on UE’s RNTI (i.e., the same nRNTIused by 5G hash function), e.g. generating indexes with variable spacing between them:2 TTIi. Generate equidistant steps: 6i = — i = m = 0,..., M — 1;ii. Compute variable steps: di= f(θi, nRNTI), where a possible implementation of the function (•) could be f(θi, nRNTI) = |sin(θi· nRNTI) + nRNTI| iii. Normalize steps such that their sum equals Mmax— 1: d̃i= di / ∑j=0dj· (Mmax- 1);iv. Compute the cumulative sum to get indexes: r0= 0, ri= HEIGHT="22" WIDTH="226" SRC="imgf000016_0001.tif" / > ∑j=0idjmod Mmaxfor i = 1,..., M — 1.This is just an example implementation. Other functions rather than sin (•) can be used in order to introduce variability.d. Configured by gNB, e.g., assigning to each UE different indexes r(- = {0,..., R — 1], rt< rj, i,j = 1,..., M — 1.

[0112] In various embodiments (e.g., solution la +2d), the number of sections R is fixed and 3 different values are considered: R = Mmax+ 1 (adding just 1 additional section), R = ⌊NCCE,p / L⌋ (adding the maximum number of sections), and R = ⌊(Mmax+ ⌊NCCE,p / L⌋) / 2⌋.In various embodiments, the indexes of the sections in are configured by gNB where each rri∈ U(0, R - 1), i = 1,..., M — 1

[0113] In various embodiments, (e.g., solution la +2 b / c / d), the following solutions may be solutions:a. Solution la. The number of sections is fixed to R =b. Solution 2b. The indexes in are equally spaced within the number of sections R.c. Solution 2c. The indexes in depend on UE’s RNTI with the method described above.d. Solution 2d. The indexes of the sections in are configured by gNB, where each ri∈ U(0, R — 1), i = 1,..., M — 1 for each UE.

[0114] FIGS. 5A-5D are diagrams depicting example UE PDCCH candidates within a CORESET, according to one illustrated aspect of the disclosure. In various embodiments, FIGS. 5A-5D depict the example solutions described above.

[0115] In various embodiments, (e.g., Solution la / b / c + 2b), the following solutions may be solutions:a. Solution la. The number of sections is fixed to R =b. Solution lb. The number of sections depends on UE’s RNTI with the method described above.c. Solution 1c. The number of sections is configured by gNB, where R ∈ U(Mmax, ⌊NCCE,p / L⌋) for each UE.d. Solution 2b. The indexes in are equally spaced within the number of sections R.

[0116] Referring now to FIG. 3, at operation 305, based on some of the system parameters, such as current scheduling load (in number of UEs) and / or the distribution of the aggregation levels of PDCCH candidates of the UEs, the gNB can activate / enable one group of {Rmax’r^} for UEs. For purposes of example, Group B is enabled / activated. It should be noted that the number of UEs associated with the different sets / groups corresponding to different loads may not be known by the UE (e.g., the gNB would only activate / indicate a certain set / group for a UE at time). In case the UE would only configure a single group by the gNB at operation 304, operation 305 activation / enabling may not be necessarily required.

[0117] Accordingly, at operation 306, the gNB sends message for activating Group B to UEs, which receives the message. At operation 307, the UE calculates the indexes of PDCCH candidates based on the “enhanced hashing function” proposal, according to its own AL.

[0118] The operations of FIG. 3 are merely illustrative, and variations are contemplated to be within the scope of the present disclosure. In embodiments, the operations may include other operations not illustrated in FIG. 3. In embodiments, the operations may not include every operation illustrated in FIG. 3. In embodiments, the operations may be implemented in a different order than that illustrated in FIG. 3. Such and other embodiments are contemplated to be within the scope of the present disclosure. Persons of skill in the art will appreciate that, although various example components are described as perform various functions, other components may perform those functions described in FIG. 3.

[0119] The following describes operations from the perspective of a UE. From such a perspective, a method may include: monitoring by a user equipment (UE), one or more PDCCH candidates associated with a first number of regions of a control resource set (CORESET); and receiving, by the UE, one or more downlink control information messages in the one or more PDCCH candidates from a network apparatus for transmission by the UE. The first number of regions may be larger than or equal to a maximum number of the one or more PDCCH candidates configured to the UE.

[0120] The following describes operations from the perspective of a network apparatus. From such a perspective, a method may include: applying, by a network function of a network apparatus, a hashing function for associating one or more physical downlink control channel (PDCCH) candidates to a first number of regions of a control resource set (CORESET); and selecting, by the network function, a second number of regions from thefirst number of regions. The first number of regions may be larger than a number of the one or more PDCCH candidates to be monitored by a user equipment (UE). The second number of regions may be equal to the number of the one or more PDCCH candidates to be monitored by the UE.

[0121] FIG. 6 is a block diagram of a wireless station or node (e.g., UE, user device, AP, BS, eNB, gNB, RAN node, network node, TRP, or other node) 600, according to one illustrated aspect of the present disclosure. The wireless station 600 may include, for example, one or more (e.g., two as shown in FIG. 6) RF (radio frequency) or wireless transceivers 602A, 602B, where each wireless transceiver includes a transmitter to transmit signals and a receiver to receive signals. The wireless station also includes a processor or control unit / entity (controller) 604 to execute instructions or software and control transmission and receptions of signals, and a memory 606 to store data and / or instructions.

[0122] Processor 604 may also make decisions or determinations, generate frames, packets or messages for transmission, decode received frames or messages for further processing, and other tasks or functions described herein. Processor 604, which may be a baseband processor, for example, may generate messages, packets, frames or other signals for transmission via wireless transceiver 602 (602A or 602B). Processor 604 may control transmission of signals or messages over a wireless network, and may control the reception of signals or messages, etc., via a wireless network (e.g., after being down-converted by wireless transceiver 602, for example). Processor 604 may be programmable and capable of executing software or other instructions stored in memory or on other computer media to perform the various tasks and functions described above, such as one or more of the tasks or methods described above. Processor 604 may be (or may include), for example, hardware, programmable logic, a programmable processor that executes software or firmware, and / or any combination of these. Using other terminology, processor 604 and transceiver 602 together may be considered as a wireless transmitter / receiver system, for example.

[0123] In addition, referring to FIG. 6, a controller (or processor) 608 may execute software and instructions, and may provide overall control for the station 600, and may provide control for other systems not shown in FIG. 6, such as controlling input / output devices (e.g., display, keypad), and / or may execute software for one or more applications that may be provided on wireless station 600, such as, for example, an email program, audio / video applications, a word processor, a Voice over IP application, or other application or software.

[0124] In addition, a storage medium may be provided that includes stored instructions, which when executed by a controller or processor may result in the processor 604, or othercontroller or processor, performing one or more of the functions or tasks described above.

[0125] According to another example embodiment, RF or wireless transceiver(s) 602A / 602B may receive signals or data and / or transmit or send signals or data. Processor 604 (and possibly transceivers 602A / 602B) may control the RF or wireless transceiver 602A or 602B to receive, send, broadcast or transmit signals or data.

[0126] Example embodiments are provided or described for each of the example methods, including: An apparatus (e.g., 600, FIG. 6) including means (e.g., processor 604, RF transceivers 602A and / or 602B, and / or memory 606, in FIG. 6) for carrying out any of the methods; a non-transitory computer-readable storage medium (e.g., memory 606, FIG. 6) comprising instructions stored thereon that, when executed by at least one processor (processor 604, FIG. 6), are configured to cause a computing system (e.g., 600, FIG. 6) to perform any of the example methods; and an apparatus (e.g., 600, FIG. 6) including at least one processor (e.g., processor 604, FIG. 6), and at least one memory (e.g., memory 606, FIG. 6) including computer program code, the at least one memory (606) and the computer program code configured to, with the at least one processor (604), cause the apparatus (e.g., 600) at least to perform any of the example methods.

[0127] Further embodiments of the present disclosure include the following examples.

[0128] Example 1.1 A user equipment (UE), comprising:means for monitoring, by the UE, one or more PDCCH candidates associated with a first number of regions of a control resource set (CORESET), wherein the first number of regions is larger than or equal to a maximum number of the one or more PDCCH candidates configured to the UE; andmeans for receiving, by the UE, one or more downlink control information messages in the one or more PDCCH candidates from a network apparatus for transmission by the UE.

[0129] Example 1.2. The UE of Example 1.1, wherein a second number of regions is selected by a network function from the first number of regions, wherein the second number of regions is for placing one or more downlink control information messages, and the second number of regions is equal to a number of the one or more PDCCH candidates monitored by the UE.

[0130] Example 1.3. The UE of Examples 1.1 or 1.2, wherein the first number of regions is a fixed number independent of a carrier frequency.

[0131] Example 1.4. The UE of any of Examples 1.1 to 1.3, wherein the first number of regions is based on a UE radio network temporary identifier (RNTI).

[0132] Example 1.5. The UE of any of Examples 1.1 to 1.3, wherein the second number of regions are generated with variable spacing.

[0133] Example 1.6. The UE of any of Examples 1.1 to 1.3, wherein the second number of regions is nonuniformly spaced over the CORESET.

[0134] Example 1.7. The UE of any of Examples 1.1 to 1.3, wherein the second number of regions are selected sequentially.

[0135] Example 1.8. The UE of any of Examples 1.1 to 1.3, wherein the second number of regions are equally spaced within the CORESET.

[0136] Example 1.9. The UE of any of Examples 1.1 to 1.8, wherein indexes of the one or more PDCCH candidates are computed.

[0137] Example 1.10. The UE of Example 1.9, wherein the indexes of the one or more PDCCH candidates are subsets of control channel elements (CCEs) of the CORESET computed in accordance with a hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the hash function is defined in accordance with the following:⌊NCCE,pL · {(Yp,n+ ⌊r(L)s· NCCE,p / (L · R(L)s)⌋ + nCI) mod ⌊NCCE,p / L⌋}V'ns,fwhere L is a PDCCH aggregation level, Ynn is a pseudo-random value for USS or 0 for ’S’fCSS, lVCCEp is a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1,nci isacarrier indicator field,is the first number of regions, and rL')is the second number of regions.

[0138] Example 1.11 The UE of Example 1.9, wherein the indexes of the one or more PDCCH candidates are computed in accordance with a hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the PDCCH candidates are uniquely identified by the first and the R(L)sand r(L)ssecond number of regions, R(L)sand r(L)srespectively.

[0139] Example 1.12. The UE of any of Examples 1.1 to 1.10, wherein the network apparatus is a gNB.

[0140] Example 1.13. The UE of Example 1.4, wherein the first number of regions is derived from the UE RNTI and computed as a maximum number of the one or more PDCCH candidates for an aggregation level and a size of the CORESET defined by a number of CCEs, and wherein the first number of regions is defined in accordance with the following:R = Mmax+ [n_RNTl mod ([A_(CCE,p) / LJ - M_max + 1)]where R is a number of CORESET sections, Mmaxis a maximum number of the one or more PDCCH candidates, nRNTIis an RNTI, NCCE,pis a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1, and L is the PDCCH aggregation level.

[0141]

[0142] Example 1.14. The UE of Example 1.4, wherein the first number of regions is computed as the maximum number of PDCCH candidates for a certain aggregation level plus a number greater than or equal to zero which is derived from the UE radio network temporary identifier (RNTI).

[0143] Example 1.15. The UE of Example 1.12, wherein the first number of regions is configured by the gNB.

[0144] Example 1.16. The UE of Example 1.15, wherein the gNB configures a plurality of the second number of regions via RRC and indicates a particular region via MAC-CE / DCI.

[0145] Example 1.17. The UE of Example 1.7, wherein the second number of regions to be chosen (r^) are sequentially selected from (R^) regions (r = m = 0,..., M — 1).

[0146] Example 1.18. The UE of Example 1.8, wherein the second number of regions are equally spaced within the CORESET (r = l-^-! mod R, m = 0,..., M — 1).

[0147] Example 1.19. A method, comprising:means for monitoring by a user equipment (UE), one or more PDCCH candidates associated with a first number of regions of a control resource set (CORESET), wherein the first number of regions is larger than or equal to a maximum number of the one or more PDCCH candidates configured to the UE; andmeans for receiving, by the UE, one or more downlink control information messages in the one or more PDCCH candidates from a network apparatus for transmission by the UE.

[0148] Example 1.20. The method of Example 1.19, wherein a second number of regions is selected by a network function, from the first number of regions, wherein the second number of regions is for placing one or more downlink control information messages, and the second number of regions is equal to a number of the one or more PDCCH candidates monitored by the UE.

[0149] Example 1.21. The method of any of Examples 1.19 to 1.21, wherein the first number of regions is a fixed number independent of a carrier frequency.

[0150] Example 1.22. The method of any of Examples 1.19 to 1.21, wherein the first number of regions is based on a UE radio network temporary identifier (RNTI).

[0151] Example 1.23. The method of any of Examples 1.19 to 1.21, wherein the second number of regions are generated with variable spacing.

[0152] Example 1.24. The method of any of Examples 1.19 to 1.21, wherein the one or more PDCCH candidate is nonuniformly spread over the CORESET.

[0153] Example 1.25. The method of any of Examples 1.19 to 1.21, wherein the second number of regions are selected sequentially.

[0154] Example 1.26. The method of any of Examples 1.19 to 1.21, wherein the second number of regions are equally spaced within the CORESET.

[0155] Example 1.27. The method of any of Examples 1.19 to 1.21, wherein indexes of the one or more PDCCH candidates are computed.

[0156] Example 1.28. The method of Example 1.25, wherein the indexes of the one or more PDCCH candidates are subsets of control channel elements (CCEs) of the CORESET computed in accordance with a hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the hash function is defined in accordance with the following:syvCCE,pL ■ + nCImod |NCCEJP / L| + iL •where L is a PDCCH aggregation level, Yp nis a pseudo-random value for USS or 0 for s,fCSS, NCCE pis a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1,nCIis a carrier indicator field,is the first number of regions, andis the second number of regions.

[0157] Example 1.29. The method of any of Examples 1.19 to 1.28, wherein the network apparatus is a gNB.

[0158] Example 1.30. The method of Example 1.22, wherein the first number of regions is derived from the UE RNTI and computed as a maximum number of PDCCH candidates for an aggregation level and a size of the CORESET defined by a number of CCEs, and wherein the first number of regions is defined in accordance with the following (1VEC E,p \j Mmax1 ) / _where R is a number of CORESET sections, Mmaxis a maximum number, nRNTIis an RNTI, NCCE pis a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1, and L is the PDCCH aggregation level.

[0159]

[0160] Example 1.31. The method of Example 1.29, wherein the first number of regions is configured by the gNB.

[0161] Example 1.32. The method of Example 1.31, wherein the gNB configures a plurality of the second number of regions via RRC and indicates a particular region via MAC-CE / DCI.

[0162] Example 1.33. The method of Example 1.25, wherein the second number of regions to be chosen (r^) are sequentially selected from (R^) regions (r = m = 0,..., M — 1).

[0163] Example 1.34. The method of Example 1.26, wherein the second number of regions are equally spaced within the CORESET (r = l-^-! mod R, m = 0,..., M — 1).

[0164] Example 1.36 A method, comprising:means for applying, by a network function of a network apparatus, a hashing function for associating one or more physical downlink control channel (PDCCH) candidates to a first number of regions of a control resource set (CORESET), wherein the first number of regions is larger than a number of the one or more PDCCH candidates to be monitored by a user equipment (UE); andmeans for selecting, by the network function, a second number of regions from the first number of regions, wherein the second number of regions is equal to the number of the one or more PDCCH candidates to be monitored by the UE.

[0165] Example 1.37. The method of Example 1.36, further comprising:means for selecting, by the network function, one or more PDCCH candidates from the second number of regions for placing one or more downlink control information messages for scheduling the UE.

[0166] Example 1.38. The method of Example 1.37, further comprising:means for transmitting, by the network function to the UE, the one or more downlink control information messages in the selected one or more PDCCH candidates.

[0167] Example 1.39. The method of any of Examples 1.36 to 1.38, wherein the first number of regions is a fixed number independent of a carrier frequency.

[0168] Example 1.40. The method of any of Examples 1.36 to 1.38, wherein the first number of regions is based on a UE radio network temporary identifier (RNTI).

[0169] Example 1.41. The method of Example 1.36, wherein the second number of regions are generated with variable spacing.

[0170] Example 1.42. The method of any of Examples 1.36 to 1.38, wherein the second number of regions are nonuniformly spread over the CORESET.

[0171] Example 1.43. The method of any of Examples 1.36 to 1.38, wherein the second number of regions are selected sequentially.

[0172] Example 1.44. The method of any of Examples 1.36 to 1.38, wherein the second number of regions are equally spaced within the CORESET.

[0173] Example 1.45. The method of any of Examples 1.34 to 1.36, wherein the indexes of the one or more PDCCH candidates are computed.

[0174] Example 1.46. The method of Example 1.27, wherein the indexes of the one or more PDCCH candidates are subsets of control channel elements (CCEs) of the CORESET computed in accordance with a hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the hash function is defined in accordance with the following:syvCCE,p+ nCImod |NCCEJP / L| + iL •where L is a PDCCH aggregation level, Yp nis a pseudo-random value for USS or 0 for s,fCSS, NCCE pis a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1,nCIis a carrier indicator field,is the first number of regions, andis the second number of regions.

[0175] Example 1.47. The method of any of Examples 1.36 to 1.38, wherein the network apparatus is a gNB.

[0176] Example 1.48. The method of Example 1.36, further comprising:means for selecting, by the network apparatus, one or more regions for placing a PDCCH candidate.

[0177] The embodiments and aspects disclosed herein are examples of the present disclosure and may be embodied in various forms. For instance, although certain embodiments herein are described as separate embodiments, each of the embodiments herein may be combined with one or more of the other embodiments herein. Specific structural and functional details disclosed herein are not to be interpreted as limiting, but as a basis for the claims and asa representative basis for teaching one skilled in the art to variously employ the present disclosure in virtually any appropriately detailed structure. Like reference numerals may refer to similar or identical elements throughout the description of the figures.

[0178] The phrases “in an aspect,” “in aspects,” “in various aspects,” “in some aspects,” or “in other aspects” may each refer to one or more of the same or different aspects in accordance with this present disclosure. The phrase “a plurality of’ may refer to two or more.

[0179] In various embodiments, the terms “first message” and “second message”, as well as any subsequent messages may refer to any messages that are transmitted or received in an order and are not necessarily limited to any particular message.

[0180] The phrases “in an embodiment,” “in embodiments,” “in various embodiments,” “in some embodiments,” or “in other embodiments” may each refer to one or more of the same or different embodiments in accordance with the present disclosure. A phrase in the form “A or B” means “(A), (B), or (A and B).” A phrase in the form “at least one of A, B, or C” means “(A); (B); (C); (A and B); (A and C); (B and C); or (A, B, and C) ”

[0181] Any of the herein described methods, programs, algorithms or codes may be converted to, or expressed in, a programming language or computer program. The terms “programming language” and “computer program,” as used herein, each include any language used to specify instructions to a computer, and include (but is not limited to) the following languages and their derivatives: Assembler, Basic, Batch files, BCPL, C, C+, C++, Delphi, Fortran, Java, JavaScript, machine code, operating system command languages, Pascal, Perl, PL1, Python, scripting languages, Visual Basic, metalanguages which themselves specify programs, and all first, second, third, fourth, fifth, or further generation computer languages. Also included are database and other data schemas, and any other meta-languages. No distinction is made between languages which are interpreted, compiled, or use both compiled and interpreted approaches. No distinction is made between compiled and source versions of a program. Thus, reference to a program, where the programming language could exist in more than one state (such as source, compiled, object, or linked) is a reference to any and all such states. Reference to a program may encompass the actual instructions and / or the intent of those instructions.

[0182] While aspects of the present disclosure have been shown in the drawings, it is not intended that the present disclosure be limited thereto, as it is intended that the present disclosure be as broad in scope as the art will allow and that the specification be read likewise. Therefore, the above description should not be construed as limiting, but merely asexemplifications of particular aspects. Those skilled in the art will envision other modifications within the scope and spirit of the claims appended hereto.

Claims

WHAT IS CLAIMED IS:

1. A user equipment (UE), comprising:at least one processor; andat least one memory storing instructions which, when executed by the at least one processor, cause the UE at least to perform:monitoring, by a user equipment (UE), one or more PDCCH candidates associated with a first number of regions of a control resource set (CORESET), wherein the first number of regions is larger than or equal to a maximum number of the one or more PDCCH candidates configured to the UE; andreceiving, by the UE, one or more downlink control information messages in the one or more PDCCH candidates from a network apparatus for transmission by the UE.

2. The UE of claim 1, wherein a second number of regions is selected by a network function from the first number of regions, wherein the second number of regions is for placing one or more downlink control information messages, and the second number of regions is equal to a number of the one or more PDCCH candidates monitored by the UE.

3. The UE as in any one of claims 1 or 2, wherein the first number of regions is a fixed number independent of a carrier frequency.

4. The UE as in any one of claims 1 to 3, wherein the first number of regions is based on a UE radio network temporary identifier (RNTI).

5. The UE as in any one of claims 1 to 3, wherein the second number of regions are generated with variable spacing.

6. The UE as in any one of claims 1 to 3, wherein the second number of regions is nonuniformly spaced over the CORESET.

7. The UE as in any one of claims 1 to 3, wherein the second number of regions are selected sequentially.

8. The UE as in any one of claims 1 to 3, wherein the second number of regions are equally spaced within the CORESET.

9. The UE as in any one of claims 1 to 8, wherein indexes of the one or more PDCCH candidates are computed.

10. The UE of claim 8, wherein the indexes of the one or more PDCCH candidates are subsets of control channel elements (CCEs) of the CORESET computed in accordance with a hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the hash function is defined in accordance with the following:,.(0.⌊NCCE,pmod |NCCEP / LJ + iwhere L is a PDCCH aggregation level, Yp nis a pseudo-random value for USS or 0 for s,fCSS, NCCE pis a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1,nCIis a carrier indicator field,is the first number of regions, and rL')is the second number of regions.

11. The UE of claim 9, wherein the indexes of the one or more PDCCH candidates are computed in accordance with a hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the PDCCH candidates are uniquely identified by the first and the second number of regions,Ks „(i)andrs respectively.

12. The UE as in any one of claims 1 to 11, wherein the network apparatus is a gNB.

13. The UE of claim 4, wherein the first number of regions is derived from the UE RNTI and computed as a maximum number of the one or more PDCCH candidates for an aggregation level and a size of the CORESET defined by a number of CCEs, and wherein the first number of regions is defined in accordance with the following:(1VEC E,p \7 ^max E 1 I / _where R is a number of CORESET sections, Mmaxis a maximum number of the one or more PDCCH candidates, nRNTIis an RNTI, NCCE,pis a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1, and L is the PDCCH aggregation level.

14. The UE of claim 4, wherein the first number of regions is computed as the maximum number of PDCCH candidates for a certain aggregation level plus a number greater than or equal to zero which is derived from the UE radio network temporary identifier (RNTI).

15. The UE of claim 12, wherein the first number of regions is configured by the gNB.

16. The UE of claim 15, wherein the gNB configures a plurality of the second number of regions via RRC and indicates a particular region via MAC-CE / DCI.

17. The UE of claim 7, wherein the second number of regions to be chosen (rL')) are sequentially selected from (R^) regions (r = m = 0,..., M — 1).

18. The UE of claim 8, wherein the second number of regions are equally spaced within the CORESET (r = mod R, m = 0,..., M — 1).

19. A method, comprising:monitoring, by a user equipment (UE), one or more PDCCH candidates associated with a first number of regions of a control resource set (CORESET), wherein the first number of regions is larger than or equal to a maximum number of the one or more PDCCH candidates configured to the UE; andreceiving, by the UE, one or more downlink control information messages in the one or more PDCCH candidates from a network apparatus for transmission by the UE.

20. The method of claim 19, wherein a second number of regions is selected by a network function, from the first number of regions, wherein the second number of regions is for placing one or more downlink control information messages, and the second number of regions is equal to a number of the one or more PDCCH candidates monitored by the UE.

21. The method as in any one of claims 19 to 20, wherein the first number of regions is a fixed number independent of a carrier frequency.

22. The method as in any one of claims 19 to 21, wherein the first number of regions is based on a UE radio network temporary identifier (RNTI).

23. The method as in any one of claims 19 to 21, wherein the second number of regions are generated with variable spacing.

24. The method as in any one of claims 19 to 21, wherein the one or more PDCCH candidate is nonuniformly spread over the CORESET.

25. The method as in any one of claims 19 to 21, wherein the second number of regions are selected sequentially.

26. The method as in any one of claims 19 to 21, wherein the second number of regions are equally spaced within the CORESET.

27. The method as in any one of claims 19 to 21, wherein indexes of the one or more PDCCH candidates are computed.

28. The method of claim 27, wherein the indexes of the one or more PDCCH candidates are subsets of control channel elements (CCEs) of the CORESET computed in accordance with a hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the hash function is defined in accordance with the following:,.(0. iv⌊NCCE,pL ■ + nCImod [NCCE,p / Lj + iwhere L is a PDCCH aggregation level, Yp nis a pseudo-random value for USS or 0 for s,fCSS, NCCE pis a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1,nCIis a carrier indicator field, is the first number of regions, and rL')is the second number of regions.

29. The method as in any one of claims 19 to 28, wherein the network apparatus is a gNB.

30. The method of claim 22, wherein the first number of regions is derived from the UE RNTI and computed as a maximum number of PDCCH candidates for an aggregation level and a size of the CORESET defined by a number of CCEs, and wherein the first number of regions is defined in accordance with the following(1VCC E,p \j ^max 3” 1 )where R is a number of CORESET sections, Mmaxis a maximum number, nRNTIis an RNTI, NCCE,pis a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1, and L is the PDCCH aggregation level.

31. The method of claim 29, wherein the first number of regions is configured by the gNB.

32. The method of claim 31, wherein the gNB configures a plurality of the second number of regions via RRC and indicates a particular region via MAC-CE / DCI.

33. The method of claim 25, wherein the second number of regions to be chosen (rL-)) are sequentially selected from (R^) regions (r = m = 0,..., M — 1).

34. The method of claim 26, wherein the second number of regions are equally spaced within the CORESET (r = |““| mod R, m = 0,..., M — 1).

35. A processor-readable medium storing instructions which, when executed by at least one processor of a user equipment (UE), cause the UE at least to perform a method as in any one of claims 19 to 34.

36. A method, comprising:applying, by a network function of a network apparatus, a hashing function for associating one or more physical downlink control channel (PDCCH) candidates to a first number of regions of a control resource set (CORESET), wherein the first number of regionsis larger than a number of the one or more PDCCH candidates to be monitored by a user equipment (UE); andselecting, by the network function, a second number of regions from the first number of regions, wherein the second number of regions is equal to the number of the one or more PDCCH candidates to be monitored by the UE.

37. The method of claim 36, further comprising:selecting, by the network function, one or more PDCCH candidates from the second number of regions for placing one or more downlink control information messages for scheduling the UE.

38. The method of claim 37, further comprising:transmitting, by the network function to the UE, the one or more downlink control information messages in the selected one or more PDCCH candidates.

39. The method as in any one of claims 36 to 38, wherein the first number of regions is a fixed number independent of a carrier frequency.

40. The method as in any one of claims 36 to 38, wherein the first number of regions is based on a UE radio network temporary identifier (RNTI).

41. The method of claim 40, wherein the second number of regions are generated with variable spacing.

42. The method as in any one of claims 36 to 38, wherein the second number of regions are nonuniformly spread over the CORESET.

43. The method as in any one of claims 36 to 38, wherein the second number of regions are selected sequentially.

44. The method as in any one of claims 36 to 38, wherein the second number of regions are equally spaced within the CORESET.

45. The method as in any one of claims 36 to 38, wherein indexes of the one or more PDCCH candidates are computed.

46. The method of claim 27, wherein the indexes of the one or more PDCCH candidates are subsets of control channel elements (CCEs) of the CORESET computed in accordance with hash function configured to map the first number of regions and the second number of regions to the CCEs of the CORESET, and wherein the hash function is defined in accordance with the following:AD.⌊NCCE,pL ■ + nCImod |NCCEJP / L| + iwhere L is a PDCCH aggregation level, Yp nis a pseudo-random value for USS or 0 forCSS, iVCCEp is a number of CCEs in CORESET p, wherein CCEs are numbered from 0 to NCCE,p-1,nCIis a carrier indicator field,is the first number of regions, andis the second number of regions.

47. The method as in any one of claims 36 to 38, wherein the network apparatus is a gNB.

48. The method of claim 36, further comprising:selecting, by the network apparatus, one or more regions for placing a PDCCH candidate.

49. A network apparatus, comprising:at least one processor; andat least one memory storing instructions which, when executed by the at least one processor, cause the network apparatus at least to perform a method as in any one of claims 36 to 48.

50. A processor-readable medium storing instructions which, when executed by at least one processor of a network apparatus, cause the network apparatus at least to perform a method as in any one of claims 36 to 48.

Images