CN112492689A

CN112492689A - Resource preemption method, device, equipment and computer readable storage medium

Info

Publication number: CN112492689A
Application number: CN202011305657.0A
Authority: CN
Inventors: 向平叶; 成剑; 冯景斌; 徐荣军
Original assignee: Peng Cheng Laboratory
Current assignee: Peng Cheng Laboratory
Priority date: 2020-11-19
Filing date: 2020-11-19
Publication date: 2021-03-12
Anticipated expiration: 2040-11-19
Also published as: CN112492689B

Abstract

The invention discloses a resource preemption method, a device, equipment and a computer readable storage medium, wherein the resource preemption method comprises the following steps: determining candidate preemption services from the services to be preempted according to the service priority decision factor; acquiring a time domain preemption symbol set of a candidate preemption service; and according to a preset preemption rule, frequency domain resources corresponding to the time domain preemption symbol set and meeting the number of resources required by the URLLC service are preempted, and similar to a fragmented resource preemption method, the influence on the service of the preempted resources is reduced as much as possible while the smooth transmission of the URLLC service is ensured under the condition that the URLLC service preempts the service being transmitted, and the spectrum utilization rate is improved.

Description

Resource preemption method, device, equipment and computer readable storage medium

Technical Field

The present invention relates to the field of wireless communication technologies, and in particular, to a resource preemption method, apparatus, device, and computer-readable storage medium.

Background

Ultra-high Reliable Low Latency Communications (URLLC) is one of three major application scenarios of 5G, and is a technical basis for industrial internet related novel applications such as industrial automation and automatic driving. The transmission of data services of these applications relates to production safety, production efficiency and user experience, and these URLLC services, like these, put very strict requirements on the Quality of Service (QoS), that is, the air interface delay does not exceed 1 millisecond, and the reliability is not lower than 99.9999%. At present, mature application of 5G is concentrated on an eMBB (enhanced Mobile broadband band) service, most resources are also concentrated on the eMBB service, and the URLLC service has the characteristics of burstiness, low delay and small packet. If a base station reserves a part of resources in advance for the URLLC to be reserved, when the URLLC service is not used sufficiently or the URLLC service is not available for a long time, the waste of the resources is caused, the frequency spectrum resources are limited, in order to support the transmission of the eMMC service and the URLLC service simultaneously, the eMMC and URLLC resource multiplexing is inevitable, and how to make the URLLC service with the requirement of low time delay transmit preferentially without causing too much influence on the eMMC service is the content which needs to be researched.

The scenarios of collision and multiplexing generated by the transmission of the uplink URLLC service and the uplink eMBB service are as follows: 1) the base station schedules the uplink resource to an eMBB user for data transmission, and then another URLLC user also sends an SR request for the uplink resource. Because the delay requirement of URLLC service transmission is very strict, but if no resource is available within the delay requirement range of URLLC service, the base station must schedule the eMBB service resource to the URLLC user, resulting in transmission collision between the two users. 2) The base station allocates cg (coordinated grant) resources for URLLC users, but it does not know whether URLLC users have data to transmit in these unlicensed scheduling resources, so the base station also dynamically schedules these resources for the eMBB users to achieve better resource utilization, and at this time, a problem of resource collision between URLLC users and eMBB users may occur. An uplink cancellation indication is added in the current 3GPP Rel-16(Release 16) protocol or the transmission power of a URLLC service user is increased to solve the problem of uplink resource conflict between URLLC and eMBB, although the method considers the requirements of time-delay and reliability of URLLC service to a certain extent, it is difficult to guarantee the QoS (quality of service) requirements of eMBB users, and the method aims to consider both the low-delay high-reliability of URLLC service and the QoS requirements of eMBB service. The 5G Rel-16 protocol allows downlink URLLC service and eMBB service to coexist, the URLLC service may preempt eMBB service resources being transmitted, and the base station sends a Preemption Indication (PI) to an eMBB service user to indicate which resources are preempted by the eMBB service user, and the user may discard data information of the preempted resources, and may improve demodulation performance of the eMBB service user in comparison with a case where demodulation fails due to demodulation when it is unclear which information is used for demodulation when polluted or damaged. However, the protocol does not specify which resources are preempted in detail to minimize the QoS impact on the eMBB traffic.

