WO2020030279A1

WO2020030279A1 - Resource allocation formatting for wireless network

Info

Publication number: WO2020030279A1
Application number: PCT/EP2018/071711
Authority: WO
Inventors: Troels Emil Kolding; Klaus Ingemann Pedersen
Original assignee: Nokia Technologies Oy
Priority date: 2018-08-09
Filing date: 2018-08-09
Publication date: 2020-02-13

Abstract

A technique includes receiving, by a first user device from a base station, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

Description

RESOURCE ALLOCATION FORMATTING FOR WIRELESS NETWORK

TECHNICAL FIELD

[0001] This description relates to communications.

BACKGROUND

[0002] A communication system may be a facility that enables communication between two or more nodes or devices, such as fixed or mobile communication devices. Signals can be carried on wired or wireless carriers.

[0003] An example of a cellular communication system is an architecture that is being standardized by the 3^rd Generation Partnership Project (3GPP). A recent development in this field is often referred to as the Long Term Evolution (LTE) of the Universal Mobile

Telecommunications System (UMTS) radio-access technology. E-UTRA (evolved UMTS Terrestrial Radio Access) is the air interface of 3GPP's Long Term Evolution (LTE) upgrade path for mobile networks. In LTE, base stations or access points (APs), which are referred to as enhanced Node B (eNBs), provide wireless access within a coverage area or cell. In LTE, mobile devices, or mobile stations are referred to as user equipments (UE). LTE has included a number of improvements or developments.

[0004] 5G New Radio (NR) development is part of a continued mobile broadband evolution process to meet the requirements of 5G, similar to earlier evolution of 3G & 4G wireless networks. A goal of 5G is to provide significant improvement in wireless

performance, which may include new levels of data rate, latency, reliability, and security. 5G NR may also scale to efficiently connect the massive Internet of Things (loT), and may offer new types of mission-critical services.

SUMMARY

[0005] According to an example implementation, a method includes sending, by a base station to a first user device, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time- frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

[0006] According to an example implementation, an apparatus includes at least one processor and at least one memory including computer instructions, when executed by the at

I least one processor, cause the apparatus to send, by a base station to a first user device, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

[0007] According to an example implementation, an apparatus includes means for sending, by a base station to a first user device, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

[0008] According to an example implementation, a computer program product includes a computer-readable storage medium and storing executable code that, when executed by at least one data processing apparatus, is configured to cause the at least one data processing apparatus to perform a method including: sending, by a base station to a first user device, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

[0009] According to an example implementation, a method includes receiving, by a first user device from a base station, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time- frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

[0010] According to an example implementation, an apparatus includes at least one processor and at least one memory including computer instructions, when executed by the at least one processor, cause the apparatus to receive, by a first user device from a base station, a resource allocation including information identifying: a group of consecutive time- frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

[0011] According to an example implementation, an apparatus includes means for receiving, by a first user device from a base station, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device. [0012] According to an example implementation, a computer program product includes a computer-readable storage medium and storing executable code that, when executed by at least one data processing apparatus, is configured to cause the at least one data processing apparatus to perform a method including: receiving, by a first user device from a base station, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

[0013] The details of one or more examples of implementations are set forth in the accompanying drawings and the description below. Other features will be apparent from the description and drawings, and from the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

[0014] FIG. 1 is a block diagram of a wireless network according to an example implementation.

[0015] FIG. 2 is a diagram illustrating a resource grid in which periodic resource allocations are shown for user devices (UEs) according to an example embodiment.

[0016] FIG. 3 is a diagram illustrating a resource grid in which both deterministic (or periodic) resource allocations and non-deterministic resource allocations are shown for different user devices (UEs) according to an example embodiment.

[0017] FIG. 4 is a diagram illustrating scheduling of multiple UEs according to an example embodiment.

[0018] FIG. 5 is a diagram illustrating signaling that may support identifying a time (symbols) and a mini-slot block of one or more unavailable or blocked symbols according to an example embodiment.

[0019] FIG. 6 is a d iagram illustrating signaling that may support identifying a variable number of symbols for a blocked/unavailable area according to an example embodiment.

[0020] FIG. 7 is a diagram illustrating signaling that may support identifying a variable number of symbols and a variable number of physical resource blocks for a

blocked/unavailable area according to an example embodiment.

[0021] FIG. 8 is a flow chart illustrating operation of a base station according to an example embodiment.

[0022] FIG. 9 is a flow chart illustrating operation of a user device according to an example embodiment. [0023] FIG. 10 is a block diagram of a node or wireless station (e.g., base

station/access point or mobile station/user device) according to an example implementation.

DETAILED DESCRIPTION

[0024] FIG. 1 is a block diagram of a wireless network 130 according to an example implementation. In the wireless network 130 of FIG. 1 , user devices 131, 132, 133 and 135, which may also be referred to as mobile stations (MSs) or user equipment (UEs), may be connected (and in communication) with a base station (BS) 134, which may also be referred to as an access point (AP), an enhanced Node B (eNB), a gNB, or a network node. At least part of the functionalities of an access point (AP), base station (BS) or (e)Node B (eNB) may be also be carried out by any node, server or host which may be operably coupled to a transceiver, such as a remote radio head. BS (or AP) 134 provides wireless coverage within a cell 136, including to user devices 131, 132, 133 and 135. Although only four user devices are shown as being connected or attached to BS 134, any number of user devices may be provided. BS 134 is also connected to a core network 150 via a S1 interface 151. This is merely one simple example of a wireless network, and others may be used.

[0025] A user device (user terminal, user equipment (UE) or mobile station) may refer to a portable computing device that includes wireless mobile communication devices operating with or without a subscriber identification module (SIM), including, but not limited to, the following types of devices: a mobile station (MS), a mobile phone, a cell phone, a smartphone, a personal digital assistant (PDA), a handset, a device using a wireless modem (alarm or measurement device, etc.), a laptop and/or touch screen computer, a tablet, a phablet, a game console, a notebook, and a multimedia device, as examples. It should be appreciated that a user device may also be a nearly exclusive uplink only device, of which an example is a camera or video camera loading images or video dips to a network.

[0026] In LTE (as an example), core network 150 may be referred to as Evolved Packet Core (EPC), which may include a mobility management entity (MME) which may handle or assist with mobility/handover of user devices between BSs, one or more gateways that may forward data and control signals between the BSs and packet data networks or the Internet, and other control functions or blocks.

[0027] In addition, by way of illustrative example, the various example

implementations or techniques described herein may be applied to various types of user devices or data service types, or may apply to user devices that may have multiple applications running thereon that may be of different data service types. New Radio (5G) development may support a number of different applications or a number of different data service types, such as for example: machine type communications (MTC), enhanced machine type communication (eMTC), Internet of Things (loT), and/or narrowband loT user devices, enhanced mobile broadband (eMBB), wireless relaying including self-backhauling, D2D (device-to-device) communications, and ultra-reliable and low-latency communications (URLLC). Scenarios may cover both traditional licensed band operation as well as unlicensed band operation.

[0028] loT may refer to an ever-growing group of objects that may have Internet or network connectivity, so that these objects may send information to and receive information from other network devices. For example, many sensor type applications or devices may monitor a physical condition or a status, and may send a report to a server or other network device, e.g., when an event occurs. Machine Type Communications (MTC, or Machine to Machine communications) may, for example, be characterized by fully automatic data generation, exchange, processing and actuation among intelligent machines, with or without intervention of humans. Enhanced mobile broadband (eMBB) may support much higher data rates than currently available in LTE.

[0029] Ultra-reliable and low-latency communications (URLLC) is a new data service type, or new usage scenario, which may be supported for New Radio (5G) systems. This enables emerging new applications and services, such as industrial automations,

