WO2020069359A1

WO2020069359A1 - Physical uplink shared channel (pusch) repetition termination for new radio (nr)

Info

Publication number: WO2020069359A1
Application number: PCT/US2019/053519
Authority: WO
Inventors: Debdeep CHATTERJEE; Sergey PANTELEEV
Original assignee: Intel Corporation
Priority date: 2018-09-28
Filing date: 2019-09-27
Publication date: 2020-04-02
Also published as: EP3857804A1; EP3857804A4; CN112400291A

Abstract

An apparatus comprises a memory to store downlink control information (DCI) that is to schedule a second physical uplink shared channel (PUSCH) transmission overlapped with one or more repetitions of a first PUSCH transmission for a given hybrid automatic repeat request (HARQ) process for a user equipment (UE), and a processing circuitry, coupled with the memory, to: retrieve the DCI from the memory; generate a message that includes the DCI; and encode the message for transmission to the UE.

Description

PHYSICAL UPLINK SHARED CHANNEL (PUSCH) REPETITION TERMINATION

FOR NEW RADIO (NR)

RELATED APPLICATIONS

This application claims priority to U.S. Provisional Patent Application No. 62/739,042 filed September 28, 2018 and entitled“SYSTEM AND METHODS ON PUSCH REPETITION TERMINATION IN NR,” and to U.S. Provisional Patent Application No. 62/808,728 filed February 21, 2019 and entitled “SYSTEM AND METHODS ON PUSCH REPETITION TERMINATION IN NR,” the entire disclosures of which are incorporated by reference in their entirety.

BACKGROUND

Among other things, embodiments described herein are directed to the termination of physical uplink shared channel (PUSCH) transmission repetitions. Embodiments of the present disclosure may be used in conjunction with transmissions for new radio (NR).

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments will be readily understood by the following detailed description in conjunction with the accompanying drawings. To facilitate this description, like reference numerals designate like structural elements. Embodiments are illustrated by way of example and not by way of limitation in the figures of the accompanying drawings.

Figures 1 and 2, and 3 illustrate examples of operation flow/algorithmic structures in accordance with some embodiments.

Figure 4 depicts an architecture of a system of a network in accordance with some embodiments.

Figure 5 depicts an example of components of a device in accordance with some embodiments.

Figure 6 depicts an example of interfaces of baseband circuitry in accordance with some embodiments.

Figure 7 depicts a block diagram illustrating components, according to some embodiments, able to read instructions from a machine-readable or computer-readable medium (e.g., a non-transitory machine-readable storage medium) and perform any one or more of the methodologies discussed herein.

DETAILED DESCRIPTION

Embodiments discussed herein may relate to the termination of physical uplink shared channel (PUSCH) transmission repetitions for new radio (NR). Other embodiments may be described and/or claimed. The following detailed description refers to the accompanying drawings. The same reference numbers may be used in different drawings to identify the same or similar elements. In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular structures, architectures, interfaces, techniques, etc., in order to provide a thorough understanding of the various aspects of the claimed invention. However, it will be apparent to those skilled in the art having the benefit of the present disclosure that the various aspects of the invention claimed may be practiced in other examples that depart from these specific details. In certain instances, descriptions of well-known devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.

Various aspects of the illustrative embodiments will be described using terms commonly employed by those skilled in the art to convey the substance of their work to others skilled in the art. However, it will be apparent to those skilled in the art that alternate embodiments may be practiced with only some of the described aspects. For purposes of explanation, specific numbers, materials, and configurations are set forth in order to provide a thorough understanding of the illustrative embodiments. However, it will be apparent to one skilled in the art that alternate embodiments may be practiced without the specific details. In other instances, well-known features are omitted or simplified in order not to obscure the illustrative embodiments.

Further, various operations will be described as multiple discrete operations, in turn, in a manner that is most helpful in understanding the illustrative embodiments; however, the order of description should not be construed as to imply that these operations are necessarily order dependent. In particular, these operations need not be performed in the order of presentation.

The phrase“in various embodiments,”“in some embodiments,” and the like may refer to the same, or different, embodiments. The terms“comprising,”“having,” and“including” are synonymous, unless the context dictates otherwise. The phrase“A and/or B” means (A), (B), or (A and B). The phrases“A/B” and“A or B” mean (A), (B), or (A and B), similar to the phrase“A and/or B.” For the purposes of the present disclosure, the phrase“at least one of A and B” means (A), (B), or (A and B). The description may use the phrases “in an embodiment,”“in embodiments,”“in some embodiments,” and/or“in various embodiments,” which may each refer to one or more of the same or different embodiments. Furthermore, the terms“comprising,” “including,”“having,” and the like, as used with respect to embodiments of the present disclosure, are synonymous.

Examples of embodiments may be described as a process depicted as a flowchart, a flow diagram, a data flow diagram, a structure diagram, or a block diagram. Although a flowchart may describe the operations as a sequential process, many of the operations may be performed in parallel, concurrently, or simultaneously. In addition, the order of the operations may be re- arranged. A process may be terminated when its operations are completed, but may also have additional steps not included in the figure(s). A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, and the like. When a process corresponds to a function, its termination may correspond to a return of the function to the calling function and/or the main function.

Examples of embodiments may be described in the general context of computer- executable instructions, such as program code, software modules, and/or functional processes, being executed by one or more of the aforementioned circuitry. The program code, software modules, and/or functional processes may include routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular data types. The program code, software modules, and/or functional processes discussed herein may be implemented using existing hardware in existing communication networks. For example, program code, software modules, and/or functional processes discussed herein may be implemented using existing hardware at existing network elements or control nodes.

Mobile communication has evolved significantly from early voice systems to today’s highly sophisticated integrated communication platform. The next generation wireless communication 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 a unified network/system that target to meet vastly different and sometime 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 additional potential new Radio Access Technologies (RATs) to enrich people lives with better, simple and seamless wireless connectivity solutions. NR will enable everything connected by wireless and deliver fast, rich contents and services.

Repetitions scheduled by dynamic grant or configured grant may be terminated by a dynamic grant for the same transport block (TB):

Some agreements to consider include:

• For UE configured with K repetitions for a TB transmission with/without grant, the UE can continue repetitions (FFS can be different RV versions, FFS different MCS) for the TB until one of the following conditions is met

• If an UL grant is successfully received for a slot/mini-slot for the same TB

• The number of repetitions for that TB reaches K

Among other things, embodiments of the present disclosure are directed to introducing processing time for cancellation of ongoing repetitions (e.g., as per the cited agreement above). Additionally, the cancellation rules for the case of transmission direction conflicts with dynamic slot format indication (SFI) are considered in application to physical uplink shared channel (PUSCH) carrying medium access control (MAC) control element (CE) configured grant confirmation.

