TECHNICAL FIELD

The present invention generally relates to uplink scheduling, and in particular to a method, a device, a computer program and a computer program product for uplink scheduling.

BACKGROUND

In 3GPP Release 15 of the 5G or new radio (NR) standard, a single grant configuration within a serving cell can support streams or flows with similar requirements, in particular with regard to periodicity and starting offset. However, in some scenarios, multiple time sensitive network (TSN) streams may be generated at a wireless device. A typical such scenario is in industrial networks, in which a robot as wireless device has several actuators, sensors and monitoring devices that all generate TSN streams. Such multiple streams may differ in their characteristics, such as arrival time, payload size, etc., as is schematically shown in Fig. 1. In Fig. 1 , a first stream 1 has medium size payload in comparison with a second stream 2 having large size payload and a third stream 3 having small size payload. Also, the packets from the first stream 1 arrive at offset zero, followed by the second stream 2 and the third stream 3, which arrive at T and 2T offsets, respectively.

Furthermore, multiple streams can be characterized by different periodicity, latency and reliability requirements, as shown in Fig. 2. Suppose the first stream 1 requires not so critical reliability and latency, whereas both the second stream 2 and the third stream 3 require stringent reliability and latency performance. The grant configurations, including, for instance, modulation and coding scheme (MCS) and repetition/aggregation factor, will then be different for the second and third streams 2, 3 as compared to the first stream 1. Also, the periodicity of the streams 1 , 2, 3 may be different as shown in Fig. 2. Because of the different characteristics, these streams 1 , 2, 3 cannot be supported via a single grant configuration, since the grant will have a single set of configuration parameters, e.g., MCS index, latency, slot period, K-repetition, etc. Hence, in 3GPP Release 15, multiple grant configurations, also referred to as semi-persistent scheduling (SPS) per bandwidth part (BWP), have been proposed to accommodate multiple streams.

On the other hand, the base station in 5G, i.e., the gNB, might allocate multiple overlapping grants, such as a robust configured grant (CG) and a high spectral efficiency dynamic grant (DG), to accommodate such heterogeneous requirements, which are presented by mixed traffic scenarios involving, for instance, ultra-reliable low-latency communication (URLLC) and enhanced mobile broadband (eMBB). On the other hand, intra-user equipment (UE) uplink (UL) grant pre-emption is a technology expected to be included in 3GPP Release 16. Such a technology enables the gNB to guarantee low latency and reliable transmission of the critical traffic, such as URLLC, even if there is a previous physical uplink shared channel (PUSCH) transmission for a grant of high spectral efficiency data, e.g., eMBB, as illustrated in Fig. 3. In Fig. 3, the URLLC traffic is critical while the eMBB traffic is non-critical. As is shown in Fig. 3, even if the non-critical eMMB transmission has been ongoing, once the critical URLLC arrives with overlapping grants, the critical URLLC data will pre-empt, stop or puncture the transmission of the non-critical eMBB data.

Pre-empting eMBB traffic causes dropping the PUSCFI transmission. Given that the grant of eMBB has high spectral efficiency, the number of lost bits is large. For example, assume that a wireless device is transmitting on a grant using 2560AM, i.e., 8 bits per symbol, assuming 100 physical resource blocks (PRBs), 12 sub-carrier per PRB, ¾ coding rate, and 14 orthogonal frequency-division multiplexing (OFDM) symbols (os) per sub-frame. Then the number of lost bits per sub-frame, because of preempting, is about 100.00 Kbit per slot. Assume that the wireless device is a robot, which is transmitting video streaming, while having URLLC aperiodic traffic with random inter-arrival periodicity of 2 msec. Then, such a UE is sacrificing around 20 Mbps transmission because of pre-empting the video transmission for the sake of guaranteeing URLLC requirements.

There is therefore a need for a more efficient uplink scheduling in connection with overlapping grants.

SUMMARY

It is a general objective to provide an uplink scheduling in connection with overlapping grants.

This and other objectives are met by embodiments disclosed herein.

An aspect of the embodiments relates to a method of uplink scheduling for a wireless device having a grant for transmission of high-priority data at least partly overlapping a grant for transmission of low- priority data. The high-priority data has higher priority for transmission than the low-priority data, and the grant for transmission of the low-priority data covers at least a portion of a slot. The method comprises re-scheduling transmission of the low-priority data if a probability that the wireless device has high-priority data for transmission at the grant for transmission of the high-priority data exceeds a probability threshold. The re-scheduling comprises allocating, for transmission of the low-priority data, at least one first mini- slot within the at least a portion of the slot but outside of a range of at least one second mini-slot predicted for transmission of the high-priority data. The range of the at least one second mini-slot is within the at least a portion of the slot. Another aspect of the embodiments relates to a scheduling device for uplink scheduling for a wireless device having a grant for transmission of high-priority data at least partly overlapping a grant for transmission of low-priority data. The high-priority data has higher priority for transmission than the low- priority data, and the grant for transmission of the low-priority data covers at least a portion of a slot. The scheduling device is configured to re-schedule transmission of the low-priority data if a probability that the wireless device has high-priority data for transmission at the grant for transmission of the high-priority data exceeds a probability threshold. In particular, the scheduling device is configured to re-schedule transmission by allocating, for transmission of the low-priority data, at least one first mini-slot within the at least a portion of the slot but outside of a range of at least one second mini-slot predicted for transmission of the high-priority data. The range of the at least one second mini-slot is within the at least a portion of the slot.

A further aspect of the embodiments relates to a computer program comprising instructions, which when executed by at least one processor, cause the at least one processor to re-schedule transmission of low- priority data if a probability that a wireless device has high-priority data for transmission at a grant for transmission of the high-priority data exceeds a probability threshold. The wireless device has the grant for transmission of high-priority data at least partly overlapping a grant for transmission of the low-priority data. The high-priority data has higher priority for transmission than the low-priority data, and the grant for transmission of the low-priority data covers at least a portion of a slot. The at least one processor is caused to re-schedule transmission by allocating, for transmission of the low-priority data, at least one first mini-slot within the at least a portion of the slot but outside of a range of at least one second minislot predicted for transmission of the high-priority data. The range of the at least one second mini-slot is within the at least a portion of the slot.

Yet another aspect of the embodiments relates to a computer program product having stored thereon a computer program comprising instructions which, when executed on at least one processor, cause the at least one processor to re-schedule transmission of low-priority data if a probability that a wireless device has high-priority data for transmission at a grant for transmission of the high-priority data exceeds a probability threshold. The wireless device has the grant for transmission of high-priority data at least partly overlapping a grant for transmission of the low-priority data. The high-priority data has higher priority for transmission than the low-priority data, and the grant for transmission of the low-priority data covers at least a portion of a slot. The at least one processor is caused to re-schedule transmission by allocating, for transmission of the low-priority data, at least one first mini-slot within the at least a portion of the slot but outside of a range of at least one second mini-slot predicted for transmission of the high- priority data. The range of the at least one second mini-slot is within the at least a portion of the slot.

