Carrying Downlink Control Information (DCI) scheduling restrictions

Abstract

Certain aspects of the present disclosure provide techniques for scheduling chain design. Certain aspects of the subject matter described in the present disclosure can be implemented in a method for wireless communication. The method generally includes: determining a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of multiple data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in the multiple data channels; and sending multiple DCIs to a user equipment (UE) on multiple data channels based on the determination.

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to U.S. Application No. 17 / 185,595, filed on February 25, 2021, which application hereby claims priority under 35 U.S.C. §119 to pending U.S. Provisional Patent Application No. 63 / 025,794, filed on May 15, 2020, the contents of which are incorporated herein in their entirety. Technical Field

[0003] Aspects of the present disclosure relate to wireless communications and, more particularly, to techniques for data channel configuration. Background Art

[0004] Wireless communication systems are widely deployed to provide various telecommunication services such as telephony, video, data, messaging, broadcast, etc. These wireless communication systems may employ multiple access technologies capable of supporting communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power, etc.). Examples of such multiple access systems include 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) systems, LTE-Advanced (LTE-A) systems, Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, Orthogonal Frequency Division Multiple Access (OFDMA) systems, Single Carrier Frequency Division Multiple Access (SC-FDMA) systems, and Time Division Synchronous Code Division Multiple Access (TD-SCDMA) systems, to name a few.

[0005] These multiple access technologies have been adopted in various telecommunication standards to provide a common protocol that enables different wireless devices to communicate across cities, countries, regions, and even the globe. New Radio, such as 5G NR, is an example of an emerging telecommunication standard. NR is a set of enhancements to the LTE mobile standard promulgated by 3GPP. NR aims to better support mobile broadband Internet access by increasing spectral efficiency, reducing costs, improving services, leveraging new spectrum, and better integrating with other open standards that use OFDMA with cyclic prefixes (CP) on the downlink (DL) and uplink (UL). To this end, NR supports beamforming, multiple-input multiple-output (MIMO) antenna technology, and carrier aggregation.

[0006] However, as the demand for mobile broadband access continues to increase, there is a need for further improvements to NR and LTE technologies. Preferably, these improvements should be applicable to other multiple access technologies and the telecommunication standards that employ these technologies. Summary of the invention

[0007] The systems, methods, and devices of the present disclosure each have several aspects, no one of which is solely responsible for its desired attributes. Without limiting the scope of the present disclosure as expressed in the appended claims, some features will now be briefly discussed. After considering this discussion, and particularly after reading the section entitled "Detailed Description of the Invention," one will understand how the features of the present disclosure provide advantages including improved scheduling chain design.

[0008] Certain aspects of the subject matter described in the present disclosure may be implemented in a method for wireless communication. The method generally includes: determining a limit associated with a quantity of a plurality of downlink control information (DCI) for each of at least one scheduling chain, each DCI in at least one of the plurality of DCIs to be sent on one of a plurality of data channels, and wherein each of the plurality of DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and sending the plurality of DCIs to a user equipment (UE) on the plurality of data channels based on the determination.

[0009] Certain aspects of the subject matter described in the present disclosure may be implemented in a method for wireless communication. The method generally includes: determining a limit associated with a number of multiple downlink control information (DCI) for each of at least one scheduling chain, each of at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and receiving multiple DCIs from a base station on the plurality of data channels based on the determination.

[0010] Certain aspects of the subject matter described in the present disclosure may be implemented in a base station. The base station generally includes: a component for determining a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and a component for sending the multiple DCIs to a user equipment (UE) on the plurality of data channels based on the determination.

[0011] Certain aspects of the subject matter described in the present disclosure may be implemented in a user equipment (UE). The UE generally includes: a component for determining a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and a component for receiving the multiple DCIs from a base station on the plurality of data channels based on the determination.

[0012] Certain aspects of the subject matter described in the present disclosure may be implemented in a base station. The base station generally includes: a processing system configured to determine a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and a transmitter configured to send the multiple DCIs to a user equipment (UE) on the plurality of data channels based on the determination.

[0013] Certain aspects of the subject matter described in the present disclosure may be implemented in a user equipment (UE). The UE generally includes: a processing system configured to determine a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and a receiver configured to receive multiple DCIs from a base station on the plurality of data channels based on the determination.

[0014] Certain aspects of the subject matter described in the present disclosure may be implemented in an apparatus for wireless communication. The apparatus generally includes: a processing system configured to determine a limit associated with a number of multiple downlink control information (DCI) for each of at least one scheduling chain, each of at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another of the multiple data channels; and an interface configured to output the multiple DCIs on the multiple data channels for transmission based on the determination.

[0015] Certain aspects of the subject matter described in the present disclosure may be implemented in an apparatus for wireless communication. The apparatus generally includes: a processing system configured to determine a limit associated with a number of multiple downlink control information (DCI) for each of at least one scheduling chain, each of at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another of the multiple data channels; and an interface configured to obtain multiple DCIs from a base station on the multiple data channels based on the determination.

[0016] Certain aspects of the subject matter described in the present disclosure can be implemented in a computer-readable medium for wireless communication. The computer-readable medium generally includes instructions executable to perform the following operations: determine a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each DCI in the multiple DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and receive multiple DCIs from a base station on the plurality of data channels based on the determination.

[0017] Certain aspects of the subject matter described in the present disclosure can be implemented in a computer-readable medium for wireless communication. The computer-readable medium generally includes instructions executable to perform the following operations: determine a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each DCI in the multiple DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and send the multiple DCIs on the plurality of data channels based on the determination.

[0018] Aspects of the present disclosure provide base stations, UEs, components, devices, processors, processing systems, and computer-readable media for performing the methods described herein.

[0019] To achieve the aforementioned and related purposes, one or more aspects include features fully described below and particularly pointed out in the claims. The following description and the accompanying drawings set forth in detail certain illustrative features of one or more aspects. However, these features are only indicative of several of the various ways in which the principles of the various aspects can be employed. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order that the manner in which the above-mentioned features of the present disclosure are understood in detail, a more detailed description of what has been briefly summarized above may be made by reference to various aspects, some of which are illustrated in the accompanying drawings. It should be noted, however, that the accompanying drawings illustrate only certain typical aspects of the present disclosure and are therefore not to be considered as limiting the scope thereof, as the description may admit of other equally effective aspects.

[0021] Figure 1 is a block diagram conceptually illustrating an example telecommunications system in accordance with certain aspects of the present disclosure.

[0022] Figure 2 is a block diagram conceptually illustrating designs of exemplary base stations (BSs) and user equipment (UEs) in accordance with certain aspects of the present disclosure.

[0023] Figure 3 is an example frame format for New Radio (NR) in accordance with certain aspects of the present disclosure.

[0024] Figure 4 Piggybacking downlink control information (DCI) forming a scheduling chain in accordance with certain aspects of the present disclosure is shown.

[0025] Figure 5A is a flow chart illustrating example operations for wireless communications in accordance with certain aspects of the present disclosure.

[0026] Figure 5B Shows that it is possible to execute Figure 5A Exemplary components of the illustrated operations.

[0027] Fig. 6A is a flow chart illustrating example operations for wireless communications in accordance with certain aspects of the present disclosure.

[0028] Figure 6B Shows that it is possible to execute Fig. 6A Exemplary components of the illustrated operations.

[0029] Figure 7 A scheduling chain is shown in which a piggyback DCI may only schedule PDSCHs transmitted before a subsequent control resource set (CORESET) opportunity in accordance with certain aspects of the present disclosure.

[0030] Figure 8 A scheduling chain is shown in which the last piggybacked DCI in the chain is sent before the next CORESET instance in accordance with certain aspects of the present disclosure.

[0031] Fig. 9 A scheduling chain implemented according to a configured maximum number of piggybacked DCIs in accordance with certain aspects of the present disclosure is shown.

[0032] Fig.10 Multiple parallel scheduling chains are shown in accordance with certain aspects of the present disclosure.

[0033] Fig.11 A communications device according to aspects of the present disclosure is shown that may include various components configured to perform operations of the techniques disclosed herein.

[0034] To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures. It is contemplated that elements disclosed in one aspect may be beneficially utilized in other aspects without specific recitation. DETAILED DESCRIPTION

[0035] Aspects of the present disclosure provide apparatus, methods, processing systems, and computer-readable media for implementing a scheduling chain to reduce error propagation according to certain constraints.

