Multi-TTI Scheduling of PDSCH and PUSCH with DCI

Abstract

A user equipment (UE) configured for operation in a fifth generation new radio (5G NR) system may be configured for multi-physical downlink shared channel (PDSCH) scheduling and may decode a first downlink control information (DCI) and a second DCI received from a gNodeB (gNB). The first DCI may schedule multiple PDSCHs, and the second DCI may schedule one or more PDSCHs. The UE may check a timing relationship of the scheduled PDSCHs for validity if the first DCI and the second DCI end in the same symbol. If it is determined that the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have overlapping time spans, the UE may identify all PDSCHs scheduled by the first DCI and the second DCI as invalid.

Description

[Technical field]

[0001] [Priority claim] This application claims priority to U.S. Provisional Patent Application No. 63 / 186,708, filed May 10, 2022 [Reference No. AD6517-Z], and U.S. Provisional Patent Application No. 63 / 298,509, filed January 11, 2022 [Reference No. AE1402-Z], which are incorporated by reference in their entireties herein.

[0002] Embodiments relate to wireless communications. Some embodiments relate to wireless networks, including fifth generation (5G) networks, including 3GPP (3rd Generation Partnership Project) and 5G New Radio (NR) (or 5G-NR) networks. Some embodiments relate to sixth generation (6G) networks. [Background technology]

[0003] Mobile communications have evolved significantly from early voice systems to today's highly sophisticated integrated communications platforms. The use of 3GPP 5G NR systems is increasing with the improvement of different types of devices communicating with various network devices. The penetration of mobile devices (user equipment or UE) in modern society is driving the demand for a variety of network-connected devices in many different environments. 5G NR wireless systems are emerging and are expected to enable higher speeds, connectivity, and availability, while increasing throughput, coverage, and robustness and reducing latency and operational and capital costs. 5G-NR networks will continue to evolve based on 3GPP LTE-Advanced with additional potential new radio access technologies (RATs) to enrich people's lives with seamless wireless connectivity solutions that deliver high speed and rich content and services. As current cellular network frequencies are saturated, higher frequencies such as millimeter wave (mmWave) frequencies may be beneficial due to their high bandwidth.

[0004] One issue with 5G NR wireless systems is that the downlink control information (DCI) format may allow for scheduling one or more physical downlink shared channels (PDSCHs) or physical uplink shared channels (PUSCHs) with separate transport blocks (TBs). [Brief description of the drawings]

[0005] [Figure 1A] FIG. 1 illustrates a network architecture according to some embodiments.

[0006] [Figure 1B] FIG. 1 illustrates a non-roaming 5G system architecture according to some embodiments. [Figure 1C] FIG. 1 illustrates a non-roaming 5G system architecture according to some embodiments.

[0007] [Figure 1D] FIG. 1 illustrates multiple transmission time interval (TTI) scheduling for a physical downlink shared channel (PDSCH).

[0008] [Figure 2A] 1 illustrates a timing relationship between a physical downlink control channel (PDCCH) and a scheduled PDSCH according to some embodiments. [Figure 2B] 1 illustrates a timing relationship between a physical downlink control channel (PDCCH) and a scheduled PDSCH according to some embodiments. [Figure 2C] 1 illustrates a timing relationship between a physical downlink control channel (PDCCH) and a scheduled PDSCH according to some embodiments. [Figure 2D]1 illustrates a timing relationship between a physical downlink control channel (PDCCH) and a scheduled PDSCH according to some embodiments. [Figure 2E] 1 illustrates a timing relationship between a physical downlink control channel (PDCCH) and a scheduled PDSCH according to some embodiments.

[0009] [Figure 3A] 1 illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments. [Figure 3B] 1 illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments. [Figure 3C] 1 illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments. [Figure 3D] 1 illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments. [Figure 3E] 1 illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments. [Figure 3F] 1 illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments. [Figure 3G] 1 illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments.

[0010] [Figure 4A] FIG. 13 further illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments. [Figure 4B] FIG. 13 further illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments. [Figure 4C]FIG. 13 further illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments. [Figure 4D] FIG. 13 further illustrates a timing relationship between a PDCCH and a scheduled PDSCH according to some embodiments.

[0011] [Diagram 5] FIG. 1 is a functional block diagram of a wireless communication device according to some embodiments. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0012] The following description and drawings sufficiently illustrate specific embodiments to enable those skilled in the art to practice them. Other embodiments may incorporate structural, logical, electrical, process, and other changes. Portions and features of some embodiments may be included in or substituted for those of other embodiments. The embodiments described in the claims encompass all available equivalents of those claims.

[0013] Some embodiments are directed to multi-transmission time interval (multi-TTI) scheduling. Some embodiments are directed to checking timing for shared channels scheduled with downlink control information (DCI) formats that end in the same symbol.

[0014] Some embodiments are directed to a user equipment (UE) configured for operation in a fifth generation new radio (5G NR) system. In these embodiments, if the UE is configured for multi-physical downlink shared channel (PDSCH) scheduling, the UE may be configured to decode a first downlink control information (DCI) (DCI 1) and a second DCI (DCI 2) received from a gNodeB (gNB). The first DCI may schedule multiple PDSCHs, and the second DCI may schedule one or more PDSCHs. The UE may check a timing relationship of the scheduled PDSCHs for validity if the first DCI and the second DCI end in the same symbol. The UE may include a memory that stores the first and second DCIs. In some embodiments, multiple PDSCHs, each having a different transport block (TB), may be scheduled, although the scope of the embodiments is not limited in this respect. These embodiments are discussed in more detail below.

[0015] In some embodiments, if the first DCI and the second DCI end in the same symbol, the UE may check the timing relationship of the scheduled PDSCHs for validity by determining whether the PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have an overlapping time span. In these embodiments, since the first DCI and the second DCI end in the same symbol, the UE knows the content of the DCIs at the same time. Although many of the embodiments disclosed herein relate to scheduling a PDSCH, the scope of the embodiments is not limited in this respect as the embodiments may also apply to scheduling a physical uplink shared channel (PUSCH).

[0016] In some embodiments, if the first DCI and the second DCI end in the same symbol and if the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI are determined to have non-overlapping time spans, the UE may identify some or all of the PDSCHs scheduled by the first DCI and the second DCI as valid and may attempt to decode the scheduled PDSCHs, although the scope of the embodiments is not limited in this respect.

[0017] In some embodiments, if the first DCI and the second DCI end in the same symbol and if the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI are determined to have overlapping time spans, the UE may identify all PDSCHs scheduled by the first DCI and the second DCI as invalid and may refrain from attempting to decode or decode any scheduled PDSCHs, although the scope of the embodiments is not limited in this respect. In some of these embodiments, if the first DCI and the second DCI end in the same symbol and if the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI are determined to have overlapping time spans, the behavior of the UE is limited or undefined (i.e., an implementation-undefined error case). In these embodiments, if the first DCI and the second DCI end in the same symbol, the UE may be configured to check all possible combinations of scheduled PDSCHs for validity, and if any combination is invalid, then all combinations may be considered invalid, although the scope of the embodiments is not limited in this respect.

[0018] In some embodiments, if the first DCI and the second DCI do not end at the same symbol, the multiple PDSCHs scheduled by the first DCI are scheduled by the gNB to have a non-overlapping time span with one or more PDSCHs scheduled by the second DCI. In these embodiments, if the first DCI and the second DCI do not end at the same symbol, the multiple PDSCHs scheduled by the first DCI are assumed by the UE to have a non-overlapping time span with the PDSCHs scheduled by the second DCI. Thus, the UE does not need to check the scheduled PDSCHs for validity. In these embodiments, if the first DCI and the second DCI do not end at the same symbol, the UE does not expect the scheduled PDSCHs of the two DCIs to have an overlapping time span, where the time span associated with the DCIs is defined as from the start of the first scheduled PDSCH or to the end of the last scheduled PDSCH. Thus, the UE does not need to check the timing relationship of the scheduled PDSCHs for validity, although the scope of the embodiments is not limited in this respect.

[0019] In some embodiments, if the first DCI and the second DCI do not end at the same symbol, the UE may refrain from checking the timing relationship of the scheduled PDSCHs for validity. In these embodiments, if the first DCI and the second DCI do not end at the same symbol, and if the first DCI ends before the second DCI ends, the start of the first PDSCH of the one or more PDSCHs scheduled by the second DCI is not expected to be earlier than the end of the last PDSCH of the multiple PDSCHs scheduled by the first DCI. In these embodiments, if the first DCI and the second DCI do not end at the same symbol, and if the first DCI ends before the second DCI ends, the end of the last PDSCH of the multiple PDSCHs scheduled by the first DCI is expected to be earlier than the start of the first PDSCH of the one or more PDSCHs scheduled by the second DCI, although the scope of the embodiments is not limited in this respect.

[0020] In some embodiments, if the first DCI and the second DCI are received in the same time slot but do not end in the same symbol, the UE may not need to check the timing relationship of the scheduled PDSCH for validity, although the scope of the embodiments is not limited in this respect.

