Physical Downlink Control Channel Hash Function Update

Abstract

In summary, various aspects of the present disclosure relate to wireless communications. In some aspects, a user device may identify a hash value index associated with searching for a physical downlink control channel. The hash value index may be identified based at least in part on an index of an interval in a plurality of intervals within a period. The user device may configure a hash function associated with determining a hash value based at least in part on the hash value index. Numerous other aspects are provided.

Description

[0001] This application is a divisional application of the Chinese patent application with the application date of February 14, 2019, application number 201980012764.3, and invention name “Physical Downlink Control Channel Hash Function Update”.

[0002] CROSS-REFERENCE TO RELATED APPLICATIONS PURSUANT TO 35 U.S.C. §119

[0003] This application claims priority to U.S. Provisional Patent Application No. 62 / 710,307, filed on February 16, 2018, entitled “TECHNIQUES AND APPARATUSES FOR PHYSICAL DOWNLINK CONTROL CHANNEL HASH FUNCTION UPDATE IN NEW RADIO,” and U.S. Non-Provisional Patent Application No. 16 / 275,228, filed on February 13, 2019, entitled “PHYSICALDOWNLINK CONTROL CHANNEL HASH FUNCTION UPDATE,” which are incorporated herein by reference. Technical Field

[0004] In general, various aspects of the technology described below relate to wireless communications, and more specifically, to techniques and apparatus for updating a physical downlink control channel (PDCCH) hash function. Embodiments and techniques enable and provide wireless communication devices and systems configured for flexible searches for PDCCHs. Background Art

[0005] Wireless communication systems are widely deployed to provide a variety of telecommunication services such as telephony, video, data, messaging, and broadcasting. Typical wireless communication systems may employ multiple access technologies that can support communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power, etc.). Examples of such multiple access technologies include code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, single-carrier frequency division multiple access (SC-FDMA) systems, time division synchronous code division multiple access (TD-SCDMA) systems, and long term evolution (LTE). LTE / LTE-Advanced is a set of enhancements to the Universal Mobile Telecommunications System (UMTS) mobile standard promulgated by the Third Generation Partnership Project (3GPP).

[0006] A wireless communication network may include multiple base stations (BSs) that can support communications for multiple user equipment (UEs). User equipment (UEs) can communicate with a base station (BS) via downlinks and uplinks. A downlink (or forward link) refers to the communication link from the BS to the UE, while an uplink (or reverse link) refers to the communication link from the UE to the BS. As will be described in more detail herein, a BS may be referred to as a Node B, gNB, access point (AP), radio head, transmit receive point (TRP), new radio (NR) BS, 5G Node B, etc.

[0007] The above multiple access technologies have been adopted in various telecommunication standards to provide a common protocol that enables different user devices to communicate at the city, country, region, and even global levels. New Radio (NR) (which may also be referred to as 5G) is a set of enhancements to the LTE mobile standard released by the Third Generation Partnership Project (3GPP). NR is designed to better integrate with other open standards by improving spectrum efficiency, reducing costs, improving services, utilizing new spectrum, and using orthogonal frequency division multiplexing (OFDM) (CP-OFDM) with a cyclic prefix (CP) on the downlink (DL) and CP-OFDM and / or SC-FDM (e.g., also known as discrete Fourier transform spread OFDM (DFT-s-OFDM)) on the uplink (UL), thereby better supporting mobile broadband Internet access, as well as supporting beamforming, multiple input multiple output (MIMO) antenna technology, and carrier aggregation. However, as the demand for mobile broadband access continues to grow, further improvements in LTE and NR technologies are expected. Preferably, these improvements should be applicable to other multiple access technologies and telecommunication standards that adopt these technologies. Summary of the Invention

[0008] The following summarizes some aspects of the present disclosure in order to provide a basic understanding of the technology discussed. This summary is not an exhaustive review of all anticipated features of the present disclosure and is neither intended to identify key or important elements of all aspects of the present disclosure nor to delineate the scope of any or all aspects of the present disclosure. The purpose of this summary is to provide some concepts of one or more aspects of the present disclosure in a simplified form as a prelude to a more detailed description that will be given later.

[0009] In some aspects, a method of wireless communication performed by a user device may include: identifying an index of a hash value associated with a search for a physical downlink control channel (PDCCH), wherein the index of the hash value is identified based at least in part on one of: an index of an interval in a plurality of intervals within a period, an index of a search space set opportunity in a plurality of search space set opportunities associated with a search space set index within the period, or an index of a search space set opportunity in a plurality of search space set opportunities associated with a plurality of search space set indexes within the period, wherein the plurality of search space set indexes are associated with a control resource set index; and configuring a hash function associated with determining the hash value based at least in part on the index of the hash value.

[0010] In some aspects, a user equipment for wireless communication may include a memory and one or more processors operatively coupled to the memory. The memory and the one or more processors may be configured to: identify an index of a hash value associated with searching for a physical downlink control channel (PDCCH), wherein the index of the hash value is identified based at least in part on one of: an index of an interval in a plurality of intervals within a period, an index of a search space set opportunity in a plurality of search space set opportunities within the period associated with a search space set index, or an index of a search space set opportunity in a plurality of search space set indexes within the period, wherein the plurality of search space set indices are associated with a control resource set index; and configure a hash function associated with determining the hash value based at least in part on the index of the hash value.

[0011] In some aspects, a non-transitory computer-readable medium may store one or more instructions for wireless communication. The one or more instructions, when executed by one or more processors of a user equipment, may cause the one or more processors to: identify an index of a hash value associated with searching for a physical downlink control channel (PDCCH), wherein the index of the hash value is identified based at least in part on one of: an index of an interval in a plurality of intervals within a period, an index of a search space set opportunity in a plurality of search space set opportunities within the period associated with a search space set index, or an index of a search space set opportunity in a plurality of search space set indexes within the period, wherein the plurality of search space set indices are associated with a control resource set index; and configure a hash function associated with determining the hash value based at least in part on the index of the hash value.

[0012] In some aspects, an apparatus for wireless communication may include: a unit for identifying an index of a hash value associated with a search for a physical downlink control channel (PDCCH), wherein the index of the hash value is identified based at least in part on one of: an index of an interval in a plurality of intervals within a period, an index of a search space set opportunity in a plurality of search space set opportunities associated with a search space set index within the period, or an index of a search space set opportunity in a plurality of search space set opportunities associated with a plurality of search space set indexes within the period, wherein the plurality of search space set indices are associated with a control resource set index; and a unit for configuring a hash function associated with determining the hash value based at least in part on the index of the hash value.

[0013] In some aspects, a method of wireless communication performed by a user device may include: identifying an index of a hash value associated with searching for a PDCCH based at least in part on an index of an interval among multiple intervals within a period; and configuring a hash function associated with determining the hash value based at least in part on the index of the hash value.

[0014] In some aspects, a user equipment for wireless communication may include a memory and one or more processors operatively coupled to the memory. The memory and the one or more processors may be configured to: identify an index of a hash value associated with searching for a PDCCH based at least in part on an index of an interval in a plurality of intervals within a cycle; and configure a hash function associated with determining the hash value based at least in part on the index of the hash value.

[0015] In some aspects, a non-transitory computer-readable medium may store one or more instructions for wireless communication. The one or more instructions, when executed by one or more processors of a user equipment, may cause the one or more processors to: identify an index of a hash value associated with searching for a PDCCH based at least in part on an index of an interval in a plurality of intervals within a period; and configure a hash function associated with determining the hash value based at least in part on the index of the hash value.

[0016] In some aspects, an apparatus for wireless communication may include: a unit for identifying an index of a hash value associated with searching for a PDCCH based at least in part on an index of an interval among multiple intervals within a period; and a unit for configuring a hash function associated with determining the hash value based at least in part on the index of the hash value.

[0017] In summary, aspects include methods, apparatus, systems, computer program products, non-transitory computer-readable media, user equipment, base stations, wireless communication devices, and processing systems as fully described herein with reference to and as illustrated by the accompanying figures and description.

[0018] The foregoing has generally outlined the features and technical advantages of the examples according to the present disclosure so that the following detailed description may be better understood. Additional features and advantages will be described below. The disclosed concepts and specific examples may be readily used as a basis for modifying or designing other structures for achieving the same purpose of the present disclosure. Such equivalent constructions do not depart from the scope of the appended claims. When considered in conjunction with the accompanying drawings, the characteristics of the concepts disclosed herein (both their organization and method of operation) and the associated advantages will be better understood from the description below. Each of the figures in the accompanying drawings is provided for the purpose of illustration and description and is not intended to be a definition of limitations to the claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to fully understand the above-mentioned features of the present disclosure, a more detailed description of the invention briefly summarized above can be obtained by referring to various aspects (some of which are shown in the accompanying drawings). However, it should be noted that the accompanying drawings only illustrate certain typical aspects of the present disclosure and are therefore not to be considered as limiting the scope of the present disclosure, as the description may allow for other equally effective aspects. The same reference numerals in different drawings may identify the same or similar elements.

[0020] Figure 1 is a block diagram conceptually illustrating an example of a wireless communication network in accordance with various aspects of the present disclosure.

[0021] Figure 2 is a block diagram conceptually illustrating an example of a base station in communication with a user equipment (UE) in a wireless communication network according to various aspects of the present disclosure.

[0022] Figure 3A is a block diagram conceptually illustrating an example of a frame structure in a wireless communication network in accordance with various aspects of the present disclosure.

[0023] Figure 3B is a block diagram conceptually illustrating an example synchronous communication hierarchy in a wireless communication network in accordance with various aspects of the present disclosure.

[0024] Figure 4 is a block diagram conceptually illustrating an example slot format with a normal cyclic prefix in accordance with various aspects of the present disclosure.