[0036] The following description provides an example of a scheduling chain in a communication system, and does not limit the scope, applicability or examples set forth in the claims. Without departing from the scope of the present disclosure, the functions and arrangements of the elements discussed may be changed. Various examples may omit, replace or add various processes or components as appropriate. For example, the method may be performed in an order different from the order described, and various steps may be added, omitted or combined. In addition, the features described in some examples may be combined in some other examples. For example, any number of aspects set forth herein may be used to implement a device or practice method. In addition, the scope of the present disclosure is intended to cover such a device or method, that is, the device or method uses other structures, functions or structures and functions in addition to or as a supplement to the various aspects of the present disclosure set forth herein to practice. It should be understood that any aspect of the present disclosure disclosed herein may be embodied by one or more elements of the claims. The word "exemplary" is used herein to mean "used as an example, instance or illustration". Any aspect described as "exemplary" herein need not necessarily be interpreted as being preferred or advantageous over other aspects.

[0037] Generally, any number of wireless networks can be deployed in a given geographic area. Each wireless network can support a specific radio access technology (RAT) and can operate on one or more frequencies. RAT can also be referred to as radio technology, air interface, etc. Frequency can also be referred to as carrier, subcarrier, frequency channel, tone, subband, etc. Each frequency can support a single RAT in a given geographic area to avoid interference between wireless networks of different RATs.

[0038] The techniques described herein can be used in various wireless networks and radio technologies. Although terms commonly associated with 3G, 4G, and / or new radio (5G NR) wireless technologies may be used herein to describe various aspects, various aspects of the present disclosure can be applied to other communication systems based on generations.

[0039] NR access can support various wireless communication services, such as enhanced mobile broadband (eMBB) for wide bandwidth (e.g., 80MHz or higher), millimeter wave (mmW) for high carrier frequency (e.g., 25GHz or higher), massive machine type communication MTC (mMTC) for non-backward compatible MTC technology, and / or mission critical ultra-reliable low latency communication (URLLC). These services may include latency and reliability requirements. These services may also have different transmission time intervals (TTIs) to meet corresponding quality of service (QoS) requirements. In addition, these services can coexist in the same subframe. NR supports beamforming, and the beam direction can be dynamically configured. MIMO transmission with precoding can also be supported. The MIMO configuration in DL can support up to 8 transmit antennas, with multi-layer DL transmission of up to 8 streams and up to 2 streams per UE. Multi-layer transmission with up to 2 streams per UE can be supported. Aggregation of multiple cells can be supported with up to 8 serving cells.

[0040] Figure 1 An exemplary wireless communication network 100 is shown in which various aspects of the present disclosure may be performed. For example, the wireless communication network 100 may be a NR system (e.g., a 5G NR network). Figure 1 As shown, the wireless communication network 100 may communicate with a core network 132. The core network 132 may communicate with one or more base stations (BSs) 110 and / or user equipments (UEs) 120 in the wireless communication network 100 via one or more interfaces.

[0041] like Figure 1 As shown, the wireless communication network 100 may include multiple BSs 110a-z (each also individually referred to herein as BS 110 or collectively referred to as BS 110) and other network entities. BS 110 may provide communication coverage for a particular geographic area, sometimes referred to as a "cell", which may be stationary or may move depending on the location of the mobile BS 110. In some examples, BSs 110 may be interconnected with each other and / or with one or more other BSs or network nodes (not shown) in the wireless communication network 100 via various types of backhaul interfaces (e.g., direct physical connections, wireless connections, virtual networks, etc.) using any suitable transport network. Figure 1In the example shown, BSs 110a, 110b, and 110c may be macro BSs for macro cells 102a, 102b, and 102c, respectively. BS 110x may be a pico BS for pico cell 102x. BSs 110y and 110z may be femto BSs for femto cells 102y and 102z, respectively. A BS may support one or more cells. A network controller 130 may be coupled to a set of BSs 110 and provide coordination and control (e.g., via a backhaul) for these BSs 110.

[0042] BS 110 communicates with UEs 120a-y (each also individually referred to herein as UE 120 or collectively referred to as UE 120) in the wireless communication network 100. UEs 120 (e.g., 120x, 120y, etc.) may be dispersed throughout the wireless communication network 100, and each UE 120 may be stationary or mobile. The wireless communication network 100 may also include a relay station (e.g., relay station 110r), also referred to as a relay or the like, which receives transmissions of data and / or other information from an upstream station (e.g., BS 110a or UE 120r) and sends transmissions of data and / or other information to a downstream station (e.g., UE 120 or BS 110), and / or relays transmissions between UEs 120 to facilitate communication between devices.

[0043] According to certain aspects, BS 110 and UE 120 may be configured for configuration of a scheduling chain. Figure 1 As shown, BS 110a includes a scheduling manager 112. The scheduling manager 112 may be configured to implement a scheduling chain according to various constraints in accordance with various aspects of the present disclosure. Figure 1 As shown, UE 120a includes a schedule manager 122. Schedule manager 122 may be configured to implement a schedule chain according to various constraints in accordance with aspects of the present disclosure.

[0044] Figure 2 1 shows a BS 110a and a UE 120a (eg, in Figure 1 Example components of a wireless communication network 100).

[0045] At BS 110a, transmit processor 220 may receive data from data source 212 and control information from controller / processor 240. Control information may be for a physical broadcast channel (PBCH), a physical control format indicator channel (PCFICH), a physical hybrid ARQ indicator channel (PHICH), a physical downlink control channel (PDCCH), a packet common PDCCH (GC PDCCH), etc. Data may be for a physical downlink shared channel (PDSCH), etc. A medium access control (MAC) control element (MAC-CE) is a MAC layer communication structure that may be used for control command exchange between wireless nodes. MAC-CE may be carried in a shared channel, such as a physical downlink shared channel (PDSCH), a physical uplink shared channel (PUSCH), or a physical sidelink shared channel (PSSCH).

[0046] The processor 220 may process (e.g., encode and symbol map) data and control information to obtain data symbols and control symbols, respectively. The transmit processor 220 may also generate reference symbols such as for a primary synchronization signal (PSS), a secondary synchronization signal (SSS), and a channel state information reference signal (CSI-RS). The transmit (TX) multiple-input multiple-output (MIMO) processor 230 may perform spatial processing (e.g., precoding) on ​​data symbols, control symbols, and / or reference symbols (if applicable), and may provide an output symbol stream to a modulator (MOD) 232a-232t. Each modulator 232 may process a corresponding output symbol stream (e.g., for OFDM, etc.) to obtain an output sample stream. Each modulator may also process (e.g., convert to analog, amplify, filter, and up-convert) an output sample stream to obtain a downlink signal. The downlink signals from modulators 232a-232t may be transmitted via antennas 234a-234t, respectively.

[0047] At UE 120a, antennas 252a-252r may receive downlink signals from BS 110a and may provide received signals to demodulators (DEMODs) in transceivers 254a-254r, respectively. Each demodulator 254 may condition (e.g., filter, amplify, downconvert, and digitize) a corresponding received signal to obtain input samples. Each demodulator may also process the input samples (e.g., for OFDM, etc.) to obtain received symbols. A MIMO detector 256 may obtain received symbols from all demodulators 254a-254r (if applicable), perform MIMO detection on the received symbols, and provide detected symbols. A receive processor 258 may process (e.g., demodulate, deinterleave, and decode) the detected symbols, provide decoded data for UE 120a to a data sink 260, and provide decoded control information to a controller / processor 280.

[0048] On the uplink, at the UE 120a, a transmit processor 264 may receive and process data from a data source 262 (e.g., for a physical uplink shared channel (PUSCH)) and control information from a controller / processor 280 (e.g., for a physical uplink control channel (PUCCH)). The transmit processor 264 may also generate reference symbols for reference signals (e.g., for a sounding reference signal (SRS)). The symbols from the transmit processor 264 may be precoded by a TX MIMO processor 266 (if applicable), further processed by a modulator in the transceiver 254a-254r (e.g., for SC-FDM, etc.), and transmitted to the BS 110a. At the BS 110a, the uplink signal from the UE 120a may be received by the antenna 234, processed by the modulator 232, detected by the MIMO detector 236 (if applicable), and further processed by the receive processor 238 to obtain decoded data and control information transmitted by the UE 120a. The receive processor 238 may provide the decoded data to a data sink 239 and the decoded control information to a controller / processor 240 .

[0049] Memories 242 and 282 may store data and program codes for BS 110a and UE 120a, respectively.A scheduler 244 may schedule UEs for data transmission on the downlink and / or uplink.

[0050] For example, antenna 252, processors 266, 258, 264, and / or controller / processor 280 of UE 120a and / or antenna 234, processors 220, 230, 238, and / or controller / processor 240 of BS 110a may be used to perform the various techniques and methods described herein. Figure 2 As shown, the controller / processor 240 of the BS 110a has a scheduling manager 112 according to various aspects described herein. Figure 2 As shown, the controller / processor 280 of the UE 120a has a schedule manager 122 in accordance with aspects described herein. Although shown at the controller / processor, other components of the UE 120a and BS 110a may be used to perform the operations described herein.