[0021] In some alternative embodiments, if the first DCI and the second DCI do not end in the same symbol, and if the first DCI ends in an earlier symbol than the second DCI, the UE may check the timing relationship of the scheduled PDSCHs for validity by determining whether the PDSCHs scheduled by the first DCI end before the one or more PDSCHs scheduled by the second DCI. In these alternative embodiments, the PDSCHs scheduled by the first DCI must end before the PDSCHs scheduled by the second DCI to be considered valid scheduling, although the scope of the embodiments is not limited in this respect. An example of this invalid scheduling is shown in FIG. 3G.

[0022] In some embodiments, a first time span associated with a first DCI starts at a first symbol of a first PDSCH scheduled by the first DCI and extends to a last symbol of a last PDSCH scheduled by the first DCI. In these embodiments, a second time span associated with a second DCI starts at a first symbol of a first PDSCH scheduled by the second DCI and extends to a last symbol of a last PDSCH scheduled by the second DCI. In these embodiments, the UE may use a configured time domain resource allocation (TDRA) table to determine the location of the scheduled PDSCH (i.e., which symbol and slot). In these embodiments, a time span of a PDSCH associated with a DCI starts at a first symbol of a first scheduled PDSCH and extends to a last symbol of a last scheduled PDSCH, although the scope of the embodiments is not limited in this respect.

[0023] In some embodiments, for multi-PDSCH or multi-PUSCH scheduling where each of the multiple PDSCHs or PUSCHs scheduled by the first DCI includes a different transport block (TB), each scheduled PDSCH or PUSCH may be associated with a different hybrid automatic repeat request (HARQ) process identifier (ID) for the serving cell. In these embodiments, when each of the one or more PDSCHs or PUSCHs scheduled by the second DCI includes a different TB, each scheduled PDSCH or PUSCH is associated with a different HARQ process ID for the serving cell. In these embodiments, the UE may encode HARQ feedback for transmission to the gNB for each of the different HARQ process IDs. In these embodiments, the multi-PDSCHs may be scheduled by the first DCI and the multi-PDSCHs may be scheduled by the second DCI, although the scope of the embodiments is not limited in this respect.

[0024] In some embodiments, when the multiple PDSCHs or PUSCHs scheduled by the first DCI each include a different transport block (TB), each scheduled PDSCH or PUSCH may be associated with a different HARQ process ID for the serving cell. In these embodiments, for PUSCH repetition type A or B when the one or more PDSCHs or PUSCHs scheduled by the second DCI each include repetitions of the same TB, the one or more PDSCHs or PUSCHs scheduled by the second DCI are all associated with the same second single HARQ process ID for the serving cell. In these embodiments, the UE may encode HARQ feedback for transmission to the gNB for each of the different HARQ process IDs. In these embodiments, a multi-PDSCH may be scheduled by the first DCI and a multi-slot PDSCH may be scheduled by the second DCI, although the scope of the embodiments is not limited in this respect.

[0025] In some embodiments, for multi-PDSCH or multi-PUSCH scheduling where each of the multiple PDSCHs or PUSCHs scheduled by the first DCI includes a different transport block (TB), each scheduled PDSCH or PUSCH may be associated with a different HARQ process ID for the serving cell. In these embodiments, when the second DCI schedules a single PDSCH or PUSCH including a single TB, the single PDSCH or PUSCH may be associated with a second single HARQ process ID for the serving cell. In these embodiments, the UE may encode HARQ feedback for transmission to the gNB for each of the different HARQ process IDs. In these embodiments, the multi-PDSCHs may be scheduled by the first DCI and the multi-PDSCHs may be scheduled by the second DCI, although the scope of the embodiments is not limited in this respect.

[0026] Some embodiments are directed to a non-transitory computer-readable storage medium storing instructions for execution by a processing circuit of a user equipment (UE) configured for operation in a fifth generation new radio (5G NR) system. In these embodiments, the processing circuit is configured to decode a first downlink control information (DCI) (DCI 1) and a second DCI (DCI 2) received from a gNodeB (gNB) when the UE is configured for multi-physical downlink shared channel (PDSCH) scheduling. The first DCI may schedule multiple PDSCHs and the second DCI may schedule one or more PDSCHs. In these embodiments, the processing circuit may check a timing relationship of the scheduled PDSCHs for validity if the first DCI and the second DCI end at the same symbol. In some embodiments, the processing circuit includes a baseband processor. These embodiments are described in more detail below.

[0027] Some embodiments are directed to a gNodeB (gNB) configured for operation in a fifth generation new radio (5G NR) system. In these embodiments, for a user equipment (UE) configured for multi-physical downlink shared channel (PDSCH) scheduling, the gNB may encode a first downlink control information (DCI) (DCI 1) and a second DCI (DCI 2) for transmission to the UE. The first DCI may schedule multiple PDSCHs, and the second DCI may schedule one or more PDSCHs. In these embodiments, if the first DCI and the second DCI end in the same symbol, the UE is configured to check a timing relationship of the scheduled PDSCHs for validity. If the PDSCHs scheduled by the first DCI and one or more PDSCHs scheduled by the second DCI have overlapping time spans, the gNB is not expected to receive Hybrid Automatic Repeat Request Acknowledgement (HARQ-ACK) feedback from the UE for the scheduled PDSCHs because the UE may have determined that the scheduled PDSCHs are invalid, although the scope of the embodiments is not limited in this respect. These embodiments are described in more detail below.

[0028] In some embodiments, if the first DCI and the second DCI end in the same symbol and if the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have non-overlapping time spans, the gNB may decode a HARQ-ACK feedback from the UE for a scheduled PDSCH that is decoded by the UE, although the scope of the embodiments is not limited in this respect.

[0029] 1A illustrates a network architecture, according to some embodiments. Network 140A is illustrated as comprising user equipment (UE) 101 and UE 102. UE 101 and 102 are illustrated as smartphones (e.g., handheld touchscreen mobile computing devices capable of connecting to one or more cellular networks), but may also include any mobile or non-mobile computing device, such as a personal digital assistant (PDA), a pager, a laptop computer, a desktop computer, a wireless handset, a drone, or any other computing device that includes a wired and / or wireless communication interface. UE 101 and 102 may be collectively referred to herein as UE 101, which may be used to perform one or more of the techniques disclosed herein.

[0030] Any of the wireless links described herein (e.g., as used in network 140A or any other illustrated network) may operate according to any example wireless communication technology and / or standard.

[0031] LTE and LTE Advanced are standards for high-speed data wireless communications for UEs, such as mobile phones. In LTE Advanced and various wireless systems, carrier aggregation is a technique according to which multiple carrier signals operating on different frequencies may be used to carry communications for a single UE, thus increasing the available bandwidth to a single device. In some embodiments, carrier aggregation may be used when one or more component carriers operate on unlicensed frequencies.

[0032] The embodiments described herein may be used in the context of any spectrum management scheme including, for example, dedicated licensed spectrum, unlicensed spectrum, (licensed) shared spectrum (such as Licensed Shared Access (LSA) in the 2.3-2.4 GHz, 3.4-3.6 GHz, 3.6-3.8 GHz and further frequencies and Spectrum Access System (SAS) in 3.55-3.7 GHz and further frequencies).

[0033] The embodiments described herein can also be applied to different single carriers or OFDM flavors (CP-OFDM, SC-FDMA, SC-OFDM, Filter Bank Based Multi-Carrier (FBMC), OFDMA, etc.) and especially in 3GPP NR (New Radio) by allocating OFDM carrier data bit vectors to corresponding symbol resources.

[0034] In some embodiments, any of the UEs 101 and 102 may include Internet of Things (IoT) UEs or Cellular IoT (CIoT) UEs, which may include a network access layer designed for low-power IoT applications using temporary UE connections. In some embodiments, any of the UEs 101 and 102 may include Narrowband (NB) IoT UEs (e.g., Enhanced NB-IoT (eNB-IoT) UEs and Further Enhanced (FeNB-IoT) UEs, etc.). IoT UEs may utilize technologies such as Public Land Mobile Networks (PLMNs), Proximity Based Services (ProSe) or Device-to-Device (D2D) communications, sensor networks, or Machine-to-Machine (M2M) or Machine-Type Communications (MTC) to exchange data with MTC servers or devices over the IoT network. The M2M or MTC exchange of data may be machine-initiated exchange of data. The IoT network includes interconnecting IoT UEs, which may include uniquely identifiable embedded computing devices (within the Internet infrastructure) with temporary connections. The IoT UE may run background applications (eg, keep-alive messages, status updates, etc.) to facilitate connectivity to the IoT network.

[0035] In some embodiments, either of the UEs 101 and 102 may include enhanced MTC (eMTC) UEs or further enhanced MTC (FeMTC) UEs.

[0036] The UEs 101 and 102 may be configured to connect to, for example, be communicatively coupled to, a Radio Access Network (RAN) 110. The RAN 110 may be, for example, an Evolved Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (E-UTRAN), a NextGen RAN (NG RAN), or some other type of RAN. The UEs 101 and 102 utilize connections 103 and 104, respectively, each of which includes a physical communication interface or layer (discussed in more detail below); in this example, the connections 103 and 104 are illustrated as air interfaces that enable the communicative coupling and may conform to a cellular communication protocol such as a Global System for Mobile Communications (GSM) protocol, a Code Division Multiple Access (CDMA) network protocol, a Push-to-Talk (PTT) protocol, a PTT over Cellular (POC) protocol, a Universal Mobile Telecommunications System (UMTS) protocol, a 3GPP Long Term Evolution (LTE) protocol, a Fifth Generation (5G) protocol, a New Radio (NR) protocol, or the like.