autonomous driving, vehicular safety, e-health services, and so on. 3GPP targets in providing connectivity with reliability corresponding to block error rate (BLER) of 10 ^s and up to 1 ms U-Plane (user/data plane) latency, by way of illustrative example. Thus, for example, URLLC user devices/UEs may require a significantly lower block error rate than other types of user devices/UEs as well as low latency (with or without requirement for simultaneous high reliability)

[0030] The various example implementations may be applied to a wide variety of wireless technologies or wireless networks, such as LTE, LTE-A, 5G, cmWave, and/or mWave band networks, loT, MTC, eMTC, eMBB, URLLC, etc., or any other wireless network or wireless technology. These example networks, technologies or data service types are provided only as illustrative examples.

[0031] As noted, different data service types (or different types of UEs) may have different performance requirements, such as for reliability (e.g., maximum block error rate), bandwidth or data throughput or minimum data rate, and latency. Some data service types, such as eMBB, may require higher data rates, while tolerating higher block error rates and higher latency (as compared to URLLC). On the other hand, some high reliability data service types, such as URLLC, may require much higher reliability (e.g., lower block error rates) and lower latency, as compared to eMBB.

[0032] In an example implementation, some types of traffic (e.g., eMBB) may use, at least in some cases, a relatively long transmission time interval (TT1), such as a subframe or slot size, e.g., 14 OFDM (orthogonal frequency division multiplexing) symbols, so as to maximize or improve data rates. Whereas, other types of traffic that may require lower latency (e.g., URLLC) may use a short (or shorter) TΊΊ, such as smaller slot sizes (which may be known as mini-slot), where an example mini-slot may be 1-13 OFDM symbols (e.g., 2, 5 or 7 OFDM symbols, for example), for the transmission of data, so as to reduce latency.

[0033] Similarly, according to an example implementation, some types of UEs or service types, which may not require low latency (e.g., eMBB applications/service types), may transmit uplink control information via a long physical uplink control channel (PUCCH) format length and a long Til, e.g., using a (longer) slot size of 14 symbols, for example. Longer TTIs may be achieved by using slot aggregation, in which multiple slots may be aggregated to provide a TTI that is longer than 14 symbols, for example. On the other hand, for example, a high reliability/low latency communications (e.g., URLLC) data service type (or URLLC application) on a UE may transmit uplink control information via a short physical uplink control channel (PUCCH) format length and a short TTI (e.g., to allow for quicker or more frequent transmission of control information) using a mini-slot of length 1-13 symbols (e.g., 2, 5 or 7 symbols, or other mini-slot length), for example.

[0034] According to an example embodiment, a problem or challenge may arise where a BS may allocate various resources within a slot or group of resources to multiple UEs/user devices. Allocating a resource(s) within a slot or group of resources may fragment the group or slot of resources, thereby making it more challenging to allocate remaining resources of the slot or group to other UEs. For example, a BS may receive parameters or conditions for a traffic flow that indicate a request for recurring or periodic resources. Thus, the BS may allocate a recurring resource (e.g., via semi-persistent scheduling or other technique) at a regular time interval (e.g., every 2ms, 5ms or 10ms) for the UE, either for uplink (UL) or downlink (DL) transmission. Allocating one or more recurring resources in future slots or transmission time intervals (TTIs) may fragment the resources within these slots or TTIs, for example. Thus, this may cause subsequent allocation of remaining resources within such groups of resources, slots or TTIs to be more challenging. For example, a BS will need to signal to a UE a subsequent resource allocation within such group or slot in which some resources have already be allocated. For example, the fragmentation of the resources within the group, slot or TTI may create challenges as to how such subsequent resource allocations should be indicated or signaled to the UEs. Various examples are described herein. However, the various teachings and concepts described herein may be applied to any type of traffic and/or any type of application or UE.

[0035] According to an example embodiment, there may be different types of traffic for which resources of a wireless (e.g., 5G) network may be allocated or scheduled, including, for example: 1) non-deterministic traffic for which resources are allocated or scheduled dynamically or on demand: and 2) deterministic (or periodic) traffic for which resources may be allocated or scheduled at regular intervals to accommodate a need for regular or periodic resources of deterministic traffic (one or more parameters or constraints, such as a period or amount of resources to be scheduled, of the deterministic may be known or determined in advance by the BS).

[0036] Thus, a first type of traffic may include non-deterministic traffic that may typically be scheduled dynamically, e.g., upon demand. Some examples of non-deterministic traffic may include broadband or eMBB traffic flows. For non-deterministic traffic, one or more parameters or constraints or requirements of the data may not necessarily be known in advance (e.g., the amount of resources required and/or future times that such resources will be required or used may not be known in advance for non-deterministic traffic). Thus, non- deterministic traffic is typically scheduled dynamically, e.g., upon demand or request

(assuming sufficient resources are available at that time). For example broadband or eMBB traffic, or sporadic URLLC traffic (that is not periodic) may be scheduled dynamically, which may include allocating resources for transmission upon demand (or upon request) at unpredictable times, or as data arrives for transmission. Also, in some cases, different amounts of resources may be allocated each instance of eMBB transmission, for example, depending on the amount of resources requested. Non-deterministic traffic may typically be aperiodic, e.g., which may include allocating resources for such non-deterministic traffic on an irregular or aperiodic basis, for example. Thus, for example, a specific or fixed resource size and period may not be known or determined in advance by a BS for non-deterministic traffic, and a fixed size resource or period may not even be applicable for non-deterministic traffic.

[0037] A second type of traffic for which resources may be allocated or scheduled in a wireless network may include deterministic traffic. For deterministic (e.g., periodic) traffic, one or more parameters, constraints or requirements of such traffic may typically be known or determined in advance by a BS, e.g., such as a size or amount of required (or requested) resources (e.g., 100 bytes) and/or a period for such resource requirements (e.g , resources required every 5 ms, or every 5 transmission time intervals (TTIs), or other time period).

Thus, in some cases, recurring (or periodic) resources may be allocated, or pre-allocated, by a BS based on the known parameters, constraints or requirement(s) of the deterministic traffic (or deterministic traffic flow, e.g., where a traffic flow may include a group of packets or data associated with a specific application of a UE). Thus, for example, there are some devices or applications that may have a fixed and/or a low cycle-time for data transmission, which may be known or determined in advance by the BS, and for which recurring or periodic resources can be reserved or pre-allocated. Deterministic traffic may be periodic, or aperiodic (but often will be periodic). In some instances, deterministic traffic may include traffic for which a size of required/requested resources (or a limited range of resource sizes) that will be required, a period (e.g., 5 or 10 ms), and/or other requirements may be known in advance, and may be used to pre-allocate resources for such deterministic traffic.

[0038] Therefore, some example types of traffic may include:

[0039] Deterministic traffic - e.g., IEEE Time-Sensitive Networks (TSN) traffic, periodic URLLC traffic (for example);

[0040] Non-deterministic traffic - e.g., eMBB, mMTC, dynamically scheduled URLLC traffic, or any event-based or dynamically scheduled traffic (or any traffic where there is no deterministic or periodic traffic).

[0041] Several applications may generate deterministic data (or traffic), for which data is generated and may need a fixed resource allocation and/or a resource allocation at regular intervals or on a periodic basis. For example, IEEE Time-Sensitive Networks (TSN) may be used for industrial Ethernet (e.g., which may be used for control of machinery, motion control or other applications), and may, for example, require resources allocated at periodic or regular time intervals (e.g., every 5ms, every 10ms, ...). Likewise, some types of URLLC traffic may require regular or periodic allocation of resources for transmission. The data allocation for such devices may frequently be very small (e.g., 50-100 bytes, or other size). For example, IEEE TSN typical data allocation sizes are often on the order of 64 Bytes, or the like. Thus, some applications or devices/UEs, such as for TSN or URLLC, may have strict time domain resource reservations, due to a low jitter requirement and/or due to low latency requirements, and/or based on a need for a regular fixed-sized resource allocation for a short period (e.g., every 2 ms), etc.