Therefore, the prior art has yet to be improved.

Disclosure of Invention

The main purpose of the present invention is to provide a method, an apparatus, a device and a computer readable storage medium for resource preemption, which aims to solve the problem of how to reduce the influence on the service being transmitted when the URLLC preempts the resource, and the method for resource preemption includes the following steps:

determining candidate preemption services from the services to be preempted according to the service priority decision factor;

acquiring a time domain preemption symbol set of the candidate preemption service;

and according to a preset preemption rule, preempting the frequency domain resources corresponding to the time domain preemption symbol set and meeting the number of resources required by the URLLC service.

In an embodiment, before the step of determining candidate preemption services from to-be-preempted services according to the service priority decision factor, the method further includes:

and when the number of the idle resources cannot meet the requirement of the number of the resources required by the URLLC service, determining the non-real-time service as the service to be preempted, wherein the non-real-time service comprises a non-real-time eMBB service and a non-GBR service.

In an embodiment, the step of determining candidate preemption services from to-be-preempted services according to a service priority decision factor includes:

calculating a service priority decision factor of the service to be seized based on the target code rate and the real code rate of the service to be seized;

and acquiring candidate preemption services from the services to be preempted with the service priority decision factor larger than zero.

In an embodiment, the step of acquiring a candidate preemption service from the services to be preempted whose service priority decision factor is greater than zero includes:

calculating the number of candidate preemption resources of the service to be preempted with the service priority decision factor larger than zero;

and determining the service to be preempted, of which the number of the candidate preemption resources is greater than zero, as a candidate preemption service.

In one embodiment, the step of obtaining the time-domain preemption symbol set of the candidate preemption service includes:

acquiring a symbol set which can be preempted in the candidate preemption service and a delay gate valve symbol set in the URLLC service;

and operating the symbol set capable of being preempted and the symbol set of the time delay gate valve to obtain a time domain preempting symbol set.

In an embodiment, the step of preempting, according to a preset preemption rule, the frequency domain resource corresponding to the time domain preemption symbol set and satisfying the number of resources required by the URLLC service includes:

and according to the sequence of the priority decision factors of each candidate preemption service from large to small and the sequence of the frequency domain in the candidate preemption service from low to high, sequentially preempting the frequency domain resources corresponding to the time domain symbol set in the candidate preemption service until the number of the frequency domain resources is equal to the number of the resources required by the URLLC service.

In addition, to achieve the above object, the present invention further provides a resource preemption device, including:

the determining module is used for determining candidate preemption services from the services to be preempted according to the service priority decision factor;

an obtaining module, configured to obtain a time domain preemption symbol set of the candidate preemption service;

and the preemption module is used for preempting the time-frequency domain resources of which the number of the resources required by the URLLC service is met in the candidate preemption symbol set according to a preset preemption rule.

Furthermore, to achieve the above object, the present invention further provides an apparatus including a memory, a processor, and a resource preemption program stored in the memory and operable on the processor, wherein the resource preemption program when executed by the processor implements the steps of the resource preemption method as described above.

Furthermore, to achieve the above object, the present invention also provides a computer-readable storage medium having the resource preemption program stored thereon, which when executed by a processor implements the steps of the resource preemption method as described above.

The invention determines the candidate preemption service from the service to be preempted according to the service priority decision factor, acquires the time domain preemption symbol set of the candidate preemption service, and preempts the frequency domain resources corresponding to the time domain preemption symbol set and meeting the number of resources required by the URLLC service according to the preset preemption rule.

Drawings

FIG. 1 is a diagram illustrating a hardware configuration of an apparatus for implementing various embodiments of the invention;