In addition, for the case of repetition termination by a dynamic grant with different HARQ process IDs, currently such behavior is undefined in Ll when both configured grant and dynamic grant PESCH are generated by the MAC layer. Embodiments of the present disclosure may also address this issue by applying PUSCH termination. Furthermore, in case of different HARQ processes for the ongoing CG PUSCH and scheduled overlapping dynamic PUSCH, similar repetition termination behavior may be applied.

Application time for termination of repetitions

As noted above, repetitions scheduled by dynamic grant or configured grant may be terminated by a dynamic grant for the same TB. However, any assumption on the incurred processing time is still missing. The processing time needs to be assumed when expecting from a UE to terminate already planned/prepared PUSCH transmissions.

In one embodiment, a UE is not expected to continue repetitions of dynamically triggered or configured PUSCH transmission after‘m’ symbols counted from the symbol after the last symbol of a CORESET where DCI format 0 0 or 0 1 scheduling PUSCH transmission overlapping with ongoing/planned repetitions and where the DCI is addressed to the same HARQ process ID as the ongoing/planned repetitions. The value‘m’ is N2 symbols, where N2 is the minimum UE processing time for PUSCH preparation corresponding to a given processing capability, and is further defined based on one or more of: subcarrier spacing (SCS) of the scheduling PDCCH, and the SCS of the scheduled or planned PUSCH. Moreover, a UE is not expected to continue the repetitions starting from the earliest repetition after‘m’ symbols, i.e. the UE does not terminate partial PUSCH.

Alternatively, there may be no explicit application time introduced. Instead, given that PUSCH scheduling is already subject to N2 processing time, where slot offset K2 and the starting symbol for the PUSCH in the scheduling grant is always such that a minimum PUSCH preparation time (N2 symbols for a given numerology - e.g., subcarrier spacing (SCS)) is guaranteed between the end of the PDCCH carrying the UL grant and the start of the CP of the earliest UL symbol for the PUSCH transmission, the termination may be done in MAC layer. The MAC layer currently models repetitions as separate MAC grants. Therefore, in this case, if there is a dynamic grant passed to MAC layer addressing for the same HARQ process overlaps with the bundle excluding the first transmission in the bundle, then the remaining bundle is dropped. In other words, a UE shall skip repetitions corresponding to a HARQ process starting from the repetition that corresponds to the time domain resources indicated for PUSCH transmission via another valid UL grant for the same HARQ process. Here, the concept of“valid UL grant” implies that the UL grant indicates a slot offset (from scheduling PDCCH) and starting symbol for the PUSCH transmission such that the minimum UE processing time for the PUSCH preparation is guaranteed.

Note that while in the above embodiments and examples the time gaps are described in units of symbols and related to N2 symbols as the PUSCH preparation time for simplicity, in detail this implies that the time gap from the end of the last symbol of the PDCCH carrying the DCI scheduling the PUSCH and the start of the CP of the earliest UL symbol from which point the PUSCH repetitions may be canceled is at least T_pr0c,2 (milliseconds) - where T_proc,2 is as defined in Section 6.4 of the 3GPP Technical Specification (TS) 38.214, v 15.2.0, 2018-06-29.

Further, in an embodiment, in the case of dynamically scheduled (“grant-based”) PUSCH with multi-slot transmissions, the UE may be expected to terminate the remaining repetitions upon reception of another UL grant for the same HARQ process only if the NDI bit-field is toggled.

Further, in an embodiment, the UE indicates as part of capability reporting framework, whether or not the UE supports the feature of canceling one or more repetitions of PUSCH with configured with slot aggregation for dynamically scheduled PUSCH or with repK > 1 for CG PUSCH based on a subsequent UL grant as described above. In another example, the capability may be indicated separately for dynamically scheduled (grant-based) PUSCH and Types 1 and 2 CG PUSCH. The capability may be further reported either on a per-UE basis or a per-band per band combination basis.

Cancellation of configured grant PUSCH due to dynamic SFI

Another aspect of embodiments of the present disclosure is the UE behavior in handling collided transmission directions due to dynamic SFI reception. According to current agreements, any dynamically scheduled PUSCH transmissions are not subject to cancellation due to reception of SFI indicating conflicting transmission directions. The dynamically scheduled PUSCH includes both scheduling by DCI format 0 0 and 0 1 of dynamic PUSCH or dynamic retransmission to configured grant, or the first configured grant resource after the activation by DCI format 0 0 and 0_l addressed to CS-RNTI.

However, PUSCH after de-activation DCI may also be considered as dynamic PUSCH (e.g., not subject to cancellation by SFI) since according to MAC procedures it should carry the MAC CE with configured grant confirmation.

In one embodiment, a PUSCH resource (including any repetitions when configured with slot aggregation) in a BWP after the DCI deactivation of configured grant Type 2 is considered as dynamically scheduled PUSCH and therefore is not subject to cancellation due to transmission direction conflict with SFI. Here,“direction conflict with SFI” includes the cases wherein a dynamic SFI, carried by DCI format 2 0, may indicate at least one of the symbols overlapping with the time-domain resources to carry the PUSCH with the Configured Grant Confirmation MAC CE as either DL or flexible symbol. Alternatively, the PUSCH carrying configured grant confirmation MAC CE triggered by deactivation DCI is treated as dynamically scheduled PUSCH and therefore is not subject to cancellation due to transmission direction conflict with SFI.

In one embodiment, a UE is not expected to send MAC CE configured grant confirmation in the configured PUSCH resource before the minimum PUSCH preparation procedure time from the last symbol of a CORESET where DCI format 0 0 validated as configured grant Type 2 de activation. In other words, upon reception of a valid DCI format 0 0 carrying the Type 2 CG PUSCH de-activation command the UE may be expected to transmit the PUSCH carrying the Configured Grant Confirmation MAC CE using the earliest transmission opportunity according to the Type 2 configured grant configuration such that the start of the CP for the first UL symbol for the transmission opportunity occurs at least T_proc,2 (milliseconds) after the end of the last symbol of the PDCCH carrying the DCI format 0 0 carrying the Type 2 CG PUSCH de-activation command.

In another embodiment, upon reception of a valid DCI format 0 0 carrying the Type 2 CG PUSCH de-activation command the UE may be expected to transmit the PUSCH carrying the Configured Grant Confirmation MAC CE using the same frequency domain resources as indicated in the activation grant for the corresponding Type 2 CG PUSCH configuration and time domain resources as indicated by the time-domain assignment bit-field in the DCI format 0 0 carrying the de-activation command.

Termination of CG PUSCH repetitions when overridden by dynamic PUSCH with different HARO process ID

