Ambiguity resolution for search space set linking for physical downlink control channel repetitions

Abstract

To provide a method, system and device for communication management.SOLUTION: In one example, a method for wireless communication at a user equipment (UE) is described. The method may include receiving a configuration of a first search space (SS) set and a second SS set, and identifying a linking between the first SS set and the second SS set for physical downlink control channel repetition. The method may also include identifying one or more monitoring occasions in the first SS set or the second SS set to monitor for the downlink control information based at least in part on an overlap rule associated with a linking between the first SS set and the second SS set for physical downlink control channel repetitions. The method may include monitoring the identified one or more monitoring occasions in at least the first SS set or the second SS set for downlink control information.SELECTED DRAWING: Figure 3

Description

[Technical Field]

[0001] cross reference This patent application claims priority to U.S. Patent Application No. 17 / 567,989, filed January 4, 2022, by KHOSHNEVISAN et al., entitled "RESOLVING AMBIGUITIES FOR SEARCH SPACE SET LINKING FOR PHYSICAL DOWNLINK CONTROL CHANNEL REPETITION," and U.S. Provisional Patent Application No. 63 / 137,034, filed January 13, 2021, by KHOSHNEVISAN et al., entitled "RESOLVING AMBIGUITIES FOR SEARCH SPACE SET LINKING FOR PHYSICAL DOWNLINK CONTROL CHANNEL REPETITION," each of which is assigned to the assignee of the present application and expressly incorporated herein by reference.

[0002] The following relates to communication management, including resolving ambiguity for search space set linking to physical downlink control channel repetition. [Background technology]

[0003] Wireless communication systems are widely deployed to provide various types of communication content, such as voice, video, packet data, messaging, broadcasts, and so on. These systems may be capable of supporting communication with multiple users by sharing available system resources (e.g., time, frequency, and power). Examples of such multiple-access systems include fourth-generation (4G) systems, such as Long Term Evolution (LTE), LTE-Advanced (LTE-A), or LTE-A Pro systems, and fifth-generation (5G) systems, sometimes referred to as New Radio (NR) systems. These systems may employ technologies such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal frequency division multiple access (OFDMA), or discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-S-OFDM). A wireless multiple-access communication system may include one or more base stations or one or more network access nodes, each simultaneously supporting communication for multiple communication devices, sometimes referred to as user equipment (UE).

[0004] In some NR systems, two search space sets associated with the same control resource set (core set) may overlap, meaning that the two search space sets have overlapping resource blocks, use the same scrambling, and have the same transmission configuration indicator (TCI) state. If a monitoring occasion of a first search space set overlaps with a monitoring occasion of a second search space set, a first physical downlink control channel (PDCCH) candidate in the first search space set may have exactly the same control channel element (CCE) (e.g., the same resource) as a second PDCCH candidate in the second search space set. When this occurs, if the corresponding downlink control information (DCI) formats of the first and second PDCCH candidates have the same size, the PDCCH candidate in the second search space set may not be counted for monitoring with respect to blind decoding. Both PDCCH candidates are considered one PDCCH candidate even though they are in different search space sets. These and other circumstances may lead to ambiguity for a communication system. Summary of the Invention [Problem to be solved by the invention]

[0005] The described techniques relate to improved methods, systems, devices, and apparatuses that support resolving ambiguities for search space set linking for physical downlink control channel repetitions. Generally, the described techniques provide various techniques for resolving PDCCH ambiguities. The ambiguities may relate to two or more monitoring occasions whose search space sets have the same core set being linked together, a third monitoring occasion in a third search space set being linked to one of the search space sets, whether a UE can skip decoding DCI from a linked monitoring occasion if DCI from the other linked monitoring occasion has already been decoded, whether a third monitoring occasion in a search space set can be linked with two separate monitoring occasions in two other search space sets, and whether two monitoring occasions in a single search space set can be linked to monitoring occasions in another search space set. The techniques described herein provide several solutions to these potential ambiguities. [Means for solving the problem]

[0006] A method for wireless communication in a UE is described. The method may include receiving a configuration of a first search space set and a second search space set and identifying a link between the first search space set and the second search space set for a PDCCH repetition. The method may also include identifying one or more monitoring occasions in the first search space set or the second search space set to monitor for DCI based on an overlap rule associated with the link between the first search space set and the second search space set for the PDCCH repetition. The method may also include monitoring the identified one or more monitoring occasions in at least the first search space set or the second search space set for DCI.

[0007] An apparatus for wireless communication in a UE is described. The apparatus may include a processor, memory in electronic communication with the processor, and instructions stored in the memory. The instructions may be executable by the processor to cause the apparatus to receive a configuration of a first search space set and a second search space set and to identify a link between the first search space set and the second search space set for a PDCCH iteration. The instructions may also be executable by the processor to cause the apparatus to identify one or more monitoring occasions in the first search space set or the second search space set to monitor for DCI based on an overlap rule associated with the link between the first search space set and the second search space set for the PDCCH iteration. The instructions may be executable by the processor to cause the apparatus to monitor the identified one or more monitoring occasions in at least the first search space set or the second search space set for DCI.

[0008] Another apparatus for wireless communication in a UE is described. The apparatus may include means for receiving configurations of a first search space set and a second search space set and means for identifying a link between the first search space set and the second search space set for a PDCCH repetition. The apparatus may also include means for identifying one or more monitoring occasions in the first search space set or the second search space set to monitor for DCI based on an overlap rule associated with the link between the first search space set and the second search space set for the PDCCH repetition, and means for monitoring the identified one or more monitoring occasions in at least the first search space set or the second search space set for DCI.

[0009] A non-transitory computer-readable medium storing code for wireless communication in a UE is described. The code may include instructions executable by a processor to receive a configuration of a first search space set and a second search space set and identify a link between the first search space set and the second search space set for a PDCCH iteration. The code may further include instructions executable by the processor to identify one or more monitoring occasions in the first search space set or the second search space set to monitor for DCI based on an overlap rule associated with the link between the first search space set and the second search space set for the PDCCH iteration, and monitor the identified one or more monitoring occasions in at least the first search space set or the second search space set for DCI.

[0010] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining, based on overlap rules, that monitoring occasions of a first search space set do not overlap with monitoring occasions of a second search space set.

[0011] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that the first search space set and the second search space set may be associated with a core set.

[0012] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that there may be no other search space sets linked with the first search space set or the second search space set.

[0013] Some examples of the methods, apparatuses, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for identifying a third search space set having the same monitoring occasions as the first search space set, and monitoring the identified one or more monitoring occasions for the first search space set, the second search space set, and the third search space set based on overlap rules.

[0014] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the overlap rule specifies that the identified one or more monitoring occasions should be monitored independently for the first search space set, the second search space set, and the third search space set.

[0015] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that a first search space set may be associated with a first core set, and that a third search space set may be associated with a second core set different from the first core set, where the overlap rule specifies that a DCI should be sought and monitored in the first search space set, and a second DCI should be sought and monitored in the third search space set.

[0016] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that a first search space set may have a downlink control format of a first size and that a third search space set may have a downlink control format of a second size different from the first size, where an overlap rule specifies that a DCI should be sought and monitored in the first search space set and a second DCI should be sought and monitored in the third search space set.

[0017] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for identifying a link between a third search space set and a fourth search space set for a PDCCH repetition and identifying that a monitoring occasion in the second search space set overlaps with a monitoring occasion in the fourth search space set, where the overlap rule specifies that a DCI should be sought and monitored in the first search space set and a second DCI should be sought and monitored in the third search space set.

[0018] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the first search space set and the third search space set may have the same core set and the same downlink control format size.

[0019] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the third search space set may not be linked with the fourth search space set.

[0020] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the overlap rule directs treating DCI in a third search space set based on the assumption that the third search space set can be linked with the second search space set.

[0021] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for linking a third search space set with a second search space set, where the overlap rules direct treating monitoring occasions of the second search space set as linked with monitoring occasions of the third search space set.

[0022] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for missing monitoring occasions of a third search space set, where the overlap rules determine that monitoring occasions of the first search space set should be monitored.

[0023] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for missing monitoring occasions of a first search space set, where overlap rules determine that monitoring occasions of a third search space set should be monitored.

[0024] Some examples of the methods, apparatuses, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for comparing a first index of a first search space set to a second index of a third search space set and missing a monitoring occasion of the first search space set or the third search space set based on the comparison, where the overlap rule determines which search space sets should be monitored based on the comparison.

[0025] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for missing PDCCH candidates for monitoring occasions of the first search space set or the third search space set, where overlap rules may hold to determine that PDCCH candidates for monitoring occasions of the first search space set or the third search space set should be monitored.

[0026] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that a monitoring occasion of a first search space set overlaps with a monitoring occasion of a second search space set and monitoring for DCI in the first search space set, where the overlap rule directs treating the monitoring occasion of the second search space set as unlinked with the monitoring occasion of the first search space set.

[0027] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that monitoring occasions of a first search space set overlap with monitoring occasions of a second search space set, where the overlap rules determine that the overlapping monitoring occasions should be ignored.

[0028] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, monitoring DCI in at least the first search space set or the second search space set further includes skipping monitoring occasions of the first search space set and monitoring occasions of the second search space set according to an overlap rule.

[0029] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for dropping PDCCH candidates for monitoring occasions in the first search space set.

[0030] Some examples of the methods, apparatuses, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that the first PDCCH candidate and the second PDCCH candidate may have the same DCI payload, the same downlink control format size, and the same radio network temporary identifier, where monitoring the identified one or more monitoring occasions further includes monitoring the first PDCCH candidate in the first search space set and the second PDCCH candidate in the second search space set based on the determining.

[0031] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for receiving a configuration of a radio resource control parameter, where the overlap rule may be based on the radio resource control parameter.

[0032] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that a third search space set may be linked with the first search space set, detecting DCI in one or more monitoring occasions, and determining scheduling information according to overlap rules.

[0033] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the overlap rule may be based on the final symbol of the PDCCH candidate for the first, second, or third search space set, which may occur last in time or have a higher index.

[0034] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the overlap rule may be further based on the DCI being associated with the first search space set.

[0035] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the overlap rule skips monitoring a second monitoring occasion of a first search space set that may be linked with a first monitoring occasion of a second search space set.

[0036] Some examples of the methods, apparatuses, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining, based at least in part on the first monitoring occasion of the first search space set being linked with the first monitoring occasion of the second search space set, that the second monitoring occasion of the first search space set is not linked with the first monitoring occasion of the second search space set.

[0037] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may further include operations, features, means, or instructions for determining that a first monitoring occasion and a second monitoring occasion of a first search space set may be linked with a monitoring occasion of a second search space set, detecting DCI in one or more monitoring occasions, and determining scheduling information according to overlap rules, where the overlap rules may be based on the final symbol of the PDCCH candidate for the first monitoring occasion of the first search space set, the monitoring occasion of the second search space set, or the second monitoring occasion of the first search space set, which occurs last in time.

[0038] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the overlap rule may be further based on detecting DCI among monitoring occasions of a second search space set. [Brief explanation of the drawings]

[0039] [Figure 1]FIG. 1 illustrates an example wireless communication system that supports resolving ambiguity for search space set linking to physical downlink control channel repetitions, according to an aspect of the present disclosure. [Figure 2] FIG. 10 illustrates an example diagram supporting ambiguity resolution for search space set linking to physical downlink control channel repetitions, according to an aspect of the present disclosure. [Figure 3] FIG. 10 is an example block diagram that supports resolving ambiguity for search space set linking to physical downlink control channel repetitions, according to an aspect of the present disclosure. [Figure 4] FIG. 10 is an example block diagram that supports resolving ambiguity for search space set linking to physical downlink control channel repetitions, according to an aspect of the present disclosure. [Figure 5] FIG. 10 is an example block diagram that supports resolving ambiguity for search space set linking to physical downlink control channel repetitions, according to an aspect of the present disclosure. [Figure 6] FIG. 10 is an example block diagram that supports resolving ambiguity for search space set linking to physical downlink control channel repetitions, according to an aspect of the present disclosure. [Figure 7] FIG. 10 is an example block diagram that supports resolving ambiguity for search space set linking to physical downlink control channel repetitions, according to an aspect of the present disclosure. [Figure 8] FIG. 10 is an example block diagram that supports resolving ambiguity for search space set linking to physical downlink control channel repetitions, according to an aspect of the present disclosure. [Figure 9] FIG. 10 is a block diagram of a device that supports resolving ambiguity for search space set linking to physical downlink control channel repetitions, according to an aspect of the disclosure. [Figure 10]FIG. 10 is a block diagram of a device that supports resolving ambiguity for search space set linking to physical downlink control channel repetitions, according to an aspect of the disclosure. [Figure 11] FIG. 10 is a block diagram of a communications manager that supports resolving ambiguity for search space set linking to physical downlink control channel iterations, according to an aspect of the disclosure. [Figure 12] FIG. 10 is a diagram of a system including a device that supports resolving ambiguity for search space set linking to physical downlink control channel repetitions, according to an aspect of the disclosure. [Figure 13] 10 is a flowchart illustrating a method for supporting ambiguity resolution for search space set linking to physical downlink control channel iterations, according to an aspect of the present disclosure. DETAILED DESCRIPTION OF THE INVENTION

[0040] The described techniques relate to improved methods, systems, devices, and apparatuses that support resolving ambiguity for search space set linking for PDCCH repetition. PDCCH repetition may be used, for example, to increase reliability. The network may use two different beams to transmit the repeated PDCCH in an attempt to obtain redundancy. If one beam is blocked or the aggregation level is too small, the UE may potentially be able to decode DCI from the other beam. However, some of the scheduling information in the DCI may not be solely from the DCI payload and may be a function of which PDCCH candidate is decoded. Due to this, it may be important for the network and the UE to know which DCI the UE has decoded. However, PDCCH repetition may create some ambiguity.

[0041] DCI detected in two linked search space sets for PDCCH repetitions may be interpreted differently than DCI detected in unlinked search space sets. When a UE is configured for PDCCH repetitions, the UE may decode only one of the repetitions, or both when soft-combined. When a DCI is decoded, the network does not know which DCI the UE decoded (which single DCI, or whether both were decoded in the case of soft-combining). Scheduling information determined by the UE from the DCI may also be a function of the time or resource on which the DCI is detected, so it is desirable to be able to resolve ambiguities. To resolve these ambiguities, various overlap rules are proposed.

[0042] Generally, the described techniques provide various ways to resolve PDCCH ambiguity. A first ambiguity may relate to two or more monitoring occasions being linked together, where the search space sets have the same core set. To resolve this ambiguity, the UE may either give an error if the monitoring occasions overlap, or the UE may not monitor the overlapping monitoring occasions.

[0043] The second ambiguity may relate to the third monitoring occasion of the third search space set being linked with one of the first and second search space sets. In some examples, the UE may not expect the third search space set to overlap the first search space set unless certain conditions apply. These conditions may include the third search space set and the first search space set being associated with different core sets if they have different control information format sizes or if the third search space set is linked with the fourth search space set. Alternatively, if these conditions are not met, the UE may assume that the third search space set is linked with the second search space set and may ignore the monitoring occasion of the third search space set or may ignore the monitoring occasion of the first search space set. In some examples, which monitoring occasions the UE ignores may be based on the index of the search space set. These examples may also be at the PDCCH candidate level or may be determined at the PDCCH candidate level.