The present invention provides an efficient uplink scheduling in connection with overlapping grants. In more detail, the present invention enables a wireless device to more efficiently utilize communication resources by re-scheduling transmission of the low-priority data to allocate resources for transmissions of both high-priority data and low-priority data within a scheduled slot or a portion thereof. This rescheduling and resource allocation thereby avoid pre-emptying any ongoing transmission of low-priority data when a granted transmission of high-priority data overlaps the granted transmission of the low- priority data. As a consequence, latency and reliability requirements of the high-priority data can be maintained while increasing the spectral efficiency of transmissions of low-priority data in cases of overlapping grants.

BRIEF DESCRIPTION OF THE DRAWINGS

The embodiments, together with further objects and advantages thereof, may best be understood by making reference to the following description taken together with the accompanying drawings, in which:

Fig. 1 schematically illustrates multiple streams with different characteristics generated at a wireless device;

Fig. 2 schematically illustrates multiple streams with different characteristics generated at a wireless device;

Fig. 3 schematically illustrates grant pre-emption at a wireless device;

Fig. 4 is a flow chart illustrating a method of uplink scheduling according to an embodiment;

Figs. 5A and 5B schematically illustrate slot-based or type A scheduling (Fig. 5A) and mini-slot-based or type B scheduling (Fig. 5B);

Fig. 6 illustrates a grant for low-priority data at a slot; Figs. 7 A to 7D illustrate various embodiments of overlapping grants and re-scheduling transmission of low-priority data; Fig. 8 is a flow chart illustrating an additional, optional step of the method shown in Fig. 4 according to an embodiment;

Fig. 9 is a flow chart illustrating an additional, optional step of the method shown in Fig. 4 according to another embodiment;

Fig. 10 is a flow chart illustrating an additional, optional step of the method shown in Fig. 4 according to a further embodiment;

Fig. 1 1 is a flow chart illustrating an additional, optional step of the method shown in Fig. 4 according to yet another embodiment;

Fig. 12 is a flow chart illustrating additional, optional steps of the method shown in Fig. 4 according to an embodiment; Fig. 13 is a flow chart illustrating additional, optional steps of the method shown in Fig. 4 according to another embodiment;

Fig. 14 is a flow chart illustrating an additional, optional step of the method shown in Fig. 4 according to an embodiment;

Fig. 15 is a flow chart illustrating an additional, optional step of the method shown in Fig. 4 according to another embodiment;

Fig. 16 schematically illustrates predicted transmissions of high-priority data;

Fig. 17 is a block diagram of a scheduling device according to an embodiment;

Fig. 18 is a block diagram of a scheduling device according to another embodiment; Fig. 19 is a block diagram of a scheduling device according to a further embodiment;

Fig. 20 schematically illustrates a computer program based implementation of an embodiment; Fig. 21 is a block diagram of a scheduling device according to another embodiment;

Fig. 22 schematically illustrates implementation of a scheduling device in a network node;

Fig. 23 schematically illustrates implementation of a scheduling device in a wireless device; and

Fig. 24 schematically illustrates implementation of a scheduling device in one or more network devices.

DETAILED DESCRIPTION

Throughout the drawings, the same reference numbers are used for similar or corresponding elements.

The present invention generally relates to uplink scheduling, and in particular to scheduling uplink traffic for a wireless device having at least partly overlapping grants for transmission of data. Such overlapping grants for transmission of data may cause, as is shown in Fig. 3, pre-emptying traffic and thereby stopping an ongoing transmission of data, e.g., enhanced mobile broadband (eMBB) data, if there is high priority data, e.g., ultra-reliable low-latency communication (URLLC) data, available for transmission at the wireless device at the time of grant for transmission of the high priority data. Such pre-emptying is an important process to enable the wireless device to guarantee low latency and reliable transmission of critical data even if there is a previous and ongoing transmission of less critical data. However, preemptying an ongoing transmission causes loss of a significant amount of transmission opportunities and thereby requires the wireless device to retransmit the data that was lost due to pre-emptying.

The uplink scheduling of the present embodiments achieves a more efficient resource utilization in situations with overlapping grants to thereby maintain latency and reliability requirements of critical traffic while at the same time enable the wireless device to transmit non-critical data at the grant. The embodiments of the present invention thereby solves, among others, the problem of pre-emptying the ongoing eMMB transmission in the case of overlapping eMBB and URLLC grants as shown in Fig. 3.

Fig. 4 is flow chart illustrating a method of uplink scheduling for a wireless device according to an embodiment. The wireless device has a grant for transmission of high-priority data at least partly overlapping a grant for transmission of low-priority data. The high-priority data has higher priority for transmission than the low-priority data. The grant for transmission of the low-priority data covers at least a portion of a slot. The method comprises re-scheduling, in step S2, transmission of the low-priority data if a probability (P) that the wireless device has high-priority data for transmission at the grant for transmission of the high priority data exceeds a probability threshold (T). The re-scheduling in step S2 comprises allocating, in step S3 and for transmission of the low-priority data, at least one first mini-slot within the at least a portion of the slot but outside of a range of at least one second mini-slot predicted for transmission of the high priority data. The range of the at least one second mini-slot is within the at least a portion of the slot.

The wireless device thereby has at least partly overlapping grants for transmission of high-priority and low-priority data. These grants could be so-called configured grants (CGs), dynamic grants (DGs) or a combination of CG and DG. High-priority data vs. low-priority data as used herein refers to the relative priority of data transmission. In other words, the high-priority data has higher priority for transmission than the low-priority data. This higher priority may, for instance, be due to requirements with regard to latency, i.e., low latency, whereas the low-priority data may have higher latency tolerance. Low-priority should therefore not necessarily be interpreted as data with very low priority but rather that the priority for transmission of the low-priority data is lower than the priority for transmission of the high-priority data. A typical example of high-priority data is URLLC with eMMB as an illustrative example of low-priority data. The embodiments are, however, not limited to these illustrative examples but apply to any situation where a wireless device has at least partly overlapping grants for transmission and where these overlapping grants, such as CG(s) and/or DG(s), relate to data or traffic with different requirements, such as in terms of latency, reliability, etc., and therefore have different priorities for transmission. The grant for transmission of the low-priority data covers at least a portion of a slot. NR or 5G frame structure defines a frame, also referred to as radio frame, of 10 ms duration and consisting of 10 subframes, each with a duration of 1 ms. Each subframe consists of 2^ slots, also referred to as time slots, of 14 orthogonal frequency division multiplexing (OFDM) symbols (os) each, wherein m = 0, 1 , ..., 4. Hence, in NR or 5G a slot consists of 14 os. The corresponding frame structure used in Long-Term Evolution (LTE) or 4G is a frame of 10 ms duration and consisting of 10 subframes, each with a duration of 1 ms. Each sub-frame consists of two slots of 6 or 7 os each.