[0051] NR can utilize orthogonal frequency division multiplexing (OFDM) with cyclic prefix (CP) on uplink and downlink. NR can support half-duplex operation using time division duplex (TDD). OFDM and single carrier frequency division multiplexing (SC-FDM) divide the system bandwidth into multiple orthogonal subcarriers, which are also commonly called frequency modulation, frequency band (bin), etc. Each subcarrier can be modulated with data. Modulation symbols can be sent in the frequency domain with OFDM and in the time domain with SC-FDM. The spacing between adjacent subcarriers can be fixed, and the total number of subcarriers can depend on the system bandwidth. The minimum resource allocation called resource block (RB) can be 12 consecutive subcarriers. The system bandwidth can also be divided into subbands. For example, a subband can cover multiple RBs. NR can support a basic subcarrier spacing (SCS) of 15KHz, and other SCSs (such as 30kHz, 60kHz, 120kHz, 240kHz, etc.) can be defined relative to the basic SCS.

[0052] Figure 3 300 is a diagram showing an example of a frame format for NR. The transmission timeline of each of the downlink and uplink can be divided into units of radio frames. Each radio frame can have a predetermined duration (e.g., 10ms) and can be divided into 10 subframes indexed from 0 to 9, each subframe 1ms. Each subframe can include a variable number of slots (e.g., 1, 2, 4, 8, 16... slots) depending on the SCS. Each slot can include a variable number of symbol periods (e.g., 7 or 14 symbols) depending on the SCS. The symbol period in each slot can be assigned an index. A microslot, which can be referred to as a subslot structure, refers to a transmission time interval having a duration less than a slot (e.g., 2, 3, or 4 symbols). Each symbol in a slot can indicate a link direction (e.g., DL, UL, or flexible) for data transmission, and the link direction of each subframe can be dynamically switched. The link direction can be based on the slot format. Each slot can include DL / UL data and DL / UL control information.

[0053] Example of Downlink Control Information (DCI) Scheduling Restrictions

[0054] In certain implementations, downlink control information (DCI) may be communicated on a physical downlink shared channel (PDSCH), also referred to as a data channel. Higher communication bands, such as the 60 GHz band, may have shorter slot durations compared to lower bands, such as frequency range (FR) 1 and FR2, due to higher subcarrier spacing (SCS) (e.g., 960 kHz, 1.92 MHz, 3.84 MHz) associated with the higher frequency bands. Therefore, the number of physical downlink control channel (PDCCH) monitoring opportunities may increase, resulting in high power consumption. Due to the short slot duration and narrow analog beamforming transmissions on higher frequency bands, the opportunity to send multiple DCIs to different UEs is reduced compared to FR1 / FR2. In contrast, a BS (e.g., a gNB) is more likely to send multiple DCIs to the same UE (e.g., especially for bursty traffic). Therefore, DCI may be sent on a data channel in order to reduce the control channel monitoring density for better micro-sleep scheduling at the UE, thereby reducing power consumption. DCI sent on a data channel (eg, PDSCH) is generally referred to as piggybacked DCI (eg, DCI piggybacked on PDSCH).

[0055] DCI piggybacking provides more efficient delivery of CCI by sharing PDSCH beams, precoding, and demodulation reference signals (DMRS). DCI piggybacking also provides more efficient PDSCH transmission, where certain UEs only rate match around the DCI when receiving the PDSCH. In some cases, multiple piggybacked DCIs can form a scheduling chain, where one piggybacked DCI schedules a data channel, another piggybacked DCI is sent on the data channel, and so on. Certain aspects of the present disclosure relate to techniques for providing a restricted scheduling chain implemented using DCI piggybacking.

[0056] Figure 4 414. The piggyback DCI forming a scheduling chain according to certain aspects of the present disclosure is shown. As shown, a control resource set (CORESET) 402 can schedule resources for a PDSCH 410. The PDSCH 410 can include a DCI 404 (e.g., a piggyback DCI) that schedules resources for a PDSCH 412. The PDSCH 412 can include a DCI 406 that schedules resources for a PDSCH 414. The PDSCH 414 can include a DCI 408 that schedules resources for a PDSCH 416.

[0057] DCI 404, 406, 408 are referred to as piggyback DCI because they are sent on the PDSCH. As described herein, DCI 404, 406, 408 form a scheduling chain. If the UE fails to successfully decode any DCI in the scheduling chain, the scheduling chain will be disconnected, and the UE may not be able to receive subsequent PDSCH transmissions and DCIs in the chain. For example, if the UE fails to decode DCI 404, the UE may not be able to receive PDSCH 412, 414, and 416. Therefore, in the event that PDCCH decoding of one DCI in the chain is unsuccessful, using piggyback DCI from the scheduling chain and sequentially scheduling a large number of PDSCH transmissions may result in error propagation. This may be particularly problematic given the burst interference of millimeter wave (mmW) communications. Certain aspects of the present disclosure provide restrictions on the number of PDSCHs that can be scheduled sequentially before the end of the scheduling chain, as described in more detail herein.

[0058] Figure 5A 5 is a flow diagram illustrating example operations 500A for wireless communications in accordance with certain aspects of the present disclosure. Operations 500A may be performed, for example, by a UE (eg, such as UE 120a in wireless communication network 100).