fig. 2 is a flowchart illustrating a first embodiment of a resource preemption method according to the present invention;

fig. 3 is a schematic view of a first application scenario of the resource preemption method of the present invention;

fig. 4 is a schematic view of a second application scenario of the resource preemption method of the present invention;

fig. 5 is an exemplary diagram of a part of frequency domain resources for a downlink URLLC to seize downlink eMBB service data in the present invention.

The implementation, functional features and advantages of the present invention will be described with reference to the accompanying drawings.

Detailed Description

It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

The invention provides a device, and referring to fig. 1, fig. 1 is a schematic structural diagram of a hardware operating environment according to an embodiment of the invention.

It should be noted that fig. 1 is a schematic structural diagram of a hardware operating environment of a device. The device of the embodiment of the invention can be a Personal Computer (PC), a portable Computer, a server and other devices.

As shown in fig. 1, the apparatus may include: a processor 1001, such as a CPU, a memory 1005, a user interface 1003, a network interface 1004, a communication bus 1002. Wherein a communication bus 1002 is used to enable connective communication between these components. The user interface 1003 may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 1005 may be a high-speed RAM memory or a non-volatile memory (e.g., a magnetic disk memory). The memory 1005 may alternatively be a storage device separate from the processor 1001.

Optionally, the device may also include RF (Radio Frequency) circuitry, sensors, WiFi modules, and the like.

Those skilled in the art will appreciate that the configuration of the apparatus shown in fig. 1 does not constitute a limitation of the apparatus and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components.

As shown in fig. 1, a memory 1005, which is a kind of computer storage readable storage medium, may include therein an operating system, a network communication module, a user interface module, and a resource preemption program. The operating system is a program for managing and controlling hardware and software resources of the device, and supports the operation of a resource preemption program and other software or programs.

The resource preemption method apparatus shown in fig. 1 can be used to solve the problem of how to reduce the influence on the service being transmitted when the URLLC preempts the resource, and the user interface 1003 is mainly used to detect or output various information; the network interface 1004 is mainly used for interacting with a background server and communicating; the processor 1001 may be configured to invoke a resource preemption program stored in the memory 1005 and perform the following operations:

The specific implementation of the mobile terminal of the present invention is basically the same as the following embodiments of the resource preemption method, and will not be described herein again.

Based on the above structure, the present invention provides various embodiments of the resource preemption method.

The invention provides a resource preemption method.

Referring to fig. 2, fig. 2 is a flowchart illustrating a first embodiment of a resource preemption method according to the present invention.

In the present embodiment, an embodiment of a resource preemption method is provided, and it should be noted that although a logical order is shown in the flow chart, in some cases the steps shown or described may be performed in an order different than here.

In this embodiment, an execution main body of the resource preemption method may be a device, the device includes a bracelet, a mobile phone, and other portable devices, and a mobile device capable of establishing bluetooth communication, and the resource preemption method includes the following steps:

step S10, determining candidate seizing service from the service to be seized according to the service priority decision factor;

the candidate preemption service refers to a terminal, the service priority refers to the terminal priority, the service priority decision factor determines the priority order of the candidate preemption service, and the higher the service priority decision factor is, the higher the priority of the candidate preemption service is.

In one embodiment, before step S10, the method further includes:

step a, when the number of idle resources can not meet the requirement of the number of resources required by the URLLC service, determining a non-real-time service as a service to be preempted, wherein the non-real-time service comprises a non-real-time eMBB service and a non-GBR service.

Preferentially distributing idle resources to URLLC service, classifying eMB service according to whether the eMB service is required to be real-time when the idle resources are not enough, and regarding the service with the time delay requirement within 150ms as a real-time eMB service group and regarding the service with the time delay requirement more than 150ms as a non-real-time eMB service group according to the classification rule; the gbr (Guaranteed Bit rate) service may also be regarded as a real-time service according to the resource type, and the non-gbr (no Guaranteed Bit rate) service may be regarded as a non-real-time service, where the delay requirement and the resource type may be obtained through qci (qos Class identifier).