Mini-slot as used herein corresponds to a portion of a slot, i.e., from 1 os up to 13 os in the case of NR frame structure. Such a mini-slot transmission implies that data transmission can start at any symbol within a slot and last only as many symbols as needed for the communication. Mini-slot transmission can, thus, facilitate very low latency for critical data. Fig. 5B illustrates the concept of mini-slots, in which the 14 os of a slot are divided into multiple mini-slots. For instance, the first slot in Fig. 5B is divided into a first mini-slot of 2 os, a second mini-slot of 2 os, a third mini-slot of 3 os and a fourth mini-slot of 7 os. These different mini-slots can then be used for different traffic or data types as schematically indicated by the different hatchings in Fig. 5B. This type of scheduling using mini-slots are often referred to as type B scheduling or mini-slot-based scheduling. In a particular embodiment, a mini-slot defines the resource allocation in the time domain for transmission of data, such as a transport block. A mini-slot may be defined within a slot relative to the start of the slot and has a duration in terms of a number of symbols, preferably a duration in terms of a number of consecutive symbols. For instance, a mini-slot may be defined by the parameters S and L, wherein S defines the starting symbol of the mini-slot relative to the start of the slot and L defines the number of symbols, preferably consecutive symbols, counting from the symbol S. Fig. 6 illustrates a grant for transmission of the low-priority data as represented by eMBB data covering a full slot 10, i.e., 14 os. This is a typical example, in which the grant for transmission of the low-priority data covers the whole slot 10. This corresponds to so-called type A scheduling or slot-based scheduling, which is also illustrated in Fig. 5A. In such type A scheduling, one or multiple, i.e., at least two, slots are scheduled for transmission of the low-priority data. The embodiments are, however, not limited thereto. For instance, the grant for transmission of the low-priority data could constitute merely a portion of the slot and then in particular an initial portion of the slot, i.e., the first N symbols of the slot, wherein N is from 1 up to 13. In such a case, the wireless device has a grant for transmission of the low-priority data corresponding to the N first symbols of the slot 10. Furthermore, the grant for transmission of the low- priority data could cover multiple slots 10, such as multiple consecutive slots 10. In such a case, the grant overlap may occur in one or more of these multiple slots 10. In such a case, the re-scheduling as disclosed herein is preferably only applied to the slot(s) of these multiple slots where there are overlapping grants.

The re-scheduling in step S2 is performed if the probability (P) exceeds the probability threshold (T) as schematically shown in step S1 in Fig. 4. In such a case, there is sufficiently high probability that the wireless device has high-priority data for transmission at the grant for transmission of the high-priority data. In other words, the re-scheduling in step S2 is preferably only performed if this probability is sufficiently high, i.e., higher than the probability threshold. Thus, there might be a situation, in which the wireless device has overlapping grants for transmission of high-priority data and low-priority data but the probability that the wireless device has any high-priority data for transmission at the grant is low, i.e., equal to or lower than the probability threshold. In such a situation, the overlapping grants will most likely not lead to any problems with regard to pre-emptying the transmission of the low-priority data since the wireless device will not have any high-priority data to transmit at the grant for transmission of the high- priority data.

A grant for transmission of data therefore does not automatically imply that the wireless device will transmit any data. The grant rather specifies that the wireless device is allowed to transmit data if the wireless device has any data as specified in the grant to transmit at the time period defined in the grant. For instance, a wireless device may have an eMBB DG defining a slot for transmission of eMBB data and an overlapping URLLC CG defining a mini-slot for transmission of URLLC data. If the probability that the wireless device has URLLC data for transmission at the URLLC CG exceeds the probability threshold then there is a high risk of pre-emptying the eMBB transmission and the re-scheduling in step S2 should be performed. However, if the probability is instead below the probability threshold it is unlikely that there will be any eMBB pre-emptying and no re-scheduling is therefore needed.

The re-scheduling of step S2 comprises allocating at least one first mini-slot within the at least a portion of the slot for transmission of the low-priority data and allocating a predicted range of at least one second mini-slot for transmission of the high-priority data. The at least one first mini-slot for transmission of the low-priority data and the at least one second mini-slot for transmission of the high-priority data are both within the at least a portion of the slot and are not overlapping, i.e., encompass different symbols of the at least a portion of the slot. First and second as used herein with regard to the at least one mini-slot define that the mini-slots are different mini-slots and thereby different symbols within the slot or the portion thereof. First and second do not necessarily mean that the at least one first mini-slot precedes the at least one second mini-slot within the slot, see for instance Fig. 7C.

Fig. 7A illustrates overlapping grants and re-scheduling transmission of low-priority data according to an embodiment. In this embodiment and also the ones shown in Figs. 7B to 7D, the high-priority data is represented by URLLC data, the low-priority data is represented by eMBB data and the eMBB grant covers a complete slot 10 as shown in Fig. 6. In the embodiment shown in Fig. 7A, the re-scheduling in step S2 comprises allocating, in step S3, six initial mini-slots 1 1 , each of one symbol, and six following mini-slots 13, each of one symbol for transmission of the eMBB data with two intermediate mini-slots 12, each of one symbol, for transmission of the URLLC data. The re-scheduling divides the slot into 14 minislots, each of one symbol. The eMBB data is transmitted on the first six and the last six mini-slots 1 1 , 13 with the transmission of the URLLC data taking place on symbol number seven and eight 12 in the slot 10. As compared to the situation in Fig. 6, with no overlapping grants, the re-scheduling allocates 12 of the 14 symbols in the slot 10 for eMBB transmission rather than all 14 symbols as in Fig. 6. Flowever, although not all symbols within the slot 10 and within the eMBB grant can be used for transmission of eMBB data, the re-scheduling still enables eMBB transmission using, in this example, 12 out of 14 symbols. This should be compared to the prior art situation, in which the transmission of the eMBB data would be stopped at the URLLC grant implying that no eMBB data at all would be successfully received at the network node due to pre-emptying the eMBB transmission. The embodiment as shown in Fig. 7A provides high flexibility by individually allocating symbols as minislots. A limitation with such an embodiment is, however, extra overhead for each mini-slot, such as in the form of demodulated reference signal (DMRS) overhead. Fig. 7B illustrates another embodiment with comparatively less overhead. This embodiment has the same overlapping grants as in Fig. 7A. However, the re-scheduling in step S2 instead allocates a first mini-slot 11 corresponding to the first six symbols in the slot 10 and a second mini-slot 13 corresponding to the last six symbols in the slot 10 for transmission of the eMBB data and allocates an intermediate mini-slot 12 of two symbols for transmission of the URLLC data. The spectral efficiency of, in particular, the eMBB transmission will be higher in this embodiment as compared to Fig. 7A by requiring less overhead. In Figs. 7A and 7B, the URLLC grant overlaps the eMBB grant somewhere in the middle of the eMBB grant. The embodiments are, however, not limited thereto. Figs. 7C and 7D illustrate other examples of possible situations with overlapping grants. In Fig. 7C, the two overlapping grants start at the beginning of the slot 10. In this embodiment, the re-scheduling allocates an initial mini-slot 12 of at least one symbol for transmission of the URLLC data and allocates a following mini-slot 1 1 of the remaining symbols in the slot 10 for transmission of the eMBB data. In Fig. 7D, the two overlapping grants stops at the end of the slot 10. In this embodiment, the re-scheduling allocates an initial mini-slot 1 1 of symbol number 1 to /W in the slot 10 for transmission of the eMBB data and a following mini-slot 12 of symbol number M+1 to 14 in the slot 10 for transmission of the URLLC data, wherein M is an integer equal to or larger than 2 but equal to or smaller than 13.