[0059] Operation 500A may be implemented as a process on one or more processors (e.g., Figure 2 In addition, the signal transmission and reception performed by the UE in operation 500A may be performed, for example, via one or more antennas (e.g., Figure 2 In some aspects, the transmission and / or reception of signals by the UE may be implemented via a bus interface of one or more processors (eg, controller / processor 280) that obtain and / or output signals.

[0060] Operations 500A may begin at block 505A, where the UE determines a limit associated with a number of multiple downlink control information (DCI) for each of at least one scheduling chain, each of at least one of the multiple DCIs to be sent on one of a plurality of data channels, and where each of the multiple DCIs in the scheduling chain schedules another of the plurality of data channels. At block 510A, the UE may receive the plurality of DCIs from the base station on the plurality of data channels based on the determination.

[0061] Fig. 6A 6 is a flow diagram illustrating example operations 600A for wireless communications in accordance with certain aspects of the present disclosure. Operations 600A may be performed, for example, by a BS (eg, BS 110a in wireless communication network 100).

[0062] Operation 600A may be implemented as a process on one or more processors (e.g., Figure 2 In addition, the transmission and reception of signals by the BS in operation 600A may be performed, for example, via one or more antennas (e.g., Figure 2 In some aspects, the transmission and / or reception of signals by the BS may be implemented via a bus interface of one or more processors (eg, controller / processor 240) that obtain and / or output signals.

[0063] At block 605A, the BS may determine a limit associated with a number of multiple downlink control information (DCI) for each of at least one scheduling chain, each of at least one of the multiple DCIs to be sent on one of the multiple data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another of the multiple data channels. At block 610A, the BS may send the multiple DCIs to a user equipment (UE) on the multiple data channels based on the determination.

[0064] Figure 7 A scheduling chain is shown in which a piggyback DCI may only schedule PDSCHs transmitted prior to a subsequent CORESET opportunity in accordance with certain aspects of the present disclosure. In other words, the scheduling chain including piggyback DCIs 404, 406, 408 begins with CORESET 402 scheduling PDSCH 410 on which DCI 404 is transmitted. A subsequent CORESET 702 may begin another scheduling chain including DCIs 718, 722. As shown, DCI 718 is transmitted on PDSCH 720 and schedules PDSCH 724, where DCI 722 is transmitted on PDSCH 724.

[0065] In some aspects, the DCIs for a scheduled chain may be limited to only schedule PDSCHs prior to a subsequent CORESET (e.g., the next CORESET instance). For example, DCIs 404, 406, 408 may be limited to only schedule PDSCHs prior to CORESET 702. Thus, since PDSCH 416 is the last PDSCH prior to CORESET 702, PDSCH 416 may not include DCIs. Thus, the number of DCIs in any particular chain may be limited by the number of PDSCH opportunities between a CORESET instance (e.g., CORESET 402) and the next CORESET instance (CORESET 702). While Figure 7The DCI transmission chain is shown stopping at PDSCH 416 immediately before the next CORESET instance (eg, CORESET 702) to facilitate understanding, but the DCI transmission chain may end at any PDSCH before the next CORESET instance.

[0066] Figure 8 A scheduling chain is shown in which the last DCI in the chain is sent before the next CORESET instance in accordance with certain aspects of the present disclosure. In this case, the PDSCH scheduled by the DCI of the chain may extend beyond the next CORESET instance (e.g., CORESET 702). For example, DCI 408 may schedule resources for PDSCH 416, and PDSCH 416 may include DCI 802. DCI 802 may schedule PDSCH after the next CORESET instance (e.g., CORESET 702), such as PDSCH 720, as shown. However, in this case, PDSCH 720 may not continue the scheduling chain. In other words, the scheduling chain that starts with CORESET 402 ends with DCI 802 because DCI 802 schedules PDSCH after the next CORESET instance.

[0067] Although Figure 8 The PDSCH 416 immediately before the next CORESET instance (e.g., CORESET 702) is shown as the last PDSCH 416 of the scheduling chain including the DCI, effectively ending the scheduling chain, but the last PDSCH including the piggyback DCI for the scheduling chain may be any PDSCH before the next CORESET instance. In addition, the DCI 802 may schedule any PDSCH after the next CORESET instance or any subsequent CORESET instance (e.g., any upcoming Nth CORESET instance, N being greater than 1). For unlicensed bands, the final DCI in the chain may schedule any PDSCH before the end of the corresponding transmission opportunity (TxOP).

[0068] Fig. 9A scheduling chain implemented according to a maximum number of configured piggybacked DCIs in accordance with certain aspects of the present disclosure is shown. For example, a BS may configure or a specification may specify a maximum number of chain DCIs. Once the limit is exceeded, the UE may wait for the next CORESET instance to receive a grant. For example, as shown, a limit of three chain DCIs may be implemented. In other words, DCI 404 may schedule PDSCH 412, DCI 406 may schedule PDSCH 414, and DCI 408 may schedule PDSCH 416. Although DCI 408 may schedule PDSCH 416, PDSCH 416 may not include another piggybacked DCI because the limit on the number of DCIs in the chain has been reached.

[0069] Fig.10 Multiple parallel scheduling chains are shown according to certain aspects of the present disclosure. Multiple parallel scheduling chains can be used to reduce (e.g., limit) the impact of error propagation. For example, three parallel scheduling chains can start from corresponding CORESETs 1002, 1004, 1006.

[0070] As shown, the CORESET 1002 may schedule a PDSCH 1008. As shown, a hybrid automatic repeat request (HARQ)-acknowledgement (ACK) resource 1010 may be scheduled for sending an ACK or negative ACK (NACK) for the PDSCH 1008 (e.g., for slot 1). If the BS receives a NACK for slot 1 in the HARQ-ACK resource 1010 at the end of slot 2, the BS may estimate (e.g., assume) that the piggyback DCI 1012 (e.g., PDCCH) in slot 1 will not be decoded. The piggyback DCI 1012 may schedule resources for slot 4. Therefore, since the BS assumes that the piggyback DCI 1012 is not decoded, the BS may also assume that the PDSCH and piggyback DCI (e.g., PDCCH) that will be present in slot 4 will also not be decoded. Therefore, the BS may determine to end the scheduling chain by abandoning the inclusion of the DCI that continues the chain in slot 3.

[0071] To facilitate the BS to make such a decision, the next PDSCH in the schedule may be scheduled after K0+K1+K3 slots, K0 indicating the slot number from PDCCH (e.g., CORESET 1002) to PDSCH (e.g., PDSCH 1008), K1 indicating the slot number from PDSCH (e.g., PDSCH 1008) to ACK (e.g., HARQ-ACK resource 1010), and K3 indicating the slot number from ACK (e.g., HARQ-ACK resource 1010) to the next PDCCH (e.g., in slot 4). Fig.10In the example given, K0, K1, and K3 are all equal to 1 because there is one slot between CORESET 1002 and slot 2 (e.g., scheduled PDSCH 1008), one slot between slot 2 and HARQ-ACK resource 1010, and one slot between HARQ-ACK resource 1010 and slot 4. In this way, error propagation for each chain can be confined to a single slot.

[0072] In some cases, the UE may fail to decode PDSCH in slot 1, but decodes DCI 1012 that schedules PDSCH in slot 4. Therefore, the UE may expect PDSCH and potential piggyback PDCCH in slot 4. In certain aspects of the present disclosure, the BS may send PDSCH 1014 in slot 4 and a null piggyback PDCCH 1016 (e.g., null DCI) in slot 4, but terminate the chain. In other words, a null PDCCH may be a PDCCH that does not schedule any other transmissions.

[0073] In some cases, the UE may fail to decode PDSCH in slot 1 and may also fail to decode piggyback DCI in slot 1. Therefore, the UE may not expect PDSCH in slot 4. Therefore, in certain aspects of the present disclosure, the BS may skip transmissions in slot 4 entirely because the BS assumes that the UE will not decode the PDSCH and PDCCH that would otherwise be included in slot 4.

[0074] In certain aspects, the HARQ-ACK resource 1010 may indicate an ACK or NACK for the PDSCH in slot 2 and an ACK / NACK for the PDCCH in slot 2. Thus, the BS may determine whether the UE failed to decode the PDSCH and PDCCH in slot 2, or only failed to decode the PDCCH in slot 2 and successfully decoded the PDCCCH in slot 2. Thus, the BS may determine whether to send an empty piggyback PDCCH in slot 4 or to abandon transmission to the UE in slot 4 altogether.

[0075] Certain aspects of the present disclosure relate to techniques for starting a scheduling chain when another chain is terminated. For example, in some aspects, a scheduling chain can be started by scheduling a piggyback PDCCH from other ongoing chains (e.g., chains starting from CORESET 1004, 1006). In some aspects, the piggyback PDCCH can be used to dynamically trigger the UE to monitor a new search space location. For example, a new CORESET search space can be configured in response to the scheduling chain being terminated. That is, if a NACK is received in the HARQ-ACK resource 1010, the scheduling chain starting with CORESET 1002 can be terminated. In this case, a new CORESET can be scheduled, thereby starting a new scheduling chain. For example, the new CORESET in the time slot can be indicated in the DCI in time slot 5.

[0076] In some aspects, the configuration for the new scheduling chain may be preconfigured at the UE. The location of the configured scheduling chain may be specified in the triggered piggyback DCI. In some cases, a search space may have been scheduled for the UE to start a new scheduling chain. Generally, it is preferred to use piggyback grants for a long time. A PDCCH search space (e.g., CORESET) may be used to start a new scheduling chain if necessary.

[0077] Fig.11 A communication device 1100 is shown, which may include devices configured to perform operations for the techniques disclosed herein (such as Figures 4 to 5A 1100 includes various components (e.g., corresponding to means plus functional components) of the communication device 1100. The communication device 1100 includes a processing system 1102 coupled to a transceiver 1108 (e.g., a transmitter and / or a receiver). The transceiver 1108 is configured to transmit and receive signals for the communication device 1100, such as the various signals described herein, via an antenna 1110. The processing system 1102 may be configured to perform processing functions for the communication device 1100, including processing signals received and / or to be transmitted by the communication device 1100.

[0078] The processing system 1102 includes a processor 1104 coupled to a computer-readable medium / memory 1112 via a bus 1106. In some aspects, the computer-readable medium / memory 1112 is configured to store instructions (e.g., computer-executable code) that, when executed by the processor 1104, cause the processor 1104 to perform Figures 4 to 5AThe operations shown or other operations for performing various techniques discussed herein for implementing the scheduling chain. In some aspects, the computer-readable medium / memory 1112 stores code 1114 for determining; and code 1116 for outputting for transmission or acquisition. In some aspects, the processor 1104 has circuitry configured to implement the code stored in the computer-readable medium / memory 1112. The processor 1104 includes circuitry 1118 for determining; and circuitry 1120 for outputting for transmission or acquisition.

[0079] In addition to the above aspects, specific combinations of aspects are also within the scope of the present disclosure, some of which are detailed below:

[0080] Aspect 1: A method for wireless communication, comprising: determining a limit associated with the number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one data channel among multiple data channels, and wherein each DCI in the multiple DCIs in the scheduling chain schedules another data channel among the multiple data channels; and sending multiple DCIs to a user equipment (UE) on the multiple data channels based on the determination.

[0081] Aspect 2: The method according to Aspect 1 also includes sending a control resource set (CORESET) to the UE, the CORESET scheduling a data channel in the data channel having an initial DCI of the scheduling chain, and wherein determining the restriction includes determining that the final DCI in the scheduling chain schedules another data channel in a time slot before the subsequent CORESET to be sent to the UE.

[0082] Aspect 3: The method according to any one of Aspects 1-2 also includes sending a CORESET to the UE, which schedules one data channel among multiple data channels with an initial DCI of the scheduling chain, and wherein determining the restriction includes determining that the final DCI scheduled in the scheduling chain is in a time slot before the subsequent CORESET to be sent to the UE, and the final DCI schedules another data channel to be sent.

[0083] Aspect 4: The method according to aspect 3 further comprises sending a subsequent CORESET, and sending another data channel after the subsequent CORESET.

[0084] Aspect 5: The method according to any one of aspects 1-4, wherein determining the limit comprises determining a limit on the number of multiple DCIs forming a scheduling chain.

[0085] Aspect 6: The method according to any one of aspects 1-5, wherein at least one scheduling chain comprises a plurality of scheduling chains.

[0086] Aspect 7: The method according to aspect 6, wherein multiple scheduling chains are started using multiple CORESETs in a time slot.

[0087] Aspect 8: The method according to any one of aspects 1-7 further includes receiving a hybrid automatic repeat request (HARQ) indication associated with a data channel having a DCI in a plurality of DCIs, wherein determining the restriction is based on the HARQ indication.

[0088] Aspect 9: The method according to aspect 8, wherein the DCI schedules data channel transmission in the time slot, and wherein determining the restriction includes: if the DCI is not successfully decoded by the UE, determining to skip transmission in the time slot.

[0089] Aspect 10: A method according to Aspect 8, wherein the DCI schedules the transmission of a data channel in a time slot, and wherein determining the restriction includes: if the DCI is successfully decoded and the data channel on which the DCI is transmitted is not successfully decoded, then deciding to transmit an empty DCI in the time slot, the method also includes transmitting the empty DCI based on the decision.

[0090] Aspect 11: A method according to Aspect 8, wherein determining the restriction based on the HARQ indication includes determining to terminate the corresponding scheduling chain based on the HARQ indication, and the method also includes sending another DCI on another data channel, wherein the other DCI indication is used to start a search space for another scheduling chain.

[0091] Aspect 12: The method according to aspect 11 further comprises sending a CORESET via the search space, the CORESET scheduling a data channel for another scheduling chain.

[0092] Aspect 13: A method for wireless communication via a user equipment (UE), comprising: determining a limit associated with the number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one data channel among multiple data channels, and wherein each DCI in the multiple DCIs in the scheduling chain schedules another data channel among the multiple data channels; and receiving multiple DCIs from a base station on the multiple data channels based on the determination.

[0093] Aspect 14: The method according to Aspect 13 also includes receiving a control resource set (CORESET), which schedules a data channel in the data channel having an initial DCI of the scheduling chain, and wherein determining the restriction includes determining that the final DCI in the scheduling chain schedules another data channel in a time slot before the subsequent CORESET to be sent to the UE.

[0094] Aspect 15: The method according to any one of Aspects 13-14 further includes receiving a CORESET that schedules one of multiple data channels having an initial DCI of a scheduling chain, and wherein determining the restriction includes determining that a final DCI scheduled in the scheduling chain is in a time slot before a subsequent CORESET to be sent to the UE, and the final DCI schedules another data channel to be sent.

[0095] Aspect 16: The method according to aspect 15, further comprising receiving a subsequent CORESET, and receiving another data channel after the subsequent CORESET.

[0096] Aspect 17: The method according to any one of aspects 13-16, wherein determining the limit comprises determining a limit on the number of multiple DCIs forming a scheduling chain.

[0097] Aspect 18: The method according to any one of Aspects 13-17, wherein at least one scheduling chain comprises a plurality of scheduling chains.

[0098] Aspect 19: The method according to aspect 18, wherein multiple scheduling chains are started using multiple CORESETs in a time slot.

[0099] Aspect 20: The method according to any one of aspects 13-19, further comprising sending a hybrid automatic repeat request (HARQ) indication associated with one of the data channels having the DCI in the plurality of DCIs.

[0100] Aspect 21: The method of aspect 20, wherein the DCI schedules reception of a data channel in a time slot, and wherein reception in the time slot is skipped if the DCI is not successfully decoded by the UE.

[0101] Aspect 22: The method according to aspect 20, wherein the DCI schedules reception of a data channel in the time slot, and wherein the method further comprises: if the DCI is successfully decoded and the data channel on which the DCI is transmitted is not successfully decoded, receiving a null DCI in the time slot.

[0102] Aspect 23: The method according to aspect 20 further comprises, after sending the HARQ indication, receiving another DCI on another data channel, the another DCI indicating a search space for starting another scheduling chain.

[0103] Aspect 24: The method according to aspect 23, further comprising receiving a CORESET via the search space, the CORESET scheduling a data channel for another scheduling chain.

[0104] Aspect 25: A base station comprising: a component for determining a limitation associated with the number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one data channel among multiple data channels, and wherein each DCI in the multiple DCIs in the scheduling chain schedules another data channel among the multiple data channels; and a component for sending multiple DCIs to a user equipment (UE) on the multiple data channels based on the determination.

[0105] Aspect 26: The base station according to Aspect 25 further includes a component for sending a control resource set (CORESET) to the UE, the CORESET scheduling a data channel in the data channel having an initial DCI of the scheduling chain, and wherein the component for determining the restriction includes a component for determining that the final DCI in the scheduling chain schedules another data channel in a time slot before the subsequent CORESET to be sent to the UE.

[0106] Aspect 27: A base station according to any one of Aspects 25-26, further comprising a component for sending a CORESET to a UE, the CORESET scheduling one data channel among multiple data channels having an initial DCI of a scheduling chain, and wherein the component for determining the restriction comprises a component for determining that a final DCI scheduled in the scheduling chain is in a time slot before a subsequent CORESET to be sent to the UE, the final DCI scheduling another data channel to be sent.

[0107] Aspect 28: The base station according to aspect 27 further comprises a means for transmitting a subsequent CORESET, and a means for transmitting another data channel after the subsequent CORESET.

[0108] Aspect 29: A base station according to any one of aspects 25-28, wherein the means for determining the limit comprises means for determining a limit on the number of the plurality of DCIs forming the scheduling chain.

[0109] Aspect 30: A base station according to any one of aspects 25-29, wherein at least one scheduling chain comprises a plurality of scheduling chains.

[0110] Aspect 31: The base station according to aspect 30, wherein multiple scheduling chains are started using multiple CORESETs in a time slot.

[0111] Aspect 32: A base station according to any one of Aspects 25-31, further comprising a component for receiving a hybrid automatic repeat request (HARQ) indication associated with a data channel having a DCI among multiple DCIs in the data channel, wherein the component for determining the restriction comprises a component for determining the restriction based on the HARQ indication.

[0112] Aspect 33: The base station according to aspect 32, wherein the DCI schedules data channel transmission in the time slot, and wherein the means for determining the restriction includes: means for determining to skip the transmission in the time slot if the DCI is not successfully decoded by the UE.

[0113] Aspect 34: A base station according to Aspect 32, wherein the DCI schedules the transmission of a data channel in a time slot, and wherein the component for determining the restriction includes: a component for deciding to send an empty DCI in the time slot if the DCI is successfully decoded and the data channel on which the DCI is sent is not successfully decoded, and the base station also includes a component for sending the empty DCI based on the decision.

[0114] Aspect 35: A base station according to Aspect 32, wherein the component for determining the restriction based on the HARQ indication includes a component for determining to terminate the corresponding scheduling chain based on the HARQ indication, and the base station also includes a component for sending another DCI on another data channel, and the other DCI indication is used to start the search space of another scheduling chain.

[0115] Aspect 36: The base station according to Aspect 35, further comprising a component for sending a CORESET via the search space, the CORESET scheduling a data channel for another scheduling chain.

[0116] Aspect 37: A user equipment (UE), comprising: a component for determining a limitation associated with the number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one data channel among multiple data channels, and wherein each DCI in the multiple DCIs in the scheduling chain schedules another data channel among the multiple data channels; and a component for receiving multiple DCIs from a base station on the multiple data channels based on the determination.

[0117] Aspect 38: The UE according to Aspect 37 further includes a component for receiving a control resource set (CORESET), which CORESET schedules a data channel in the data channel having an initial DCI of a scheduling chain, and wherein the component for determining the restriction includes a component for determining that the final DCI in the scheduling chain schedules another data channel in a time slot before a subsequent CORESET to be sent to the UE.

[0118] Aspect 39: A UE according to any one of Aspects 37-38, further comprising a component for receiving a CORESET, which schedules one data channel among multiple data channels having an initial DCI of a scheduling chain, and wherein the component for determining the restriction comprises a component for determining that a final DCI scheduled in the scheduling chain is in a time slot before a subsequent CORESET to be sent to the UE, the final DCI scheduling another data channel to be sent.

[0119] Aspect 40: The UE according to aspect 39, further comprising means for receiving a subsequent CORESET, and means for receiving another data channel after the subsequent CORESET.

[0120] Aspect 41: The UE according to any of aspects 37-40, wherein the means for determining the limit comprises means for determining a limit on a number of the plurality of DCIs forming the scheduling chain.

[0121] Aspect 42: A UE according to any one of aspects 37-41, wherein at least one scheduling chain comprises a plurality of scheduling chains.

[0122] Aspect 43: The UE according to Aspect 42, wherein multiple scheduling chains are started using multiple CORESETs in a time slot.

[0123] Aspect 44: A UE according to any one of aspects 37-43, further comprising a means for sending a hybrid automatic repeat request (HARQ) indication associated with one of the data channels having the DCI in the plurality of DCIs.

[0124] Aspect 45: The UE according to aspect 44, wherein the DCI schedules reception of a data channel in a time slot, and wherein reception in the time slot is skipped if the DCI is not successfully decoded by the UE.

[0125] Aspect 46: A UE according to aspect 44, wherein the DCI schedules reception of a data channel in the time slot, and wherein the UE further comprises: a means for receiving a null DCI in the time slot if the DCI is successfully decoded and the data channel on which the DCI is transmitted is not successfully decoded.

[0126] Aspect 47: The UE according to aspect 44, further comprising a means for receiving another DCI on another data channel after sending the HARQ indication, the another DCI indicating a search space for starting another scheduling chain.

[0127] Aspect 48: The UE according to aspect 47, further comprising a means for receiving a CORESET via the search space, the CORESET scheduling a data channel for another scheduling chain.

[0128] Aspect 49: A base station comprising: a processing system configured to determine a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and a transmitter configured to send the multiple DCIs to a user equipment (UE) on the plurality of data channels based on the determination.

[0129] Aspect 50: A base station according to Aspect 49, wherein the transmitter is also configured to send a control resource set (CORESET) to the UE, the CORESET scheduling one data channel in the data channel having an initial DCI of the scheduling chain, and wherein determining the restriction includes determining that the final DCI in the scheduling chain schedules another data channel in a time slot before a subsequent CORESET to be sent to the UE.

[0130] Aspect 51: A base station according to any one of Aspects 49-50, wherein the transmitter is also configured to send a CORESET to the UE, the CORESET scheduling one data channel among multiple data channels having an initial DCI of a scheduling chain, and wherein determining the restriction includes determining that a final DCI scheduled in the scheduling chain is in a time slot before a subsequent CORESET to be sent to the UE, and the final DCI schedules another data channel to be sent.

[0131] Aspect 52: The base station according to aspect 51, wherein the transmitter is further configured to transmit a subsequent CORESET, and transmit another data channel after the subsequent CORESET.

[0132] Aspect 53: A base station according to any one of aspects 49-52, wherein determining the limit comprises determining a limit on the number of multiple DCIs forming a scheduling chain.

[0133] Aspect 54: A base station according to any one of aspects 49-53, wherein at least one scheduling chain comprises a plurality of scheduling chains.

[0134] Aspect 55. The base station according to aspect 54, wherein multiple scheduling chains are started using multiple CORESETs in a time slot.

[0135] Aspect 56: A base station according to any one of Aspects 49-55, further comprising a receiver configured to receive a hybrid automatic repeat request (HARQ) indication associated with a data channel having a DCI in a plurality of DCIs in the data channel, wherein determining the restriction includes determining the restriction based on the HARQ indication.

[0136] Aspect 57: The base station according to aspect 56, wherein the DCI schedules the data channel transmission in the time slot, and wherein determining the restriction includes: if the DCI is not successfully decoded by the UE, determining to skip the transmission in the time slot.

[0137] Aspect 58: A base station according to Aspect 56, wherein the DCI schedules the transmission of a data channel in a time slot, wherein determining the restriction includes: if the DCI is successfully decoded and the data channel on which the DCI is transmitted is not successfully decoded, deciding to transmit an empty DCI in the time slot, and wherein the transmitter is also configured to transmit the empty DCI based on the decision.

[0138] Aspect 59: A base station according to Aspect 56, wherein determining the restriction based on the HARQ indication includes determining to terminate the corresponding scheduling chain based on the HARQ indication, and wherein the transmitter is also configured to send another DCI on another data channel, wherein the other DCI indication is used to start a search space for another scheduling chain.

[0139] Aspect 60: The base station according to aspect 59, wherein the transmitter is further configured to transmit a CORESET via the search space, the CORESET scheduling a data channel for another scheduling chain.

[0140] Aspect 61: A user equipment (UE) comprising: a processing system configured to determine a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of multiple data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in the multiple data channels; and a receiver configured to receive multiple DCIs from a base station on the multiple data channels based on the determination.

[0141] Aspect 62: A UE according to Aspect 61, wherein the receiver is also configured to receive a control resource set (CORESET) that schedules one of the data channels having an initial DCI of a scheduling chain, and wherein determining the restriction includes determining that a final DCI in the scheduling chain schedules another data channel in a time slot before a subsequent CORESET to be sent to the UE.

[0142] Aspect 63: A UE according to any one of Aspects 61-62, wherein the receiver is also configured to receive a CORESET that schedules one of multiple data channels having an initial DCI of a scheduling chain, and wherein determining the restriction includes determining that a final DCI scheduled in the scheduling chain is in a time slot before a subsequent CORESET to be sent to the UE, and the final DCI schedules another data channel to be sent.

[0143] Aspect 64: The UE according to aspect 63, wherein the receiver is further configured to receive a subsequent CORESET, and to receive another data channel after the subsequent CORESET.

[0144] Aspect 65: The UE according to any one of aspects 61-64, wherein determining the limit comprises determining a limit on a number of a plurality of DCIs forming a scheduling chain.

[0145] Aspect 66: A UE according to any one of Aspects 61-65, wherein at least one scheduling chain comprises a plurality of scheduling chains.

[0146] Aspect 67: The UE according to Aspect 66, wherein multiple scheduling chains are started using multiple CORESETs in a time slot.

[0147] Aspect 68: A UE according to any one of aspects 61-67, further comprising a transmitter configured to send a hybrid automatic repeat request (HARQ) indication associated with one of the data channels having a DCI in the plurality of DCIs.

[0148] Aspect 69: The UE according to aspect 68, wherein the DCI schedules reception of a data channel in the time slot, and wherein reception in the time slot is skipped if the DCI is not successfully decoded by the UE.

[0149] Aspect 70: A UE according to aspect 68, wherein the DCI schedules reception of a data channel in the time slot, and wherein the receiver is further configured to: receive a null DCI in the time slot if the DCI is successfully decoded and the data channel on which the DCI is transmitted is not successfully decoded.

[0150] Aspect 71: The UE according to aspect 68, wherein the receiver is further configured to receive another DCI on another data channel after sending the HARQ indication, the another DCI indicating a search space for starting another scheduling chain.

[0151] Aspect 72: The UE according to aspect 71, wherein the receiver is further configured to receive a CORESET via the search space, the CORESET scheduling a data channel for another scheduling chain.

[0152] Aspect 73: An apparatus for wireless communication, comprising: a processing system configured to determine a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and an interface configured to output multiple DCIs on the plurality of data channels for transmission based on the determination.

[0153] Aspect 74: An apparatus for wireless communication, comprising: a processing system configured to determine a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in the plurality of data channels; and an interface configured to obtain multiple DCIs from a base station on the plurality of data channels based on the determination.

[0154] Aspect 75: A computer-readable medium for wireless communications, comprising instructions executable to perform the following operations: determine a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in a plurality of data channels; and send multiple DCIs on the plurality of data channels based on the determination.

[0155] Aspect 76: A computer-readable medium for wireless communications, comprising instructions that can perform the following operations: determining a limit associated with a number of multiple downlink control information (DCI) for each scheduling chain in at least one scheduling chain, each DCI in at least one of the multiple DCIs to be sent on one of a plurality of data channels, and wherein each of the multiple DCIs in the scheduling chain schedules another data channel in a plurality of data channels; and receiving multiple DCIs from a base station on the plurality of data channels based on the determination.

[0156] The techniques described herein can be used for various wireless communication technologies, such as NR (e.g., 5G NR), 3GPP Long Term Evolution (LTE), LTE-Advanced (LTE-A), Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), Single Carrier Frequency Division Multiple Access (SC-FDMA), Time Division Synchronous Code Division Multiple Access (TD-SCDMA), and other networks. The terms "network" and "system" are generally used interchangeably. A CDMA network can implement radio technologies such as Universal Terrestrial Radio Access (UTRA), cdma2000, and the like. UTRA includes Wideband CDMA (WCDMA) and other variants of CDMA. cdma2000 covers IS-2000, IS-95, and IS-856 standards. A TDMA network can implement radio technologies such as Global System for Mobile Communications (GSM). OFDMA networks can implement technologies such as NR (e.g., 5G RA), Evolved UTRA (E-UTRA), Ultra Mobile Broadband (UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDM, etc. UTRA and E-UTRA are part of the Universal Mobile Telecommunications System (UMTS). LTE and LTE-A are versions of UMTS that use E-UTRA. UTRA, E-UTRA, UMTS, LTE, LTE-A, and GSM are described in documents from an organization named "3rd Generation Partnership Project" (3GPP). cdma2000 and UMB are described in documents from an organization named "3rd Generation Partnership Project 2" (3GPP2). NR is an emerging wireless communication technology under development.

[0157] In 3GPP, the term "cell" may refer to the coverage area of ​​a Node B (NB) and / or a NB subsystem serving the coverage area, depending on the context in which the term is used. In NR systems, the term "cell" and BS, next-generation NodeB (gNB or gNodeB), access point (AP), distributed unit (DU), carrier or transmit receive point (TRP) may be used interchangeably. A BS may provide communication coverage for a macro cell, a pico cell, a femto cell and / or other types of cells. A macro cell may cover a relatively large geographic area (e.g., a radius of several kilometers) and may allow unrestricted access to UEs with service subscriptions. A pico cell may cover a relatively small geographic area and may allow unrestricted access to UEs with service subscriptions. A femto cell may cover a smaller geographic area (e.g., a home) and may allow restricted access by UEs associated with a femto cell (e.g., UEs in a closed subscriber group (CSG), UEs of users in a home, etc.). A BS for a macro cell may be referred to as a macro BS. A BS for a pico cell may be referred to as a pico BS. A BS for a femto cell may be referred to as a femto BS or a home BS.

[0158] UE may also be referred to as a mobile station, a terminal, an access terminal, a subscriber unit, a station, a customer premises equipment (CPE), a cellular phone, a smart phone, a personal digital assistant (PDA), a wireless modem, a wireless communication device, a handheld device, a laptop computer, a cordless phone, a wireless local loop (WLL) station, a tablet computer, a camera, a gaming device, a netbook, a smartbook, an ultrabook, an appliance, a medical device or medical instrument, a biometric sensor / device, a wearable device (such as a smart watch, smart clothing, smart glasses, a smart wristband, smart jewelry (e.g., a smart ring, a smart bracelet, etc.)), an entertainment device (e.g., a music device, a video device, a satellite radio, etc.), a vehicle component or sensor, a smart meter / sensor, an industrial manufacturing device, a global positioning system device, or any other suitable device configured to communicate via a wireless or wired medium. Some UEs may be considered machine type communication (MTC) devices or evolved MTC (eMTC) devices. MTC and eMTC UEs include, for example, robots, drones, remote devices, sensors, meters, monitors, location tags, etc. that can communicate with a BS, another device (e.g., a remote device), or some other entity. A wireless node can provide, for example, connectivity to or to a network (e.g., a wide area network such as the Internet or a cellular network) via a wired or wireless communication link. Some UEs may be considered Internet of Things (IoT) devices, which may be narrowband IoT (NB-IoT) devices.

[0159] In some examples, access to the air interface can be scheduled. A scheduling entity (e.g., BS) allocates resources for communication between some or all devices and equipment within its service area or cell. The scheduling entity may be responsible for scheduling, specifying, reconfiguring, and releasing resources for one or more subordinate entities. That is, for scheduling communications, subordinate entities utilize resources allocated by the scheduling entity. The base station is not the only entity that can be used as a scheduling entity. In some examples, a UE may be used as a scheduling entity, and resources for one or more subordinate entities (e.g., one or more other UEs) may be scheduled, and other UEs may use the resources scheduled by the UE for wireless communications. In some examples, a UE may be used as a scheduling entity in a peer-to-peer (P2P) network and / or a mesh network. In a mesh network example, in addition to communicating with a scheduling entity, UEs may also communicate directly with each other.

[0160] The method disclosed herein includes one or more steps or actions for implementing the method. Without departing from the scope of the claims, the method steps and / or actions can be interchangeable with each other. In other words, unless a specific order of steps or actions is specified, the order and / or use of specific steps and / or actions can be modified without departing from the scope of the claims.

[0161] As used herein, a phrase referring to "at least one" of a list of items refers to any combination of those items, including single members. For example, "at least one of a, b, or c" is intended to cover a, b, c, ab, ac, bc, and abc, as well as any combination with multiples of the same elements (e.g., aa, aaa, aab, aac, abb, acc, bb, bbb, bbc, cc, and ccc or any other ordering of a, b, and c).

[0162] As used herein, the term "determine" encompasses a wide variety of actions. For example, "determine" may include calculating, computing, processing, deriving, investigating, searching (e.g., searching in a table, a database, or another data structure), ascertaining, etc. In addition, "determine" may include receiving (e.g., receiving information), accessing (e.g., accessing data in a memory), etc. In addition, "determine" may include resolving, selecting, choosing, establishing, etc.

[0163] The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects. Therefore, the claims are not intended to be limited to the aspects shown herein, but should be given a full scope consistent with the language of the claims, wherein the reference to an element in the singular is not intended to mean "one and only one", but "one or more", unless specifically stated otherwise. Unless otherwise specifically stated, the term "some" refers to one or more. All structural and functional equivalents of the elements throughout the various aspects described in this disclosure that are known or will be known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be covered by the claims. Moreover, regardless of whether such disclosure is explicitly stated in the claims, nothing disclosed herein is intended to be exclusively published. No claim element shall be interpreted according to 35 USC § 112 (f) unless the element is explicitly stated with the phrase "means for...", or, in the case of a method claim, the element is stated with the phrase "step for...".

[0164] The various operations of the above method can be performed by any suitable component capable of performing the corresponding function. The component may include various hardware and / or software components and / or modules, including but not limited to circuits, application specific integrated circuits (ASICs) or processors. Generally, where operations are shown in the accompanying drawings, those operations may have corresponding corresponding components plus functional components with similar numbers.

[0165] The various illustrative logical blocks, modules, and circuits described in conjunction with the present disclosure may be implemented or executed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device (PLD), 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 commercially available processor, controller, microcontroller, or state machine. The processor may also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a plurality of microprocessors, a combination of one or more microprocessors and a DSP core, or any other such configuration.

[0166] If implemented in hardware, an exemplary hardware configuration may include a processing system in a wireless node. The processing system may be implemented using a bus architecture. The bus may include any number of interconnecting buses and bridges, depending on the specific application and overall design constraints of the processing system. The bus may link together various circuits including a processor, a machine-readable medium, and a bus interface. Among other things, the bus interface may be used to connect a network adapter to the processing system via the bus. The network adapter may be used to implement the signal processing functions of the PHY layer. In the case of a user terminal (see Figure 1 ), a user interface (e.g., keyboard, display, mouse, joystick, etc.) may also be connected to the bus. The bus may also link various other circuits, such as timing sources, peripherals, voltage regulators, power management circuits, etc., which are well known in the art and will not be described in detail. The processor may be implemented with one or more general and / or special purpose processors. Examples include microprocessors, microcontrollers, DSP processors, and other circuits that can execute software. Those skilled in the art will recognize how to best implement the described functionality for a processing system, depending on the specific application and the overall design constraints imposed on the entire system.

[0167] If implemented in software, the function may be stored as one or more instructions or codes on a computer-readable medium or sent through a computer-readable medium. Software should be broadly interpreted as referring to instructions, data, or any combination thereof, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. Computer-readable media include both computer storage media and communication media, and communication media include any media that facilitates the transfer of computer programs from one place to another. The processor may be responsible for managing the bus and general processing, including executing software modules stored on a machine-readable storage medium. A computer-readable storage medium may be coupled to a processor so that the processor can read information from the storage medium and can write information to the storage medium. Alternatively, the storage medium may be integrated with the processor. For example, a machine-readable medium may include a transmission line, a carrier modulated by data, and / or a computer-readable storage medium having instructions stored thereon separated from a wireless node, all of which may be accessed by a processor through a bus interface. Alternatively or in addition, a machine-readable medium or any portion thereof may be integrated into a processor, such as a case where there may be a cache and / or a general register file. For example, examples of machine-readable storage media may include RAM (random access memory), flash memory, ROM (read-only memory), PROM (programmable read-only memory), EPROM (erasable programmable read-only memory), EEPROM (electrically erasable programmable read-only memory), registers, magnetic disks, optical disks, hard disk drives, or any other suitable storage media, or any combination thereof. Machine-readable media may be embodied in a computer program product.

[0168] A software module may include a single instruction or many instructions, and may be distributed over several different code segments, between different programs, and over multiple storage media. A computer-readable medium may include multiple software modules. A software module includes instructions that, when executed by a device such as a processor, cause a processing system to perform various functions. A software module may include a sending module and a receiving module. Each software module may reside in a single storage device, or may be distributed over multiple storage devices. For example, when a triggering event occurs, a software module may be loaded from a hard drive into a RAM. During the execution of a software module, a processor may load some instructions into a cache to increase access speed. One or more cache lines may then be loaded into a general register file for execution by the processor. When referring to the functions of the following software modules, it should be understood that such functions are implemented by a processor when instructions from the software module are executed.

[0169] Additionally, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared (IR), radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. As used herein, disk and disc include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and Optical disks, where magnetic disks typically reproduce data magnetically, and optical disks reproduce data optically using lasers. Thus, in some aspects, computer-readable media may include non-transitory computer-readable media (e.g., tangible media). Additionally, for other aspects, computer-readable media may include transitory computer-readable media (e.g., signals). Combinations of the above should also be included within the scope of computer-readable media.

[0170] Thus, certain aspects may include a computer program product for performing the operations presented herein. For example, such a computer program product may include a computer-readable medium having instructions stored (and / or encoded) thereon, the instructions being executable by one or more processors to perform the operations described herein, for example, for performing the operations described herein and in FIG. 5A to FIG. 6A Instructions for the operations shown in .

[0171] In addition, it should be understood that the modules and / or other appropriate components for performing the methods and techniques described herein can be downloaded and / or otherwise obtained by the user terminal and / or base station as appropriate. For example, such a device can be coupled to a server to facilitate the transfer of components for performing the methods described herein. Alternatively, the various methods described herein can be provided via a storage component (e.g., RAM, ROM, a physical storage medium such as an optical disc (CD) or a floppy disk, etc.), so that the user terminal and / or base station can obtain various methods when the storage component is coupled to or provided to the device. In addition, any other suitable technology for providing the methods and techniques described herein to the device can be utilized.

[0172] It is to be understood that the claims are not limited to the precise configuration and components shown above. Various modifications, changes and variations may be made in the arrangement, operation and details of the methods and apparatus described above without departing from the scope of the claims.

Claims

1. A method for wireless communication, comprising: determining a limit associated with a number of a plurality of downlink control information (DCI) of at least a first scheduling chain, each of the plurality of DCIs to be sent on one of a plurality of data channels, and wherein each of the plurality of DCIs in the first scheduling chain schedules another data channel of the plurality of data channels; as well as The plurality of DCIs are sent to a user equipment UE on the plurality of data channels according to the determination.

2. The method according to claim 1 also includes sending a control resource set CORESET to the UE, the CORESET scheduling one data channel of the multiple data channels with the initial DCI of the scheduling chain, and wherein determining the restriction includes determining that the final DCI in the first scheduling chain schedules another data channel in a time slot before the subsequent CORESET to be sent to the UE.

3. The method according to claim 1 also includes sending a control resource set CORESET to the UE, the CORESET scheduling one of the multiple data channels with the initial DCI of the first scheduling chain, and wherein determining the restriction includes determining that a final DCI in the first scheduling chain is in a time slot before a subsequent CORESET to be sent to the UE, the final DCI scheduling another data channel to be sent.

4. The method of claim 3, further comprising transmitting the subsequent CORESET, and transmitting the another data channel after the subsequent CORESET. 5 . The method of claim 1 , wherein determining the limit comprises determining a limit on the number of the plurality of DCIs forming the first scheduling chain. The method of claim 1 , wherein the at least a first scheduling chain comprises a plurality of scheduling chains. The method of claim 6 , wherein the plurality of scheduling chains are started using a plurality of CORESETs in a time slot.

8. The method of claim 1, further comprising receiving a hybrid automatic repeat request (HARQ) indication associated with one of the data channels having a DCI from the plurality of DCIs, wherein determining the restriction is based on the HARQ indication.

9. The method of claim 8, wherein the DCI schedules data channel transmissions in a time slot, and wherein determining the restriction comprises: If the DCI is not successfully decoded by the UE, it is determined to skip transmission in the time slot.

10. The method of claim 8, wherein the DCI schedules data channel transmissions in a time slot, and wherein determining the restriction comprises: If the DCI is successfully decoded and the data channel on which the DCI is transmitted is not successfully decoded, deciding to transmit a null DCI in the time slot, the method further comprising transmitting the null DCI according to the decision.

11. The method of claim 8, wherein determining the restriction based on the HARQ indication comprises determining to terminate the first scheduling chain based on the HARQ indication, the method further comprising sending another DCI on another data channel, the another DCI indicating a search space for starting another scheduling chain. 12 . The method of claim 11 , further comprising transmitting a CORESET via the search space, the CORESET scheduling a data channel for the another scheduling chain.

13. A method for wireless communication via a user equipment UE, comprising: determining a limit associated with a number of a plurality of downlink control information (DCI) of at least a first scheduling chain, each of the plurality of DCIs to be sent on one of a plurality of data channels, and wherein each of the plurality of DCIs in the first scheduling chain schedules another data channel of the plurality of data channels; as well as The plurality of DCIs are received from a network entity on the plurality of data channels based on the determination.

14. The method of claim 13, further comprising receiving a control resource set CORESET, the CORESET scheduling one of the multiple data channels with an initial DCI of the first scheduling chain, and wherein determining the restriction comprises determining that a final DCI in the first scheduling chain schedules another data channel in a time slot before a subsequent CORESET to be sent to the UE.

15. The method according to claim 13 also includes receiving a control resource set CORESET, which schedules one of the multiple data channels with an initial DCI of the first scheduling chain, and wherein determining the restriction includes determining that a final DCI in the first scheduling chain is in a time slot before a subsequent CORESET to be sent to the UE, and the final DCI schedules another data channel to be sent.

16. The method of claim 15, further comprising receiving the subsequent CORESET, and receiving the another data channel after the subsequent CORESET.

17. The method of claim 13, wherein determining the limit comprises determining a limit on the number of the plurality of DCIs forming the first scheduling chain.

18. The method of claim 13, wherein the at least a first scheduling chain comprises a plurality of scheduling chains.

19. The method of claim 18, wherein the plurality of scheduling chains are started using a plurality of CORESETs in a time slot.

20. The method of claim 13, further comprising sending a hybrid automatic repeat request (HARQ) indication associated with one of the data channels having a DCI from the plurality of DCIs.

21. The method of claim 20, wherein the DCI schedules data channel reception in a time slot, and wherein reception in the time slot is skipped if the DCI is not successfully decoded by the UE.

22. The method of claim 20, wherein the DCI schedules data channel reception in a time slot, and wherein the method further comprises: If the DCI is successfully decoded and the data channel on which the DCI is transmitted is not successfully decoded, a null DCI is received in the time slot.

23. The method of claim 20, further comprising receiving another DCI on another data channel after sending the HARQ indication, the another DCI indicating a search space for initiating another scheduling chain.

24. The method of claim 23, further comprising receiving a CORESET via the search space, the CORESET scheduling a data channel for the another scheduling chain.

25. A network entity, comprising: a processing system configured to determine a limit associated with a number of a plurality of downlink control information (DCI) of at least a first scheduling chain, each of the plurality of DCIs to be transmitted on one of a plurality of data channels, and wherein each of the plurality of DCIs in the first scheduling chain schedules another data channel of the plurality of data channels; as well as A transmitter is configured to send the plurality of DCIs to a user equipment UE on the plurality of data channels according to the determination.

26. The network entity of claim 25, wherein the transmitter is further configured to send a control resource set CORESET to the UE, the CORESET scheduling one of the multiple data channels with the initial DCI of the first scheduling chain, and wherein determining the restriction comprises determining that a final DCI in the first scheduling chain schedules another data channel in a time slot before a subsequent CORESET to be sent to the UE.

27. The network entity of claim 25, wherein the transmitter is further configured to send a control resource set CORESET to the UE, the CORESET scheduling one of the multiple data channels having an initial DCI of the first scheduling chain, and wherein determining the restriction comprises determining that a final DCI in the first scheduling chain is in a time slot before a subsequent CORESET to be sent to the UE, the final DCI scheduling another data channel to be sent.

28. A user equipment UE, comprising: a processing system configured to determine a limit associated with a number of a plurality of downlink control information (DCI) of at least a first scheduling chain, each of the plurality of DCIs to be transmitted on one of a plurality of data channels, and wherein each of the plurality of DCIs in the first scheduling chain schedules another data channel of the plurality of data channels; as well as A receiver is configured to receive the plurality of DCIs from a network entity on the plurality of data channels according to the determination.

29. The UE of claim 28, wherein the receiver is further configured to receive a control resource set CORESET, the CORESET scheduling one of the multiple data channels having an initial DCI of the first scheduling chain, and wherein determining the restriction comprises determining that a final DCI in the first scheduling chain schedules another data channel in a time slot before a subsequent CORESET to be sent to the UE.

30. The UE of claim 28, wherein the receiver is further configured to receive a control resource set CORESET, the CORESET scheduling one of the multiple data channels having an initial DCI of the first scheduling chain, and wherein determining the restriction comprises determining that a final DCI in the first scheduling chain is in a time slot before a subsequent CORESET to be sent to the UE, the final DCI scheduling another data channel to be sent.

Images