In one embodiment, in case of different HARQ process IDs, if initial transmission of configured grant overlaps with dynamic PUSCH at physical layer (here overlapping at physical layer may only happen when CG repetition starts before T_proc,2 for dynamic PUSCH), then the whole repetitions sequence for CG is terminated. In particular, for any RV sequence, the repetitions shall be terminated at the symbol from which another PUSCH with the same HARQ process is scheduled by DCI format 0 0 or 0 1, or at the symbol of initial repetition from which another PUSCH with different HARQ process is scheduled by DCI format 0 0 or 0 1, whichever is reached first.

In another embodiment, in case of different HARQ process IDs, if a transmission of configured grant overlaps with dynamic PUSCH at physical layer, then repetitions falling fully or partially within an interval of ‘X’ symbols from the starting symbol of the dynamic PUSCH, are dropped and remaining repetitions are transmitted. Here‘X’ may be at least of T_pr0c,2 symbols or a function of it, like X = a*T_proc,2, where‘a’ is a scaling factor, which may be equal to 1 or larger than 1. Alternatively, X^— a + Tproc,2. In another variant of the embodiment, the above interval of length‘X’ symbols may be defined to start from the last symbol of the dynamic PUSCH. In these embodiments, the CG PUSCH transmission may be either only initial transmission or both initial transmission and any repetition in a sequence.

FIG. 4 illustrates an architecture of a system 400 of a network in accordance with some embodiments. The system 400 is shown to include a user equipment (UE) 401 and a UE 402. The UEs 401 and 402 are illustrated as smartphones (e.g., handheld touchscreen mobile computing devices connectable to one or more cellular networks), but may also comprise any mobile or non- mobile computing device, such as Personal Data Assistants (PDAs), pagers, laptop computers, desktop computers, wireless handsets, or any computing device including a wireless communications interface.

In some embodiments, any of the UEs 401 and 402 can comprise an Internet of Things (IoT) UE, which can comprise a network access layer designed for low-power IoT applications utilizing short-lived UE connections. An IoT UE can utilize technologies such as machine-to- machine (M2M) or machine-type communications (MTC) for exchanging data with an MTC server or device via a public land mobile network (PLMN), Proximity-Based Service (ProSe) or device-to-device (D2D) communication, sensor networks, or IoT networks. The M2M or MTC exchange of data may be a machine-initiated exchange of data. An IoT network describes interconnecting IoT UEs, which may include uniquely identifiable embedded computing devices (within the Internet infrastructure), with short-lived connections. The IoT UEs may execute background applications (e.g., keep-alive messages, status updates, etc.) to facilitate the connections of the IoT network.

The UEs 401 and 402 may be configured to connect, e.g., communicatively couple, with a radio access network (RAN) 410— the RAN 410 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 401 and 402 utilize connections 403 and 404, respectively, each of which comprises a physical communications interface or layer (discussed in further detail below); in this example, the connections 403 and 404 are illustrated as an air interface to enable communicative coupling, and can be consistent with cellular communications protocols, 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, aNew Radio (NR) protocol, and the like. In this embodiment, the UEs 401 and 402 may further directly exchange communication data via a ProSe interface 405. The ProSe interface 405 may alternatively be referred to as a sidelink interface comprising 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).

The UE 402 is shown to be configured to access an access point (AP) 406 via connection 407. The connection 407 can comprise a local wireless connection, such as a connection consistent with any IEEE 802.11 protocol, wherein the AP 406 would comprise a wireless fidelity (WiFi®) router. In this example, the AP 406 is shown to be connected to the Internet without connecting to the core network of the wireless system (described in further detail below).

The RAN 410 can include one or more access nodes that enable the connections 403 and 404. These access nodes (ANs) can be referred to as base stations (BSs), NodeBs, evolved NodeBs (eNBs), next Generation NodeBs (gNB), RAN nodes, and so forth, and can comprise ground stations (e.g., terrestrial access points) or satellite stations providing coverage within a geographic area (e.g., a cell). The RAN 410 may include one or more RAN nodes for providing macrocells, e.g., macro RAN node 411, and one or more RAN nodes for providing femtocells or picocells (e.g., cells having smaller coverage areas, smaller user capacity, or higher bandwidth compared to macrocells), e.g., low power (LP) RAN node 412.

Any of the RAN nodes 411 and 412 can terminate the air interface protocol and can be the first point of contact for the UEs 401 and 402. In some embodiments, any of the RAN nodes 411 and 412 can fulfill various logical functions for the RAN 410 including, but not limited to, radio network controller (RNC) functions such as radio bearer management, uplink and downlink dynamic radio resource management and data packet scheduling, and mobility management.

In accordance with some embodiments, the UEs 401 and 402 can be configured to communicate using Orthogonal Frequency-Division Multiplexing (OFDM) communication signals with each other or with any of the RAN nodes 411 and 412 over a multicarrier communication channel in accordance various communication techniques, such as, but not limited to, an Orthogonal Frequency-Division Multiple Access (OFDMA) communication technique (e.g., for downlink communications) or a Single Carrier Frequency Division Multiple Access (SC- FDMA) communication technique (e.g., for uplink and ProSe or sidelink communications), although the scope of the embodiments is not limited in this respect. The OFDM signals can comprise a plurality of orthogonal subcarriers.

In some embodiments, a downlink resource grid can be used for downlink transmissions from any of the RAN nodes 411 and 412 to the UEs 401 and 402, while uplink transmissions can utilize similar techniques. The grid can be a time-frequency grid, called a resource grid or time- frequency resource grid, which is the physical resource in the downlink in each slot. Such a time- frequency plane representation is a common practice for OFDM systems, which makes it intuitive for radio resource allocation. Each column and each row of the resource grid corresponds to one OFDM symbol and one OFDM subcarrier, respectively. The duration of the resource grid in the time domain corresponds to one slot in a radio frame. The smallest time-frequency unit in a resource grid is denoted as a resource element. Each resource grid comprises a number of resource blocks, which describe the mapping of certain physical channels to resource elements. Each resource block comprises a collection of resource elements; in the frequency domain, this may represent the smallest quantity of resources that currently can be allocated. There are several different physical downlink channels that are conveyed using such resource blocks.

The physical downlink shared channel (PDSCH) may carry user data and higher-layer signaling to the UEs 401 and 402. The physical downlink control channel (PDCCH) may carry information about the transport format and resource allocations related to the PDSCH channel, among other things. It may also inform the UEs 401 and 402 about the transport format, resource allocation, and H-ARQ (Hybrid Automatic Repeat Request) information related to the uplink shared channel. Typically, downlink scheduling (assigning control and shared channel resource blocks to the UE 402 within a cell) may be performed at any of the RAN nodes 411 and 412 based on channel quality information fed back from any of the UEs 401 and 402. The downlink resource assignment information may be sent on the PDCCH used for (e.g., assigned to) each of the UEs 401 and 402.