[0044] A third ambiguity may arise when a UE decodes DCI from linked monitoring occasions. The techniques described herein allow a UE to skip decoding a second DCI from a linked monitoring occasion if a first DCI from another linked monitoring occasion has already been decoded. Skipping decoding the second DCI may result in power savings in the UE. Having different DCIs may be assessed by having different DCI payloads, including different DCI format sizes, different DCI formats, or different radio network temporary identifiers.

[0045] A fourth ambiguity concerns whether the third monitoring occasion of the third search space set can be linked with two separate monitoring occasions of the other two search space sets. In some examples, the UE does not expect that there will be a third search space set linked with the first search space set. Other techniques allow the UE to consider DCI in the third monitoring occasion to be linked to the first search space set. Which DCI the UE can use for scheduling information may be determined according to a final symbol rule or an index rule.

[0046] The fifth ambiguity concerns whether two monitoring occasions of a single search space set can be linked to monitoring occasions of another search space set. Some techniques indicate that the UE does not expect the second monitoring occasion of a first search space set to be linked to a monitoring occasion of a second search space set. An alternative technique indicates that if the second monitoring occasion of a first search space set is also linked to a monitoring occasion of a second search space set, detected DCI in any of the monitoring occasions may be interpreted according to a rule that takes all three monitoring occasions into account. Which DCI to use may be determined according to a last symbol rule or an index rule. These examples may also be applied at the PDCCH candidate level.

[0047] Aspects of the present disclosure are first described in the context of a wireless communication system. Aspects of the present disclosure are further illustrated by and described with reference to swim and block diagrams. Aspects of the present disclosure are further illustrated by and described with reference to apparatus, system, and flow chart diagrams relating to resolving ambiguity for search space set linking to physical downlink control channel iterations.

[0048] 1 illustrates an example of a wireless communication system 100 that supports resolving ambiguity for search space set linking to physical downlink control channel iterations in accordance with an aspect of the present disclosure. The wireless communication system 100 may include one or more base stations 105, one or more UEs 115, and a core network 130. In some examples, the wireless communication system 100 may be a Long Term Evolution (LTE) network, an LTE-Advanced (LTE-A) network, an LTE-A Pro network, or a New Radio (NR) network. In some examples, the wireless communication system 100 may support enhanced broadband communications, ultra-reliable (e.g., mission-critical) communications, low-latency communications, communications with low-cost and low-complexity devices, or any combination thereof.

[0049] The base stations 105 may be dispersed throughout a geographic area to form the wireless communication system 100 and may be devices of different forms or with different capabilities. The base stations 105 and the UEs 115 may communicate wirelessly via one or more communication links 125. Each base station 105 may provide a coverage area 110 over which the UEs 115 and the base station 105 may establish one or more communication links 125. The coverage area 110 may be an example of a geographic area over which the base stations 105 and the UEs 115 may support communication of signals according to one or more radio access technologies.

[0050] The UEs 115 may be dispersed throughout the coverage area 110 of the wireless communication system 100, and each UE 115 may be fixed or mobile or both at different times. The UEs 115 may be devices of different forms or with different capabilities. Some example UEs 115 are shown in FIG. 1. The UEs 115 described herein may be able to communicate with various types of devices, such as other UEs 115, base stations 105, or network equipment (e.g., core network nodes, relay devices, integrated access and backhaul (IAB) nodes, or other network equipment), as shown in FIG. 1.

[0051] The base stations 105 may communicate with the core network 130, with each other, or both. For example, the base stations 105 may interface with the core network 130 through one or more backhaul links 120 (e.g., via an S1, N2, N3, or other interface). The base stations 105 may communicate with each other via the backhaul links 120 (e.g., via an X2, Xn, or other interface), either directly (e.g., directly between the base stations 105) or indirectly (e.g., via the core network 130), or both. In some examples, the backhaul links 120 may be or may include one or more wireless links.

[0052] One or more of the base stations 105 described herein may include or be referred to as a base transceiver station, radio base station, access point, radio transceiver, Node B, eNode B (eNB), Next Generation Node B or GigaNode B (any of which may be referred to as gNB), Home Node B, Home eNode B, or other suitable terminology by those skilled in the art.

[0053] The UE 115 may include or be referred to as a mobile device, a wireless device, a remote device, a handheld device, or a subscriber device, or some other suitable terminology, where a “device” may also be referred to as a unit, a station, a terminal, or a client, among other examples. The UE 115 may also include or be referred to as a personal electronic device, such as a cellular phone, a personal digital assistant (PDA), a tablet computer, a laptop computer, or a personal computer. In some examples, the UE 115 may include or be referred to as a wireless local loop (WLL) station, an Internet of Things (IoT) device, an Internet of Everything (IoE) device, or a machine-type communication (MTC) device, among other examples, which may be implemented in various items, such as an appliance, a vehicle, a meter, among other examples.

[0054] The UEs 115 described herein may be able to communicate with various types of devices, such as other UEs 115, which may act as relays, as shown in FIG. 1, as well as base stations 105 and network equipment, including macro eNBs or gNBs, small cell eNBs or gNBs, or relay base stations, among other examples.

[0055] The UE 115 and the base station 105 may communicate wirelessly with each other via one or more communication links 125 on one or more carriers. The term “carrier” may refer to a set of radio frequency spectrum resources having a defined physical layer structure for supporting the communication link 125. For example, a carrier used for the communication link 125 may include a portion (e.g., a bandwidth portion (BWP)) of a radio frequency spectrum band operated according to one or more physical layer channels for a given radio access technology (e.g., LTE, LTE-A, LTE-A Pro, NR). Each physical layer channel may carry acquisition signaling (e.g., synchronization signals, system information), control signaling coordinating operation on the carrier, user data, or other signaling. The wireless communication system 100 may support communication with the UE 115 using carrier aggregation or multi-carrier operation. The UE 115 may be configured with multiple downlink component carriers and one or more uplink component carriers according to a carrier aggregation configuration. Carrier aggregation can be used with both frequency division duplex (FDD) and time division duplex (TDD) component carriers.

[0056] In some examples (e.g., in a carrier aggregation configuration), a carrier may also have acquisition or control signaling to coordinate operation with other carriers. A carrier may be associated with a frequency channel (e.g., an Evolved Universal Mobile Telecommunications System Terrestrial Radio Access (E-UTRA) Absolute Radio Frequency Channel Number (EARFCN)) and may be arranged according to a channel raster for discovery by the UE 115. A carrier may be operated in a standalone mode, where initial acquisition and connection may be made by the UE 115 over the carrier, or the carrier may be operated in a non-standalone mode, where connection is anchored using a different carrier (e.g., of the same or different radio access technology).

[0057] The communication links 125 shown in the wireless communication system 100 may include uplink transmissions from the UE 115 to the base station 105 or downlink transmissions from the base station 105 to the UE 115. A carrier may carry downlink or uplink communications (e.g., in FDD mode) or may be configured to carry downlink and uplink communications (e.g., in TDD mode).

[0058] A carrier may be associated with a particular bandwidth of the radio frequency spectrum, and in some examples, the carrier bandwidth may be referred to as the carrier or the “system bandwidth” of the wireless communication system 100. For example, the carrier bandwidth may be one of several determined bandwidths for a particular radio access technology carrier (e.g., 1.4, 3, 5, 10, 15, 20, 40, or 80 megahertz (MHz)). The devices of the wireless communication system 100 (e.g., the base station 105, the UE 115, or both) may have a hardware configuration that supports communication over a particular carrier bandwidth or may be configurable to support communication over one of a set of carrier bandwidths. In some examples, the wireless communication system 100 may include a base station 105 or a UE 115 that supports simultaneous communication over carriers associated with multiple carrier bandwidths. In some examples, each served UE 115 may be configured to operate over a portion (e.g., a sub-band, BWP) or all of the carrier bandwidth.

[0059] A signal waveform transmitted on a carrier may be composed of multiple subcarriers (e.g., using a multi-carrier modulation (MCM) technique such as orthogonal frequency division multiplexing (OFDM) or discrete Fourier transform spread OFDM (DFT-S-OFDM)). In a system employing an MCM technique, a resource element may consist of one symbol period (e.g., the duration of one modulation symbol) and one subcarrier, where the symbol period and subcarrier spacing are inversely related. The number of bits carried by each resource element may depend on the modulation scheme (e.g., the order of the modulation scheme, the coding rate of the modulation scheme, or both). Thus, the more resource elements the UE 115 receives and the higher the order of the modulation scheme, the higher the data rate may be for the UE 115. Wireless communication resources may refer to a combination of radio frequency spectrum resources, time resources, and spatial resources (e.g., spatial layers or beams), and the use of multiple spatial layers may further increase the data rate or data integrity for communications with the UE 115.

[0060] One or more numerologies for a carrier may be supported, where the numerology may include a subcarrier spacing (Δf) and a cyclic prefix. A carrier may be divided into one or more BWPs having the same or different numerologies. In some examples, a UE 115 may be configured with multiple BWPs. In some examples, a single BWP for a carrier may be active at a given time, and communication for the UE 115 may be limited to one or more active BWPs.

[0061] The time interval for the base station 105 or the UE 115 may be, for example, T s =1 / (Δf max N f ) seconds, where Δf max may represent the maximum supported subcarrier spacing, and N fmay represent the maximum supported discrete Fourier transform (DFT) size. The communication resource time intervals may be organized according to radio frames, each having a specified duration (e.g., 10 milliseconds (ms)). Each radio frame may be identified by a system frame number (SFN) (e.g., ranging from 0 to 1023).