In an embodiment, the method comprises an additional step S1 as shown in Fig. 4. This step S1 comprises comparing the probability (P) with the probability threshold (T). Step S1 also comprises determining, if the probability exceeds the probability threshold (P>T), to re-schedule transmission of the low-priority data from the at least a portion of the slot to the at least one first mini-slot within the at least a portion of the slot but outside of the range of the at least one second mini-slot. Hence, if the comparison indicates that P>T, then the method continues from step S1 to step S2. However, if P£T, no re-scheduling is deemed necessary and the method ends. Fig. 8 is a flow chart illustrating an additional step of the method shown in Fig. 4 according to an embodiment. The method continues from the optional step S1 in Fig. 4. A next step S10 comprises dividing the at least a portion of the slot into an initial number of symbols. In this embodiment, step S2 in Fig. 4 comprises allocating, in step S3, a first number of symbols for transmission of the low-priority data and allocating a second number of symbols for transmission of the high-priority data. The initial number of symbols is equal to the first number of symbols plus the second number of symbols. Thus, if the grant for transmission of the low-priority data encompassed N symbols within a slot, then step S3 allocates NL symbols for transmission of the low-priority data and Wwsymbols for transmission of the high-priority data, wherein NL + NH = N. In the embodiments as shown in Figs. 7A and 7B, step S3 comprises allocating a first preceding number of symbols [Nu) and a first following number of symbols [NL2) for transmission of the low-priority data and allocating the second number of symbols [NH) for transmission of the high-priority data. The first number of symbols [NL) is equal to the first preceding number of symbols and the first following number of symbols, i.e., Nu + NL2 = NL In these embodiments, the first preceding number of symbols precedes the second number of symbols in the at least a portion of the slot and the first following number of symbols follows the second number of symbols in the at least a portion of the slot.

In an embodiment, the wireless device is arranged for performing grant pre-emption by stopping or preemptying an ongoing transmission of low-priority data if a grant for transmission of high-priority data overlaps with the grant for transmission of the low-priority data and if the high-priority data is available at the wireless device for transmission at the grant for transmission of the high-priority data. The present invention, however, solves the problem caused by pre-emptying in the case of overlapping grants by rescheduling the transmission of the low-priority data. Consequently, no pre-emptying of the transmission of the low-priority data is needed. In an embodiment, the method may therefore comprise an additional step S20 as shown in Fig. 9. This step S20 comprises at least temporarily disabling grant pre-emption. Thus, the re-scheduling of the embodiments overrides the pre-emptying to thereby not stop any transmission of low-priority data. The method then continues to step S1 or S2 in Fig. 4. The probability that is compared to the probability threshold represents a probability that the wireless device has high-priority data for transmission at the grant for transmission of high-priority data. In an embodiment, this probability represents a probability that the wireless device has high-priority data at or arriving at logical channels in a medium access control (MAC) layer for transmission at the grant for transmission of the high-priority data. Thus, in such an embodiment, the probability represents the likelihood that there is high-priority data at the logical channels at the wireless device at the point in time corresponding to the start of the grant for transmission of the high-priority data. This embodiment allows for a more efficient timing of the prediction in order to be able to perform the re-scheduling prior to transmitting the low-priority data and thereby prior to running into the risk of pre-emption. In another embodiment, the probability represents a probability that the wireless device has high-priority data at or arriving at a transmit buffer of the wireless device.

It is evident by comparing Figs. 7A to 7D with Fig. 6 that the overlapping grants and the re-scheduling of transmission of the low-priority data means that less symbols (os) are allocated for transmission of the low-priority data in Figs. 7A to 7D with overlapping grants as compared to the situation in Fig. 6 where there is no overlapping grants. This means that less amount of low-priority data can be transmitted during the grant in Figs. 7A to 7D as compared to during the grant in Fig. 6, unless the grant configuration parameters are updated. This would then lead to a reduced spectral efficiency as compared to the situation in Fig. 6, but still significantly higher spectral efficiency as compared to the prior art situation with pre-emptying as shown in Fig. 3.

Fig. 10 is a flow chart illustrating an additional step of the method in Fig. 4 that can increase the spectral efficiency of the transmission of the low-priority data even in situations with overlapping grants, such as shown in Figs. 7A to 7D. In this embodiment, the grant for transmission of the low-priority data specifies an initial modulation and coding scheme (MCS) for the low-priority data. The method continues from step S2 in Fig. 4. A next step S30 as shown in Fig. 10 comprises selecting, if the probability exceeds the probability threshold, another MCS for the low-priority data having higher spectral efficiency than the initial MCS. Grants define a number of configuration parameters, such as latency, slot period, K-repetition and MCS. The grant for transmission of the low-priority data therefore specifies an initial MCS, such as in the form of an initial MCS index. Selecting another MCS for the low-priority data in step S30 that has a higher spectral efficiency than the initial MCS can at least partly compensate for the reduced number of symbols available for transmission of the low-priority data following the re-scheduling in step S2 of Fig. 4. Thus, in such a case another MCS than the one as specified in the grant for transmission of the low-priority data is selected to be used for the low-priority data to be transmitted on the at least one first mini-slot 1 1 , 13 within the at least a portion of the slot 10. In a particular embodiment, step S30 comprises selecting another MCS for the low-priority data having higher MCS index than the initial MCS. Generally, the higher the MCS index of the MCS, the higher data rate and thereby the spectral efficiency. Thus, in another particular embodiment, step S30 comprises selecting another MCS for the low-priority data having or supporting a higher data rate than the initial MCS.

In an embodiment, the at least one second mini-slot for transmission of the high-priority data could be selected to correspond to the duration of the grant for transmission of the high-priority data. This means that transmission of the low-priority data can only take place within the at least portion of the slot that is outside of this grant duration. Such a solution may, however, reduce the spectral efficiency more than necessary if, for instance, the amount of high-priority data to be transmitted at the grant is sufficiently small to not need the full duration of the grant. For instance, assume that the grant for transmission of high-priority data specifies that symbol numbers 3 to 6 within a slot of 14 symbols could be used for transmission of the high-priority data but the transmission of the high-priority data can be achieved in merely two of these four symbols using the configuration parameters as specified in the grant. This would then imply that the wireless device will not transmit any data, i.e., neither high-priority data nor low-priority data, at all at two of the symbols within the slot. This is not an efficient utilization of the transmission resources.