[0042] In 5G wireless networks, one option to serve such devices that have a fixed and very low cycle-time for data generation and transmission is to allocate recurnng or periodic resources to the device or UE via a semi-persistent resource allocation (or semi- persistent scheduling (SPS)) over the network. Many resource allocations (e.g., a resource allocation for dynamically scheduled or dynamically allocated resources) are typically provided as a one-time resource allocation, for example. On the other hand, a semi- persistent resource allocation (or SPS) is a resource allocation that continues beyond one resource allocation or one instance. According to an example embodiment, a semi-persistent resource allocation, which may be provided via semi-persistent scheduling (SPS), may include a recurring (or repeating or periodic) resource allocation that is valid (or continues) until such semi-persistent resource allocation is modified or cancelled by a subsequent resource allocation for such flow or traffic. For example, a deterministic traffic flow may require 64 bytes of resources every 10 ms. Based on these requirements, a BS may, for example, pre-allocate such resources for a current and/or future subframes or slots via use of semi-persistent scheduling. Semi-persistent scheduling may allow many (e.g., periodic) recurring resource allocations (e.g., a fixed size resources allocated every 5 slots) to be provided or scheduled, without requiring the BS to separately signal each of these resource allocations to the deterministic traffic UE. Thus, semi-persistent scheduling may allocate recurring resources while reducing signaling overhead. In this manner, semi-persistent resource allocation may be used to efficiently allocate to a UE a specific and predictable amount of resources at known times, symbols, slots and/or subframes. Thus, semi-persistent scheduling of resources may be an attractive resource allocation scheme for deterministic and/or periodic traffic (e.g., TSN or periodic URLLC traffic).

[0043] A BS may typically multiplex different types of traffic within one or more slots or TTIs. For example, a BS may dynamically multiplex deterministic traffic, e.g., such as periodic URLLC or TSN traffic, with non-deterministic traffic types (e.g. randomly sporadic URLLC traffic and/or broadband or eMBB traffic). As noted, according to an example embodiment, semi-persistent scheduling (SPS) may be an attractive resource allocation scheme for the deterministic (e.g., periodic) traffic, e.g., with periodicity (or period) of 1 , 5, 10, or 20 ms, as examples. The SPS resource allocations may typically be with very short TTIs (transmission time intervals), typically in the form of mini-slots of only a few (e.g., two) symbols, and in some cases only occupying a sub-set of the available physical resource blocks (PRBs) within the total carrier bandwidth as the periodic URLLC/TSN payloads are typically in the range of few tens of bytes to a hundred (or a few hundred) bytes, as examples.

[0044] FIG. 2 is a diagram illustrating a resource grid in which periodic resource allocations are shown for user devices (UEs). As shown in FIG. 2, the vertical axis refers to physical resource blocks (PRBs) or subcarriers/frequency, e.g., with each PRB including a plurality (such as 12) subcarriers, and the horizontal axis refers to symbols or time. Thus, each row corresponds to a PRB (physical resource block) and each column corresponds to a slot (or subframe) of 14 symbols. In this illustrative example, periodic resource allocations are shown, e.g., for deterministic traffic, for each of a plurality of UEs. Each periodic allocation shown in FIG. 2 may include one or two symbols (e.g., a two-symbol mini-slot) by one or two PRBs, as an example. As shown in FIG. 2, resource allocations are shown for five different UEs. For example, as shown in the first row, a periodic resource allocation for UE1 may be provided via (or including) PRB 214, including a resource allocation (e.g., one or more symbols) for UE1 in each slot, including: a resource allocation 213A within slot 212A; a resource allocation 213B within slot 212B; a resource allocation 213C within slot 212C; a resource allocation 213D within slot 212D; and, a resource allocation 213E within slot 212E. Similarly, periodic or recurring resource allocations are provided for UE2, including a resource allocation for each slot, where each resource allocation for UE2 includes or uses two PRBs (PRBs 216) by one or two symbols (e.g., OFDM symbols).

[0045] As can be seen from the resource grid of FIG. 2, allocating a small periodic resource (e.g., resource allocations 213A, 213B, 213C, 213D, 213E) to a periodic or deterministic traffic or flow may result in a fragmenting of resources within each slot and within the overall resource grid. For example, resource allocation 213A divides or fragments resources (symbols) within slot 212A so that the resources within slot 212A are no longer consecutive or contiguous. Allocating additional resources within the same slot to multiple deterministic traffic flows may further fragment a slot into smaller chunks of resources. In addition, it may be desirable to allocate a relatively large group of resources to a non- deterministic traffic flow (e.g., broadband or eMBB traffic). For example, at least in some cases, a deterministic or periodic traffic flow may be allocated a group of resources that is larger than a mini-slot, such as a resource allocation that may include, e.g., 12 consecutive data symbols of a slot (which may be all of the data symbols of a slot, or multiple slots). An example slot may include two control symbols followed by 12 data symbols, for example. By allocating 12 consecutive data symbols to a non-deterministic flow or application, this may increase data throughput and network efficiency (e.g., more data transmitted with less overhead). However, It can be challenging or difficult to schedule (or multiplex), or allocate resources for, both a deterministic traffic or flow and a non-deterministic traffic flow within the same slot, e.g., due to the fragmentation of a slot that may result from scheduling of small resources (e.g., one or two symbols or a mini-slot) within the slot to the deterministic traffic, for example.

[0046] On the other hand, the non-determ^'mistic traffic such as e BB, mWITC, and sporadic random URLLC traffic may typically be dynamically (or event-based) scheduled and needs to co-exist effectively with the deterministic or periodic (e.g., TSN and periodic URLLC) traffic. In many cases, the deterministic traffic may be scheduled with smaller TTI sizes (e.g., 2-symbol mini-slot) (e.g., due to small resource request and/or a need for very small latency or other requirement), whereas it may be desirable to schedule non-deter inistic traffic with larger TTI sizes (e.g., 14 symbol slot, or multiple slots that may have been aggregated) in order to increase data throughput for non-deterministic traffic. However, as the time- frequency resource grid becomes more and more fragmented, it becomes challenging task to efficiently dynamically schedule remaining traffic to use all of the time-frequency resources.

[0047] While some of the examples are described with reference to a deterministic or periodic traffic or flow (and/or traffic allocated resources via SPS) being allocated a recurring resource, and non-deterministic traffic or flow being dynamically allocated other or remaining resources within a same slot, TTI or group of resources, the various techniques described herein may be used or applied to any types of traffic or traffic flows.

[0048] FIG. 3 is a diagram illustrating a resource grid in which both deterministic (or periodic) resource allocations and non-deterministic resource allocations are shown for different user devices (UEs) according to an example embodiment. As shown in FIG. 3, in an illustrative example, a BS may want to schedule or allocate resources, e.g., such as all or part of a group of resources 312 (includes the resources defined by slot 212B by two PRBs 216, which includes 14 symbols by two PRBs) to UE2. However, in this example, this entire group of resources 312 is not available, e.g., because recurring small resources 313 (e.g., a two- symbol mini-slot by two PRBs) has been or will be allocated, e.g., via SPS, to a deterministic or periodic traffic flow. This results in a fragmentation of resources within the group 312 of slot 212B, and for other slots, as shown in FIGs. 2 and 3. Similarly, a BS may want to schedule a group of resources 314 to a non-deterministic traffic flow, but a (e.g., small) resource 315 has already been or will be allocated to a deterministic (or periodic) traffic flow, e.g., scheduled or allocated via SPS, thus preventing the entire group 314 from being available for allocation or scheduling to the non-deterministic traffic flow. Note that the resource 313 allocated to a deterministic traffic flow is for or across two PRBs (which are all the PRBs of the group of resources 312), while small resource 315 allocated to a