The PDCCH may use control channel elements (CCEs) to convey the control information. Before being mapped to resource elements, the PDCCH complex-valued symbols may first be organized into quadruplets, which may then be permuted using a sub-block interleaver for rate matching. Each PDCCH may be transmitted using one or more of these CCEs, where each CCE may correspond to nine sets of four physical resource elements known as resource element groups (REGs). Four Quadrature Phase Shift Keying (QPSK) symbols may be mapped to each REG. The PDCCH can be transmitted using one or more CCEs, depending on the size of the downlink control information (DCI) and the channel condition. There can be four or more different PDCCH formats defined in LTE with different numbers of CCEs (e.g., aggregation level, L=l, 2, 4, or 8).

Some embodiments may use concepts for resource allocation for control channel information that are an extension of the above-described concepts. For example, some embodiments may utilize an enhanced physical downlink control channel (EPDCCH) that uses PDSCH resources for control information transmission. The EPDCCH may be transmitted using one or more enhanced control channel elements (ECCEs). Similar to above, each ECCE may correspond to nine sets of four physical resource elements known as enhanced resource element groups (EREGs). An ECCE may have other numbers of EREGs in some situations.

The RAN 410 is shown to be communicatively coupled to a core network (CN) 420— via an Sl interface 413. In embodiments, the CN 420 may be an evolved packet core (EPC) network, a NextGen Packet Core (NPC) network, or some other type of CN. In this embodiment, the Sl interface 413 is split into two parts: the Sl-U interface 414, which carries traffic data between the RAN nodes 411 and 412 and the serving gateway (S-GW) 422, and the Sl-mobility management entity (MME) interface 415, which is a signaling interface between the RAN nodes 411 and 412 and MMEs 421.

In this embodiment, the CN 420 comprises the MMEs 421, the S-GW 422, the Packet Data Network (PDN) Gateway (P-GW) 423, and a home subscriber server (HSS) 424. The MMEs 421 may be similar in function to the control plane of legacy Serving General Packet Radio Service (GPRS) Support Nodes (SGSN). The MMEs 421 may manage mobility aspects in access such as gateway selection and tracking area list management. The HSS 424 may comprise a database for network users, including subscription-related information to support the network entities’ handling of communication sessions. The CN 420 may comprise one or several HSSs 424, depending on the number of mobile subscribers, on the capacity of the equipment, on the organization of the network, etc. For example, the HSS 424 can provide support for routing/roaming, authentication, authorization, naming/addressing resolution, location dependencies, etc.

The S-GW 422 may terminate the Sl interface 413 towards the RAN 410, and routes data packets between the RAN 410 and the CN 420. In addition, the S-GW 422 may be a local mobility anchor point for inter-RAN node handovers and also may provide an anchor for inter-3 GPP mobility. Other responsibilities may include lawful intercept, charging, and some policy enforcement.

The P-GW 423 may terminate an SGi interface toward a PDN. The P-GW 423 may route data packets between the EPC network and external networks such as a network including the application server 430 (alternatively referred to as application function (AF)) via an Internet Protocol (IP) interface 425. Generally, the application server 430 may be an element offering applications that use IP bearer resources with the core network (e.g., UMTS Packet Services (PS) domain, LTE PS data services, etc.). In this embodiment, the P-GW 423 is shown to be communicatively coupled to an application server 430 via an IP communications interface 425. The application server 430 can also be configured to support one or more communication services (e.g., Voice-over-Intemet Protocol (VoIP) sessions, PTT sessions, group communication sessions, social networking services, etc.) for the UEs 401 and 402 via the CN 420.

The P-GW 423 may further be anode for policy enforcement and charging data collection. Policy and Charging Enforcement Function (PCRF) 426 is the policy and charging control element of the CN 420. In a non-roaming scenario, there may be a single PCRF in the Home Public Land Mobile Network (HPLMN) associated with a 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 a UE’s IP-CAN session: a Home PCRF (H-PCRF) within a HPLMN and a Visited PCRF (V-PCRF) within a Visited Public Land Mobile Network (VPLMN). The PCRF 426 may be communicatively coupled to the application server 430 via the P-GW 423. The application server 430 may signal the PCRF 426 to indicate a new service flow and select the appropriate Quality of Service (QoS) and charging parameters. The PCRF 426 may provision this rule into a Policy and Charging Enforcement Function (PCEF) (not shown) with the appropriate traffic flow template (TFT) and QoS class of identifier (QCI), which commences the QoS and charging as specified by the application server 430.

FIG. 5 illustrates example components of a device 500 in accordance with some embodiments. In some embodiments, the device 500 may include application circuitry 502, baseband circuitry 504, Radio Frequency (RF) circuitry 506, front-end module (FEM) circuitry 508, one or more antennas 510, and power management circuitry (PMC) 512 coupled together at least as shown. The components of the illustrated device 500 may be included in a UE or a RAN node. In some embodiments, the device 500 may include fewer elements (e.g., a RAN node may not utilize application circuitry 502, and instead include a processor/controller to process IP data received from an EPC). In some embodiments, the device 500 may include additional elements such as, for example, memory /storage, display, camera, sensor, or input/output (I/O) interface. In other embodiments, the components described below may be included in more than one device (e.g., said circuitries may be separately included in more than one device for Cloud-RAN (C- RAN) implementations).

The application circuitry 502 may include one or more application processors. For example, the application circuitry 502 may include circuitry such as, but not limited to, one or more single-core or multi-core processors. The processor(s) may include any combination of general-purpose processors and dedicated processors (e.g., graphics processors, application processors, etc.). The processors may be coupled with or may include memory /storage and may be configured to execute instructions stored in the memory /storage to enable various applications or operating systems to run on the device 500. In some embodiments, processors of application circuitry 502 may process IP data packets received from an EPC.

The baseband circuitry 504 may include circuitry such as, but not limited to, one or more single-core or multi-core processors. The baseband circuitry 504 may include one or more baseband processors or control logic to process baseband signals received from a receive signal path of the RF circuitry 506 and to generate baseband signals for a transmit signal path of the RF circuitry 506. Baseband processing circuitry 504 may interface with the application circuitry 502 for generation and processing of the baseband signals and for controlling operations of the RF circuitry 506. For example, in some embodiments, the baseband circuitry 504 may include a third generation (3G) baseband processor 504A, a fourth generation (4G) baseband processor 504B, a fifth generation (5G) baseband processor 504C, or other baseband processor(s) 504D for other existing generations, generations in development or to be developed in the future (e.g., second generation (2G), sixth generation (6G), etc.). The baseband circuitry 504 (e.g., one or more of baseband processors 504A-D) may handle various radio control functions that enable communication with one or more radio networks via the RF circuitry 506. In other embodiments, some or all of the functionality of baseband processors 504A-D may be included in modules stored in the memory 504G and executed via a Central Processing Unit (CPU) 504E. The radio control functions may include, but are not limited to, signal modulation/demodulation, encoding/decoding, radio frequency shifting, etc. In some embodiments, modulation/demodulation circuitry of the baseband circuitry 504 may include Fast-Fourier Transform (FFT), precoding, or constellation mapping/demapping functionality. In some embodiments, encoding/decoding circuitry of the baseband circuitry 504 may include convolution, tail-biting convolution, turbo, Viterbi, or Low Density Parity Check (LDPC) encoder/decoder functionality. Embodiments of modulation/demodulation and encoder/decoder functionality are not limited to these examples and may include other suitable functionality in other embodiments.