[0037] In one aspect, the UEs 101 and 102 may further exchange communication data directly via the ProSe interface 105. The ProSe interface 105 may alternatively be referred to as a sidelink interface that includes one or more logical channels including, but not limited to, a physical sidelink control channel (PSCCH), a physical sidelink shared channel (PSSCH), a physical sidelink discovery channel (PSDCH), and a physical sidelink broadcast channel (PSBCH).

[0038] The UE 102 is shown as being configured to access an access point (AP) 106 via a connection 107. The connection 107 may include a local wireless connection, such as, for example, any IEEE 802.11 protocol compliant connection according to which the AP 106 may include a Wireless Fidelity (WiFi) router. In this example, the AP 106 is shown as being connected to the Internet without connecting to a core network of a wireless system (described in more detail below).

[0039] The RAN 110 may include one or more access nodes that enable the connections 103 and 104. These access nodes (AN) may be referred to as base stations (BS), NodeBs, evolved NodeBs (eNBs), next generation NodeBs (gNBs), RAN nodes, etc., and may include terrestrial stations (e.g., terrestrial access points) or satellite stations that provide coverage within a geographic area (e.g., a cell). In some embodiments, the communication nodes 111 and 112 may be transmission / reception points (TRPs). In cases where the communication nodes 111 and 112 are NodeBs (e.g., eNBs or gNBs), one or more TRPs may function within the communication cell of the NodeB. The RAN 110 may include one or more RAN nodes providing macro cells, e.g., a macro RAN node 111, and one or more RAN nodes providing femto cells or pico cells (e.g., cells having a smaller coverage area, smaller user capacity, or higher bandwidth compared to a macro cell), e.g., a low power (LP) RAN node 112.

[0040] Any of the RAN nodes 111 and 112 may terminate air interface protocols and may be the first point of contact for the UEs 101 and 102. In some embodiments, any of the RAN nodes 111 and 112 may perform various logical functions for the RAN 110, including, but not limited to, Radio Bearer Management, uplink and downlink dynamic radio resource management and data packet scheduling, and Radio Network Controller (RNC) functions such as mobility management. In one example, any of the nodes 111 and / or 112 may be a new generation NodeB (gNB), an evolved NodeB (eNB), or another type of RAN node.

[0041] The RAN 110 is shown as communicatively coupled to a core network (CN) 120 via an S1 interface 113. In an embodiment, the CN 120 may be an evolved packet core (EPC) network, a nextgen packet core (NPC) network, or some other type of CN (e.g., as shown with reference to Figures 1B-1C). In this aspect, the S1 interface 113 is split into two parts: an S1-U interface 114, which carries traffic data between the RAN nodes 111 and 112 and a serving gateway (S-GW) 122, and an S1 mobility management entity (MME) interface 115, which is a signaling interface between the RAN nodes 111 and 112 and the MME 121.

[0042] In this aspect, the CN 120 includes an MME 121, an S-GW 122, a Packet Data Network (PDN) Gateway (P-GW) 123, and a Home Subscriber Server (HSS) 124. The MME 121 may be functionally similar to the control plane of a legacy Serving General Packet Radio Service (GPRS) Support Node (SGSN). The MME 121 may manage mobility embodiments in access, such as gateway selection and tracking area list management. The HSS 124 may include a database for network users, including subscription-related information to support handling of communication sessions by network entities. The CN 120 may include one or several HSSs 124, depending on the number of mobile subscribers, device capabilities, network organization, etc. For example, the HSS 124 may provide support for routing / roaming, authentication, authorization, name / address resolution, location dependency, etc.

[0043] The S-GW 122 may terminate the S1 interface 113 towards the RAN 110 and route data packets between the RAN 110 and the CN 120. In addition, the S-GW 122 may be a local mobility anchor point for inter-RAN node handovers and may provide an anchor for inter-3GPP mobility. Other roles of the S-GW 122 may include lawful interception, charging, and some policy enforcement.

[0044] The P-GW 123 may terminate the SGi interface towards the PDN. The P-GW 123 may route data packets between the EPC network 120 and external networks, such as a network including an application server 184 (alternatively referred to as an application function (AF)) via an Internet Protocol (IP) interface 125. The P-GW 123 may also communicate data to other external networks 131A, which may include the Internet, an IP Multimedia Subsystem (IPS) network, and other networks. In general, the application server 184 may be an element that provides applications that use IP bearer resources with a core network (e.g., UMTS Packet Service (PS) domain, LTE PS data services, etc.). In this aspect, the P-GW 123 is shown as communicatively coupled to the application server 184 via the IP interface 125. The application server 184 may also be configured to support one or more communication services (e.g., Voice over Internet Protocol (VoIP) sessions, PTT sessions, group communication sessions, social networking services, etc.) for the UEs 101 and 102 via the CN 120.

[0045] The P-GW 123 may further be a node for policy enforcement and charging data collection. The Policy and Charging Rules Function (PCRF) 126 is the policy and charging control element of the CN 120. In a non-roaming scenario, in some embodiments, there may be a single PCRF in a Home Public Land Mobile Network (HPLMN) associated with the UE's Internet Protocol Connectivity Access Network (IP-CAN) session. In a roaming scenario with local breakout of traffic, there may be two PCRFs associated with the UE's IP-CAN session: a Home PCRF (H-PCRF) in the HPLMN and a Visited PCRF (V-PCRF) in a Visited Public Land Mobile Network (VPLMN). The PCRF 126 may be communicatively coupled to the application server 184 via the P-GW 123.

[0046] In some embodiments, the communication network 140A may be an IoT network or a 5G network, including a 5G New Radio network that uses communications in licensed (5G NR) and unlicensed (5G NR-U) spectrum. One of the current enablers of IoT is Narrowband IoT (NB-IoT).

[0047] The NG system architecture may include a RAN 110 and a 5G network core (5GC) 120. The NG-RAN 110 may include multiple nodes, such as gNBs and NG-eNBs. The core network 120 (e.g., 5G core network or 5GC) may include an access and mobility function (AMF) and / or a user plane function (UPF). The AMF and UPF may be communicatively coupled to the gNBs and NG-eNBs via an NG interface. More specifically, in some embodiments, the gNBs and NG-eNBs may be connected to the AMF by an NG-C interface and to the UPF by an NG-U interface. The gNBs and NG-eNBs may be coupled to each other via an Xn interface.

[0048] In some embodiments, the NG system architecture may use reference points between various nodes such as those provided by 3GPP Technical Specification (TS) 23.501 (e.g., V15.4.0, 2018-12). In some embodiments, each of the gNB and NG-eNB may be implemented as a base station, a mobile edge server, a small cell, a home eNB, etc. In some embodiments, in the 5G architecture, the gNB may be a master node (MN) and the NG-eNB may be a secondary node (SN).

[0049] FIG. 1B illustrates a non-roaming 5G system architecture according to some embodiments. Referring to FIG. 1B, a 5G system architecture 140B is illustrated in a reference point representation. More specifically, a UE 102 can communicate with a RAN 110 and one or more other 5G Core (5GC) network entities. The 5G system architecture 140B includes multiple network functions (NFs), such as an Access and Mobility Management Function (AMF) 132, a Session Management Function (SMF) 136, a Policy Control Function (PCF) 148, an Application Function (AF) 150, a User Plane Function (UPF) 134, a Network Slice Selection Function (NSSF) 142, an Authentication Server Function (AUSF) 144, and a Unified Data Management (UDM) / Home Subscriber Server (HSS) 146. The UPF 134 can provide connectivity to a data network (DN) 152, which can include, for example, operator services, internet access, or third-party services. The AMF 132 may be used to manage access control and mobility and may also include a network slice selection function. The SMF 136 may be configured to set up and manage various sessions according to network policies. The UPF 134 may be deployed in one or more configurations according to the desired service type. The PCF 148 may be configured to provide a policy framework using network slicing, mobility management, and roaming (similar to a PCRF in a 4G communication system). The UDM may be configured to store subscriber profiles and data (similar to a HSS in a 4G communication system).

[0050] In some embodiments, the 5G system architecture 140B includes multiple IP multimedia core network subsystem entities, such as an IP multimedia subsystem (IMS) 168B and a call session control function (CSCF). More specifically, the IMS 168B includes a CSCF, which can function as a Proxy CSCF (P-CSCF) 162BE, a Serving CSCF (S-CSCF) 164B, an Emergency CSCF (E-CSCF) (not shown in FIG. 1B), or an Interrogating CSCF (I-CSCF) 166B. The P-CSCF 162B can be configured to be a first point of contact for the UE 102 in the IM subsystem (IMS) 168B. The S-CSCF 164B can be configured to handle session state in the network, and the E-CSCF can be configured to handle a particular embodiment of the emergency session, such as routing the emergency request to the correct emergency center or PSAP. The I-CSCF 166B may be configured to act as a contact point within a network operator's network for all IMS connections destined for its subscribers or roaming subscribers currently located within the network operator's service area. In some embodiments, the I-CSCF 166B may connect to another IP multimedia network 170E, e.g., an IMS operated by a different network operator.