deterministic traffic flow is only for one PRB (which is less than all PRBs for the group of resources 314, since the group 312 includes three PRBs by one slot). [0049] One example technique that may be used to allocate or schedule resources for two different types of traffic involves preemption. For example, according to a preemption technique, the group of resources 312 may be initially allocated to a first traffic flow (e.g., eMBB traffic). During transmission of the eMBB data, a higher priority URLLC data arrives for transmission. The BS may then preempt (at least a portion of) the scheduled resources of group 312 for the eMBB traffic in order to schedule or allocate resources 313 (e.g., two symbol mini-slot, within group 312) for the transmission of the higher priority URLLC traffic. However, this results in one or more symbols for the lower priority eMBB traffic being punctured (discarded or deleted), which causes a retransmission for the eMBB traffic (data), and significantly reduces network efficiency from the perspective of the eMBB UE.

[0050] Likewise, according to an example embodiment, in the case of deterministic and a non-deterministic traffic flows to be scheduled or allocated resources within the same slot or group of resources, a preemption technique may be used to allocate a group or slot of resources to the non-deterministic traffic, and then preempting or puncturing the e BB data or one or more symbols of the group or slot in order to transmit the data or traffic of the deterministic or periodic (or SPS scheduled or allocated) traffic flow, based on the period of the deterministic traffic flow. However, use of preem tion in this example results in a loss of data, a data retransmission, and a significant decrease in network efficiency for the non- deterministic traffic flow.

[0051] Thus, while the preemption technique might be sufficient or a decent approach for the low priority and high priority data example (no deterministic traffic), such an approach is not an ideal approach in the case of a deterministic traffic flow, since a preemption technique would not take advantage of the (known) deterministic qualities of the deterministic traffic flow. Thus, for example, in the case of a deterministic traffic flow, the periodic arrival of the data of the deterministic traffic flow is not surprising to the BS. Rather, based on the deterministic nature of the deterministic traffic flow, one or more parameters, such as the resource request size and/or period of the resource request for the deterministic traffic, is known by the BS. The BS knows the transmission schedule (transmission period) of the deterministic traffic flow in advance, so the BS can go ahead and use semi-persistent scheduling to allocate (pre-allocate) recurring resources in advance, rather than using preemption or overriding /puncturing an existing resource allocation. This is a more efficient technique, because the BS is not overriding or puncturing or discarding any previously scheduled data, but merely formatting (e.g., in advance) or allocating a portion of the time- frequency resources to the deterministic traffic, and allocating some or all of the remaining (available) resources of the group or slot to other traffic flows.

[0052] Thus, according to an example embodiment, a technique may include receiving, by a first UE from a BS, a resource allocation including information identifying: a group of consecutive time-frequency resources (e.g., symbols), and one or more previously allocated time-frequency resources (e.g., symbols) within the group of consecutive time- frequency resources that are unavailable to the first UE. For example, the information identifying one or more previously allocated time-frequency resources may include information identifying one or more previously allocated time-frequency resources that were allocated by the BS to a second UE via a semi-persistent scheduling (SPS) allocation. The technique may further include receiving data or traffic by the first UE or sending data or traffic by the first UE to the BS via time-frequency resources (e.g., symbols) allocated to the first UE, including via the group of consecutive time-frequency resources except the one or more previously allocated time-frequency resources.

[0053] According to an example embodiment, the time-frequency resource may include symbols. Also, for example, the one or more previously allocated symbols within the group of consecutive symbols may be allocated by the BS as a recurring or periodic resource to the second UE via semi-persistent scheduling (SPS) for deterministic or periodic traffic of the second UE. Also, for example, the resources or symbols allocated to the first UE may be allocated for non-deterministic or non-periodic traffic of the first UE.

[0054] Also, as described in greater detail herein, a BS may indicate or signal the resource allocation to the first UE. According to an example embodiment, the BS may transmit or signal to the first UE the resource allocation within downlink control information (DCl). According to an example embodiment, the resource allocation received by the first user device may include an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies one or more of the following, for example:

[0055] a start symbol of the group of consecutive symbols;

[0056] a start symbol and a number of consecutive symbols of the group of consecutive symbols;

[0057] a start symbol that identifies a start of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second UE;

[0058] a number of symbols of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second UE; [0059] a start physical resource block (PRB) that identifies a start of physical resource blocks (PRBs) associated with the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second UE; and/or

[0060] a number of physical resource blocks (PRBs) that identifies a number of physical resource blocks associated with of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second UE.

[0061] FIG. 4 is a diagram illustrating scheduling of multiple UEs according to an example embodiment. FIG. 4 illustrates resource allocations for multiple user devices/UEs, which allows for co-existence within a group of symbols or resources. A slot 408 is shown that includes 14 symbols, numbered as symbols 0-13, according to an example embodiment. Symbols are also shown before and after the slot 408. As shown in FIG. 4, the resources (symbols) are allocated to two UEs or users, including user #1 , and user #2. In an example embodiment, traffic to or from user #1 may be deterministic or periodic traffic, e.g., having a specific sized resource requested or provided at a period or regular time interval. As described below, based on one or more parameters of the traffic or user #1 , recurring resources may be scheduled for user #1. Also, according to an example embodiment, the traffic to or from user #2 may be non-deterministic, for example, and resources may be allocated or scheduled for user #2 dynamically or based on a request or arrival of data for transmission.

[0062] Referring to FIG. 4, a recurring (e.g., periodic) resource allocation 409 of 2 symbols every 10 symbols (as an illustrative example) is allocated to user #1 , which may be allocated or scheduled via semi-persistent scheduling (SPS). Thus, a recurring resource allocation allocated to user #1 may include an allocation of a mini-slot (e.g., 2 symbols in this example) scheduled every 10 symbols, including allocations 410, 412 and 414 (2 symbols allocated to user #1 at each instance). Allocation 412 includes symbols #5, and #6 of the 14 symbol slot. This recurring resource allocation to user #1 (e.g., which may be for deterministic or periodic traffic, for example) may be allocated or scheduled by the BS via a semi-persistent scheduling (SPS), e.g., in which a recurring or repeating resource allocation (e.g., of a known or requested resource size) is allocated or scheduled for a period or at regular time intervals (e.g., every 10 symbols), for example. Thus, the BS may receive a request from user #1 for a recurring or SPS resource allocation, including a resource allocation size, and a period (e.g.,

2 symbols requested every 10 symbols), and then may send signaling to user #1 via SPS indicating a recurring or semi-persistent allocation to user #1. [0063] Also, the BS may allocate resources (e.g., symbols) to user #2 within slot 408, e.g,, where the resources allocated to user #2 in a slot may be fragmented or divided by the resources previously allocated to user #1. BS may allocate to user #2 symbols #0-#4, and #7-#13, which is 12 of the 14 symbols of the slot. As noted above, symbols #5, #5 have already been allocated to user #1 via SPS, and thus are unavailable to user #2.

[0064] Due to the fragmented nature of the symbols allocated to user #1 within slot 408(symbols #0-#4, and #7-#13), challenges exist in providing an efficient way for BS to signal this resource allocation to user #2. However, the BS knows: 1) a size of a group of symbols (e.g., the 14 symbols in slot 408), and 2) the symbols within that group or slot 408 that have already been allocated to another UE. As noted above, rather than having data for user #1 preempt scheduled data transmission for user #2, a more network efficient technique may be used, based on the BS knowledge of the resources/symbols (e.g., symbols #5, #6) already allocated within slot 408 to another UE/user, to allocated resources or symbols within the slot 408, except the previously allocated symbols #5, #6, which are unavailable to user #2.