[0025] Figure 5An example logical architecture of a distributed radio access network (RAN) according to various aspects of the present disclosure is shown.

[0026] Figure 6 An example physical architecture of a distributed RAN according to various aspects of the present disclosure is shown.

[0027] Figure 7 is a diagram illustrating an example of a downlink (DL)-centric subframe according to various aspects of the present disclosure.

[0028] Figure 8 is a diagram illustrating an example of an uplink (UL)-centric subframe in accordance with various aspects of the present disclosure.

[0029] Figure 9 is a diagram illustrating examples of identifying a hash value index of a hash function associated with identifying a position where a candidate PDCCH may be received; and updating the hash function and / or resuming the hash function according to various aspects of the present disclosure.

[0030] Figure 10 is a diagram illustrating an example process performed, for example, by a user device, in accordance with various aspects of the present disclosure.

[0031] Figure 11 is a diagram illustrating an example process performed, for example, by a user device, in accordance with various aspects of the present disclosure. DETAILED DESCRIPTION

[0032] The following describes various aspects of the present disclosure in more detail with reference to the accompanying drawings. However, the present disclosure can be embodied in many different forms and should not be construed as being limited to any specific structure or function presented throughout the present disclosure. More specifically, these aspects are provided so that the present disclosure will be thorough and complete and will fully convey the scope of the present disclosure to those skilled in the art. Based on the teachings herein, it should be understood by those skilled in the art that the scope of the present disclosure is intended to cover any aspect of the present disclosure disclosed herein, whether that aspect is implemented independently of any other aspect of the present disclosure or is implemented in combination with any other aspect. For example, a device can be implemented or a method can be implemented using any number of aspects set forth herein. In addition, the scope of the present disclosure is intended to cover such devices or methods implemented using other structures, functions, or structures and functions in addition to or different from the various aspects of the present disclosure set forth herein. It should be understood that any aspect of the present disclosure disclosed herein can be embodied by one or more elements of the claims.

[0033] Several aspects of telecommunications systems will now be presented with reference to various devices and techniques. These devices and techniques will be described in the following detailed description by various blocks, modules, components, circuits, steps, processes, algorithms, etc. (collectively referred to as "elements") and illustrated in the accompanying drawings. These elements may be implemented using hardware, software, or a combination thereof. Whether such elements are implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system.

[0034] It should be noted that although various aspects may be described herein using terms commonly associated with 3G and / or 4G wireless technologies, various aspects of the present disclosure may be applicable to communication systems based on other generations, such as 5G and beyond (including NR technology).

[0035] Although various aspects and embodiments are described in this application by illustrating some examples, it will be understood by those skilled in the art that additional implementations and use cases may be generated in many different arrangements and scenarios. The innovations described herein can be implemented across many different platform types, devices, systems, shapes, sizes, and packaging arrangements. For example, embodiments and / or uses may be generated via integrated chip embodiments and / or other devices based on non-module components (e.g., end-user devices, vehicles, communication devices, computing devices, industrial devices, retail / purchase equipment, medical devices, AI-enabled devices, etc.). Although some examples may or may not be specifically for use cases or applications, there may be a variety of applicable scopes for the described innovations. Implementations may have a range from chip-level or modular components to non-modular, non-chip-level implementations, and further to aggregated, distributed, or original equipment manufacturer (OEM) devices or systems incorporating one or more aspects of the described innovations. In some actual settings, the devices incorporating the described aspects and features may also necessarily include additional components and features for the implementation and enforcement of the claimed and described embodiments. For example, the transmission and reception of wireless signals necessarily include multiple components for analog and digital purposes (e.g., hardware components including antennas, RF chains, power amplifiers, modulators, buffers, processors, interleavers, adders / summers, etc.). It is intended that the innovations described herein can be implemented in a variety of devices, chip-level components, systems, distributed arrangements, end-user devices, etc., having different sizes, shapes, and configurations.

[0036] Figure 1is a diagram illustrating a network 100 in which aspects of the present disclosure may be implemented. The network 100 may be an LTE network or some other wireless network (e.g., a 5G or NR network). The wireless network 100 may include multiple BSs 110 (shown as BS 110a, BS 110b, BS 110c, and BS 110d) and other network entities. A BS is an entity that communicates with a user equipment (UE) and may also be referred to as a base station, NR BS, Node B, gNB, 5G Node B (NB), access point, transmit receive point (TRP), etc. Each BS may provide communication coverage for a specific geographic area. In 3GPP, the term "cell" may refer to the coverage area of a BS and / or a BS subsystem serving that coverage area, depending on the context in which the term is used.

[0037] A BS may provide communication coverage for a macro cell, a pico cell, a femto cell, and / or another type of cell. A macro cell may cover a relatively large geographic area (e.g., several kilometers in radius) and may allow unrestricted access by UEs with service subscription. A pico cell may cover a relatively small geographic area and may allow unrestricted access by UEs with service subscription. A femto cell may cover a relatively small geographic area (e.g., a residence) and may allow restricted access by UEs associated with the femto cell (e.g., UEs in a closed subscriber group (CSG)). A BS for a macro cell may be referred to as a macro BS. A BS for a pico cell may be referred to as a pico BS. A BS for a femto cell may be referred to as a femto BS or a home BS. In Figure 1 In the example shown in FIG, BS 110a may be a macro BS for macrocell 102a, BS 110b may be a pico BS for picocell 102b, and BS 110c may be a femto BS for femtocell 102c. A BS may support one or more (e.g., three) cells. The terms "eNB," "base station," "NR BS," "gNB," "TRP," "AP," "Node B," "5G NB," and "cell" may be used interchangeably herein.

[0038] In some aspects, the cells may not necessarily be stationary, and the geographic area of the cells may move depending on the location of the mobile BS. In some aspects, the BSs may be interconnected with each other and / or with one or more other BSs or network nodes (not shown) in access network 100 via various types of backhaul interfaces (e.g., direct physical connections, virtual networks, and / or similar interfaces using any suitable transport network).

[0039] The wireless network 100 may also include a relay station. A relay station is an entity that can receive data transmissions from an upstream station (e.g., a BS or a UE) and send data transmissions to a downstream station (e.g., a UE or a BS). A relay station may also be a UE that can relay transmissions for other UEs. Figure 1 In the example shown in , a relay station 110d may communicate with a macro BS 110a and a UE 120d to facilitate communication between the BS 110a and the UE 120d. A relay station may also be referred to as a relay BS, a relay base station, a relay, or the like.

[0040] The wireless network 100 may be a heterogeneous network including different types of BSs (e.g., macro BSs, pico BSs, femto BSs, relay BSs, etc.). These different types of BSs may have different transmit power levels, different coverage areas, and different impacts on interference in the wireless network 100. For example, a macro BS may have a high transmit power level (e.g., 5 to 40 watts), while a pico BS, a femto BS, and a relay BS may have a lower transmit power level (e.g., 0.1 to 2 watts).

[0041] The network controller 130 may be coupled to a set of BSs and may provide coordination and control for these BSs. The network controller 130 may communicate with the BSs via a backhaul. The BSs may also communicate with each other directly or indirectly, for example, via a wireless or wired backhaul.

[0042] UEs 120 (e.g., 120a, 120b, 120c) may be dispersed throughout the wireless network 100, and each UE may be stationary or mobile. A UE may also be referred to as an access terminal, terminal, mobile station, subscriber unit, station, etc. A UE may be a cellular phone (e.g., a smartphone), a personal digital assistant (PDA), a wireless modem, a wireless communication device, a handheld device, a laptop computer, a cordless phone, a wireless local loop (WLL) station, a tablet device, a camera, a gaming device, a netbook, a smartbook, an ultrabook, a medical device or apparatus, a biometric sensor / device, a wearable device (e.g., a smart watch, smart clothing, smart glasses, a smart wristband, smart jewelry (e.g., a smart ring, a smart bracelet, etc.)), an entertainment device (e.g., a music or video device, or a satellite radio unit, etc.), a vehicle component or sensor, a smart meter / sensor, industrial manufacturing equipment, a global positioning system device, or any other suitable device configured to communicate via a wireless or wired medium.

[0043] Some UEs may be considered to be machine type communication (MTC) or evolved or enhanced machine type communication (eMTC) UEs. MTC and eMTC UEs include, for example, robots, drones, remote devices (e.g., sensors, meters, monitors, location tags, etc.), which may communicate with a base station, another device (e.g., a remote device), or some other entity. A wireless node may provide a connection to or to a network (e.g., a wide area network such as the Internet or a cellular network), for example, via a wired or wireless communication link. Some UEs may be considered to be Internet of Things (IoT) devices, and / or may be implemented as NB-IoT (narrowband Internet of Things) devices. Some UEs may be considered to be customer premises equipment (CPE). UE 120 may be included inside a housing that houses components of UE 120 (such as a processor component, a memory component, etc.).

[0044] In general, any number of wireless networks can be deployed in a given geographic area. Each wireless network can support a specific radio access technology (RAT) and can operate on one or more frequencies. RAT can also be referred to as radio technology, air interface, etc. Frequency can also be referred to as carrier, frequency channel, etc. Each frequency can support a single RAT in a given geographic area to avoid interference between wireless networks of different RATs. In some cases, NR or 5G RAT networks can be deployed.

[0045] In some aspects, two or more UEs 120 (e.g., shown as UE 120a and UE 120e) can communicate directly using one or more sidelink channels (e.g., without using the base station 110 as an intermediary for communicating with each other). For example, the UEs 120 can communicate using peer-to-peer (P2P) communication, device-to-device (D2D) communication, vehicle-to-everything (V2X) protocols (e.g., which may include vehicle-to-vehicle (V2V) protocols, vehicle-to-infrastructure (V2I) protocols, etc.), mesh networks, etc. In this case, the UEs 120 can perform scheduling operations, resource selection operations, and / or other operations described elsewhere herein as being performed by the base station 110.

