Complexity processing for repetition of physical downlink control channels - Patents.com
Patent Information
- Application Number
- JP2024506234
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2022-08-03
- Filing Date
- 2022-08-04
- Publication Date
- 2025-07-28
AI Technical Summary
Existing wireless communication systems face challenges in managing complexity associated with physical downlink control channel (PDCCH) repetitions, leading to increased memory resource consumption, decreased communication speed, and potential decoding errors due to excessive UE complexity and memory requirements.
Implementing a mechanism where user equipment (UE) transmits an indication of its PDCCH processing unit (PPU) limit to the network node, allowing the configuration of linked search space sets for PDCCH candidates based on the UE's capabilities, thereby optimizing PDCCH repetition to avoid exceeding memory limits and ensuring reliable communication.
This approach reduces memory resource consumption, enhances communication reliability, and decreases latency by ensuring that PDCCH repetitions are managed within the UE's processing capabilities, thereby improving overall communication efficiency.
Smart Images

Figure 00000000_0000_ABST
Abstract
Description
[Technical field]
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This patent application claims priority to U.S. Provisional Patent Application No. 63 / 203,962, filed August 5, 2021, entitled "COMPLEXITY HANDLING FOR PHYSICAL DOWNLINK CONTROL CHANNEL REPETITION," and U.S. Non-Provisional Patent Application No. 17 / 817,230, filed August 3, 2022, entitled "COMPLEXITY HANDLING FOR PHYSICAL DOWNLINK CONTROL CHANNEL REPETITION," which are expressly incorporated herein by reference.
[0002] Aspects of the present disclosure relate generally to wireless communications and techniques and apparatus for complexity processing for Physical Downlink Control Channel (PDCCH) repetitions. [Background technology]
[0003] Wireless communication systems have been widely deployed to provide various telecommunication services such as telephone, video, data, messaging, and broadcast. A typical wireless communication system may utilize multiple access technologies capable of supporting 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 improvements to the Universal Mobile Telecommunications System (UMTS) mobile standard promulgated by the 3rd Generation Partnership Project (3GPP®).
[0004] A wireless network may include one or more base stations that support communication for user equipment (UE) or more UEs. The UE may communicate with the base stations via downlink and uplink communications. "Downlink" (or "DL") refers to the communication link from the base station to the UE, and "uplink" (or "UL") refers to the communication link from the UE to the base station.
[0005] The above multiple access technologies have been adopted in various telecommunication standards to provide a common protocol that allows different UEs to communicate on a city, national, regional, and / or global scale. New Radio (NR), sometimes referred to as 5G, is a set of enhancements to the LTE mobile standard promulgated by 3GPP. NR is designed to better support mobile broadband Internet access by improving spectral efficiency, lowering costs, improving services, utilizing new spectrum, and using Orthogonal Frequency Division Multiplexing (OFDM) with Cyclic Prefix (CP) (CP-OFDM) on the downlink and CP-OFDM and / or Single Carrier Frequency Division Multiplexing (SC-FDM) (also known as Discrete Fourier Transform Spread OFDM (DFT-s-OFDM)) on the uplink, as well as better integrating with other open standards that support beamforming, multiple-input multiple-output (MIMO) antenna technology, and carrier aggregation. As the demand for mobile broadband access continues to grow, further improvements in LTE, NR, and other radio access technologies remain useful. Summary of the Invention
[0006] Certain aspects described herein relate to a user equipment (UE) for wireless communication. The UE may include a memory and one or more processors coupled to the memory. The one or more processors may be configured to transmit an indication of a physical downlink control channel (PDCCH) processing unit (PPU) limitation associated with the UE to a network node. The one or more processors may be configured to receive a configuration of a plurality of search space search space sets for PDCCH candidates from the network node, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, and the configuration of the one or more pairs of linked search space sets is based at least in part on a PPU limitation associated with the UE.
[0007] Certain aspects described herein relate to a network node for wireless communication. The network node may include a memory and one or more processors coupled to the memory. The one or more processors may be configured to receive an indication of a PPU restriction associated with the UE from the UE. The one or more processors may be configured to transmit to the UE a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for a PDCCH repetition, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU restriction associated with the UE.
[0008] Certain aspects described herein relate to a method of wireless communication implemented by a UE, the method can include transmitting an indication of a PPU limitation associated with the UE to a network node. The method can include receiving from the network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for a PDCCH repetition, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU limitation associated with the UE.
[0009] Certain aspects described herein relate to a method of wireless communication performed by a network node, the method can include receiving an indication of a PPU limitation associated with the UE from the UE. The method can include transmitting a configuration of a plurality of search space sets for PDCCH candidates to the UE, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU limitation associated with the UE.
[0010] Certain aspects described herein relate to a non-transitory computer-readable medium storing a set of instructions for wireless communication by a UE. The set of instructions, when executed by one or more processors of the UE, can cause the UE to transmit an indication of a PPU limitation associated with the UE to a network node. The set of instructions, when executed by the one or more processors of the UE, can cause the UE to receive from the network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU limitation associated with the UE.
[0011] Certain aspects described herein relate to a non-transitory computer-readable medium storing a set of instructions for wireless communication by a network node. The set of instructions, when executed by one or more processors of the network node, can cause the network node to receive from the UE an indication of a PPU restriction associated with the UE. The set of instructions, when executed by the one or more processors of the network node, can cause the network node to transmit to the UE a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU restriction associated with the UE.
[0012] Certain aspects described herein relate to an apparatus for wireless communication. The apparatus can include means for transmitting an indication of a PPU restriction to a network node. The apparatus can include means for receiving from the network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for a PDCCH repetition, and the configuration of the one or more pairs of linked search space sets is based at least in part on a PPU restriction.
[0013] Certain aspects described herein relate to an apparatus for wireless communication. The apparatus can include means for receiving an indication of a PPU restriction associated with the UE from a UE. The apparatus can include means for transmitting a configuration of a plurality of search space sets for PDCCH candidates to the UE, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU restriction associated with the UE.
[0014] Aspects generally include methods, apparatus, systems, computer program products, non-transitory computer-readable media, user equipment, base stations, network nodes, devices for wireless communications, and / or processing systems as fully described herein with reference to and as illustrated in the drawings and this specification.
[0015] The foregoing has outlined rather broadly the features and technical advantages of the embodiments according to the present disclosure in order that the following Detailed Description may be better understood. Additional features and advantages are described hereinafter. The concept and specific examples disclosed may be readily utilized as a basis for modifying or designing other structures for carrying out the same purposes of the present disclosure. Such equivalent constructions do not depart from the scope of the appended claims. The nature of the concepts disclosed herein, both their organization and method of operation, together with associated advantages, will be better understood from the following description when considered in conjunction with the accompanying figures. Each of the figures is provided for the purpose of illustration and description, and not as a definition of the limits of the claims.
[0016] Although aspects are described in this disclosure by illustrating some examples, those skilled in the art will understand that such aspects can be implemented in many different configurations and scenarios. The techniques described herein can be implemented using different platform types, devices, systems, shapes, sizes, and / or packaging configurations. For example, some aspects can be implemented via integrated chip embodiments or other non-modular component-based devices (e.g., end-user devices, vehicles, communication devices, computing devices, industrial equipment, retail / purchasing devices, medical devices, and / or artificial intelligence-enabled devices). Aspects can be implemented in chip-level components, modular components, non-modular components, non-chip-level components, device-level components, and / or system-level components. Devices incorporating the described aspects and features may include additional components and features for the implementation and practice of the claimed and described aspects. For example, the transmission and reception of wireless signals may include one or more components for analog and digital applications (e.g., hardware components including antennas, radio frequency (RF) chains, power amplifiers, modulators, buffers, processors, interleavers, adders, and / or summers). It is contemplated that aspects described herein may be practiced in a wide variety of devices, components, systems, distributed configurations, and / or end-user devices of various sizes, shapes, and configurations. [Brief description of the drawings]
[0017] So that the above-listed features of the present disclosure may be understood in detail, a more detailed description may be had by referring to embodiments, some of which are shown in the accompanying drawings. However, it should be noted that the accompanying drawings show only some typical embodiments of the present disclosure and therefore should not be considered as limiting its scope, since the present description may admit of other equally effective embodiments. The same reference numbers in different drawings may identify the same or similar elements. [Figure 1]FIG. 1 illustrates an example of a wireless network in accordance with the present disclosure. [Diagram 2] FIG. 1 illustrates an example of a base station communicating with user equipment (UE) in a wireless network in accordance with the present disclosure. [Diagram 3] FIG. 1 illustrates an example resource structure for wireless communication in accordance with the present disclosure. [Figure 4A] FIG. 1 illustrates an example of a linked search space (SS) set for physical downlink control channel (PDCCH) repetition in accordance with the present disclosure. [Figure 4B] FIG. 1 illustrates an example of a linked search space (SS) set for physical downlink control channel (PDCCH) repetition in accordance with the present disclosure. [Figure 4C] FIG. 1 illustrates an example of a linked search space (SS) set for physical downlink control channel (PDCCH) repetition in accordance with the present disclosure. [Figure 4D] FIG. 1 illustrates an example of a linked search space (SS) set for physical downlink control channel (PDCCH) repetition in accordance with the present disclosure. [Diagram 5] FIG. 1 illustrates an example associated with complexity processing for PDCCH repetition in accordance with the present disclosure. [Figure 6] FIG. 1 illustrates an example associated with complexity processing for PDCCH repetition in accordance with the present disclosure. [Figure 7] FIG. 1 illustrates an example associated with complexity processing for PDCCH repetition in accordance with the present disclosure. [Figure 8] FIG. 1 illustrates an example associated with complexity processing for PDCCH repetition in accordance with the present disclosure. [Figure 9A] FIG. 1 illustrates an example associated with complexity processing for PDCCH repetition in accordance with the present disclosure. [Figure 9B] FIG. 1 illustrates an example associated with complexity processing for PDCCH repetition in accordance with the present disclosure. [Figure 10]FIG. 1 illustrates an example process associated with complexity handling for PDCCH repetitions in accordance with the present disclosure. [Figure 11] FIG. 1 illustrates an example process associated with complexity handling for PDCCH repetitions in accordance with the present disclosure. [Figure 12] FIG. 1 illustrates an example process associated with complexity handling for PDCCH repetitions in accordance with the present disclosure. [Figure 13] FIG. 1 illustrates an example process associated with complexity handling for PDCCH repetitions in accordance with the present disclosure. [Figure 14] FIG. 1 illustrates an example process associated with complexity handling for PDCCH repetitions in accordance with the present disclosure. [Figure 15] FIG. 1 illustrates an example process associated with complexity handling for PDCCH repetitions in accordance with the present disclosure. [Figure 16] FIG. 1 is a diagram of an example apparatus for wireless communication in accordance with the present disclosure. [Figure 17] FIG. 1 is a diagram of an example apparatus for wireless communication in accordance with the present disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0018] Various aspects of the present disclosure are described more fully below with reference to the accompanying drawings. However, the present disclosure may be embodied in many different forms and should not be construed as limited to any specific structure or function presented throughout the present disclosure. Rather, these aspects are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art. Those skilled in the art should understand that the scope of the present disclosure encompasses any aspect of the present disclosure disclosed herein, whether implemented independently of or in combination with any other aspect of the present disclosure. For example, an apparatus may be implemented or a method may be practiced using any number of the aspects described herein. In addition, the scope of the present disclosure is intended to encompass such an apparatus or method that is practiced using other structure, functionality, or structure and functionality in addition to or other than the various aspects of the disclosure described herein. It should be understood that any aspect of the disclosure disclosed herein may be embodied by one or more elements of a claim.
[0019] Several aspects of a telecommunications system are now presented with reference to various apparatus and techniques that are described in the detailed description that follows and illustrated in the accompanying drawings by various blocks, modules, components, circuits, steps, processes, algorithms, etc. (collectively referred to as "elements"). These elements may be implemented using hardware, software, or a combination thereof. Whether such elements are implemented as hardware or software depends on the particular application and design constraints imposed on the overall system.
[0020] Although aspects may be described herein using terminology commonly associated with 5G or New Radio (NR) radio access technologies (RATs), aspects of the disclosure may apply to other RATs, such as 3G RATs, 4G RATs, and / or post-5G (e.g., 6G) RATs.
[0021] FIG. 1 illustrates an example of a wireless network 100 in accordance with the present disclosure. The wireless network 100 may be or include elements of a 5G (e.g., NR) network and / or a 4G (e.g., Long Term Evolution (LTE)) network, among other examples. The wireless network 100 may include one or more base stations 110 (shown as BS 110a, BS 110b, BS 110c, and BS 110d), user equipment (UE) 120 or more UEs 120 (shown as UE 120a, UE 120b, UE 120c, UE 120d, and UE 120e), and / or other network entities. The base stations 110 are entities that communicate with the UEs 120. The base stations 110 (sometimes referred to as BSs) may include, for example, NR base stations, LTE base stations, Node Bs, eNBs (e.g., in 4G), gNBs (e.g., in 5G), access points, and / or transmit / receive points (TRPs). Each base station 110 may provide communication coverage for a particular geographic area. In 3rd Generation Partnership Project (3GPP®), the term "cell" can refer to the coverage area of a base station 110 and / or a base station subsystem serving that coverage area, depending on the context in which the term is used.
[0022] A base station 110 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., a few kilometers in radius) and may allow unrestricted access by UEs 120 with a service subscription. A pico cell may cover a relatively small geographic area and may allow unrestricted access by UEs 120 with a service subscription. A femto cell may cover a relatively small geographic area (e.g., indoors) and may allow restricted access by UEs 120 with an association with a femto cell (e.g., UEs in a closed subscriber group (CSG)). A base station 110 for a macro cell may be referred to as a macro base station. A base station 110 for a pico cell may be referred to as a pico base station. A base station 110 for a femto cell may be referred to as a femto base station or an indoor base station. 1, BS 110a may be a macro base station for a macro cell 102a, BS 110b may be a pico base station for a pico cell 102b, and BS 110c may be a femto base station for a femto cell 102c. A base station may support one or multiple (e.g., three) cells.
[0023] In some examples, the cells may not necessarily be stationary and the geographic area of the cells may move according to the location of the base station 110 that is mobile (e.g., a mobile base station). In some examples, the base stations 110 may be interconnected to each other and / or to one or more other base stations 110 or network nodes (not shown) in the wireless network 100 through various types of backhaul interfaces, such as direct physical connections or virtual networks, using any suitable transport network.
[0024] The wireless network 100 may include one or more relay stations. A relay station is an entity that may receive a transmission of data from an upstream station (e.g., a base station 110 or a UE 120) and send a transmission of data to a downstream station (e.g., a UE 120 or a base station 110). A relay station may be a UE 120 that may relay a transmission for another UE 120. In the example shown in FIG. 1, a BS 110d (e.g., a relay base station) may communicate with a BS 110a (e.g., a macro base station) and a UE 120d to facilitate communication between the BS 110a and the UE 120d. A base station 110 that relays communication may be referred to as a relay station, a relay base station, a relay, etc.
[0025] The wireless network 100 may be a heterogeneous network including different types of base stations 110, such as macro base stations, pico base stations, femto base stations, relay base stations, etc. These different types of base stations 110 may have different transmit power levels, different coverage areas, and / or different susceptibility to interference in the wireless network 100. For example, a macro base station may have a high transmit power level (e.g., 5-40 watts), while the pico base stations, femto base stations, and relay base stations may have lower transmit power levels (e.g., 0.1-2 watts).
[0026] A network controller 130 may couple to or communicate with a set of base stations 110 and may provide coordination and control for these base stations 110. The network controller 130 may communicate with the base stations 110 via backhaul communication links. The base stations 110 may communicate with each other directly or indirectly via wireless or wired backhaul communication links.
[0027] The UEs 120 may be dispersed throughout the wireless network 100, and each UE 120 may be fixed or mobile. The UEs 120 may include, for example, an access terminal, a terminal, a mobile station, and / or a subscriber unit. The UEs 120 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, a camera, a gaming device, a netbook, a smartbook, an ultrabook, a medical device, a biometric device, a wearable device (e.g., a smart watch, a smart clothing, a smart glasses, a smart wristband, a smart jewelry (e.g., a smart ring or a smart bracelet)), an entertainment device (e.g., a music device, a video device, and / or a satellite radio), a vehicle component or sensor, a smart meter / sensor, industrial manufacturing equipment, a global positioning system device, and / or any other suitable device configured to communicate over a wireless medium.
[0028] Some UEs 120 may be considered as machine type communication (MTC) UEs, or evolved or enhanced machine type communication (eMTC) UEs. MTC UEs and / or eMTC UEs may include, for example, a robot, a drone, a remote device, a sensor, a meter, a monitor, and / or a location tag that may communicate with a base station, another device (e.g., a remote device), or some other entity. Some UEs 120 may be considered as Internet of Things (IoT) devices and / or may be implemented as NB-IoT (narrowband IoT) devices. Some UEs 120 may be considered as customer premises equipment. The UEs 120 may be included within a housing that houses components of the UEs 120, such as a processor component and / or a memory component. In some examples, the processor component and the memory component may be coupled to each other. For example, the processor component (e.g., one or more processors) and the memory component (e.g., a memory) may be operatively coupled, communicatively coupled, electronically coupled, and / or electrically coupled.
[0029] In general, any number of wireless networks 100 may be deployed in a given geographic area. Each wireless network 100 may support a particular RAT and may operate on one or more frequencies. The RAT may be referred to as a radio technology, an air interface, etc. The frequencies may be referred to as a carrier, a frequency channel, etc. Each frequency may support a single RAT in a given geographic area to avoid interference between wireless networks of different RATs. In some cases, NR networks or 5G RAT networks may be deployed.
[0030] In some examples, two or more UEs 120 (e.g., shown as UE 120a and UE 120e) may communicate directly (e.g., without using the base station 110 as an intermediary to communicate with each other) using one or more sidelink channels. For example, the UEs 120 may communicate using peer-to-peer (P2P) communications, device-to-device (D2D) communications, vehicle-to-everything (V2X) protocols (which may include, e.g., vehicle-to-vehicle (V2V) protocols, vehicle-to-infrastructure (V2I) protocols, or vehicle-to-pedestrian (V2P) protocols), and / or mesh networks. In such examples, the UEs 120 may perform scheduling operations, resource selection operations, and / or other operations described elsewhere herein as being performed by the base station 110.
[0031] The devices of the wireless network 100 may communicate using an electromagnetic spectrum, which may be subdivided by frequency or wavelength into various classes, bands, channels, etc. For example, the devices of the wireless network 100 may communicate using one or more operating bands. In 5G NR, two initial operating bands have been identified as frequency range designations FR1 (410 MHz to 7.125 GHz) and FR2 (24.25 GHz to 52.6 GHz). It should be understood that FR1 is often referred to (interchangeably) as a "sub-6 GHz" band in various documents and articles, although a portion of FR1 is higher than 6 GHz. A similar nomenclature issue may arise with respect to FR2, which is often referred to (interchangeably) as a "mmWave" band in documents and articles, even though it is different from the extremely high frequency (EHF) band (30 GHz to 300 GHz) identified as a "mmWave" band by the International Telecommunications Union (ITU).
[0032] Frequencies between FR1 and FR2 are often referred to as mid-band frequencies. Recent 5G NR studies have identified operating bands for these mid-band frequencies as frequency range designation FR3 (7.125 GHz to 24.25 GHz). Frequency bands that fall within FR3 may inherit FR1 and / or FR2 characteristics, and thus may in effect extend the features of FR1 and / or FR2 to the mid-band frequencies. Additionally, higher frequency bands are currently being explored to extend 5G NR operation beyond 52.6 GHz. For example, three higher operating bands have been identified as frequency range designations FR4a or FR4-1 (52.6 GHz to 71 GHz), FR4 (52.6 GHz to 114.25 GHz), and FR5 (114.25 GHz to 300 GHz). Each of these higher frequency bands falls within the EHF band.
[0033] With the above examples in mind, it should be understood that unless otherwise specified, terms such as "sub-6 GHz" as used herein may broadly refer to frequencies that may be below 6 GHz, may be within FR1, or may include mid-band frequencies. Additionally, unless otherwise specified, it should be understood that terms such as "mmWave" as used herein may broadly refer to frequencies that may include mid-band frequencies, may be within FR2, FR4, FR4-a or FR4-1, and / or FR5, or may be within the EHF band. It is contemplated that the frequencies included in these operating bands (e.g., FR1, FR2, FR3, FR4, FR4-a, FR4-1, and / or FR5) may be modified, and the techniques described herein are applicable to those modified frequency ranges.
[0034] In some aspects, the UE 120 may include a communications manager 140. As described in more detail elsewhere herein, the communications manager 140 may send an indication of a physical downlink control channel (PDCCH) processing unit (PPU) limitation associated with the UE to a network node and receive from the network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU limitation associated with the UE. Additionally or alternatively, the communications manager 140 may perform one or more other operations described herein.
[0035] In some aspects, as described in more detail elsewhere herein, communications manager 140 may send an indication of a PPU limitation associated with the UE to a network node, receive from the network node a configuration of a plurality of search space sets for PDCCH candidates, the configuration including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, and selectively monitor one or more linked PDCCH candidates among the linked PDCCH candidates in a pair of linked monitoring occasions associated with a pair of linked search space sets among the one or more pairs of linked search space sets based at least in part on a comparison of a total number of PPUs occupied by linked PDCCH candidates in all of the one or more pairs of linked search space sets to a PPU limitation associated with the UE. Additionally or alternatively, communications manager 140 may perform one or more other operations described herein.
[0036] In some aspects, as described in more detail elsewhere herein, communications manager 140 can send to the network node, in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of a UE capability to support linked monitoring occasions between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring linked PDCCH candidates, and receive from the network node a configuration of a plurality of search space sets for monitoring PDCCH candidates based at least in part on the indication of the UE capability to support linked monitoring occasions between the two other linked monitoring occasions. Additionally or alternatively, communications manager 140 can perform one or more other operations described herein.
[0037] In some aspects, a network node (e.g., base station 110) may include a communications manager 150. As described in more detail elsewhere herein, communications manager 150 may receive an indication of a PPU limitation associated with the UE from the UE and transmit a configuration of a plurality of search space sets for PDCCH candidates to the UE, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets based at least in part on the PPU limitation associated with the UE. Additionally or alternatively, communications manager 150 may perform one or more other operations described herein.
[0038] In some aspects, as described in more detail elsewhere herein, communications manager 150 may receive from the UE an indication of a PPU limitation associated with the UE, transmit to the UE a configuration of a plurality of search space sets for PDCCH candidates, the configuration including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, and transmit a repeating PDCCH transmission to the UE in a pair of linked PDCCH candidates of the pair of linked search space sets, where at least one of the transmission of the repeating PDCCH transmission or the configuration of the pair of linked search space sets is based at least in part on the PPU limitation associated with the UE. Additionally or alternatively, communications manager 150 may perform one or more other operations described herein.
[0039] In some aspects, as described in more detail elsewhere herein, communications manager 150 can receive from a UE, in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of the UE capability of supporting linked monitoring occasions between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring linked PDCCH candidates, and transmit to the UE a configuration of one or more search space sets for monitoring the PDCCH candidates based at least in part on the indication of the UE capability of supporting linked monitoring occasions between the two other linked monitoring occasions. Additionally or alternatively, communications manager 150 can perform one or more other operations described herein.
[0040] As noted above, Figure 1 is provided as an example. Other examples may differ from those described in relation to Figure 1.
[0041] 2 illustrates an example base station 200 in communication with a UE 120 in a wireless network 100 in accordance with the present disclosure. The base station 110 may be equipped with a set of antennas 234a through 234t, such as T antennas, where T≧1. The UE 120 may be equipped with a set of antennas 252a through 252r, such as R antennas, where R≧1.
[0042] At the base station 110, a transmit processor 220 may receive data destined for a UE 120 (or set of UEs 120) from a data source 212. The transmit processor 220 may select one or more modulation and coding schemes (MCSs) for the UE 120 based at least in part on one or more channel quality indicators (CQIs) received from the UE 120. The base station 110 may process (e.g., encode and modulate) data for the UE 120 based at least in part on the MCS selected for the UE 120 and provide data symbols to the UE 120. The transmit processor 220 may process system information (e.g., for semi-static resource partitioning information (SRPI)) and control information (e.g., CQI requests, grants, and / or higher layer signaling) and provide overhead symbols and control symbols. The transmit processor 220 may generate reference symbols for a reference signal (e.g., a cell-specific reference signal (CRS) or a demodulation reference signal (DMRS)) and a synchronization signal (e.g., a primary synchronization signal (PSS) or a secondary synchronization signal (SSS)). A transmit (TX) multiple-input multiple-output (MIMO) processor 230 may perform spatial processing (e.g., precoding) on the data symbols, control symbols, overhead symbols, and / or reference symbols, if applicable, and provide a set of output symbol streams (e.g., T output symbol streams) to a corresponding set of modems 232 (e.g., T modems) denoted as modems 232a through 232t. For example, each output symbol stream may be provided to a modulator component (denoted as MOD) of modem 232. Each modem 232 may process (e.g., for OFDM) its respective output symbol stream using a respective modulator component to obtain an output sample stream. Each modem 232 may further process (e.g., convert to analog, amplify, filter, and / or upconvert) the output sample stream using a respective modulator component to obtain a downlink signal. Modems 232a through 232t may transmit a set of downlink signals (e.g., T downlink signals) via a corresponding set of antennas 234 (e.g., T antennas), denoted as antennas 234a through 234t.
[0043] At the UE 120, a set of antennas 252 (depicted as antennas 252a through 252r) may receive downlink signals from the base station 110 and / or other base stations 110 and may provide a set of received signals (e.g., R received signals) to a set of modems 254 (e.g., R modems) depicted as modems 254a through 254r. For example, each received signal may be provided to a demodulator component (depicted as DEMOD) of the modems 254. Each modem 254 may condition (e.g., filter, amplify, downconvert, and / or digitize) the received signal using a respective demodulator component to obtain input samples. Each modem 254 may further process the input samples (e.g., for OFDM) using the demodulator component to obtain received symbols. A MIMO detector 256 may obtain received symbols from the modems 254, perform MIMO detection on the received symbols, if applicable, and provide detected symbols. The receive processor 258 may process (e.g., demodulate and decode) the detected symbols, provide decoded data for the UE 120 to a data sink 260, and provide decoded control and system information to the controller / processor 280. The term "controller / processor" may refer to one or more controllers, one or more processors, or a combination thereof. The channel processor may determine a reference signal received power (RSRP) parameter, a received signal strength indicator (RSSI) parameter, a reference signal received quality (RSRQ) parameter, and / or a CQI parameter, among other examples. In some aspects, one or more components of the UE 120 may be included within a housing 284.
[0044] The network controller 130 may include a communication unit 294, a controller / processor 290, and a memory 292. The network controller 130 may include, for example, one or more devices in a core network. The network controller 130 may communicate with the base stations 110 via the communication unit 294.
[0045] One or more antennas (e.g., antennas 234a-t and / or antennas 252a-r) may include or be contained within one or more antenna panels, one or more antenna groups, one or more sets of antenna elements, and / or one or more antenna arrays, among other examples. An antenna panel, antenna group, set of antenna elements, and / or antenna array may include one or more antenna elements (in a single housing or multiple housings), a set of coplanar antenna elements, a set of non-coplanar antenna elements, and / or one or more antenna elements coupled to one or more transmitting and / or receiving components, such as one or more components of FIG.
[0046] On the uplink, at the UE 120, the transmit processor 264 may receive and process data from the data source 262 and control information (e.g., for reports including RSRP, RSSI, RSRQ, and / or CQI) from the controller / processor 280. The transmit processor 264 may generate reference symbols for one or more reference signals. The symbols from the transmit processor 264 may be precoded by the TX MIMO processor 266, if applicable, further processed by the modem 254 (e.g., for DFT-s-OFDM or CP-OFDM), and transmitted to the base station 110. In some examples, the modem 254 of the UE 120 may include a modulator and demodulator. In some examples, the UE 120 includes a transceiver. The transceiver may include any combination of the antennas 252, the modem 254, the MIMO detector 256, the receive processor 258, the transmit processor 264, and / or the TX MIMO processor 266. The transceiver can be used by a processor (e.g., controller / processor 280) and memory 282 to implement aspects of any of the methods described herein (e.g., with reference to Figures 5-17).
[0047] At the base station 110, uplink signals from the UE 120 and / or other UEs may be received by the antenna 234, processed by the modem 232 (e.g., a demodulator component of the modem 232, denoted as DEMOD), detected by a MIMO detector 236, if applicable, and further processed by a receive processor 238 to obtain decoded data and control information sent by the UE 120. The receive processor 238 may provide the decoded data to a data sink 239 and the decoded control information to the controller / processor 240. The base station 110 may include a communication unit 244 and may communicate with the network controller 130 via the communication unit 244. The base station 110 may include a scheduler 246 for scheduling one or more UEs 120 for downlink and / or uplink communications. In some examples, the modem 232 of the base station 110 may include a modulator and a demodulator. In some examples, the base station 110 includes a transceiver. The transceiver may include any combination of antennas 234, modem 232, MIMO detector 236, receive processor 238, transmit processor 220, and / or TX MIMO processor 230. The transceiver may be used by a processor (e.g., controller / processor 240) and memory 242 to implement aspects of any of the methods described herein (e.g., with reference to FIGS. 5-17).
[0048] The controller / processor 240 of the base station 110, the controller / processor 280 of the UE 120, and / or any other components of Figure 2 may perform one or more techniques associated with complexity processing for PDCCH repetitions, as described in more detail elsewhere herein. For example, the controller / processor 240 of the base station 110, the controller / processor 280 of the UE 120, and / or any other components of Figure 2 may perform or direct operations of, for example, process 1000 of Figure 10, process 1100 of Figure 11, process 1200 of Figure 12, process 1300 of Figure 13, process 1400 of Figure 14, process 1500 of Figure 15, and / or other processes as described herein. The memory 242 and the memory 282 may store data and program codes for the base station 110 and the UE 120, respectively. In some examples, memory 242 and / or memory 282 may include a non-transitory computer-readable medium that stores one or more instructions (e.g., code and / or program code) for wireless communication. For example, the one or more instructions, when executed (e.g., directly or after being compiled, translated, and / or interpreted) by one or more processors of base station 110 and / or UE 120, may cause the one or more processors, UE 120, and / or base station 110 to perform or direct operations of, for example, process 1000 of FIG. 10, process 1100 of FIG. 11, process 1200 of FIG. 12, process 1300 of FIG. 13, process 1400 of FIG. 14, process 1500 of FIG. 15, and / or other processes as described herein. In some examples, executing instructions may include executing instructions, converting instructions, compiling instructions, and / or interpreting instructions, among other examples. In some aspects, a network node as described herein is a base station 110, is included within a base station 110, or includes one or more components of the base station 110 shown in FIG.
[0049] In some aspects, a UE (e.g., UE 120) may include means for transmitting an indication of a PPU limitation associated with the UE to a network node and means for receiving from the network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on the PPU limitation. The means of the UE for performing operations described herein may include, for example, one or more of the communications manager 140, the antennas 252, the modem 254, the MIMO detector 256, the receive processor 258, the transmit processor 264, the TX MIMO processor 266, the controller / processor 280, or the memory 282.
[0050] In some aspects, the UE (e.g., UE 120) includes means for transmitting an indication of a PPU limitation associated with the UE to a network node, means for receiving a configuration of a plurality of search space sets for PDCCH candidates from the network node, the configuration including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, and / or means for selectively monitoring one or more linked PDCCH candidates among the linked PDCCH candidates in a pair of linked monitoring occasions associated with a pair of linked search space sets among the one or more pairs of linked search space sets based at least in part on a comparison of a total number of PPUs occupied by linked PDCCH candidates in all of the one or more pairs of linked search space sets to a PPU limitation associated with the UE. The UE's means for performing the operations described herein may include, for example, one or more of the communications manager 140, the antennas 252, the modem 254, the MIMO detector 256, the receive processor 258, the transmit processor 264, the TX MIMO processor 266, the controller / processor 280, or the memory 282.
[0051] In some aspects, a UE (e.g., UE 120) includes means for transmitting, in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of the UE capability to support linked monitoring occasions between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring linked PDCCH candidates to a network node and / or means for receiving from the network node a configuration of a plurality of search space sets for monitoring PDCCH candidates based at least in part on the indication of the UE capability to support linked monitoring occasions between two other linked monitoring occasions. The UE's means for performing the operations described herein may include, for example, one or more of communications manager 140, antennas 252, modem 254, MIMO detector 256, receive processor 258, transmit processor 264, TX MIMO processor 266, controller / processor 280, or memory 282.
[0052] In some aspects, a network node (e.g., base station 110) includes means for receiving from a UE an indication of a PPU limitation associated with the UE and / or means for transmitting to the UE a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU limitation associated with the UE. The network node's means for performing the operations described herein may include, for example, one or more of communications manager 150, transmit processor 220, TX MIMO processor 230, modem 232, antenna 234, MIMO detector 236, receive processor 238, controller / processor 240, memory 242, or scheduler 246.
[0053] In some aspects, a network node (e.g., base station 110) includes means for receiving from the UE an indication of a PPU limitation associated with the UE, means for transmitting to the UE a configuration of a plurality of search space sets for PDCCH candidates, the configuration including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, and / or means for transmitting a repeating PDCCH transmission to the UE in a pair of linked PDCCH candidates of the pair of linked search space sets, where at least one of the transmission of the repeating PDCCH transmission or the configuration of the pair of linked search space sets is based at least in part on a PPU limitation associated with the UE. The network node's means for performing the operations described herein may include, for example, one or more of communications manager 150, transmit processor 220, TX MIMO processor 230, modem 232, antenna 234, MIMO detector 236, receive processor 238, controller / processor 240, memory 242, or scheduler 246.
[0054] In some aspects, a network node (e.g., base station 110) includes means for receiving from the UE, in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of the UE capability of supporting linked monitoring occasions between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring linked PDCCH candidates, and / or means for transmitting to the UE a configuration of a plurality of search space sets for monitoring PDCCH candidates based at least in part on the indication of the UE capability of supporting linked monitoring occasions between the two other linked monitoring occasions. The network node's means for performing the operations described herein may include, for example, one or more of communications manager 150, transmit processor 220, TX MIMO processor 230, modem 232, antenna 234, MIMO detector 236, receive processor 238, controller / processor 240, memory 242, or scheduler 246.
[0055] 2 are shown as separate components, the functionality described above with respect to the blocks may be implemented in a single hardware, software, or combination component, or in various combinations of components. For example, functionality described with respect to transmit processor 264, receive processor 258, and / or TX MIMO processor 266 may be performed by or under the control of controller / processor 280.
[0056] As noted above, Figure 2 is provided as an example. Other examples may differ from those described in relation to Figure 2.
[0057] The deployment of a communication system such as a 5G NR system can be configured in multiple ways with various components or parts. In a 5G NR system or network, a network node, a network entity, a mobility element of the network, a radio access network (RAN) node, a core network node, a network element, a base station, or a network equipment can be implemented in an aggregated or disaggregated architecture. For example, a base station (such as a Node B (NB), an evolved NB (eNB), a NR BS, a 5G NB, an access point (AP), a TRP, or a cell, among other examples), or one or more units (or one or more components) performing base station functionality can be implemented as an aggregated base station (also known as a standalone base station or a monolithic base station) or a disaggregated base station. A "network entity" or a "network node" may refer to an aggregated base station, a disaggregated base station, or one or more units of a disaggregated base station (such as one or more central units (CU), one or more distributed units (DU), one or more radio units (RU), or a combination thereof).
[0058] An aggregated base station (e.g., an aggregated network node) may be configured to utilize a radio protocol stack that is physically or logically integrated within a single RAN node (e.g., within a single device or unit). A non-aggregated base station (e.g., a non-aggregated network node) may be configured to utilize a protocol stack that is physically or logically distributed between two or more units (such as one or more CUs, one or more DUs, or one or more RUs). In some aspects, a CU may be implemented within a network node, and one or more DUs may be co-located with the CU, or alternatively may be geographically or virtually distributed across one or more other network nodes. A DU may be implemented to communicate with one or more DUs. Each of the CU, DU, and RU may be implemented as a virtual unit, such as a virtual central unit (VCU), a virtual distributed unit (VDU), or a virtual radio unit (VRU), among other examples.
[0059] Base station type operation or network design can take into account the aggregation characteristics of base station functionality. For example, disaggregated base stations can be utilized in integrated access backhaul (IAB) networks, open radio access networks (O-RAN, such as the network configuration launched by the O-RAN alliance), or virtualized radio access networks (vRAN, also known as cloud radio access networks (C-RAN)) to facilitate scaling of the communication system by splitting the base station functionality into one or more separately deployable units. Disaggregated base stations can include functionality implemented across two or more units at various physical locations as well as functionality implemented virtually for at least one unit, which can allow flexibility in network design. Various units of the disaggregated base station can be configured for wired or wireless communication with at least one other unit of the disaggregated base station.
[0060] FIG. 3 illustrates an example resource structure 300 for wireless communication in accordance with the present disclosure. The resource structure 300 illustrates an example of various groupings of resources described herein. As shown, the resource structure 300 may include a subframe 305. The subframe 305 may include a number of slots 310. Although the resource structure 300 is shown as including two slots per subframe, a different number of slots may be included in a subframe (e.g., four slots, eight slots, sixteen slots, thirty-two slots, or another amount of slots). In some aspects, different types of transmission time intervals (TTIs) other than subframes and / or slots may be used. The slots 310 may include a number of symbols 315, such as fourteen symbols per slot.
[0061] A potential control region of a slot 310 may be referred to as a control resource set (CORESET) 320 and may be structured to support efficient use of resources, such as by flexible configuration or reconfiguration of resources of the CORESET 320 for one or more PDCCHs and / or one or more physical downlink shared channels (PDSCHs). In some aspects, the CORESET 320 may occupy the first symbol 315 of the slot 310, the first two symbols 315 of the slot 310, or the first three symbols 315 of the slot 310. Thus, the CORESET 320 may include multiple resource blocks (RBs) in the frequency domain and either one, two, or three symbols 315 in the time domain. In 5G, the amount of resources included in the CORESET 320 may be flexibly configured, such as by using radio resource control (RRC) signaling to indicate the frequency domain region (e.g., amount of RBs) and / or time domain region (e.g., amount of symbols) for the CORESET 320. In some examples, a UE may be configured with multiple CORESETs 320 (e.g., up to three or up to five) in a bandwidth portion (BWP) of a component carrier (CC) (e.g., a serving cell). Each CORESET 320 may be associated with a separate active transmission configuration indicator (TCI) state.
[0062] As shown, a symbol 315 including a CORESET 320 may include one or more control channel elements (CCEs) 325 spanning a portion of a system bandwidth, shown as two CCEs 325 as an example. The CCEs 325 may include downlink control information (DCI) used to provide control information for wireless communications. A base station may transmit DCI among multiple CCEs 325 (as shown), where the amount of CCEs 325 used for transmission of the DCI represents an aggregation level (AL) used by the BS for transmission of the DCI. In FIG. 3, an aggregation level of 2 is shown as an example, corresponding to two CCEs 325 in a slot 310. In some aspects, a different aggregation level may be used, such as 1, 2, 4, 8, 16, or another aggregation level.
[0063] Each CCE 325 may include a fixed amount of resource element groups (REGs) 330, shown as six REGs 330, or may include a variable amount of REGs 330. In some aspects, the amount of REGs 330 included in a CCE 325 may be specified by a REG bundle size. A REG 330 may include one resource block, which may include 12 resource elements (REs) 335 within a symbol 315. A resource element 335 may occupy one subcarrier in the frequency domain and one OFDM symbol in the time domain.
[0064] A search space may include possible locations (e.g., in time and / or frequency) where a PDCCH may be located. CORESET 320 may include one or more types of search spaces, such as a UE-specific search space, a group-common search space, and / or a common search space. A search space may indicate a set of CCE locations where a UE may find a PDCCH that may potentially be used to transmit control information to the UE. The possible locations for a PDCCH may depend on whether the PDCCH is a UE-specific PDCCH (e.g., for a single UE) or a group-common PDCCH (e.g., for multiple UEs) and / or the AL being used. The possible locations (e.g., in time and / or frequency) for a PDCCH may be referred to as PDCCH candidates, and the set of possible PDCCH locations in an AL may be referred to as a search space. One or more search spaces across an AL may be referred to as a search space (SS) set.
[0065] In some examples, there may be multiple SS sets (e.g., up to 10) in the BWP of a CC. A CORESET 320 may have one or more SS sets, with each SS set associated with a CORESET 320. The configuration of an SS set may include an RRC configuration that identifies, for the SS set, the associated CORESET 320, the periodicity, the monitoring slots and the offsets for the monitoring symbols with the monitoring slots, the SS set type (e.g., common SS (CSS) or UE-specific SS (USS)), the DCI format to be monitored, and / or the number of PDCCH candidates for one or more given ALs. The monitoring slots, and the periodicity and offsets of the monitoring symbols within the monitoring slots determine the PDCCH monitoring occasions for the SS set. In the configuration of the SS set, the PDCCH candidates for a given AL are associated with respective candidate indices. The UE may monitor the PDCCH candidates at the monitoring occasions for the configured SS set to receive DCI transmitted in the PDCCH communication in the PDCCH candidates, and perform blind decoding of the PDCCH candidates. In this case, one or more PDCCH candidates having a cyclic redundancy check (CRC) path correspond to the decoded DCI for the UE.
[0066] CORESET320 may be interleaved or non-interleaved. An interleaved CORESET320 may have a CCE-REG mapping such that adjacent CCEs are mapped to scattered REG bundles in the frequency domain (e.g., adjacent CCEs are not mapped to consecutive REG bundles of CORESET320). A non-interleaved CORESET320 may have a CCE-REG mapping such that all CCEs are mapped to consecutive REG bundles (e.g., in the frequency domain) of CORESET320.
[0067] As noted above, Figure 3 is provided as an example. Other examples may differ from what has been described with respect to Figure 3.
[0068] 4A-4D are diagrams illustrating example linked SS sets 400, 410, 420, 430, 440, 450, 460, 470, and 480 for PDCCH repetition in accordance with the present disclosure.
[0069] In some examples, the SS search set can be configured for PDCCH repetition. In this case, two PDCCH candidates in different SS sets can be linked for repetition of PDCCH communication containing the same DCI. When the two linked PDCCH candidates have the same AL (e.g., the same number of CCEs) and the DCI payload is transmitted by using one of the linked PDCCH candidates, the same DCI payload is transmitted by using the other linked PDCCH candidate. When PDCCH repetition is used, the UE may perform soft combining to decode the DCI from both linked PDCCH candidates, or the UE may try to decode the two linked PDCCH candidates separately. To perform soft combining of the DCI transmitted in the two linked PDCCH candidates, the UE may store the demodulator output for the DCI transmitted in the first PDCCH candidate (before decoding the demodulator output), combine the stored demodulator output for the first DCI transmission with the demodulator output for the second DCI transmission (in the second PDCCH candidate), and decode the combined output of the first and second DCI transmissions. For example, in some cases, the UE may combine two transmissions of DCI using log-likelihood ratio (LLR) soft combining. In this case, the UE may store in a memory or buffer a vector of LLR values of the demodulator output for the first DCI transmission (e.g., individual values for each coded bit corresponding to the DCI), and the UE may combine the vector of LLR values for the first DCI transmission with the vector of LLR values for the second DCI transmission before decoding the combined DCI transmission. PDCCH repetition and soft combining can result in reduced errors in DCI decoding by the UE, thereby improving network reliability and speed.
[0070] As shown in FIG. 4A, example 400 illustrates an example of a linked SS set pair for PDCCH repetition. As shown in example 400, a first SS set (SS set A) and a second SS set (SS set B) can be linked to provide PDCCH repetition. The two SS sets (e.g., SS set A and SS set B) can be linked by an RRC configuration. The monitoring occasions for the linked SS set pair (e.g., SS set A and SS set B) can be one-to-one mapped. The two linked SS sets can have the same periodicity and number of monitoring occasions in a slot. As shown in example 400, SS set A and SS set B each have monitoring occasions in a slot, and the monitoring occasions of SS set A (MO1-A) are linked (e.g., one-to-one mapped) to the monitoring occasions of SS set B (MO1-B). Two linked SS sets (e.g., SS Set A and SS Set B) may be configured with the same number of PDCCH candidates for each AL, and PDCCH candidates with the same AL and the same candidate index in two linked SS sets (e.g., SS Set A and SS Set B) are linked to each other. Linked PDCCH candidates in linked monitoring occasions (e.g., MO1-A and MO1-B) may be used for PDCCH repetition. For example, if a base station transmits a PDCCH communication including DCI in a PDCCH candidate of SS Set A in MO1-A, the base station may repeat the PDCCH communication including the same DCI in a linked PDCCH candidate (e.g., having the same AL and the same candidate index) in SS Set B in MO1-B.
[0071] As further shown in FIG. 4A, example 410 illustrates an example where a pair of linked SS sets (e.g., SS set A and SS set B) have multiple monitoring occasions in a slot. As shown in example 410, SS set A can have a first monitoring occasion (MO1-A) and a second monitoring occasion (MO2-A) in a slot, and SS set B can have a first monitoring occasion (MO1-B) and a second monitoring occasion (MO2-B) in a slot. For a pair of linked SS sets, the nth monitoring occasions of the linked SS sets can be linked to each other. For example, as shown in example 410, the first monitoring occasions (MO1-A and MO1-B) for the linked SS sets (SS set A and SS set B) can be linked, and the second monitoring occasions for the linked SS sets (SS set A and SS set B) can be linked. As shown in example 410, a PDCCH communication including DCI transmitted in a PDCCH candidate in MO1-B may be repeated (with the same DCI) in a linked PDCCH candidate in MO1-A, and a PDCCH communication including DCI transmitted in a PDCCH candidate in MO2-A may be repeated (with the same DCI) in a linked PDCCH candidate in MO2-B.
[0072] As mentioned above, for a linked SS set pair, the two SS sets may have the same number of monitoring occasions in a slot, and the nth monitoring occasion of one SS set of the linked SS set pair is linked to the -n-th monitoring occasion of the other SS set of the linked SS set pair. However, different configurations of the monitoring occasions of the linked SS set pair may result in more or less UE complexity (e.g., complexity of operations performed by the UE) and / or consume more or less UE memory resources, especially when the UE performs soft combining for linked PDCCH candidates in the monitoring occasions of the linked SS sets.
[0073] FIG. 4B illustrates examples 420 and 430 of linked SS sets that result in different UE complexities for PDCCH repetitions. As shown in FIG. 4B, example 420 illustrates a case where a first monitoring occasion (MO1-A) of a first SS set (SS set A) and a first monitoring occasion (MO1-B) of a second SS set (SS) both occur before a second monitoring occasion (MO2-A) of SS set A and a second monitoring occasion (MO2-B) of SS set B. In this case, the UE may complete soft combining (e.g., LLR combining) of linked PDCCH candidates in MO1-A and MO1-B before the UE performs soft combining of linked PDCCH candidates in MO2-A and MO2-B. As further shown in FIG. 4B, example 430 illustrates a case where a second monitoring occasion (MO2-A) of SS set A occurs before a first monitoring occasion (MO1-B) of SS set B. In other words, MO2-A linked to MO2-B is scheduled between the linked first monitoring occasions MO1-A and MO1-B. In this case, the UE needs to buffer the soft demodulator outputs (e.g., LLR values) of the linked PDCCH candidates in both MO1-A and MO2-A (e.g., both the first and second monitoring occasions in SS set A) before the UE can perform soft combining with the linked PDCCH candidates in MO1-B and MO2-B, respectively. As a result, the case shown in example 430 requires increased UE complexity and consumes increased UE memory resources compared to the case shown in example 420.
[0074] Figures 4C and 4D show examples 440, 450, 460, 470, and 480 of linked SS sets that may result in increased UE complexity and / or increased UE memory resource consumption compared to the case shown in example 420 of Figure 4B. As shown in Figure 4C, examples 440, 450, 460, and 470 show examples in which a first SS set (SS set A) is linked to a second SS set (SS set B) and a third SS set (SS set C) is linked to a fourth SS set (SS set D). Examples 440, 450, 460, and 470 show that when multiple linked SS set pairs are scheduled in a slot, increased UE complexity and increased UE memory resource consumption may occur, even if each SS set has one monitoring occasion in the slot. As shown in example 440, the first monitoring occasion (MO1-C) of SS set C (linked to the first monitoring occasion (MO1-D) of SS set D) is scheduled between the first monitoring occasion (MO1-A) of SS set A and the first monitoring occasion (MO1-B) of SS set B. As shown in example 450, the first monitoring occasion (MO1-C) of SS set C and the first monitoring occasion (MO1-D) of SS set D are scheduled between the first monitoring occasion (MO1-A) of SS set A and the first monitoring occasion (MO1-B) of SS set B. As shown in example 460, the first monitoring occasion of SS set A (MO1-A) and the first monitoring occasion of SS set C (MO1-C) are scheduled in the same symbol in a slot, and the first monitoring occasion of SS set D (MO1-D) is scheduled before the first monitoring occasion of SS set B (MO1-B). As shown in example 470, the first monitoring occasion of SS set C (MO1-C) is scheduled between the first monitoring occasion of SS set A (MO1-A) and the first monitoring occasion of SS set B (MO1-B), and the first monitoring occasion of SS set D (MO1-D) is scheduled to begin in the same symbol as MO1-B.In all of examples 440, 450, 460, and 470, the UE needs to buffer the soft demodulator outputs (e.g., LLR values) of the linked PDCCH candidates in both MO1-A and MO1-C before the UE can perform soft combining with the linked PDCCH candidates in MO1-B and MO1-D, respectively.
[0075] 4D shows an example 480 pair of linked SS sets (SS Set A and SS Set B) having a large number of linked PDCCH candidates. In this case, soft combining of the linked PDCCH candidates in SS Set A and SS Set B may require increased UE complexity (e.g., compared to a pair of linked SS sets having fewer linked PDCCH candidates) and consume large amounts of memory resources to buffer the soft demodulator outputs (e.g., LLR values) for the large number of linked PDCCH candidates.
[0076] As noted above, Figures 4A-4D are given as examples, and other examples may differ from what has been described in relation to Figure 4.
[0077] As described above in connection with Figures 4A-4D, in some cases, repetition of PDCCH in linked SS sets may result in increased consumption of memory resources by the UE. In some cases, this increased consumption of memory resources may result in slower communication speeds, reduced battery life, or reduced performance of the UE. In some cases, soft combining of linked PDCCH candidates may require more memory resources than are available in the UE, which may result in failure to decode DCI transmitted in the linked PDCCH candidates. This may result in unreliable and increased latency in communications to and / or from the UE.
[0078] Some techniques and apparatus described herein allow for prohibiting or allowing certain cases of PDCCH repetition based at least in part on UE capabilities. In some aspects, a UE can transmit to a base station an indication of UE capabilities to support linked monitoring occasions in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates that are scheduled between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring linked PDCCH candidates. The base station can transmit to the UE a configuration of multiple SS sets for monitoring PDCCH candidates based at least in part on the indication of UE capabilities. As a result, based at least in part on the UE capabilities, unless the UE indicates that it can support such configuration, the base station may refrain from configuring linked SS set pairs in which the nth monitoring occasion of one SS set precedes the (n-1)th monitoring occasion of the other SS set (e.g., as in example 430 of FIG. 4B) and / or the base station may refrain from configuring multiple linked SS set pairs in which the monitoring occasion of an SS set in one linked SS set pair is between the monitoring occasion of an SS set in another linked SS set pair (e.g., as in examples 440, 450, 460, and 470 of FIG. 4C). This may reduce memory resource consumption by the UE and / or improve reliability and latency of communications to and / or from the UE (e.g., due to reduced DCI decoding errors).
[0079] In some cases, if the number of linked PDCCH candidates is not too large for the UE's memory resources, a binary UE capability indication of support or no support may be sufficient to handle cases where UE complexity and / or memory consumption increases, such as the cases shown in examples 430, 440, 450, 460, and 470. However, in some cases, a binary UE capability indication of support or no support may not be flexible enough to encompass all of the cases where UE complexity and / or memory resource consumption associated with PDCCH repetition in linked SS sets may result in degraded UE performance. For example, in some cases, the configuration restrictions (e.g., same periodicity and / or same number of monitoring occasions in a slot, among other examples) are only between two linked SS sets (and not between multiple linked SS set pairs), so the base station may have difficulty ensuring that an SS set from one linked SS set pair does not occur between an SS set from another linked SS set pair. Furthermore, a binary UE capability indication of support or no support may not prevent a base station from configuring a linked SS set pair with a number of linked PDCCH candidates that is too large for the UE's memory resources.
[0080] Some techniques and apparatus described herein enable a UE to transmit an indication of a PPU limit associated with the UE to a base station. The PPU is a metric that represents memory resources and / or complexity required for a pair of linked PDCCH candidates. The base station may transmit to the UE a configuration of multiple SS sets including one or more linked SS set pairs having linked PDCCH candidates for PDCCH repetitions. The UE may selectively monitor linked PDCCH candidates in one or more linked SS set pairs based at least in part on a comparison of a total number of PPUs occupied by linked PDCCH candidates in all of the one or more pairs of linked search space sets to a PPU limit associated with the UE. As a result, the UE may refrain from monitoring linked PDCCH candidates for PDCCH repetitions in any case where the PPU exceeds a PPU limit associated with the UE. This may reduce memory resource consumption by the UE and / or improve reliability and latency of communications to and / or from the UE (e.g., due to reduced DCI decoding errors).
[0081] 5 is a diagram illustrating an example 500 associated with complexity processing for PDCCH repetition in accordance with the present disclosure. As shown in FIG. 5, the example 500 includes communication between a base station 110 and a UE 120. In some aspects, the base station 110 and the UE 120 can be included in a wireless network, such as the wireless network 100 (e.g., shown in FIG. 1). The base station 110 and the UE 120 can communicate via a wireless access link, which can include an uplink and a downlink.
[0082] 5 and reference numeral 505, the UE 120 may transmit a UE capability report to the base station 110 including an indication of the UE 120's capability to support a linked monitoring occasion scheduled between two other linked monitoring occasions. For example, the indication may indicate whether the UE 120 can support a linked monitoring occasion scheduled between two other linked monitoring occasions in a first pair of linked monitoring occasions for monitoring PDCCH candidates in a second pair of linked monitoring occasions. In some aspects, the UE 120 may transmit the indication of the UE 120's capability to the base station 110 via an RRC message.
[0083] In some aspects, the indication of support or no support may apply to UE 120's capability of supporting the nth monitoring occasion of a first SS set of a linked SS set pair being scheduled before the (n-1)th monitoring occasion of a second SS set of the linked SS set pair (e.g., the nth monitoring occasion of the first SS set being scheduled between the (n-1)th monitoring occasion of the first and second SS sets) and / or UE 120's capability of supporting the SS set in the first pair of linked SS sets being scheduled between the monitoring occasion of an SS set in the second pair of SS sets. In some aspects, the UE capability report may include separate UE capability indications for the UE 120's capability to support the nth monitoring occasion of the first SS set of the linked SS set pair being scheduled before the (n-1)th monitoring occasion of the second SS set of the linked SS set pair and for the UE 120's capability to support ...
[0084] 5 and reference numeral 510, base station 110 can transmit to UE 120 a configuration of an SS set for monitoring PDCCH candidates based at least in part on the UE capabilities indicated in the UE capability report. In some aspects, base station 110 can receive an indication of UE 120's capability to support a linked monitoring occasion between two other linked monitoring occasions, and base station 110 can determine a configuration (or configurations) of an SS set for UE 120 based at least in part on the UE capability indication received from UE 120. For example, base station 110 can determine a configuration of an SS set for UE 120 based at least in part on whether UE 120 can support a linked monitoring occasion scheduled between two other linked monitoring occasions.
[0085] If UE 120 indicates that it can support linked monitoring occasions scheduled among other linked monitoring occasions, base station 110 can determine a configuration of SS sets that includes one or more linked SS set pairs, and a linked monitoring occasion for an SS set of a first pair of linked SS sets is scheduled among other linked monitoring occasions (e.g., for the first pair of linked SS sets or for the second pair of linked SS sets).
[0086] In some aspects, if the UE 120 indicates that it cannot support linked monitoring occasions scheduled among other linked monitoring occasions, the base station 110 can determine a configuration for a pair of linked SS sets including a first SS set and a second SS set that ensures that the nth monitoring occasion of the first SS set is not scheduled before the (n-1)th monitoring occasion of the second SS set. For example, in this case, the base station 110 cannot link the first SS set and the second SS set if the nth monitoring occasion of the first SS set precedes the (n-1)th monitoring occasion of the second SS set. In some aspects, if UE 120 indicates that it cannot support linked monitoring occasions scheduled between other linked monitoring occasions, base station 110 can determine a configuration that ensures that for any two linked SS set pairs, a monitoring occasion of any one of the SS sets is not scheduled between two monitoring occasions of the other two linked SS sets. For example, in this case, base station 110 can determine a configuration that ensures that a monitoring occasion of an SS set in a first pair of linked SS sets is not scheduled between a monitoring occasion of an SS set in a second pair of linked SS sets.
[0087] In some aspects, base station 110 can receive separate indications (e.g., a first indication and a second indication) from UE 120 for a capability of UE 120 to support an nth monitoring occasion of a first SS set of a pair of linked SS sets being scheduled before a (n-1)th monitoring occasion of a second SS set of the pair of linked SS sets and for a capability of UE 120 to support a monitoring occasion of an SS set in the first pair of linked SS sets being scheduled between monitoring occasions of an SS set in the second pair of SS sets, in which case base station 110 can determine a configuration of one or more pairs of linked SS sets based at least in part on the separate indications.
[0088] In some aspects, base station 110 may transmit the configuration of the SS sets in one or more RRC messages to UE 120. In some aspects, the configuration of the SS sets may include SS set configuration information for configuring each SS set and linking configuration information for configuring linking between one or more pairs of linked SS sets.
[0089] As further shown in FIG. 5 by reference numeral 515, the UE 120 may monitor PDCCH candidates based at least in part on a configuration of SS sets. In some aspects, the UE 120 may receive a configuration of SS sets from the base station 110, and the UE 120 may monitor PDCCH candidates in monitoring occasions of the SS sets configured in the configuration. In some aspects, the UE 120 may monitor linked PDCCH candidates in linked monitoring occasions for one or more linked SS set pairs for PDCCH repetitions. In this case, the UE 120 may perform soft combining of linked PDCCH candidates in linked monitoring occasions for each linked SS set pair. For non-linked PDCCH candidates (e.g., PDCCH candidates that are not linked to other PDCCH candidates of another SS set), the UE 120 may monitor the PDCCH candidates and attempt to decode DCI transmitted in the PDCCH candidates.
[0090] As further shown in FIG. 5 and reference numeral 520, the base station 110 can transmit one or more PDCCH communications including DCI to the UE 120 in one or more PDCCH candidates. In some aspects, the base station 110 can transmit a repeat PDCCH transmission including the same DCI in a linked PDCCH candidate pair in a linked monitoring occasion of the linked SS set pair. For example, the base station 110 can transmit a PDCCH communication including DCI in a first PDCCH candidate in a monitoring occasion of a first SS set of the linked SS set pair, and the base station 110 can repeat the transmission of the same PDCCH communication including the same DCI in a second PDCCH candidate linked to the first PDCCH candidate (e.g., having the same AL and the same candidate index) in a monitoring occasion of a second SS set of the linked SS set pair. The UE 120 can monitor each pair of linked PDCCH candidates for PDCCH repetitions. For example, the UE 120 may perform soft combining (e.g., LLR combining) of pairs of linked PDCCH candidates to decode the DCI based at least in part on the combination of repeated PDCCH transmissions in the pairs of linked PDCCH candidates. In some aspects, the base station 110 may transmit one or more PDCCH communications without PDCCH repetitions in one or more unlinked PDCCH candidates (e.g., in one or more unlinked SS sets).
[0091] In some aspects, the DCI transmitted by base station 110 and decoded by UE 120 may schedule one or more downlink communications (e.g., PDSCH communications) from base station 110 to UE 120 and / or one or more uplink communications (e.g., physical uplink shared channel (PUSCH) communications) from UE 120 to base station 110. In this case, base station 110 may transmit, and UE 120 may receive, one or more downlink communications scheduled by the DCI, and / or UE 120 may transmit, and base station 110 may receive, one or more uplink communications scheduled by the DCI.
[0092] As described above, UE 120 may transmit to base station 110 an indication of UE 120's capability to support a linked monitoring occasion in a first pair of linked monitoring occasions that is scheduled between two other linked monitoring occasions in a second pair of linked monitoring occasions. Base station 110 may transmit to UE 120 a configuration of one or more SS sets for monitoring PDCCH candidates based at least in part on the indication of UE 120's capabilities. As a result, unless UE 120 indicates that the UE can support such a configuration, based at least in part on the UE capabilities, base station 110 may refrain from configuring a linked SS set pair in which the nth monitoring occasion of one SS set precedes the (n-1)th monitoring occasion of the other SS set, and / or the base station may refrain from configuring multiple linked SS set pairs in which the monitoring occasion of an SS set in one linked SS set pair is between the monitoring occasion of an SS set in another linked SS set pair. This may result in reduced consumption of memory resources by UE 120 and / or improved reliability and reduced latency of communications to and / or from UE 120 (e.g., due to reduced DCI decoding errors).
[0093] As noted above, Figure 5 is provided as an example. Other examples may differ from what has been described in relation to Figure 5.
[0094] 6 is a diagram illustrating an example 600 associated with complexity processing for PDCCH repetition in accordance with the present disclosure. As shown in FIG. 6, the example 600 includes communication between a base station 110 and a UE 120. In some aspects, the base station 110 and the UE 120 may be included in a wireless network, such as the wireless network 100. The base station 110 and the UE 120 may communicate via a wireless access link, which may include an uplink and a downlink.
[0095] 6 and reference numeral 605, the UE 120 may transmit to the base station 110 a UE capability report that includes an indication of a PPU limit associated with the UE 120. The PPU is a metric that represents the memory resources and / or complexity required for a pair of linked PDCCH candidates. For example, the PPU may represent the memory resources and / or complexity required to soft combine a pair of linked PDCCH candidates.
[0096] In some aspects, any pair of linked PDCCH candidates (e.g., any two PDCCH candidates that are linked to each other) occupies a number of PPUs over a time period associated with the linked PDCCH candidate pair. The linked PDCCH candidate pair may include a first PDCCH candidate in a first SS set of the linked SS set pair and a second PDCCH candidate linked to the first PDCCH candidate (e.g., having the same AL and the same candidate index) in a second SS set of the linked SS set pair. In some aspects, the number of PPUs occupied by the linked PDCCH candidate pair (e.g., the number of occupied PPUs for the linked PDCCH candidate pair) may be based at least in part on the AL associated with the linked PDCCH candidate pair. For example, an AL-dependent factor may be applied to determine the number of PPUs occupied by the linked PDCCH candidate pair. In some aspects, the number of PPUs occupied by a pair of linked PDCCH candidates may be equal to an AL (e.g., 1, 2, 4, 8, or 16) associated with the pair of linked PDCCH candidates. In some aspects, the number of PPUs occupied by a pair of linked PDCCH candidates may be equal to or based at least in part on a mother code length (e.g., circular buffer size) of the AL associated with the pair of linked PDCCH candidates. For example, the mother code lengths (e.g., circular buffer sizes) for AL=1, 2, 4, 8, and 16 may be equal to 128, 256, 512, 512, and 512, respectively.Thus, when the number of PPUs occupied by a linked PDCCH candidate pair is based at least in part on (or equal to) the mother code length at the AL level, the number of occupied PPUs for a linked PDCCH candidate pair with AL=4 (e.g., mother code length=512) may be greater than the number of occupied PPUs for a linked PDCCH candidate pair with AL=2 (e.g., mother code length=256), but because the mother code length (e.g., 512) is the same for AL=4 and AL=16, the number of occupied PPUs for a linked PDCCH candidate pair with AL=4 and a linked PDCCH candidate pair with AL=16 may be the same.
[0097] In some aspects, for a linked PDCCH candidate pair including a first PDCCH candidate and a second PDCCH candidate, a time period (e.g., an occupancy period) associated with the PDCCH candidate pair may be based at least in part on one or more symbols associated with the first PDCCH candidate and one or more symbols associated with the second PDCCH candidate. In some aspects, the time period of the PDCCH candidate pair may last from a beginning of a first symbol associated with the first PDCCH candidate (e.g., an earlier PDCCH candidate in time) to an end of a last symbol associated with the second PDCCH candidate (e.g., a later PDCCH candidate in time). In some aspects, the time period of the PDCCH candidate pair may last from an end of a last symbol associated with the first PDCCH candidate (e.g., an earlier PDCCH candidate in time) to an end of a last symbol associated with the second PDCCH candidate (e.g., a later PDCCH candidate in time). In some aspects, a period of a PDCCH candidate pair may last from a beginning of a first symbol associated with a first PDCCH candidate (e.g., an earlier PDCCH candidate in time) to a beginning of a first symbol associated with a second PDCCH candidate (e.g., a later PDCCH candidate in time). In some aspects, a period of a PDCCH candidate pair may last from an end of a last symbol associated with a first PDCCH candidate (e.g., an earlier PDCCH candidate in time) to a beginning of a first symbol associated with a second PDCCH candidate (e.g., a later PDCCH candidate in time).
[0098] At a given time (time t), the total number of occupied PPUs may be based on the occupied PPUs across all linked PDCCH candidate pairs (e.g., across all linked monitoring occasions of all linked SS sets) that have associated occupation periods that include time t. For example, for each pair of linked PDCCH candidates (e.g., across all linked monitoring occasions of all linked SS sets), if the period associated with the linked PDCCH candidate pair includes time t, then the number of PPUs occupied by the linked PDCCH candidate pair may be included in the total number of occupied PPUs at time t.
[0099] The UE 120 may transmit to the base station 110 an indication of a PPU restriction associated with the UE 120. In some aspects, the indication of the PPU restriction may be an indication of the capabilities of the UE 120 indicating a maximum number of PPUs that the UE 120 can support. In some aspects, the PPU restriction may be a PPU restriction configured to a number of PPUs other than the maximum number of PPUs that the UE 120 can handle. In some aspects, the indication of the PPU restriction may include an indication of an individual PPU restriction (e.g., a maximum number of PPUs) per CC. For example, the indication may include a PPU restriction for each of one or more CCs. As another example, the indication of the PPU restriction may be applied individually per CC (e.g., the indication may include one PPU restriction applied per CC). Additionally or alternatively, the indication of the PPU restriction may include an indication of a PPU restriction (e.g., a maximum number of PPUs) across all CCs. For example, in this case, the PPU restriction may be for a total number of PPUs across one or more CCs. In some aspects, the indication of the PPU limit may include an indication of a respective PPU limit for one or more CCs, and the UE 120 and the base station 110 may each derive a total PPU limit across all CCs based at least in part on the respective PPU limits for the CCs. For example, the respective PPU limits for the CCs may include a PPU limit per CC (e.g., a maximum number of PPUs), and the total PPU limit across all of the CCs (e.g., a maximum number of PPUs) may be derived by multiplying the PPU limit per CC by a factor. In some aspects, the factor may be equal to the UE capability for blind detection (e.g., pdcch-BlinddetectionCA), which may also be used to determine a maximum number of blind decodings (e.g., a maximum number of monitored candidates) across all of the CCs.
[0100] In some aspects, the UE 120 may indicate a PPU limit for different subcarrier spacings (SCSs) separately. For example, the indication of the PPU limit may include an individual PPU limit (e.g., a maximum number of PPUs) for each of one or more SCSs (e.g., 15 kHz, 30 kHz, 60 kHz, 120 kHz, 240 kHz, 480 kHz, and / or 960 kHz, among other examples). In some aspects, the UE 120 may transmit an indication of the PPU limit to the base station 110 in a UE capability report (e.g., via an RRC message or a medium access control (MAC) control element (MAC-CE)).
[0101] As further shown in FIG. 6 and reference numeral 610, base station 110 can transmit a configuration of linked SS sets to UE 120. In some aspects, base station 110 can transmit a configuration of multiple SS sets of PDCCH candidates, and UE 120 can receive the configuration, where the multiple SS sets can include one or more linked SS set pairs. One or more linked SS set pairs can include linked PDCCH candidates for PDCCH repetitions (e.g., in linked monitoring occasions). In some aspects, base station 110 can transmit the configuration of SS sets (including linked SS sets) to UE 120 in one or more RRC messages. In some aspects, the configuration of linked SS set pairs can include an SS set configuration of SS sets and a linking configuration that configures linking between the linked SS set pairs.
[0102] In some aspects, base station 110 may determine a configuration of linked SS set pairs based at least in part on an indication of a PPU restriction associated with UE 120 received from UE 120. In some aspects, UE 120 may not expect that the total number of PPUs occupied by all of the linked PDCCH candidates at any time does not meet (e.g., exceeds) the PPU restriction associated with UE 120. In this case, the total number of PPUs occupied by all of the linked PDCCH candidates (e.g., across all of the configured linked SS set pairs) may be required to meet (e.g., be less than or equal to) the PPU restriction associated with UE 120. For example, base station 110 may determine a configuration of linked SS set pairs based at least in part on an indication of a PPU restriction associated with UE 120, and base station 110 may ensure (required to ensure) that the configuration of linked SS set pairs (e.g., SS set configuration and / or linking configuration) results in the PPU restriction associated with UE 120 being met for UE 120 at all times. In some aspects, if a per-CC PPU limit is indicated by UE 120, base station 110 can determine a configuration of linked SS set pairs to ensure that the per-CC PPU limit is always met for each CC. In some aspects, if a total PPU limit across all CCs is indicated by UE 120 (or is derived based at least in part on the per-CC PPU limit), base station 110 can determine a configuration of linked SS set pairs to ensure that the total PPU limit across all CCs is always met for UE 120.
[0103] In some aspects, UE 120 can dynamically select which linked PDCCH candidates to monitor for PDCCH communications if the total number of PPUs occupied by all of the linked PDCCH candidates (e.g., across all of the configured linked SS set pairs) at a given time does not meet (e.g., exceeds) a PPU limit associated with UE 120. In this case, base station 110 can determine a configuration of linked SS set pairs that results in a time at which the total number of PPUs occupied by all of the linked PDCCH candidates does not meet the PPU limit.
[0104] As further shown in FIG. 6 and reference numeral 615, the UE 120 may calculate a total number of PPUs occupied by all of the linked PDCCH candidates (e.g., across all of the configured linked SS set pairs) at one or more time points associated with monitoring one or more linked PDCCH candidates. For example, the UE 120 may calculate a total number of PPUs occupied by all of the linked PDCCH candidates (e.g., across all of the configured linked SS set pairs) at one or more time points associated with a pair of linked monitoring occasions that includes one or more pairs of linked PDCCH candidates. The UE 120 may calculate a total number of PPUs occupied by all of the linked PDCCH candidates (e.g., across all of the configured linked SS set pairs) at time point t by calculating a total number of PPUs occupied by each pair of linked PDCCH candidates having an associated time period that includes the time point t. For example, if the time period associated with a linked PDCCH candidate pair includes time t, then at time t, for each pair of linked PDCCH candidates across all of the linked SS set pairs, UE 120 may add the number of occupied PPUs of that linked PDCCH candidate pair to the total number of occupied PPUs.
[0105] In some aspects, if a per-CC PPU limit is indicated by UE 120, UE 120 may calculate a total number of occupied PPUs per CC at one or more time points. In some aspects, if a total PPU limit across all CCs is indicated by UE 120 (or derived based at least in part on the per-CC PPU limit), UE 120 may calculate a total number of occupied PPUs across all of the CCs. In some aspects, UE 120 may calculate a total number of PPUs occupied by all of the linked PDCCH candidates at multiple time points across a time period associated with one or more PDCCH candidates.
[0106] As further shown in FIG. 6 and reference numeral 620, the UE 120 may selectively monitor linked PDCCH candidates in linked monitoring occasions of a linked SS set based at least in part on a total number of occupied PPUs at one or more time points and a PPU limit associated with the UE 120. In some aspects, the UE 120 may compare a total number of PPUs occupied by all of the linked PDCCH candidates (e.g., across all of the configured pairs of linked SS sets) at one or more time points to a PPU limit associated with the UE. For example, at each time point, the UE 120 may compare a total number of occupied PPUs per CC to a PPU limit per CC associated with the UE 120, and / or the UE 120 may compare a total number of occupied PPUs to a total PPU limit across all CCs of the UE 120. In some aspects, the UE 120 may selectively monitor one or more linked PDCCH candidates at one or more time points based at least in part on a comparison of a total PPU occupied by all linked PDCCH candidates to a PPU limit associated with the UE 120. For example, UE 120 may selectively monitor one or more linked PDCCH candidates based at least in part on a determination of whether the total PPU occupied by all linked PDCCH candidates at one or more points in time meets (e.g., is less than or equal to) a PPU limit associated with UE 120.
[0107] In some aspects, in connection with determining that the total number of occupied PPUs at one or more time points meets (e.g., is less than or equal to) a PPU limit associated with UE 120 (e.g., per CC and / or across all CCs), UE 120 may monitor all of the linked PDCCH candidates at one or more time points for a PDCCH repetition. For example, the one or more time points may be a set of time points spanning a time period associated with one or more pairs of linked PDCCH candidates. In this case, UE 120 may monitor one or more pairs of linked PDCCH candidates (as well as other linked PDCCH candidates scheduled during that time period). For example, UE 120 may buffer a soft demodulator output (e.g., an LLR value) for a first linked PDCCH candidate (of a pair of one or more PDCCH candidates) in a first monitoring occasion, and soft combine the first linked PDCCH candidate with the second linked PDCCH candidate (of the pair of one or more PDCCH candidates) in a second monitoring occasion (linked to the first monitoring occasion).
[0108] In some aspects, UE 120 may not expect that the total number of PPUs occupied by all of the linked PDCCH candidates at any one time does not meet (e.g., exceeds) the PPU limit associated with UE 120. In this case, the total number of PPUs occupied by all of the linked PDCCH candidates (e.g., across all of the configured linked SS set pairs) may be required to meet (e.g., be less than or equal to) the PPU limit associated with UE 120. As mentioned above, in this case, base station 110 may be required to ensure that the configuration of the linked SS set pairs results in the PPU limit associated with UE 120 always being met for UE 120. In this case, UE 120 may monitor the linked PDCCH candidates (e.g., in the linked monitoring occasion pair or the linked SS set pair) for the PDCCH recurrence based at least in part on the configuration received from base station 110. In some aspects, UE 120 may determine that an error case has occurred in connection with UE 120 determining that the total number of PPUs occupied at a given time does not meet a PPU limit associated with UE 120.
[0109] In some aspects, in connection with determining that the total number of occupied PPUs at a time does not meet the PPU limit associated with UE 120, UE 120 may drop (e.g., refrain from monitoring) one or more PDCCH candidates from the linked PDCCH candidates. For example, UE 120 may determine that the total number of occupied PPUs does not meet the PPU limit associated with UE 120 for one or more symbols during a time period associated with one or more pairs of linked PDCCH candidates. In this case, UE 120 may drop (e.g., refrain from monitoring) one or more linked PDCCH candidates among the linked PDCCH candidates in one or more pairs of linked PDCCH candidates, or one or more other PDCCH candidates (e.g., in other linked PDCCH candidate pairs) having a time period that overlaps with the time period of one or more pairs of linked PDCCH candidates. In some aspects, UE 120 may select one or more linked PDCCH candidates to drop in order for the total number of PPUs to meet the PPU limit associated with UE 120. In some aspects, UE 120 may refrain from monitoring the dropped linked PDCCH candidates, and if UE 120 has buffered soft demodulator outputs (e.g., LLR values) for any of the dropped linked PDCCH candidates, UE 120 may drop the soft demodulator outputs (e.g., LLR values) for the dropped linked PDCCH candidates from its memory.
[0110] In some aspects, the UE 120 may determine a priority of linked PDCCH candidates that occupy a PPU at a time when the total number of PPUs does not meet the PPU limit associated with the UE 120, and the UE 120 may select a PDCCH candidate to drop based at least in part on the priority. In some aspects, if the PPU limit is across all of the CCs, the UE 120 may determine a priority of the linked PDCCH candidates based at least in part (e.g., as a function of) the CC index. For example, linked PDCCH candidates on different CCs may be associated with different priorities. In this case, the UE 120 may drop (e.g., refrain from monitoring) one or more linked PDCCH candidates based at least in part on the priority associated with the CC of the one or more linked PDCCH candidates. For example, the UE 120 may drop (e.g., refrain from monitoring) one or more pairs of linked PDCCH candidates on the lowest priority CC.
[0111] In some aspects, the UE 120 may determine a priority for selecting a linked PDCCH candidate to drop based at least in part on an SS set index associated with a pair of linked SS sets associated with the linked PDCCH candidate. For example, the SS set index associated with the pair of linked SS sets may be the smaller SS set index of the SS indices associated with the two linked SS sets. In some aspects, each SS set index may be associated with a separate priority. In some aspects, SS sets of different SS types (e.g., CSS or USS) may be associated with different priorities. In some aspects, the UE 120 may drop a linked PDCCH candidate at the SS set level. For example, the UE 120 may drop (e.g., refrain from monitoring) a linked PDCCH candidate based at least in part on a priority associated with the pair of linked SS sets (e.g., a priority associated with the SS set index associated with the pair of linked SS sets or a priority associated with the SS type associated with the pair of linked SS sets).
[0112] In some aspects, the UE 120 may determine a priority for selecting linked PDCCH candidates to drop based at least in part on the monitoring occasion index for the monitoring occasion of the linked SS set pair in the slot. For example, different monitoring occasion indexes may be associated with different priorities. In some aspects, the UE 120 may drop linked PDCCH candidates at the monitoring occasion level. For example, the UE 120 may drop (e.g., refrain from monitoring) linked PDCCH candidates in a linked monitoring occasion pair of the linked SS set pair based at least in part on the priority associated with the monitoring occasion index of the linked monitoring occasion pair.
[0113] In some aspects, the UE 120 may determine a priority for selecting linked PDCCH candidates to drop based at least in part on the candidate index or AL of the linked PDCCH candidates. In some aspects, different priorities may be associated with different linked PDCCH candidate pairs based at least in part on the candidate index associated with the linked PDCCH candidate pair. In some aspects, different priorities may be associated with different linked PDCCH candidate pairs based at least in part on the AL associated with the linked PDCCH candidate pair. In some aspects, the UE 120 may drop (e.g., refrain from monitoring) one or more pairs of linked PDCCH candidates based at least in part on a priority associated with the one or more pairs of linked PDCCH candidates (e.g., a priority associated with the candidate index or a priority associated with the AL). For example, the UE 120 may select one or more lowest priority linked PDCCH candidate pairs to drop.
[0114] In some aspects, in connection with determining that the total number of occupied PPUs at a time does not meet the PPU limit associated with UE 120, UE 120 may select one or more linked PDCCH candidates among the linked PDCCH candidates to be unlinked. In this case, UE 120 may monitor the selected linked PDCCH candidates as unlinked PDCCH candidates (e.g., UE 120 may monitor the PDCCH candidates independently without soft combining). For example, UE 120 may determine that the total number of occupied PPUs does not meet the PPU limit associated with UE 120 for one or more symbols during a time period associated with one or more pairs of linked PDCCH candidates. In this case, UE 120 may monitor one or more linked PDCCH candidates among the linked PDCCH candidates in one or more pairs of linked PDCCH candidates, or other linked PDCCH candidates (e.g., in other linked PDCCH candidate pairs) having a time period overlapping with a time period of one or more pairs of linked PDCCH candidates, as unlinked PDCCH candidates. In some aspects, UE 120 may select one or more pairs of linked PDCCH candidates to monitor as unlinked PDCCH candidates in order for the total number of PPUs to satisfy the PPU limit associated with UE 120. In some aspects, because UE 120 independently monitors the selected PDCCH candidates that are unlinked, UE 120 may refrain from buffering soft demodulator outputs (e.g., LLR values) for the selected PDCCH candidates, resulting in a reduction in the total number of occupied PPUs.
[0115] In some aspects, the UE 120 may determine a priority of linked PDCCH candidates occupying PPUs at a time when the total number of PPUs does not meet the PPU limit associated with the UE 120, and the UE 120 may select a PDCCH candidate to be delinked based at least in part on the priority. In some aspects, if the PPU limit is across CCs, the UE 120 may determine a priority of the linked PDCCH candidates based at least in part (e.g., as a function of) the CC index. For example, linked PDCCH candidates on different CCs may be associated with different priorities. In this case, the UE 120 may select one or more linked PDCCH candidates to monitor as a PDCCH candidate to be delinked based at least in part on the priority associated with the CC of the one or more linked PDCCH candidates.
[0116] In some aspects, the UE 120 may determine a priority for selecting a linked PDCCH candidate to be unlinked based at least in part on an SS set index associated with the linked SS set pair associated with the linked PDCCH candidate. For example, the SS set index associated with the linked SS set pair may be the smaller SS set index of the SS indexes associated with the two linked SS sets. In some aspects, each SS set index may be associated with a separate priority. In some aspects, SS sets of different SS types (e.g., CSS or USS) may be associated with different priorities. In some aspects, the UE 120 may select a linked PDCCH candidate to monitor as a PDCCH candidate to be unlinked at the SS set level. For example, the UE 120 may select a linked PDCCH candidate in a linked SS set pair to monitor as an unlinked candidate based at least in part on a priority associated with the linked SS set pair (e.g., a priority associated with the SS set index associated with the linked SS set pair or a priority associated with the SS type associated with the linked SS set pair).
[0117] In some aspects, the UE 120 may determine a priority for selecting a linked PDCCH candidate to be unlinked based at least in part on a monitoring occasion index for a monitoring occasion of a pair of linked SS sets in a slot. For example, different monitoring occasion indexes may be associated with different priorities. In some aspects, the UE 120 may select a linked PDCCH candidate to monitor as an unlinked PDCCH candidate at a monitoring occasion level. For example, the UE 120 may select a linked PDCCH candidate in a linked monitoring occasion pair to monitor as an unlinked PDCCH candidate based at least in part on a priority associated with a monitoring occasion index of the linked monitoring occasion pair.
[0118] In some aspects, the UE 120 may determine a priority for selecting a linked PDCCH candidate to be unlinked based at least in part on a candidate index or an AL of the linked PDCCH candidate. In some aspects, different priorities may be associated with different linked PDCCH candidate pairs based at least in part on a candidate index associated with the linked PDCCH candidate pair. In some aspects, different priorities may be associated with different linked PDCCH candidate pairs based at least in part on an AL associated with the linked PDCCH candidate pair. In some aspects, the UE 120 may select one or more pairs of linked PDCCH candidates to monitor as unlinked PDCCH candidates based at least in part on a priority associated with one or more pairs of linked PDCCH candidates (e.g., a priority associated with a candidate index or a priority associated with an AL). For example, the UE 120 may select one or more lowest priority pairs of linked PDCCH candidates to monitor as unlinked PDCCH candidates.
[0119] As further shown in FIG. 6 and reference numeral 625, the base station 110 may transmit to the UE 120 one or more PDCCH communications including the DCI in one or more PDCCH candidates configured for the UE 120. In some aspects, the base station 110 may transmit a repeat PDCCH transmission including the same DCI in a linked PDCCH candidate pair in a linked monitoring occasion of a linked SS set pair. For example, the base station 110 may transmit a PDCCH communication including the DCI in a first PDCCH candidate in a monitoring occasion of a first SS set of the linked SS set pair, and the base station 110 may repeat the transmission of the same PDCCH communication including the same DCI in a second PDCCH candidate linked to the first PDCCH candidate (e.g., having the same AL and the same candidate index) in a monitoring occasion of a second SS set of the linked SS set pair. In some aspects, the UE 120 may monitor one or more pairs of linked PDCCH candidates for PDCCH repetition. For example, UE 120 may perform soft combining (e.g., LLR combining) of pairs of linked PDCCH candidates to decode DCI based at least in part on the combination of repeated PDCCH transmissions in pairs of linked PDCCH candidates. In some aspects, base station 110 may transmit one or more PDCCH communications without PDCCH repetitions in one or more unlinked PDCCH candidates (e.g., in one or more unlinked SS sets). In this case, UE 120 may decode DCI without soft combining.
[0120] In some aspects, the base station 110 may transmit a repetitive PDCCH communication with the same DCI on a pair of linked PDCCH candidates of a pair of linked SS sets based at least in part on a PPU limitation associated with the UE 120. For example, the base station 110 may calculate a total number of PPUs occupied by all of the linked PDCCH candidates at one or more time points for the UE 120, and the base station 110 may compare the total number of PPUs occupied at the one or more time points to the PPU limitation associated with the UE 120. In this case, the base station 110 may schedule and transmit a repetitive PDCCH communication based at least in part on whether the total number of PPUs occupied at the time point for the UE 120 meets the PPU limitation associated with the UE 120. In some aspects, in conjunction with determining that the total number of occupied PPUs meets the PPU limitation associated with the UE 120 at one or more time points, the base station 110 may transmit a repetitive PDCCH communication on any pair of linked PDCCH candidates scheduled for the one or more time points. In this case, UE 120 may decode the DCI by soft combining pairs of PDCCH candidates.
[0121] In some aspects, in connection with determining that the total number of PPUs occupied for UE 120 at a given time does not meet the PPU limit associated with UE 120, base station 110 may identify one or more linked PDCCH candidates to be dropped (e.g., not monitored). For example, base station 110 may identify one or more linked PDCCH candidates to be dropped based at least in part on a priority used by UE 120 to select the linked PDCCH candidates to be dropped. In this case, base station 110 may transmit repeated PDCCH communications on the pairs of linked PDCCH candidates that are not being dropped by UE 120, and base station 110 may refrain from transmitting repeated PDCCH communications on the linked PDCCH candidates that are being dropped by UE 120.
[0122] In some aspects, in connection with determining that the total number of PPUs occupied for UE 120 at a given time does not meet the PPU limit associated with UE 120, base station 110 may identify one or more linked PDCCH candidates to be unlinked (e.g., monitored as unlinked PDCCH candidates) by UE 120. For example, base station 110 may identify one or more linked PDCCH candidates to be unlinked based at least in part on a priority used by UE 120 to select the linked PDCCH candidates to be unlinked. In this case, base station 110 may transmit repeated PDCCH communications on the pair of linked PDCCH candidates that are not unlinked by UE 120, and base station 110 may refrain from transmitting repeated PDCCH communications on the linked PDCCH candidates that are monitored as unlinked PDCCH candidates by UE 120.
[0123] In some aspects, the DCI transmitted by base station 110 and decoded by UE 120 may schedule one or more downlink communications (e.g., PDSCH communications) from base station 110 to UE 120 and / or one or more uplink communications (e.g., PDSCH communications) from UE 120 to base station 110. In this case, base station 110 may transmit one or more downlink communications scheduled by the DCI, and UE 120 may receive the one or more downlink communications, and / or UE 120 may transmit one or more uplink communications scheduled by the DCI, and base station 110 may receive the one or more uplink communications.
[0124] As described above, the UE 120 may transmit to the base station 110 an indication of a PPU limit associated with the UE 120. The base station 110 may transmit to the UE 120 a configuration of a plurality of SS sets including one or more linked SS set pairs having linked PDCCH candidates for PDCCH repetitions. The UE 120 may selectively monitor linked PDCCH candidates in one or more linked SS set pairs based at least in part on a comparison of a total number of PPUs occupied by linked PDCCH candidates in all of the one or more pairs of linked search space sets to the PPU limit associated with the UE. As a result, the UE 120 may refrain from monitoring linked PDCCH candidates for PDCCH repetitions in any case where the PPU exceeds the PPU limit associated with the UE. This may reduce memory resource consumption by the UE 120 and / or improve reliability and latency of communications to and / or from the UE 120 (e.g., due to reduced DCI decoding errors).
[0125] As noted above, Figure 6 is provided as an example. Other examples may differ from what is described with respect to Figure 6.
[0126] 7 is a diagram illustrating an example 700 associated with complexity processing for PDCCH repetition in accordance with the present disclosure. As shown in FIG. 7, the example 700 includes communication between a base station 110 and a UE 120. In some aspects, the base station 110 and the UE 120 can be included in a wireless network, such as the wireless network 100 (e.g., as shown in FIG. 1). The base station 110 and the UE 120 can communicate via a wireless access link, which can include an uplink and a downlink.
[0127] 7 and reference numeral 705, the UE 120 may transmit to the base station 110 a UE capability report that includes an indication of a PPU limit associated with the UE 120. The PPU is a metric that represents the memory resources and / or complexity required for a pair of linked PDCCH candidates. For example, the PPU may represent the memory resources and / or complexity required to soft combine a pair of linked PDCCH candidates.
[0128] In some aspects, any pair of linked PDCCH candidates (e.g., any two PDCCH candidates that are linked to each other) occupies a number of PPUs over a time period associated with the linked PDCCH candidate pair. The linked PDCCH candidate pair may include a first PDCCH candidate in a first SS set of the linked SS set pair and a second PDCCH candidate linked to the first PDCCH candidate (e.g., having the same AL and the same candidate index) in a second SS set of the linked SS set pair. In some aspects, the number of PPUs occupied by the linked PDCCH candidate pair (e.g., the number of occupied PPUs for the linked PDCCH candidate pair) may be based at least in part on the AL associated with the linked PDCCH candidate pair. For example, an AL-dependent factor may be applied to determine the number of PPUs occupied by the linked PDCCH candidate pair. In some aspects, the number of PPUs occupied by a pair of linked PDCCH candidates may be equal to an AL (e.g., 1, 2, 4, 8, or 16) associated with the pair of linked PDCCH candidates. In some aspects, the number of PPUs occupied by a pair of linked PDCCH candidates may be equal to or based at least in part on a mother code length (e.g., circular buffer size) of the AL associated with the pair of linked PDCCH candidates. For example, the mother code lengths (e.g., circular buffer sizes) for AL=1, 2, 4, 8, and 16 may be equal to 128, 256, 512, 512, and 512, respectively.Thus, when the number of PPUs occupied by a linked PDCCH candidate pair is based at least in part on (or equal to) the mother code length at the AL level, the number of occupied PPUs for a linked PDCCH candidate pair with AL=4 (e.g., mother code length=512) may be greater than the number of occupied PPUs for a linked PDCCH candidate pair with AL=2 (e.g., mother code length=256), but because the mother code length (e.g., 512) is the same for AL=4 and AL=16, the number of occupied PPUs for a linked PDCCH candidate pair with AL=4 and a linked PDCCH candidate pair with AL=16 may be the same.
[0129] In some aspects, for a linked PDCCH candidate pair including a first PDCCH candidate and a second PDCCH candidate, a time period (e.g., an occupancy period) associated with the PDCCH candidate pair may be based at least in part on one or more symbols associated with the first PDCCH candidate and one or more symbols associated with the second PDCCH candidate. In some aspects, the time period of the PDCCH candidate pair may last from a beginning of a first symbol associated with the first PDCCH candidate (e.g., an earlier PDCCH candidate in time) to an end of a last symbol associated with the second PDCCH candidate (e.g., a later PDCCH candidate in time). In some aspects, the time period of the PDCCH candidate pair may last from an end of a last symbol associated with the first PDCCH candidate (e.g., an earlier PDCCH candidate in time) to an end of a last symbol associated with the second PDCCH candidate (e.g., a later PDCCH candidate in time). In some aspects, a period of a PDCCH candidate pair may last from a beginning of a first symbol associated with a first PDCCH candidate (e.g., an earlier PDCCH candidate in time) to a beginning of a first symbol associated with a second PDCCH candidate (e.g., a later PDCCH candidate in time). In some aspects, a period of a PDCCH candidate pair may last from an end of a last symbol associated with a first PDCCH candidate (e.g., an earlier PDCCH candidate in time) to a beginning of a first symbol associated with a second PDCCH candidate (e.g., a later PDCCH candidate in time).
[0130] At a given time (time t), the total number of occupied PPUs may be based on the occupied PPUs across all linked PDCCH candidate pairs (e.g., across all linked monitoring occasions of all linked SS sets) that have associated occupation periods that include time t. For example, for each pair of linked PDCCH candidates (e.g., across all linked monitoring occasions of all linked SS sets), if the period associated with the linked PDCCH candidate pair includes time t, then the number of PPUs occupied by the linked PDCCH candidate pair may be included in the total number of occupied PPUs at time t.
[0131] The UE 120 may transmit an indication of a PPU restriction associated with the UE 120 to the base station 110. In some aspects, the indication of the PPU restriction may be an indication of the capabilities of the UE 120 indicating a maximum number of PPUs that the UE 120 can support. In some aspects, the PPU restriction may be a PPU restriction configured to a number of PPUs other than the maximum number of PPUs that the UE 120 can support. In some aspects, the indication of the PPU restriction may include an indication of an individual PPU restriction (e.g., a maximum number of PPUs) per CC. For example, the indication may include a PPU restriction for each of one or more CCs. As another example, the indication of the PPU restriction may be applied individually per CC (e.g., the indication may include one PPU restriction applied per CC). Additionally or alternatively, the indication of the PPU restriction may include an indication of a PPU restriction (e.g., a maximum number of PPUs) across all CCs. For example, in this case, the PPU restriction may be for a total number of PPUs across one or more CCs. In some aspects, the indication of the PPU limit may include an indication of a respective PPU limit for one or more CCs, and the UE 120 and the base station 110 may each derive a total PPU limit across all CCs based at least in part on the respective PPU limits for the CCs. For example, the respective PPU limits for the CCs may include a PPU limit per CC (e.g., a maximum number of PPUs), and the total PPU limit across all of the CCs (e.g., a maximum number of PPUs) may be derived by multiplying the PPU limit per CC by a factor. In some aspects, the factor may be equal to the UE's capability for blind detection (e.g., pdcch-BlinddetectionCA), which may also be used to determine the maximum number of blind decodings across all of the CCs (e.g., a maximum number of monitored candidates).
[0132] In some aspects, the UE 120 may indicate a PPU limit for different subcarrier spacings (SCSs) separately. For example, the indication of the PPU limit may include an individual PPU limit (e.g., a maximum number of PPUs) for each of one or more SCSs (e.g., 15 kHz, 30 kHz, 60 kHz, 120 kHz, 240 kHz, 480 kHz, and / or 960 kHz, among other examples). In some aspects, the UE 120 may transmit an indication of the PPU limit to the base station 110 in a UE capability report (e.g., via an RRC message or MAC-CE).
[0133] As further shown in FIG. 7 and by reference numeral 710, base station 110 can transmit a configuration of linked SS sets to UE 120. In some aspects, base station 110 can transmit a configuration of multiple SS sets of PDCCH candidates, and UE 120 can receive the configuration, where the multiple SS sets can include one or more linked SS set pairs. One or more linked SS set pairs can include linked PDCCH candidates for PDCCH repetitions (e.g., in linked monitoring occasions). In some aspects, base station 110 can transmit the configuration of SS sets (including linked SS sets) to UE 120 in one or more RRC messages. In some aspects, the configuration of linked SS set pairs can include an SS set configuration of SS sets and a linking configuration that configures linking between the linked SS set pairs.
[0134] In some aspects, base station 110 may determine a configuration of linked SS set pairs based at least in part on an indication of a PPU restriction associated with UE 120 received from UE 120. In some aspects, UE 120 may not expect that the total number of PPUs occupied by all of the linked PDCCH candidates at any time does not meet (e.g., exceeds) the PPU restriction associated with UE 120. In this case, the total number of PPUs occupied by all of the linked PDCCH candidates (e.g., across all of the configured linked SS set pairs) may be required to meet (e.g., be less than or equal to) the PPU restriction associated with UE 120. For example, base station 110 may determine a configuration of linked SS set pairs based at least in part on an indication of a PPU restriction associated with UE 120, and base station 110 may ensure (required to ensure) that the configuration of linked SS set pairs (e.g., SS set configuration and / or linking configuration) results in the PPU restriction associated with UE 120 being met for UE 120 at all times. In some aspects, if a per-CC PPU limit is indicated by UE 120, base station 110 can determine a configuration of linked SS set pairs to ensure that the per-CC PPU limit is always met for each CC. In some aspects, if a total PPU limit across all CCs is indicated by UE 120 (or is derived based at least in part on the per-CC PPU limit), base station 110 can determine a configuration of linked SS set pairs to ensure that the total PPU limit across all CCs is always met for UE 120.
[0135] As further shown in FIG. 7 and reference numeral 715, UE 120 may monitor linked PDCCH candidates at linked monitoring occasions of linked SS sets based at least in part on the configuration of the linked SS sets. In some aspects, UE 120 may not expect that the total number of PPUs occupied by all of the linked PDCCH candidates at any time does not meet (e.g., exceeds) the PPU limit associated with UE 120. In this case, the total number of PPUs occupied by all of the linked PDCCH candidates (e.g., across all of the configured linked SS set pairs) may be required to meet (e.g., be less than or equal to) the PPU limit associated with UE 120. As mentioned above, in some aspects, base station 110 may be required to ensure that the PPU limit associated with UE 120 is always met for UE 120 due to the configuration of the linked SS set pairs. In this case, UE 120 may monitor linked PDCCH candidates (e.g., in a pair of linked monitoring occasions of a pair of linked SS sets) for PDCCH repetitions based at least in part on the configuration received from base station 110. In some aspects, UE 120 may determine that an error case has occurred in connection with UE 120 determining that the total number of occupied PPUs at a given time does not meet a PPU limit associated with UE 120.
[0136] As further shown in FIG. 7 and reference numeral 720, the base station 110 may transmit to the UE 120 one or more PDCCH communications including the DCI in one or more PDCCH candidates configured for the UE 120. In some aspects, the base station 110 may transmit a repeat PDCCH transmission including the same DCI in a linked PDCCH candidate pair in a linked monitoring occasion of a linked SS set pair. For example, the base station 110 may transmit a PDCCH communication including the DCI in a first PDCCH candidate in a monitoring occasion of a first SS set of the linked SS set pair, and the base station 110 may repeat the transmission of the same PDCCH communication including the same DCI in a second PDCCH candidate linked to the first PDCCH candidate (e.g., having the same AL and the same candidate index) in a monitoring occasion of a second SS set of the linked SS set pair. In some aspects, the UE 120 may monitor one or more pairs of linked PDCCH candidates for PDCCH repetition. For example, UE 120 may perform soft combining (e.g., LLR combining) of pairs of linked PDCCH candidates to decode DCI based at least in part on the combination of repeated PDCCH transmissions in pairs of linked PDCCH candidates. In some aspects, base station 110 may transmit one or more PDCCH communications without PDCCH repetitions in one or more unlinked PDCCH candidates (e.g., in one or more unlinked SS sets). In this case, UE 120 may decode DCI without soft combining.
[0137] In some aspects, the DCI transmitted by base station 110 and decoded by UE 120 may schedule one or more downlink communications (e.g., PDSCH communications) from base station 110 to UE 120 and / or one or more uplink communications (e.g., PDSCH communications) from UE 120 to base station 110. In this case, base station 110 may transmit one or more downlink communications scheduled by the DCI, and UE 120 may receive the one or more downlink communications, and / or UE 120 may transmit one or more uplink communications scheduled by the DCI, and base station 110 may receive the one or more uplink communications.
[0138] As described above, UE 120 may transmit to base station 110 an indication of a PPU limit associated with UE 120. Base station 110 may transmit to UE 120 a configuration of multiple SS sets including one or more linked SS set pairs having linked PDCCH candidates for PDCCH repetitions. The configuration of the one or more linked SS set pairs may be based at least in part on a PPU limit associated with the UE. Linked PDCCH candidates in one or more linked SS set pairs may be monitored based at least in part on the configuration of the one or more linked SS set pairs. As a result, the linked PDCCH candidates monitored by UE 120 for PDCCH repetitions may not exceed the PPU limit associated with UE 120. This may reduce memory resource consumption by UE 120 and / or improve reliability and latency of communications to and / or from UE 120 (e.g., due to reduced DCI decoding errors).
[0139] As noted above, Figure 7 is provided as an example. Other examples may differ from what has been described in relation to Figure 7.
[0140] 8 is a diagram illustrating an example 800 associated with complexity processing for PDCCH repetitions in accordance with the present disclosure. As shown in FIG. 8, the example 800 illustrates an example pair of linked PDCCH candidates including a first PDCCH candidate in a monitoring occasion of a first SS set (SS Set A) and a second PDCCH candidate in a monitoring occasion of a second SS set (SS Set B).
[0141] A pair of linked PDCCH candidates may occupy multiple PPUs over a time period associated with the linked PDCCH candidate pair. In some aspects, a time period (e.g., an occupancy period) associated with a pair of PDCCH candidates may be based at least in part on one or more symbols associated with a first PDCCH candidate (e.g., one or more symbols associated with a monitoring occasion of SS set A) and one or more symbols associated with a second PDCCH candidate (e.g., one or more symbols associated with a monitoring occasion of SS set B). In some aspects, as indicated by reference numeral 805, a time period of a pair of PDCCH candidates may run from a beginning of a first symbol associated with a first PDCCH candidate (e.g., a first symbol of a monitoring occasion of SS set A) to an end of a last symbol associated with a second PDCCH candidate (e.g., a last symbol of a monitoring occasion of SS set B). In some aspects, a period of a PDCCH candidate pair may last from the end of the last symbol associated with a first PDCCH candidate (e.g., the last symbol of the monitoring occasion for SS Set A) to the end of the last symbol associated with a second PDCCH candidate (e.g., the last symbol of the monitoring occasion for SS Set B) as indicated by reference numeral 810. In some aspects, a period of a PDCCH candidate pair may last from the beginning of the first symbol associated with a first PDCCH candidate (e.g., the first symbol of the monitoring occasion for SS Set A) to the beginning of the first symbol associated with a second PDCCH candidate (e.g., the first symbol of the monitoring occasion for SS Set B) as indicated by reference numeral 815. In some aspects, as indicated by reference numeral 820, the period of a pair of PDCCH candidates may last from the end of the last symbol associated with a first PDCCH candidate (e.g., the last symbol of the monitoring occasion for SS Set A) to the beginning of the first symbol associated with a second PDCCH candidate (e.g., the first symbol of the monitoring occasion for SS Set B).
[0142] As noted above, Figure 8 is provided as an example. Other examples may differ from what has been described in relation to Figure 8.
[0143] 9A-9B are diagrams illustrating examples 900, 910, 920, 930, 940, 950, and 960 associated with complexity processing for PDCCH repetitions according to the present disclosure. As shown in FIG. 9A-9B, examples 900, 910, 920, 930, 940, 950, and 960 illustrate examples of calculating an occupied PPU for a UE. As discussed above, a pair of linked PDCCH candidates may occupy multiple PPUs over a time period associated with the linked PDCCH candidate pair. In examples 900, 910, 920, 930, 940, 950, and 960, it is assumed that each pair of linked PDCCH candidates occupies one PPU over a time period associated with the linked PDCCH candidate pair. Further, in examples 900, 910, 920, 930, 940, 950, and 960, the duration of each PDCCH candidate pair runs from the beginning of the first symbol associated with the first PDCCH candidate to the end of the last symbol associated with the second PDCCH candidate.
[0144] 9A, example 900 illustrates a case where both a first monitoring occasion of a first SS set (SS set A) and a first monitoring occasion of a second SS set (SS set B) occur before a second monitoring occasion. As shown in example 900, 3 PPUs are occupied during the period between the first monitoring occasion of SS set A and SS set B, 3 PPUs are occupied during the period between the second monitoring occasion of SS set A and SS set B, and 0 PPUs are occupied for the symbol between the first monitoring occasion of SS set B and the second monitoring occasion of SS set A and the symbol after the second monitoring occasion of SS set B.
[0145] As further shown in FIG. 9A, example 910 illustrates a case where the second monitoring of SS set A occurs before the first monitoring of SS set B. As shown in example 910, a total of 3 PPUs are occupied during the period from the first monitoring occasion of SS set A to the second monitoring occasion of SS set A. A total of 6 PPUs are occupied during the period from the second monitoring occasion of SS set A to the end of the first monitoring occasion of SS set B. A total of 3 PPUs are occupied during the period from the end of the first monitoring occasion of SS set B to the end of the second monitoring occasion of SS set B, and 0 PPUs are occupied after the second monitoring occasion of SS set B.
[0146] 9A, example 920 illustrates a case where SS Set A and SS Set B have eight linked PDCCH candidate pairs. As shown in example 920, a total of eight PPUs are occupied during the period between the first monitoring occasion of SS Set A and the first monitoring occasion of SS Set B, and zero PPUs are occupied after the first monitoring occasion of SS Set B.
[0147] As shown in FIG. 9B, examples 930, 940, 950, and 960 show the case where a first SS set (SS set A) is linked to a second SS set (SS set B) and a third SS set (SS set C) is linked to a fourth SS set (SS set D). As shown in FIG. 9B, example 930 shows the case where a first monitoring occasion of SS set C is scheduled between a first monitoring occasion of SS set A and a first monitoring occasion of SS set B. As shown in example 930, a total of three PPUs are occupied during the period from the first monitoring occasion of SS set A to the first monitoring occasion of SS set C. A total of six PPUs are occupied during the period from the first monitoring occasion of SS set C to the end of the first monitoring occasion of SS set B. A total of three PPUs are occupied during the period from the end of the first monitoring occasion of SS set B to the end of the first monitoring occasion of SS set D. After the first monitoring occasion of SS set D, 0 PPUs are occupied.
[0148] As further shown in FIG. 9B, example 940 illustrates a case where the first monitoring occasion of SS set C and the first monitoring occasion of SS set D are scheduled between the first monitoring occasion of SS set A and the first monitoring occasion of SS set B. As shown in example 940, a total of 3 PPUs are occupied during the period from the first monitoring occasion of SS set A to the first monitoring occasion of SS set C. A total of 6 PPUs are occupied during the period between the first monitoring occasion of SS set C and the first monitoring occasion of SS set D. A total of 3 PPUs are occupied during the period from the first monitoring occasion of SS set D to the end of the first monitoring occasion of SS set B. 0 PPUs are occupied after the first monitoring occasion of SS set B.
[0149] As further shown in Figure 9B, example 950 illustrates a case where the first monitoring occasion of SS set A and the first monitoring occasion of SS set C are scheduled in the same symbol in a slot, and the first symbol of the first monitoring occasions of SS set A and SS set C are scheduled before the first monitoring occasion of SS set B. As shown in example 950, a total of 6 PPUs are occupied during the period between the first monitoring occasion of SS set C and the first monitoring occasion of SS set D. A total of 3 PPUs are occupied during the period from the first monitoring occasion of SS set D to the end of the first monitoring occasion of SS set B, and 0 PPUs are occupied after the first monitoring occasion of SS set B.
[0150] As further shown in FIG. 9B, example 960 illustrates a case where the first monitoring occasion of SS set C is scheduled between the first monitoring occasion of SS set A and the first monitoring occasion of SS set B, and the first monitoring occasion of SS set D is scheduled to start in the same symbol as the first monitoring occasion of SS set B. As shown in example 960, a total of 3 PPUs are occupied during the period from the first monitoring occasion of SS set A to the first monitoring occasion of SS set C. A total of 6 PPUs are occupied during the period between the start of the first monitoring occasion of SS set C and the end of the first monitoring occasion of SS set D. A total of 3 PPUs are occupied during the period from the end of the first monitoring occasion of SS set D to the end of the first monitoring occasion of SS set B. 0 PPUs are occupied after the first monitoring occasion of SS set B.
[0151] As noted above, Figures 9A and 9B are provided as examples, and other examples may differ from those described in connection with Figures 9A and 9B.
[0152] 10 illustrates an example process 1000 performed, for example, by a UE, in accordance with the present disclosure. The example process 1000 is an example of a UE (e.g., UE 120) performing operations associated with complexity processing for repetitions of a downlink control channel.
[0153] 10, in some aspects, process 1000 may include transmitting an indication of a PPU limit associated with the UE to a network node (block 1010). For example, the UE may transmit (e.g., using the communications manager 140 and / or the transmitting component 1604 shown in FIG. 16) an indication of a PPU limit associated with the UE to a network node, as described above.
[0154] 10, in some aspects, the process 1000 includes receiving from a network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets with linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU limitation associated with the UE. For example, the UE (e.g., using the communications manager 140 and / or the transmitting component 1602 shown in FIG. 16) may receive from a network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets with linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU limitation associated with the UE.
[0155] Process 1000 may include additional aspects, such as any single aspect or any combination of aspects described below and / or in conjunction with one or more other processes described elsewhere herein.
[0156] In a first aspect, the process 1000 includes monitoring linked PDCCH candidates in one or more pairs of linked search space sets based at least in part on a configuration of the one or more pairs of linked search space sets.
[0157] In a second aspect, alone or in combination with the first aspect, process 1000 includes calculating a total number of PPUs occupied by linked PDCCH candidates in all of one or more pairs of linked search space sets at one or more time points associated with a pair of linked monitoring occasions associated with the one or more pairs of linked search space sets.
[0158] In a third aspect, alone or in combination with the first and second aspects, the linked PDCCH candidates include one or more pairs of linked PDCCH candidates, each pair of linked PDCCH candidates of the one or more pairs of linked PDCCH candidates includes a first PDCCH candidate in a first search space set linked to a second PDCCH candidate in a second search space set, and each pair of linked PDCCH candidates occupies a number of PPUs over a period associated with the linked PDCCH candidate pair.
[0159] In a fourth aspect, either alone or in combination with the first to third aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on an aggregation level associated with the linked PDCCH candidate pair.
[0160] In a fifth aspect, alone or in combination with one or more of the first to fourth aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on the mother code length of the aggregation level associated with the linked PDCCH candidate pair.
[0161] In a sixth aspect, either alone or in combination with the first to fifth aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is equal to a first value associated with an aggregation level 1 associated with the linked PDCCH candidate pair, a second value greater than the first value associated with an aggregation level 2 associated with the linked PDCCH candidate pair, or a third value greater than the second value associated with an aggregation level 4, 8, or 16 associated with the linked PDCCH candidate pair.
[0162] In a seventh aspect, either alone or in combination with the first to sixth aspects, for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair is based at least in part on one or more symbols associated with a first PDCCH candidate of the linked PDCCH candidate pair and one or more symbols associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0163] In an eighth aspect, alone or in combination with one or more of the first to seventh aspects, for each pair of linked PDCCH candidates, the period associated with that linked PDCCH candidate pair runs from the end of the last symbol associated with the first PDCCH candidate of that linked PDCCH candidate pair to the end of the last symbol associated with the second PDCCH candidate of that linked PDCCH candidate pair.
[0164] In a ninth aspect, either alone or in combination with the first to eighth aspects, the indication of a PPU limitation associated with the UE includes an indication of a PPU limitation for each of the one or more component carriers.
[0165] In a tenth aspect, either alone or in combination with the first to ninth aspects, the indication of a PPU restriction associated with the UE indicates a PPU restriction on a number of PPUs across one or more component carriers.
[0166] In an eleventh aspect, either alone or in combination with the first to tenth aspects, the indication of a PPU limit associated with the UE includes an individual PPU limit for each of the one or more subcarrier spacings.
[0167] In a twelfth aspect, either alone or in combination with the first to eleventh aspects, the total number of PPUs occupied by linked PDCCHs in all one or more pairs of linked search space sets is required to satisfy a PPU limitation associated with the UE.
[0168] In a thirteenth aspect, either alone or in combination with the first to twelfth aspects, the process 1000 includes monitoring one or more linked PDCCH candidates for PDCCH repetitions in a linked monitoring occasion pair in connection with determining that a total number of PPUs occupied by linked PDCCHs in all of one or more pairs of linked search space sets satisfies a PPU limit associated with the UE during a time period associated with the one or more linked PDCCH candidates in the linked PDCCH candidates.
[0169] 10 illustrates example blocks of process 1000, in some aspects process 1000 may include additional, fewer, different, or differently ordered blocks compared to the blocks illustrated in FIG 10. Additionally or alternatively, two or more of the blocks of process 1000 may be performed in parallel.
[0170] 11 illustrates an example process 1100 implemented, for example, by a UE, in accordance with the present disclosure. The example process 1100 is an example in which a UE (e.g., UE 120) performs operations associated with a complexity for a repetition of a PDCCH.
[0171] 11, in some aspects, process 1100 may include transmitting an indication of a PPU limit associated with the UE to a network node (block 1110). For example, the UE (e.g., using the communications manager 140 and / or the transmitting component 1604 shown in FIG. 16) may transmit an indication of a PPU limit associated with the UE to a network node, as described above.
[0172] 11, in some aspects, the process 1100 may include receiving a configuration of a plurality of search space sets, the plurality of search space sets including one or more pairs of linked search space sets with linked PDCCH candidates for PDCCH repetitions. For example, the UE may receive a configuration of a plurality of search space sets for PDCCH candidates from a network node (e.g., using the communications manager 140 and / or the receiving component 1602 shown in FIG. 16), the plurality of search space sets including one or more pairs of linked search space sets with linked PDCCH candidates for PDCCH repetitions, as discussed above.
[0173] 11, in some aspects, the process 1100 may include selectively monitoring one or more of the linked PDCCH candidates in a pair of linked monitoring occasions associated with the pair of linked search space sets of the one or more pairs of linked search space sets based at least in part on a comparison of a total number of PPUs occupied by the linked PDCCH candidates in all of the one or more pairs of linked search space sets to a PPU limit associated with the UE. For example, the UE may (e.g., using the communications manager 140 and / or the monitoring component 1608 shown in FIG. 16) selectively monitor one or more of the linked PDCCH candidates in a pair of linked monitoring occasions associated with the pair of linked search space sets of the one or more pairs of linked search space sets based at least in part on a comparison of a total number of PPUs occupied by the linked PDCCH candidates in all of the one or more pairs of linked search space sets to a PPU limit associated with the UE.
[0174] Process 1100 may include additional aspects, such as any single aspect or any combination of aspects described below and / or in conjunction with one or more other processes described elsewhere herein.
[0175] In a first aspect, the process 1100 includes calculating a total number of PPUs occupied by linked PDCCH candidates in all of the one or more linked pairs of a search space set at one or more time points associated with the linked monitoring occasion pair, and selectively monitoring one or more of the linked PDCCH candidates in the monitoring occasion is based at least in part on a comparison of the calculated total number of PPUs at the one or more time points associated with the linked monitoring occasion pair to a PPU limit associated with the UE.
[0176] In a second aspect, alone or in combination with the first aspect, the linked PDCCH candidates include one or more pairs of linked PDCCH candidates, each pair of linked PDCCH candidates of the one or more pairs of linked PDCCH candidates includes a first PDCCH candidate in a first search space set linked to a second PDCCH candidate in a second search space set, and each pair of linked PDCCH candidates occupies a number of PPUs over a time period associated with the linked PDCCH candidate pair.
[0177] In a third aspect, alone or in combination with one or more of the first and second aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on an aggregation level associated with the linked PDCCH candidate pair.
[0178] In a fourth aspect, either alone or in combination with one or more of the first to third aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is equal to the aggregation level associated with the linked PDCCH candidate pair.
[0179] In a fifth aspect, alone or in combination with one or more of the first to fourth aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on the mother code length of the aggregation level associated with the linked PDCCH candidate pair.
[0180] In a sixth aspect, either alone or in combination with one or more of the first to fifth aspects, for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair is based at least in part on one or more symbols associated with a first PDCCH candidate of the linked PDCCH candidate pair and one or more symbols associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0181] In a seventh aspect, alone or in combination with one or more of the first to sixth aspects, for each pair of linked PDCCH candidates, the time period associated with that linked PDCCH candidate pair runs from the start of the first symbol associated with the first PDCCH candidate of that linked PDCCH candidate pair to the end of the last symbol associated with the second PDCCH candidate of that linked PDCCH candidate pair.
[0182] In an eighth aspect, alone or in combination with one or more of the first to seventh aspects, for each pair of linked PDCCH candidates, the period associated with that linked PDCCH candidate pair runs from the end of the last symbol associated with the first PDCCH candidate of that linked PDCCH candidate pair to the end of the last symbol associated with the second PDCCH candidate of that linked PDCCH candidate pair.
[0183] In a ninth aspect, alone or in combination with one or more of the first to eighth aspects, for each pair of linked PDCCH candidates, the time period associated with the linked PDCCH candidate pair runs from the beginning of a first symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to the beginning of a first symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0184] In a tenth aspect, alone or in combination with one or more of the first to ninth aspects, for each pair of linked PDCCH candidates, the time period associated with the linked PDCCH candidate pair runs from the end of the last symbol associated with the first PDCCH candidate of the linked PDCCH candidate pair to the beginning of the last symbol associated with the second PDCCH candidate of the linked PDCCH candidate pair.
[0185] In an eleventh aspect, alone or in combination with one or more of the first to tenth aspects, the indication of a PPU limit associated with the UE includes an indication of a respective PPU limit for one or more component carriers.
[0186] In a twelfth aspect, alone or in combination with one or more of the first through eleventh aspects, the process 1100 includes deriving a total PPU limit across all of the one or more component carriers based at least in part on the PPU limits of each of the one or more component carriers.
[0187] In a thirteenth aspect, alone or in combination with one or more of the first to twelfth aspects, the indication of a PPU restriction associated with the UE indicates a PPU restriction on a number of PPUs across one or more component carriers.
[0188] In a fourteenth aspect, alone or in combination with one or more of the first to thirteenth aspects, the indication of a PPU limit associated with the UE includes a respective PPU limit for each of the one or more subcarrier spacings.
[0189] In a fifteenth aspect, selectively monitoring one or more linked PDCCH candidates among the linked PDCCH candidates in a pair of linked monitoring occasions, alone or in combination with one or more of the first to fourteenth aspects, includes monitoring one or more linked PDCCH candidates among the PDCCH candidates for PDCCH repetitions in the pair of linked monitoring occasions, wherein a total number of PPUs occupied by the linked PDCCHs in all of the one or more search space set pairs is required to satisfy a PPU limitation associated with the UE.
[0190] In a sixteenth aspect, either alone or in combination with one or more of the first to fifteenth aspects, selectively monitoring one or more linked PDCCH candidates of the linked PDCCH candidates in a linked monitoring occasion pair includes monitoring one or more linked PDCCH candidates of the linked PDCCH candidates for PDCCH repetitions in the linked monitoring occasion pair in connection with a determination that a total number of PPUs occupied by linked PDCCHs in all of the one or more pairs of linked search space sets satisfies a PPU limitation associated with the UE during a time period associated with the one or more linked PDCCH candidates of the linked PDCCH candidates.
[0191] In a seventeenth aspect, either alone or in combination with one or more of the first to sixteenth aspects, selectively monitoring one or more of the linked PDCCH candidates in a pair of linked monitoring occasions includes refraining from monitoring one or more of the linked PDCCH candidates in a pair of linked monitoring occasions in connection with a determination that a total number of PPUs occupied by linked PDCCHs in all of the one or more pairs of linked search space sets during a time period associated with the one or more of the linked PDCCH candidates does not satisfy a PPU limitation associated with the UE.
[0192] In an 18th aspect, alone or in combination with one or more of the 1st to 17th aspects, refraining from monitoring one or more PDCCH candidates among the one or more linked PDCCH candidates in a pair of linked monitoring occasions includes refraining from monitoring the one or more PDCCH candidates in connection with a determination that a total number of occupied PPUs does not satisfy a PPU limit associated with the UE based at least in part on a priority associated with a component carrier of the PDCCH candidates.
[0193] In a 19th aspect, alone or in combination with one or more of the first to eighteenth aspects, refraining from monitoring one or more linked PDCCH candidates in a linked monitoring occasion pair includes refraining from monitoring the linked search space set pair in connection with a determination that a total number of occupied PPUs does not satisfy a PPU limit associated with the UE based at least in part on a priority associated with the linked search space set pair.
[0194] In a twentieth aspect, alone or in combination with one or more of the first to nineteenth aspects, refraining from monitoring one or more of the linked PDCCH candidates in a linked monitoring occasion pair includes refraining from monitoring the linked monitoring occasion pair in connection with a determination that a total number of occupied PPUs does not satisfy a PPU limit associated with the UE based at least in part on a priority associated with the linked monitoring occasion pair.
[0195] In a twenty-first aspect, alone or in combination with one or more of the first to twentieth aspects, refraining from monitoring one or more PDCCH candidates among the one or more linked PDCCH candidates in a pair of linked monitoring occasions includes selecting a PDCCH candidate to refrain from monitoring from the one or more linked PDCCH candidates based at least in part on respective priorities associated with the one or more linked PDCCH candidates among the linked PDCCH candidates.
[0196] In a 22nd aspect, either alone or in combination with one or more of the 1st to 21st aspects, selectively monitoring one or more of the linked PDCCH candidates in a linked monitoring occasion pair includes separately monitoring one or more of the linked PDCCH candidates in the linked monitoring occasion pair as unlinked PDCCH candidates in connection with a determination that a total number of PPUs occupied by linked PDCCHs in all of the linked pairs of one or more search space sets does not satisfy a PPU limitation associated with the UE during a time period associated with the one or more of the linked PDCCH candidates.
[0197] 11 illustrates example blocks of process 1100, in some aspects process 1100 may include additional, fewer, different, or differently ordered blocks compared to the blocks illustrated in FIG 11. Additionally or alternatively, two or more of the blocks of process 1100 may be performed in parallel.
[0198] 12 illustrates an example process 1200 implemented, for example, by a UE, in accordance with the present disclosure. The example process 1200 is an example of a UE (for example, the UE 120) performing operations related to a PRACH procedure.
[0199] 12, in some aspects, process 1200 may include receiving, in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of a UE capability to support linked monitoring occasions between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring linked PDCCH candidates. For example, the UE may transmit (e.g., using communications manager 140 and / or transmitting component 1604 shown in FIG. 16) to a network node, in the first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of the UE capability to support linked monitoring occasions between two other linked monitoring occasions in the second pair of linked monitoring occasions for monitoring linked PDCCH candidates.
[0200] 12, in some aspects, process 1200 may include receiving a configuration of a plurality of search space sets for monitoring PDCCH candidates based at least in part on an indication of the UE capability to support linked monitoring occasions between two other linked monitoring occasions. For example, the UE may receive (e.g., using communications manager 140 and / or receiving component 1602 shown in FIG. 16) from a network node a configuration of a plurality of search space sets for monitoring PDCCH candidates based at least in part on an indication of the UE capability to support linked monitoring occasions between two other linked monitoring occasions, as described above.
[0201] Process 1200 may include additional aspects, such as any single aspect or any combination of aspects described below and / or with respect to one or more other processes described elsewhere herein.
[0202] 12 illustrates example blocks of process 1200, in some aspects process 1200 may include additional, fewer, different, or differently ordered blocks compared to the blocks illustrated in FIG 12. Additionally or alternatively, two or more of the blocks of process 1200 may be performed in parallel.
[0203] 13 illustrates an example process 1300 performed, for example, by a network node, in accordance with the present disclosure. The example process 1300 is an example in which a network node (e.g., base station 110) performs operations associated with complexity processing for repetitions of a physical downlink control channel.
[0204] 13, in some aspects, process 1300 may include receiving from the UE an indication of a PPU restriction associated with the UE (block 1310). For example, the network node may receive from the UE an indication of a PPU restriction associated with the UE (e.g., using the communications manager 150 and / or the receiving component 1702 shown in FIG. 17) as described above.
[0205] 13, in some aspects, the process 1300 includes transmitting a configuration of a plurality of search space sets for PDCCH candidates to the UE, the plurality of search space sets including one or more pairs of linked search space sets with linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU limitation associated with the UE. For example, the network node may transmit (e.g., using the communications manager 150 and / or the transmitting component 1704 illustrated in FIG. 17) a configuration of a plurality of search space sets for PDCCH candidates to the UE, the plurality of search space sets including one or more pairs of linked search space sets with linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on a PPU limitation associated with the UE.
[0206] Process 1300 may include additional aspects, such as any single aspect or any combination of aspects described below and / or in conjunction with one or more other processes described elsewhere herein.
[0207] In a first aspect, process 1300 may include transmitting a repeat PDCCH transmission to the UE in the linked PDCCH candidates based at least in part on a configuration of one or more pairs of linked search space sets.
[0208] In a second aspect, alone or in combination with the first aspect, the linked PDCCH candidates include one or more pairs of linked PDCCH candidates, each pair of linked PDCCH candidates of the one or more pairs of linked PDCCH candidates includes a first PDCCH candidate in a first search space set linked to a second PDCCH candidate in a second search space set, and each pair of linked PDCCH candidates occupies a number of PPUs over a time period associated with the linked PDCCH candidate pair.
[0209] In a third aspect, alone or in combination with one or more of the first and second aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on an aggregation level associated with the linked PDCCH candidate pair.
[0210] In a fourth aspect, alone or in combination with one or more of the first to third aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on the mother code length of the aggregation level associated with the linked PDCCH candidate pair.
[0211] In a fifth aspect, either alone or in combination with one or more of the first to fourth aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is equal to a first value associated with an aggregation level 1 associated with the linked PDCCH candidate pair, a second value associated with an aggregation level 2 associated with the linked PDCCH candidate pair that is greater than the first value, or a third value associated with an aggregation level 4, 8, or 16 associated with the linked PDCCH candidate pair that is greater than the second value.
[0212] In a sixth aspect, either alone or in combination with one or more of the first to fifth aspects, for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair is based at least in part on one or more symbols associated with a first PDCCH candidate of the linked PDCCH candidate pair and one or more symbols associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0213] In a seventh aspect, alone or in combination with one or more of the first to sixth aspects, for each pair of linked PDCCH candidates, the period associated with that linked PDCCH candidate pair runs from the end of the last symbol associated with the first PDCCH candidate of that linked PDCCH candidate pair to the end of the last symbol associated with the second PDCCH candidate of that linked PDCCH candidate pair.
[0214] In an eighth aspect, alone or in combination with one or more of the first to seventh aspects, the indication of a PPU limit associated with the UE includes an indication of a respective PPU limit for one or more component carriers.
[0215] In a ninth aspect, either alone or in combination with one or more of the first to eighth aspects, the indication of a PPU restriction associated with the UE indicates a PPU restriction on a number of PPUs across one or more component carriers.
[0216] In a tenth aspect, alone or in combination with one or more of the first to ninth aspects, the indication of a PPU limit associated with the UE includes an individual PPU limit for each of the one or more subcarrier spacings.
[0217] In an eleventh aspect, either alone or in combination with one or more of the first to tenth aspects, the configuration of multiple search space sets ensures that the total number of PPUs occupied by linked PDCCHs in all one or more pairs of linked search space sets always meets a PPU limitation associated with the UE.
[0218] 13 illustrates example blocks of process 1300, in some aspects process 1300 may include additional, fewer, different, or differently ordered blocks compared to the blocks illustrated in FIG 13. Additionally or alternatively, two or more of the blocks of process 1300 may be performed in parallel.
[0219] 14 illustrates an example process 1400 performed, for example, by a master node, in accordance with the present disclosure. The example process 1400 is an example of a network node (e.g., base station 110) performing operations associated with complexity processing for PDCCH repetitions.
[0220] 14, in some aspects, process 1400 may include receiving from the UE an indication of a PPU restriction associated with the UE (block 1410). For example, the network node may receive from the UE an indication of a PPU restriction associated with the UE (e.g., using the communications manager 150 and / or the receiving component 1702 shown in FIG. 17) as described above.
[0221] 14, in some aspects, the process 1400 includes transmitting a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets with linked PDCCH candidates for PDCCH repetitions. For example, the network node may transmit (e.g., using the communications manager 150 and / or the transmitting component 1704 shown in FIG. 17) a configuration of a plurality of search space sets for PDCCH candidates to the UE, the plurality of search space sets including one or more pairs of linked search space sets with linked PDCCH candidates for PDCCH repetitions, as discussed above.
[0222] 14, in some aspects, the process 1400 may include transmitting a repetitive PDCCH transmission on a pair of linked PDCCH candidates of a pair of linked search space sets, where at least one of the transmission of the repetitive PDCCH transmission or the configuration of the pair of linked search space sets is based at least in part on a PPU limitation associated with the UE. For example, the network node may transmit (e.g., using the communications manager 150 and / or the receiving component 1704 shown in FIG. 17) a repetitive PDCCH transmission on a pair of linked PDCCH candidates of a pair of linked search space sets, where at least one of the transmission of the repetitive PDCCH transmission or the configuration of the pair of linked search space sets is based at least in part on a PPU limitation associated with the UE.
[0223] Process 1400 may include additional aspects, such as any single aspect or any combination of aspects described below and / or in conjunction with one or more other processes described elsewhere herein.
[0224] In a first aspect, the linked PDCCH candidates include one or more pairs of linked PDCCH candidates, each pair of linked PDCCH candidates of the one or more pairs of linked PDCCH candidates includes a first PDCCH candidate in a first search space set linked to a second PDCCH candidate in a second search space set, and each pair of linked PDCCH candidates occupies a number of PPUs over a time period associated with the linked PDCCH candidate pair.
[0225] In a second aspect, alone or in combination with the first aspect, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on an aggregation level associated with the linked PDCCH candidate pair.
[0226] In a third aspect, alone or in combination with one or more of the first and second aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is equal to an aggregation level associated with the linked PDCCH candidate pair.
[0227] In a fourth aspect, alone or in combination with one or more of the first to third aspects, for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on the mother code length of the aggregation level associated with the linked PDCCH candidate pair.
[0228] In a fifth aspect, alone or in combination with one or more of the first to fourth aspects, for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair is based at least in part on one or more symbols associated with a first PDCCH candidate of the linked PDCCH candidate pair and one or more symbols associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0229] In a sixth aspect, alone or in combination with one or more of the first to fifth aspects, for each pair of linked PDCCH candidates, the time period associated with the linked PDCCH candidate pair runs from the start of the first symbol associated with the first PDCCH candidate of the linked PDCCH candidate pair to the end of the last symbol associated with the second PDCCH candidate of the linked PDCCH candidate pair.
[0230] In a seventh aspect, alone or in combination with one or more of the first to sixth aspects, for each pair of linked PDCCH candidates, the period associated with that linked PDCCH candidate pair runs from the end of the last symbol associated with the first PDCCH candidate of that linked PDCCH candidate pair to the end of the last symbol associated with the second PDCCH candidate of that linked PDCCH candidate pair.
[0231] In an eighth aspect, alone or in combination with one or more of the first to seventh aspects, for each pair of linked PDCCH candidates, the time period associated with the linked PDCCH candidate pair runs from the beginning of a first symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to the beginning of a first symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0232] In a ninth aspect, alone or in combination with one or more of the first to eighth aspects, for each pair of linked PDCCH candidates, the time period associated with the linked PDCCH candidate pair runs from the end of the last symbol associated with the first PDCCH candidate of the linked PDCCH candidate pair to the beginning of the first symbol associated with the second PDCCH candidate of the linked PDCCH candidate pair.
[0233] In a tenth aspect, alone or in combination with one or more of the first to ninth aspects, the indication of a PPU limit associated with the UE includes an indication of respective PPU limits for one or more component carriers.
[0234] In an eleventh aspect, either alone or in combination with one or more of the first through tenth aspects, the process 1400 includes deriving a total PPU limit across all of the one or more component carriers based at least in part on the PPU limits of each of the one or more component carriers.
[0235] In a twelfth aspect, alone or in combination with one or more of the first to eleventh aspects, the indication of a PPU restriction associated with the UE indicates a PPU restriction on a number of PPUs across one or more component carriers.
[0236] In a thirteenth aspect, alone or in combination with one or more of the first to twelfth aspects, the indication of a PPU limit associated with the UE includes a respective PPU limit for each of the one or more subcarrier spacings.
[0237] In a 14th aspect, either alone or in combination with one or more of the 1st to 13th aspects, the configuration of multiple search space sets ensures that the total number of PPUs occupied by linked PDCCHs in all one or more pairs of linked search space sets always meets a PPU limitation associated with the UE.
[0238] In a fifteenth aspect, alone or in combination with one or more of the first to fourteenth aspects, transmitting a repeated PDCCH transmission in a pair of linked PDCCH candidates of a pair of linked search space sets includes transmitting a repeated PDCCH transmission in the pair of linked PDCCH candidates in connection with a determination that a total number of PPUs occupied by linked PDCCHs in all of one or more pairs of linked search space sets during a time period associated with the pair of linked PDCCH candidates satisfies a PPU limitation associated with the UE.
[0239] In a 16th aspect, alone or in combination with one or more of the 1st to 15th aspects, transmitting a repetitive PDCCH transmission on a pair of linked PDCCH candidates of a pair of linked search space sets includes identifying one or more linked PDCCH candidates among the linked PDCCH candidates to be dropped by the UE in connection with a determination that a total number of PPUs occupied by linked PDCCHs in all of the linked search space sets does not satisfy a PPU limit associated with the UE, and transmitting a repetitive PDCCH transmission on the pair of linked PDCCH candidates, wherein the pair of linked PDCCH candidates is selected from the set of remaining linked PDCCH candidates other than the one or more linked PDCCH candidates among the linked PDCCH candidates to be dropped by the UE.
[0240] In a 17th aspect, alone or in combination with one or more of the 1st to 16th aspects, transmitting a repetitive PDCCH transmission in a pair of linked PDCCH candidates of a linked pair of a search space set includes identifying one or more linked PDCCH candidates among the linked PDCCH candidates in association with a determination that a total number of PPUs occupied by linked PDCCHs in all of the one or more pairs of the linked search space set does not satisfy a PPU limitation associated with the UE, and transmitting a repetitive PDCCH transmission in the pair of linked PDCCH candidates, wherein the pair of linked PDCCH candidates is selected from a set of remaining linked PDCCH candidates other than the one or more linked PDCCH candidates among the linked PDCCH candidates monitored by the UE as non-linked PDCCH candidates.
[0241] 14 illustrates example blocks of process 1400, in some aspects process 1400 may include additional, fewer, different, or differently ordered blocks compared to the blocks illustrated in FIG 14. Additionally or alternatively, two or more of the blocks of process 1400 may be performed in parallel.
[0242] 15 illustrates an example process 1500 performed, for example, by a master node, in accordance with the present disclosure. The example process 1500 is an example in which a base station (e.g., base station 110) performs operations associated with a technique for QCL prioritization.
[0243] 15, in some aspects, process 1500 may include receiving from the UE, in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of the UE capability of supporting linked monitoring occasions between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring linked PDCCH candidates. For example, the network node may receive (e.g., using the communications manager 150 and / or the receiving component 1702 shown in FIG. 16) from the UE, in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of the UE capability of supporting linked monitoring occasions between two other linked monitoring occasions in the second pair of linked monitoring occasions for monitoring linked PDCCH candidates.
[0244] 15, in some aspects, the process 1500 may include transmitting to the UE a configuration of one or more search space sets for monitoring PDCCH candidates based at least in part on the indication of the UE capability to support linked monitoring occasions between two other linked monitoring occasions. For example, the network node (e.g., using the communications manager 150 and / or the transmitting component 1704 shown in FIG. 17) may transmit to the UE a configuration of one or more search space sets for monitoring PDCCH candidates based at least in part on the indication of the UE capability to support linked monitoring occasions between two other linked monitoring occasions, as described above.
[0245] Process 1500 may include additional aspects, such as any single aspect or any combination of aspects described below and / or in conjunction with one or more other processes described elsewhere herein.
[0246] Although Figure 15 illustrates example blocks of process 1500, in some aspects process 1500 may include additional, fewer, different, or differently ordered blocks compared to the blocks illustrated in Figure 15. Additionally or alternatively, two or more of the blocks of process 1500 may be performed in parallel.
[0247] FIG. 16 is a diagram of an example apparatus 1600 for wireless communication. The apparatus 1600 may be a UE, or the UE may include the apparatus 1600. In some aspects, the apparatus 1600 includes a receiving component 1602 and a transmitting component 1604, which may be in communication with one another (e.g., via one or more buses and / or one or more other components). As shown, the apparatus 1600 may communicate with another apparatus 1606 (such as a UE, a base station, or another device for wireless communication) using the receiving component 1602 and the transmitting component 1604. As further shown, the apparatus 1600 may include a communications manager 140. As further shown, the communications manager 140 may include one or more of a monitoring component 1608, a computing component 1610, or a derivation component 1612, among other examples.
[0248] In some aspects, the apparatus 1600 may be configured to perform one or more operations described herein in conjunction with FIGS. 5-9B. Additionally or alternatively, the apparatus 1600 may be configured to perform one or more processes described herein, such as process 1000 of FIG. 10, process 1100 of FIG. 11, process 1200 of FIG. 12, or a combination thereof. In some aspects, the apparatus 1600 and / or one or more components shown in FIG. 16 may include one or more components of a UE described above in conjunction with FIG. 2. Additionally or alternatively, one or more components shown in FIG. 16 may be implemented within one or more components described above in conjunction with FIG. 2. Additionally or alternatively, one or more components of the set of components may be implemented at least in part as software stored in memory. For example, the components (or portions of the components) may be implemented as instructions or code stored in a non-transitory computer-readable medium and executable by a controller or processor to perform the functions or operations of the components.
[0249] The receiving component 1602 may receive communications from the device 1606, such as reference signals, control information, data communications, or combinations thereof. The receiving component 1602 may provide the received communications to one or more other components of the device 1600. In some aspects, the receiving component 1602 may perform signal processing on the received communications (such as filtering, amplification, demodulation, analog-to-digital conversion, demultiplexing, deinterleaving, demapping, equalization, interference cancellation, or decoding, among other examples) and provide the processed signals to one or more other components of the device 1600. In some aspects, the receiving component 1602 may include one or more antennas, a demodulator, a MIMO detector, a receive processor, a controller / processor, a memory, or a combination thereof of a UE as described above in connection with FIG. 2.
[0250] The transmitting component 1604 may transmit a communication to the device 1606, such as a reference signal, control information, a data communication, or a combination thereof. In some aspects, one or more other components of the device 1600 may generate a communication and provide the generated communication to the transmitting component 1604 for transmission to the device 1600. In some aspects, the transmitting component 1604 may perform signal processing (such as filtering, amplifying, modulating, digital-to-analog conversion, multiplexing, interleaving, mapping, or encoding, among other examples) on the generated communication and may transmit the processed signal to the device 1606. In some aspects, the transmitting component 1604 may include one or more antennas, a modulator, a transmit MIMO processor, a transmit processor, a controller / processor, a memory, or a combination thereof of a UE as described above in connection with FIG. 2. In some aspects, the transmitting component 1604 may be collocated with the receiving component 1602 in a transceiver.
[0251] The transmitting component 1604 can transmit an indication of a PPU limitation associated with the UE to a network node. The receiving component 1602 can include receiving from the network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets based at least in part on a PPU limitation associated with the UE.
[0252] The monitoring component 1608 further includes monitoring linked PDCCH candidates in the one or more pairs of the linked search space set based at least in part on a configuration of the one or more pairs of the linked search space set.
[0253] The calculation component 1610 is further configured to calculate a total number of PPUs occupied by linked PDCCH candidates in all of the one or more pairs of linked search space sets at one or more time points associated with a pair of linked monitoring occasions associated with the one or more pairs of linked search space sets.
[0254] The monitoring component 1608 is further configured to monitor one or more linked PDCCH candidates for PDCCH repetitions in the linked monitoring occasion pair in connection with determining that a total number of PPUs occupied by the linked PDCCHs in all of the one or more pairs of the linked search space set meets a PPU limit associated with the UE during a time period associated with the one or more linked PDCCH candidates in the linked PDCCH candidates.
[0255] The transmitting component 1604 can transmit an indication of a PPU limitation associated with the UE to the network node. The receiving component 1602 can receive a configuration of a plurality of search space sets, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions. The monitoring component 1608 can selectively monitor one or more linked PDCCH candidates among the linked PDCCH candidates in a pair of linked monitoring occasions associated with a pair of linked search space sets among the one or more pairs of linked search space sets based at least in part on a comparison of a total number of PPUs occupied by linked PDCCH candidates in all of the one or more pairs of linked search space sets to a PPU limitation associated with the UE.
[0256] The calculation component 1610 may calculate a total number of PPUs occupied by linked PDCCH candidates in all of the one or more pairs of linked search space sets at one or more time points associated with the linked monitoring occasion pair, and selectively monitoring one or more of the linked PDCCH candidates at the monitoring occasion is based at least in part on a comparison of the calculated total number of PPUs at the one or more time points associated with the linked monitoring occasion pair to a PPU limit associated with the UE.
[0257] The derivation component 1612 can derive a total PPU limit across all of the one or more component carriers based at least in part on the PPU limit of each of the one or more component carriers.
[0258] The transmitting component 1604 can transmit, in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of a UE capability to support linked monitoring occasions between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring linked PDCCH candidates. The receiving component 1602 can receive a configuration of a plurality of search space sets for monitoring PDCCH candidates based at least in part on the indication of the UE capability to support linked monitoring occasions between two other linked monitoring occasions.
[0259] The number and arrangement of components shown in Figure 16 are given as an example. In practice, there may be additional components, fewer components, different components, or differently ordered components compared to those shown in Figure 16. Furthermore, two or more components shown in Figure 16 may be implemented within a single component, or a single component shown in Figure 16 may be implemented as multiple distributed components. Additionally or alternatively, a set of components (one or more) shown in Figure 16 may perform one or more functions described as being performed by another set of components shown in Figure 16.
[0260] FIG. 17 is a block diagram of an example apparatus 1700 for wireless communication. The apparatus 1700 may be a network node (e.g., a base station), or the network node may include the apparatus 1700. In some aspects, the apparatus 1700 includes a receiving component 1702 and a transmitting component 1704, which may be in communication with each other (e.g., via one or more buses and / or one or more other components). As shown, the apparatus 1700 may communicate with another apparatus 1706 (such as a UE, a base station, or another device for wireless communication) using the receiving component 1702 and the transmitting component 1704. As further shown, the apparatus 1700 may include a determining component 150. The communications manager 150 may include a canceling component 1708, among other examples.
[0261] In some aspects, the apparatus 1700 may be configured to perform one or more operations described herein in conjunction with FIGS. 3A-3B. Additionally or alternatively, the apparatus 1700 may be configured to perform one or more processes described herein, such as process 1300 of FIG. 13, process 1400 of FIG. 14, process 1500 of FIG. 15, or a combination thereof. In some aspects, the apparatus 1700 and / or one or more components illustrated in FIG. 17 may include one or more components of a base station described above in conjunction with FIG. 2. Additionally or alternatively, one or more components illustrated in FIG. 17 may be implemented within one or more components described above in conjunction with FIG. 2. Additionally or alternatively, one or more components of the set of components may be implemented at least in part as software stored in memory. For example, the components (or portions of the components) may be implemented as instructions or code stored in a non-transitory computer-readable medium and executable by a controller or processor to perform the functions or operations of the components.
[0262] The receiving component 1702 may receive communications from the apparatus 1700, such as reference signals, control information, data communications, or combinations thereof. The receiving component 1702 may provide the received communications to one or more other components of the apparatus 1700. In some aspects, the receiving component 1702 may perform signal processing (such as filtering, amplification, demodulation, analog-to-digital conversion, demultiplexing, deinterleaving, demapping, equalization, interference cancellation, or decoding, among other examples) on the received communications and provide the processed signals to one or more other components of the apparatus 1700. In some aspects, the receiving component 1702 may include one or more antennas, demodulators, MIMO detectors, receive processors, controllers / processors, memories, or combinations thereof of a base station as described above in connection with FIG. 2.
[0263] The transmitting component 1704 may transmit a communication to the apparatus 1700, such as a reference signal, control information, a data communication, or a combination thereof. In some aspects, one or more other components of the apparatus 1700 may generate a communication and provide the generated communication to the transmitting component 1704 for transmission to the apparatus 1700. In some aspects, the transmitting component 1704 may perform signal processing (such as filtering, amplifying, modulating, digital-to-analog conversion, multiplexing, interleaving, mapping, or encoding, among other examples) on the generated communication and may transmit the processed signal to the apparatus 1700. In some aspects, the transmitting component 1704 may include one or more antennas, a modulator, a transmit MIMO processor, a transmit processor, a controller / processor, a memory, or a combination thereof, of a base station described above in connection with FIG. 2. In some aspects, the transmitting component 1704 may be collocated with the receiving component 1702 in a transceiver.
[0264] The receiving component 1702 can receive from the UE an indication of a PPU limitation associated with the UE. The transmitting component 1704 can transmit a configuration of a plurality of search space sets for PDCCH candidates to the UE, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets based at least in part on a PPU limitation associated with the UE.
[0265] The transmitting component 1704 can transmit a repeated PDCCH transmission to the UE on linked PDCCH candidates of one or more pairs of the linked search space set based at least in part on a configuration of the one or more pairs of the linked search space set.
[0266] The receiving component 1702 can receive from the UE an indication of a PPU limitation associated with the UE. The transmitting component 1704 can transmit a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions. The transmitting component 1704 can transmit a repeating PDCCH transmission in a pair of linked PDCCH candidates in the pair of linked search space sets, where at least one of the transmission of the repeating PDCCH transmission or the configuration of the pair of linked search space sets is based at least in part on the PPU limitation associated with the UE.
[0267] The derivation component 1708 can derive a total PPU limit across all of the one or more component carriers based at least in part on the PPU limit of each of the one or more component carriers.
[0268] The receiving component 1702 can receive from the UE, in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of the UE capability of supporting linked monitoring occasions between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring linked PDCCH candidates. The transmitting component 1704 can transmit to the UE a configuration of one or more search space sets for monitoring the PDCCH candidates based at least in part on the indication of the UE capability of supporting linked monitoring occasions between the two other linked monitoring occasions.
[0269] The number and arrangement of components shown in Figure 17 are given as an example. In practice, there may be additional components, fewer components, different components, or differently ordered components compared to those shown in Figure 17. Furthermore, two or more components shown in Figure 17 may be implemented within a single component, or a single component shown in Figure 17 may be implemented as multiple distributed components. Additionally or alternatively, a set of components (one or more) shown in Figure 17 may perform one or more functions described as being performed by another set of components shown in Figure 17.
[0270] The following provides a summary of several aspects of the disclosure. Aspect 1: A method for wireless communications performed by a user equipment (UE), comprising: transmitting an indication of a physical downlink control channel (PDCCH) processing unit (PPU) limitation associated with the UE to a network node; receiving from the network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions; and selectively monitoring one or more linked PDCCH candidates among the linked PDCCH candidates in linked monitoring occasion pairs associated with a pair of linked search space sets among the one or more pairs of linked search space sets based at least in part on a comparison of a total number of PPUs occupied by linked PDCCH candidates in all of the one or more pairs of linked search space sets to a PPU limitation associated with the UE.
[0271] Aspect 2: The method of aspect 1, further comprising: calculating a total number of PPUs occupied by linked PDCCH candidates in all of one or more pairs of linked search space sets at one or more time points associated with the linked monitoring occasion pair, wherein selectively monitoring one or more of the linked PDCCH candidates at the monitoring occasion is based at least in part on a comparison of the calculated total number of PPUs at the one or more time points associated with the linked monitoring occasion pair with a PPU limit associated with the UE.
[0272] Aspect 3: A method of any one of aspects 1 to 2, wherein the linked PDCCH candidates include one or more pairs of linked PDCCH candidates, each pair of linked PDCCH candidates of the one or more pairs of linked PDCCH candidates includes a first PDCCH candidate in a first search space set linked to a second PDCCH candidate in a second search space set, and each pair of linked PDCCH candidates occupies a multiple PPU over a period associated with the linked PDCCH candidate pair.
[0273] Aspect 4: The method of aspect 3, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on an aggregation level associated with the linked PDCCH candidate pair.
[0274] Aspect 5: Any one of the methods of aspects 3 to 4, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is equal to an aggregation level associated with the linked PDCCH candidate pair.
[0275] Aspect 6: The method of any one of aspects 3 to 4, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on the mother code length of an aggregation level associated with the linked PDCCH candidate pair.
[0276] Aspect 7: The method of any one of aspects 3-6, wherein for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair is based at least in part on one or more symbols associated with a first PDCCH candidate of the linked PDCCH candidate pair and one or more symbols associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0277] Aspect 8: The method of any one of aspects 3-7, wherein for each pair of linked PDCCH candidates, a time period associated with the linked PDCCH candidate pair runs from a beginning of a first symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to an end of a last symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0278] Aspect 9: The method of any one of aspects 3-7, wherein for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair extends from an end of a last symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to an end of a last symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0279] Aspect 10: The method of any one of aspects 3-7, wherein for each pair of linked PDCCH candidates, a time period associated with the linked PDCCH candidate pair runs from a beginning of a first symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to a beginning of a first symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0280] Aspect 11: The method of any one of aspects 3-7, wherein for each pair of linked PDCCH candidates, a time period associated with the linked PDCCH candidate pair extends from an end of a last symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to a beginning of a first symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0281] Aspect 12: The method of any one of aspects 1-11, wherein the indication of a PPU limit associated with the UE includes an indication of respective PPU limits for one or more component carriers.
[0282] Aspect 13: The method of aspect 12, further including deriving a total PPU limit across all of the one or more component carriers based at least in part on a PPU limit of each of the one or more component carriers.
[0283] Aspect 14: The method of any one of aspects 1-12, wherein the indication of a PPU restriction associated with the UE indicates a PPU restriction on a number of PPUs across one or more component carriers.
[0284] Example 15: The method of any one of Examples 1 to 14, wherein the indication of a PPU limit associated with the UE includes a separate PPU limit for each of the one or more subcarrier intervals.
[0285] Aspect 16: The method of any one of aspects 1 to 15, wherein selectively monitoring one or more of the linked PDCCH candidates in a pair of linked monitoring occasions includes monitoring one or more of the linked PDCCH candidates for PDCCH repetitions in the pair of linked monitoring occasions, and a total number of PPUs occupied by the linked PDCCHs in all of the one or more search space set pairs is required to satisfy a PPU limitation associated with the UE.
[0286] Aspect 17: The method of any one of aspects 1 to 16, wherein selectively monitoring one or more of the linked PDCCH candidates in a linked monitoring occasion pair includes monitoring one or more of the linked PDCCH candidates for PDCCH repetitions in the linked monitoring occasion pair in association with a determination that a total number of PPUs occupied by the linked PDCCHs in all of the one or more pairs of the linked search space set during a time period associated with the one or more of the linked PDCCH candidates satisfies a PPU limitation associated with the UE.
[0287] Aspect 18: The method of any one of aspects 1 to 15, wherein selectively monitoring one or more of the linked PDCCH candidates in a pair of linked monitoring occasions includes refraining from monitoring one or more of the linked PDCCH candidates in the pair of linked monitoring occasions in connection with a determination that a total number of PPUs occupied by linked PDCCHs in all of the one or more pairs of linked search space sets during a time period associated with the one or more of the linked PDCCH candidates does not satisfy a PPU limitation associated with the UE.
[0288] Aspect 19: The method of aspect 18, wherein refraining from monitoring one or more PDCCH candidates among one or more linked PDCCH candidates in a pair of linked monitoring occasions includes refraining from monitoring the one or more PDCCH candidates in connection with a determination that a total number of occupied PPUs does not satisfy a PPU limit associated with the UE based at least in part on a priority associated with a component carrier of the PDCCH candidates.
[0289] Aspect 20: The method of aspect 18, wherein refraining from monitoring one or more linked PDCCH candidates in a linked monitoring occasion pair includes refraining from monitoring the linked search space set pair in connection with a determination that a total number of occupied PPUs does not satisfy a PPU limit associated with the UE based at least in part on a priority associated with the linked search space set pair.
[0290] Aspect 21: The method of aspect 18, wherein refraining from monitoring one or more linked PDCCH candidates in a linked monitoring occasion pair is based at least in part on a priority associated with the linked monitoring occasion pair, and refraining from monitoring the linked monitoring occasion pair in connection with a determination that a total number of occupied PPUs does not satisfy a PPU limit associated with the UE.
[0291] Aspect 22: The method of aspect 18, wherein refraining from monitoring one or more PDCCH candidates among the one or more linked PDCCH candidates in a pair of linked monitoring occasions includes selecting a PDCCH candidate to refrain from monitoring from the one or more linked PDCCH candidates among the linked PDCCH candidates based at least in part on respective priorities associated with the one or more linked PDCCH candidates among the linked PDCCH candidates.
[0292] Aspect 23: The method of aspect 18, wherein selectively monitoring one or more linked PDCCH candidates among the linked PDCCH candidates in the linked monitoring occasion pair includes separately monitoring one or more linked PDCCH candidates among the linked PDCCH candidates in the linked monitoring occasion pair as unlinked PDCCH candidates in connection with a determination that a total number of PPUs occupied by linked PDCCHs in all of the one or more pairs of linked search space sets does not meet a PPU limitation associated with the UE during a time period associated with the one or more linked PDCCH candidates among the linked PDCCH candidates.
[0293] Aspect 24: A method for wireless communications performed by a user equipment (UE), comprising: in a first pair of linked monitoring occasions for monitoring linked physical downlink control channel (PDCCH) candidates, transmitting to a network node an indication of the UE capability of supporting linked monitoring occasions between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring the linked PDCCH candidates; and receiving from the network node a configuration of a plurality of search space sets for monitoring the PDCCH candidates based at least in part on the indication of the UE capability of supporting linked monitoring occasions between the two other linked monitoring occasions.
[0294] Aspect 25: A method for wireless communications performed by a network node, comprising: receiving from a user equipment (UE) an indication of a physical downlink control channel (PDCCH) processing unit (PPU) limitation associated with the UE; transmitting to the UE a configuration of a plurality of search space sets for PDCCH candidates, the configuration comprising one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetition; and transmitting a repeating PDCCH transmission to the UE in a pair of linked PDCCH candidates of the pair of linked search space sets, wherein at least one of the transmission of the repeating PDCCH transmission or the configuration of the pair of linked search space sets is based at least in part on a PPU limitation associated with the UE.
[0295] Aspect 26: The method of aspect 25, wherein the linked PDCCH candidates include one or more pairs of linked PDCCH candidates, each pair of linked PDCCH candidates of the one or more pairs of linked PDCCH candidates includes a first PDCCH candidate in a first search space set linked to a second PDCCH candidate in a second search space set, and each pair of linked PDCCH candidates occupies a number of PPUs over a period associated with the linked PDCCH candidate pair.
[0296] Aspect 27: The method of aspect 26, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on an aggregation level associated with the linked PDCCH candidate pair.
[0297] Example 28: The method of any one of examples 26 to 27, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is equal to an aggregation level associated with the linked PDCCH candidate pair.
[0298] Aspect 29: The method of any one of aspects 26 to 27, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on the mother code length of the aggregation level associated with the linked PDCCH candidate pair.
[0299] Example 30: The method of any one of examples 26-29, wherein for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair is based at least in part on one or more symbols associated with a first PDCCH candidate of the linked PDCCH candidate pair and one or more symbols associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0300] Aspect 31: The method of any one of aspects 26 to 30, wherein for each pair of linked PDCCH candidates, a time period associated with the linked PDCCH candidate pair runs from a beginning of a first symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to an end of a last symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0301] Aspect 32: The method of any one of aspects 26 to 30, wherein for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair extends from an end of a last symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to an end of a last symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0302] Aspect 33: The method of any one of aspects 26 to 30, wherein for each pair of linked PDCCH candidates, a time period associated with the linked PDCCH candidate pair runs from a beginning of a first symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to a beginning of a first symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0303] Aspect 34: The method of any one of aspects 26 to 30, wherein for each pair of linked PDCCH candidates, a time period associated with the linked PDCCH candidate pair runs from an end of a last symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to a beginning of a first symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0304] Example 35: The method of any one of examples 25-34, wherein the indication of a PPU limit associated with the UE includes an indication of respective PPU limits for one or more component carriers.
[0305] Aspect 36: The method of aspect 35, further comprising deriving a total PPU limit across all of the one or more component carriers based at least in part on a PPU limit of each of the one or more component carriers.
[0306] Example 37: The method of any one of examples 25 to 35, wherein the indication of a PPU restriction associated with the UE indicates a PPU restriction on a number of PPUs across one or more component carriers.
[0307] Example 38: The method of any one of Examples 25 to 37, wherein the indication of a PPU limit associated with the UE includes a separate PPU limit for each of the one or more subcarrier intervals.
[0308] Aspect 39: A method of any one of aspects 25 to 38, wherein the configuration of multiple search space sets ensures that the total number of PPUs occupied by linked PDCCHs in all of one or more pairs of linked search space sets always meets a PPU limitation associated with the UE.
[0309] Aspect 40: The method of any one of aspects 25 to 39, wherein transmitting a repeated PDCCH transmission in a linked PDCCH candidate pair of a linked search space set pair includes transmitting a repeated PDCCH transmission in the linked PDCCH candidate pair in connection with a determination that a total number of PPUs occupied by linked PDCCHs in all of one or more pairs of linked search space sets meets a PPU limit associated with the UE during a period associated with the linked PDCCH candidate pair.
[0310] Aspect 41: The method of any one of aspects 25 to 38, wherein transmitting a repeated PDCCH transmission in a pair of linked PDCCH candidates of a pair of linked search space sets includes identifying one or more of the linked PDCCH candidates to be dropped by the UE in connection with a determination that a total number of PPUs occupied by linked PDCCHs in all of one or more pairs of linked search space sets does not satisfy a PPU limitation associated with the UE, and transmitting a repeated PDCCH transmission in the pair of linked PDCCH candidates, wherein the pair of linked PDCCH candidates is selected from the set of remaining linked PDCCH candidates other than the one or more of the linked PDCCH candidates to be dropped by the UE.
[0311] Aspect 42: The method of any one of aspects 25 to 38, wherein transmitting a repeated PDCCH transmission in a pair of linked PDCCH candidates of a pair of linked search space sets includes, in connection with a determination that a total number of PPUs occupied by linked PDCCHs in all of one or more pairs of linked search space sets does not meet a PPU limitation associated with the UE, identifying one or more linked PDCCH candidates among the linked PDCCH candidates monitored as non-linked PDCCH candidates by the UE, and transmitting a repeated PDCCH transmission in the pair of linked PDCCH candidates, wherein the pair of linked PDCCH candidates is selected from the set of remaining linked PDCCH candidates other than the one or more linked PDCCH candidates monitored as non-linked PDCCH candidates by the UE.
[0312] Aspect 43: A method of communication performed by a network node, comprising: receiving from a user equipment (UE), in a first pair of linked monitoring occasions for monitoring linked PDCCH candidates, an indication of a UE capability to support linked monitoring occasions between two other linked monitoring occasions in a second pair of linked monitoring occasions for monitoring linked PDCCH candidates; and transmitting to the UE a configuration of one or more search space sets for monitoring the PDCCH candidates based at least in part on the indication of the UE capability to support linked monitoring occasions between the two other linked monitoring occasions.
[0313] Aspect 44: A method of wireless communication performed by a user equipment (UE), comprising: transmitting to a network node an indication of a physical downlink control channel (PDCCH) processing unit (PPU) limitation associated with the UE; and receiving from the network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, the configuration of the one or more pairs of linked search space sets being based at least in part on the PPU limitation associated with the UE.
[0314] Aspect 45: The method of aspect 44, further comprising monitoring linked PDCCH candidates in one or more pairs of linked search space sets based at least in part on a configuration of the one or more pairs of linked search space sets.
[0315] Aspect 46: The method of any one of aspects 44 to 45, further comprising calculating a total number of PPUs occupied by linked PDCCH candidates in all of the one or more pairs of linked search space sets at one or more time points associated with a pair of linked monitoring occasions associated with the one or more pairs of linked search space sets.
[0316] Aspect 47: The method of any one of aspects 44 to 46, wherein the linked PDCCH candidates include one or more pairs of linked PDCCH candidates, each pair of linked PDCCH candidates of the one or more pairs of linked PDCCH candidates includes a first PDCCH candidate in a first search space set linked to a second PDCCH candidate in a second search space set, and each pair of linked PDCCH candidates occupies a number of PPUs over a period associated with the linked PDCCH candidate pair.
[0317] Aspect 48: The method of aspect 47, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on an aggregation level associated with the linked PDCCH candidate pair.
[0318] Example 49: The method of any one of examples 47 to 48, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on the mother code length of the aggregation level associated with the linked PDCCH candidate pair.
[0319] Aspect 50: Any one of the methods of aspects 47 to 49, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is equal to a first value associated with an aggregation level 1 associated with the linked PDCCH candidate pair, a second value associated with an aggregation level 2 associated with the linked PDCCH candidate pair that is greater than the first value, or a third value associated with an aggregation level 4, 8, or 16 associated with the linked PDCCH candidate pair that is greater than the second value.
[0320] Example 51: The method of any one of examples 47 to 50, wherein for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair is based at least in part on one or more symbols associated with a first PDCCH candidate of the linked PDCCH candidate pair and one or more symbols associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0321] Example 52: The method of any one of examples 47 to 51, wherein for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair extends from an end of a last symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to an end of a last symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0322] Example 53: The method of any one of examples 44 to 52, wherein the indication of a PPU limit associated with the UE includes an indication of respective PPU limits for one or more component carriers.
[0323] Example 54: The method of any one of examples 44 to 53, wherein the indication of a PPU restriction associated with the UE indicates a PPU restriction on a number of PPUs across one or more component carriers.
[0324] Example 55: The method of any one of examples 44 to 54, wherein the indication of a PPU limit associated with the UE includes a separate PPU limit for each of one or more subcarrier intervals.
[0325] Aspect 56: The method of any one of aspects 44 to 55, wherein the total number of PPUs occupied by linked PDCCHs in all of one or more pairs of linked search space sets is required to satisfy a PPU limitation associated with the UE.
[0326] Aspect 57: The method of any one of aspects 44 to 56, further comprising: monitoring one or more of the linked PDCCH candidates for PDCCH repetitions in a linked monitoring occasion pair in connection with determining that a total number of PPUs occupied by linked PDCCH candidates in all of one or more pairs of linked search space sets meets a PPU limit associated with the UE during a time period associated with the one or more of the linked PDCCH candidates.
[0327] Aspect 58: A method for wireless communication performed by a network node, comprising: receiving an indication of a physical downlink control channel (PDCCH) processing unit (PPU) limitation associated with a user equipment (UE) from the UE; and transmitting a configuration of a plurality of search space sets for PDCCH candidates to the UE, wherein the plurality of search space sets include one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetitions, and wherein the configuration of the one or more pairs of linked search space sets is based at least in part on the PPU limitation associated with the UE.
[0328] Aspect 59: The method of aspect 58, further configured to transmit a repeated PDCCH transmission to the UE in linked PDCCH candidates of one or more pairs of the linked search space set based at least in part on a configuration of one or more pairs of the linked search space set.
[0329] Aspect 60: The method of any one of aspects 58 to 59, wherein the linked PDCCH candidates include one or more pairs of linked PDCCH candidates, each pair of linked PDCCH candidates of the one or more pairs of linked PDCCH candidates includes a first PDCCH candidate in a first search space set linked to a second PDCCH candidate in a second search space set, and each pair of linked PDCCH candidates occupies a number of PPUs over a period associated with the linked PDCCH candidate pair.
[0330] Aspect 61: The method of aspect 60, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on an aggregation level associated with the linked PDCCH candidate pair.
[0331] Aspect 62: Any one of the methods of aspects 60 to 61, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is based at least in part on the mother code length of the aggregation level associated with the linked PDCCH candidate pair.
[0332] Aspect 63: Any one of the methods of aspects 60 to 49, wherein for each pair of linked PDCCH candidates, the number of PPUs occupied by the linked PDCCH candidate pair is equal to a first value associated with an aggregation level 1 associated with the linked PDCCH candidate pair, a second value associated with an aggregation level 2 associated with the linked PDCCH candidate pair that is greater than the first value, or a third value associated with an aggregation level 4, 8, or 16 associated with the linked PDCCH candidate pair that is greater than the second value.
[0333] Aspect 64: The method of any one of aspects 60 to 63, wherein for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair is based at least in part on one or more symbols associated with a first PDCCH candidate of the linked PDCCH candidate pair and one or more symbols associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0334] Aspect 65: The method of any one of aspects 60 to 64, wherein for each pair of linked PDCCH candidates, a period associated with the linked PDCCH candidate pair extends from an end of a last symbol associated with a first PDCCH candidate of the linked PDCCH candidate pair to an end of a last symbol associated with a second PDCCH candidate of the linked PDCCH candidate pair.
[0335] Example 66: The method of any one of examples 58-65, wherein the indication of a PPU limit associated with the UE includes an indication of respective PPU limits for one or more component carriers.
[0336] Aspect 67: The method of any one of aspects 58-66, wherein the indication of a PPU restriction associated with the UE indicates a PPU restriction on a number of PPUs across one or more component carriers.
[0337] Example 68: The method of any one of examples 58-67, wherein the indication of a PPU limit associated with the UE includes a separate PPU limit for each of the one or more subcarrier intervals.
[0338] Aspect 69: A method of any one of aspects 58 to 68, wherein the configuration of multiple search space sets ensures that the total number of PPUs occupied by linked PDCCHs in all of one or more pairs of linked search space sets always meets a PPU limitation associated with the UE.
[0339] Aspect 70: An apparatus for wireless communication in a device, the apparatus including a processor, a memory coupled to the processor, and instructions stored in the memory and executable by the processor to cause the apparatus to perform any one of the methods of aspects 1 to 23.
[0340] Aspect 71: An apparatus for wireless communication in a device, the apparatus including a processor, a memory coupled to the processor, and instructions stored in the memory and executable by the processor to cause the apparatus to perform the method of aspect 24.
[0341] Aspect 72: An apparatus for wireless communication in a device, the apparatus including a processor, a memory coupled to the processor, and instructions stored in the memory and executable by the processor to cause the apparatus to perform any one of the methods of aspects 25 to 42.
[0342] Aspect 73: An apparatus for wireless communication in a UE, the apparatus including: a processor; a memory coupled to the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to perform the method of aspect 43.
[0343] Aspect 74: An apparatus for wireless communication in a UE, comprising: a processor; a memory coupled to the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to perform a method described in any one of aspects 44 to 57.
[0344] Aspect 75: An apparatus for wireless communication in a UE, the wireless communication device including a processor, a memory coupled to the processor, and instructions stored in the memory and executable by the processor to cause the apparatus to perform a method described in any one of aspects 58 to 69.
[0345] Aspect 76: A device for wireless communication, comprising: a memory; and one or more processors coupled to the memory, wherein the one or more processors are configured to perform a method according to one or more of aspects 1 to 23.
[0346] Aspect 77: A device for wireless communication comprising: a memory; and one or more processors coupled to the memory, wherein the one or more processors are configured to perform the method of aspect 24.
[0347] Aspect 78: A device for wireless communication, comprising: a memory; and one or more processors coupled to the memory, wherein the one or more processors are configured to perform a method of one or more of aspects 25 to 42.
[0348] Aspect 79: A device for wireless communication, comprising: a memory; and one or more processors coupled to the memory, wherein the one or more processors are configured to perform the method of aspect 43.
[0349] Aspect 80: A device for wireless communication, comprising: a memory; and one or more processors coupled to the memory, wherein the one or more processors are configured to perform a method of one or more of aspects 44 to 57.
[0350] Aspect 81: A device for wireless communication, comprising: a memory; and one or more processors coupled to the memory, wherein the one or more processors are configured to perform a method of one or more of aspects 58 to 69.
[0351] Example 82: An apparatus for wireless communication, comprising at least one means for performing the method of one or more of Examples 1 to 23.
[0352] Aspect 83: An apparatus for wireless communication, comprising at least one means for performing the method of aspect 24.
[0353] Example 84: An apparatus for wireless communication, comprising at least one means for performing the method of one or more of Examples 25 to 42.
[0354] Aspect 85: An apparatus for wireless communication, comprising at least one means for performing the method of aspect 43.
[0355] Example 86: An apparatus for wireless communication, comprising at least one means for performing the method of any of Examples 44 to 57.
[0356] Example 87: An apparatus for wireless communication, comprising at least one means for performing the method of any of Examples 58 to 69.
[0357] Aspect 88: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to perform a method of one or more of aspects 1 to 23.
[0358] Aspect 89: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to perform the method of aspect 24.
[0359] Aspect 90: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to perform a method of one or more of aspects 25-42.
[0360] Aspect 91: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to perform the method of aspect 43.
[0361] Aspect 92: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to perform a method of one or more of aspects 44 to 57.
[0362] Aspect 93: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to perform a method of one or more of aspects 57 to 69.
[0363] Aspect 94: A non-transitory computer-readable medium storing a set of instructions for wireless communication, the set of instructions including one or more instructions that, when executed by one or more processors of a device, cause the device to perform a method of one or more of aspects 1 to 23.
[0364] Aspect 95: A non-transitory computer-readable medium storing a set of instructions for wireless communication, the set of instructions including one or more instructions that, when executed by one or more processors of a device, cause the device to perform the method of aspect 24.
[0365] Aspect 96: A non-transitory computer-readable medium storing a set of instructions for wireless communication, the set of instructions including one or more instructions that, when executed by one or more processors of a device, cause the device to perform a method of one or more of aspects 25-42.
[0366] Aspect 97: A non-transitory computer-readable medium storing a set of instructions for wireless communication, the set of instructions including one or more instructions that, when executed by one or more processors of a device, cause the device to perform the method of aspect 43.
[0367] Aspect 98: A non-transitory computer-readable medium storing a set of instructions for wireless communication, the set of instructions including one or more instructions that, when executed by 44 or more processors of a device, cause the device to perform a method of one or more of aspects 44 to 57.
[0368] Aspect 99: A non-transitory computer-readable medium storing a set of instructions for wireless communication, the set of instructions including one or more instructions that, when executed by 58 or more processors of a device, cause the device to perform a method of one or more of aspects 58 to 69.
[0369] The above disclosure provides illustration and description, but is not intended to be exhaustive or to limit the embodiments to the precise form disclosed. Modifications and variations may be made in light of the above disclosure or may be acquired from practice of the embodiments.
[0370] The term "component" as used herein shall be broadly construed as hardware and / or a combination of hardware and software. "Software" shall be broadly construed to mean, among other examples, instructions, instruction sets, code, code segments, program code, programs, subprograms, software modules, applications, software applications, software packages, routines, subroutines, objects, executable files, threads of execution, procedures, and / or functions, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. A processor as used herein is implemented in hardware and / or a combination of hardware and software. It will be apparent that the systems and / or methods described herein may be implemented in different forms of hardware and / or a combination of hardware and software. The actual dedicated control hardware or software code used to implement these systems and / or methods is not a limiting aspect. Thus, the operation and behavior of the systems and / or methods are described herein without reference to specific software code, as those skilled in the art will appreciate that software and hardware may be designed to implement the systems and / or methods based at least in part on the description herein.
[0371] As used herein, "meeting a threshold" can refer to a value being greater than the threshold, greater than or equal to the threshold, less than the threshold, less than or equal to the threshold, equal to the threshold, not equal to the threshold, etc., depending on the context.
[0372] Although particular combinations of features are recited in the claims and / or disclosed herein, those combinations do not limit the disclosure of the various aspects. Many of these features may be combined in ways not specifically recited in the claims and / or disclosed herein. The disclosure of the various aspects includes each dependent claim in combination with any other claim in the claim set. As used herein, a phrase referring to "at least one of" a list of items refers to any combination of those items, including single members. As an example, "at least one of a, b, or c" is intended to include a, b, c, a+b, a+c, b+c, and a+b+c, as well as any combination having multiple identical elements (e.g., a+a, a+a+a, a+a+b, a+a+c, a+b+b, a+c+c, b+b, b+b+b, b+b+c, c+c, and c+c+c, or any other order of a, b, and c).
[0373] No element, act, or instruction used herein should be construed as critical or essential unless expressly described as such. Additionally, the articles "a" and "an" as used herein are intended to include one or more items and may be used interchangeably with "one or more." Additionally, the article "the" as used herein is intended to include one or more items referred to in relation to the article "the" and may be used interchangeably with "one or more." Additionally, the terms "set" and "group" as used herein are intended to include one or more items and may be used interchangeably with "one or more." When only one item is intended, the phrase "only one" or similar language is used. Additionally, terms such as "has," "have," and "having" as used herein are intended to be open-ended terms that do not limit the elements they modify (e.g., an element that "has" A may also have B). Additionally, the phrase "based on" is intended to mean "based at least in part on," unless otherwise specified. Also, as used herein, the term "or" is intended to be inclusive when used in a consecutive manner, and may be used interchangeably with "and / or" unless otherwise noted (e.g., when used in combination with "either" or "only one of"). [Explanation of symbols]
[0374] 100 Wireless Network 102a Macro Cell 102b Picocell 102c Femtocell 110 base station 120UE 130 Network Controller 140 Communications Manager 150 Communications Manager 200 Example of base station 110 232a modem 234a Antenna 252a Antenna 254a modem 232t modem 234t Antenna 252r Antenna 254r modem 284 Housing
Claims
1. A user equipment (UE) for wireless communication, comprising: a memory; one or more processors coupled to the memory, wherein the one or more processors are configured to: send an indication of a physical downlink control channel (PDCCH) processing unit (PPU) restriction associated with the UE to a network node; receive from the network node a configuration of a plurality of search space sets for PDCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCH candidates for PDCCH repetition, and the configuration of the one or more pairs of linked search space sets being at least partially based on the PPU restriction associated with the UE; User equipment (UE).
2. The one or more processors are further configured to: monitor the linked PDCCH candidates within the one or more pairs of linked search space sets, at least partially based on the configuration of the one or more pairs of linked search space sets; or The one or more processors are further configured to: calculate a total number of PPUs occupied by the linked PDCCH candidates in all of the one or more pairs of linked search space sets at one or more points in time associated with a pair of linked monitoring occasions associated with the one or more pairs of linked search space sets. The UE according to claim 1.
3. The linked PDCCH candidates include one or more pairs of linked PDCCH candidates, each pair of linked PDCCH candidates in the one or more pairs of linked PDCCH candidates including a first PDCCH candidate in a first search space set linked to a second PDCCH candidate in a second search space set, and each pair of linked PDCCH candidates occupying a number of PPUs over a period associated with the pair of linked PDCCH candidates. The UE according to claim 1.
4. For each pair of linked PDCCH candidates, The number of PPU occupied by the linked PDCCCH candidate pair is at least partially based on the aggregation level associated with the linked PDCCCH candidate pair, or The number of PPU occupied by the linked PDCCCH candidate pair is at least partially based on the mother code length of the aggregation level associated with the linked PDCCCH candidate pair, or The number of PPU occupied by the linked PDCCCH candidate pair is equal to a first value associated with aggregation level 1 associated with the linked PDCCCH candidate pair, a second value greater than the first value associated with aggregation level 2 associated with the linked PDCCCH candidate pair, or a third value greater than the second value associated with aggregation levels 4, 8, or 16 associated with the linked PDCCCH candidate pair, or The period associated with the linked PDCCCH candidate pair is at least partially based on one or more symbols associated with the first PDCCCH candidate of the linked PDCCCH candidate pair and one or more symbols associated with the second PDCCCH candidate of the linked PDCCCH candidate pair, or The period associated with the linked PDCCCH candidate pair continues from the end of the last symbol associated with the first PDCCCH candidate of the linked PDCCCH candidate pair to the end of the last symbol associated with the second PDCCCH candidate of the linked PDCCCH candidate pair. The UE according to claim 3.
5. The indication of the PPU restriction associated with the UE includes an indication of each PPU restriction for one or more component carriers, or The indication of the PPU restriction associated with the UE indicates a PPU restriction for the number of PPU across one or more component carriers, or The indication of the PPU restriction associated with the UE includes an individual PPU restriction for each of one or more subcarrier intervals, or The total number of PPU occupied by the linked PDCCCH in all of one or more pairs of the linked search space set is required to meet the PPU restriction associated with the UE. The UE according to claim 1.
6. The one or more processors are In all of one or more pairs of the linked search space sets, the total number of PPU occupied by the linked PDCCCH is during a period associated with one or more of the linked PDCCCH candidates among the linked PDCCCH candidates, The UE according to claim 1, further configured to monitor the one or more linked PDCCCH candidates for PDCCCH repetition in a pair of linked monitoring occasions, in connection with a determination that the PPU limit associated with the UE is being met.
7. A network node for wireless communication, A memory, One or more processors coupled to the memory, and the one or more processors are Receiving an indication of a physical downlink control channel (PDCCCH) processing unit (PPU) limit associated with a user equipment (UE) from the UE, Configured to transmit to the UE a configuration of a plurality of search space sets for PDCCCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCCCH candidates for PDCCCH repetition, the configuration of the one or more pairs of the linked search space sets being at least partially based on the PPU limit associated with the UE. Network node.
8. The one or more processors are The network node according to claim 7, further configured to transmit repeated PDCCCH transmissions to the UE in the linked PDCCCH candidates of the one or more pairs of the linked search space sets, based at least in part on the configuration of the one or more pairs of the linked search space sets.
9. The linked PDCCCH candidates include one or more pairs of linked PDCCCH candidates, each pair of the linked PDCCCH candidates of the one or more pairs of the linked PDCCCH candidates includes a first PDCCCH candidate in a first search space set linked to a second PDCCCH candidate in a second search space set, and each pair of the linked PDCCCH candidates occupies a number of PPUs over a period associated with the pair of the linked PDCCCH candidates. For each pair of linked PDCH candidates, the number of PPU's occupied by the pair of linked PDCH candidates is at least partially based on the aggregation level associated with the pair of linked PDCH candidates, the network node according to claim 7.
10. The indication of the PPU restriction associated with the UE includes an indication of each PPU restriction for one or more component carriers, or The indication of the PPU restriction associated with the UE indicates a PPU restriction for the number of PPU's across one or more component carriers, or The indication of the PPU restriction associated with the UE includes an individual PPU restriction for each of one or more subcarrier spacings, or The configuration of the plurality of search space sets ensures that the total number of PPU's occupied by the linked PDCH in all of one or more pairs of the linked search space sets always satisfies the PPU restriction associated with the UE. The network node according to claim 7.
11. A method of wireless communication performed by a user equipment (UE), comprising: transmitting an indication of a physical downlink control channel (PDCH) processing unit (PPU) restriction associated with the UE to a network node; and receiving from the network node a configuration of a plurality of search space sets for PDCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCH candidates for repetition of the PDCH, the configuration of the one or more pairs of the linked search space sets being at least partially based on the PPU restriction associated with the UE. A method of wireless communication.
12. The method according to claim 11, further comprising monitoring the linked PDCH candidates within the one or more pairs of the linked search space sets, at least partially based on the configuration of the one or more pairs of the linked search space sets.
13. The linked PDCH candidates include one or more pairs of linked PDCH candidates, and each pair of linked PDCH candidates in the one or more pairs of linked PDCH candidates includes a first PDCH candidate in a first search space set linked to a second PDCH candidate in a second search space set. Each pair of linked PDCH candidates occupies a number of PPUs over a period associated with the pair of linked PDCH candidates. The method according to claim 11, wherein for each pair of linked PDCH candidates, the number of PPUs occupied by the pair of linked PDCH candidates is at least partially based on the aggregation level associated with the pair of linked PDCH candidates. Claim 14 The indication of the PPU restriction associated with the UE includes an indication of each PPU restriction for one or more component carriers, or The indication of the PPU restriction associated with the UE indicates a PPU restriction for the number of PPUs over one or more component carriers, or The indication of the PPU restriction associated with the UE includes individual PPU restrictions for each of one or more subcarrier spacings. The method according to claim 11. Claim 15 A method of wireless communication performed by a network node, receiving from the UE an indication of a physical downlink control channel (PDCH) processing unit (PPU) restriction associated with the user equipment (UE); transmitting to the UE a configuration of a plurality of search space sets for PDCH candidates, the plurality of search space sets including one or more pairs of linked search space sets having linked PDCH candidates for repetition of the PDCH, the configuration of the one or more pairs of linked search space sets being at least partially based on the PPU restriction associated with the UE. A method of wireless communication.