[0062] Each frame may include multiple consecutively numbered subframes or slots, and each subframe or slot may have the same duration. In some examples, a frame may be divided (e.g., in the time domain) into subframes, and each subframe may be further divided into several slots. Alternatively, each frame may include a variable number of slots, and the number of slots may depend on the subcarrier spacing. Each slot may include several symbol periods (e.g., depending on the length of a cyclic prefix prepended to each symbol period). In some wireless communications systems 100, a slot may be further divided into multiple minislots, each containing one or more symbols. Excluding the cyclic prefix, each symbol period may include one or more (e.g., N f The duration of a symbol period may depend on the subcarrier spacing or the frequency band of operation.

[0063] A subframe, slot, minislot, or symbol may be the smallest scheduling unit (e.g., in the time domain) of the wireless communication system 100 and may be referred to as a transmission time interval (TTI). In some examples, the TTI duration (e.g., the number of symbol periods in a TTI) may be variable. Additionally or alternatively, the smallest scheduling unit of the wireless communication system 100 may be dynamically selected (e.g., within a burst of shortened TTIs (sTTIs)).

[0064] Physical channels may be multiplexed on carriers according to various techniques. Physical control channels and physical data channels may be multiplexed on downlink carriers using, for example, one or more of a time division multiplexing (TDM) technique, a frequency division multiplexing (FDM) technique, or a hybrid TDM-FDM technique. A control region (e.g., a control resource set (core set)) for a physical control channel may be defined by a number of symbol periods and may extend across the system bandwidth of the carrier or a subset of the system bandwidth. One or more control regions (e.g., core sets) may be configured for a set of UEs 115. For example, one or more of the UEs 115 may monitor or search the control region for control information according to one or more search space sets, and each search space set may include one or more control channel candidates at one or more aggregation levels arranged in a cascaded manner. The aggregation level for a control channel candidate may refer to the number of CCEs associated with coded information for a control information format having a given payload size. The search space sets may include a common search space set configured to send control information to multiple UEs 115 and a UE-specific search space set for sending control information to a specific UE 115.

[0065] In some examples, the base stations 105 may be mobile and thus may provide communication coverage to moving geographic coverage areas 110. In some examples, different geographic coverage areas 110 associated with different technologies may overlap, but the different geographic coverage areas 110 may be supported by the same base station 105. In other examples, overlapping geographic coverage areas 110 associated with different technologies may be supported by different base stations 105. The wireless communication system 100 may include a heterogeneous network, for example, where different types of base stations 105 provide coverage to various geographic coverage areas 110 using the same or different radio access technologies.

[0066] Some UEs 115 may be configured to employ operating modes that reduce power consumption, such as half-duplex communication (e.g., a mode that supports one-way communication via transmission or reception, but not simultaneous transmission and reception). In some examples, half-duplex communication may be performed at a reduced peak rate. Other power-saving techniques for UEs 115 include entering a power-saving deep sleep mode when not engaged in active communication, operating over a limited bandwidth (e.g., pursuant to narrowband communication), or a combination of these techniques. For example, some UEs 115 may be configured for operation using a narrowband protocol type associated with a defined portion or range (e.g., a set of subcarriers or resource blocks (RBs)) within a carrier, within a guard band of a carrier, or outside a carrier.

[0067] The wireless communication system 100 may be configured to support ultra-reliable or low-latency communications, or various combinations thereof. For example, the wireless communication system 100 may be configured to support ultra-reliable low-latency communications (URLLC) or mission-critical communications. The UE 115 may be designed to support ultra-reliable, low-latency, or critical functionality (e.g., mission-critical functionality). Ultra-reliable communications may include private or group communications and may be supported by one or more mission-critical services, such as mission-critical push-to-talk (MCPTT), mission-critical video (MCVideo), or mission-critical data (MCData). Support for mission-critical functionality may include service prioritization, and the mission-critical services may be used for public safety or general commercial applications. The terms ultra-reliable, low-latency, mission-critical, and ultra-reliable low-latency may be used interchangeably herein.

[0068] In some examples, the UE 115 may also be able to communicate directly with other UEs 115 via a device-to-device (D2D) communication link 135 (e.g., using a peer-to-peer (P2P) protocol or a D2D protocol). One or more UEs 115 utilizing D2D communication may be within the geographic coverage area 110 of the base station 105. Other UEs 115 in such a group may be outside the geographic coverage area 110 of the base station 105 or may in some cases be unable to receive transmissions from the base station 105. In some examples, a group of UEs 115 communicating via D2D communication may utilize a one-to-many (1:M) system in which each UE 115 transmits to every other UE 115 in the group. In some examples, the base station 105 facilitates scheduling of resources for D2D communication. In other cases, D2D communication is performed between UEs 115 without the involvement of the base station 105.

[0069] The core network 130 may provide user authentication, access authorization, tracking, Internet Protocol (IP) connectivity, and other access, routing, or mobility functions. The core network 130 may be an Evolved Packet Core (EPC) or 5G Core (5GC), which may include at least one control plane entity (e.g., a Mobility Management Entity (MME), an Access and Mobility Management Function (AMF)) that manages access and mobility, and at least one user plane entity (e.g., a Serving Gateway (S-GW), a Packet Data Network (PDN) Gateway (P-GW), or a User Plane Function (UPF)) that routes packets or interconnects to external networks. The control plane entity may manage non-access stratum (NAS) functions, such as mobility, authentication, and bearer management, for UEs 115 served by base stations 105 associated with the core network 130. User IP packets may be forwarded through the user plane entity, which may provide IP address allocation and other functions. The user plane entities may be connected to IP services 150 for one or more network operators. The IP services 150 may include access to the Internet, an intranet, an IP Multimedia Subsystem (IMS), or packet-switched streaming services.

[0070] Some of the network devices, such as the base stations 105, may include sub-components such as an access network entity 140, which may be an example of an access node controller (ANC). Each access network entity 140 may communicate with the UE 115 through one or more other access network transmitting entities 145, which may be referred to as a radio head, a smart radio head, or a transmit / receive point (TRP). Each access network transmitting entity 145 may include one or more antenna panels. In some configurations, various functions of each access network entity 140 or base station 105 may be distributed across various network devices (e.g., radio heads and ANCs) or integrated into a single network device (e.g., the base station 105).

[0071] The wireless communication system 100 may operate using one or more frequency bands, typically in the range of 300 megahertz (MHz) to 300 gigahertz (GHz). The 300 MHz to 3 GHz region is commonly referred to as the ultra-high frequency (UHF) region or decimeter band because wavelengths range in length from approximately 1 decimeter to 1 meter. Although UHF waves may be blocked or redirected by buildings and environmental features, the waves can penetrate structures sufficiently for a macrocell to provide service to UEs 115 located indoors. Transmission of UHF waves may involve smaller antennas and shorter distances (e.g., less than 100 kilometers) compared to transmissions using lower frequencies and longer waves in the short wave (HF) or very high frequency (VHF) portions of the spectrum below 300 MHz.

[0072] The wireless communication system 100 may utilize both licensed and unlicensed radio frequency spectrum bands. For example, the wireless communication system 100 may employ licensed-assisted access (LAA), LTE-unlicensed (LTE-U) radio access technology, or NR technology in an unlicensed band, such as the 5 GHz Industrial, Scientific, and Medical (ISM) band. When operating in an unlicensed radio frequency spectrum band, devices such as the base station 105 and the UE 115 may employ carrier sensing for collision detection and collision avoidance. In some examples, operation in an unlicensed band may be based on a carrier aggregation configuration in conjunction with component carriers operating in a licensed band (e.g., LAA). Operation in an unlicensed spectrum may include downlink transmissions, uplink transmissions, P2P transmissions, or D2D transmissions, among other examples.

[0073] The base station 105 or the UE 115 may be equipped with multiple antennas that can be used to employ techniques such as transmit diversity, receive diversity, multiple-input multiple-output (MIMO) communications, or beamforming. The antennas of the base station 105 or the UE 115 may be located in one or more antenna arrays or antenna panels that can support MIMO operation or transmit or receive beamforming. For example, one or more base station antennas or antenna arrays may be co-located in an antenna assembly such as an antenna tower. In some examples, antennas or antenna arrays associated with the base station 105 may be located in various geographic locations. The base station 105 may have an antenna array with several rows and columns of antenna ports that the base station 105 may use to support beamforming of communications with the UE 115. Similarly, the UE 115 may have one or more antenna arrays that can support various MIMO or beamforming operations. Additionally or alternatively, the antenna panel may support radio frequency beamforming for signals transmitted through the antenna ports.

[0074] Beamforming, sometimes referred to as spatial filtering, directional transmission, or directional reception, is a signal processing technique that may be used at a transmitting or receiving device (e.g., base station 105, UE 115) to shape or steer an antenna beam (e.g., transmit beam, receive beam) along a spatial path between the transmitting and receiving devices. Beamforming may be achieved by combining signals communicated through antenna elements of an antenna array such that some signals propagating in a particular orientation relative to the antenna array experience constructive interference, while other signals experience destructive interference. Adjusting signals communicated through antenna elements may include the transmitting or receiving device applying an amplitude offset, a phase offset, or both to signals carried through the antenna element associated with the device. The adjustment associated with each of the antenna elements may be defined by a beamforming weight set associated with a particular orientation (e.g., relative to the antenna array of the transmitting or receiving device, or to some other orientation).

[0075] The UE 115 and the base station 105 may support retransmission of data to increase the likelihood that the data is successfully received. Hybrid automatic repeat request (HARQ) feedback is one technique for increasing the likelihood that data is correctly received over the communication link 125. HARQ may include a combination of error detection (e.g., using a cyclic redundancy check (CRC)), forward error correction (FEC), and retransmission (e.g., automatic repeat request (ARQ)). HARQ may improve throughput at the MAC layer in poor radio conditions (e.g., low signal-to-noise conditions). In some examples, a device may support same-slot HARQ feedback, in which the device may provide HARQ feedback in a particular slot for data received in a previous symbol in that slot. In other cases, the device may provide HARQ feedback in a subsequent slot or according to some other time interval.

[0076] The UE 115 may include a communications manager 160. The communications manager 160 may receive configurations of a first search space set and a second search space set. The communications manager 160 may identify a link between the first search space set and the second search space set for a physical downlink control channel iteration. The communications manager 160 may also identify one or more monitoring occasions in the first search space set or the second search space set to monitor for downlink control information based at least in part on overlap rules associated with the link between the first search space set and the second search space set for the physical downlink control channel iteration. The communications manager 160 may also monitor the identified one or more monitoring occasions in at least the first search space set or the second search space set for downlink control information.

[0077] The communications manager 160 may resolve ambiguity at the UE 115 regarding PDCCH repetitions. The communications manager 160 may improve communication reliability, reduce complexity, reduce retransmissions, reduce latency, improve throughput, and improve power conservation at the UE 115.

[0078] 2 illustrates an example diagram 200 supporting ambiguity resolution for search space set linking to physical downlink control channel iterations in accordance with aspects of the present disclosure. Diagram 200 may implement or be implemented by various aspects of wireless communications system 100, among other examples. Diagram 200 may include UE 115-a and base station 105-a. UE 115-a may be an example of an aspect of UE 115 as described herein. Base station 105-a may be an example of an aspect of base station 105 as described herein.

[0079] At 205, the UE 115-a may be configured for two or more search space sets. In some examples, the base station 105-a may configure the UE 115-a for a search space set. In other examples, the UE 115-a configures itself for a search space set according to specifications. When configuring the PDCCH, the UE 115-a can have up to three or five core sets within a given bandwidth portion for a component carrier. The core sets may be used to configure the PDCCH. Characteristics of the core set may include the TCI state for the PDCCH, the number of resource blocks in the frequency domain, and the number of symbols in the time domain. Other characteristics of the core set may include the CCE resource element group (REG) bundle mapping type, precoding granularity, and scrambling identifier (ID). These parameters may be used for the PDCCH demodulation reference signal (DMRS) or coded bits of the DCI content. In some examples, the CCE-REG bundle mapping type may be the same as the REG bundle for narrowband channel estimation or wideband precoding across core sets.

[0080] Once a core set is configured, one or more search space sets may also be configured for monitoring the PDCCH. In some examples, the UE 115-a may be configured with up to 10 search space sets in a given BWP. As part of the configuration of the search space sets, each search space set may be associated with a given core set, which may be identified. The number of symbols may be the only time-domain behavior within the core set, and which slots and symbols may be used for the PDCCH may be part of the configuration of the search space set.

[0081] The search space set may be configured with respect to the time domain, the PDCCH monitoring occasion, and the periodicity (e.g., number of slots) and offset to determine which slots are monitored. s slots) and offset (o sThe periodicity (shown as k slots) may be configured using the parameter monitoringSlotPeriodicityAndOffset in units of slots. For example, if the periodicity is 5 slots (k s = 5 slots), there may be one search space for each period (e.g., out of the 5 slots, there is at least one slot in which a search space exists).

[0082] The search space set may also be a parameter duration (T s ) may be constructed using (for example, T s <k s ). If the parameter duration is 2, then in each periodicity of 5 slots, there is a search space set within two of the slots.

[0083] Within each slot in which a search space set exists, the parameter MonitoringSymbolsWithinSlot may indicate the PDCCH monitoring pattern within the slot. The PDCCH monitoring pattern may be a 14-symbol bitmap, and every 1 in the bitmap (e.g., 010000100000) may indicate the first symbol of the core set for that monitoring occasion. If there are three 1s in the bitmap, there are three monitoring occasions within the slot, and the location of the 1 indicates the first symbol of the core set for that monitoring occasion. For example, if the search space set is assumed to have three symbols, there are three monitoring occasions for each slot of the PDCCH in which the search space set is monitored.

[0084] The type of search space set may be a UE-specific or a common search space set type. The configuration at 205 may also configure which DCI formats the UE 115-a will monitor.

[0085] PDCCH candidates may also be configured as part of the search space set configuration at 205. For example, several PDCCH candidates may be configured for each aggregation level.

[0086] For a PDCCH repetition, each repetition may be a PDCCH candidate. For a possible repetition of the same DCI, two PDCCH candidates may be linked together. The two PDCCH candidates should have the same aggregation level (e.g., the same number of CCEs), and the DCI payloads transmitted by the two PDCCH candidates are the same. Thus, the UE 115-a can perform soft combining to decode the DCI using the two PDCCH candidates (e.g., two PDCCH repetitions). In some examples, for a PDCCH repetition, two PDCCH candidates in different search space sets (e.g., associated with different core sets) may be linked together.

[0087] For example, the UE 115-a may use different search space sets that are configured to be linked together for repetitions. For example, a search space set with index 2 may be linked with a search space set with index 4. Each search space set has a different monitoring occasion (e.g., within a slot or across slots). For PDCCH repetitions and monitoring occasions, a monitoring occasion of a first search space set may be associated with or linked to a monitoring occasion of a second search space set. The techniques described herein provide a mechanism (e.g., rule-based or configuration-based) to enable the UE 115-a to resolve ambiguities arising from PDCCH repetitions.

[0088] To link two PDCCH candidates that may occur within a first monitoring occasion of a first search space set and a second monitoring occasion of a second search space set, one or more of several methods for linking may be used. For example, two PDCCH candidates with the same candidate index across two search space sets may be linked. In another example, two PDCCH candidates with the same starting CCE may be linked. In another example, the linking may be explicitly provided as a radio resource control (RRC) configuration. The RRC configuration may identify which candidate in the first search space set is linked with which candidate in the second search space set, which may be configured for the UE 115-a. For example, a candidate index in some search space sets may be linked with another candidate index in the second search space set.

[0089] In some examples, DCI detected in two linked search space sets for PDCCH repetitions may be interpreted differently than DCI detected in an unlinked search space set. When the UE 115-a is configured for PDCCH repetitions, the UE 115-a may decode only one of the repetitions (e.g., the first or second repetition), or both when soft-combined. When the DCI is decoded, the network does not know which of these scenarios occurred. That is, the base station 105-a may not know which DCI the UE 115-a decoded or whether the UE 115-a used soft-combining. However, the information the UE 115-a determines as a result of PDCCH format detection may be a function not only of the DCI payload but also of the time or resource at which the DCI is detected. For example, the last or first symbol of the DCI used as a reference may affect the scheduling information, which may cause some ambiguity. In contrast, if the scheduling information were directly in the DCI payload, there would be no ambiguity because the UE 115-a would have all of the information once one instance of the DCI was decoded. However, because some of these rules described above are not a function of the DCI payload, but also of the resources in terms of time and frequency of the DCI, there could be some ambiguity because the base station 105-a would then not know which resources were used. That is, the base station 105-a would not know whether the UE 115-a decoded the first DCI repetition, the second DCI repetition, or the soft-combined DCI.

[0090] Some examples of how the scheduling information determined by the UE 115-a may be a function of the time and resource on which the DCI is detected are as follows: For example, a slot offset for the scheduled physical downlink shared channel (PDSCH), physical uplink shared channel (PUSCH), channel state information reference signal (CSI-RS), or sounding reference signal (SRS) may be applied to the slot in which the scheduling DCI is detected. The slot offset may be indicated in the DCI itself, but the reference time for starting counting at that offset would start from the slot in which the DCI is detected.

[0091] Another example of how scheduling information may be a function of the time and resource on which DCI is detected may include which physical uplink control channel (PUCCH) resource to use for a HARQ acknowledgement (ACK) may be a function of the starting CCE of the detected PDCCH and the number of CCEs in the core set within which the PDCCH is detected.

[0092] Another example of how scheduling information may be a function of the time and resource at which the DCI is detected relates to the UE 115-a determining whether the scheduled PDSCH should be received based on a default beam or based on an indicated beam in the DCI. To make this determination, the UE 115-a may compare the scheduling offset between the end of the DCI and the beginning of the PDCCH to a threshold. The threshold may be a UE capability threshold for beam switching capability. If the scheduling offset is less than the threshold, the UE 115-a may apply the default beam. If it is greater, the UE 115-a may use the indicated beam.

[0093] In another example, the UE 115-a may rate-match the scheduled PDSCH around the resources of the scheduling DCI in case of resource overlap. In some examples, when a PDSCH is scheduled, if the DCI resources on which the PDSCH is scheduled overlap with the PDSCH resources, the PDSCH may be rate-matched around the resources of the scheduling DCI.

[0094] Because the scheduling information may be based in part on the resources used as shown above, to avoid ambiguity between the UE 115-a and the base station 105-a in the case of PDCCH repetition, regardless of which of the two linked candidates the UE 115-a actually decoded, or both, some rules or configurations may be useful. In cases where the time of the detected DCI is used as a reference (e.g., the first symbol or the last symbol), the first or last symbol of the earlier or later PDCCH candidate should be used. Some rules may specify that the first or last symbol of the earlier PDCCH candidate should be used. Other rules may specify that the first or last symbol of the later PDCCH candidate should be used. In other cases (e.g., rate matching), both candidates may be taken into account (e.g., the PDSCH may be rate matched around both linked PDCCH candidates). Additionally, some other rules may be based at least in part on the index of the first or second search space set for the starting CCE and some CCEs for the PUCCH resource determination (e.g., candidates in the search space set with higher or lower indexes are taken into account to determine some scheduling information). There may be other rules that specify additional or alternative information besides the DCI payload information for determining the scheduling information.

[0095] Regardless of which rule is used, when PDCCH repetition is used, DCI detected in two linked search space sets may be interpreted differently compared to DCI without PDCCH repetition. When DCI is transmitted via PDCCH repetition, there may be several alternatives for PUCCH resource determination for HARQ-ACK when the corresponding PUCCH resource set has a size greater than 8. First, UE 115-a may ensure that the same starting CCE index (which may be based at least in part on the linking option) and the same number of CCEs are in the two core sets (based at least in part on the core set configuration constraint). In another example, the starting CCE index and the number of CCEs in the core set of one of the linked PDCCH candidates may be applied. In another example, UE 115-a may determine the PUCCH resource based at least in part on the starting CCE index and the number of CCEs in the core set of one of the two linked PDCCH candidates. In other examples, other rules may be used. There is no ambiguity for PDCCH repetitions as one candidate is fixed and known by both the UE 115-a and the base station 105-a.

[0096] Returning to FIG. 2, the UE 115-a may be configured for PDCCH repetition at 205. Because there may be ambiguity resulting from the PDCCH repetition, the UE 115-a may use one or more of several techniques to resolve the ambiguity. These various techniques for resolving the ambiguity may be referred to as overlap rules. The overlap rules may be applied at the monitoring occasion level or the PDCCH candidate level.

[0097] At 210, the UE 115-a may identify a link between the first and second search space sets for the PDCCH repetition. The link may associate one or more monitoring occasions of each search space set together.

[0098] At 215, the UE 115-a may identify one or more monitoring occasions in the first search space set or the second search space set to monitor for DCI based at least in part on an overlap rule associated with a link between the first search space set and the second search space set for a physical downlink control channel iteration. Various overlap rules are contemplated and are described below with respect to Figures 3-8. At 220, the UE 115-a may monitor the identified monitoring occasions in at least the first search space set or the second search space set for DCI.

[0099] For example, if both linked search space sets for UE 115-a are associated with the same core set, either UE 115-a may give an error if the monitoring occasions overlap, or UE 115-a may not monitor the overlapping monitoring occasions.

[0100] In another example, when a first search space set is linked with a second search space set for a PDCCH repetition, the UE 115-a may not expect a third search space set to overlap with monitoring occasions of the first search space set unless certain conditions apply. These conditions may include the third search space set and the first search space set being associated with different core sets or having different control information format sizes, or whether the third search space set is linked with a fourth search space set. Alternatively, if these conditions are not met, the UE 115-a may assume that the third search space set is linked with the second search space set, and the UE 115-a may ignore monitoring occasions of the third search space set, or the UE 115-a may ignore monitoring occasions of the first search space set. In some examples, which monitoring occasions the UE 115-a ignores may be based at least in part on the index of the search space set. These examples may also be at or determined at the PDCCH candidate level, which is one level inside the monitoring occasion.

[0101] In another example, the UE 115-a may have two linked search space sets, decode only one, and skip the next search space set to save power. In this example, the UE 115-a may have to assume that the two linked candidates have the same DCI. Having different DCI may be assessed by having different DCI payloads, including different DCI format sizes, different DCI formats, or different radio network temporary identifiers.

[0102] Another example provides clarity on whether the first search space set can be linked to the second and third search space sets. In one option, the UE 115-a does not expect there to be a third search space set linked to the first search space set. Alternatively, if the first search space set and the third search space set are linked, if the UE 115-a detects another DCI, the UE 115-a may consider it to be linked to the first search space set. Which DCI to use may be determined according to a last symbol rule or an index rule. In some examples, which DCI to use may also be conditional on the UE 115-a detecting a DCI from the first search space set.

[0103] Another example addresses the ambiguity of whether a second monitoring occasion in a first search space set can be linked with a monitoring occasion in a second search space set when the first monitoring occasion in a first search space set and the second monitoring occasion in a second search space set are linked. In one option, the UE 115-a does not expect the second monitoring occasion in a first search space set to be linked with a monitoring occasion in a second search space set. Alternatively, when the second monitoring occasion in a first search space set is also linked with a monitoring occasion in a second search space set, a detected DCI in any of the monitoring occasions is interpreted according to a rule that takes all three monitoring occasions into account. Which DCI to use may be determined according to a last symbol rule or an index rule. In some examples, which DCI to use may also be conditioned on the UE 115-a detecting a DCI from the first search space set. These examples may also be applied at the PDCCH candidate level.

[0104] Regardless of which technique the UE 115-a uses to resolve PDCCH repetition ambiguity, the UE 115-a may monitor the identified one or more monitoring occasions in at least the first search space set or the second search space set for downlink control information at 220. The base station 105-a may transmit the DCI to the UE 115-a at 225, and the monitoring UE 115-a may detect the DCI.

[0105] The techniques described herein may resolve ambiguities at the UE 115-a and the base station 105-a regarding PDCCH repetition, which may improve communication reliability, reduce retransmissions, reduce latency, improve throughput, and improve power savings at the UE 115-a.

[0106] 3 illustrates an example block diagram 300 that supports resolving ambiguity for search space set linking to physical downlink control channel iterations in accordance with aspects of the present disclosure. Diagram 300 may implement or be implemented by various aspects of wireless communications system 100, among other examples. Diagram 300 illustrates a 14-symbol slot 305.

[0107] A slot 305 may be scheduled to have a first monitoring occasion 310 of a first search space set and a first monitoring occasion 315 of a second search space set. In the example of Figure 3, the first monitoring occasion 310 and the first monitoring occasion 315 overlap. The slot 305 may also have a second monitoring occasion 320 of the first search space set and a second monitoring occasion 330 of the second search space set.

[0108] When two search space sets are associated with the same core set (e.g., the same resource blocks, the same scrambling, and the same TCI state) and the first monitoring occasion 310 of a first search space set overlaps with the first monitoring occasion 315 of a second search space set, it is possible for a first PDCCH candidate in the first search space set to have exactly the same CCE as a second PDCCH candidate in the second search space set. In such a case, if the corresponding DCI formats for the PDCCH candidates have the same size, the PDCCH candidates in the second search space set (e.g., the search space set with the larger index) are not counted for monitoring toward the blind decoding limit because the UE needs to perform only one blind decoding for those CCEs (because they have the same resources, the same scrambling, the same TCI, and the same DCI size). This can also occur when the search space sets are associated with the same core set and have the same CCEs and the same DCI format. Both DCIs are considered as one PDCCH candidate even though they are in different search space sets. In this example, two PDCCH candidates may not be used for the iterations because the parameters are the same and there is only one blind decoding at the UE. Techniques are provided to resolve this ambiguity.

[0109] In some examples, when a UE is configured with two linked search space sets for PDCCH repetitions and both search space sets are associated with the same core set, the UE may expect that the monitoring occasions of the first search space set do not overlap with the monitoring occasions of the second search space set. If both are associated with the same core set, the monitoring occasions should not overlap. If there is an overlap, the UE may determine this to be an error case according to the overlap rule. Thus, the first instance in which the first monitoring occasions 310 and 315 overlap would be an error case. In contrast, the monitoring occasions 320 and 330 do not overlap, and the UE may process them accordingly (e.g., they may have different core sets).

[0110] In some examples, the UE may determine, based at least in part on the overlap rule, that monitoring occasions of the first search space set do not overlap with monitoring occasions of the second search space set. The UE may determine that the first search space set and the second search space set are associated with a control resource set.

[0111] In some examples, if a UE is configured with two linked search space sets for PDCCH repetitions and both search space sets are associated with the same core set, the UE may assume that there are no PDCCH repetitions in that monitoring occasion according to the overlap rule. The UE may monitor the PDCCH but may ignore the linkage between the two search space sets. In another example, the UE may not monitor for the PDCCH in that monitoring occasion.

[0112] In some examples, the UE may determine that a first monitoring occasion 310 of a first search space set overlaps with a first monitoring occasion 315 of a second search space set. The UE may monitor for DCI in the first search space set, and the overlap rule instructs the UE to treat the first monitoring occasion 315 of the second search space set as unlinked with the first monitoring occasion 310 of the first search space set. In other examples, the overlap rule configures or instructs the UE to ignore the overlapping first monitoring occasions 310 and 315. In some examples, the UE may monitor DCI in at least the first search space set or the second search space set, and the UE may skip monitoring the first monitoring occasion 310 of the first search space set and the first monitoring occasion 315 of the second search space set in accordance with the overlap rule.

[0113] 4 illustrates an example block diagram 400 that supports resolving ambiguity for search space set linking to physical downlink control channel iterations in accordance with aspects of the present disclosure. Block diagram 400 may implement or be implemented by various aspects of wireless communications system 100, among other examples. Block diagram 400 illustrates a 14-symbol slot 405.

[0114] A slot 405 may be scheduled to have a first monitoring occasion 410 of a first search space set, a second monitoring occasion 415 of a second search space set, and a third monitoring occasion 420 of a third search space set. In the example of Figure 4, the first monitoring occasion 410 and the third monitoring occasion 420 overlap. The first and second search space sets may be linked for PDCCH repetitions.

[0115] When there is a third search space set that has the same monitoring occasion as the first search space set (at least in one instance), is associated with the same core set as the first search space set, and is configured with a DCI format having the same size as the configured DCI format in the first search space set, the UE may have the following ambiguity: If the UE decodes a PDCCH candidate using a set of CCEs in the overlapping monitoring occasions 410 of the first search space set and 420 of the third search space set, if the UE assumes that the decoded DCI belongs to the first search space set, the UE may consider this a PDCCH repetition. Thus, the UE may use the slot, symbol, or resource of the later of two linked PDCCH candidates that happen to be in the second search space set as a reference to determine scheduling information. As shown in FIG. 4, the later symbol 430 of the second search space set may be used by the UE to determine scheduling information. Alternatively, if the UE assumes that the decoded DCI belongs to the third search space set, the UE may take into account that there will be no PDCCH repetitions (as the third search space set is not linked with any other search space set), and therefore the UE may interpret the DCI to determine scheduling information as if there were no PDCCH repetitions.

[0116] This situation may occur for some DCIs that require more frequent monitoring and therefore have a different periodicity than other DCIs, which may cause overlapping monitoring occasions. For example, the periodicity of a first search space set may be 1 slot. Another, third search space set may have DCIs that are monitored less frequently and have a periodicity of 10 slots. In this example, there is no ambiguity in the slots because 9 times out of 10 there are no overlapping monitoring occasions in those slots. However, within one out of every 10 slots, there may be overlap between monitoring occasions. The UE may perform only one decoding, and the second decoding would not be counted as a blind decoding. In an example without PDCCH repetition, this does not cause any problems, but with PDCCH repetition it causes ambiguity.

[0117] In this example, the UE may determine that the first and second search space sets are linked for a PDCCH iteration. In some circumstances, a third search space set may be used, with the third search space set having the same monitoring occasion 420 as the monitoring occasion 410 in at least one instance. If the first and third search space sets are associated with the same core set, and the third search space set is configured with a DCI format having the same size as the configured DCI format in the first search space set (i.e., the first and third search space sets have the same core set and the same DCI size), ambiguity may occur. If the UE decodes PDCCH candidates using sets of CCEs in overlapping monitoring occasions, the UE may not know which search space set the DCI belongs to. There may be no way for the UE to distinguish between the first and third search space sets because they have the same core set, DCI size, and scrambling.

[0118] The UE may decide to interpret the DCI as belonging to one or the other of the first or third search space set. If the UE assumes that the decoded DCI belongs to the first search space set, the UE considers this as a PDCCH repetition because the first search space set is linked with the second search space set. When the UE considers that it is using a PDCCH repetition, the UE may apply an overlap rule that considers the slot, starting symbol, or resource of a later PDCCH candidate linked with the first PDCCH candidate in the first search space set as a reference. For example, symbol 430 of the second search space set may be used as a reference.

[0119] Alternatively, the UE may assume that the decoded DCI belongs to a third search space set. If the UE assumes that the decoded DCI belongs to the third search space set, the UE may treat it as having no PDCCH repetition because the third search space set is not linked to any other search space set. In this example, the UE may interpret the DCI as not involving a PDCCH for determining scheduling information. For example, if the last symbol 425 of the PDCCH is used, the UE uses the last symbol of the DCI.

[0120] The techniques described herein resolve potential ambiguities. For example, the overlap rule may configure or prevent the UE from expecting that the third search space set will have overlapping monitoring occasions with those of the first search space set unless one of the following occurs: First, the first search space set and the third search space set are associated with different core sets. In that case, decoding these DCIs does not count as a single decoding, and the UE can distinguish between them. Second, the DCI format monitored in the first search space set has a different size from the DCI format monitored in the third search space set. This may be because, if the DCI formats have different sizes, the UE may perform two different blind decoding events, and therefore there may be no confusion. Third, the third search space set is also linked to the fourth search space set for PDCCH repetitions. Here, the overlapped monitoring occasions of the third search space set (the monitoring occasions linked with the first search space set) are linked with the monitoring occasions of the fourth search space set, and the monitoring occasions of the fourth search space set overlap with the monitoring occasions of the second search space set that are linked with the monitoring occasions of the first search space set. This creates ambiguity, but there is no ambiguity because if the third search space set is linked with the fourth search space set that also overlaps with the second search space set, the UE will apply the same rule. The UE may apply the same rule regardless of which DCI in the first or third search space set the UE determines it is decoding.

[0121] Alternatively, if the above conditions are not met (e.g., the first search space set and the third search space set have the same core set, the same DCI size, and the third search space set is not linked with the fourth search space set), other techniques may be used. For example, the UE may assume that PDCCH candidates in the third search space set that span the same set of CCEs as the PDCCH candidates in the first search space set are also linked with the PDCCH candidates in the second search space set to which the first search space set is linked. In this alternative, the UE may apply a rule corresponding to the PDCCH repetition. For example, even if the third search space set is not linked to the PDCCH repetition, the UE may assume that, in a monitoring occasion for a PDCCH candidate having the same CCE as the first search space set, it is also configured with a repetition for the second search space set. In that case, the UE may apply a rule corresponding to the PDCCH repetition, and ambiguity may be avoided.

[0122] In another example, the UE may miss overlapping monitoring occasions of the third search space set and may monitor only the monitoring occasions of the first search space set, in which case the UE may monitor the PDCCH repetitions and the corresponding rules apply since the UE considers the monitoring occasions of the third search space set to be ignored.

[0123] Alternatively, the UE may miss overlapping monitoring occasions of the first search space set and monitor only monitoring occasions of the third search space set. In this case, the rules for PDCCH repetition do not apply. The UE may also ignore linked monitoring occasions of the second search space set because the linked monitoring occasions of the first search space set were missed.

[0124] The selection between dropping a monitoring occasion for the first search space set or the third search space set may depend on the search space set indexes of the first and third search space sets. For example, the UE may compare the indexes and drop the monitoring occasion associated with either the larger index or the smaller index.

[0125] In any of these examples, the dropping action may be at the PDCCH candidate level rather than the monitoring occasion level. Each monitoring occasion may have multiple PDCCH candidates. Instead of dropping the entire monitoring occasion, only the PDCCH candidate may be dropped. In some examples, more than one PDCCH candidate may be dropped. There may be instances where the PDCCH candidates in the overlapping monitoring occasions of the first search space set do not use any CCEs of the overlapping monitoring occasions of the third search space set. In such instances, dropping may not be required. That is, even if the monitoring occasions overlap and the condition is not met, it is possible that the PDCCH candidates are not actually overlapped at the PDCCH candidate level.

[0126] In some examples, the UE may identify a third search space set having the same monitoring occasions as the first search space set. The UE may monitor the identified one or more monitoring occasions for the first search space set, the second search space set, and the third search space set based at least in part on the overlap rule.

[0127] In some examples, the overlap rule may cause the UE to independently monitor one or more identified monitoring occasions for the first search space set, the second search space set, and the third search space set.

[0128] In some examples, the UE may determine that a first search space set is associated with a first control resource set and a third search space set is associated with a second control resource set different from the first control resource set, and the overlap rule specifies or causes the UE to search for and monitor DCI in the first search space set and to search for and monitor a second DCI in the third search space set.

[0129] In another example, the UE may determine that a first search space set has a downlink control format of a first size and that a third search space set has a downlink control format of a second size different from the first size, and the overlap rule specifies that it should monitor for downlink control information in the first search space set and monitor for second downlink control information in the third search space set.

[0130] In some examples, the UE may identify a link between the third and fourth search space sets for the PDCCH repetition. The UE may also identify that monitoring occasions in the second search space set overlap with monitoring occasions in the fourth search space set, and the overlap rule specifies that the UE should monitor for DCI in the first search space set and for a second DCI in the third search space set.

[0131] In some examples, the first search space set and the third search space set have the same core set and the same downlink control format size, and the third search space set is not linked with the fourth search space set. In some examples, the UE may link the third search space set with the second search space set, and the overlap rule instructs the UE to treat monitoring occasions of the second search space set as linked with monitoring occasions of the third search space set. In some examples, the UE may miss monitoring occasions or PDCCH candidates of the third search space set, and the overlap rule determines to monitor or instructs the UE to monitor monitoring occasions of the first search space set. In other examples, the UE may miss monitoring occasions or PDCCH candidates of the first search space set, and the overlap rule determines to monitor monitoring occasions of the third search space set.

[0132] In some examples, the UE may compare a first index of the first search space set with a second index of the third search space set and may drop a monitoring occasion of the first search space set or the third search space set based at least in part on the comparison, and the overlap rule determines to monitor or instructs the UE to monitor the search space set based at least in part on the comparison. In some examples, the UE may drop a PDCCH candidate of a monitoring occasion of the first search space set or the third search space set and the overlap rule determines to monitor or instructs the UE to monitor a PDCCH candidate of a retained monitoring occasion of the first search space set or the third search space set. In some examples, the UE may drop a physical downlink control channel candidate of a monitoring occasion of the search space set.

[0133] Another potential source of ambiguity can occur with two linked PDCCH candidates for a PDCCH repetition. Typically, the UE may attempt to blindly decode the first PDCCH candidate, the second PDCCH candidate, and the combined PDCCH candidate (by soft-combining both). If the UE decodes DCI in the linked first PDCCH candidate, the UE may skip decoding the second PDCCH candidate or the combined PDCCH candidate. This may result in power savings or complexity reduction.

[0134] The UE may skip decoding a DCI only if it can assume that no different DCI is expected to be present in two linked PDCCH candidates. If the UE cannot assume this, even if the UE decodes the first candidate, the UE may need to continue monitoring and attempting to decode the second PDCCH candidate because the second PDCCH candidate may not be a repeat of the first DCI. In that situation, the UE cannot benefit from the power savings of skipping monitoring for and decoding the second DCI.

[0135] When a first PDCCH candidate in a first search space set is linked with a second PDCCH candidate in a second search space set for a PDCCH iteration, the UE may not expect to decode a different DCI using the CCEs of the two linked PDCCH candidates. A different DCI may be defined if one or more of the following conditions apply: the DCIs have different DCI payloads including different DCI sizes, the DCIs have different formats, or the DCIs have different radio network temporary identifiers.

[0136] Whether the UE can anticipate the above in case of PDCCH repetition may be a rule or constraint in the network or may be enabled by RRC configuration. For example, the UE may anticipate this constraint if RRC parameters are configured. The network may configure this behavior if it wants to improve power savings. Not enabling this behavior may result in more flexibility in the network, but may not result in much power savings. If the network uses two PDCCH candidates to convey two different DCIs, RRC parameters may not need to be configured.

[0137] In some examples, the UE may receive a configuration of RRC parameters, and the overlap rule is based at least in part on the RRC parameters. In some examples, the UE may determine that there are no other search space sets linked with the first search space set or the second search space set. In some examples, the overlap rule may indicate that there is no overlap between the first search space set or the second search space set.

[0138] In some examples, the UE may determine that the first PDCCH candidate and the second PDCCH candidate have the same DCI payload, the same downlink control format size, and the same radio network temporary identifier. In this example, monitoring the identified one or more monitoring occasions may further include monitoring the first PDCCH candidate in the first search space set and the second PDCCH candidate in the second search space set based at least in part on the determining.

[0139] 5 illustrates an example block diagram 500 that supports resolving ambiguity for search space set linking to physical downlink control channel iterations in accordance with aspects of the present disclosure. Block diagram 500 may implement or be implemented by various aspects of wireless communications system 100, among other examples. Block diagram 500 illustrates a 14-symbol slot 505.

[0140] When a first search space set and a second search space set are linked for a PDCCH iteration, there may be ambiguity as to whether the first search space set can also be linked with another, third search space set for the PDCCH iteration. Techniques are described herein that allow a UE to know whether a detected DCI corresponds to a PDCCH iteration with the second search space set or the third search space set. When the overlap rule is based at least in part on the last symbol of the last iteration, the criterion will be within either the second or third search space set.

[0141] In one example, when a first search space set is linked with a second search space set for a PDCCH repetition, the UE may not expect any of the search space sets to be linked with any other search space set for the PDCCH repetition, and if such a configuration exists, the UE detects an error case.

[0142] In another example, when a first search space set is linked with a second search space set for a PDCCH iteration, detected DCI in any one or more search space sets (regardless of which search space set) may be interpreted at least in part based on a rule that takes all three search space sets into account. For example, the present technique indicates that for a rule that uses the last symbol of a later linked PDCCH candidate as a reference, the last symbol of the three search space sets may be taken into account as a reference. In another example, for a rule that takes into account a search space set with a larger index among the linked search space sets, the rule may be extended so that a search space set with a larger or smaller index among the search space sets may be taken into account as a reference.

[0143] This technique may be conditioned on the UE detecting DCI among PDCCH candidates in the first search space set (i.e., the search space set used in both linked pairs of monitoring occasions) or among any combined PDCCH candidates that include PDCCH candidates in the first search space set. This means that this rule can be followed when DCI is detected in the first search space set or after soft combining. In other words, if DCI is detected only in the second search space set and the first search space set is not used, there is no ambiguity and the rule does not apply.

[0144] In the example of Figure 5, monitoring occasion 510 of the first search space set is linked with monitoring occasion 515 of the second search space set and monitoring occasion 520 of the third search space set. In terms of time domain resources, the first monitoring occasion in time is monitoring occasion 510 of the first search space set, then monitoring occasion 520 of the third search space set is second in time, and then monitoring occasion 515 of the second search space set is last in time. The overlap rule may be based at least in part on symbol 525 of the search space set that is last in time. Symbol 525 may be applied to the third search space set even if the third search space set and the second search space set are not directly linked.

[0145] In some examples, the UE may determine that there are no other search space sets linked with the first search space set or the second search space set. In some examples, the overlap rule indicates that there is no overlap between the first search space set or the second search space set. In other examples, the UE may determine that a third search space set is linked with the first search space set, may detect DCI in one or more monitoring occasions, and may determine scheduling information according to the overlap rule. In some examples, the overlap rule may be based at least in part on the last symbol of a PDCCH candidate for a search space set that occurs last in time or has a higher index among the first, second, or third search space sets. In other examples, the overlap rule may further be based at least in part on DCI being associated with the first search space set.

[0146] 6 illustrates an example of a block diagram 600 that supports resolving ambiguity for search space set linking to PDCCH repetitions in accordance with aspects of the present disclosure. Block diagram 600 may implement or be implemented by various aspects of wireless communications system 100, among other examples. Block diagram 600 illustrates a 14-symbol slot 605.

[0147] As in the example of Figure 5, Figure 6 includes a monitoring occasion 610 of a first search space set being linked with a monitoring occasion 615 of a second search space set and a monitoring occasion 620 of a third search space set. In terms of time domain resources, the first monitoring occasion in time is the monitoring occasion 620 of the third search space set, followed by the monitoring occasion 610 of the first search space set, then the monitoring occasion 615 of the second search space set. In this example, the overlap rule may be based at least in part on the symbol 625 of the last search space set in time. The symbol 625 may be applied to the third search space set even though the third search space set and the second search space set are not directly linked.

[0148] 7 illustrates an example of a block diagram 700 that supports resolving ambiguity for search space set linking to physical downlink control channel iterations in accordance with aspects of the present disclosure. Block diagram 700 may implement or be implemented by various aspects of wireless communications system 100, among other examples. Block diagram 700 illustrates three slots 730-a, 730-b, and 730-c of 14 symbols each.

[0149] Another ambiguity may arise when a first monitoring occasion of a first search space set is linked with a monitoring occasion of a second search space set for a PDCCH repetition regarding whether a second monitoring occasion of a first search space set can be linked with a monitoring occasion of a second search space set. This is similar to the ambiguity described with respect to Figures 5 and 6, but in the monitoring occasion domain rather than the search space set domain.

[0150] 7, the first search space set has a first monitoring occasion 710-a in a first slot 730-a and a second monitoring occasion 710-b in the same slot, i.e., the first slot 730-a. The second search space set has a monitoring occasion 715 in the third slot 730-c, with the second slot 730-b between the first slot 730-a and the third slot 730-c.

[0151] In one example, when a first monitoring occasion 710-a of a first search space set is linked with a monitoring occasion 715 of a second search space set for a PDCCH iteration, the UE may not expect a second monitoring occasion 710-b to be linked with a monitoring occasion 715 of the second search space set. The UE may determine this to be an error case.

[0152] In another example, when a first monitoring occasion 710-a of a first search space set is linked with a monitoring occasion 715 of a second search space set for a PDCCH iteration, detected DCI in any one or more of the monitoring occasions (regardless of which monitoring occasion) is interpreted based at least in part on a rule that takes all three monitoring occasions into account. For example, the overlap rule may use the last symbol 720 of the later linked PDCCH candidate as a reference, where the last symbol 720 is between the three monitoring occasions taken into account. In some examples, the overlap rule may be conditional on whether the UE detects DCI among the PDCCH candidates in the monitoring occasion 715 of the second search space set (the search space set used for both links) or among any combined PDCCH candidates that include the PDCCH candidates in the monitoring occasion 715 of the second search space set.

[0153] In some examples, the overlap rule may skip or miss monitoring a second monitoring occasion 710-b of a first search space set that is linked with a monitoring occasion 715 of a second search space set. In other examples, the UE may determine that a first monitoring occasion 710-a and a second monitoring occasion 710-b of a first search space set are linked with a monitoring occasion 715 of a second search space set and may detect DCI in one or more monitoring occasions. In another example, the UE may determine scheduling information according to an overlap rule based at least in part on a final symbol of a PDCCH candidate occurring in the last monitoring occasion of the first monitoring occasion 710-a of the first search space set, the monitoring occasion 715 of the second search space set, or the second monitoring occasion 710-b of the first search space set. In some examples, the overlap rule may further be based at least in part on detecting DCI among the monitoring occasions 715 of the second search space set.

[0154] 8 illustrates an example of a block diagram 800 that supports resolving ambiguity for search space set linking to physical downlink control channel iterations in accordance with aspects of the present disclosure. Block diagram 800 may implement or be implemented by various aspects of wireless communications system 100, among other examples. Block diagram 800 illustrates three slots 830-a, 830-b, and 830-c of 14 symbols each.

[0155] In Figure 8, a first search space set has a first monitoring occasion 810-a in a first slot 830-a and a second monitoring occasion 810-b in a third slot 830-c. The second search space set has a monitoring occasion 815 in a second slot 830-b. Like the example of Figure 7, Figure 8 includes a first monitoring occasion 810-a of the first search space set linked with a monitoring occasion 815 of the second search space set, and a second monitoring occasion 810-b also linked with the monitoring occasion 815. In terms of time domain resources, the first monitoring occasion is the first monitoring occasion 810-a of the first search space set, followed by the monitoring occasion 815 of the second search space set, followed by the second monitoring occasion 810-b of the first search space set. The overlap rule may then be based at least in part on the symbol 820 of the last monitoring occasion in time.

[0156] 9 shows a block diagram 900 of a device 905 that supports resolving ambiguity for search space set linking to physical downlink control channel iterations in accordance with an aspect of the present disclosure. The device 905 may be an example of an aspect of a UE 115 as described herein. The device 905 may include a receiver 910, a transmitter 915, and a communications manager 920. The device 905 may also include a processor. Each of these components may be in communication with each other (e.g., via one or more buses). The communications manager 920 may be an example of the communications manager 160 of FIG. 1.

[0157] The receiver 910 may provide a means for receiving information such as packets, user data, control information, or any combination thereof, associated with various information channels (e.g., control channels, data channels, information channels related to resolving ambiguity for search space set linking to physical downlink control channel iterations). The information may be passed to other components of the device 905. The receiver 910 may utilize a single antenna or a set of multiple antennas.

[0158] The transmitter 915 may provide a means for transmitting signals generated by other components of the device 905. For example, the transmitter 915 may transmit information such as packets, user data, control information, or any combination thereof, associated with various information channels (e.g., control channels, data channels, information channels related to resolving ambiguities for search space set linking to physical downlink control channel iterations). In some examples, the transmitter 915 may be co-located with the receiver 910 in a transceiver module. The transmitter 915 may utilize a single antenna or a set of multiple antennas.

[0159] The communications manager 920, the receiver 910, the transmitter 915, or various combinations or components thereof may be examples of means for performing various aspects of resolving ambiguity for search space set linking to physical downlink control channel iterations as described herein. For example, the communications manager 920, the receiver 910, the transmitter 915, or various combinations or components thereof may support a method for performing one or more of the functions described herein.

[0160] In some examples, the communications manager 920, the receiver 910, the transmitter 915, or various combinations or components thereof may be implemented in hardware (e.g., in communications management circuitry). The hardware may include a processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof configured as or otherwise supporting a means for performing the functions described in this disclosure. In some examples, the processor and a memory coupled to the processor may be configured to perform one or more of the functions described herein (e.g., by the processor executing instructions stored in the memory).

[0161] Additionally or alternatively, in some examples, the communications manager 920, the receiver 910, the transmitter 915, or various combinations or components thereof may be implemented in code executed by a processor (e.g., as communications management software or firmware). When implemented in code executed by a processor, the functions of the communications manager 920, the receiver 910, the transmitter 915, or various combinations or components thereof may be performed by a general-purpose processor, a DSP, a central processing unit (CPU), an ASIC, an FPGA, or any combination of these or other programmable logic devices (e.g., configured as a means for performing or otherwise supporting the functions described in this disclosure).

[0162] In some examples, communications manager 920 may be configured to perform various operations (e.g., receiving, monitoring, transmitting) using or otherwise cooperating with receiver 910, transmitter 915, or both. For example, communications manager 920 may receive information from receiver 910, send information to transmitter 915, or may be integrated in combination with receiver 910, transmitter 915, or both to receive information, transmit information, or perform various other operations as described herein.

[0163] Communications manager 920 may support wireless communications in a UE according to examples disclosed herein. For example, communications manager 920 may be configured as or otherwise support receiving configurations of a first search space set and a second search space set. Communications manager 920 may be configured as or otherwise support identifying a link between the first search space set and the second search space set for a physical downlink control channel iteration. Communications manager 920 may be configured as or otherwise support identifying one or more monitoring occasions in the first search space set or the second search space set to monitor for DCI based at least in part on overlap rules associated with the link between the first search space set and the second search space set for a PDCCH iteration. Communications manager 920 may be configured as or otherwise support monitoring the identified one or more monitoring occasions in at least the first search space set or the second search space set for downlink control information.

[0164] By including or configuring a communications manager 920 according to examples as described herein, the device 905 (e.g., a processor controlling or possibly coupled to the receiver 910, the transmitter 915, the communications manager 920, or a combination thereof) may support techniques for resolving ambiguity, reducing power usage, and reducing complexity.

[0165] 10 shows a block diagram 1000 of a device 1005 that supports resolving ambiguity for search space set linking to physical downlink control channel iterations according to an aspect of the present disclosure. The device 1005 may be an example of an aspect of the device 905 or the UE 115 as described herein. The device 1005 may include a receiver 1010, a transmitter 1015, and a communications manager 1020. The device 1005 may also include a processor. Each of these components may be in communication with each other (e.g., via one or more buses). The communications manager 1020 may be an example of the communications manager 160 of FIG. 1 or the communications manager 920 of FIG. 9.

[0166] The receiver 1010 may provide a means for receiving information such as packets, user data, control information, or any combination thereof, associated with various information channels (e.g., control channels, data channels, information channels related to resolving ambiguity for search space set linking to physical downlink control channel iterations). The information may be passed to other components of the device 1005. The receiver 1010 may utilize a single antenna or a set of multiple antennas.

[0167] The transmitter 1015 may provide a means for transmitting signals generated by other components of the device 1005. For example, the transmitter 1015 may transmit information such as packets, user data, control information, or any combination thereof, associated with various information channels (e.g., control channels, data channels, information channels related to resolving ambiguities for search space set linking to physical downlink control channel iterations). In some examples, the transmitter 1015 may be co-located with the receiver 1010 in a transceiver module. The transmitter 1015 may utilize a single antenna or a set of multiple antennas.

[0168] The device 1005, or various components thereof, may be an example of a means for performing various aspects of resolving ambiguity for search space set linking to physical downlink control channel iterations as described herein. For example, the communications manager 1020 may include a configuration manager 1025, a search space manager 1030, a PDCCH monitor 1035, or any combination thereof. The communications manager 1020 may be an example of an aspect of the communications manager 920 as described herein. In some examples, the communications manager 1020 or various components thereof may be configured to perform various operations (e.g., receiving, monitoring, transmitting) using or otherwise cooperating with the receiver 1010, the transmitter 1015, or both. For example, the communications manager 1020 may receive information from the receiver 1010, send information to the transmitter 1015, or may be integrated in combination with the receiver 1010, the transmitter 1015, or both to receive information, transmit information, or perform various other operations as described herein.

[0169] The communications manager 1020 may support wireless communications in a UE according to examples disclosed herein. The configuration manager 1025 may be configured as or otherwise support a means for receiving configuration of a first search space set and a second search space set. The search space manager 1030 may be configured as or otherwise support a means for identifying a link between the first search space set and the second search space set for a physical downlink control channel iteration. The search space manager 1030 may be configured as or otherwise support a means for identifying one or more monitoring occasions in the first or second search space set to monitor for DCI based at least in part on overlap rules associated with the link between the first and second search space sets for a PDCCH iteration. The PDCCH monitor 1035 may be configured as or otherwise support a means for monitoring the identified one or more monitoring occasions in at least the first or second search space set for DCI.

[0170] 11 shows a block diagram 1100 of a communications manager 1120 supporting resolving ambiguity for search space set linking to physical downlink control channel iterations in accordance with an aspect of the present disclosure. Communications manager 1120 may be an example of an aspect of communications manager 920, communications manager 1020, communications manager 160, or any combination, as described herein. Communications manager 1120, or various components thereof, may be an example of a means for performing various aspects of resolving ambiguity for search space set linking to physical downlink control channel iterations as described herein. For example, communications manager 1120 may include a configuration manager 1125, a search space manager 1130, a PDCCH monitor 1135, a scheduling manager 1140, or any combination thereof. Each of these components may communicate directly or indirectly with each other (e.g., via one or more buses).

[0171] The communications manager 1120 may support wireless communications in the UE in accordance with examples disclosed herein. The configuration manager 1125 may be configured as, or otherwise support, a means for receiving configuration of the first and second search space sets. The search space manager 1130 may be configured as, or otherwise support, a means for identifying a link between the first and second search space sets for a physical downlink control channel iteration. In some examples, the search space manager 1130 may be configured as, or otherwise support, a means for identifying one or more monitoring occasions in the first or second search space set to monitor for DCI based at least in part on overlap rules associated with the link between the first and second search space sets for a PDCCH iteration. The PDCCH monitor 1135 may be configured as, or otherwise support, a means for monitoring the identified one or more monitoring occasions in at least the first or second search space set for DCI.

[0172] In some examples, the search space manager 1130 may be configured or otherwise support determining, based at least in part on overlap rules, that monitoring occasions of a first search space set do not overlap with monitoring occasions of a second search space set. In some examples, the search space manager 1130 may be configured or otherwise support determining that the first search space set and the second search space set are associated with a core set.

[0173] In some examples, the search space manager 1130 may be configured as or otherwise support a means for determining when a monitoring occasion of a first search space set overlaps with a monitoring occasion of a second search space set. In some examples, the PDCCH monitor 1135 may be configured as or otherwise support a means for monitoring for DCI in the first search space set, where the overlap rule dictates treating a monitoring occasion of the second search space set as unlinked with a monitoring occasion of the first search space set.

[0174] In some examples, the search space manager 1130 may be configured with or otherwise support a means for determining that a monitoring occasion of a first search space set overlaps with a monitoring occasion of a second search space set, where the overlap rule determines that the overlapping monitoring occasion should be ignored. In some examples, monitoring DCI in at least the first search space set or the second search space set further includes skipping monitoring the monitoring occasion of the first search space set and the monitoring occasion of the second search space set in accordance with the overlap rule.

[0175] In some examples, the search space manager 1130 may be configured as or otherwise support a means for identifying a third search space set having the same monitoring occasions as the first search space set. In some examples, the PDCCH monitor 1135 may be configured as or otherwise support a means for monitoring the identified one or more monitoring occasions for the first search space set, the second search space set, and the third search space set based at least in part on the overlap rules. In some examples, the overlap rules specify that the identified one or more monitoring occasions for the first search space set, the second search space set, and the third search space set should be monitored independently.

[0176] In some examples, the search space manager 1130 may be configured as or otherwise support a means for determining that a first search space set is associated with a first control resource set and a third search space set is associated with a second control resource set different from the first control resource set, where overlap rules specify that DCI should be sought and monitored in the first search space set and a second DCI should be sought and monitored in the third search space set.

[0177] In some examples, the search space manager 1130 may be configured as or otherwise support a means for determining that a first search space set has a downlink control format of a first size, and that a third search space set has a downlink control format of a second size different from the first size, where the overlap rule specifies that a DCI should be sought and monitored in the first search space set, and a second DCI should be sought and monitored in the third search space set.

[0178] In some examples, the search space manager 1130 may be configured as or otherwise support a means for identifying a link between the third and fourth search space sets for a PDCCH repetition. In some examples, the search space manager 1130 may be configured as or otherwise support a means for identifying that a monitoring occasion in the second search space set overlaps with a monitoring occasion in the fourth search space set, where an overlap rule specifies to monitor for a DCI in the first search space set and to monitor for a second DCI in the third search space set.

[0179] In some examples, the first search space set and the third search space set have the same core set and the same downlink control format size. In some examples, the third search space set is not linked with the fourth search space set.

[0180] In some examples, the search space manager 1130 may be configured as or otherwise support a means for linking a third search space set with a second search space set, where overlap rules dictate treating monitoring occasions of the second search space set as linked with monitoring occasions of the third search space set.

[0181] In some examples, the PDCCH monitor 1135 may be configured as or otherwise support a means for missing monitoring occasions of the third search space set, where the overlap rules determine that monitoring occasions of the first search space set should be monitored. In some examples, the PDCCH monitor 1135 may be configured as or otherwise support a means for missing monitoring occasions of the first search space set, where the overlap rules determine that monitoring occasions of the third search space set should be monitored.

[0182] In some examples, the search space manager 1130 may be configured as or otherwise support a means for comparing a first index of a first search space set with a second index of a third search space set. In some examples, the PDCCH monitor 1135 may be configured as or otherwise support a means for missing monitoring occasions of the first search space set or the third search space set based at least in part on the comparison, where the overlap rule determines which search space sets to monitor based at least in part on the comparison.

[0183] In some examples, the PDCCH monitor 1135 may be configured as or otherwise support a means for dropping PDCCH candidates for monitoring occasions of the first search space set or the third search space set, where the overlap rule determines that the PDCCH candidates for monitoring occasions of the first search space set or the third search space set should be monitored, as maintained.

[0184] In some examples, the search space manager 1130 may be configured with or may otherwise support a means for determining that the first PDCCH candidate and the second PDCCH candidate have the same DCI payload, the same downlink control format size, and the same radio network temporary identifier. In some examples, monitoring the identified one or more monitoring occasions further includes monitoring the first PDCCH candidate in the first search space set and the second PDCCH candidate in the second search space set based at least in part on the determining.

[0185] In some examples, the configuration manager 1125 may be configured as or otherwise support a means for receiving configuration of RRC parameters, where the overlap rule is based at least in part on the RRC parameters. In some examples, the search space manager 1130 may be configured as or otherwise support a means for determining that there are no other search space sets linked with the first search space set or the second search space set.

[0186] In some examples, the search space manager 1130 may be configured as, or may otherwise support, a means for determining that a third search space set is linked with the first search space set. In some examples, the PDCCH monitor 1135 may be configured as, or may otherwise support, a means for detecting DCI in one or more monitoring occasions. In some examples, the scheduling manager 1140 may be configured as, or may otherwise support, a means for determining scheduling information according to overlap rules.

[0187] In some examples, the overlap rule is based at least in part on a final symbol of a PDCCH candidate for a search space set that occurs last in time or has a higher index among the first, second, or third search space sets. In some examples, the overlap rule is further based at least in part on the DCI being associated with the first search space set. In some examples, the overlap rule skips monitoring a second monitoring occasion of the first search space set that is linked with a monitoring occasion of the second search space set.

[0188] In some examples, the search space manager 1130 may be configured as or otherwise support a means for determining that a first monitoring occasion and a second monitoring occasion of a first search space set are linked with a monitoring occasion of a second search space set. In some examples, the PDCCH monitor 1135 may be configured as or otherwise support a means for detecting DCI among one or more monitoring occasions. In some examples, the scheduling manager 1140 may be configured as or otherwise support a means for determining scheduling information according to an overlap rule, where the overlap rule is based at least in part on the last symbol of the PDCCH candidate for the first monitoring occasion of the first search space set, the monitoring occasion of the second search space set, or the second monitoring occasion of the first search space set, which occurs last in time.

[0189] In some examples, the overlap rule is further based at least in part on detecting DCI among monitoring occasions of the second search space set.

[0190] 12 shows a diagram of a system 1200 including a device 1205 that supports resolving ambiguity for search space set linking to PDCCH iterations according to aspects of the present disclosure. The device 1205 may be an example of or may include components of a device 905, a device 1005, or a UE 115 as described herein. The device 1205 may be in wireless communication with one or more base stations 105, UEs 115, or any combination thereof. The device 1205 may include components for two-way voice and data communication, including components for transmitting and receiving communications, such as a communications manager 1220, an input / output (I / O) controller 1210, a transceiver 1215, an antenna 1225, a memory 1230, code 1235, and a processor 1240. These components may be in electronic communication or may possibly be coupled (e.g., operatively, communicatively, functionally, electronically, electrically) via one or more buses (e.g., bus 1245).

[0191] I / O controller 1210 may manage input and output signals for device 1205. I / O controller 1210 may also manage peripheral devices not integrated within device 1205. In some cases, I / O controller 1210 may represent a physical connection or port to an external peripheral device. In some cases, I / O controller 1210 may utilize an operating system such as iOS®, ANDROID®, MS-DOS®, MS-WINDOWS®, OS / 2®, UNIX®, LINUX®, or another known operating system. Additionally or alternatively, I / O controller 1210 may represent or interact with a modem, keyboard, mouse, touchscreen, or similar device. In some cases, I / O controller 1210 may be implemented as part of a processor, such as processor 1240. In some cases, a user may interact with the device 1205 through the I / O controller 1210 or through hardware components controlled by the I / O controller 1210.

[0192] In some cases, the device 1205 may include a single antenna 1225. However, in some other cases, the device 1205 may have two or more antennas 1225 that may be capable of simultaneously transmitting or receiving multiple wireless transmissions. The transceiver 1215 may communicate bidirectionally via one or more antennas 1225, a wired link, or a wireless link, as described herein. For example, the transceiver 1215 may represent a wireless transceiver and may communicate bidirectionally with another wireless transceiver. The transceiver 1215 may also include a modem for modulating packets and providing the modulated packets to the one or more antennas 1225 for transmission, and for demodulating packets received from the one or more antennas 1225. The transceiver 1215, or the transceiver 1215 and the one or more antennas 1225, may be an example of the transmitter 915, the transmitter 1015, the receiver 910, the receiver 1010, or any combination or component thereof, as described herein.

[0193] Memory 1230 may include random access memory (RAM) and read-only memory (ROM). Memory 1230 may store computer-readable computer-executable code 1235, including instructions that, when executed by processor 1240, cause device 1205 to perform various functions described herein. Code 1235 may be stored in a non-transitory computer-readable medium, such as system memory or another type of memory. In some cases, code 1235 may not be directly executable by processor 1240, but (e.g., when compiled and executed) may cause a computer to perform functions described herein. In some cases, memory 1230 may include a basic I / O system (BIOS), which may control basic hardware or software operations, such as interaction with peripheral components or devices, among other things.

[0194] The processor 1240 may include an intelligent hardware device (e.g., a general-purpose processor, a DSP, a CPU, a microcontroller, an ASIC, an FPGA, a programmable logic device, discrete gate or transistor logic components, discrete hardware components, or any combination thereof). In some cases, the processor 1240 may be configured to operate a memory array using a memory controller. In some other cases, the memory controller may be integrated into the processor 1240. The processor 1240 may be configured to execute computer-readable instructions stored in a memory (e.g., memory 1230) to cause the device 1205 to perform various functions (e.g., functions or tasks supporting resolving ambiguities for search space set linking to physical downlink control channel iterations). For example, the device 1205 or a component of the device 1205 may include the processor 1240 and the memory 1230 coupled to the processor 1240, where the processor 1240 and the memory 1230 are configured to perform various functions described herein.

[0195] The communications manager 1220 may support wireless communications in a UE according to examples disclosed herein. For example, the communications manager 1220 may be configured as or otherwise support a means for receiving configurations of a first search space set and a second search space set. The communications manager 1220 may be configured as or otherwise support a means for identifying a link between the first search space set and the second search space set for a PDCCH iteration. The communications manager 1220 may be configured as or otherwise support a means for identifying one or more monitoring occasions in the first search space set or the second search space set to monitor for DCI based at least in part on overlap rules related to the link between the first search space set and the second search space set for a PDCCH iteration. The communications manager 1220 may be configured as or otherwise support a means for monitoring the identified one or more monitoring occasions in at least the first search space set or the second search space set for DCI.

[0196] By including or configuring a communications manager 1220 according to examples as described herein, the device 1205 may support techniques for resolving ambiguity due to PDCCH repetition, improving power conservation, and reducing complexity at the UE.

[0197] In some examples, communications manager 1220 may be configured to perform various operations (e.g., receiving, monitoring, transmitting) using or otherwise cooperating with transceiver 1215, one or more antennas 1225, or any combination thereof. Although communications manager 1220 is shown as a separate component, in some examples, one or more functions described with reference to communications manager 1220 may be supported or performed by processor 1240, memory 1230, code 1235, or any combination thereof. For example, code 1235 may include instructions executable by processor 1240 to cause device 1205 to perform various aspects of resolving ambiguity for search space set linking to physical downlink control channel iterations as described herein, or processor 1240 and memory 1230 may be otherwise configured to perform or support such operations.

[0198] FIG. 13 shows a flowchart illustrating a method 1300 that supports resolving ambiguity for search space set linking to PDCCH repetitions according to an aspect of the present disclosure. The operations of method 1300 may be performed by a UE or components thereof as described herein. For example, the operations of method 1300 may be performed by a UE 115 as described with reference to FIGS. 1-12. In some examples, the UE may execute a set of instructions to control functional elements of the UE to perform the described functions. Additionally or alternatively, the UE may perform aspects of the described functions using dedicated hardware.

[0199] At 1305, the method may include receiving a configuration of a first search space set and a second search space set. The operations of 1305 may be performed according to examples as disclosed herein. In some examples, aspects of the operations of 1305 may be performed by a configuration manager 1125 as described with reference to FIG. 11.

[0200] At 1310, the method may include identifying a link between a first search space set and a second search space set for a PDCCH iteration. The operations of 1310 may be performed in accordance with examples as disclosed herein. In some examples, aspects of the operations of 1310 may be performed by a search space manager 1130 as described with reference to FIG. 11.

[0201] At 1315, the method may include identifying one or more monitoring occasions in the first search space set or the second search space set to monitor for DCI based on overlap rules associated with links between the first search space set and the second search space set for PDCCH repetitions. The operations of 1315 may be performed according to examples as disclosed herein. In some examples, aspects of the operations of 1315 may be performed by a search space manager 1130 as described with reference to FIG. 11.

[0202] At 1320, the method may include monitoring the identified one or more monitoring occasions in at least the first search space set or the second search space set for DCI. The operations of 1320 may be performed in accordance with examples as disclosed herein. In some examples, aspects of the operations of 1320 may be performed by a PDCCH monitor 1135 as described with reference to FIG. 11.

[0203] The following provides a summary of aspects of the present disclosure.

[0204] Aspect 1: A method for wireless communication in a UE, comprising: receiving configurations of a first search space set and a second search space set; identifying a link between the first search space set and the second search space set for a physical downlink control channel iteration; identifying one or more monitoring occasions in the first search space set or the second search space set to monitor for downlink control information based at least in part on an overlap rule associated with the link between the first search space set and the second search space set for the physical downlink control channel iteration; and monitoring the identified one or more monitoring occasions in at least the first search space set or the second search space set for downlink control information.

[0205] Aspect 2: The method of aspect 1, further comprising determining, based at least in part on an overlap rule, that monitoring occasions of the first search space set do not overlap with monitoring occasions of the second search space set.

[0206] Aspect 3: The method of aspect 1, further comprising determining that the first search space set and the second search space set are associated with a control resource set.

[0207] Aspect 4: The method of any of Aspects 1-3, further comprising determining that there are no other search space sets linked with the first search space set or the second search space set.

[0208] Aspect 5: The method of any of aspects 1-4, further comprising identifying a third search space set having the same monitoring occasions as the first search space set; and monitoring the identified one or more monitoring occasions for the first search space set, the second search space set, and the third search space set based at least in part on overlap rules.

[0209] Aspect 6: The method of aspect 5, wherein the overlap rule specifies that the identified one or more monitoring occasions should be monitored independently for the first search space set, the second search space set, and the third search space set.

[0210] Aspect 7: The method of any of aspects 5 to 6, further comprising determining that a first search space set is associated with a first control resource set and that a third search space set is associated with a second control resource set different from the first control resource set, and the overlap rule specifies that downlink control information should be sought and monitored in the first search space set and second downlink control information should be sought and monitored in the third search space set.

[0211] Aspect 8: The method of any of aspects 5 to 7, further comprising determining that a first search space set has a downlink control format of a first size and that a third search space set has a downlink control format of a second size different from the first size, and wherein the overlap rule specifies that downlink control information should be sought and monitored in the first search space set and second downlink control information should be sought and monitored in the third search space set.

[0212] Aspect 9: The method of any of aspects 5 to 8, further comprising identifying a link between a third search space set and a fourth search space set for a physical downlink control channel iteration, and identifying that monitoring occasions in the second search space set overlap with monitoring occasions in the fourth search space set, wherein the overlap rule specifies that downlink control information should be monitored in the first search space set and second downlink control information should be monitored in the third search space set.

[0213] Example 10: The method of any of Examples 5-9, wherein the first search space set and the third search space set have the same control resource set and the same downlink control format size.

[0214] Example 11: The method of example 10, wherein the third search space set is not linked to the fourth search space set.

[0215] Aspect 12: In any of the methods of aspects 10-11, the overlap rule directs handling of downlink control information in a third search space set based on an assumption that the third search space set is linked with the second search space set.

[0216] Aspect 13: The method of any of aspects 10-12, further comprising linking a third search space set with the second search space set, wherein the overlap rule directs treating a monitoring occasion of the second search space set as being linked with a monitoring occasion of the third search space set.

[0217] Aspect 14: The method of any of aspects 10-13, further comprising missing monitoring occasions of the third search space set, wherein the overlap rule determines that monitoring occasions of the first search space set should be monitored.

[0218] Aspect 15: The method of any of aspects 10-14, further comprising missing monitoring occasions of the first search space set, and wherein the overlap rule determines that monitoring occasions of the third search space set should be monitored.

[0219] Aspect 16: The method of any of aspects 10-15, further comprising: comparing a first index of a first search space set to a second index of a third search space set; and missing a monitoring occasion of the first search space set or the third search space set based at least in part on the comparison, wherein the overlap rule determines which search space sets to monitor based at least in part on the comparison.

[0220] Aspect 17: The method of any of aspects 10 to 16, further comprising dropping a physical downlink control channel candidate for a monitoring occasion of the first search space set or a monitoring occasion of the third search space set, wherein the overlap rule determines that the physical downlink control channel candidate for the monitoring occasion of the first search space set or the monitoring occasion of the third search space set should be monitored, as maintained.

[0221] Aspect 18: The method of any of aspects 1 to 17, further comprising determining that a monitoring occasion of a first search space set overlaps with a monitoring occasion of a second search space set, and monitoring for downlink control information in the first search space set, wherein the overlap rule directs treating the monitoring occasion of the second search space set as unlinked with the monitoring occasion of the first search space set.

[0222] Aspect 19: The method of any of aspects 1 to 18, further comprising determining that a monitoring occasion of a first search space set overlaps with a monitoring occasion of a second search space set, wherein the overlap rule determines that the overlapping monitoring occasion should be ignored.

[0223] Aspect 20: The method of aspect 19, wherein monitoring downlink control information in at least the first search space set or the second search space set further comprises skipping monitoring occasions of the first search space set and monitoring occasions of the second search space set in accordance with an overlap rule.

[0224] Example 21: The method of any of Examples 1-20, further comprising dropping physical downlink control channel candidates for the monitoring occasions of the first search space set.

[0225] Example 22: The method of any of Examples 1 to 21, further comprising determining that the first physical downlink control channel candidate and the second physical downlink control channel candidate have the same downlink control information payload, the same downlink control format size, and the same radio network temporary identifier, and monitoring the identified one or more monitoring occasions further comprises monitoring the first physical downlink control channel candidate in the first search space set and the second physical downlink control channel candidate in the second search space set based at least in part on the determining.

[0226] Example 23: The method of example 22, further comprising receiving a configuration of a radio resource control parameter, wherein the overlap rule is based at least in part on the radio resource control parameter.

[0227] Example 24: The method of any of Examples 1 to 23, further comprising determining that a third search space set is linked with the first search space set, detecting downlink control information in one or more monitoring occasions, and determining scheduling information according to an overlap rule.

[0228] Aspect 25: The method of aspect 24, wherein the overlap rule is based at least in part on the final symbol of the physical downlink control channel candidate for the search space set that occurs last in time or has a larger index among the first, second, or third search space sets.

[0229] Example 26: The method of any of Examples 24-25, wherein the overlap rule is further based at least in part on the downlink control information being associated with the first search space set.

[0230] Example 27: The method of any of Examples 1 to 26, wherein the overlap rule skips monitoring a second monitoring occasion of a first search space set that is linked with a first monitoring occasion of a second search space set.

[0231] Example 28: The method of any of Examples 1 to 27, further comprising determining, based at least in part on the first monitoring occasion of the first search space set being linked with the first monitoring occasion of the second search space set, that the second monitoring occasion of the first search space set is not linked with the first monitoring occasion of the second search space set.

[0232] Aspect 29: The method of any of aspects 1 to 28, further comprising: determining that a first monitoring occasion and a second monitoring occasion of a first search space set are linked with a monitoring occasion of a second search space set; detecting downlink control information in the one or more monitoring occasions; and determining scheduling information according to an overlap rule, wherein the overlap rule is based at least in part on a final symbol of the physical downlink control channel candidate for the first monitoring occasion of the first search space set, the monitoring occasion of the second search space set, or the second monitoring occasion of the first search space set, which occurs last in time.

[0233] Example 30: The method of example 29, wherein the overlap rule is further based at least in part on detecting downlink control information among the monitoring occasions of the second search space set.

[0234] Aspect 31: An apparatus for wireless communication in a UE, comprising: a processor; a memory coupled to the processor; and instructions stored in the memory, the instructions executable by the processor to cause the apparatus to perform any of the methods of aspects 1 to 30.

[0235] Aspect 32: An apparatus for wireless communication in a UE, comprising at least one means for performing the method of any of aspects 1-30.

[0236] Aspect 33: A non-transitory computer-readable medium storing code for wireless communication in a UE, the code comprising instructions executable by a processor to perform the method of any of aspects 1-30.

[0237] It should be noted that the methods described herein describe possible implementations, that the operations and steps may be rearranged or otherwise modified, and that other implementations are possible. Furthermore, aspects from two or more of the methods may be combined.

[0238] Although aspects of an LTE, LTE-A, LTE-A Pro, or NR system may be described as examples, and LTE, LTE-A, LTE-A Pro, or NR terminology may be used throughout much of the description, the techniques described herein may be applicable to networks other than LTE, LTE-A, LTE-A Pro, or NR. For example, the described techniques may be applicable to various other wireless communication systems, such as Ultra Mobile Broadband (UMB), Institute of Electrical and Electronics Engineers (IEEE) 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDM, and other systems and radio technologies not explicitly mentioned herein.

[0239] The information and signals described herein may be represented using any of a wide variety of technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referred to throughout the description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

[0240] The various example blocks and components described in connection with the disclosure herein may be implemented or performed using a general purpose processor, a DSP, an ASIC, a CPU, an FPGA or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but alternatively, the processor may be any processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices (e.g., a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration).

[0241] The functions described herein may be implemented in hardware, software executed by a processor, firmware, or any combination thereof. If implemented in software executed by a processor, the functions may be stored on or transmitted via a computer-readable medium as one or more instructions or code. Other examples and implementations are within the scope of this disclosure and the appended claims. For example, due to the nature of software, the functions described herein may be implemented using software executed by a processor, hardware, firmware, hardwiring, or any combination thereof. Features implementing the functions may also be physically located in various locations, including being distributed such that portions of the functions are implemented in different physical locations.

[0242] Computer-readable media includes both non-transitory computer storage media and communication media, including any medium that facilitates transfer of a computer program from one place to another. Non-transitory storage media may be any available medium that can be accessed by a general-purpose or special-purpose computer. By way of example, and not limitation, non-transitory computer-readable media may include RAM, ROM, Electrically Erasable Programmable Read Only Memory (EEPROM), Flash memory, Compact Disc (CD) ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other non-transitory medium that can be used to carry or store desired program code means in the form of instructions or data structures and that can be accessed by a general-purpose or special-purpose computer or processor. Also, any connection is properly termed a computer-readable medium. For example, if software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included within the definition of computer-readable media. As used herein, disk and disc include CDs, laser discs, optical discs, digital versatile discs (DVDs), floppy disks, and Blu-ray discs, where disks typically reproduce data magnetically and discs reproduce data optically using lasers. Combinations of the above are also included within the scope of computer-readable media.

[0243] As used herein, including in the claims, "or" as used in a list of items (e.g., a list of items ending with a phrase such as "at least one of" or "one or more of") indicates an inclusive list, such as, for example, a list of at least one of A, B, or C means A or B or C or AB or AC or BC or ABC (i.e., A and B and C). Also, the phrase "based on" as used herein should not be construed as a reference to a closed set of conditions. For example, an example step described as "based on condition A" may be based on both condition A and condition B without departing from the scope of the present disclosure. In other words, the phrase "based on" as used herein should be construed similarly to the phrase "based at least in part on."

[0244] In the accompanying figures, similar components or features may have the same reference label. Furthermore, various components of the same type may be distinguished by following the reference label with a dash and a second label that distinguishes between the similar components. If only a first reference label is used herein, the description is applicable to any of the similar components having the same first reference label, regardless of a second reference label, or other subsequent reference label.

[0245] The description set forth herein with reference to the accompanying drawings illustrates exemplary configurations and does not necessarily represent every example that may be implemented or fall within the scope of the claims. As used herein, the term "exemplary" means "serving as an example, instance, or illustration" and does not mean "preferred" or "advantageous over other examples." The detailed description includes specific details for the purpose of providing an understanding of the described techniques. However, these techniques may be practiced without these specific details. In some instances, known structures and devices are shown in block diagram form in order to avoid obscuring the concepts of the described examples.

[0246] The description herein is provided to enable any person skilled in the art to make or use the disclosure. Various modifications of the disclosure will be apparent to those skilled in the art, and the general principles defined herein may be applied to other variations without departing from the scope of the disclosure. Thus, the disclosure is not limited to the examples and designs described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein. [Explanation of symbols]

[0247] 100 Wireless Communication System 105 Base station 110 Geographic Coverage Areas 115 User Equipment (UE) 120 backhaul links 125 communication links 130 Core Network 135 Device-to-Device (D2D) Communication Links 140 Access Network Entity 145 Access Network Transmission Entity 150 IP Services 160 Communications Manager 305 Slots 310, 315, 320, 330 Surveillance Occasions 405 Slots 410, 415, 420 Surveillance Occasion 425, 430 symbols 505 Slots 510, 515, 520 Monitoring Occasion 525 Symbol 605 Slots 610, 615, 620 Surveillance Occasion 625 Symbol 710, 715 Surveillance Occasion 720 Symbols 730 Slots 810, 815 Monitoring Occasion 820 Symbol 830 Slots 905 devices 910 Receiver 915 Transmitter 920 Communications Manager 1005 devices 1010 receiver 1015 Transmitter 1020 Communications Manager 1025 Configuration Manager 1030 Search Space Manager 1035 PDCCH Monitor 1120 Communications Manager 1125 Configuration Manager 1130 Search Space Manager 1135 PDCCH monitor 1140 Scheduling Manager 1205 devices 1210 Input / Output (I / O) Controller 1215 Transceiver 1220 Communications Manager 1225 Antenna 1230 memory 1235 Code 1240 processor 1245 Bus

Claims

1. 1. An apparatus for wireless communication in a user equipment (UE), comprising: a processor; a memory coupled to the processor; instructions stored in the memory, the instructions causing the device to: receiving a configuration of a first search space set and a second search space set; identifying a link between the first search space set and the second search space set for a physical downlink control channel iteration; identifying one or more monitoring occasions in the first search space set or the second search space set to monitor for downlink control information based at least in part on overlap rules associated with the link between the first search space set and the second search space set for a physical downlink control channel iteration; causing the identified one or more monitoring occasions in at least the first search space set or the second search space set to be monitored for the downlink control information; An apparatus executable by the processor.

2. The instructions cause the device to: further executable by the processor to determine, based at least in part on the overlap rules, that monitoring occasions of the first search space set do not overlap with monitoring occasions of the second search space set.

10. The apparatus of claim 1.

3. The instructions cause the device to: further executable by the processor to determine that the first search space set and the second search space set are associated with a control resource set.

3. The apparatus of claim 2.

4. The instructions cause the device to: further executable by the processor to determine that there are no other search space sets linked to the first search space set or the second search space set.

10. The apparatus of claim 1.

5. The instructions cause the device to: identifying a third search space set having the same monitoring occasions as the first search space set; further executable by the processor to cause the first search space set, the second search space set, and the third search space set to be monitored for the identified one or more monitoring occasions based at least in part on the overlap rule.

10. The apparatus of claim 1.

6. 6. The apparatus of claim 5, wherein the overlap rule specifies that the identified one or more monitoring occasions should be monitored independently for the first search space set, the second search space set, and the third search space set.

7. The instructions cause the device to: and a method for determining whether the first search space set is associated with a first control resource set and whether the third search space set is associated with a second control resource set different from the first control resource set, the method further being executable by the processor to determine whether the first search space set is associated with a first control resource set and the third search space set is associated with a second control resource set different from the first control resource set, the overlap rule specifying that the downlink control information should be monitored in the first search space set and that second downlink control information should be monitored in the third search space set.

6. The apparatus of claim 5.

8. The instructions cause the device to: and a method for determining whether the first search space set has a downlink control format of a first size and whether the third search space set has a downlink control format of a second size different from the first size, the method further being executable by the processor to determine whether the first search space set has a downlink control format of a first size and the third search space set has a downlink control format of a second size different from the first size, the overlap rule specifying that the downlink control information should be monitored in the first search space set and that second downlink control information should be monitored in the third search space set.

6. The apparatus of claim 5.

9. The instructions cause the device to: identifying a link between the third search space set and a fourth search space set for a physical downlink control channel iteration; a rule further executable by the processor to identify monitoring occasions in the second search space set that overlap with monitoring occasions in the fourth search space set, the rule specifying that the downlink control information should be monitored in the first search space set and that second downlink control information should be monitored in the third search space set.

6. The apparatus of claim 5.

10. the first search space set and the third search space set have the same control resource set and the same downlink control format size.

6. The apparatus of claim 5.

11. the third search space set is not linked with the fourth search space set; 11. The apparatus of claim 10.

12. the overlap rule directs treating downlink control information in the third search space set based on an assumption that the third search space set is linked with the second search space set.

11. The apparatus of claim 10.

13. The instructions cause the device to: further executable by the processor to link the third search space set with the second search space set, wherein the overlap rule directs treating the monitoring occasion of the second search space set as linked with the monitoring occasion of the third search space set.

11. The apparatus of claim 10.

14. The instructions cause the device to: further executable by the processor to miss monitoring occasions of the third search space set, and the overlap rule determines that monitoring occasions of the first search space set should be monitored.

11. The apparatus of claim 10.

15. The instructions cause the device to: further executable by the processor to miss monitoring occasions of the first search space set, and the overlap rule determines that monitoring occasions of the third search space set should be monitored.

11. The apparatus of claim 10.

16. The instructions cause the device to: comparing a first index of the first search space set to a second index of the third search space set; further executable by the processor to miss a monitoring occasion of the first search space set or the third search space set based at least in part on the comparison, and the overlap rule determines which search space sets to monitor based at least in part on the comparison.

11. The apparatus of claim 10.

17. The instructions cause the device to: determining to monitor the physical downlink control channel candidate of the monitoring occasion of the first search space set or the monitoring occasion of the third search space set, the overlap rule being maintained; 11. The apparatus of claim 10.

18. The instructions cause the device to: determining that monitoring occasions of the first search space set overlap with monitoring occasions of the second search space set; further executable by the processor to cause monitoring for the downlink control information in the first search space set, wherein the overlap rule directs treating the monitoring occasions of the second search space set as unlinked with the monitoring occasions of the first search space set.

10. The apparatus of claim 1.

19. The instructions cause the device to: further executable by the processor to determine that monitoring occasions of the first search space set overlap with monitoring occasions of the second search space set, the overlap rules determining that the overlapping monitoring occasions should be ignored.

10. The apparatus of claim 1.

20. 20. The apparatus of claim 19, wherein monitoring the downlink control information in at least the first search space set or the second search space set further comprises skipping monitoring the monitoring occasions of the first search space set and the monitoring occasions of the second search space set in accordance with the overlap rule.

21. The instructions cause the device to: and further executable by the processor to drop physical downlink control channel candidates for monitoring occasions of the first search space set.

10. The apparatus of claim 1.

22. The instructions cause the device to: further executable by the processor to determine that the first physical downlink control channel candidate and the second physical downlink control channel candidate have the same downlink control information payload, the same downlink control format size, and the same radio network temporary identifier; monitoring the identified one or more monitoring occasions further comprises monitoring the first physical downlink control channel candidate in the first search space set and the second physical downlink control channel candidate in the second search space set based at least in part on the determining.

10. The apparatus of claim 1.

23. The instructions cause the device to: and further executable by the processor to receive a configuration of a radio resource control parameter, the overlap rule being based at least in part on the radio resource control parameter.

23. The apparatus of claim 22.

24. The instructions cause the device to: determining a third search space set to be linked with the first search space set; detecting the downlink control information in the one or more monitoring occasions; further executable by the processor to determine scheduling information according to the overlap rule.

10. The apparatus of claim 1.

25. 25. The apparatus of claim 24, wherein the overlap rule is based at least in part on a last symbol of a physical downlink control channel candidate for a search space set that occurs last in time or has a higher index among the first, second, or third search space sets.

26. 25. The apparatus of claim 24, wherein the overlap rule is further based at least in part on the downlink control information being associated with the first search space set.

27. The apparatus of claim 1 , wherein the overlap rule skips monitoring a second monitoring occasion of the first search space set that is linked with a first monitoring occasion of the second search space set.

28. The instructions cause the device to: further executable by the processor to determine, based at least in part on a first monitoring occasion of the first search space set being linked with the first monitoring occasion of the second search space set, that a second monitoring occasion of the first search space set is not linked with a first monitoring occasion of the second search space set.

10. The apparatus of claim 1.

29. The instructions cause the device to: determining that a first monitoring occasion and a second monitoring occasion of the first search space set are linked with a monitoring occasion of the second search space set; detecting the downlink control information in the one or more monitoring occasions; and further executable by the processor to cause determining scheduling information according to the overlap rule, the overlap rule being based at least in part on a last symbol of a physical downlink control channel candidate for the first monitoring occasion of the first search space set, the monitoring occasion of the second search space set, or the second monitoring occasion of the first search space set, which occurs last in time.

10. The apparatus of claim 1.

30. 30. The apparatus of claim 29, wherein the overlap rule is further based at least in part on detecting the downlink control information among the monitoring occasions of the second search space set.

31. 1. A method for wireless communication in a user equipment (UE), comprising: receiving a configuration of a first search space set and a second search space set; identifying a link between the first search space set and the second search space set for a physical downlink control channel iteration; identifying one or more monitoring occasions in the first search space set or the second search space set to monitor for downlink control information based at least in part on overlap rules associated with the link between the first search space set and the second search space set for a physical downlink control channel iteration; monitoring the identified one or more monitoring occasions in at least the first search space set or the second search space set for the downlink control information; A method for providing the above.

32. determining, based at least in part on the overlap rules, that monitoring occasions of the first search space set do not overlap with monitoring occasions of the second search space set.

32. The method of claim 31 , further comprising:

33. determining that the first search space set and the second search space set are associated with a control resource set; 33. The method of claim 32, further comprising:

34. determining that there are no other search space sets linked to the first search space set or the second search space set; 32. The method of claim 31 , further comprising:

35. identifying a third search space set having the same monitoring occasions as the first search space set; monitoring the identified one or more monitoring occasions relative to the first search space set, the second search space set, and the third search space set based at least in part on the overlap rule; 32. The method of claim 31 , further comprising:

36. 36. The method of claim 35, wherein the overlap rule specifies that the identified one or more monitoring occasions should be monitored independently for a first search space set, the second search space set, and the third search space set.

37. determining that the first search space set is associated with a first control resource set and that the third search space set is associated with a second control resource set different from the first control resource set, wherein the overlap rule specifies that the downlink control information should be monitored in the first search space set and that second downlink control information should be monitored in the third search space set.

36. The method of claim 35.

38. determining that the first search space set has a downlink control format of a first size and that the third search space set has a downlink control format of a second size different from the first size, wherein the overlap rule specifies that the downlink control information should be monitored in the first search space set and that second downlink control information should be monitored in the third search space set.

36. The method of claim 35.

39. identifying a link between the third search space set and a fourth search space set for a physical downlink control channel iteration; and identifying that monitoring occasions in the second search space set overlap with monitoring occasions in the fourth search space set, wherein the overlap rule specifies to monitor for the downlink control information in the first search space set and to monitor for second downlink control information in the third search space set.

36. The method of claim 35.

40. the first search space set and the third search space set have the same control resource set and the same downlink control format size.

36. The method of claim 35.

41. the third search space set is not linked with the fourth search space set; 41. The method of claim 40.

42. the overlap rule directs treating downlink control information in the third search space set based on an assumption that the third search space set is linked with the second search space set.

41. The method of claim 40.

43. linking the third search space set with the second search space set, wherein the overlap rule directs treating the monitoring occasions of the second search space set as linked with the monitoring occasions of the third search space set.

41. The method of claim 40.

44. the overlap rule determines that the monitoring occasions of the first search space set should be monitored.

41. The method of claim 40.

45. the overlap rule determines that a monitoring occasion of the third search space set should be monitored.

41. The method of claim 40.

46. comparing a first index of the first search space set to a second index of the third search space set; and dropping a monitoring occasion of the first search space set or the third search space set based at least in part on the comparison, wherein the overlap rule determines which search space sets to monitor based at least in part on the comparison.

41. The method of claim 40.

47. and determining that the physical downlink control channel candidate of the monitoring occasion of the first search space set or the monitoring occasion of the third search space set should be monitored, for which the overlap rule is maintained.

41. The method of claim 40.

48. determining that monitoring occasions of the first search space set overlap with monitoring occasions of the second search space set; monitoring for the downlink control information in the first search space set, wherein the overlap rule directs treating the monitoring occasions of the second search space set as unlinked with the monitoring occasions of the first search space set.

32. The method of claim 31.

49. determining that a monitoring occasion of the first search space set overlaps with a monitoring occasion of the second search space set, wherein the overlap rule determines that the overlapping monitoring occasion should be ignored.

32. The method of claim 31.

50. 50. The method of claim 49, wherein monitoring the downlink control information in at least the first search space set or the second search space set further comprises skipping monitoring the monitoring occasions of the first search space set and the monitoring occasions of the second search space set in accordance with the overlap rule.

51. and dropping physical downlink control channel candidates for monitoring occasions of the first search space set.

32. The method of claim 31.

52. determining that the first physical downlink control channel candidate and the second physical downlink control channel candidate have the same downlink control information payload, the same downlink control format size, and the same radio network temporary identifier; monitoring the identified one or more monitoring occasions further comprises monitoring the first physical downlink control channel candidate in the first search space set and the second physical downlink control channel candidate in the second search space set based at least in part on the determining step.

32. The method of claim 31.

53. receiving a configuration of radio resource control parameters, wherein the overlap rule is based at least in part on the radio resource control parameters.

53. The method of claim 52.

54. determining a third search space set to be linked with the first search space set; detecting the downlink control information in the one or more monitoring occasions; determining scheduling information according to the overlap rule; 32. The method of claim 31 , further comprising:

55. 55. The method of claim 54, wherein the overlap rule is based at least in part on a last symbol of a physical downlink control channel candidate for the search space set that occurs last in time or has a higher index among the first, second, or third search space sets.

56. 55. The method of claim 54, wherein the overlap rule is further based at least in part on the downlink control information being associated with the first search space set.

57. 32. The method of claim 31, wherein the overlap rule skips monitoring a second monitoring occasion of the first search space set that is linked with a first monitoring occasion of the second search space set.

58. determining, based at least in part on a first monitoring occasion of the first search space set being linked with the first monitoring occasion of the second search space set, that a second monitoring occasion of the first search space set is not linked with a first monitoring occasion of the second search space set; 32. The method of claim 31.

59. determining that a first monitoring occasion and a second monitoring occasion of the first search space set are linked with a monitoring occasion of the second search space set; detecting the downlink control information in the one or more monitoring occasions; determining scheduling information according to the overlap rule, wherein the overlap rule is based at least in part on a last symbol of a physical downlink control channel candidate for the first monitoring occasion of the first search space set, the monitoring occasion of the second search space set, or the second monitoring occasion of the first search space set, which occurs last in time.

32. The method of claim 31.

60. 60. The method of claim 59, wherein the overlap rule is further based at least in part on the detecting the downlink control information among the monitoring occasions of the second search space set.

Images