[0065] Therefore, according to an example embodiment, in order to signal or indicate the resource allocation to user #2, the BS may send a resource allocation including information identifying: a group of consecutive time-frequency resources (e.g., information identifying the symbols of slot 408), and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device (e.g., information identifying previously allocated symbols #5, #6 within slot 408 that are unavailable to user #2).

[0066] According to an example embodiment, in order to indicate the resources allocated to user #2, a BS may send a resource allocation by sending, e.g., via downlink control information (DCI), an index to an entry to a resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies at least one or more previously allocated symbols (e.g., symbols #5, #6) within the group (e.g., within slot 408) of consecutive symbols that have been previously allocated to user #1 and are not available to the user #2,

[0067] FIG. 5 is a diagram illustrating signaling that may support identifying a time (symbols) and a mini-slot block of one or more unavailable or blocked symbols. As shown in the example A of FIG. 5, a slot 508 is shown that include 14 symbols (numbered symbols 0 - 13), including control symbols 526 (symbols 0, 1), and data symbols (symbols 2-13). In this example, a mini-slot 520 (e.g., including a fixed size of 2 symbols by 2 PRBs) at symbols 6 and 7 may be previously allocated (e.g., via SPS, or a recurring resource allocation) to UE #1. Thus, the mini-slot 520, including symbols 6 and 7, are shown as blocked or unavailable to other UEs. The BS may allocate the remaining (or available) data symbols of slot 508 to UE #2, which would include symbols2-5, and 8-13, by or for the 2 PRBs (physical resource blocks).

[0068] As shown in FIG, 5, in order to communicate a resource allocation to UE #2 (of symbols 2-5, and 8-13), BS may signal to UE #2 an index to an entry 528 to a time domain resource allocation table, which may indicate or identify: 1) a slot offset K0 530 (e.g., identifying an offset from control information or table index to the identified symbols allocated to the UE, where K0 is set to zero in this case because the slot for the allocated data is the same slot as the downlink control information, including the table index provided in symbols 0-1; 2) a start symbol S 532 (e.g., symbol 2 in the example A of FIG. 5); 3) a number L (set to 12 in this example) 534 of a group of consecutive symbols (e.g., 12 data symbols in the slot 508 of FIG. 5); and 3) a start symbol SB 536 (set to 6 in this example) of the one or more previously allocated (or unavailable or blocked) symbols (e.g., symbols 6-7) within the slot 508. In this example, the blocked or unavailable resources may be a fixed size, e.g., a mini- slot of 2 symbols by 2 PRBs. Thus, based on a fixed size of the blocked/unavailable

(previously allocated) resources at mini-slot 520, it is necessary to only indicate a start symbol SB 536 (set to 6 in this example) of the blocked/unavailable symbols, and it is unnecessary to indicate either a length (a number of symbols) or height (a number of PRBs) of such blocked or unavailable resources/symbols. Note that control information may include both PDCCH (physical downlink control channel information) and Reference Signals, and PDCCH information may also appear at other places (or in other symbols) in the slot structure (e.g., such as for users using mini-slot transmissions that are configured to monitor for PDCCH transmissions more frequently within each slot).

[0069] FIG. 6 is a diagram illustrating signaling that may support identifying a variable number of symbols for a blocked/unavailable area according to an example embodiment. As shown in the example of FIG. 6, a slot 608 is very similar to slot 508 shown in FIG. 5, but slot 608 includes a mini-slot 620 of 4 symbols and 2 PRBs that have been allocated to a UE (e.g., via SPS), and thus are blocked or unavailable to other UEs. Thus, in this example, the minislot 620 (blocked/unavailable symbols) may include a variable number of symbols by the 2 PRBs of the slot. Thus, the entry 628 of the time domain resource allocation table may identify: K0 530, S 532, L 534, SB 536 (as shown in FIG 5), and also a number SB of symbols 630 of the blocked area (the number of symbols for mini-slot 620, which are the previously allocated symbols within slot 608, and thus these symbols are blocked (blocked from use by other UEs) or unavailable for other UEs). By having the resource allocation table entries indicate or include LB (a number of symbols of the blocked or unavailable symbols within the slot 608) , this allows variable size or variable number of symbols to be allocated and blocked and made unavailable to other UEs, since LB indicates the number of symbols within the blocked/unavailable area 620 of the slot 608. Note that this example embodiment shown in FIG. 6 may assume a fixed number of PRBs for the blocked/unavailable area, or may assume that all of the PRBs of the slot 608 (e.g., 2 PRBs in this example) are used for the blocked/unavailable area or mini-slot 620 that were previously allocated and are not unavailable to other UEs (and thus blocked from use).

[0070] FIG. 7 is a diagram illustrating signaling that may support identifying a variable number of symbols and a variable number of physical resource blocks for a