In some embodiments, step S10 further includes:

step b, calculating a service priority decision factor of the service to be seized based on the target code rate and the real code rate of the service to be seized;

and c, acquiring candidate preemption services from the services to be preempted with the service priority decision factor larger than zero.

And setting a service priority decision factor w by using the actual code rate cr _ real and the target demodulation code rate cr _ target transmitted by the service to be preempted, wherein the w is (1/cr _ real-1/cr _ target). Wherein, cr _ target is the target code rate of the service transmission to be preempted, and can be obtained by the index table query of MCS (modulation and Coding scheme); cr _ real is the real code rate of the traffic transmission to be preempted, and cr _ real is N _ info/(N _ re × Qm × v). Wherein, N _ info is the number of effective information bits, N _ RE is the number of available REs suitable for the service to be preempted, Qm is the number of bits that can be carried by the corresponding modulation and coding scheme, and v is the number of layers used when the service to be preempted is sent. And taking the service to be preempted with w larger than 0 as a candidate preemption service, wherein the larger w is, the higher priority is preempted.

In some embodiments, step c comprises:

step c1, calculating the number of candidate resources to be preempted of the service with the service priority decision factor larger than zero;

step c2, determining the service to be preempted, the number of which is greater than zero, as a candidate preemption service.

Calculating the number of resources which can be preempted by each service to be preempted and of which the priority decision factor of each service is greater than zero, namely the number of candidate preemption resources, and defining the number as candidate preemption REGs, wherein the REGs are the abbreviations of Resource-Element Groups, each REG occupies one symbol in the time domain and occupies one Resource Block (RB) in the frequency domain, namely occupies 12 subcarriers. The number of RE (Resource element) s that can be preempted N _ RE _ p is floor (w (N _ info/Qm/v)), and the number of REGs (number of candidate preemption resources) that can be preempted is floor (N _ RE _ p/12), where floor () represents a floor function.

And selecting the service to be preempted with the N _ reg _ p larger than 0 as a candidate preemption service, and recording the number of the candidate preemption resources. The larger N _ reg _ p, the more resources can be punctured.

Step S20, acquiring a time domain preemption symbol set of the candidate preemption service;

the time domain preemption symbol set is a candidate preemption symbol set for a slot.

In some embodiments, step S20 includes:

step d, acquiring a symbol set which can be preempted in the candidate preemption service and a delay gate valve symbol set in the URLLC service;

and e, performing AND operation on the symbol set capable of being preempted and the symbol set of the time delay gate valve to obtain a time domain preempting symbol set.

The symbol in the set B is the or operation result of the symbol bitmap of each candidate preemption service (DMRS (Demodulation Reference Signal) symbol bit position 0 of each candidate preemption service in the current time slot). Where bitmap is a 14-bit bitmap, each bit represents a symbol in a slot, bit position 1 represents that the symbol is available, and bit position 0 represents that the symbol is not available.

The symbol set of the delay gate valve meeting the current URLLC service is recorded as A, the set A is a bitmap of 14 symbols of a time slot, the first symbol with the position of 1 represents the starting time of the URLLC to be transmitted, and the last symbol with the position of 1 represents the latest transmission time acceptable by the URLLC service within the delay requirement range. And operating the set A and the set B to obtain a candidate preemption symbol set C of the URLLC service.

And step S30, according to a preset preemption rule, preempting the frequency domain resources corresponding to the time domain preemption symbol set and meeting the number of resources required by the URLLC service.

The preset preemption rule is that the frequency domain resources to be preempted are determined according to the sequence of the candidate preemption service priority and the sequence of the frequency domain from low to high.

In some embodiments, step S30 includes:

and step f, according to the sequence of the priority decision factors of each candidate preemption service from large to small and the sequence of frequency domains in the candidate preemption service from low to high, sequentially preempting the frequency domain resources corresponding to the time domain symbol set in the candidate preemption service until the number of the frequency domain resources is equal to the number of the resources required by the URLLC service.