Embodiments of the present invention can solve such problems with spectral efficiency by predicting the range of the at least one second mini-slot that will be used for transmission of the high-priority data. This predicted range could constitute the full duration of the grant for transmission of the high-priority data but may in other situations correspond to merely a portion of the duration of the grant. This means that any remaining portion of the duration of the grant could then instead be allocated for transmission of the low- priority data to thereby increase the spectral efficiency for the low-priority data. In the above-mentioned example, the range of the at least one second mini-slot predicted for transmission of the high-priority data could then be symbol numbers 3 to 4, whereas remaining symbols within the slot, including symbol numbers 5 to 6 could be used for transmission of the low-priority data.

Fig. 11 is flow chart illustrating an embodiment for predicting the range of the at least one second minislot. The method comprises predicting, in step S40, the range of the at least one second mini-slot predicted for transmission of the high-priority data by predicting a starting symbol and an ending symbol within the at least a portion of the slot or by predicting the starting symbol and a transmission duration of the high-priority data. The method then continues to step S1 or S2 in Fig. 4. This embodiment therefore involves performing the predication preferably at the same node or device that performs the re-scheduling in Fig. 4.

Fig. 13 is a flow chart illustrating another embodiment where the prediction is done at the wireless device. This embodiment comprises receiving, in step S60 and from the wireless device, a notification of a starting symbol and an ending symbol within the at least a portion of the slot or the starting symbol and a transmission duration of the high-priority data. A next step S61 comprises determining the range of the at least one second mini-slot predicted for transmission of the high-priority data based on the starting symbol and the ending symbol or based on the starting symbol and the transmission duration. The method then continues to step S1 or S2 in Fig. 4.

It is also possible to combine the embodiments described above in connection with Figs. 1 1 and 13. In such an embodiment, the range of the at least one second mini-slot could be determined based on the predicted range from step S40 and based on the notification received in step S60. For instance, the starting symbol and the ending symbol or the starting symbol and the transmission duration could be determined as an average or weighted average, as illustrative but non-limiting examples, of the starting and ending symbols or the starting symbol and transmission duration obtain in steps S40 and S61.

According to the invention, prediction models built using machine learning (ML) can be used to determine the probability that the wireless device has high-priority data for transmission at the grant for transmission of the high-priority data and predict the starting and ending symbols or the starting symbol and the transmission duration for the high-priority data. The prediction models can be built and trained on history of delay critical data transmissions at the wireless device, i.e., past transmissions of high-priority data. Various parameters could be input into the prediction models including, for instance, packet inter arrival time, number of data packets, total bytes of high-priority data, packet sizes, time since last packet, packet protocols, device type of the wireless device, manufacturer of the wireless device, logical channel identity, historical buffer status reports, sequence of n last arrival times for a logical channel for some value of n, sequence of n last packet sizes for a logical channel, etc.

The prediction models could be based on recurrent neural network (RNN), long short term memory (LSTM), gated recurrent unit (GRU), convolution neural network (CNN) as illustrative but non-limiting examples. A first such prediction model could then be used to predict the probability that the wireless device has high-priority data for transmission at the grant for transmission of the high-priority data, whereas a second prediction model is used to predict the starting and ending symbols or the starting symbol and the transmission duration for the high-priority data. In another embodiment, a single prediction model is used to both predict the probability and the starting and ending symbols or the starting symbol and the transmission duration.

Fig. 16 graphically illustrates outputs from such prediction models. The figure illustrates probability densities over time. These probability densities correspond to probabilities that the wireless device has high-priority data for transmission. The width of the peaks above the probability threshold (T) could then be used to define the starting and ending symbols or the starting symbol and the transmission durations as indicated in the figure. Fig. 12 is a flow chart illustrating embodiments of determining the probability that the wireless device has high-priority data for transmission. In an embodiment, information of past uplink transmissions of high- priority data at the wireless device is collected in step S50. A next step S51 comprises determining, based on the collected information, the probability that the wireless device has high-priority data for transmission at the grant for transmission of high-priority data. This embodiment thereby involves collecting information of past uplink transmissions of the high-priority data originating from the wireless device. This collected information can then be input into the above described prediction model to determine the probability in step S51.

In another embodiment, step S50 comprises receiving information of past uplink transmissions of high- priority data from the wireless device. The next step S51 comprises determining, based on the received information, the probability that the wireless device has high-priority data for transmission at the grant for transmission of high-priority data. In this embodiment, the wireless device collects the information and transmits it to a device or node that performs the prediction and determination of the probability. In either embodiment, the method continues to step S1 or S2 in Fig. 4.

It is also possible to combine the above described embodiments. For instance, the probability could be determined based on both collected information and received information. Fig. 14 is a flow chart illustrating a further embodiment of determining the probability. This embodiment comprises receiving, in step S70 and from the wireless device, the probability that the wireless device has high-priority data for transmission at the grant for transmission of the high-priority data. In this embodiment, the probability is determined by the wireless device based on information of past uplink transmissions of high-priority data at the wireless device. The method then continues to step S1 or S2 in Fig. 4. Flence, in this embodiment, the wireless device itself performs the prediction of the probability and sends information thereof, i.e., the probability value, to the device or node performing the re-scheduling.

It is also possible to combine the embodiments described above in connection with Figs. 12 and 14. In such an embodiment, the probability could be determined based on the probability determined in step S51 and the probability received in step S70. For instance, the probability could be determined as an average or weighted average, as illustrative but non-limiting examples, of the probability determined in step S51 and the probability received in step S70. In an embodiment, the grant for transmission of the high-priority data on a physical uplink shared channel is at least partly overlapping the grant for transmission of the low-priority data on a physical uplink shared channel using a same uplink carrier. For instance, the grant for transmission of the high-priority data could be a grant specifying a high-priority data physical uplink shared channel (PUSCH), such as an URLLC PUSCH, and the grant for transmission of the low-priority data could be a grant specifying a low- priority PUSCH, such as an eMBB PUSCFI. These PUSCFIes use a same uplink carrier.

In NR or 5G, a NR carrier contains up to 3300 subcarriers and currently at most 400 MFIz bandwidth. 12 consecutive carriers in the frequency domain corresponds to a resource block (RB). NR adopts flexible subcarrier spacing of 2^x15 kHz.

Flence, the eMBB PUSCFI and the URLLC PUSCFI in the above example with overlapping eMBB and URLLC grants are of a same NR uplink carrier.