blocked/unavailable area according to an example embodiment. As shown in the example of FIG. 7, a slot 708 is very simitar to slot 608 shown in FIG. 6, but slot 708 includes 3 PRBs. Also, slot 708 includes a mini-slot 720 of 4 symbols (symbols 6-9) and 2 PRBs (PRBs 1-2) that have been allocated to a UE (e.g., via SPS), and thus are blocked (blocked from use by other UEs) or unavailable to other UEs. In this case, the number of PRBs of mini-slot 720 (or the blocked/unavailable area) occupies or uses only 2 of the 3 PRBs, where 3 PRBs are used for the slot 708 (thus, less than all slot PRBs are used or occupied by the mini-slot 720 or blocked/unavailable area. In this manner, a variable number of PRBs may be used or occupied by the mini-slot 720 or blocked/unavailable area. However, to provide this flexibility or variability of the PRBs used for the mini-slot 720 (blocked/unavailable area), two additional parameters (SFB, and LFB related to PRBs) may be included in an entry of the time domain resource allocation table. Thus, as shown in FIG. 7, entry 728 of the time domain resource allocation table may further include SFB 730, which indicates a start PRB (e.g., the entry 728 indicating PRB 1 in this example) of the blocked area 720, and LFB 732, which is the number of PRBs in the blocked area. Thus, in this example, a number of PRBs may be used for the blocked area (or mini-slot 720) that is less than all of the PRBs (3 in this example) used by the slot 708. Thus, by using only 2 PRBs for the blocked area, this allows data symbols at 716 at PRB 3 to be available (not blocked) for use by other UEs.

[0071] Example Advantages:

[0072] Various features and example embodiments may provide one or more technical advantages, such as, for example:

[0073] A more efficient approach is provided for the scheduling of multiple UEs/users that offers improved usage of network resources, and which may avoid data preemption or discarding of data that has already been scheduled.

[0074] For example, a subset of resources within a group (or slot or TTl) of resources may be allocated or scheduled to a first UE. Remaining resources of the group (or slot or TTl) may be allocated or scheduled to a second UE. Information may be sent to the second UE that may identify both a group of consecutive time-frequency resources (e.g., information identifying the group, slot or TTl), and information identifying one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the second UE. For example, the resource allocated or pre-allocated to the first UE may be based on one or more parameters for deterministic or periodic traffic for the first UE (e.g., a resource request size, and a period or regular interval for such deterministic or periodic traffic of the first UE, or other parameters). In this manner, the BS may allocate or schedule resources to the first UE, while scheduling some or all of the remaining resources of the group or slot or TTl to a second UE, without requiring the use of preemption to schedule the first UE data in place of (or over) the second UE (as this would be a very inefficient use of network resources, and would typically require retransmissions for the discarded or preempted data).

[0075] Also, for example, new TD-RA scheduling formats may allow the system to dynamically schedule users/UEs (e.g., non-deterministic traffic) that may avoids any collisions (or preemption) with smaller pre-allocated SPS allocations for other users (e.g., such as resource allocations for deterministic traffic, e.g., periodic URLLC/TSN type traffic). Thus, in this manner, a scheduling solution is enabled that may allow, for example, multiplexing of dynamically scheduled (or non-deterministic) traffic and deterministic or periodic (e.g., periodic URLLC/TSN type traffic, or traffic scheduled via SPS), utilizing all available resources, while avoiding collisions or preemption/discarding (or puncturing) of previously scheduled data. In this manner, the known or deterministic qualities or parameters may be used to smoothly allocated or schedule resources for multiple users/UEs within a fragmented group (e.g., TTl or slot) of resources.

[0076] For example, use of the described techniques to schedule multiple UEs may provide much higher spectral performance as compared to use of a pre-emptive scheduling with puncturing of data for another scheduled UE.

[0077] Example 1 : FIG. 8 is a flow chart illustrating operation of a base station according to an example implementation. Operation 810 includes sending, by a base station to a first user device, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

[0078] Example 2: According to an example implementation of example 1, wherein the information identifying one or more previously allocated time-frequency resources comprises information identifying one or more previously allocated time-frequency resources that were allocated to a second user device via a semi-persistent scheduling allocation.

[0079] Example 3: According to an example implementation of any of examples 1-2, and further comprising: transmitting data or traffic to the first user device or receiving data or traffic from the first user device, by the base station via time-frequency resources allocated to the first user device, including via the group of consecutive time-frequency resources except the one or more previously allocated time-frequency resources.

[0080] Example 4: According to an example implementation of any of examples 1-3, wherein the sending comprises: sending, by a base station to the first user device, the resource allocation including information identifying: a start time-frequency resource and a number of consecutive time-frequency resources of a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that have been previously allocated via semi-persistent scheduling allocation to a second user device, wherein the time-frequency resources allocated to the first user device include the group of consecutive time-frequency resources except the one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that have been previously allocated to the second user device.

[0081] Example 5: According to an example implementation of any of examples 1-4 and further comprising: allocating, by the base station, the one or more time-frequency resources within the group of consecutive time-frequency resources, to the second user device via semi-persistent scheduling.

[0082] Example 6: According to an example implementation of any of examples 1-5, wherein the group of consecutive time-frequency resources comprises a group of consecutive symbols.

[0083] Example 7: According to an example implementation of any of examples 1-6, wherein the group of consecutive time-frequency resources comprises a group of consecutive symbols for one or more physical resource blocks, wherein each symbol is provided within a slot that includes a plurality of consecutive symbols, and wherein each physical resource block includes a plurality of subcarriers.

[0084] Example 8: According to an example implementation of any of examples 1-7, wherein the sending comprises: sending, by a base station to the first user device, the resource allocation including information identifying: a start symbol and a number of consecutive symbols of the group of consecutive symbols, and one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated via a semi-persistent scheduling allocation to the second user device.

[0085] Example 9: According to an example implementation of any of examples 1-8, further comprising: allocating, by the base station, the one or more symbols within the group of consecutive symbols as a recurring or periodic resource, to the second user device via semi-persistent scheduling; and allocating, by the base station, resources to the first user device including the group of consecutive symbols except the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device and are unavailable to the first user device.

[0086] Example 10: According to an example implementation of any of examples 1- 9 wherein the one or more symbols within the group of consecutive symbols allocated as a recurring or periodic resource to the second user device are allocated via semi-persistent scheduling for deterministic or periodic traffic of the second user device; and wherein the resources or symbols allocated to the first user device are allocated for non-deterministic or non-periodic traffic of the first user device.

[0087] Example 11 : According to an example implementation of any of examples 1-

10 wherein the resource allocation sent by the base station to the first user device comprises: an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies at least the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device and are not available to the first user device.

[0088] Example 12: According to an example implementation of any of examples 1-

11 wherein the resource allocation sent by the base station to the first user device comprises: an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies: a start symbol and a number of consecutive symbols of the group of consecutive symbols, and the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device and are not available to the first user device, wherein the symbols allocated to the first user device include the symbols of the group of consecutive symbols except the one or more previously allocated symbols that have been previously allocated to the second user device.

[0089] Example 13: According to an example implementation of any of examples 1-

12, wherein the resource allocation sent by the base station to the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies: a start symbol that identifies a start of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device.

[0090] Example 14: According to an example implementation of any of examples 1-

13, wherein the resource allocation sent by the base station to the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies: a start symbol that identifies a start of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device; and a number of symbols of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device.

[0091] Example 15: According to an example implementation of any of examples 1-

14, wherein the resource allocation sent by the base station to the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table Identifies at least one of: a start physical resource block that identifies a start of physical resource blocks associated with the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device; and a number of physical resource blocks that identifies a number of physical resource blocks associated with of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device.

[0092] Example 16: According to an example implementation, an apparatus comprising means for performing a method of any of examples 1-15.

[0093] Example 17: An apparatus comprising at least one processor and at least one memory including computer instructions that, when executed by the at least one processor, cause the apparatus to perform a method of any of examples 1-15.

[0094] Example 18: An apparatus comprising a computer program product including a non-transitory computer-readable storage medium and storing executable code that, when executed by at least one data processing apparatus, is configured to cause the at least one data processing apparatus to perform a method of any of examples 1-15.

[0095] Example 19: FIG. 9 is a flow chart illustrating operation of a user device (UE) according to an example embodiment. Operation 910 includes receiving, by a first user device from a base station, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

[0096] Example 20: According to an example implementation of example 19 wherein the information identifying one or more previously allocated time-frequency resources comprises information identifying one or more previously allocated time-frequency resources that were allocated by the base station to a second user device via a semi-persistent scheduling allocation.

[0097] Example 21 : According to an example implementation of any of examples 19- 20 and further comprising: receiving data or traffic by the first user device or sending data or traffic by the first user device to the base station via time-frequency resources allocated to the first user device, including via the group of consecutive time-frequency resources except the one or more previously allocated time-frequency resources.

[0098] Example 22: According to an example implementation of any of examples 19-

21, wherein the receiving comprises: receiving, by the first user device from the base station, the resource allocation including information identifying: a start time-frequency resource and a number of consecutive time-frequency resources of a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that have been previously allocated via semi-persistent scheduling allocation to a second user device, wherein the time-frequency resources allocated to the first user device include the group of consecutive time-frequency resources except the one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that have been previously allocated to the second user device.

[0099] Example 23: According to an example implementation of any of examples 19-

22, wherein the group of consecutive time-frequency resources comprises a group of consecutive symbols.

[00100] Example 24: According to an example implementation of any of examples19-

23, wherein the group of consecutive time-frequency resources comprises a group of consecutive symbols for one or more physical resource blocks, wherein each symbol is provided within a slot that includes a plurality of consecutive symbols, and wherein each physical resource block includes a plurality of subcarriers.

[00101] Example 25: According to an example implementation of any of examples 19- 24, wherein the receiving comprises: receiving, by the first user device from the base station, the resource allocation including information identifying: a start symbol and a number of consecutive symbols of the group of consecutive symbols, and one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated via a semi-persistent scheduling allocation to the second user device.

[00102] Example 26: According to an example implementation of any of examples 19- 25: wherein the one or more previously allocated symbols within the group of consecutive symbols being allocated as a recurring or periodic resource to the second user device via semi-persistent scheduling for deterministic or periodic traffic of the second user device; and wherein the resources or symbols allocated to the first user device are allocated for non- deterministic or non-periodic traffic of the first user device.

[00103] Example 27: According to an example implementation of any of examples 19-

26 wherein the resource allocation received by the first user device comprises: an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies at least the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device and are not available to the first user device.

[00104] Example 28: According to an example implementation of any of examples 19-

27 wherein the resource allocation received by the first user device comprises: an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies: a start symbol and a number of consecutive symbols of the group of consecutive symbols, and the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device and are not available to the first user device, wherein the symbols allocated to the first user device include the symbols of the group of consecutive symbols except the one or more previously allocated symbols that have been previously allocated to the second user device.

[00105] Example 29: According to an example implementation of any of examples 19-

28 wherein the resource allocation received by the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies: a start symbol that identifies a start of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device.

[00106] Example 30: According to an example implementation of any of examples 19-

29, wherein the resource allocation received by the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies: a start symbol that identifies a start of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device; and a number of symbols of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device.

[00107] Example 31 : According to an example implementation of any of examplesl 9-

30, wherein the resource allocation received by the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies at least one of: a start physical resource block that identifies a start of physical resource blocks associated with the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device; and a number of physical resource blocks that identifies a number of physical resource blocks associated with of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device.

[00108] Example 32: An apparatus comprising means for performing a method of any of examples 19-31.

[00109] Example 33: An apparatus comprising at least one processor and at least one memory including computer instructions that, when executed by the at least one processor, cause the apparatus to perform a method of any of examples 19-31.

[00110] Example 34: An apparatus comprising a computer program product including a non-transitory computer-readable storage medium and storing executable code that, when executed by at least one data processing apparatus, is configured to cause the at least one data processing apparatus to perform a method of any of examples 19-31.

[00111] FIG. 10 is a block diagram of a wireless station (e.g., AP, BS, relay node, eNB, UE or user device) 1000 according to an example implementation. The wireless station 1000 may include, for example, one or two RF (radio frequency) or wireless transceivers 1002A, 1002B, where each wireless transceiver includes a transmitter to transmit signals and a receiver to receive signals. The wireless station also includes a processor or control unit/entity (controller) 1004 to execute instructions or software and control transmission and receptions of signals, and a memory 1006 to store data and/or instructions.

[00112] Processor 1004 may also make decisions or determinations, generate frames, packets or messages for transmission, decode received frames or messages for further processing, and other tasks or functions described herein. Processor 1004, which may be a baseband processor, for example, may generate messages, packets, frames or other signals for transmission via wireless transceiver 1002 (1002A or 1002B). Processor 1004 may control transmission of signals or messages over a wireless network, and may control the reception of signals or messages, etc., via a wireless network (e.g., after being down- converted by wireless transceiver 1002, for example). Processor 1004 may be

programmable and capable of executing software or other instructions stored in memory or on other computer media to perform the various tasks and functions described above, such as one or more of the tasks or methods described above. Processor 1004 may be (or may include), for example, hardware, programmable logic, a programmable processor that executes software or firmware, and/or any combination of these. Using other terminology, processor 1004 and transceiver 1002 together may be considered as a wireless

transmitter/receiver system, for example.

[00113] In addition, referring to FIG. 10, a controller (or processor) 1008 may execute software and instructions, and may provide overall control for the station 1000, and may provide control for other systems not shown in FIG. 10, such as controlling input/output devices (e.g., display, keypad), and/or may execute software for one or more applications that may be provided on wireless station 1000, such as, for example, an email program, audio/video applications, a word processor, a Voice over IP application, or other application or software.

[00114] In addition, a storage medium may be provided that includes stored instructions, which when executed by a controller or processor may result in the processor 1004, or other controller or processor, performing one or more of the functions or tasks described above.

[00115] According to another example implementation, RF or wireless transceiver(s) 1002A/1002B may receive signals or data and/or transmit or send signals or data. Processor 1004 (and possibly transceivers 1002A/1002B) may control the RF or wireless transceiver 1002A or 1002B to receive, send, broadcast or transmit signals or data.

[00116] The embodiments are not, however, restricted to the system that is given as an example, but a person skilled in the art may apply the solution to other communication systems. Another example of a suitable communications system is the 5G concept. It is assumed that network architecture in 5G will be quite similar to that of the LTE-advanced 5G is likely to use multiple input - multiple output (MIMO) antennas, many more base stations or nodes than the LTE (a so-called small cell concept), including macro sites operating in cooperation with smaller stations and perhaps also employing a variety of radio technologies for better coverage and enhanced data rates.

[00117] It should be appreciated that future networks will most probably utilise network functions virtualization (NFV) which is a network architecture concept that proposes virtualizing network node functions into“building blocks” or entities that may be operationally connected or linked together to provide services. A virtualized network function (VNF) may comprise one or more virtual machines running computer program codes using standard or general type servers instead of customized hardware. Cloud computing or data storage may also be utilized. In radio communications this may mean node operations may be carried out, at least partly, in a server, host or node operationally coupled to a remote radio head. It is also possible that node operations will be distributed among a plurality of servers, nodes or hosts. It should also be understood that the distribution of labour between core network operations and base station operations may differ from that of the LTE or even be nonexistent.

[00118] Implementations of the various techniques described herein may be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Implementations may implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a

machine-readable storage device or in a propagated signal, for execution by, or to control the operation of, a data processing apparatus, e.g., a programmable processor, a computer, or multiple computers, implementations may also be provided on a computer readable medium or computer readable storage medium, which may be a non-transitory medium.

Implementations of the various techniques may also include implementations provided via transitory signals or media, and/or programs and/or software implementations that are downloadable via the Internet or other network(s), either wired networks and/or wireless networks. In addition, implementations may be provided via machine type communications (MTC), and also via an Internet of Things (IOT).

[00119] The computer program may be in source code form, object code form, or in some intermediate form, and it may be stored in some sort of carrier, distribution medium, or computer readable medium, which may be any entity or device capable of carrying the program. Such carriers include a record medium, computer memory, read-only memory, photoelectrical and/or electrical carrier signal, telecommunications signal, and software distribution package, for example. Depending on the processing power needed, the computer program may be executed in a single electronic digital computer or it may be distributed amongst a number of computers.

[00120] Furthermore, implementations of the various techniques described herein may use a cyber-physical system (CPS) (a system of collaborating computational elements controlling physical entities). CPS may enable the implementation and exploitation of massive amounts of interconnected ICT devices (sensors, actuators, processors

microcontrollers,...) embedded in physical objects at different locations. Mobile cyber physical systems, in which the physical system in question has inherent mobility, are a subcategory of cyber-physical systems. Examples of mobile physical systems include mobile robotics and electronics transported by humans or animals. The rise in popularity of smartphones has increased interest in the area of mobile cyber-physical systems. Therefore, various implementations of techniques described herein may be provided via one or more of these technologies.

[00121] A computer program, such as the computer program (s) described above, can be written in any form of programming language, including compiled or interpreted languages, and can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit or part of it suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a

communication network.

[001 2] Method steps may be performed by one or more programmable processors executing a computer program or computer program portions to perform functions by operating on input data and generating output. Method steps also may be performed by, and an apparatus may be implemented as, special purpose logic circuitry, e.g,, an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).