In some embodiments, the baseband circuitry 504 may include one or more audio digital signal processor(s) (DSP) 504F. The audio DSP(s) 504F may be include elements for compression/decompression and echo cancellation and may include other suitable processing elements in other embodiments. Components of the baseband circuitry may be suitably combined in a single chip, a single chipset, or disposed on a same circuit board in some embodiments. In some embodiments, some or all of the constituent components of the baseband circuitry 504 and the application circuitry 502 may be implemented together such as, for example, on a system on a chip (SOC).

In some embodiments, the baseband circuitry 504 may provide for communication compatible with one or more radio technologies. For example, in some embodiments, the baseband circuitry 504 may support communication with an evolved universal terrestrial radio access network (EUTRAN) or other wireless metropolitan area networks (WMAN), a wireless local area network (WLAN), a wireless personal area network (WPAN). Embodiments in which the baseband circuitry 504 is configured to support radio communications of more than one wireless protocol may be referred to as multi-mode baseband circuitry.

RF circuitry 506 may enable communication with wireless networks using modulated electromagnetic radiation through a non-solid medium. In various embodiments, the RF circuitry 506 may include switches, filters, amplifiers, etc. to facilitate the communication with the wireless network. RF circuitry 506 may include a receive signal path which may include circuitry to down- convert RF signals received from the FEM circuitry 508 and provide baseband signals to the baseband circuitry 504. RF circuitry 506 may also include a transmit signal path which may include circuitry to up-convert baseband signals provided by the baseband circuitry 504 and provide RF output signals to the FEM circuitry 508 for transmission.

In some embodiments, the receive signal path of the RF circuitry 506 may include mixer circuitry 506a, amplifier circuitry 506b and filter circuitry 506c. In some embodiments, the transmit signal path of the RF circuitry 506 may include filter circuitry 506c and mixer circuitry 506a. RF circuitry 506 may also include synthesizer circuitry 506d for synthesizing a frequency for use by the mixer circuitry 506a of the receive signal path and the transmit signal path. In some embodiments, the mixer circuitry 506a of the receive signal path may be configured to down- convert RF signals received from the FEM circuitry 508 based on the synthesized frequency provided by synthesizer circuitry 506d. The amplifier circuitry 506b may be configured to amplify the down-converted signals and the filter circuitry 506c may be a low-pass filter (LPF) or band pass filter (BPF) configured to remove unwanted signals from the down-converted signals to generate output baseband signals. Output baseband signals may be provided to the baseband circuitry 504 for further processing. In some embodiments, the output baseband signals may be zero-frequency baseband signals, although this is not a requirement. In some embodiments, mixer circuitry 506a of the receive signal path may comprise passive mixers, although the scope of the embodiments is not limited in this respect.

In some embodiments, the mixer circuitry 506a of the transmit signal path may be configured to up-convert input baseband signals based on the synthesized frequency provided by the synthesizer circuitry 506d to generate RF output signals for the FEM circuitry 508. The baseband signals may be provided by the baseband circuitry 504 and may be filtered by filter circuitry 506c.

In some embodiments, the mixer circuitry 506a of the receive signal path and the mixer circuitry 506a of the transmit signal path may include two or more mixers and may be arranged for quadrature downconversion and upconversion, respectively. In some embodiments, the mixer circuitry 506a of the receive signal path and the mixer circuitry 506a of the transmit signal path may include two or more mixers and may be arranged for image rejection (e.g., Hartley image rejection). In some embodiments, the mixer circuitry 506a of the receive signal path and the mixer circuitry 506a of the transmit signal path may be arranged for direct downconversion and direct upconversion, respectively. In some embodiments, the mixer circuitry 506a of the receive signal path and the mixer circuitry 506a of the transmit signal path may be configured for super heterodyne operation.

In some embodiments, the output baseband signals and the input baseband signals may be analog baseband signals, although the scope of the embodiments is not limited in this respect. In some alternate embodiments, the output baseband signals and the input baseband signals may be digital baseband signals. In these alternate embodiments, the RF circuitry 506 may include analog-to-digital converter (ADC) and digital-to-analog converter (DAC) circuitry and the baseband circuitry 504 may include a digital baseband interface to communicate with the RF circuitry 506.

In some dual-mode embodiments, a separate radio IC circuitry may be provided for processing signals for each spectrum, although the scope of the embodiments is not limited in this respect.

In some embodiments, the synthesizer circuitry 506d may be a fractional-N synthesizer or a fractional N/N+l synthesizer, although the scope of the embodiments is not limited in this respect as other types of frequency synthesizers may be suitable. For example, synthesizer circuitry 506d may be a delta-sigma synthesizer, a frequency multiplier, or a synthesizer comprising a phase-locked loop with a frequency divider.

The synthesizer circuitry 506d may be configured to synthesize an output frequency for use by the mixer circuitry 506a of the RF circuitry 506 based on a frequency input and a divider control input. In some embodiments, the synthesizer circuitry 506d may be a fractional N/N+l synthesizer.

In some embodiments, frequency input may be provided by a voltage controlled oscillator (VCO), although that is not a requirement. Divider control input may be provided by either the baseband circuitry 504 or the applications processor 502 depending on the desired output frequency. In some embodiments, a divider control input (e.g., N) may be determined from a look-up table based on a channel indicated by the applications processor 502.

Synthesizer circuitry 506d of the RF circuitry 506 may include a divider, a delay-locked loop (DLL), a multiplexer and a phase accumulator. In some embodiments, the divider may be a dual modulus divider (DMD) and the phase accumulator may be a digital phase accumulator (DP A). In some embodiments, the DMD may be configured to divide the input signal by either N or N+l (e.g., based on a carry out) to provide a fractional division ratio. In some example embodiments, the DLL may include a set of cascaded, tunable, delay elements, a phase detector, a charge pump and a D-type flip-flop. In these embodiments, the delay elements may be configured to break a VCO period up into Nd equal packets of phase, where Nd is the number of delay elements in the delay line. In this way, the DLL provides negative feedback to help ensure that the total delay through the delay line is one VCO cycle.