In an embodiment, the transmission of the low-priority data is initially of a scheduling type A allocating all 14 symbols of the slot for transmission at the grant for transmission of the low priority data. In this embodiment, step S2 in Fig. 4 comprises scheduling type B transmission of the low-priority data if the probability exceeds the probability threshold. This step S2 comprises allocating, in step S3, a portion of the 14 symbols for transmission of the low-priority data and a different portion of the 14 symbols for transmission of the high-priority data. Hence, in this embodiment, the re-scheduling involves switching from an original type A or slot-based scheduling for the low-priority data into a type B or mini-slot-based scheduling. This change of scheduling type enables assigning communication resources, i.e., symbols, to both the low-priority data and the high-priority data within the at least a portion of the slot and thereby enables transmissions of the low- priority and high-priority data within the respective grants without any transmission pre-emptying.

In an embodiment, step S2 in Fig. 4 comprises re-scheduling transmission of eMMB data if the probability that the wireless device has URLLC data for transmission at a URLLC grant exceeds the probability threshold. In such an embodiment, step S2 comprises allocating, in step S3 and for transmission of the eMMB data, at least one first mini-slot within the at least a portion of the slot but outside of a PUSCH boundary of at least one second mini-slot predicted for transmission of the URLLC data. The PUSCH boundary is within the at least a portion of the slot. The method of uplink scheduling as described herein can be implemented and performed in various network-connected devices and nodes. For instance, the method can be implemented in and performed by the wireless device. In such a case, the wireless device preferably sends information of the rescheduling, such as information of the mini-slots allocated in step S3, to the serving cell, i.e., to the network node of the serving cell. This information may, for instance, be sent as part of feedback information in response to downlink control information (DCI).

As used herein, the non-limiting terms wireless device (WD) or user equipment (UE) may refer to a mobile phone, a cellular phone, a Personal Digital Assistant (PDA) equipped with radio communication capabilities, a smart phone, a laptop or Personal Computer (PC) equipped with an internal or external mobile broadband modem, a tablet with radio communication capabilities, a target device, a machine-to- machine (M2M) device, a machine type communication (MTC) device, an Internet of thing (loT) device, a device-to-device (D2D) WD or UE, a machine type WD or UE or WD or UE capable of machine to machine communication, customer premises equipment (CPE), laptop embedded equipment (LEE), laptop mounted equipment (LME), universal serial bus (USB) dongle, a portable electronic radio communication device, and/or a sensor device, meter, vehicle, household appliance, medical appliance, camera, television, radio, lightning arrangement and so forth equipped with radio communication capabilities or the like. In particular, the term wireless device should be interpreted as a non-limiting term comprising any type of wireless device communicating with a network node in a wireless communication system and/or possibly communicating directly with another wireless device. In other words, a wireless device may be any device equipped with circuitry for wireless communication according to any relevant standard for communication, including, but not limited to, 5G or NR.

As used herein, the non-limiting term network node may refer to base stations, access points, network control nodes, such as network controllers, radio network controllers, base station controllers, access controllers, and the like. In particular, the term base station may encompass different types of radio base stations, including standardized base station functions, such as Node Bs (NBs), evolved Node Bs (eNBs), gNodeBs (gNBs), and also macro/micro/pico radio base stations, home base stations, also known as femto base stations, relay nodes, repeaters, radio access points, base transceiver stations (BTSs), and even radio control nodes controlling one or more remote radio units (RRUs), or the like.

In a preferred embodiment, the method of uplink scheduling is implemented and performed by a network node or device arranged in or connected to such a network node. In such a case, the network node preferably sends information of the re-scheduling, such as information of the mini-slots allocated in step S3, to the wireless device as illustrated in the flow chart of Fig. 15. The method continues from step S2 in Fig. 4. A next step S80 comprises transmitting, to the wireless device, re-scheduling information defining the allocation of the least one first mini-slot and the range of the at least one second mini-slot.

This embodiment therefore involves transmitting information of the re-scheduling to the wireless device to thereby be used therein when transmitting the high-priority and low-priority data using the allocated mini-slots.

The information could be part of the scheduling DCI sent to the wireless device. For instance, a new field can be included in the scheduling DCI, such as in the form of a bitmap indicating symbols predicted to have high-priority data and thereby cannot be used for transmission of low-priority data. In such a case, step S80 comprises transmitting, to the wireless device, the re-scheduling information in DCI, such as in a field in the DCI.

Alternatively, the information can be sent in the form of a message indicating the start and length, such as in terms of os, of the range of the at least one mini-slot within the scheduled slot or the portion thereof.

The wireless device can then use the received information for transmitting PUSCFI by rate-matching the uplink transmission of low-priority data, such as eMBB, around the range of the at least one second minislot to be used for uplink transmission of high-priority data, such as URLLC. Such rate-matching can be performed in the time domain as disclosed herein. The rate-matching may also be performed in the frequency domain by allocating a portion of the scheduled bandwidth or subcarriers to the low-priority data and a remaining portion of the scheduled bandwidth or subcarriers to the high-priority data. It is also possible to have a distributed implementation between a network node and the wireless device. For instance, the re-scheduling could be performed in the network node, whereas the prediction of the probability and/or the prediction of the starting and ending symbols or the starting symbol and the transmission duration of the high-priority data is performed in the wireless device. Control data related to the high-priority data and the low-priority data, respectively, is preferably multiplexed on the respective uplink channel, such as PUSCH. For instance, MAC control element (CE) and uplink control information (UCI) related to the high-priority data, including, for instance, buffer status report (BSR), power headroom report (PHR), grant confirmation, etc., is preferably multiplexed on the high-priority data transmission, e.g., the URLLC PUSCFI. Correspondingly, the MAC CE and UCI related to the low-priority data is preferably multiplexed on the low-priority data transmission, e.g., the eMMB PUSCFI, and is thereby outside of the range of the at least one second mini-slot for the high-priority data transmission.

Another aspect of the embodiments relates to a scheduling device for uplink scheduling for a wireless device having a grant for transmission of high-priority data at least partly overlapping a grant for transmission of low-priority data. The high-priority data has higher priority for transmission than the low- priority data, and the grant for transmission of the low-priority data covers at least a portion of a slot. The scheduling device is configured to re-schedule transmission of the low-priority data if a probability that the wireless device has high-priority data for transmission at the grant for transmission of the high-priority data exceeds a probability threshold. The scheduling device is configured to re-schedule transmission by allocating, for transmission of the low-priority data, at least one first mini-slot within the at least a portion of the slot but outside of a range of at least one second mini-slot predicted for transmission of the high-priority data. The range of the at least one second mini-slot is within the at least a portion of the slot. In an embodiment, the scheduling device is configured to compare the probability with the probability threshold. In this embodiment, the scheduling device is also configured to determine, if the probability exceeds the probability threshold, to re-schedule transmission of the low-priority data from the at least a portion of the slot to the at least one first mini-slot within the at least a portion of the slot but outside of the range of the at least one second mini-slot. In an embodiment, the scheduling device is configured to divide the at least a portion of the slot into an initial number of symbols. The scheduling device is also configured to allocate a first number of symbols for transmission of the low-priority data and allocate a second number of symbols for transmission of the high-priority data. In this embodiment, the initial number of symbols is equal to the first number of symbols plus the second number of symbols.