[00123] Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer, chip or chipset. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. Elements of a computer may include at least one processor for executing instructions and one or more memory devices for storing instructions and data. Generally, a computer also may include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. Information carriers suitable for embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory may be supplemented by, or incorporated in, special purpose logic circuitry.

[00124] To provide for interaction with a user, implementations may be implemented on a computer having a display device, e.g., a cathode ray tube (CRT) or liquid crystal display (LCD) monitor, for displaying information to the user and a user interface, such as a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input.

[00125] Implementations may be implemented in a computing system that includes a back-end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front-end component, e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with an implementation, or any combination of such back-end, middleware, or front-end components. Components may be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (LAN) and a wide area network (WAN), e.g., the Internet.

[00126] While certain features of the described implementations have been illustrated as described herein, many modifications, substitutions, changes and equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the various embodiments.

Claims

WHAT IS CLAIMED IS:

1. A method comprising:

sending, by a base station to a first user device, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

2. The method of claim 1 wherein the information identifying one or more previously allocated time-frequency resources comprises information identifying one or more previously allocated time-frequency resources that were allocated to a second user device via a semi-persistent scheduling allocation.

3. The method of any of claims 1-2 and further comprising:

transmitting data or traffic to the first user device or receiving data or traffic from the first user device, by the base station via time-frequency resources allocated to the first user device, including via the group of consecutive time-frequency resources except the one or more previously allocated time-frequency resources.