In some embodiments, synthesizer circuitry 506d may be configured to generate a carrier frequency as the output frequency, while in other embodiments, the output frequency may be a multiple of the carrier frequency (e.g., twice the carrier frequency, four times the carrier frequency) and used in conjunction with quadrature generator and divider circuitry to generate multiple signals at the carrier frequency with multiple different phases with respect to each other. In some embodiments, the output frequency may be aLO frequency (fLO). In some embodiments, the RF circuitry 506 may include an IQ/polar converter.

FEM circuitry 508 may include a receive signal path, which may include circuitry configured to operate on RF signals received from one or more antennas 510, amplify the received signals and provide the amplified versions of the received signals to the RF circuitry 506 for further processing. FEM circuitry 508 may also include a transmit signal path, which may include circuitry configured to amplify signals for transmission provided by the RF circuitry 506 for transmission by one or more of the one or more antennas 510. In various embodiments, the amplification through the transmit or receive signal paths may be done solely in the RF circuitry 506, solely in the FEM 508, or in both the RF circuitry 506 and the FEM 508.

In some embodiments, the FEM circuitry 508 may include a TX/RX switch to switch between transmit mode and receive mode operation. The FEM circuitry 508 may include a receive signal path and a transmit signal path. The receive signal path of the FEM circuitry 508 may include a low noise amplifier (LNA) to amplify received RF signals and provide the amplified received RF signals as an output (e.g., to the RF circuitry 506). The transmit signal path of the FEM circuitry 508 may include a power amplifier (PA) to amplify input RF signals (e.g., provided by RF circuitry 506), and one or more filters to generate RF signals for subsequent transmission (e.g., by one or more of the one or more antennas 510).

In some embodiments, the PMC 512 may manage power provided to the baseband circuitry 504. In particular, the PMC 512 may control power-source selection, voltage scaling, battery charging, or DC-to-DC conversion. The PMC 512 may often be included when the device 500 is capable of being powered by a battery, for example, when the device is included in a UE. The PMC 512 may increase the power conversion efficiency while providing desirable implementation size and heat dissipation characteristics.

FIG. 5 shows the PMC 512 coupled only with the baseband circuitry 504. However, in other embodiments, the PMC 512 may be additionally or alternatively coupled with, and perform similar power management operations for, other components such as, but not limited to, application circuitry 502, RF circuitry 506, or FEM 508.

In some embodiments, the PMC 512 may control, or otherwise be part of, various power saving mechanisms of the device 500. For example, if the device 500 is in an RRC_Connected state, where it is still connected to the RAN node as it expects to receive traffic shortly, then it may enter a state known as Discontinuous Reception Mode (DRX) after a period of inactivity. During this state, the device 500 may power down for brief intervals of time and thus save power.

If there is no data traffic activity for an extended period of time, then the device 500 may transition off to an RRC Idle state, where it disconnects from the network and does not perform operations such as channel quality feedback, handover, etc. The device 500 goes into a very low power state and it performs paging where again it periodically wakes up to listen to the network and then powers down again. The device 500 may not receive data in this state, in order to receive data, it must transition back to RRC Connected state.

An additional power saving mode may allow a device to be unavailable to the network for periods longer than a paging interval (ranging from seconds to a few hours). During this time, the device is totally unreachable to the network and may power down completely. Any data sent during this time incurs a large delay and it is assumed the delay is acceptable.

Processors of the application circuitry 502 and processors of the baseband circuitry 504 may be used to execute elements of one or more instances of a protocol stack. For example, processors of the baseband circuitry 504, alone or in combination, may be used to execute Layer 3, Layer 2, or Layer 1 functionality, while processors of the application circuitry 502 may utilize data (e.g., packet data) received from these layers and further execute Layer 4 functionality (e.g., transmission communication protocol (TCP) and user datagram protocol (UDP) layers). As referred to herein, Layer 3 may comprise a radio resource control (RRC) layer, described in further detail below. As referred to herein, Layer 2 may comprise a medium access control (MAC) layer, a radio link control (RLC) layer, and a packet data convergence protocol (PDCP) layer, described in further detail below. As referred to herein, Layer 1 may comprise a physical (PHY) layer of a UE/RAN node, described in further detail below.

FIG. 6 illustrates example interfaces of baseband circuitry in accordance with some embodiments. As discussed above, the baseband circuitry 504 of FIG. 5 may comprise processors 504A-504E and a memory 504G utilized by said processors. Each of the processors 504A-504E may include a memory interface, 604A-604E, respectively, to send/receive data to/from the memory 504G.