In the candidate preemption symbol set C, preferentially allocating available RBs (resource blocks) on the first candidate preemption symbol, wherein the available RBs are selected according to the order of priority of the candidate preemption service on the candidate preemption symbol from large to small (i.e. the order of priority decision factors from large to small), and are preempted sequentially according to the frequency domain RB index order corresponding to the candidate preemption service from low to high, the number of preempted RBs cannot exceed the number of REGs tolerable to be preempted by the service, then the number of second candidate preemption symbol is followed, and so on, until the number of resources meeting the low-delay high-reliability requirement of the URLLC service is allocated.

In the embodiment, the candidate preemption service is determined from the services to be preempted according to the service priority decision factor, the time domain preemption symbol set of the candidate preemption service is obtained, and the frequency domain resources corresponding to the time domain preemption symbol set and meeting the number of resources required by the URLLC service are preempted according to the preset preemption rule.

A second embodiment of the resource preemption method is provided, and this embodiment provides an application scenario of the resource preemption method, referring to fig. 3.

The terminal UE1 is a real-time eMBB service, the terminal UE2, the terminal UE3, and the terminal UE4 is a non-real-time eMBB service, where the UE4 is discrete resource allocation, the remaining UEs (user equipment) are continuous resource allocation, and the terminal UE5 is a URLLC service. The time domain resources occupied by the UE1, the UE2 and the UE3 are 14 symbols from symbol 0 to symbol 13, the DMRSs occupy symbols 2, 6 and 9, the time domain resources occupied by the UE4 are symbols 4 to symbol 13, and the DMRSs occupy symbols 4 and 8. Suppose that the URLLC service needs 18 frequency domain RBs and 1 time domain symbol under the condition of satisfying the target delay and reliability, the starting symbol is symbol 3, and the current system has idle frequency domain resource 6RB on symbol 3, but the idle frequency domain resource in the range of the URLLC delay requirement is not enough to satisfy the URLLC service requirement, and needs to occupy part of transmission resource 12RB of the eMBB service data.

The eMB services are classified according to a real-time requirement rule into a real-time eMB service group { UE1} and a non-real-time eMB service group { UE2, UE3 and UE4}, and the RB positions, the data transmission target code rates cr _ target and the real code rates cr _ real allocated to the services are recorded. The URLLC service preferentially seizes the resources of the non-real-time eMBB service group, and the non-real-time eMBB service group is determined as the service to be seized.

And setting a service priority decision factor w by using the actual code rate cr _ real and the target code rate cr _ target transmitted by each eMBB service, wherein the w is (1/cr _ real-1/cr _ target). Wherein, cr _ target is the target code rate of the eMB service transmission, and can be obtained by the index table query of MCS (modulation and Coding scheme) corresponding to the current service; cr _ real is the true code rate of the eMBB traffic transmission, and cr _ real is N _ info/(N _ re × Qm × v). Wherein N _ info is the number of bits of the effective information of the transmission block of the eMBB service, N _ RE is the number of available REs applicable to the eMBB service, Qm is the number of bits that can be carried by the corresponding modulation and coding scheme, and v is the number of layers used when the eMBB service is transmitted. Suppose the traffic priority decision factor w set of the non-real-time eMBB traffic groups { UE2, UE3, UE4} is calculated as { w _ UE2, w _ UE3, w _ UE4}, and w _ UE2> w _ UE3> w _ UE4>0, the larger w is, the higher the punctured priority is.

The number of re (resource element) that can be preempted, N _ re _ p, is floor (w (N _ info/Qm/v)), and the number of REGs that can be preempted, is N _ reg _ p, is floor (N _ re _ p/12). Assuming that the numbers of tolerable preempted REGs of the non-real-time eMBB service obtained by the above calculation are respectively: n _ reg _ p _ UE2 ═ 6RB, N _ reg _ p _ UE3 ═ 10RB, and N _ reg _ p _ UE4 ═ 0RB, the traffic with N _ reg _ p greater than 0 is chosen as candidate preemption traffic, i.e., UE2 and UE3, and the number of its candidate preemption resources is recorded. The larger N _ reg _ p, the more resources can be punctured.