4. The method of any of claims 1-3, wherein the sending comprises:

sending, by a base station to the first user device, the resource allocation including information identifying: a start time-frequency resource and a number of consecutive time- frequency resources of a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that have been previously allocated via semi-persistent scheduling allocation to a second user device, wherein the time-frequency resources allocated to the first user device include the group of consecutive time-frequency resources except the one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that have been previously allocated to the second user device.

5. The method of any of claims 1-4 and further comprising: allocating, by the base station, the one or more time-frequency resources within the group of consecutive time-frequency resources, to the second user device via semi-persistent scheduling.

6. The method of any of claims 1-5, wherein the group of consecutive time- frequency resources comprises a group of consecutive symbols.

7. The method of any of claims 1-6, wherein the group of consecutive time- frequency resources comprises a group of consecutive symbols for one or more physical resource blocks, wherein each symbol is provided within a slot that includes a plurality of consecutive symbols, and wherein each physical resource block includes a plurality of subcarriers.

8. The method of any of claims 1-7, wherein the sending comprises:

sending, by a base station to the first user device, the resource allocation including information identifying: a start symbol and a number of consecutive symbols of the group of consecutive symbols, and one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated via a semi-persistent scheduling allocation to the second user device.

9. The method of any of claims 1-8, further comprising:

allocating, by the base station, the one or more symbols within the group of consecutive symbols as a recurring or periodic resource, to the second user device via semi- persistent scheduling; and

allocating, by the base station, resources to the first user device including the group of consecutive symbols except the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device and are unavailable to the first user device.

10. The method of claim 9:

wherein the one or more symbols within the group of consecutive symbols allocated as a recurring or periodic resource to the second user device are allocated via semi- persistent scheduling for deterministic or periodic traffic of the second user device; and wherein the resources or symbols allocated to the first user device are allocated for non-deterministic or non-periodic traffic of the first user device.

11. The method of any of claims 6-10 wherein the resource allocation sent by the base station to the first user device comprises:

an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies at least the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device and are not available to the first user device.

12. The method of any of claims 6-11 wherein the resource allocation sent by the base station to the first user device comprises:

an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies:

a start symbol and a number of consecutive symbols of the group of consecutive symbols, and

the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device and are not available to the first user device, wherein the symbols allocated to the first user device include the symbols of the group of consecutive symbols except the one or more previously allocated symbols that have been previously allocated to the second user device.

13. The method of any of claims 1-12, wherein the resource allocation sent by the base station to the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies:

a start symbol that identifies a start of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device.

14. The method of any of claims 1-13, wherein the resource allocation sent by the base station to the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies: a start symbol that identifies a start of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device; and

a number of symbols of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device.

15. The method of any of claims 1-14, wherein the resource allocation sent by the base station to the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies at least one of:

a start physical resource block that identifies a start of physical resource blocks associated with the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device; and

a number of physical resource blocks that identifies a number of physical resource blocks associated with of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device.

16. An apparatus comprising means for performing a method of any of claims 1- 15.

17. An apparatus comprising at least one processor and at least one memory including computer instructions that, when executed by the at least one processor, cause the apparatus to perform a method of any of claims 1-15.

18. An apparatus comprising a computer program product including a non- transitory computer-readable storage medium and storing executable code that, when executed by at least one data processing apparatus, is configured to cause the at least one data processing apparatus to perform a method of any of claims 1-15.

19. A method comprising:

receiving, by a first user device from a base station, a resource allocation including information identifying: a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that are unavailable to the first user device.

20. The method of claim 19 wherein the information identifying one or more previously allocated time-frequency resources comprises information identifying one or more previously allocated time-frequency resources that were allocated by the base station to a second user device via a semi-persistent scheduling allocation.

21. The method of any of claims 19-20 and further comprising:

receiving data or traffic by the first user device or sending data or traffic by the first user device to the base station via time-frequency resources allocated to the first user device, including via the group of consecutive time-frequency resources except the one or more previously allocated time-frequency resources.

22. The method of any of claims 19-21 , wherein the receiving comprises:

receiving, by the first user device from the base station, the resource allocation including information identifying: a start time-frequency resource and a number of consecutive time-frequency resources of a group of consecutive time-frequency resources, and one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that have been previously allocated via semi-persistent scheduling allocation to a second user device, wherein the time-frequency resources allocated to the first user device include the group of consecutive time-frequency resources except the one or more previously allocated time-frequency resources within the group of consecutive time-frequency resources that have been previously allocated to the second user device.

23. The method of any of claims 19-22, wherein the group of consecutive time- frequency resources comprises a group of consecutive symbols.

24. The method of any of claims 19-23, wherein the group of consecutive time- frequency resources comprises a group of consecutive symbols for one or more physical resource blocks, wherein each symbol is provided within a slot that includes a plurality of consecutive symbols, and wherein each physical resource block includes a plurality of subcarriers.

25. The method of any of claims 23-24, wherein the receiving comprises:

receiving, by the first user device from the base station, the resource allocation including information identifying: a start symbol and a number of consecutive symbols of the group of consecutive symbols, and one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated via a semi-persistent scheduling allocation to the second user device.

26. The method of any of claims 23-25:

wherein the one or more previously allocated symbols within the group of consecutive symbols being allocated as a recurring or periodic resource to the second user device via semi-persistent scheduling for deterministic or periodic traffic of the second user device; and wherein the resources or symbols allocated to the first user device are allocated for non-deterministic or non-periodic traffic of the first user device.

27. The method of any of claims 23-26 wherein the resource allocation received by the first user device comprises:

28. The method of any of claims 23-27 wherein the resource allocation received by the first user device comprises:

a start symbol and a number of consecutive symbols of the group of consecutive symbols, and the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device and are not available to the first user device, wherein the symbols allocated to the first user device include the symbols of the group of consecutive symbols except the one or more previously allocated symbols that have been previously allocated to the second user device.

29. The method of any of claims 19-28, wherein the resource allocation received by the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies:

30. The method of any of claims 19-29, wherein the resource allocation received by the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies:

a start symbol that identifies a start of the one or more previously allocated symbols within the group of consecutive symbols that have been previously allocated to the second user device; and

31. The method of any of claims 19-30, wherein the resource allocation received by the first user device comprises an index to an entry to a time domain resource allocation table, wherein the indexed entry of the time domain resource allocation table identifies at least one of:

32. An apparatus comprising means for performing a method of any of claims 19- SI .

33. An apparatus comprising at least one processor and at least one memory including computer instructions that, when executed by the at least one processor, cause the apparatus to perform a method of any of claims 19-31.

34. An apparatus comprising a computer program product including a non- transitory computer-readable storage medium and storing executable code that, when executed by at least one data processing apparatus, is configured to cause the at least one data processing apparatus to perform a method of any of claims 19-31.