[0046] As pointed out above, Figure 1 It is provided as an example only. Other examples are possible and may differ from the examples described above. Figure 1 Examples described.

[0047] Figure 2 A base station 110 and a UE 120 (which may be Figure 11. Base station 110 may be equipped with T antennas 234a through 234t, and UE 120 may be equipped with R antennas 252a through 252r, where in general, T ≥ 1 and R ≥ 1.

[0048] At the base station 110, the transmit processor 220 may receive data for one or more UEs from a data source 212, select one or more modulation and coding schemes (MCS) for each UE based at least in part on a channel quality indicator (CQI) received from the UE, process (e.g., encode and modulate) the data for each UE based at least in part on the MCS selected for the UE, and provide data symbols for all UEs. The transmit processor 220 may also process system information (e.g., for semi-static resource partitioning information (SRPI) and control information (e.g., CQI requests, grants, upper layer signaling, etc.), and provide overhead symbols and control symbols. The transmit processor 220 may also generate reference symbols for reference signals (e.g., cell-specific reference signals (CRS)) and synchronization signals (e.g., primary synchronization signals (PSS) and secondary synchronization signals (SSS)). A transmit (TX) multiple-input, multiple-output (MIMO) processor 230 may perform spatial processing (e.g., precoding) on data symbols, control symbols, overhead symbols, and / or reference symbols, if applicable, and may provide T output symbol streams to T modulators (MODs) 232a through 232t. Each modulator 232 may process a corresponding output symbol stream (e.g., for OFDM, etc.) to obtain an output sample stream. Each modulator 232 may further process (e.g., convert to analog, amplify, filter, and upconvert) the output sample stream to obtain a downlink signal. The T downlink signals from modulators 232a through 232t may be transmitted via T antennas 234a through 234t, respectively. In accordance with various aspects described in greater detail below, position coding may be utilized to generate synchronization signals to convey additional information.

[0049] At UE 120, antennas 252a through 252r may receive downlink signals from base station 110 and / or other base stations and may provide received signals to demodulators (DEMODs) 254a through 254r, respectively. Each demodulator 254 may condition (e.g., filter, amplify, downconvert, and digitize) the received signal to obtain input samples. Each demodulator 254 may further process the input samples (e.g., for OFDM, etc.) to obtain received symbols. A MIMO detector 256 may obtain received symbols from all R demodulators 254a through 254r, perform MIMO detection on the received symbols (if applicable), and provide detected symbols. A receive processor 258 may process (e.g., demodulate and decode) the detected symbols, provide decoded data for UE 120 to a data sink 260, and provide decoded control information and system information to a controller / processor 280. The channel processor may determine reference signal received power (RSRP), received signal strength indicator (RSSI), reference signal received quality (RSRQ), CQI, and the like.

[0050] On the uplink, at the UE 120, a transmit processor 264 may receive and process data from a data source 262 and control information from a controller / processor 280 (e.g., for reports including RSRP, RSSI, RSRQ, CQI, etc.). The transmit processor 264 may also generate reference symbols for one or more reference signals. The symbols from the transmit processor 264 may be precoded by a TX MIMO processor 266 (if applicable), further processed by modulators 254a through 254r (e.g., for DFT-s-OFDM, CP-OFDM, etc.), and transmitted to the base station 110. At the base station 110, uplink signals from the UE 120 and other UEs may be received by the antennas 234, processed by the demodulators 232, detected by the MIMO detector 236 (if applicable), and further processed by the receive processor 238 to obtain decoded data and control information transmitted by the UE 120. The receive processor 238 may provide the decoded data to the data sink 239 and the decoded control information to the controller / processor 240. The base station 110 may include a communication unit 244 and communicate with the network controller 130 via the communication unit 244. The network controller 130 may include a communication unit 294, a controller / processor 290, and a memory 292.

[0051] In some aspects, one or more components of the UE 120 may be included in a housing. The controller / processor 240 of the base station 110, the controller / processor 280 of the UE 120, and / or Figure 2Any other component in the controller / processor 240 of the base station 110, the controller / processor 280 of the UE 120, and / or the like may perform one or more techniques associated with physical downlink control channel (PDCCH) hash function updates and / or restarts, as described in more detail elsewhere herein. Figure 2 Any other component in may perform or direct e.g. Figure 10 The process of 1000 Figure 11 The operations of the process 1100 and / or other processes as described herein. The memories 242 and 282 may store data and program codes for the base station 110 and the UE 120, respectively. Thus, the memory 282 may include a non-transitory computer-readable medium storing one or more instructions for wireless communication, which, when executed by one or more processors of the UE 120, may cause the one or more processors to perform various functions disclosed elsewhere herein, e.g., with reference to Figure 10 and / or Figure 11 Additionally or alternatively, memory 282 may receive and / or copy such instructions from a non-transitory computer-readable medium storing such one or more instructions. Scheduler 246 may schedule UEs for data transmission on the downlink and / or uplink.

[0052] In some aspects, UE 120 may include: means for identifying an index of a hash value associated with searching for a PDCCH, wherein the index of the hash value is identified based at least in part on one of: an index of an interval in a plurality of intervals within a period, an index of a search space set opportunity in a plurality of search space set opportunities associated with a search space set index within the period, or an index of a search space set opportunity in a plurality of search space set opportunities associated with a plurality of search space set indexes within the period, wherein the plurality of search space set indexes are associated with a control resource set index; means for configuring a hash function associated with determining the hash value based at least in part on the index of the hash value; and the like. In some aspects, such means may include combining Figure 2 One or more components of UE 120 are described.

[0053] In some aspects, UE 120 may include: means for identifying an index of a hash value associated with searching for a PDCCH based at least in part on an index of an interval in a plurality of intervals within a period; means for configuring a hash function associated with determining the hash value based at least in part on the index of the hash value; and the like. In some aspects, UE 120 may include: means for updating the hash function at another interval in the plurality of intervals based at least in part on an updated index of the hash value, the updated index being identified based at least in part on the index of the another interval. In some aspects, an interval may be defined as a set of N (N≥1) consecutive symbols. In some aspects, such means may include combining Figure 2 One or more components of UE 120 are described.

[0054] As pointed out above, Figure 2 It is provided as an example only. Other examples are possible and may differ from the examples described above. Figure 2 Examples described.

[0055] Figure 3A An example frame structure 300 for frequency division duplex (FDD) in a telecommunications system (e.g., NR) is shown. The transmission timeline for each of the downlink and uplink can be divided into units of radio frames (sometimes referred to as frames). Each radio frame can have a predetermined duration (e.g., 10 milliseconds (ms)) and can be divided into a set of Z (Z ≥ 1) subframes (e.g., with indices from 0 to Z-1). Each subframe can have a predetermined duration (e.g., 1 ms) and can include a set of time slots (e.g., in Figure 3A Each subframe has 2 m time slots, where m is the numerology used for transmission, e.g., 0, 1, 2, 3, 4, etc.). Each time slot may include a set of L symbol periods. For example, each time slot may include fourteen symbol periods (e.g., Figure 3A ), seven symbol periods, or another number of symbol periods. Where a subframe comprises one slot (e.g., when m=0), the subframe may comprise L symbol periods, where the L symbol periods in each subframe may be assigned indices from 0 to L-1. In some aspects, the scheduling unit for FDD may be frame-based, subframe-based, slot-based, symbol-based, etc.

[0056] Although some techniques are described herein with reference to frames, subframes, time slots, etc., these techniques are equally applicable to other types of wireless communication structures, which may be referred to in 5G NR using terms other than "frame," "subframe," "time slot," etc. In some aspects, a wireless communication structure may refer to a periodic, time-bounded communication unit defined by a wireless communication standard and / or protocol. Additionally or alternatively, a frame may be used in conjunction with a subframe. Figure 3A The configurations of the wireless communication structures are different from those shown in FIG.

[0057] In some telecommunications (e.g., NR), a base station may transmit synchronization signals. For example, a base station may transmit a primary synchronization signal (PSS), a secondary synchronization signal (SSS), etc. on the downlink for each cell supported by the base station. The PSS and SSS may be used by the UE for cell search and acquisition. For example, the PSS may be used by the UE to determine symbol timing, and the SSS may be used by the UE to determine the physical cell identifier and frame timing associated with the base station. The base station may also transmit a physical broadcast channel (PBCH). The PBCH may carry certain system information, such as system information that supports initial access by the UE.

[0058] In some aspects, a base station may transmit the PSS, SSS, and / or PBCH according to a synchronization communication level (e.g., a synchronization signal (SS) level) including multiple synchronization communications (e.g., SS blocks), as described below in conjunction with Figure 3B Descriptive.

[0059] Figure 3B FIG. 1 is a block diagram conceptually illustrating an example SS hierarchy, which is an example of a synchronous communication hierarchy. Figure 3B As shown in FIG, the SS hierarchy may include an SS burst set, which may include multiple SS bursts (identified as SS burst 0 to SS burst B-1, where B is the maximum number of repetitions of the SS burst that may be sent by the base station). As further shown, each SS burst may include one or more SS blocks (identified as SS block 0 to SS block (b max_SS-1 ), where b max_SS-1 is the maximum number of SS blocks that can be carried by an SS burst). In some aspects, different SS blocks may be beamformed in different ways. A wireless node may periodically send a set of SS bursts, such as every X milliseconds, e.g. Figure 3B In some aspects, the SS burst set may have a fixed or dynamic length. Figure 3B is shown as Y milliseconds.

[0060] Figure 3B The SS burst sets shown in are examples of synchronous communication sets, and other synchronous communication sets may be used in conjunction with the techniques described herein. Figure 3B The SS blocks shown in are examples of synchronous communications, and other synchronous communications may be used in conjunction with the techniques described herein.

[0061] In some aspects, an SS block includes resources that carry the PSS, SSS, PBCH, and / or other synchronization signals (e.g., a tertiary synchronization signal (TSS)) and / or synchronization channels. In some aspects, multiple SS blocks are included in an SS burst, and the PSS, SSS, and / or PBCH may be the same across each SS block of the SS burst. In some aspects, a single SS block may be included in an SS burst. In some aspects, an SS block may be at least four symbol periods in length, with each symbol carrying one or more of the PSS (e.g., occupying one symbol), the SSS (e.g., occupying one symbol), and / or the PBCH (e.g., occupying two symbols).

[0062] In some aspects, such as Figure 3B As shown in , the symbols of the SS blocks are contiguous. In some aspects, the symbols of the SS blocks are discontinuous. Similarly, in some aspects, one or more SS blocks of an SS burst may be sent in contiguous radio resources (e.g., consecutive symbol periods) during one or more subframes. Additionally or alternatively, one or more SS blocks of an SS burst may be sent in discontinuous radio resources.

[0063] In some aspects, an SS burst may have a burst period, such that a base station may transmit an SS block of the SS burst according to the burst period. In other words, the SS block may repeat during each SS burst. In some aspects, an SS burst set may have a burst set period, such that a base station may transmit an SS burst of the SS burst set according to a fixed burst set period. In other words, the SS burst may repeat during each SS burst set.

[0064] The BS may send system information (e.g., system information blocks (SIBs)) on the physical downlink shared channel (PDSCH) in certain subframes. The base station may send control information / data on the PDCCH in C symbol periods of a subframe, where C may be configurable for each subframe. The base station may send traffic data and / or other data on the PDSCH in the remaining symbol periods of each subframe.

[0065] As pointed out above, Figure 3A and 3B are provided as examples. Other examples are possible and may differ from the examples provided herein. Figure 3A and 3B Examples described.

[0066] Figure 4An example slot format 410 with a normal cyclic prefix is shown. The available time-frequency resources may be divided into resource blocks. Each resource block may cover a set of subcarriers (e.g., 12 subcarriers) in a slot and may include multiple resource elements. Each resource element may cover one subcarrier in one symbol period (e.g., in time) and may be used to transmit one modulation symbol, which may be real or complex valued. In some aspects, the slot format 410 may be used for transmission of SS blocks carrying PSS, SSS, PBCH, etc., as described herein.

[0067] An interlace structure may be used for each of the downlink and uplink for FDD in certain telecommunication systems (e.g., NR). For example, Q interlaces may be defined with indices ranging from 0 to Q-1, where Q may be equal to 4, 6, 8, 10, or some other value. Each interlace may include slots spaced apart by Q frames. Specifically, interlace q may include slots q, q+Q, q+2Q, etc., where q∈{0,...,Q-1}.

[0068] A UE may be located within the coverage of multiple BSs. One of these BSs may be selected to serve the UE. The serving BS may be selected based at least in part on various criteria (e.g., received signal strength, received signal quality, path loss, etc.). The received signal quality may be quantified by the signal-to-noise and interference ratio (SINR), or the reference signal received quality (RSRQ), or some other metric. The UE may operate in a significant interference scenario, where the UE may observe high interference from one or more interfering BSs.

[0069] While aspects of the examples described herein may be associated with NR or 5G technology, aspects of the present disclosure may be applied with other wireless communication systems. New Radio (NR) may refer to a radio configured to operate according to a new air interface (e.g., in addition to an air interface based on Orthogonal Frequency Division Multiple Access (OFDMA)) or a fixed transport layer (e.g., in addition to Internet Protocol (IP)). In various aspects, NR may utilize OFDM with CP (referred to herein as cyclic prefix OFDM or CP-OFDM) and / or SC-FDM on the uplink, may utilize CP-OFDM on the downlink and include support for half-duplex operation using time division duplex (TDD). In various aspects, NR may, for example, utilize OFDM with CP (referred to herein as CP-OFDM) and / or discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-s-OFDM) on the uplink, may utilize CP-OFDM on the downlink and include support for half-duplex operation using TDD. NR may include enhanced mobile broadband (eMBB) services targeting wide bandwidth (e.g., 80 megahertz (MHz) and greater), millimeter wave (mmW) targeting high carrier frequencies (e.g., 60 gigahertz (GHz)), massive MTC (mMTC) targeting non-backward compatible MTC technologies, and / or mission critical targeting ultra-reliable low latency communication (URLLC) services.

[0070] In some aspects, a single component carrier bandwidth of 100 MHz can be supported. NR resource blocks can span 12 subcarriers with a subcarrier bandwidth of 60 or 120 kilohertz (kHz) in a 0.1 millisecond (ms) duration. Each radio frame can include 40 slots and have a length of 10 ms. Thus, each slot can have a length of 0.25 ms. Each slot can indicate the link direction (e.g., DL or UL) used for data transmission, and the link direction for each slot can be switched dynamically. Each slot can include DL / UL data and DL / UL control data.

[0071] Beamforming can be supported and the beam direction can be dynamically configured. MIMO transmission with precoding can also be supported. MIMO configuration in the DL can support up to 8 transmit antennas, with multi-layer DL transmission of up to 8 streams and up to 2 streams per UE. Multi-layer transmission with up to 2 streams per UE can be supported. Aggregation of multiple cells with up to 8 serving cells can be supported. Alternatively, NR can support different air interfaces other than OFDM-based interfaces. NR networks can include entities such as a central unit or distributed units.

[0072] As pointed out above, Figure 4are provided as examples. Other examples are possible and may differ from the examples provided herein. Figure 4 Examples described.

[0073] Figure 5 An example logical architecture of a distributed RAN 500 according to aspects of the present disclosure is shown. A 5G access node 506 may include an access node controller (ANC) 502. The ANC may be a central unit (CU) of the distributed RAN 500. The backhaul interface to the next generation core network (NG-CN) 504 may terminate at the ANC. The backhaul interface to the adjacent next generation access node (NG-AN) may terminate at the ANC. The ANC may include one or more TRPs 508 (which may also be referred to as a BS, NR BS, Node B, 5G NB, AP, gNB, or some other terminology). As described above, TRP may be used interchangeably with "cell."

[0074] The TRP 508 may be a distributed unit (DU). The TRP may be connected to one ANC (ANC 502) or more than one ANC (not shown). For example, for RAN sharing, Radio as a Service (RaaS), and service-specific ADN deployments, the TRP may be connected to more than one ANC. The TRP may include one or more antenna ports. The TRP may be configured to provide services to the UE individually (e.g., dynamically selected) or jointly (e.g., joint transmission).

[0075] The local architecture of RAN 500 can be used to illustrate the fronthaul definition. The architecture can be defined to support fronthaul solutions across different deployment types. For example, the architecture can be based at least in part on the transmitting network capabilities (e.g., bandwidth, latency, and / or jitter).

[0076] The architecture may share features and / or components with LTE. According to various aspects, the next generation AN (NG-AN) 510 may support dual connectivity with NR. The NG-AN may share a common fronthaul for LTE and NR.

[0077] This architecture may enable collaboration between and among TRPs 508. For example, collaboration may be pre-set within and / or across TRPs via ANC 502. According to various aspects, an inter-TRP interface may not be used / exist.

[0078] According to various aspects, dynamic configuration of split logical functions can exist in the architecture of RAN 500. Packet Data Convergence Protocol (PDCP), Radio Link Control (RLC), Medium Access Control (MAC) protocols can be adaptively placed at the ANC or TRP.

[0079] According to various aspects, a BS may include a central unit (CU) (eg, ANC 502) and / or one or more distributed units (eg, one or more TRPs 508).

[0080] As pointed out above, Figure 5 It is provided as an example only. Other examples are possible and may differ from the examples described above. Figure 5 Examples described.

[0081] Figure 6 An example physical architecture of a distributed RAN 600 according to aspects of the present disclosure is shown. A centralized core network unit (C-CU) 602 may host core network functions. The C-CU may be centrally deployed. C-CU functions may be offloaded (e.g., to Advanced Wireless Services (AWS)) to focus on handling peak capacity.

[0082] The centralized RAN unit (C-RU) 604 can host one or more ANC functions. Alternatively, the C-RU can host core network functions locally. The C-RU can have a distributed deployment. The C-RU can be closer to the network edge.

[0083] A distributed unit (DU) 606 may host one or more TRPs. The DU may be located at the edge of the network with radio frequency (RF) capabilities.

[0084] As pointed out above, Figure 6 These are provided as examples only. Other examples are possible and may differ from those described herein. Figure 6 Examples described.

[0085] Figure 7 FIG700 is a diagram illustrating an example of a DL-centric subframe or wireless communication structure. The DL-centric subframe may include a control portion 702. The control portion 702 may be present at the beginning or start of the DL-centric subframe. The control portion 702 may include various scheduling information and / or control information corresponding to various portions of the DL-centric subframe. In some configurations, the control portion 702 may be a PDCCH, such as Figure 7 In some aspects, the control portion 702 may include legacy PDCCH information, shortened PDCCH (sPDCCH) information, a control format indicator (CFI) value (e.g., carried on a physical control format indicator channel (PCFICH)), one or more grants (e.g., a downlink grant, an uplink grant, etc.), etc.

[0086] The DL-centric subframe may also include a DL data portion 704. The DL data portion 704 may sometimes be referred to as the payload of the DL-centric subframe. The DL data portion 704 may include communication resources for transmitting DL data from a scheduling entity (e.g., a UE or a BS) to a dependent entity (e.g., a UE). In some configurations, the DL data portion 704 may be a physical DL shared channel (PDSCH).

[0087] The DL-centric subframe may also include a UL short burst portion 706. The UL short burst portion 706 may sometimes be referred to as a UL burst, a UL burst portion, a common UL burst, a short burst, a UL short burst, a common UL short burst, a common UL short burst portion, and / or various other appropriate terms. In some aspects, the UL short burst portion 706 may include one or more reference signals. Additionally or alternatively, the UL short burst portion 706 may include feedback information corresponding to various other portions of the DL-centric subframe. For example, the UL short burst portion 706 may include feedback information corresponding to the control portion 702 and / or the data portion 704. Non-limiting examples of information that may be included in the UL short burst portion 706 include ACK signals (e.g., physical uplink control channel (PUCCH) ACK, physical uplink shared channel (PUSCH) ACK, immediate ACK, etc.), NACK signals (e.g., PUCCH NACK, PUSCH NACK, immediate NACK, etc.), scheduling requests (SRs), buffer status reports (BSRs), hybrid automatic repeat request (HARQ) indicators, channel state indications (CSIs), CQIs, sounding reference signals (SRSs), demodulation reference signals (DMRSs), PUSCH data, and / or various other suitable types of information. The UL short burst portion 706 may include additional or alternative information, such as information related to a random access channel (RACH) procedure, scheduling requests, and various other suitable types of information.

[0088] like Figure 7 As shown, the end of the DL data portion 704 can be separated in time from the beginning of the UL short burst portion 706. This time separation may sometimes be referred to as a gap, a guard period, a guard interval, and / or various other appropriate terms. This separation provides time for switching from DL communication (e.g., receiving operations performed by a slave entity (e.g., a UE)) to UL communication (e.g., transmitting operations performed by a slave entity (e.g., a UE)). The foregoing is merely one example of a DL-centric wireless communication structure, and alternative structures with similar features may exist without necessarily departing from the aspects described herein.

[0089] As pointed out above, Figure 7It is provided as an example only. Other examples are possible and may differ from the examples described above. Figure 7 Examples described.

[0090] Figure 8 8 is a diagram illustrating an example of a UL-centric subframe or wireless communication structure. The UL-centric subframe may include a control portion 802. The control portion 802 may be present at the beginning or start of the UL-centric subframe. Figure 8 The control portion 802 in the embodiment may be similar to the control portion 802 in the embodiment Figure 7 The control portion 702 is described. The UL-centric subframe may also include a UL long burst portion 804. The UL long burst portion 804 may sometimes be referred to as the payload of the UL-centric subframe. The UL portion may refer to communication resources used to transmit UL data from a dependent entity (e.g., a UE) to a scheduling entity (e.g., a UE or a BS). In some configurations, the control portion 802 may include a PDCCH transmission.

[0091] like Figure 8 As shown, the end of the control portion 802 can be separated in time from the beginning of the UL long burst portion 804. This time separation may sometimes be referred to as a gap, a guard period, a guard interval, and / or various other appropriate terms. This separation provides time for switching from DL communication (e.g., reception by the scheduling entity) to UL communication (e.g., transmission by the scheduling entity).

[0092] The UL-centric subframe may also include a UL short burst portion 806 . Figure 8 The UL short burst portion 806 in the embodiment may be similar to that described above with reference to Figure 7 The UL short burst portion 706 described above may include the combination of Figure 7 Any of the information described. The foregoing is merely one example of a UL-centric wireless communication structure, and alternative structures having similar features may exist without necessarily departing from the aspects described herein.

[0093] In some cases, two or more slave entities (e.g., UEs) can use sidelink signals to communicate with each other. Real-world applications of such sidelink communications may include public safety, proximity services, UE-to-network relay, vehicle-to-vehicle (V2V) communications, Internet of Everything (IoE) communications, IoT communications, mission-critical meshing, and / or various other appropriate applications. Generally, a sidelink signal may refer to a signal transmitted from one slave entity (e.g., UE1) to another slave entity (e.g., UE2) without the need for relaying the communication through a scheduling entity (e.g., UE or BS), even though the scheduling entity may be used for scheduling and / or control purposes. In some aspects, a licensed spectrum may be used to transmit sidelink signals (unlike wireless local area networks that typically use unlicensed spectrum).

[0094] In one example, a wireless communication structure (e.g., a frame) may include both UL-centric subframes and DL-centric subframes. In this example, the ratio of UL-centric subframes to DL-centric subframes in a frame may be dynamically adjusted based at least in part on the amount of UL data and the amount of DL data transmitted. For example, if there is more UL data, the ratio of UL-centric subframes to DL-centric subframes may be increased. Conversely, if there is more DL data, the ratio of UL-centric subframes to DL-centric subframes may be decreased.

[0095] As pointed out above, Figure 8 It is provided as an example only. Other examples are possible and may differ from the examples described above. Figure 8 Examples described.

[0096] In an NR network, a base station sends a PDCCH (e.g., which includes control information such as downlink control information (DCI)) based on a search space set. A given search space set defines candidates that can carry a PDCCH within the search space set, where each candidate is associated with one or more groups of resource elements (referred to herein as control channel elements (CCEs)). One or more search space sets can be associated with a control resource set (CORESET). In an NR network, a base station can flexibly schedule and send PDCCHs. In other words, sending a PDCCH in an NR network is not limited to a specific set of frequency resources and / or time resources in a given subframe (as is the case, for example, in an LTE network).

[0097] The PDCCH frequency domain resources and the duration of the PDCCH are configured on a per-CORESET basis. Therefore, once a UE is configured with a CORESET, the UE has information identifying which resource blocks in the frequency domain are assigned to the search space set associated with the CORESET, as well as information identifying the number of consecutive symbols occupied by the search space set. The PDCCH position in the time domain is configured on a per-search space set basis. Here, for a given search space set associated with a CORESET, the UE is configured with: information identifying the monitoring period associated with the search space set (e.g., information indicating that the search space set should be monitored once every X (X ≥ 1) time slots), information identifying the monitoring offset (e.g., information identifying a specific time slot that the UE is to monitor every X time slots), and information identifying the monitoring mode (e.g., information identifying the first (first few) symbols of the search space set within a specific time slot). Therefore, the UE can be configured with information allowing the UE to identify the resources of the search space set in both the frequency domain and the time domain, and the base station can send the PDCCH in one or more candidates in the search space set.

[0098] In order to receive a PDCCH carried in one or more candidates of a given UE-specific search space set (i.e., a search space set that can carry control information specific to one or more specific UEs), the UE may attempt to decode the PDCCH in the candidates of the search space set. However, when transmitted by the base station, the positions of the candidates may vary between the search space sets (e.g., to avoid PDCCH collisions between adjacent cells, to avoid patterned PDCCH transmissions, etc.). Therefore, the UE identifies the position of a given candidate before attempting to decode the PDCCH.

[0099] In some cases, the UE identifies the location of a candidate in the search space set based on determining one or more control channel elements (CCEs) corresponding to one or more CCEs associated with the candidate. Here, a given CCE index is based in part on a hash value (Y p,k ), where the hash value is calculated based on a hash function using a hash value index (k). The hash function is designed to allow the UE to identify the positions of the candidates as they change across the search space set.

[0100] Typically, for a set of search spaces in CORESET p, the hash value Y p,k It is calculated based on the following function:

[0101] Y p,k =(A p ×Y p,k-1 )mod D

[0102] Where k is the hash index (sometimes called the index of the hash value), A p is an integer corresponding to CORESET p, and D is an integer. As noted, a given hash value is computed based in part on the hash value associated with the previous hash value index. Typically, an integer Y may be used. p,-1 To calculate the initial hash value (for example, Y p,0 =(A p ×Y p,-1 )modD), and other hash values can be calculated based on the updated (e.g., incremented) hash value index. Based on calculating a given hash value, the UE can determine one or more CCE indices associated with the candidate and can attempt to decode the PDCCH (e.g., using a blind decoding process).

[0103] In some cases, the UE may use the hash value to identify one or more other candidate locations until the UE updates the hash function (e.g., by incrementing a hash value index and updating the hash value based on the incremented hash value index) or restarts the hash function (e.g., to reset the hash value to an initial hash value). The UE then uses the updated hash value (when the UE updates the hash value index) or the initial hash value (when the UE restarts the hash function) to identify additional candidate locations, and so on.

[0104] However, in NR networks, due to the flexible nature of PDCCH scheduling and transmission (e.g., compared to the relatively static nature of PDCCH in LTE networks), the following are complex: the basis for the UE to identify and / or update the hash value index, the time when the UE updates the hash function, and the time when the UE restarts the hash function.

[0105] Certain aspects described herein provide techniques and apparatus for identifying a hash value index of a hash function that is associated with identifying a location where a candidate for a PDCCH may be received in an NR network. Furthermore, certain aspects described herein provide techniques and apparatus for updating a hash function and / or restarting a hash function in association with a PDCCH search in an NR network.

[0106] Figure 9 is a diagram illustrating an example 900 of identifying a hash value index of a hash function associated with identifying a location where a candidate may receive a PDCCH, and updating the hash function and / or restarting the hash function, in accordance with various aspects of the present disclosure.

[0107] As in Figure 9In and as shown by reference numeral 905, a UE (e.g., UE 120) may identify a hash value index associated with searching for a PDCCH. As described above, the hash value index may be associated with calculating a hash value, wherein a position within a search space set of candidates that may carry a PDCCH associated with the UE may be identified based at least in part on the hash value. Example techniques by which the UE may identify a hash value index based at least in part on the hash value are described in greater detail below (see Figure 9 mentioned in ).

[0108] As in Figure 9 , and further illustrated by reference numeral 910, the UE may configure a hash function associated with determining a hash value based at least in part on a hash value index. For example, based at least in part on the hash value index, the UE may configure the hash function such that the hash function may be used to calculate a hash value associated with identifying one or more candidate positions for a PDCCH associated with the UE. In other words, based at least in part on the identified hash value index, the UE may configure the hash function such that the hash function outputs a hash value that may be used to identify a candidate position for a PDCCH in a particular set of search spaces. Specific examples of configuring a hash function are described below.

[0109] In some aspects, the UE may update the hash function (e.g., such that another hash value is calculated using the hash function) based at least in part on identifying another hash value index (e.g., by incrementing the hash value index) at a particular moment, an example of which operation is described below.

[0110] In some aspects, the UE may restart the hash function (eg, such that the hash value is reset to an initial hash value) at a particular time, an example of which is described below.

[0111] In one example aspect, the UE may identify the hash value index based at least in part on an index of an interval in a plurality of intervals within a period. Here, an interval may be defined as a set of N (N≥1) consecutive symbols, and a period may be defined as a set of M (M≥1) intervals. Thus, in some aspects, a period may include N×M symbols. In this example aspect, the UE may identify the hash value index based at least in part on an index of a given interval within the period.

[0112] In this example aspect, the UE may receive information identifying a starting symbol of a first interval of a first period from a network device associated with the NR network. Additionally or alternatively, the UE may store information identifying a starting symbol of the first interval of the first period (e.g., the starting symbol may be predefined or preconfigured on the UE). Here, the first period may be an initial period that begins within or after a specific frame (e.g., system frame number 0) that is known or readily identifiable to the UE.

[0113] In addition, in this example aspect, the UE may update the hash function at each of the multiple intervals. For example, the UE may identify the hash value index as the index of a specific interval in the set of M intervals, and may configure the hash function based at least in part on the hash value index (e.g., such that the hash value is calculated for the specific interval). In this example, the UE may identify another hash value index as the index of another specific interval in the set of M intervals at another specific (e.g., the next) interval, and may update (i.e., reconfigure) the hash function based at least in part on the other hash value index (e.g., such that another hash value is calculated for another specific interval). In this example, the position of one candidate may be determined at least in part based on the hash value, and the position of another candidate may be determined at least in part based on the other hash value.

[0114] In this example aspect, the UE may restart the hash function at the next cycle. For example, at the first interval of a given cycle (e.g., after the Mth interval in the previous cycle), the UE may restart the hash function such that the hash value is reset to the initial hash value (e.g., based at least in part on Y p,-1 At the next interval of the period, the UE may identify the hash value index as the index of the next interval, may configure the hash function based at least in part on the hash value index, and may update the hash function in the manner described above.

[0115] As a specific example associated with this example aspect, an interval can be defined as a time slot (e.g., comprising 14 consecutive symbols, N=14), and a period can be defined as a frame comprising 10 time slots (M=10). Here, the UE can identify the hash value index as an index of a time slot of the frame, and can configure the hash function based at least in part on the index of the time slot. In this example, the UE can update the hash function at each of subsequent time slots of the frame (e.g., based at least in part on the index of these time slots), and can restart the hash function at a subsequent frame (i.e., at the end of the period).

[0116] As another specific example associated with this example aspect, an interval can be defined as a symbol (N=1), and a period can be defined as a frame comprising 140 symbols (M=140). Here, the UE can identify the hash value index as an index of a symbol of the frame, and can configure the hash function based at least in part on the index of the symbol of the frame. In this example, the UE can update the hash function at each symbol in subsequent symbols of the frame (e.g., based at least in part on the index of these symbols), and can restart the hash function at a subsequent frame (i.e., at the end of the period).

[0117] As another specific example associated with this example aspect, an interval can be defined as a symbol (N=1), and a period can be defined as a time slot comprising 14 symbols (M=14). Here, the UE can identify the hash value index as the index of the symbol of the time slot, and can configure the hash function based at least in part on the index of the symbol of the time slot. In this example, the UE can update the hash function at each symbol in subsequent symbols of the time slot (e.g., based at least in part on the index of these symbols), and can restart the hash function at a subsequent time slot (i.e., at the end of the period).

[0118] In another example aspect, a UE may identify a hash value index based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with a search space set index within a period. Here, the search space set index may be associated with a search space set associated with a CORESET. The search space set opportunity is defined by a number of consecutive symbols configured by a search space set start symbol bitmap and a number of consecutive symbols corresponding to a duration of the CORESET.

[0119] In this example aspect, a period may be defined as a set of N consecutive symbols. In some aspects, the UE may receive information identifying N from a network device associated with the NR network. Additionally or alternatively, the UE may store information identifying N (e.g., N may be predefined or preconfigured on the UE).

[0120] Furthermore, in this example aspect, the UE may receive information identifying a starting symbol of a first period from a network device associated with the NR network. Additionally or alternatively, the UE may store information identifying a starting symbol of a first interval of the first period (e.g., the starting symbol may be predefined or preconfigured on the UE). Here, the first period may be an initial period that begins within or after a specific frame (e.g., system frame number 0) that is known or readily identifiable to the UE.

[0121] In addition, in this example aspect, the UE may update the hash function at each search space set opportunity in a plurality of search space set opportunities associated with the search space set index. For example, the UE may identify the hash value index as an index of a specific search space set opportunity (i.e., one search space set opportunity in a plurality of search space set opportunities associated with the search space set index), and may configure the hash function based at least in part on the hash value index (e.g., such that the hash value is calculated for the specific search space set opportunity). In this example, the UE may identify another hash value index as an index of another specific (e.g., next) search space set opportunity in a plurality of search space set opportunities associated with the search space set index. The UE may then update (i.e., reconfigure) the hash function based at least in part on the other hash value index (e.g., such that the other hash value is calculated for the other specific search space set opportunity). In this example, the position of one candidate may be determined at least in part based on the hash value, and the position of another candidate may be determined at least in part based on the other hash value.

[0122] In this example aspect, the UE may restart the hash function at the next period. For example, at a first search space set opportunity among a plurality of search space set opportunities associated with the search space set index within the period, the UE may restart the hash function such that the hash value is reset to an initial hash value (e.g., based at least in part on Y p,-1 At the next search space set opportunity of the period, the UE may identify the hash value index as the index of the next search space set opportunity, may configure the hash function based at least in part on the hash value index, and may update the hash function in the manner described above.

[0123] Furthermore, in this example aspect, the UE may determine an alternative index for the hash value based at least in part on information identifying a maximum number of hash values (e.g., pre-configured on the UE, configured by the base station, etc.) In such a case, the UE may update or restart the hash function based at least in part on the alternative index for the hash value.

[0124] In this example aspect, two or more search space set opportunities in the plurality of search space set opportunities may be associated with the same search space set index and may start from the same symbol in the cycle. In such a case, the UE may identify the same hash value index for each of the at least two search space set opportunities.

[0125] In addition, in this example aspect, two or more search space set opportunities among the multiple search space set opportunities can be associated with different search space set indices associated with the same control resource set index and can start from the same symbol in the cycle. In such a case, the UE can identify the hash value index by selecting one of at least two indices corresponding to the two or more search space set opportunities. For example, the UE can select the hash value index based at least in part on a search space set index associated with one of the two or more search space set opportunities (e.g., a minimum search space set index), based at least in part on an index value associated with one of the at least two search space set opportunities (e.g., a maximum index value), and the like.

[0126] In another example aspect, the UE may identify a hash value index based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with a plurality of search space set indexes within a period. Here, the plurality of search space set indexes may be associated with a CORESET index of a CORESET associated with the plurality of search space sets.

[0127] In this example aspect, a period may be defined as a set of N consecutive symbols. In some aspects, the UE may receive information identifying N from a network device associated with the NR network. Additionally or alternatively, the UE may store information identifying N (e.g., N may be predefined or preconfigured on the UE).

[0128] Furthermore, in this example aspect, the UE may receive information identifying a starting symbol of a first period from a network device associated with the NR network. Additionally or alternatively, the UE may store information identifying a starting symbol of a first interval of the first period (e.g., the starting symbol may be predefined or preconfigured on the UE). Here, the first period may be an initial period that begins within or after a specific frame (e.g., system frame number 0) that is known or readily identifiable to the UE.

[0129] In this example aspect, the UE may update a hash function at each of a plurality of search space set occasions associated with a plurality of search space set indexes. For example, the UE may identify a hash value index as an index of a particular search space set occasion (i.e., one of a plurality of search space set occasions associated with a plurality of search space set indexes), and may configure a hash function based at least in part on the hash value index (e.g., such that the hash value is calculated for the particular search space set occasion). In this example, the UE may identify another hash value index as an index of another search space set occasion at another particular (e.g., next) search space set occasion among a plurality of search space set indexes associated with a plurality of search space set indexes. The UE may then update (i.e., reconfigure) the hash function based at least in part on the other hash value index (e.g., such that the other hash value is calculated for the other particular search space set occasion). In this example, the position of one candidate may be determined at least in part based on the hash value, and the position of another candidate may be determined at least in part based on the other hash value.

[0130] Furthermore, in this example aspect, the UE may restart the hash function at the next period. For example, at a first search space set opportunity among a plurality of search space set occasions associated with a plurality of search space set indices within the period, the UE may restart the hash function such that the hash value is reset to an initial hash value (e.g., based at least in part on Y p,-1 At the next search space set opportunity of the period, the UE may identify the hash value index as the index of the next search space set opportunity, may configure the hash function based at least in part on the hash value index, and may update the hash function in the manner described above.

[0131] Furthermore, in this example aspect, the UE may determine an alternative index for the hash value based at least in part on information identifying a maximum number of hash values (e.g., pre-configured on the UE, configured by the base station, etc.). In such a case, the UE may update or restart the hash function based at least in part on the alternative index for the hash value.

[0132] In this example aspect, two or more search space set opportunities in the plurality of search space set opportunities may be associated with a CORESET and may start from the same symbol in the cycle. In this case, the UE may identify the same hash value index for each of the at least two search space set opportunities.

[0133] As a specific example associated with this example aspect, a period may be defined as a frame comprising 140 symbols (e.g., N=140). Here, the UE may identify the hash value index as an index of a search space set opportunity in a plurality of search space set opportunities associated with a plurality of search space set indices within a frame. The plurality of search space set indices are associated with a CORESET index. Here, the UE may configure a hash function based at least in part on the index of the search space set opportunity. In this example, the UE may update the hash function at each subsequent search space set opportunity in a plurality of search space set opportunities associated with the plurality of search space set indices within a frame, and may restart the hash function at a first search space set opportunity in a plurality of search space set opportunities associated with the plurality of search space set indices within a subsequent frame.

[0134] As another specific example associated with this example aspect, a period may be defined as a time slot (e.g., 14 symbols, N=14). Here, the UE may identify the hash value index as an index of a search space set opportunity in a plurality of search space set opportunities associated with a plurality of search space set indices within a time slot. The plurality of search space set indices are associated with a CORESET index. Here, the UE may configure a hash function based at least in part on the index of the search space set opportunity. In this example, the UE may update the hash function at each subsequent search space set opportunity in a plurality of search space set opportunities associated with the plurality of search space set indices within a time slot, and may restart the hash function at a first search space set opportunity in a plurality of search space set opportunities associated with the plurality of search space set indices within a subsequent time slot.

[0135] As pointed out above, Figure 9 are provided as examples. Other examples are possible and may differ from the examples provided herein. Figure 9 Examples described.

[0136] Figure 10 1 is a diagram illustrating an example process 1000 performed, for example, by a UE, in accordance with various aspects of the present disclosure. In one example, process 1000 illustrates a method for wireless communication performed by a UE. Example process 1000 is an example in which a UE (e.g., UE 120) identifies a hash value index of a hash function associated with identifying a candidate location in which a PDCCH may be received in an NR network.

[0137] like Figure 10As shown in , in some aspects, process 1000 may include: identifying an index of a hash value associated with searching for a PDCCH, wherein the index of the hash value is identified based at least in part on one of: an index of an interval in a plurality of intervals within a cycle, an index of a search space set opportunity in a plurality of search space set opportunities associated with a search space set index within the cycle, and an index of a search space set opportunity in a plurality of search space set opportunities associated with a plurality of search space set indexes within the cycle, wherein the plurality of search space set indexes are associated with a control resource set index (block 1010). For example, the UE (e.g., using the receive processor 258, the controller / processor 280, etc.) may identify the index of the hash value associated with searching for the PDCCH in the manner described above.

[0138] like Figure 10 As shown in , in some aspects, process 1000 may include configuring a hash function associated with determining a hash value based at least in part on an index of the hash value (block 1020). For example, the UE (e.g., using receive processor 258, controller / processor 280, etc.) may configure a hash function associated with determining a hash value based at least in part on an index of the hash value, as described above.

[0139] Process 1000 may include additional aspects, such as any single aspect or any combination of the aspects described below.

[0140] In some aspects, when the index of the hash value is identified at least in part based on the index of the interval, the hash function is updated at another interval in the plurality of intervals. Here, the hash function is updated based at least in part on the updated index of the hash value, the updated index being identified at least in part based on the index of the other interval. In some aspects, an interval can be defined as a set of N (N≥1) consecutive symbols.

[0141] In some aspects, when the index of the hash value is identified based at least in part on the index of the interval, the hash function is restarted at the first interval of the next cycle.

[0142] In some aspects, when the index of the hash value is identified based at least in part on the index of the interval, the period includes M (M > 1) intervals.

[0143] In some aspects, when the index of the hash value is identified based at least in part on the index of the interval, each interval of the plurality of intervals includes N (N > 1) consecutive symbols.

[0144] In some aspects, when the index of the hash value is identified based at least in part on the index of the interval, information identifying a starting symbol of a first interval of a first period is received from a network device or stored by a UE. In some aspects, the first period is an initial period that begins in or after system frame number 0.

[0145] In some aspects, a given search space set opportunity is defined by a number of consecutive symbols configured by a starting symbol identified by a bitmap and a number of consecutive symbols corresponding to a duration of a set of control resources.

[0146] In some aspects, when an index of a hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with the search space set index, the hash function is updated at another search space set opportunity in the plurality of search space set opportunities associated with the search space set index. Here, the hash function is updated based at least in part on the updated index of the hash value, the updated index being identified based at least in part on the index of the another search space set opportunity.

[0147] In some aspects, when the index of the hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with the search space set index, the hash function is restarted at a first search space set opportunity in the plurality of search space set opportunities in a next cycle.

[0148] In some aspects, when the index of the hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with the search space set index, the period includes N (N≥1) consecutive symbols. In some aspects, information identifying N is received from a network device or stored by the UE.

[0149] In some aspects, when the index of the hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with the search space set index, information identifying a starting symbol of a first period is received from a network device or stored by the UE. In some aspects, the first period is an initial period that begins in or after system frame number 0.

[0150] In some aspects, when an index of a hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with a search space set index, and when at least two search space set opportunities in the plurality of search space set opportunities are associated with the same search space set index and start from the same symbol in a cycle, the same index of the hash value is identified for each of the at least two search space set opportunities.

[0151] In some aspects, when an index of a hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with a search space set index, and when at least two of the plurality of search space set opportunities are associated with different search space set indices associated with the same control channel set index and start from the same symbol in a cycle, the index of the hash value is identified based at least in part on selecting one of the at least two indices corresponding to the at least two search space set opportunities. In some aspects, the index of the hash value is selected based at least in part on the search space set index associated with one of the at least two search space set opportunities. In some aspects, the index of the hash value is selected based at least in part on an index value associated with one of the at least two search space set opportunities.

[0152] In some aspects, when an index of a hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with the search space set index, an alternate index of the hash value is determined based at least in part on information identifying a maximum number of hash values. Here, the hash function is updated or restarted based at least in part on the alternate index of the hash value.

[0153] In some aspects, when an index of a hash value is identified based at least in part on an index of a search space set opportunity among a plurality of search space set opportunities associated with a plurality of search space set indexes (the plurality of search space set indexes being associated with a control channel index), the hash function is updated at another search space set opportunity among the plurality of search space set opportunities associated with the plurality of search space set indexes. Here, the hash function is updated based at least in part on the updated index of the hash value, the updated index being identified based at least in part on the index of the another search space set opportunity.

[0154] In some aspects, when the index of the hash value is identified based at least in part on an index of a search space set occasion among multiple search space set occasions associated with multiple search space set indices (the multiple search space set indices are associated with a control channel index), the hash function is restarted at the first search space set occasion among the multiple search space set occasions associated with the multiple search space set indices in the next period.

[0155] In some aspects, when the index of the hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with a plurality of search space set indices associated with a control channel index, the period includes N (N≥1) consecutive symbols. In some aspects, information identifying N is received from a network device or stored by the UE.

[0156] In some aspects, when the index of the hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities associated with a plurality of search space set indices associated with a control channel index, information identifying a starting symbol of a first period is received from a network device or stored by a UE. In some aspects, the first period is an initial period that begins in or after system frame number 0.

[0157] In some aspects, when the index of the hash value is identified based at least in part on an index of a search space set occasion in a plurality of search space set occasions associated with a plurality of search space set indices (the plurality of search space set indices being associated with a control channel index), and when at least two of the plurality of search space set occasions are associated with the same set of control resources and start from the same symbol in a cycle, the same index of the hash value is identified for each of the at least two search space set occasions.

[0158] In some aspects, when an index of a hash value is identified based at least in part on an index of a search space set opportunity among a plurality of search space set opportunities associated with a plurality of search space set indices associated with a control channel index, an alternate index of the hash value is determined based at least in part on information identifying a maximum number of hash values. Here, the hash function is updated or restarted based at least in part on the alternate index of the hash value.

[0159] Although Figure 10 Example blocks of process 1000 are shown, but in some aspects, process 1000 may include Figure 10The blocks depicted in the process 1000 may be additional blocks, fewer blocks, different blocks, or blocks arranged in a different manner than those depicted in the process 1000. Additionally or alternatively, two or more blocks of the blocks of process 1000 may be executed in parallel.

[0160] In implementations where simplicity and / or compatibility with legacy systems (eg, LTE systems) is desired or preferred, a hash value index may be identified using an index based at least in part on an interval of a plurality of intervals within a period. Figure 11 1 is a diagram illustrating an example process 1100 performed, for example, by a UE, wherein the UE (e.g., UE 120) identifies a hash value index for a hash function based at least in part on an index of an interval in a plurality of intervals within a period, the hash value index associated with identifying a position at which a candidate for a PDCCH may be received. In some examples, the hash function, the hash value index, and the intervals in the plurality of intervals within a period may be as described elsewhere in this disclosure (e.g., with reference to FIG. Figure 8 、 Figure 9 and Figure 10 ) are similar to those described above. In one example, process 1100 illustrates a method for wireless communication performed by a UE.

[0161] like Figure 11 As shown in , in some aspects, process 1100 may include identifying an index of a hash value associated with searching for a PDCCH based at least in part on an index of an interval in a plurality of intervals within a period (block 1110). For example, the UE (e.g., using receive processor 258, controller / processor 280, etc.) identifies an index of a hash value associated with searching for a PDCCH based at least in part on an index of an interval in a plurality of intervals within a period, as described above, for example, with reference to Figure 10 Block 1010 is described in some aspects.

[0162] like Figure 11 As shown in , in some aspects, process 1100 may include configuring a hash function associated with determining a hash value based at least in part on an index of the hash value (block 1120). For example, the UE (e.g., using receive processor 258, controller / processor 280, etc.) may configure a hash function associated with determining a hash value based at least in part on an index of the hash value, as described above, for example, with reference to Figure 10 Block 1020 is described in some aspects.

[0163] Process 1100 may include additional aspects, such as any single aspect or any combination of the aspects described below.

[0164] In some aspects, the hash function is updated at another interval in the plurality of intervals. Here, the hash function is updated based at least in part on an updated index of the hash value, the updated index being identified based at least in part on an index of the other interval. In some aspects, an interval can be defined as a set of N (N≥1) consecutive symbols.

[0165] In some aspects, the hash function is restarted at the first interval of the next cycle.

[0166] In some aspects, a period includes M (M > 1) intervals.

[0167] In some aspects, each interval of the plurality of intervals includes N (N > 1) consecutive symbols.

[0168] In some aspects, information identifying a starting symbol of a first interval of a first period is received from a network device or stored by a UE.In some aspects, the first period is an initial period that begins in or after system frame number 0.

[0169] In some aspects, a given search space set opportunity is defined by a number of consecutive symbols configured by a starting symbol identified by a bitmap and a number of consecutive symbols corresponding to a duration of a set of control resources.

[0170] Although Figure 11 Example blocks of process 1100 are shown, but in some aspects, process 1100 may include Figure 11 The blocks depicted in the process 1100 may be additional blocks, fewer blocks, different blocks, or blocks arranged in a different manner than those depicted in the process 1100. Additionally or alternatively, two or more blocks of the blocks in the process 1100 may be executed in parallel.

[0171] The foregoing disclosure provides illustration and description, but is not intended to be exhaustive or to limit the aspects to the precise forms disclosed. Modifications and variations are possible in light of the above disclosure or may be acquired from practice of the aspects.

[0172] As used herein, the term component is intended to be broadly interpreted as hardware, firmware, or a combination of hardware and software.As used herein, a processor is implemented in hardware, firmware, or a combination of hardware and software.

[0173] Some aspects are described herein in conjunction with thresholds. As used herein, satisfying a threshold may refer to a value being greater than a threshold, greater than or equal to a threshold, less than a threshold, less than or equal to a threshold, equal to a threshold, not equal to a threshold, etc.

[0174] It will be apparent that the systems and / or methods described herein can be implemented using various forms of hardware, firmware, or a combination of hardware and software. The actual specialized control hardware or software code used to implement these systems and / or methods is not limiting in any way. Thus, the operation and behavior of the systems and / or methods are described herein without reference to specific software code, with the understanding that software and hardware can be designed to implement the systems and / or methods based, at least in part, on the description herein.

[0175] Even if a specific combination of features is recorded in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of possible aspects. In fact, many of these features can be combined in a manner not specifically recorded in the claims and / or specifically disclosed in the specification. Although each dependent claim listed below can only directly depend on one claim, the disclosure of possible aspects includes the combination of each dependent claim and each other claim in the claim set. The phrase "at least one of" the list of items refers to any combination of those items, including single members. For example, "at least one of a, b or c" is intended to cover a, b, c, ab, ac, bc and abc, and any combination of multiples of the same element (for example, aa, aaa, aab, aac, abb, acc, bb, bbb, bbc, cc and ccc or any other sorting of a, b and c).

[0176] None of the elements, actions or instructions used herein should be interpreted as key or necessary, unless clearly described as such. In addition, as used herein, the articles "a" and "an" are intended to include one or more projects and can be used interchangeably with "one or more". In addition, as used herein, the terms "set" and "group" are intended to include one or more projects (e.g., related projects, unrelated projects, combinations of related projects and unrelated projects, etc.), and can be used interchangeably with "one or more". In the case of only one project being expected, the term "one" or similar language is used. In addition, as used herein, the terms "has", "have", "having" and / or similar terms are intended to be open terms. In addition, unless otherwise expressly stated, the phrase "based on" is intended to mean "at least partially based on".

Claims

1. A method for wireless communication performed by a user equipment (UE), comprising: identifying an index of a hash value associated with searching for a physical downlink control channel (PDCCH) based at least in part on an index of an interval in a plurality of intervals in a period, wherein the index of the hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities in the period; and configuring a hash function associated with determining the hash value based at least in part on the index of the hash value, the hash value being usable to identify a candidate position for a PDCCH in a particular search space set, The information identifying the starting symbol of the first interval of the first cycle is received from a network device or stored by the UE.

2. The method according to claim 1, wherein The hash function is updated at each search space set occasion of the plurality of search space set occasions.

3. The method according to claim 2, wherein: The multiple search space set opportunities are associated with the same search space set index.

4. The method according to claim 2, wherein: The search space set occasion is defined by a certain number of consecutive symbols, which is configured by: a starting symbol identified by a bitmap, and a number of consecutive symbols corresponding to a duration of a control resource set.

5. The method according to claim 1, wherein The hash function is updated at another interval of the plurality of intervals based at least in part on an updated index of the hash value, the updated index being identified based at least in part on an index of the another interval.

6. The method according to claim 1, wherein The hash function is restarted at a first interval of a next period, wherein the period comprises a frame.

7. The method according to claim 1, wherein The cycle includes M intervals, where M≥1.

8. The method according to claim 1, wherein Each interval of the plurality of intervals includes N consecutive symbols, where N≧1.

9. The method according to claim 1, wherein The first period is an initial period that starts in or after system frame number 0.

10. A user equipment (UE) for wireless communication, comprising: Memory; as well as One or more processors coupled to the memory, configured to: identifying an index of a hash value associated with searching for a physical downlink control channel (PDCCH) based at least in part on an index of an interval in a plurality of intervals in a period, wherein the index of the hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities in the period; and configuring a hash function associated with determining the hash value based at least in part on the index of the hash value, the hash value being usable to identify a candidate position for a PDCCH in a particular search space set, The information identifying the starting symbol of the first interval of the first cycle is received from a network device or stored by the UE.

11. The UE according to claim 10, wherein: The one or more processors are further configured to update the hash function at each search space set occasion of the plurality of search space set occasions.

12. The UE according to claim 11, wherein: The multiple search space set opportunities are associated with the same search space set index.

13. The UE according to claim 11, wherein: The search space set occasion is defined by a certain number of consecutive symbols, which is configured by: a starting symbol identified by a bitmap, and a number of consecutive symbols corresponding to a duration of a control resource set.

14. The UE according to claim 10, wherein: The one or more processors are further configured to update the hash function at another interval of the plurality of intervals based at least in part on an updated index of the hash value, the updated index identified based at least in part on an index of the another interval.

15. The UE according to claim 10, wherein: The one or more processors are further configured to restart the hash function at a first interval of a next cycle, wherein the cycle includes a frame.

16. The UE according to claim 10, wherein: The first period is an initial period that starts in or after system frame number 0.

17. A non-transitory computer-readable medium storing one or more instructions for wireless communication, the one or more instructions comprising: One or more instructions that, when executed by one or more processors of a user equipment (UE), cause the one or more processors to perform the following operations: identifying an index of a hash value associated with searching for a physical downlink control channel (PDCCH) based at least in part on an index of an interval in a plurality of intervals in a period, wherein the index of the hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities in the period; and configuring a hash function associated with determining the hash value based at least in part on the index of the hash value, the hash value being usable to identify a candidate position for a PDCCH in a particular search space set, The information identifying the starting symbol of the first interval of the first cycle is received from a network device or stored by the UE.

18. The non-transitory computer-readable medium of claim 17, wherein: The one or more instructions further cause the one or more processors to update the hash function at each search space set opportunity of the plurality of search space set opportunities.

19. The non-transitory computer-readable medium of claim 18, wherein: The multiple search space set opportunities are associated with the same search space set index.

20. The non-transitory computer-readable medium of claim 18, wherein: The search space set occasion is defined by a certain number of consecutive symbols, which is configured by: a starting symbol identified by a bitmap, and a number of consecutive symbols corresponding to a duration of a control resource set.

21. The non-transitory computer-readable medium of claim 17, wherein: The one or more instructions further cause the one or more processors to update the hash function at another interval of the plurality of intervals based at least in part on an updated index of the hash value, the updated index being identified based at least in part on an index of the another interval.

22. The non-transitory computer-readable medium of claim 17, wherein: The one or more instructions further cause the one or more processors to restart the hash function at a first interval of a next cycle, wherein the cycle includes a frame.

23. The non-transitory computer-readable medium of claim 17, wherein: The first period is an initial period that starts in or after system frame number 0.

24. An apparatus for wireless communication, comprising: means for identifying an index of a hash value associated with searching for a physical downlink control channel (PDCCH) based at least in part on an index of an interval in a plurality of intervals in a period, wherein the index of the hash value is identified based at least in part on an index of a search space set opportunity in a plurality of search space set opportunities in the period; and means for configuring a hash function associated with determining the hash value based at least in part on the index of the hash value, the hash value being usable to identify a candidate position for a PDCCH in a particular search space set, The information identifying the starting symbol of the first interval of the first cycle is received from a network device or stored by the apparatus.

25. The apparatus of claim 24, further comprising means for updating the hash function at each of the plurality of search space set occasions.

26. The device according to claim 25, wherein The multiple search space set opportunities are associated with the same search space set index.

27. The apparatus according to claim 25, wherein The search space set occasion is defined by a certain number of consecutive symbols, which is configured by: a starting symbol identified by a bitmap, and a number of consecutive symbols corresponding to a duration of a control resource set.

28. The apparatus of claim 24, further comprising: Means for updating the hash function at another interval of the plurality of intervals based at least in part on an updated index of the hash value, the updated index identified based at least in part on an index of the another interval.

29. The apparatus of claim 24, further comprising means for restarting the hash function at a first interval of a next cycle, wherein the cycle comprises a frame.

30. The apparatus of claim 24, wherein: The first period is an initial period that starts in or after system frame number 0.

Images