It can be known from the assumption that the time domain configurations of UE2 and UE3 are the same, and DMRS symbols 2, 6, and 9 are removed, and the result of the two operations is B11011101101111.

The symbol set A of the delay gate valve of the current URLLC service is satisfied, the set A is a bitmap of 14 symbols of a time slot, the first symbol with the position of 1 represents the starting time that the URLLC can transmit, and the last symbol with the position of 1 represents the latest transmission time that the URLLC service can accept within the delay requirement range, namely A is 00010000000000.

And-operating the set A and the set B to obtain a candidate preemption symbol set C of the URLLC service, namely C & B & 00010000000000.

In the candidate preemption symbol set C, there are only 1 candidate preemption symbol, so that available RBs corresponding to the symbol are searched, where the available RBs are selected from large to small (i.e., the order of the priority decision factors is from large to small) according to the priority of the candidate preemption service corresponding to the candidate preemption symbol, and are preempted sequentially from low to high according to the frequency domain RB index order corresponding to the candidate preemption service, and the number of the preempted RBs cannot exceed the number of REGs tolerable by the service, i.e., preempt 6 RBs corresponding to the UE2 preferentially, and then preempt the RBs available to the UE3, because the URLLC service needs 18 RBs, 6+ 6-12 RBs have been preempted, and 18-12-6 RBs are needed, while 10 RBs available to the UE3, so that 6 RBs from low to high in the frequency domain on the time domain symbol 3 of the UE3 can be searched.

Preempt the determined frequency domain resources for the URLLC service, and simultaneously inform the UE2 of which resources are preempted by the UE3, so that the UE can remove the information on the preempted resources during demodulation to improve the demodulation performance.

A third embodiment of the resource preemption method is provided, and this embodiment provides another application scenario of the resource preemption method, referring to fig. 4.

When there is no idle frequency domain resource, and UE1, UE2, and UE3 are non-real-time eMBB services, and UE4 is a URLLC service, it is assumed that the URLLC service needs 18 frequency domain RBs and 1 time domain symbol under the condition of satisfying the target delay and reliability, and the starting symbol is symbol 3, and the preemption of the non-real-time eMBB service resource by the URLLC service is similar to the scenario in embodiment two.

Fig. 4 is a resource diagram (without idle frequency domain resources) of uplink URLLC preempting uplink eMBB service data.

In the embodiment, the tbs (transport Block size), that is, the effective information bit number N _ info of the eMBB service transport Block, refers to a transport Block size determination section in the 3GPP38214 protocol to calculate, and simultaneously refers to step S10 to calculate w and the number of candidate preemption Resources (REGs) that can be preempted, it should be noted that the transport Block is a resource being transmitted, the resource Block is a carrier of the transport Block, and a plurality of resource blocks can carry one transport Block.

Examples are as follows:

assume the configuration of the UE 3:

equal to 14 a and equal to the sum of 14,

equal to 6, and is equal to,

is equal to 0, n_PRBEqual to 50, the target code rate cr _ target equal to 340/1024, Qm equal to 4, and v equal to 1, then the TBS is calculated according to the protocol of 3GPP38214 as follows:

N_RE＝min(156,N'_RE)·n_PRB＝156*50＝7800

N_info＝N_RE·R·Q_m·υ＝7800*340/1024*4*1＝10359.375

the parameters involved in the formula for calculating TBS (transport block size) in the present invention are described as follows:

N'_RErepresenting a reference resource particle number of one resource block;

the number of the sub-carriers in one resource block is 12;

representing the number of valid symbols in a slot;

indicating the number of resource elements occupied by the demodulation reference signal in each resource block;

representing the preset overhead number in each resource block; n is_PRBIndicating the number of all resource blocks allocated to the UE; qm represents the bit number which can be carried by the corresponding modulation coding mode; v represents the number of layers; n is a radical of_RERepresenting the number of resource elements in all scheduled resource blocks; n is a radical of_infoAnd N'_infoRepresenting an intermediate number of computed information bits; c is the number of code blocks; TBS is the transport block size.

Calculating a real code rate cr _ real, wherein cr _ real is N _ info/(N _ re Qm v) 10248/(162 50 4 1) 10248/32400;

calculating the service priority decision factor w _ ue3, w _ ue3 ═ (1/cr _ real-1/cr _ target) ═ 32400/10248 to 1024/340 ═ 0.149828;

the re (resource element) number N _ re _ p _ ue3 ═ floor (w ═ info/Qm/v)) -floor (0.149828 ═ 10248/4/1)) -383 is calculated, and the REGs number that can be preempted is N _ reg _ p _ ue3 ═ floor (N _ re _ p _ ue3/12) ═ floor (383/12) ═ 31.

Assume the configuration of the UE 2:

equal to 14 a and equal to the sum of 14,

equal to 6, and is equal to,

is equal to 18, n_PRBEqual to 50, the target code rate cr _ target equal to 340/1024, Qm equal to 4, v equal to 1, then the TBS is calculated according to the protocol of 3GPP38214 as follows:

N_RE＝min(156,N'_RE)·n_PRB＝144*50＝7200

N_info＝N_RE·R·Q_m·υ＝7200*340/1024*4*1＝9562.5

calculating a real code rate cr _ real, wherein cr _ real is N _ info/(N _ re Qm v) 9480/(7200 4 1) 9480/28800;

calculating the service priority decision factor w _ ue2, w _ ue2 ═ (1/cr _ real-1/cr _ target) ═ 28800/9480 to 1024/340 ═ 0.02621;

the re (resource element) number N _ re _ p _ ue2 ═ floor (w ═ info/Qm/v)) ═ floor (0.02621 ═ 9480/4/1)) ═ 62 is calculated, and the REGs number that can be preempted is N _ reg _ p _ ue2 ═ floor (N _ re _ p _ ue2/12) ═ floor (62/12) ═ 5.

Assume the configuration of the UE 1:

equal to 14 a and equal to the sum of 14,

equal to 6, and is equal to,

is equal to 6, n_PRBEqual to 50, the target code rate cr _ target equal to 340/1024, Qm equal to 4, v equal to 1, then the TBS is calculated according to the protocol of 3GPP38214 as follows:

N_RE＝min(156,N'_RE)·n_PRB＝156*50＝7800

N_info＝N_RE·R·Q_m·υ＝7800*340/1024*4*1＝10359.375

calculating the real code rate cr _ real, wherein cr _ real is N _ info/(N _ re × Qm × v) ═ 10248/(156 × 50 × 4 × 1) ═ 10248/31200;

calculating the service priority decision factor w _ ue1, w _ ue1 ═ (1/cr _ real-1/cr _ target) ═ 31200/10248-1024/340 ═ -0.43565;

since w _ UE1 is less than 0, UE1 is not included in the candidate preemption service.

It can be seen that the calculation result w _ UE1<0< w _ UE2< w _ UE3, the system preferentially preempts the resource of UE3, and since the number of available REGs of UE3 is greater than the number of REs required by the URLLC service, it is sufficient to preempt the resource of UE3 alone according to the time-frequency domain resource determination rule in the candidate preemption symbol set.

Referring to fig. 5, fig. 5 is an example of determining the number of candidate preemption resources for a downlink URLLC to preempt partial frequency domain resources of downlink eMBB service data.

The determination of the number of candidate preemption resources is illustrated.

Assume that a downlink eMBB service is configured as follows:

equal to 12, and is equal to,

equal to 6, and is equal to,

N_RE＝min(156_,N'_RE)·n_PRB＝132*50＝6600

N_info＝N_RE·R·Q_m·υ＝6600*340/1024*4*1＝8765.625

suppose that

Specifying the resources actually occupied by the CSI-RS (Channel-state information reference signal), calculating the true code rate cr _ real of the UE1, where cr _ real is N _ info/(N _ re _ Qm) ═ 8712/(6600 × 4) ═ 8712/26400;

calculating a UE1 traffic priority decision factor w _ UE1, w _ UE1 (1/cr _ real-1/cr _ target) 26400/8712-1024/340-0.018538;

the UE1 is configured to calculate the tolerable number of preempted REs, N _ RE _ p, floor (w _ UE1 (N _ info/Qm/v)) -floor (0.018538 (8712/4/1)) -40, and the tolerable number of preempted REGs of the UE1, N _ reg _ p, floor (N _ RE _ p/12) — floor (40/12) — 3.

Assuming that the CSI-RS of the UE2 only occupies 1 RE of each RB and the PDSCH (Physical Downlink Shared Channel) can occupy the remaining free REs of these RBs, the number of REs actually available for transmitting PDSCH is (12 × 12-6-1) 50 ═ 6850.

Then the true code rate of the UE2 is cr _ real ═ N _ info/(N _ re × Qm ═ v) ═ 8712/(6850 × 4 ═ 1) ═ 8712/27400;

the UE2 traffic priority decision factor w _ UE2, w _ UE2 (1/cr _ real-1/cr _ target) 27400/8712-1024/340-0.133323;

the UE1 is configured to calculate a tolerable number of re (resource element) N _ re _ p ═ floor (w _ UE1 × (N _ info/Qm/v)) ═ floor (0.133323 × (8712/4/1)) ═ 290, and the UE2 is configured to tolerate a tolerable number of REGs of preemption N _ reg _ p ═ floor (N _ re _ p/12) ═ floor (290/12) ═ 24.

It can be seen that the number of resources available for URLLC transmission in the above two hypothetical cases is 3 REGs and 24 REGs, respectively.

In addition, an embodiment of the present invention further provides a resource preemption method and apparatus, where the resource preemption apparatus includes: resource preemption method provided by the embodiment

The embodiments of the apparatus for resource preemption method of the present invention are basically the same as the embodiments of the resource preemption method, and are not described herein again.

Furthermore, an embodiment of the present invention further provides a computer-readable storage medium, where a resource preemption program is stored on the computer-readable storage medium, and the resource preemption program implements the steps of the resource preemption method when executed by a processor.

Note that the computer-readable storage medium may be provided in a device.

The specific implementation of the computer-readable storage medium of the present invention is substantially the same as the foregoing embodiments of resource preemption, and is not described herein again.

It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.

The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.

Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (such as a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.

The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.

Claims

1. A method for resource preemption, the method comprising:

2. The method for resource preemption of claim 1, wherein prior to the step of determining candidate preemption services from the to-be-preempted services based on the service priority decision factor, further comprising:

3. The method for resource preemption of claim 2, wherein the step of determining candidate preemption services from the to-be-preempted services based on the service priority decision factor comprises:

4. The method for resource preemption of claim 3, wherein the step of obtaining candidate preemption services from the to-be-preempted services for which the service priority decision factor is greater than zero comprises:

5. The method of resource preemption of claim 1, wherein said step of obtaining a set of time-domain preemption symbols for the candidate preemption service comprises:

6. The method for resource preemption of claim 2, wherein the step of preempting the frequency domain resources corresponding to the time domain preemption symbol set and satisfying the number of resources required by URLLC service according to a preset preemption rule comprises:

7. A resource preemption device, comprising:

8. A device comprising a memory, a processor, and a resource preemption program stored on the memory and operable on the processor, which when executed by the processor implements the steps of the resource preemption method of any of claims 1 to 6.

9. A computer-readable storage medium, having stored thereon a resource preemption program which, when executed by a processor, implements the steps of a resource preemption method as claimed in any one of claims 1 to 8.