[0051] In some embodiments, the UDM / HSS 146 may be coupled to an application server 160E, which may include a telephony application server (TAS) or another application server (AS). The AS 160B may be coupled to the IMS 168B via the S-CSCF 164B or the I-CSCF 166B.

[0052] The reference point representation indicates that interactions may exist between corresponding NF services. For example, Figure 1B shows the following reference points: N1 (between the UE 102 and the AMF 132), N2 (between the RAN 110 and the AMF 132), N3 (between the RAN 110 and the UPF 134), N4 (between the SMF 136 and the UPF 134), N5 (between the PCF 148 and the AF 150, not shown), N6 (between the UPF 134 and the DN 152), N7 (between the SMF 136 and the PCF 148, not shown), N8 (between the UDM 146 and the AMF 132, not shown), N9 (between the two UPFs 134, not shown), N10 (between the UDM 146 and the SMF 136, not shown), N11 (between the UE 102 and the AMF 132, not shown), N12 (between the UE 102 and the AMF 132, not shown), N13 (between the UE 102 and the AMF 132, not shown), N14 (between the UE 102 and the AMF 132, not shown), N15 (between the UE 102 and the AMF 132, not shown), N16 (between the UE 102 and the AMF 132, not shown), N17 (between the UE 102 and the AMF 132, not shown), N18 (between the UE 102 and the AMF 132, not shown), N19 (between the UE 102 and the AMF 132, not shown), N20 (between the UE 102 and the AMF 1B shows N1 (between AMF 132 and SMF 136, not shown), N12 (between AUSF 144 and AMF 132, not shown), N13 (between AUSF 144 and UDM 146, not shown), N14 (between two AMFs 132, not shown), N15 (between PCF 148 and AMF 132 in case of a non-roaming scenario, or between PCF 148 and visited network and AMF 132 in case of a roaming scenario, not shown), N16 (between two SMFs, not shown), and N22 (between AMF 132 and NSSF 142, not shown). Other reference point representations not shown in FIG. 1B may also be used.

[0053] 1C shows a 5G system architecture 140C and a service-based representation. In addition to the network entities shown in FIG. 1B, the system architecture 140C may also include a network publication function (NEF) 154 and a network repository function (NRF) 156. In some embodiments, the 5G system architecture may be service-based, and the interactions between network functions may be represented by corresponding point-to-point reference points Ni or as service-based interfaces.

[0054] In some embodiments, as shown in Figure 1C, a service-based representation can be used to represent network functions in a control plane that allows other authorized network functions to access those services. In this regard, the 5G system architecture 140C can include the following service-based interfaces: Namf 158H (service-based interface presented by AMF 132), Nsmf 158I (service-based interface presented by SMF 136), Nnef 158B (service-based interface presented by NEF 154), Npcf 158D (service-based interface presented by PCF 148), Nudm 158E (service-based interface presented by UDM 146), Naf 158F (service-based interface presented by AF 150), Nnrf 158C (service-based interface presented by NRF 156), Nnssf 158A (service-based interface presented by NSSF 142), Nausf 158G (service-based interface presented by AUSF 144). Other service-based interfaces not shown in FIG. 1C (eg, Nudr, N5g-eir, and Nudsf) can also be used.

[0055] In some embodiments, any of the UEs or base stations described in connection with FIGS. 1A-1C may be configured to perform the functions described herein.

[0056] Mobile communications have evolved significantly from early voice systems to today's highly sophisticated and integrated communications platforms. The next generation wireless communications system, 5G or New Radio (NR), will provide access to information and sharing of data anywhere, anytime by various users and applications. NR is expected to be an integrated network / system targeted to meet very different and sometimes conflicting performance dimensions and services. Such diverse multi-dimensional requirements are driven by different services and applications. In general, NR will evolve based on 3GPP LTE-Advanced with further potential new radio access technologies (RATs) to enrich people's lives with better, simpler, and seamless wireless connectivity solutions. NR will enable everything to be connected wirelessly and deliver high speed and rich content and services.

[0057] Rel-15 NR systems are designed to operate on licensed spectrum. NR Unlicensed (NR-U), shorthand for NR-based access to unlicensed spectrum, is a technology that enables NR systems to operate on unlicensed spectrum.

[0058] For systems operating at carrier frequencies above 52.6 GHz, the subcarrier spacing is increased and the slot duration is reduced. A DCI may schedule PDSCH transmissions using one or multiple transport blocks (TBs). Figure 1D shows an example of multi-PDSCH scheduling. In the example, four PDSCHs (PDSCH#0-3) using different transport blocks (TBs) are scheduled by a single DCI.

[0059] In NR, out-of-order and scheduled PDSCH / PUSCH during PDCCH are considered to be invalid. For any two HARQ process IDs in a given scheduled cell, if a UE is scheduled to start receiving a first PDSCH starting at symbol j with a PDCCH ending at symbol i, the UE is not expected to be scheduled to receive a PDSCH starting earlier than the end of the first PDSCH with a PDCCH ending later than symbol i. For any two HARQ process IDs in a given scheduled cell, if a UE is scheduled to start a first PUSCH transmission starting at symbol j with a PDCCH ending at symbol i, the UE is not expected to be scheduled to transmit a PUSCH starting earlier than the end of the first PUSCH with a PDCCH ending later than symbol i. Furthermore, it is clarified that for PDSCH / PUSCH with repetition, a UE is not expected to be scheduled to receive more than one unicast PDSCH per slot per serving cell. Similar rules may be applied to multi-PDSCH and / or multi-PUSCH scheduling. Various embodiments herein provide techniques for multi-PDSCH and / or multi-PUSCH scheduling.

[0060] Various embodiments herein provide techniques for scheduling one or more PDSCHs or PUSCHs by DCI for multi-TTI scheduling in systems operating at carrier frequencies above 52.6 GHz. The timing relationship of the PDCCH and the scheduled PDSCHs should meet certain constraints.

[0061] The DCI format may be capable of scheduling one or more PDSCHs or PUSCHs with separate TBs. For example, the number of scheduled PDSCHs or PUSCHs for a row in a time domain resource allocation (TDRA) table is equal to the number of configured SLIVs for that row. For a row in the TDRA table, each SLIV may be configured in a different slot. Alternatively, one or more SLIVs may be configured in the same slot. The DCI format for multi-PUSCH scheduling may dynamically switch between scheduling a single PDSCH or PUSCH and scheduling multiple PDSCHs or PUSCHs.

[0062] In one embodiment, for any two or more HARQ process IDs in a given scheduled cell, if one or more PDSCHs are scheduled by a first PDCCH ending at symbol i, the UE does not expect the first PDSCH scheduled with a second PDCCH ending later than symbol i to start earlier than the end of the last PDSCH scheduled by the first PDCCH. For any two or more HARQ process IDs in a given scheduled cell, if one or more PUSCHs are scheduled by a first PDCCH ending at symbol i, the UE does not expect the first PUSCH scheduled with a second PDCCH ending later than symbol i to start earlier than the end of the last PUSCH scheduled by the first PDCCH.

[0063] Figures 2A-2D show some examples for multi-PDSCH scheduling with two PDCCHs. The two PDCCHs end at the same timing in Figures 2A and 2B. PDCCH2 ends later than PDCCH1 in Figures 2C and 2D. PDCCH2 ends earlier than PDCCH1 in Figure 2E. Based on the principle in this embodiment, Figures 2A, 2B and 2C are valid scheduling. On the other hand, Figures 2D and 2E are invalid scheduling.

[0064] In one embodiment, for any two or more HARQ process IDs in a given scheduled cell, if one or more PDSCHs are scheduled by a first PDCCH ending at symbol i, the UE does not expect the first PDSCH scheduled with a second PDCCH ending after symbol i to start earlier than the end of the last PDSCH scheduled by the first PDCCH. For any two or more HARQ process IDs in a given scheduled cell, if one or more PUSCHs are scheduled by a first PDCCH ending at symbol i, the UE does not expect the first PUSCH scheduled with a second PDCCH ending after symbol i to start earlier than the end of the last PUSCH scheduled by the first PDCCH.

[0065] In this embodiment, the first PDCCH refers to a PDCCH that ends earlier than the other PDCCH. When the two PDCCHs end at the same timing, the first PDCCH refers to a PDCCH that schedules the first PDSCH that starts earlier than the PDSCH scheduled by the other PDCCH.

[0066] For the cases shown in Figures 2A to 2E, based on the principle in this embodiment, Figures 2A and 2C are valid scheduling, while Figures 2B, 2D and 2E are invalid scheduling.

[0067] In one embodiment, for any two or more HARQ process IDs in a given scheduled cell, if one or more PDSCHs are scheduled with a first PDCCH ending at symbol i, the UE does not expect the first PDSCH scheduled with a second PDCCH ending later than symbol i to start earlier than the end of the last PDSCH scheduled by the first PDCCH. Furthermore, if two PDCCHs end at the same symbol, the UE does not expect the first PDSCH scheduled with the second PDCCH to start earlier than the end of the last PDSCH scheduled by the first PDCCH, if the first PDSCH scheduled with the first PDCCH starts earlier than the start of the first PDSCH scheduled by the second PDCCH.

[0068] For any two or more HARQ process IDs in a given scheduled cell, if one or more PUSCHs are scheduled with a first PDCCH ending at symbol i, the UE does not expect the first PUSCH scheduled with a second PDCCH ending later than symbol i to start earlier than the end of the last PUSCH scheduled by the first PDCCH. Furthermore, if two PDCCHs end at the same symbol, the UE does not expect the first PUSCH scheduled with the second PDCCH to start earlier than the end of the last PUSCH scheduled by the first PDCCH if the first PUSCH scheduled with the first PDCCH starts earlier than the start of the first PUSCH scheduled by the second PDCCH.

[0069] In this embodiment, the first PDCCH refers to a PDCCH that ends earlier than the other PDCCH. When two PDCCHs end at the same timing, the first PDCCH refers to a PDCCH that schedules the first PDSCH that starts earlier than the PDSCH scheduled by the other PDCCH. For the examples shown in Figures 2A-2E, based on the principle in this embodiment, Figures 2A and 2C are valid scheduling. On the other hand, Figures 2B, 2D and 2E are invalid scheduling.

[0070] In one embodiment, for any two or more HARQ process IDs in a given scheduled cell, if one or more PDSCHs are scheduled with a first PDCCH ending at symbol i, the UE does not expect the first PDSCH scheduled with a second PDCCH ending later than symbol i to start earlier than the end of the last PDSCH scheduled by the first PDCCH. Furthermore, if two PDCCHs end at the same symbol, the UE does not expect the first PDSCH scheduled with the second PDCCH to start earlier than the end of the last PDSCH scheduled by the first PDCCH if the first PDSCH scheduled with the first PDCCH starts earlier than the end of the last PDSCH scheduled by the second PDCCH.

[0071] For any two or more HARQ process IDs in a given scheduled cell, if one or more PUSCHs are scheduled by a first PDCCH ending at symbol i, the UE does not expect the first PUSCH scheduled with a second PDCCH ending later than symbol i to start earlier than the end of the last PUSCH scheduled by the first PDCCH. Furthermore, if two PDCCHs end at the same symbol, the UE does not expect the first PUSCH scheduled with a second PDCCH to start earlier than the end of the last PUSCH scheduled by the first PDCCH if the first PUSCH scheduled with the first PDCCH starts earlier than the end of the last PUSCH scheduled by the second PDCCH. In this embodiment, the first PDCCH can be any one of the two PDCCHs. In other words, the first PDCCH does not necessarily end earlier than the second PDCCH.

[0072] For the examples shown in Figures 2A to 2E, based on the principle in this embodiment, Figures 2A and 2C are valid scheduling, while Figures 2B, 2D and 2E are invalid scheduling.

[0073] In one embodiment, for any two or more HARQ process IDs in a given scheduled cell, if one or more PDSCHs are scheduled by a first PDCCH ending at symbol i, the UE does not expect the first PDSCH scheduled with a second PDCCH ending later than symbol i to start earlier than the end of the first PDSCH scheduled by the first PDCCH. For any two or more HARQ process IDs in a given scheduled cell, if one or more PUSCHs are scheduled by a first PDCCH ending at symbol i, the UE does not expect the first PUSCH scheduled with a second PDCCH ending later than symbol i to start earlier than the end of the first PUSCH scheduled by the first PDCCH.

[0074] In this embodiment, if the first PDSCH scheduled by the two DCIs respectively does not violate the principle, all PDSCHs scheduled by the two DCIs are deemed valid. If the first PUSCH scheduled by the two DCIs respectively does not violate the principle, all PUSCHs scheduled by the two DCIs are deemed valid. For the examples shown in Figures 2A-2E, 2, based on the principle in this embodiment, Figures 2A, 2B, 2C and 2D are valid scheduling. On the other hand, Figure 2E is invalid scheduling.

[0075] In one embodiment, in a given scheduled cell, a UE is not expected to be scheduled to receive more than one unicast PDSCH in one slot. Furthermore, for any two or more HARQ process IDs in a given scheduled cell, if one or more PDSCHs are scheduled with a first PDCCH ending at symbol i, the UE is not expected to have a first PDSCH scheduled with a second PDCCH ending later than symbol i start earlier than the end of the last PDSCH scheduled by the first PDCCH.

[0076] In a given scheduled cell, a UE is not expected to be scheduled to receive more than one unicast PUSCH in one slot. Furthermore, for any two or more HARQ process IDs in a given scheduled cell, if one or more PUSCHs are scheduled with a first PDCCH ending at symbol i, the UE is not expected to start any earlier than the end of the last PUSCH scheduled by the first PDCCH, where the first PUSCH is scheduled with a second PDCCH ending later than symbol i.

[0077] Figures 3A-3F show an example for multi-PDSCH scheduling by two PDCCHs. The two PDCCHs end at the same timing in Figures 3A, 3B and 3C. PDCCH2 ends later than PDCCH1 in Figures 3D, 3E and 3F. Based on the principle in this embodiment, Figures 3A and 3D are valid scheduling. On the other hand, Figures 3B, 3C, 3E and 3F are invalid scheduling because two PDSCHs are scheduled in the same slot by two PDCCHs.

[0078] In the above described embodiment, the principle for checking the timing relationship of the PDCCH and the scheduled PDSCH is applied only if both of the two DCIs are scheduling multiple PDSCHs. Alternatively, this principle is applied only if at least one of the two DCIs is scheduling multiple PDSCHs if both of the two DCIs use a DCI format for multi-PDSCH scheduling. Alternatively, this principle is applied only if at least one of the two DCIs is scheduling multiple PDSCHs. Alternatively, this principle is applied only if both of the two DCIs use a DCI format for multi-PDSCH scheduling. Alternatively, this principle is applied to any two DCIs for PDSCH scheduling.

[0079] In the above described embodiment, the principle for checking the timing relationship of the PDCCH and the scheduled PUSCH is applied only if both of the two DCIs are scheduling multiple PUSCHs. Alternatively, this principle is applied only if at least one of the two DCIs is scheduling multiple PUSCHs if both of the two DCIs use a DCI format for multi-PUSCH scheduling. Alternatively, this principle is applied only if at least one of the two DCIs is scheduling multiple PUSCHs. Alternatively, this principle is applied only if both of the two DCIs use a DCI format for multi-PUSCH scheduling. Alternatively, this principle is applied to any two DCIs for PUSCH scheduling.

[0080] In one embodiment, for any two HARQ process IDs in a given scheduled cell, if a UE is scheduled to start receiving a first PDSCH starting at symbol j with a PDCCH ending at symbol i, the UE is not expected to be scheduled to receive a PDSCH starting earlier than the end of the first PDSCH with a PDCCH ending later than symbol i. If a UE is scheduled in a given scheduled cell to receive multiple PDSCHs with a first PDCCH ending at symbol i, with the first PDSCH starting at symbol j and the last PDSCH ending at symbol k, the UE is not expected to be scheduled to receive a PDSCH starting after symbol j and before symbol k with a second PDCCH.

[0081] Except when the UE is configured by the higher layer parameter PDCCH-Config containing two different values ​​of coresetPoolIndex in the ControlResourceSet for the active BWP of the serving cell and the PDCCHs scheduling two PUSCHs that do not overlap in the time domain are associated to different ControlResourceSets with different values ​​of coresetPoolIndex. For any two HARQ process IDs in a given scheduled cell, if a UE is scheduled to start a first PUSCH transmission starting at symbol j with a PDCCH ending at symbol i, then the UE is not expected to be scheduled to transmit a PUSCH starting earlier than the end of the first PUSCH with a PDCCH ending later than symbol i; For a given scheduled cell, if a UE is scheduled to transmit multiple PUSCHs with a first PDCCH ending at symbol i, where the first PUSCH starts at symbol j and the last PUSCH ends at symbol k, then the UE is not expected to be scheduled to transmit a PUSCH with a second PDCCH starting after symbol j and before symbol k.

[0082] A UE may support more than one unicast PDSCH or PUSCH to be scheduled in one slot in a given scheduled cell. For the examples shown in Figures 2A-2E, Figures 2A and 2C are valid scheduling, while Figures 2B, 2D, and 2E are invalid scheduling.

[0083] A UE may not be expected to be scheduled to receive more than one unicast PDSCH in one slot in a given scheduled cell. For the examples shown in Figures 3A-3F, Figures 3A and 3D are valid scheduling, while Figures 3B, 3C, 3E, and 3F are invalid scheduling.

[0084] Figures 4A-4D show further examples for the relative timing between two PDCCHs and their scheduled PDSCHs. These examples assume that the PDSCHs scheduled by DCI may not be in consecutive slots. In Figures 4A and 4C, the two PDCCHs end at the same timing. Furthermore, each PDCCH schedules multiple PDSCHs / PUSCHs in Figures 4A and 4C. On the other hand, in Figures 4B and 4D, one PDCCH schedules multiple PDSCHs, while the other PDCCH schedules only a single PDSCH. Figures 4A, 4B, 4C and 4D are invalid scheduling according to this embodiment.

[0085] In one embodiment, for any two HARQ process IDs in a given scheduled cell, if a UE is scheduled to start receiving a first PDSCH starting at symbol j with a PDCCH ending at symbol i, then the UE is not expected to be scheduled to receive a PDSCH starting earlier than the end of the first PDSCH with a PDCCH ending later than symbol i. For any two or more HARQ process IDs in a given scheduled cell, if a UE is scheduled to receive multiple PDSCHs with a PDCCH ending at symbol i, with a first PDSCH starting at symbol j and a last PDSCH ending at symbol k, then the UE is not expected to be scheduled to receive a PDSCH starting after symbol j and before symbol k with another PDCCH ending at symbol i.

[0086] Except when the UE is configured by the higher layer parameter PDCCH-Config containing two different values ​​of coresetPoolIndex in the ControlResourceSet for the active BWP of the serving cell and the PDCCHs scheduling two PUSCHs that do not overlap in the time domain are associated to different ControlResourceSets with different values ​​of coresetPoolIndex. For any two HARQ process IDs in a given scheduled cell, if a UE is scheduled to start a first PUSCH transmission starting at symbol j with a PDCCH ending at symbol i, then the UE is not expected to be scheduled to transmit a PUSCH starting earlier than the end of the first PUSCH with a PDCCH ending later than symbol i; For any two or more HARQ process IDs in a given scheduled cell, if a UE is scheduled to transmit multiple PUSCHs with a PDCCH ending at symbol i, where the first PUSCH starts at symbol j and the last PUSCH ends at symbol k, then the UE is not expected to be scheduled to transmit a PUSCH starting after symbol j and before symbol k with another PDCCH ending at symbol i.

[0087] A UE may support more than one unicast PDSCH or PUSCH to be scheduled in one slot in a given scheduled cell. For the examples shown in Figures 2A-2E, Figures 2A and 2C are valid scheduling, while Figures 2B, 2D, and 2E are invalid scheduling.

[0088] A UE may not be expected to be scheduled to receive more than one unicast PDSCH in one slot in a given scheduled cell. For the example shown in Figures 3A-3F, Figures 3A and 3D are valid scheduling. On the other hand, Figures 3B, 3C, 3E and 3F are invalid scheduling. For the example shown in Figures 4A-4D, Figures 4A, 4B, 4C and 4D are all invalid scheduling according to this embodiment.

[0089] FIG. 5 illustrates a functional block diagram of a wireless communication device, according to some embodiments. The wireless communication device 500 may be suitable for use as a UE or gNB configured for operation in a 5G NR network. The communication device 500 may include communication circuitry 502 and a transceiver 510 that transmits and receives signals to other communication devices using one or more antennas 501. The communication circuitry 502 may include circuitry capable of operating physical layer (PHY) communications and / or medium access control (MAC) communications to control access to a wireless medium, and / or any other communication layer to transmit and receive signals. The communication device 500 may also include processing circuitry 506 and memory 508 configured to perform operations described herein. In some embodiments, the communication circuitry 502 and the processing circuitry 506 may be configured to perform operations detailed in the figures, drawings, and flows above.

[0090] According to some embodiments, the communication circuitry 502 may be configured to contend for the wireless medium and compose frames or packets to communicate over the wireless medium. The communication circuitry 502 may be configured to transmit and receive signals. The communication circuitry 502 may also include circuitry for modulation / demodulation, upconversion / downconversion, filtering, amplification, etc. In some embodiments, the processing circuitry 506 of the communication device 500 may include one or more processors. In other embodiments, two or more antennas 501 may be coupled to the communication circuitry 502 configured to transmit and receive signals. The memory 508 may store information for configuring the processing circuitry 506 to perform operations for composing and transmitting message frames and performing various operations described herein. The memory 508 may include any type of memory, including non-transitory memory, that stores information in a form that is readable by a machine (e.g., a computer). For example, the memory 508 may include computer-readable storage media, read-only memory (ROM), random access memory (RAM), magnetic disk storage media, optical storage media, flash memory devices, and other storage devices and media.

[0091] In some embodiments, communication device 500 may be part of a portable wireless communication device, such as a personal digital assistant (PDA), a laptop or portable computer with wireless communication capabilities, a web tablet, a wireless telephone, a smartphone, a wireless headset, a pager, an instant messaging device, a digital camera, an access point, a television, a medical device (e.g., a heart rate monitor, a blood pressure monitor, etc.), a wearable computing device, or another device that may receive and / or transmit information wirelessly.

[0092] In some embodiments, the communication device 500 may include one or more antennas 501. The antennas 501 may include one or more directional or omnidirectional antennas, including, for example, dipole antennas, monopole antennas, patch antennas, loop antennas, microstrip antennas, or other types of antennas suitable for transmitting RF signals. In some embodiments, a single antenna with multiple apertures may be used instead of two or more antennas. In these embodiments, each aperture may be considered a separate antenna. In some multiple-input multiple-output (MIMO) embodiments, the antennas may be effectively separated due to spatial diversity and different channel characteristics that may result between each of the antennas and the antennas of the transmitting device.

[0093] In some embodiments, the communications device 500 may include one or more of a keyboard, a display, a non-volatile memory port, multiple antennas, a graphics processor, an application processor, a speaker, and other mobile device elements. The display may be an LCD screen, including a touch screen.

[0094] Although communications device 500 is shown as having several separate functional elements, two or more of those functional elements may be combined and implemented by a combination of software configured elements, such as processing elements including digital signal processors (DSPs), and / or other hardware elements. For example, some elements may include one or more microprocessors, DSPs, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), radio frequency integrated circuits (RFICs), and various combinations of hardware and logic circuits that perform at least the functions described herein. In some embodiments, the functional elements of communications device 500 may refer to one or more processes operating on one or more processing elements.

[0095] example

[0096] Example 1 may include a method of wireless communication for scheduling one or more PDSCHs or PUSCHs via a DCI for multi-TTI scheduling.

[0097] Example 2 may include the method of Example 1 or any other example herein, where for any two or more HARQ process IDs in a given scheduled cell, if one or more PDSCHs are scheduled by a first PDCCH that ends at symbol i, then a first PDSCH that the UE schedules using a second PDCCH that ends later than symbol i is not expected to start earlier than the end of the last PDSCH scheduled by the first PDCCH.

[0098] Example 3 may include the method of Example 1 or any other example herein, where for any two or more HARQ process IDs in a given scheduled cell, if one or more PUSCHs are scheduled by a first PDCCH that ends at symbol i, then a first PUSCH scheduled by the UE using a second PDCCH that ends later than symbol i is not expected to start earlier than the end of the last PUSCH scheduled by the first PDCCH.

[0099] Example 4 may include the method of Example 2 or any other example herein, where, if two PDCCHs end at the same symbol, the UE is not expected to expect a first PDSCH scheduled using the second PDCCH to start earlier than the end of the last PDSCH scheduled by the first PDCCH if a first PDSCH scheduled using the first PDCCH starts earlier than the end of the last PDSCH scheduled by the second PDCCH.

[0100] Example 5 may include the method of Example 3 or any other example herein, where, if two PDCCHs end at the same symbol, the UE is not expected to expect a first PUSCH scheduled using the second PDCCH to start earlier than the end of the last PUSCH scheduled by the first PDCCH if a first PUSCH scheduled using the first PDCCH starts earlier than the end of the last PUSCH scheduled by the second PDCCH.

[0101] Example 6 may include the method of Example 2 or any other example herein, where in a given scheduled cell, a UE is not expected to be scheduled to receive more than one unicast PDSCH in a slot.

[0102] Example 7 may include the method of Example 3 or any other example herein, where in a given scheduled cell, a UE is not expected to be scheduled to receive more than one unicast PUSCH in a slot.

[0103] Example 8 may include the method of Example 1 or any other example herein, where for any two or more HARQ process IDs in a given scheduled cell, if one or more PDSCHs are scheduled by a first PDCCH that ends at symbol i, then a first PDSCH scheduled by the UE using a second PDCCH that ends later than symbol i is not expected to start earlier than the end of the first PDSCH scheduled by the first PDCCH.

[0104] Example 9 may include the method of Example 1 or any other example herein, where for any two or more HARQ process IDs in a given scheduled cell, if one or more PUSCHs are scheduled by a first PDCCH that ends at symbol i, then a first PUSCH scheduled by the UE using a second PDCCH that ends later than symbol i is not expected to start earlier than the end of the first PUSCH scheduled by the first PDCCH.

[0105] Example 10 may include a method including determining one or more scheduling constraints for scheduling wireless communications to schedule one or more PDSCHs or PUSCHs by a DCI in a PDCCH for multi-TTI scheduling; and encoding the DCI for transmission to a UE to schedule the one or more PDSCHs or PUSCHs based on the one or more scheduling constraints.

[0106] Example 11 may include the method of Example 10 or any other example herein, wherein the one or more scheduling constraints include, for any two or more HARQ process IDs in a given scheduled cell, if one or more PDSCHs are scheduled by a first PDCCH that ends at symbol i, then a first PDSCH scheduled by the UE using a second PDCCH that ends later than symbol i is not expected to start earlier than an end of the last PDSCH scheduled by the first PDCCH.

[0107] Example 12 may include the method of Examples 10-11 or any other example herein, wherein the one or more scheduling constraints include, for any two or more HARQ process IDs in a given scheduled cell, if one or more PUSCHs are scheduled by a first PDCCH that ends at symbol i, then a first PUSCH scheduled by the UE using a second PDCCH that ends later than symbol i is not expected to start earlier than an end of the last PUSCH scheduled by the first PDCCH.

[0108] Example 13 may include the method of Examples 10-12 or any other example herein, wherein the one or more scheduling constraints include: if the two PDCCHs end at the same symbol, the UE is not expected to expect a first PDSCH scheduled using the second PDCCH to start earlier than the end of the last PDSCH scheduled by the first PDCCH if a first PDSCH scheduled using the first PDCCH starts earlier than the end of the last PDSCH scheduled by the second PDCCH.

[0109] Example 14 may include the method of Examples 10-13 or any other example herein, wherein the one or more scheduling constraints include: if the two PDCCHs end at the same symbol, the UE is not expected to expect a first PUSCH scheduled using the second PDCCH to start earlier than the end of the last PUSCH scheduled by the first PDCCH if a first PUSCH scheduled using the first PDCCH starts earlier than the end of the last PUSCH scheduled by the second PDCCH.

[0110] Example 15 may include the method of Examples 10-14 or any other example herein, where the one or more scheduling constraints include that, in a given scheduled cell, a UE is not expected to be scheduled to receive more than one unicast PDSCH in a slot.

[0111] An Abstract is provided in accordance with Title 37 of the Code of Federal Regulations. Section 1.72(b) requires an abstract that will allow the reader to ascertain the nature and gist of the technical disclosure. The Abstract is submitted with the understanding that it will not be used to limit or interpret the scope or meaning of the sections. The following claims are therefore hereby incorporated into the Detailed Description, with each section standing on its own as a separate embodiment. [Item 1] 1. A user equipment (UE) apparatus configured for operation in a fifth generation new radio (5G NR) system, the apparatus comprising: a processing circuit; and a memory; Wherein, if the UE is configured for multi-physical downlink shared channel (PDSCH) scheduling, the processing circuitry: Decoding a first downlink control information (DCI) and a second DCI received from a gNodeB (gNB), where the first DCI schedules a plurality of PDSCHs and the second DCI schedules one or more PDSCHs; checking a timing relationship of the scheduled PDSCH for validity when the first DCI and the second DCI end in the same symbol. The device is configured to: wherein the memory is configured to store the first and second DCI. [Item 2] 2. The apparatus of claim 1, wherein if the first DCI and the second DCI end in the same symbol, the processing circuitry is configured to check a timing relationship of the scheduled PDSCHs for validity by determining whether the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have an overlapping time span. [Item 3] If the first DCI and the second DCI end in the same symbol, and if it is determined that the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have non-overlapping time spans, the processing circuitry: identifying the PDSCH scheduled by the first DCI or the second DCI as valid; and decoding the scheduled PDSCH; 3. The apparatus according to item 2, configured to perform the steps of: [Item 4] If the first DCI and the second DCI end in the same symbol, and if it is determined that the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have an overlapping time span, the processing circuitry: identifying the PDSCH scheduled by the first DCI or the second DCI as invalid; and refraining from decoding the scheduled PDSCH. 4. The apparatus according to item 3, configured to perform the steps of: [Item 5] The apparatus according to any one of items 1 to 4, wherein, if the first DCI and the second DCI do not end in the same symbol, the multiple PDSCHs scheduled by the first DCI are scheduled to have a time span that does not overlap with the one or more PDSCHs scheduled by the second DCI. [Item 6] 6. The apparatus of claim 5, wherein the processing circuitry is configured to refrain from checking the timing relationship of the scheduled PDSCH for validity if the first DCI and the second DCI do not end in the same symbol. [Item 7] a first time span associated with the first DCI starts at a first symbol of a first PDSCH scheduled by the first DCI and extends to a last symbol of a last PDSCH scheduled by the first DCI; a second time span associated with the second DCI starting at a first symbol of a first PDSCH scheduled by the second DCI and extending to a last symbol of a last PDSCH scheduled by the second DCI; 5. The apparatus of claim 4, wherein the processing circuitry is configured to use a configured time domain resource allocation (TDRA) table to determine a location of the scheduled PDSCH. [Item 8] Regarding the multi-PDSCH scheduling: When each of the plurality of PDSCHs scheduled by the first DCI includes a different transport block (TB), each scheduled PDSCH is associated with a different hybrid automatic repeat request (HARQ) process identifier (ID) for a serving cell; If each of the one or more PDSCHs scheduled by the second DCI includes a different TB, each scheduled PDSCH is associated with a different HARQ process ID for the serving cell; 5. The apparatus of claim 4, wherein the processing circuitry is configured to encode HARQ feedback for transmission to the gNB for each of the different HARQ process IDs. [Item 9] When each of the plurality of PDSCHs scheduled by the first DCI includes a different transport block (TB), each scheduled PDSCH is associated with a different HARQ process ID for a serving cell; If each of the one or more PDSCHs scheduled by the second DCI includes a repetition of the same TB, the one or more PDSCHs scheduled by the second DCI are associated with a second single HARQ process ID for the serving cell; 5. The apparatus of claim 4, wherein the processing circuitry is configured to encode HARQ feedback for transmission to the gNB for each of the different HARQ process IDs. [Item 10] Regarding the multi-PDSCH scheduling: When each of the plurality of PDSCHs scheduled by the first DCI includes a different transport block (TB), each scheduled PDSCH is associated with a different HARQ process ID for a serving cell; If the second DCI schedules a single PDSCH including a single TB, the single PDSCH is associated with a second single HARQ process ID for the serving cell; 5. The apparatus of claim 4, wherein the processing circuitry is configured to encode HARQ feedback for transmission to the gNB for each of the different HARQ process IDs. [Item 11] 1. A non-transitory computer-readable storage medium storing instructions for execution by a processing circuit of a user equipment (UE) configured for operation in a fifth generation new radio (5G NR) system, when the UE is configured for multi-physical downlink shared channel (PDSCH) scheduling, the processing circuitry: Decoding a first downlink control information (DCI) and a second DCI received from a gNodeB (gNB), where the first DCI schedules a plurality of PDSCHs and the second DCI schedules one or more PDSCHs; and checking a timing relationship of the scheduled PDSCH for validity when the first DCI and the second DCI end in the same symbol. A non-transitory computer-readable storage medium configured to: [Item 12] Item 12. The non-transitory computer-readable storage medium of item 11, wherein if the first DCI and the second DCI end in the same symbol, the processing circuitry is configured to check a timing relationship of the scheduled PDSCHs for validity by determining whether the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have an overlapping time span. [Item 13] If the first DCI and the second DCI end in the same symbol, and if it is determined that the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have non-overlapping time spans, the processing circuitry: identifying the PDSCH scheduled by the first DCI or the second DCI as valid; and decoding the scheduled PDSCH; Item 13. The non-transitory computer-readable storage medium of item 12, configured to perform the following: [Item 14] If the first DCI and the second DCI end in the same symbol, and if it is determined that the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have an overlapping time span, the processing circuitry: identifying the PDSCH scheduled by the first DCI or the second DCI as invalid; and refraining from decoding the scheduled PDSCH. Item 14. The non-transitory computer-readable storage medium of item 13, configured to perform the following: [Item 15] 15. The non-transitory computer-readable storage medium of any one of claims 11 to 14, wherein if the first DCI and the second DCI do not end in the same symbol, the multiple PDSCHs scheduled by the first DCI are scheduled to have a time span that does not overlap with the one or more PDSCHs scheduled by the second DCI. [Item 16] Item 16. The non-transitory computer-readable storage medium of item 15, wherein the processing circuitry is configured to refrain from checking the timing relationship of the scheduled PDSCH for validity if the first DCI and the second DCI do not end in the same symbol. [Item 17] a first time span associated with the first DCI starts at a first symbol of a first PDSCH scheduled by the first DCI and extends to a last symbol of a last PDSCH scheduled by the first DCI; a second time span associated with the second DCI starting at a first symbol of a first PDSCH scheduled by the second DCI and extending to a last symbol of a last PDSCH scheduled by the second DCI; Item 15. The non-transitory computer-readable storage medium of item 14, wherein the processing circuitry is configured to use a configured time domain resource allocation (TDRA) table to determine a location of the scheduled PDSCH. [Item 18] Regarding the multi-PDSCH scheduling: When each of the plurality of PDSCHs scheduled by the first DCI includes a different transport block (TB), each scheduled PDSCH is associated with a different hybrid automatic repeat request (HARQ) process identifier (ID) for a serving cell; When each of the one or more PDSCHs scheduled by the second DCI includes a different TB, each scheduled PDSCH is associated with a different HARQ process ID for the serving cell; Item 15. The non-transitory computer-readable storage medium of item 14, wherein the processing circuitry is configured to encode HARQ feedback for transmission to the gNB for each of the different HARQ process IDs. [Item 19] 1. A gNodeB (gNB) apparatus configured for operation in a fifth generation new radio (5G NR) system, the apparatus comprising: a processing circuit; and a memory; wherein, for a user equipment (UE) configured for multi-physical downlink shared channel (PDSCH) scheduling, the processing circuitry: configured to encode a first downlink control information (DCI) and a second DCI for transmission to the UE, where the first DCI schedules a plurality of PDSCHs and the second DCI schedules one or more PDSCHs; wherein, when the first DCI and the second DCI end in the same symbol, and when the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have overlapping time spans, the processing circuit is not expected to receive a hybrid automatic repeat request acknowledgement (HARQ-ACK) feedback from the UE for the scheduled PDSCH; wherein the memory is configured to store the first and second DCI. [Item 20] If the first DCI and the second DCI end in the same symbol, and if the multiple PDSCHs scheduled by the first DCI and the one or more PDSCHs scheduled by the second DCI have non-overlapping time spans, the processing circuitry: decoding a HARQ-ACK feedback from the UE for the scheduled PDSCH decoded by the UE; 20. The apparatus of item 19, configured to:

Claims

1. 1. A user equipment (UE) apparatus configured for operation in a fifth generation new radio (5G NR) system, the apparatus comprising: a processing circuit; and a memory; The processing circuitry: Decoding radio resource configuration (RRC) signaling and configuring the UE with a time domain resource allocation table for scheduling multiple physical downlink shared channels (PDSCHs) (MultiPDSCHs) according to a first downlink control information (DCI); decoding RRC signaling to configure the UE with a time domain resource allocation for a PDSCH scheduled by a second DCI; decoding the first DCI and the second DCI, where the first DCI schedules the multiple PDSCHs in a serving cell according to the time domain resource allocation table for MultiPDSCH, and the second DCI schedules the PDSCHs in the serving cell according to the time domain resource allocation; The device is configured to: Each of the multiple PDSCHs scheduled by the first DCI is signaled by a separate Start and Length Indicator Value (SLIV) in one or more rows of the time domain resource allocation table; When the first DCI and the second DCI end in the same symbol and one or more rows of the time domain resource allocation table include multiple SLIVs, the multiple PDSCHs scheduled by the first DCI and the PDSCHs scheduled by the second DCI are predicted to be in non-overlapping spans, and the processing circuitry: and decoding the plurality of PDSCHs scheduled by the first DCI and the PDSCHs scheduled by the second DCI in the non-overlapping span; The apparatus, wherein the memory is configured to store the first DCI and the second DCI.

2. The processing circuitry further comprises: generating a Hybrid Automatic Repeat Request (HARQ) acknowledgement ACK (HARQ-ACK) feedback for each of the plurality of PDSCHs scheduled by the first DCI and for the PDSCHs scheduled by the second DCI; The apparatus of claim 1 configured to:

3. If the first DCI and the second DCI do not end in the same symbol, and if the multiple PDSCHs scheduled by the first DCI and the PDSCHs scheduled by the second DCI are scheduled in non-overlapping time spans, the processing circuitry: decoding each of the plurality of PDSCHs scheduled by the first DCI and the PDSCH scheduled by the second DCI; generating HARQ-ACK feedback for the plurality of PDSCHs scheduled by the first DCI and HARQ-ACK feedback for the PDSCHs scheduled by the second DCI; The apparatus of claim 1 configured to:

4. The apparatus of claim 1 , wherein each of the plurality of PDSCHs is associated with a different HARQ process identifier (ID) for the serving cell.

5. 4. The apparatus of claim 1, wherein the processing circuitry is configured to determine locations of the plurality of PDSCHs scheduled by the first DCI using the time domain resource allocation table.

6. 6. The apparatus of claim 5, wherein if the first DCI and the second DCI end on the same symbol, the processing circuitry is configured to: check a timing relationship of the scheduled PDSCHs for validity by determining whether the multiple PDSCHs scheduled by the first DCI and the PDSCH scheduled by the second DCI have an overlapping time span.

7. 7. The apparatus of claim 6, wherein the processing circuitry is configured to refrain from checking the timing relationship of the scheduled PDSCH for validity if the first DCI and the second DCI do not end in the same symbol.

8. 8. The apparatus of claim 7, wherein if it is determined that the plurality of PDSCHs scheduled by the first DCI and the PDSCHs scheduled by the second DCI have an overlapping time span, the processing circuitry is configured to identify the plurality of PDSCHs scheduled by the first DCI and the PDSCHs scheduled by the second DCI as invalid and refrain from decoding the plurality of PDSCHs scheduled by the first DCI and the PDSCHs scheduled by the second DCI.

9. 1. A computer program product for execution by a processing circuit of a user equipment (UE) configured for operation in a fifth generation new radio (5G NR) system, the computer program product comprising: decoding radio resource configuration (RRC) signaling and configuring the UE with a time domain resource allocation table for scheduling multiple physical downlink shared channels (PDSCHs) (MultiPDSCHs) according to a first downlink control information (DCI); decoding RRC signaling and configuring the UE with a time domain resource allocation for a PDSCH scheduled by a second DCI; decoding the first DCI and the second DCI, where the first DCI schedules the multiple PDSCHs in a serving cell according to the time domain resource allocation table for MultiPDSCH, and the second DCI schedules the PDSCHs in the serving cell according to the time domain resource allocation; Run the command, Each of the multiple PDSCHs scheduled by the first DCI is signaled by a separate Start and Length Indicator Value (SLIV) in one or more rows of the time domain resource allocation table; When the first DCI and the second DCI end in the same symbol and one or more rows of the time domain resource allocation table include multiple SLIVs, the multiple PDSCHs scheduled by the first DCI and the PDSCH scheduled by the second DCI are predicted to be in non-overlapping spans, and the computer program causes the processing circuit to: A computer program product comprising: a computer program product configured to execute a procedure of decoding the plurality of PDSCHs scheduled by the first DCI and the PDSCH scheduled by the second DCI in the non-overlapping span.

10. The processing circuit further comprises: generating Hybrid Automatic Repeat Request (HARQ) Acknowledgement ACK (HARQ-ACK) feedback for each of the plurality of PDSCHs scheduled by the first DCI and for the PDSCHs scheduled by the second DCI; 10. The computer program product of claim 9,

11. If the first DCI and the second DCI do not end in the same symbol, and if the PDSCHs scheduled by the first DCI and the PDSCHs scheduled by the second DCI are scheduled in non-overlapping spans, the processing circuitry: decoding each of the plurality of PDSCHs scheduled by the first DCI and the PDSCH scheduled by the second DCI; generating HARQ-ACK feedback for the plurality of PDSCHs scheduled by the first DCI and generating HARQ-ACK feedback for the PDSCHs scheduled by the second DCI; 10. The computer program product of claim 9,

12. 12. The computer program product of claim 9, wherein each of the plurality of PDSCHs is associated with a different HARQ process identifier (ID) for the serving cell.

13. 12. The computer program product of claim 9, further comprising: causing the processing circuit to perform a procedure of determining locations of the plurality of PDSCHs scheduled by the first DCI using the time domain resource allocation table.

14. 14. The computer program product of claim 13, further comprising: causing the processing circuit to perform a procedure of: if the first DCI and the second DCI end on the same symbol, checking a timing relationship of the scheduled PDSCHs for validity by determining whether the multiple PDSCHs scheduled by the first DCI and the PDSCH scheduled by the second DCI have an overlapping time span.

15. A computer readable storage medium storing a computer program according to any one of claims 9 to 11.

16. 1. A gNodeB (gNB) apparatus configured for operation in a fifth generation new radio (5G NR) system, the apparatus comprising: a processing circuit; and a memory; For a user equipment (UE) configured for multi-physical downlink shared channel (PDSCH) scheduling, the processing circuitry: encoding radio resource configuration (RRC) signaling for transmission to configure the UE with a time domain resource allocation table for scheduling multiple physical downlink shared channels (PDSCHs) (MultiPDSCHs) according to a first downlink control information (DCI); encoding RRC signaling for transmission to configure the UE with a time domain resource allocation for a PDSCH scheduled by a second DCI; encoding the first DCI and the second DCI for transmission to the UE, the first DCI scheduling the multiple PDSCHs in a serving cell according to the time domain resource allocation table for MultiPDSCH and the second DCI scheduling the PDSCHs in the serving cell according to the time domain resource allocation; The device is configured to: Each of the multiple PDSCHs scheduled by the first DCI is signaled by a separate Start and Length Indicator Value (SLIV) in one or more rows of the time domain resource allocation table; When the first DCI and the second DCI end in the same symbol and one or more rows of the time domain resource allocation table include multiple SLIVs, the multiple PDSCHs scheduled by the first DCI and the PDSCHs scheduled by the second DCI are predicted to be in non-overlapping spans, and the processing circuitry: and encoding the plurality of PDSCHs scheduled by the first DCI and the PDSCHs scheduled by the second DCI in the non-overlapping span for transmission to the UE; The apparatus, wherein the memory is configured to store the first DCI and the second DCI.

Images