In an embodiment, the scheduling device is configured to allocate a first preceding number of symbols and a first following number of symbols for transmission of the low-priority data and allocate the second number of symbols for transmission of the high-priority data. In this embodiment, the first number of symbols is equal to the first preceding number of symbols and the first following number of symbols and the first preceding number of symbols precedes the second number of symbols in the at least a portion of the slot and the first following number of symbols follows the second number of symbols in the at least a portion of the slot.

In an embodiment, the wireless device is arranged for performing grant pre-emption by stopping an ongoing transmission of low-priority data if a grant for transmission of the high-priority data overlaps with the grant for transmission of the low-priority data and if the high-priority data is available at the wireless device for transmission at the grant for transmission of the high-priority data. The scheduling device is, in this embodiment, configured to generate an instruction of at least temporarily disabling grant preemption at the wireless device.

In an embodiment, the scheduling device is configured to re-schedule transmission of the low-priority data if a probability that the wireless device has high-priority data at or arriving at logical channels in MAC layer for transmission at the grant for transmission of the high-priority data exceeds the probability threshold.

In an embodiment, the grant for transmission of the low-priority data specifies an initial MCS for the low- priority data. In such an embodiment, the scheduling device is configured to select, if the probability exceeds the probability threshold, another MCS for the low-priority data having higher spectral efficiency than the initial MCS.

In an embodiment, the scheduling device is configured to predict the range of the at least one second mini-slot predicted for transmission of the high-priority data by predicting a starting symbol and an ending symbol within the at least a portion of the slot or by predicting the starting symbol and a transmission duration of the high-priority data.

In an embodiment, the scheduling device is configured to receive, from the wireless device, a notification of a starting symbol and an ending symbol within the at least a portion of the slot or the starting symbol and a transmission duration of the high-priority data. The scheduling device is also configured to determine the range of the at least one second mini-slot predicted for transmission of the high-priority data based on the starting symbol and the ending symbol or based on the starting symbol and the transmission duration.

In an embodiment, the scheduling device is configured to collect information of past uplink transmissions of high-priority data at the wireless device. The scheduling device is also configured to determine, based on the collected information, the probability that the wireless device has high-priority data for transmission at the grant for transmission of the high-priority data.

In an embodiment, the scheduling device is configured to receive information of past uplink transmissions of high-priority data from the wireless device. The scheduling device is also configured to determine, based on the received information, the probability that the wireless device has high-priority data for transmission at the grant for transmission of the high-priority data.

In an embodiment, the scheduling device is configured to receive, from the wireless device, the probability that the wireless device has high-priority data for transmission at the grant for transmission of the high- priority data, the probability being determined by the wireless device based on information of past uplink transmissions of high-priority data at the wireless device.

In an embodiment, the transmission of the low-priority data is initially of a scheduling type A allocating all 14 symbols of the slot for transmission at the grant for transmission of the low priority data. In this embodiment, the scheduling device is configured to schedule type B transmission of the low-priority data if the probability exceeds the probability threshold. The scheduling device is also configured to schedule type B by allocating a portion of the 14 symbols for transmission of the low-priority data and a different portion of the 14 symbols for transmission of the high-priority data.

In an embodiment, the scheduling device is configured to re-schedule transmission of eMMB data if the probability that the wireless device has URLLC data for transmission at a URLLC grant exceeds the probability threshold. The scheduling device is configured to re-schedule transmission by allocating, for transmission of the eMMB data, at least one first mini-slot within the at least a portion of the slot but outside of a PUSCH boundary of at least one second mini-slot predicted for transmission of the URLLC data. The PUSCH boundary is within the at least a portion of the slot.

It will be appreciated that the methods, method steps and devices, device functions described herein can be implemented, combined and re-arranged in a variety of ways.

For example, embodiments may be implemented in hardware, or in software for execution by suitable processing circuitry, or a combination thereof.

The steps, functions, procedures, modules and/or blocks described herein may be implemented in hardware using any conventional technology, such as discrete circuit or integrated circuit technology, including both general-purpose electronic circuitry and application-specific circuitry.

Alternatively, or as a complement, at least some of the steps, functions, procedures, modules and/or blocks described herein may be implemented in software such as a computer program for execution by suitable processing circuitry such as one or more processors or processing units. Examples of processing circuitry includes, but is not limited to, one or more microprocessors, one or more Digital Signal Processors (DSPs), one or more Central Processing Units (CPUs), video acceleration hardware, and/or any suitable programmable logic circuitry such as one or more Field Programmable Gate Arrays (FPGAs), or one or more Programmable Logic Controllers (PLCs). It should also be understood that it may be possible to re-use the general processing capabilities of any conventional device or unit in which the proposed technology is implemented. It may also be possible to re-use existing software, e.g., by reprogramming of the existing software or by adding new software components. Fig. 17 is a schematic block diagram illustrating an example of a scheduling device 100 according to an embodiment. In this particular example, the scheduling device 100 comprises a processor 101, such as processing circuitry, and a memory 102. The memory 102 comprises instructions executable by the processor 101. In an embodiment, the processor 101 is operative to re-schedule transmission of the low-priority data if the probability exceeds the probability threshold. The processor 101 is operative to re-schedule transmission by allocating, for transmission of the low-priority data, at least one first mini-slot within the at least a portion of the slot but outside of a range of at least one second mini-slot predicted for transmission of the high-priority data. The range of the at least one second mini-slot is within the at least a portion of the slot.

Optionally, the scheduling device 100 may also include a communication circuit, represented by a respective input/output (I/O) unit 103 in Fig. 17. The I/O unit 103 may include functions for wired and/or wireless communication with other devices, servers and/or network nodes in a wired or wireless communication network. In a particular example, the I/O unit 103 may be based on radio circuitry for communication with one or more other nodes, including transmitting and/or receiving information. The I/O unit 103 may be interconnected to the processor 101 and/or memory 102. By way of example, the I/O unit 103 may include any of the following: a receiver, a transmitter, a transceiver, I/O circuitry, input port(s) and/or output port(s).

Fig. 18 is a schematic block diagram illustrating a scheduling device 1 10 based on a hardware circuitry implementation according to an embodiment. Particular examples of suitable hardware circuitry include one or more suitably configured or possibly reconfigurable electronic circuitry, e.g., Application Specific Integrated Circuits (ASICs), FPGAs, or any other hardware logic such as circuits based on discrete logic gates and/or flip-flops interconnected to perform specialized functions in connection with suitable registers (REG), and/or memory units (MEM).

Fig. 19 is a schematic block diagram illustrating yet another example of a scheduling device 120 based on combination of both processor(s) 121 , 123 and hardware circuitry 124, 125 in connection with suitable memory unit(s) 122. The overall functionality is, thus, partitioned between programmed software for execution on one or more processors 121 , 123 and one or more pre-configured or possibly reconfigurable hardware circuits 124, 125. The actual hardware-software partitioning can be decided by a system designer based on a number of factors including processing speed, cost of implementation and other requirements.