The baseband circuitry 504 may further include one or more interfaces to communicatively couple to other circuitries/devices, such as a memory interface 612 (e.g., an interface to send/receive data to/from memory external to the baseband circuitry 504), an application circuitry interface 614 (e.g., an interface to send/receive data to/from the application circuitry 502 of FIG. 5), an RF circuitry interface 616 (e.g., an interface to send/receive data to/from RF circuitry 506 of FIG. 5), a wireless hardware connectivity interface 618 (e.g., an interface to send/receive data to/from Near Field Communication (NFC) components, Bluetooth® components (e.g., Bluetooth® Low Energy), Wi-Fi® components, and other communication components), and a power management interface 620 (e.g., an interface to send/receive power or control signals to/from the PMC 512.

FIG. 7 is a block diagram illustrating components, according to some example embodiments, able to read instructions from a machine-readable or computer-readable medium (e.g., a non-transitory machine-readable storage medium) and perform any one or more of the methodologies discussed herein. Specifically, FIG. 7 shows a diagrammatic representation of hardware resources 700 including one or more processors (or processor cores) 710, one or more memory /storage devices 720, and one or more communication resources 730, each of which may be communicatively coupled via a bus 740. For embodiments where node virtualization (e.g., NFV) is utilized, a hypervisor 702 may be executed to provide an execution environment for one or more network slices/sub-slices to utilize the hardware resources 700.

The processors 710 (e.g., a central processing unit (CPU), a reduced instruction set computing (RISC) processor, a complex instruction set computing (CISC) processor, a graphics processing unit (GPU), a digital signal processor (DSP) such as a baseband processor, an application specific integrated circuit (ASIC), a radio-frequency integrated circuit (RFIC), another processor, or any suitable combination thereof) may include, for example, a processor 712 and a processor 714.

The memory /storage devices 720 may include main memory, disk storage, or any suitable combination thereof. The memory /storage devices 720 may include, but are not limited to, any type of volatile or non-volatile memory such as dynamic random access memory (DRAM), static random-access memory (SRAM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), Flash memory, solid-state storage, etc.

The communication resources 730 may include interconnection or network interface components or other suitable devices to communicate with one or more peripheral devices 704 or one or more databases 706 via a network 708. For example, the communication resources 730 may include wired communication components (e.g., for coupling via a Universal Serial Bus (USB)), cellular communication components, NFC components, Bluetooth® components (e.g., Bluetooth® Low Energy), Wi-Fi® components, and other communication components. Instructions 750 may comprise software, a program, an application, an applet, an app, or other executable code for causing at least any of the processors 710 to perform any one or more of the methodologies discussed herein. The instructions 750 may reside, completely or partially, within at least one of the processors 710 (e.g., within the processor’s cache memory), the memory /storage devices 720, or any suitable combination thereof. Furthermore, any portion of the instructions 750 may be transferred to the hardware resources 700 from any combination of the peripheral devices 704 or the databases 706. Accordingly, the memory of processors 710, the memory /storage devices 720, the peripheral devices 704, and the databases 706 are examples of computer-readable and machine-readable media.

In various embodiments, the devices/components of Figures 4-7, and particularly the baseband circuitry of Figure 6, may be used to practice, in whole or in part, any of the operation flow/algorithmic structures depicted in Figures 1-3.

One example of an operation flow/algorithmic structure is depicted in FIG. 1, which may be performed by a next-generation NodeB (gNB) in accordance with some embodiments. In this example, operation flow/algorithmic structure 100 may include, at 105, retrieving, from memory, downlink control information (DCI) that is to schedule a physical uplink shared channel (PUSCH) transmission overlapped with repetitions of a hybrid automatic repeat request (HARQ) process for a user equipment (UE). Operation flow/algorithmic structure 100 may further include, at 110, generating a message that includes the DCI. Operation flow/algorithmic structure 100 may further include, at 115, encoding the message for transmission to the UE.

Another example of an operation flow/algorithmic structure is depicted in FIG. 2, which may be performed by a UE in accordance with some embodiments. In this example, operation flow/algorithmic structure 200 may include, at 205, detecting a message that includes downlink control information (DCI) that the UE is to use to schedule a physical uplink shared channel (PUSCH) transmission overlapped with repetitions of a hybrid automatic repeat request (HARQ) process for the UE. Operation flow/algorithmic structure 200 may further include, at 210, ceasing PUSCH repetitions based on detection of the DCI. Operation flow/algorithmic structure 200 may further include, at 215, encoding a PUSCH message that includes a medium access control (MAC) control element (CE) configured grant confirmation for transmission.

Another example of an operation flow/algorithmic structure is depicted in FIG. 3, which may be performed by gNB in accordance with some embodiments. In this example, operation flow/algorithmic structure 300 may include, at 305, generating a message that includes downlink control information (DCI) that is to schedule a physical uplink shared channel (PUSCH) transmission overlapped with repetitions of a hybrid automatic repeat request (HARQ) for a user equipment (UE) . Operation flow/algorithmic structure 300 may further include, at 310, encoding the configuration message for transmission to the UE.

Examples

Some non-limiting examples are provided below.

Example 1 includes an apparatus comprising: memory to store downlink control information (DCI) that is to schedule a second physical uplink shared channel (PUSCH) transmission overlapped with one or more repetitions of a first PUSCH transmission for a given hybrid automatic repeat request (HARQ) process for a user equipment (UE); and processing circuitry, coupled with the memory, to: retrieve the DCI from the memory; generate a message that includes the DCI; and encode the message for transmission to the UE.

Example 2 includes the apparatus of example 1 or some other example herein, wherein the DCI is format 0_0 or 0_l .

Example 3 includes the apparatus of example 1 or some other example herein, wherein the DCI scheduling the second PUSCH is addressed to a HARQ process identifier having a common identifier with the ongoing or granted first PUSCH.

Example 4 includes the apparatus of example 1 or some other example herein, wherein the DCI includes an indication of the time-domain resource assignment (TDRA) for the second PUSCH.

Example 5 includes the apparatus of example 4 or some other example herein, wherein the second PUSCH does not overlap with a repetition of the first PUSCH if the repetition of the first PUSCH starts before a number of symbols (“m”) after the last symbol of the PDCCH carrying the DCI scheduling the second PUSCH.

Example 6 includes the apparatus of example 5 or some other example herein, wherein a value of m is N2 symbols, wherein N2 is a minimum UE processing time for PUSCH preparation corresponding to a given processing capability.

Example 7 includes the apparatus of example 6 or some other example herein, wherein N2 is based on one or more of: a subcarrier spacing of a scheduling PDCCH, and a subcarrier spacing of the first or second PUSCH.

Example 8 includes one or more computer-readable media storing instructions that, when executed by one or more processors, cause a user equipment (UE) to: detect a message that includes downlink control information (DCI) that the UE is to use to schedule a second physical uplink shared channel (PUSCH) transmission overlapped with one or more repetitions of first PUSCH transmission for a given hybrid automatic repeat request (HARQ) process for the UE; ceasing PUSCH repetitions based on detection of the DCI; and encoding the second PUSCH message for transmission on the time-domain resources as indicated in the DCI scheduling the second PUSCH. Example 9 includes the one or more computer-readable media of example 8 or some other example herein, wherein the DCI scheduling the second PUSCH is addressed to a HARQ process identifier having a common identifier with the ongoing or granted first PUSCH.

Example 10 includes the one or more computer-readable media of example 8 or some other example herein, wherein the UE ceases repetitions of the first PUSCH starting from a repetition that corresponds to time domain resources overlapping with the time-domain resource assignment indicated for the second PUCSH transmission.

Example 11 includes the one or more computer-readable media of example 8 or some other example herein, wherein the DCI is format 0 0 or 0 1.

Example 12 includes the one or more computer-readable media of example 8 or some other example herein, wherein the DCI includes an indication of the time-domain resource assignment (TDRA) for the second PUSCH.

Example 13 includes the one or more computer-readable media of example 12 or some other example herein, wherein the second PUSCH does not overlap with a repetition of the first PUSCH if the repetition of the first PUSCH starts before a number of symbols (“m”) after the last symbol of the PDCCH carrying the DCI scheduling the second PUSCH.

Example 14 includes the one or more computer-readable media of example 13 or some other example herein, wherein a value of m is N2 symbols, wherein N2 is a minimum UE processing time for PUSCH preparation corresponding to a given processing capability.

Example 15 includes the one or more computer-readable media of example 14 or some other example herein, wherein N2 is based on one or more of: a subcarrier spacing of a scheduling PDCCH, and a subcarrier spacing of the first or second PUSCH.

Example 16 includes one or more computer-readable media storing instructions that, when executed by one or more processors, cause a next-generation NodeB (gNB) to: generate a message that includes downlink control information (DCI) that is to schedule a second physical uplink shared channel (PUSCH) transmission overlapped with one or more repetitions of a first PUSCH transmission for a given hybrid automatic repeat request (HARQ) for a user equipment (UE); and encode the message for transmission to the UE.

Example 17 includes the one or more computer-readable medium of example 16 or some other example herein, wherein the DCI is format 0 0 or 0 1.

Example 18 includes the one or more computer-readable media of example 16 or some other example herein, wherein the DCI scheduling the second PUSCH is addressed to a HARQ process identifier having a common identifier with the ongoing or granted first PUSCH. Example 19 includes the one or more computer-readable media of example 16 or some other example herein, wherein the DCI includes an indication of the time-domain resource assignment (TDRA) for the second PUSCH such that the second PUSCH does not overlap with a repetition of the first PUSCH if the repetition of the first PUSCH starts before a number of symbols (“m”) after the last symbol of the PDCCH carrying the DCI scheduling the second PUSCH.

Example 20 includes the one or more computer-readable media of example 18 or some other example herein, wherein a value of m is N2 symbols, wherein N2 is a minimum UE processing time for PUSCH preparation time corresponding to a given processing capability that is defined based on one or more of: a subcarrier spacing of a scheduling PDCCH, and a subcarrier spacing of the first or second PUSCH.

Example 21 may include an apparatus comprising means to perform one or more elements of a method described in or related to any of examples 1-20, or any other method or process described herein.

Example 22 may include one or more non-transitory computer-readable media comprising instructions to cause an electronic device, upon execution of the instructions by one or more processors of the electronic device, to perform one or more elements of a method described in or related to any of examples 1-20, or any other method or process described herein.

Example 23 may include an apparatus comprising logic, modules, and/or circuitry to perform one or more elements of a method described in or related to any of examples 1-20, or any other method or process described herein.

Example 24 may include a method, technique, or process as described in or related to any of examples 1-20, or portions or parts thereof.

Example 25 may include an apparatus comprising: one or more processors and one or more computer-readable media comprising instructions that, when executed by the one or more processors, cause the one or more processors to perform the method, techniques, or process as described in or related to any of examples 1-20, or portions thereof.

Example 26 may include a method of communicating in a wireless network as shown and described herein.

Example 27 may include a system for providing wireless communication as shown and described herein.

Example 28 may include a device for providing wireless communication as shown and described herein.

The description herein of illustrated implementations, including what is described in the Abstract, is not intended to be exhaustive or to limit the present disclosure to the precise forms disclosed. While specific implementations and examples are described herein for illustrative purposes, a variety of alternate or equivalent embodiments or implementations calculated to achieve the same purposes may be made in light of the above detailed description, without departing from the scope of the present disclosure.

Claims

CLAIMS What is claimed is:

1. An apparatus comprising:

memory to store downlink control information (DCI) that is to schedule a second physical uplink shared channel (PUSCH) transmission overlapped with one or more repetitions of a first PUSCH transmission for a given hybrid automatic repeat request (HARQ) process for a user equipment (UE); and

processing circuitry, coupled with the memory, to:

retrieve the DCI from the memory;

generate a message that includes the DCI; and

encode the message for transmission to the UE.

2. The apparatus of claim 1, wherein the DCI is format 0 0 or 0 1.

3. The apparatus of claim 1, wherein the DCI scheduling the second PUSCH is addressed to a HARQ process identifier having a common identifier with the ongoing or granted first PUSCH.

4. The apparatus of claim 1, wherein the DCI includes an indication of the time-domain resource assignment (TDRA) for the second PUSCH.

5. The apparatus of claim 4, wherein the second PUSCH does not overlap with a repetition of the first PUSCH if the repetition of the first PUSCH starts before a number of symbols (“m”) after the last symbol of the PDCCH carrying the DCI scheduling the second PUSCH.

6. The apparatus of claim 5, wherein a value of m is N2 symbols, wherein N2 is a minimum UE processing time for PUSCH preparation corresponding to a given processing capability.

7. The apparatus of claim 6, wherein N2 is based on one or more of: a subcarrier spacing of a scheduling PDCCH, and a subcarrier spacing of the first or second PUSCH.

8. One or more computer-readable media storing instructions that, when executed by one or more processors, cause a user equipment (UE) to: detect a message that includes downlink control information (DCI) that the UE is to use to schedule a second physical uplink shared channel (PUSCH) transmission overlapped with one or more repetitions of first PUSCH transmission for a given hybrid automatic repeat request (HARQ) process for the UE;

ceasing PUSCH repetitions based on detection of the DCI; and

encoding the second PUSCH message for transmission on the time-domain resources as indicated in the DCI scheduling the second PUSCH.

9. The one or more computer-readable media of claim 8, wherein the DCI scheduling the second PUSCH is addressed to a HARQ process identifier having a common identifier with the ongoing or granted first PUSCH.

10. The one or more computer-readable media of claim 8, wherein the UE ceases repetitions of the first PUSCH starting from a repetition that corresponds to time domain resources overlapping with the time-domain resource assignment indicated for the second PUCSH transmission.

11. The one or more computer-readable media of claim 8, wherein the DCI is format 0 0 or 0_1.

12. The one or more computer-readable media of claim 8, wherein the DCI includes an indication of the time-domain resource assignment (TDRA) for the second PUSCH.

13. The one or more computer-readable media of claim 12, wherein the second PUSCH does not overlap with a repetition of the first PUSCH if the repetition of the first PUSCH starts before a number of symbols (“m”) after the last symbol of the PDCCH carrying the DCI scheduling the second PUSCH.

14. The one or more computer-readable media of claim 13, wherein a value of m is N2 symbols, wherein N2 is a minimum UE processing time for PUSCH preparation corresponding to a given processing capability.

15. The one or more computer-readable media of claim 14, wherein N2 is based on one or more of: a subcarrier spacing of a scheduling PDCCH, and a subcarrier spacing of the first or second PUSCH.

16. One or more computer-readable media storing instructions that, when executed by one or more processors, cause a next-generation NodeB (gNB) to:

generate a message that includes downlink control information (DCI) that is to schedule a second physical uplink shared channel (PUSCH) transmission overlapped with one or more repetitions of a first PUSCH transmission for a given hybrid automatic repeat request (HARQ) for a user equipment (UE); and

encode the message for transmission to the UE.

17. The one or more computer-readable medium of claim 16, wherein the DCI is format 0 0 or 0_l .

18. The one or more computer-readable medium of claim 16, wherein the DCI scheduling the second PUSCH is addressed to a HARQ process identifier having a common identifier with the ongoing or granted first PUSCH.

19. The one or more computer-readable medium of claim 16, wherein the DCI includes an indication of the time-domain resource assignment (TDRA) for the second PUSCH such that the second PUSCH does not overlap with a repetition of the first PUSCH if the repetition of the first PUSCH starts before a number of symbols (“m”) after the last symbol of the PDCCH carrying the DCI scheduling the second PUSCH.

20. The one or more computer-readable medium of claim 18, wherein a value of m is N2 symbols, wherein N2 is a minimum UE processing time for PUSCH preparation time corresponding to a given processing capability that is defined based on one or more of: a subcarrier spacing of a scheduling PDCCH, and a subcarrier spacing of the first or second PUSCH.