Fig. 20 is a computer program based implementation of a scheduling device 200 according to an embodiment. In this particular example, at least some of the steps, functions, procedures, modules and/or blocks described herein are implemented in a computer program 240, which is loaded into the memory 220 for execution by processing circuitry including one or more processors 210. The processor(s) 210 and memory 220 are interconnected to each other to enable normal software execution. An optional I/O unit 230 may also be interconnected to the processor(s) 210 and/or the memory 220 to enable input and/or output of relevant data.

The term processor should be interpreted in a general sense as any circuitry, system or device capable of executing program code or computer program instructions to perform a particular processing, determining or computing task. The processing circuitry including one or more processors 210 is, thus, configured to perform, when executing the computer program 240, well-defined processing tasks, such as those described herein.

The processing circuitry does not have to be dedicated to only execute the above-described steps, functions, procedure and/or blocks, but may also execute other tasks.

In an embodiment, the computer program 240 comprises instructions, which when executed by at least one processor 210, cause the at least one processor 210 to re-schedule transmission of low-priority data if a probability that a wireless device has high-priority data for transmission at a grant for transmission of the high-priority data exceeds a probability threshold. The wireless device has the grant for transmission of high-priority data at least partly overlapping a grant for transmission of the low-priority data. The high- priority data has higher priority for transmission than the low-priority data, and the grant for transmission of the low-priority data covers at least a portion of a slot. The at least one processor 210 is caused to reschedule transmission by allocating, for transmission of the low-priority data, at least one first mini-slot within the at least a portion of the slot but outside of a range of at least one second mini-slot predicted for transmission of the high-priority data. The range of the at least one second mini-slot is within the at least a portion of the slot.

The proposed technology also provides a carrier 250 comprising the computer program 240. The carrier 250 is one of an electronic signal, an optical signal, an electromagnetic signal, a magnetic signal, an electric signal, a radio signal, a microwave signal, or a computer-readable storage medium. In an embodiment, the carrier 250 is a computer program product 250.

By way of example, the software or computer program 240 stored on a computer program product 250, for instance a computer-readable storage medium, in particular a non-volatile medium. The computer program product 250 may include one or more removable or non-removable memory devices including, but not limited to a Read-Only Memory (ROM), a Random Access Memory (RAM), a Compact Disc (CD), a Digital Versatile Disc (DVD), a Blu-ray disc, a Universal Serial Bus (USB) memory, a Hard Disk Drive (HDD) storage device, a flash memory, a magnetic tape, or any other conventional memory device. The computer program 240 may, thus, be loaded into the operating memory 220 for execution by the at least one processor 210

In an embodiment, the computer program product 250 has stored thereon a computer program 240 comprising instructions which, when executed on at least one processor 210, cause the at least one processor 210 to re-schedule transmission of low-priority data if a probability that a wireless device has high-priority data for transmission at a grant for transmission of the high-priority data exceeds a probability threshold. The wireless device has the grant for transmission of high-priority data at least partly overlapping a grant for transmission of the low-priority data. The high-priority data has higher priority for transmission than the low-priority data, and the grant for transmission of the low-priority data covers at least a portion of a slot. The at least one processor 210 is caused to re-schedule transmission by allocating, for transmission of the low-priority data, at least one first mini-slot within the at least a portion of the slot but outside of a range of at least one second mini-slot predicted for transmission of the high- priority data. The range of the at least one second mini-slot is within the at least a portion of the slot.

The flow diagram or diagrams presented herein may be regarded as a computer flow diagram or diagrams, when performed by one or more processors. A corresponding scheduling device may be defined as a group of function modules, where each step performed by the processor corresponds to a function module. In this case, the function modules are implemented as a computer program running on the processor. The computer program residing in memory may, thus, be organized as appropriate function modules configured to perform, when executed by the processor, at least part of the steps and/or tasks described herein.

Fig. 21 is a block diagram of a scheduling device 130 according to an embodiment. The scheduling device 130 comprises a re-scheduling module 131 for re-scheduling transmission of low-priority data if a probability that a wireless device has high-priority data for transmission at a grant for transmission of the high-priority data exceeds a probability threshold. The wireless device has the grant for transmission of high-priority data at least partly overlapping a grant for transmission of the low-priority data. The high- priority data has higher priority for transmission than the low-priority data, and the grant for transmission of the low-priority data covers at least a portion of a slot. The re-scheduling module 131 is for rescheduling transmission by allocating, for transmission of the low-priority data, at least one first mini-slot within the at least a portion of the slot but outside of a range of at least one second mini-slot predicted for transmission of the high-priority data. The range of the at least one second mini-slot is within the at least a portion of the slot.

In an embodiment, the scheduling device 130 also comprises a predicting module 132 for predicting the probability that the wireless device has high-priority data for transmission at the grant for transmission of the high-priority data. The predicting module 132 may also, or alternatively, be for predicting the starting and ending symbols or the starting symbol and transmission duration for the high-priority data as previously described herein.

Fig. 22 schematically illustrates a portion of a wireless communication system with an access network 21 and a network node 20 providing communication services to a wireless device 30. In this embodiment, the scheduling device 100 of the embodiments, such as described in the foregoing in connection with any of the Figs. 17 to 21 , is implemented in or connected to the network node 20. In such an embodiment, the network node 20 is preferably configured to transmit, to the wireless device 30, re-scheduling information defining the allocation of the at least one first mini-slot and the range of the at least one second mini-slot. Fig. 23 illustrates an alternative implementation of the scheduling device 100 in the wireless device 30.

Fig. 24 is a schematic diagram illustrating an example of a wireless communication system including an access network 21 and/or a core network 22 and/or an Operations and Support System (OSS) 23 in cooperation with one or more cloud-based network devices 24, 25. Functionality relevant for the access network 21 may be at least partially implemented for execution in a cloud-based network device 24, 25, with suitable transfer of information between the cloud-based network device 24, 25 and the relevant network node 20 in the access network 21. Flence, in this embodiment, the scheduling device 100 of the embodiments is at least partly implemented in a network device 24, or could be distributed among multiple network devices 24, 25.

A network device 24, 25 may generally be seen as an electronic device being communicatively connected to other electronic devices in the network. Byway of example, the network device 24, 25 may be implemented in hardware, software or a combination thereof. For example, the network device 24, 25 may be a special- purpose network device or a general-purpose network device, or a hybrid thereof. The embodiments described above are to be understood as a few illustrative examples of the present invention. It will be understood by those skilled in the art that various modifications, combinations and changes may be made to the embodiments without departing from the scope of the present invention. In particular, different part solutions in the different embodiments can be combined in other configurations, where technically possible. The scope of the present invention is, however, defined by the appended claims.