CN113347730B - Static scheduling method and device, readable storage medium and terminal - Google Patents

Static scheduling method and device, readable storage medium and terminal Download PDF

Info

Publication number
CN113347730B
CN113347730B CN202110688172.2A CN202110688172A CN113347730B CN 113347730 B CN113347730 B CN 113347730B CN 202110688172 A CN202110688172 A CN 202110688172A CN 113347730 B CN113347730 B CN 113347730B
Authority
CN
China
Prior art keywords
static scheduling
resource
data
resources
static
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110688172.2A
Other languages
Chinese (zh)
Other versions
CN113347730A (en
Inventor
邓曼
缪诚钰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Spreadtrum Communications Shanghai Co Ltd
Original Assignee
Spreadtrum Communications Shanghai Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Spreadtrum Communications Shanghai Co Ltd filed Critical Spreadtrum Communications Shanghai Co Ltd
Priority to CN202110688172.2A priority Critical patent/CN113347730B/en
Publication of CN113347730A publication Critical patent/CN113347730A/en
Application granted granted Critical
Publication of CN113347730B publication Critical patent/CN113347730B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/543—Allocation or scheduling criteria for wireless resources based on quality criteria based on requested quality, e.g. QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

A static scheduling method and device, a readable storage medium and a terminal are provided, the method comprises the following steps: when the priorities of a plurality of static scheduling resources are the same and conflict, determining the data types which can be borne by each static scheduling resource; and if one or only one static scheduling resource can bear the URLLC data type in the plurality of the static scheduling resources with conflicts, adopting the static scheduling resource to send the data to be sent. The method and the device firstly judge the data type which can be borne by the static scheduling resources, and further realize that the static scheduling resources which bear the URLLC data are preferentially selected to send the data to be sent by utilizing the characteristics of smaller time delay and higher reliability of the URLLC data.

Description

Static scheduling method and device, readable storage medium and terminal
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a static scheduling method and apparatus, a readable storage medium, and a terminal.
Background
Wireless communication systems have been widely deployed for everyday voice, video, data, and short message services. Mobile communication has been developed through several stages, namely 2G, 3G and 4G, and currently enters a development and deployment stage of a New Radio (NR) interface of 5G. The third Generation Partnership Project (3rd Generation Partnership Project, 3GPP) has defined Enhanced Mobile Broadband (EMBB) and Low-Latency high-reliability connectivity (URLLC) services for 5G.
In order to meet the requirements of higher-requirement services of the URLLC (such as factory automation, transportation industry, power distribution system and the like) and cope with the scene of coexistence of uplink URLLC and EMBB services, for uplink priority between UEs, uplink Cancellation indication (CI-RNTI) is introduced into the fifth Generation (5th Generation, 5G) R16; for uplink priority in the UE, 5G R16 newly adds a UE capability item Lch-priority base priority-r 16, and newly introduces Lch-based priority-r 16 in configuring Medium Access Control (MAC) cell group configuration (CellGroupConfig).
In a scenario where an MAC layer in the UE needs to determine an uplink priority, there are a conflict between dynamic Scheduling and static Scheduling, a conflict between a Scheduling Request (SR) and dynamic Scheduling/static Scheduling, and a conflict between multiple static schedules.
When there is a conflict among multiple persistent schedules, that is, when multiple persistent scheduling priorities (ph-priority index-r16) are the same and there is an uplink transmission time overlap (overlap), there is no specification in the UE protocol how to solve the conflict, and how to determine the final priority of each persistent schedule.
In the conventional static scheduling technique, the adopted judgment strategy is to select the static scheduling resource with the minimum sequence number (Index) all the time, however, the static scheduling resource with the minimum sequence number may not meet the delay requirement of URLLC, and may also cause the reduction of the EMMB throughput rate and the rate.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a static scheduling method and device, a readable storage medium and a terminal, wherein the type of data which can be borne by a static scheduling resource is judged firstly, and then the characteristics of small time delay and high reliability of URLLC data are utilized to realize that the static scheduling resource which bears the URLLC data is preferentially selected to send the data to be sent.
To solve the foregoing technical problem, an embodiment of the present invention provides a static scheduling method, including: when the priorities of a plurality of static scheduling resources are the same and conflict, determining the data types which can be borne by each static scheduling resource; and if one or only one static scheduling resource can bear the URLLC data type in the plurality of the static scheduling resources with conflicts, adopting the static scheduling resource to send the data to be sent.
Optionally, the static scheduling method further includes: if a plurality of static scheduling resources can bear the URLLC data type, judging the HARQ feedback type of each static scheduling resource which can bear the URLLC data type; if the HARQ feedback type of one or only one static scheduling resource is HARQ retransmission feedback, the static scheduling resource is adopted to send the retransmission data; or, if all the static scheduling resources can only bear the non-URLLC data type, judging the HARQ feedback type of each static scheduling resource; if the HARQ feedback type of one static scheduling resource is HARQ retransmission feedback, the static scheduling resource is adopted to send retransmission data; wherein the HARQ feedback type is selected from HARQ retransmission feedback and HARQ new transmission feedback.
Optionally, the non-URLLC data is selected from EMMB data and SRB data.
Optionally, the static scheduling method further includes: in the process of judging the HARQ feedback type, if the HARQ feedback type of a plurality of static scheduling resources is HARQ retransmission feedback, determining the static scheduling resource with the earliest ending time; if the static scheduling resource with the earliest finishing time exists, the static scheduling resource is adopted to send the retransmission data; and the static scheduling resource fed back by the HARQ retransmission is more than or equal to the data volume of the retransmission data.
Optionally, the static scheduling method further includes: and if a plurality of static scheduling resources with the same ending time and the earliest all exist, selecting the static scheduling resource with the minimum resource sequence number from the plurality of static scheduling resources with the same ending time and the earliest all to transmit the retransmission data.
Optionally, the static scheduling method further includes: if the HARQ feedback types of all the static scheduling resources are HARQ new feedback, determining all the static scheduling resources; if the static scheduling resource with the data volume larger than or equal to the data volume of the data to be transmitted exists, selecting the static scheduling resource with the data volume larger than or equal to the data volume of the data to be transmitted and the minimum static scheduling resource as a first resource to be selected; if the first resource to be selected has one or more static scheduling resources, the static scheduling resources are adopted to send the data to be sent; if the static scheduling resource which is larger than or equal to the data volume of the data to be sent does not exist, selecting the static scheduling resource which is smaller than the data volume of the data to be sent and has the largest data volume, and marking as a second resource to be selected; and if the second resource to be selected has one static scheduling resource and only one static scheduling resource, adopting the static scheduling resource to send the data to be sent.
Optionally, the static scheduling method further includes: if the first resource to be selected has a plurality of statically scheduled resources, determining the statically scheduled resource with the earliest ending moment in the first resource to be selected; and if the static scheduling resource with the earliest finishing time exists and only exists, adopting the static scheduling resource to send the data to be sent.
Optionally, the static scheduling method further includes: and if a plurality of static scheduling resources with the earliest finishing time exist, selecting the static scheduling resource with the minimum resource sequence number from the first to-be-selected resources to send the to-be-sent data.
Optionally, the static scheduling method further includes: if the second resource to be selected has a plurality of static scheduling resources, determining the static scheduling resource with the earliest end time in the second resource to be selected; and if the static scheduling resource with the earliest finishing time exists and only exists, adopting the static scheduling resource to send the data to be sent.
Optionally, the static scheduling method further includes: and if a plurality of static scheduling resources with the earliest finishing time exist, selecting the static scheduling resource with the minimum resource sequence number from the second resources to be selected to send the data to be sent.
To solve the foregoing technical problem, an embodiment of the present invention provides a static scheduling apparatus, including: the data type determining module is used for determining the data type which can be borne by each static scheduling resource when the priorities of the static scheduling resources are the same and conflict; and the resource selection module is used for sending the data to be sent by adopting the static scheduling resources if one or only one static scheduling resource can bear the URLLC data type in the plurality of the static scheduling resources with conflicts.
To solve the above technical problem, an embodiment of the present invention provides a readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to perform the steps of the above static scheduling method.
In order to solve the above technical problem, an embodiment of the present invention provides a terminal, including a memory and a processor, where the memory stores a computer program capable of running on the processor, and the processor executes the steps of the static scheduling method when running the computer program.
Compared with the prior art, the technical scheme of the embodiment of the invention has the following beneficial effects:
in the embodiment of the invention, the data types which can be borne by all the static scheduling resources are determined through setting, then when one or only one static scheduling resource can bear the URLLC data type, the static scheduling resource is adopted to send the data to be sent, the data type which can be borne by the static scheduling resource is judged firstly, and then the characteristics of smaller time delay and higher reliability of the URLLC data are utilized to realize that the static scheduling resource which bears the URLLC data is preferentially selected to send the data to be sent.
Further, when a plurality of static scheduling resources can bear the URLLC data type or all the static scheduling resources can only bear the non-URLLC data type, the step of judging the HARQ feedback type is set, so that the static scheduling resources for HARQ retransmission feedback can be preferentially selected to send retransmission data, and the service requirement that the HARQ retransmission feedback is prior to the HARQ new transmission feedback is met.
Further, when the HARQ feedback type with a plurality of static scheduling resources is HARQ retransmission feedback, determining the earliest static scheduling resource at the end time, if there is only one static scheduling resource, adopting the static scheduling resource to transmit the retransmission data, and preferentially adopting the earliest static scheduling resource at the end time to transmit, thereby better meeting the URLLC delay requirement, or avoiding the influence on the EMMB throughput rate and the speed.
Further, when a plurality of static scheduling resources with the same ending time and the earliest all exist, the static scheduling resource with the minimum resource sequence number is preferentially adopted to transmit the data to be transmitted, and different static scheduling resources have different resource sequence numbers, so that the static scheduling resources are uniquely selected to transmit the data to be transmitted under the condition that other conditions of all the static scheduling resources are consistent.
Further, if the HARQ feedback types of all the static scheduling resources are HARQ new feedback, the static scheduling resources with the data volume greater than or equal to the data volume of the data to be sent are preferentially selected, and then the static scheduling resources with the data volume less than the data to be sent and the maximum static scheduling resources are selected, so that the data to be sent is firstly selected to finish sending the data to be sent in a single time, and then the data to be sent is selected to be sent to the maximum extent.
Further, if the first resource to be selected has a plurality of statically scheduled resources, determining the statically scheduled resource with the earliest ending time in the first resource to be selected, and preferentially adopting the statically scheduled resource with the earliest ending time to send the data to be sent.
Further, when a plurality of static scheduling resources with the earliest finishing time exist, the static scheduling resource with the smallest resource sequence number is preferentially adopted to send the data to be sent, and different static scheduling resources have different resource sequence numbers, so that the static scheduling resources are uniquely selected to send the data to be sent under the condition that other conditions of all the static scheduling resources are consistent.
Drawings
FIG. 1 is a flowchart of a method for static scheduling according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a collision scenario in which a first statically scheduled resource and a second statically scheduled resource have different sizes and are transmitted at the same time in the embodiment of the present invention;
fig. 3 is a schematic diagram of a collision scenario in which transmission timings of a first statically scheduled resource and a second statically scheduled resource are different in an embodiment of the present invention;
fig. 4 is a schematic diagram of another collision scenario in which transmission occasions of a first statically scheduled resource and a second statically scheduled resource are different in the embodiment of the present invention;
FIG. 5 is a flow chart of another static scheduling method in an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a static scheduling apparatus according to an embodiment of the present invention.
Detailed Description
In the prior art, in a scenario where an MAC layer in a UE needs to determine an uplink priority, there are a conflict between dynamic scheduling and static scheduling, a conflict between SR and dynamic scheduling/static scheduling, and a conflict between multiple static schedules. When there is a conflict between multiple static schedules, that is, when multiple phy-priority indexes-r 16 are the same and there is an uplink transmission opportunity overlap, there is no specification in the UE protocol how to solve the conflict, and how to determine the final priority of each static schedule. In the existing static scheduling technology, the adopted judgment strategy is to select the static scheduling resource with the minimum sequence number all the time, however, the static scheduling resource with the minimum sequence number may not meet the delay requirement of URLLC, and may also cause the reduction of the EMMB throughput rate and the rate reduction.
The inventor of the present invention has found through research that, in various technologies in the prior art, a single parameter is selected for direct judgment without considering the relationship between parameters and application scenarios, for example, a static scheduling with the smallest sequence number may be selected all the time, a static scheduling with the earliest transmission end may be selected all the time, a static scheduling (CG) capable of transmitting data on a second priority LCH in an LCH group may be selected all the time, a CG with a longer data delay may be selected all the time, and the like. Further, if the strategy is unreasonable, the URLLC can be subjected to service delay increase, and the delay requirement of the URLLC cannot be met; for EMMB, a rate reduction results.
In the embodiment of the invention, the data types which can be borne by all the static scheduling resources are determined through setting, then when one or only one static scheduling resource can bear the URLLC data type, the static scheduling resource is adopted to send the data to be sent, the data type which can be borne by the static scheduling resource is judged firstly, and then the characteristics of smaller time delay and higher reliability of the URLLC data are utilized to realize that the static scheduling resource which bears the URLLC data is preferentially selected to send the data to be sent.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in detail below.
Referring to fig. 1, fig. 1 is a flowchart of a static scheduling method in an embodiment of the present invention. The static scheduling method may include steps S11 to S12:
step S11: when the priorities of a plurality of static scheduling resources are the same and conflict, determining the data types which can be borne by each static scheduling resource;
step S12: and if one or only one static scheduling resource can bear the URLLC data type in the plurality of the static scheduling resources with conflicts, adopting the static scheduling resource to send the data to be sent.
It will be appreciated that in a specific implementation, the method may be implemented in the form of a software program running on a processor integrated within a chip or chip module.
In the specific implementation of step S11, the type of data that can be carried by each statically scheduled resource can be determined in a conventional manner.
In particular, the data type may be selected from: URLLC data, EMMB data, Signaling Radio Bearer (SRB) data.
In a specific implementation, the determination may be performed according to the communication protocol 38321 and combined with other suitable modules, and a specific determination method in this embodiment is not limited in this application.
Regarding the method for determining the type of URLLC data, 5G quality of Service (5GQuality of Service identified value, 5QI) can be determined by the TS23.501 table in the third Generation Partnership Project (3rd Generation Partnership Project, 3GPP), and determined as the type of URLLC data according to the value (value) of 5 QI.
In one non-limiting example, the 5QI value can be 80, 82-86.
Further, for a scenario where the priorities of the statically scheduled resources are the same and there is a conflict, multiple situations may be included.
Referring to fig. 2 to fig. 4, fig. 2 is a schematic diagram of a collision scenario where sizes of a first persistent scheduling resource and a second persistent scheduling resource are different and transmission start timings are the same and transmission end timings are different in an embodiment of the present invention, fig. 3 is a schematic diagram of a collision scenario where transmission start and transmission end timings of a first persistent scheduling resource and a second persistent scheduling resource are different in an embodiment of the present invention, and fig. 4 is a schematic diagram of another collision scenario where transmission start and transmission end timings of a first persistent scheduling resource and a second persistent scheduling resource are different in an embodiment of the present invention.
As shown in the figure, several cases of collision are described by taking a scenario in which two CGs have the same priority and have collision as an example. Here, two periods (Periodicity1) in each statically scheduled resource 1(Grant1) are taken as an example for explanation, four periods (Periodicity2) in each statically scheduled resource 2(Grant2) are taken as an example for explanation, a period of Grant1 includes a symbol (sym) of 4 × 14, a slot (slot) includes 14 symbols (sym) is taken as an example for explanation, and a period of Grant2 includes a symbol of 2 × 14. It should be noted that, in the embodiment of the present invention, the number of periods of the statically scheduled resource is not limited.
In fig. 2, CG1 and CG2 have the same priority and have a collision, and the transmission start timings are the same, but the resource block sizes of the first persistent scheduling resource (Grant1) and the second persistent scheduling resource (Grant2) are different.
In fig. 3, CG1 and CG2 have the same priority and conflict, and the transmission start timing is different, and the start Time (start) and end Time (end) of the Timing (TO) of the first statically scheduled resource are both earlier than the second statically scheduled resource.
The first static scheduling resource and the second static scheduling resource may be the same in size or different in size.
In fig. 4, CG1 and CG2 have the same priority and have a collision, and have different transmission start timings, and the TO start time of the first statically scheduled resource is earlier than the second statically scheduled resource, but the TO end time is later than the second statically scheduled resource.
In a specific implementation of step S12, in the multiple statically scheduled resources with conflicts, if there is one and only one statically scheduled resource capable of carrying the URLLC data type, the statically scheduled resource is used to send the data to be sent.
It can be understood that the type capable of carrying URLLC data may include three cases: there is one or only one static scheduling resource capable of carrying the URLLC data type, there are multiple static scheduling resources capable of carrying the URLLC data type and all static scheduling resources capable of carrying only non-URLLC data types. The following description will be made for three cases, respectively.
Further, the non-URLLC data is selected from EMMB data and SRB data.
In the embodiment of the invention, the data types which can be carried by each static scheduling resource are determined through setting, then when one or only one static scheduling resource can carry the URLLC data type, the static scheduling resource is adopted to send the data to be sent, the data type which can be carried by the static scheduling resource is judged firstly, and then the data to be sent is sent by preferentially selecting the static scheduling resource carrying the URLLC data by utilizing the characteristics of smaller time delay and higher reliability of the URLLC data.
Further, the static scheduling method may further include: if a plurality of static scheduling resources can bear the URLLC data type, judging the Hybrid Automatic Repeat Request (HARQ) feedback type of each static scheduling resource which can bear the URLLC data type. If the HARQ feedback type of one static scheduling resource is HARQ retransmission feedback, the static scheduling resource is adopted to send the retransmission data; or, if all the static scheduling resources can only bear the non-URLLC data type, judging the HARQ feedback type of each static scheduling resource; if the HARQ feedback type of one or only one static scheduling resource is HARQ retransmission feedback, the static scheduling resource is adopted to send retransmission data; wherein the HARQ feedback type is selected from HARQ retransmission feedback and HARQ new transmission feedback.
It can be understood that the HARQ feedback type of each statically scheduled resource capable of carrying a URLLC data type may include three cases: the HARQ feedback type of one or only one static scheduling resource is HARQ retransmission feedback, the HARQ feedback type of a plurality of static scheduling resources is HARQ retransmission feedback, and the HARQ feedback types of all the static scheduling resources are HARQ new transmission feedback. The following description will be made for three cases, respectively.
In specific implementation, the HARQ ID may be calculated according to the sending time of the persistent scheduling resource, and the HARQ ID may be determined as retransmission or new transmission according to a HARQ ID list (list) notified by the network side in advance, or the terminal may determine the HARQ ID as retransmission or new transmission according to a timer.
It should be noted that the HARQ retransmission feedback has a service requirement prior to the HARQ new feedback, so when there is and only one HARQ feedback type of the static scheduling resource is the HARQ retransmission feedback, the static scheduling resource wins the conflict decision, and the step of sending the data to be sent by using the static scheduling resource is essentially to send the retransmission data.
In the embodiment of the invention, when a plurality of static scheduling resources can bear the URLLC data type or all the static scheduling resources can only bear the non-URLLC data type, the step of judging the HARQ feedback type is set, so that the static scheduling resources fed back by the HARQ retransmission can be preferentially selected to send the retransmission data, and the service requirement that the HARQ retransmission feedback is prior to the HARQ new feedback is met.
Further, in the process of judging the HARQ feedback type, if the HARQ feedback type of the plurality of static scheduling resources is HARQ retransmission feedback, determining the static scheduling resource with the earliest ending time; if the static scheduling resource with the earliest finishing time exists, the static scheduling resource is adopted to send the retransmission data; and the static scheduling resource fed back by the HARQ retransmission is more than or equal to the data volume of the retransmission data.
In the embodiment of the invention, when the HARQ feedback type with a plurality of static scheduling resources is HARQ retransmission feedback, the earliest static scheduling resource at the ending time is determined, if there is only one static scheduling resource, the static scheduling resource is adopted to transmit the retransmission data, and the earliest static scheduling resource at the ending time can be preferentially adopted to transmit, so that the URLLC time delay requirement is better met, or the influence on the EMMB throughput rate and the speed is avoided.
Further, if there are multiple persistent scheduling resources whose ending time is the same and all are the earliest, the persistent scheduling resource with the smallest resource sequence number is selected from the multiple persistent scheduling resources whose ending time is the same and all are the earliest to transmit the retransmission data.
In the embodiment of the invention, when a plurality of static scheduling resources with the same ending time and the earliest all exist, the static scheduling resource with the minimum resource sequence number is preferentially adopted to transmit the data to be transmitted, and different static scheduling resources have different resource sequence numbers, so that the static scheduling resources are uniquely selected to transmit the data to be transmitted under the condition that other conditions of all the static scheduling resources are consistent.
As can be seen from the above, in the embodiment of the present invention, for the case that the HARQ feedback type of the multiple statically scheduled resources is HARQ retransmission feedback, if there is uplink collision in the multiple statically scheduled resources with the same priority, the static scheduling may be comprehensively performed with collision resolution according to the service characteristics, the HARQ new transmission or retransmission, the resource ending time, the resource sequence number (Index), and other factors, so as to more comprehensively deal with the collision problem.
The following describes a case where HARQ feedback types of all static scheduling resources are HARQ new feedback.
Further, the static scheduling method may further include: if the HARQ feedback types of all the static scheduling resources are HARQ new feedback, determining all the static scheduling resources; if the static scheduling resource with the data volume larger than or equal to the data volume of the data to be transmitted exists, selecting the static scheduling resource with the data volume larger than or equal to the data volume of the data to be transmitted and the minimum static scheduling resource as a first resource to be selected; if the first resource to be selected has only one static scheduling resource, the static scheduling resource is adopted to send the data to be sent; if the static scheduling resource which is larger than or equal to the data volume of the data to be sent does not exist, selecting the static scheduling resource which is smaller than the data volume of the data to be sent and has the largest data volume, and marking as a second resource to be selected; and if the second resource to be selected has one or only one static scheduling resource, the static scheduling resource is adopted to send the data to be sent.
In a specific implementation manner of the embodiment of the present invention, the resources to be selected of 100 bytes need to be transmitted, and if there are currently static scheduling resources of 60 bytes, 90 bytes, 130 bytes, and 150 bytes, the resources of 130 bytes are preferentially adopted, and the transmission is completed in a single time.
In a specific implementation manner of the embodiment of the present invention, if there are resources to be selected that need to transmit 100 bytes and currently there are static scheduling resources of 60 bytes and 90 bytes, the resources of 90 bytes are preferentially adopted, so that the data to be transmitted is transmitted to the maximum extent when a single transmission is not completed.
In the embodiment of the invention, if the HARQ feedback types of all the static scheduling resources are HARQ new feedback, the static scheduling resources with the data volume more than or equal to the data to be sent are preferentially selected, so that the single sending can be finished; and secondly, selecting the data volume which is less than the data to be sent and the largest static scheduling resource, thereby being capable of sending the data to be sent to the greatest extent under the condition that the single sending is not enough.
The following respectively describes the first candidate resource and the second candidate resource.
Furthermore, the static scheduling method further includes: if the first resource to be selected has a plurality of static scheduling resources, determining the static scheduling resource with the earliest ending time in the first resource to be selected; and if the static scheduling resource with the earliest finishing time exists, adopting the static scheduling resource to send the data to be sent.
In the embodiment of the present invention, if the first candidate resource has multiple statically scheduled resources, the statically scheduled resource with the earliest ending time in the first candidate resource is determined, and the statically scheduled resource with the earliest ending time is preferentially adopted to transmit the data to be transmitted.
Further, the static scheduling method further includes: and if a plurality of static scheduling resources with the earliest finishing time exist, selecting the static scheduling resource with the minimum resource sequence number from the first to-be-selected resources to send the to-be-sent data.
In the embodiment of the invention, when a plurality of static scheduling resources with the earliest finishing time exist, the static scheduling resource with the minimum resource sequence number is preferentially adopted to send the data to be sent, and different static scheduling resources have different resource sequence numbers, so that the static scheduling resources are uniquely selected to send the data to be sent under the condition that other conditions of all the static scheduling resources are consistent.
Further, the static scheduling method may further include: if the second resource to be selected has a plurality of static scheduling resources, determining the static scheduling resource with the earliest end time in the second resource to be selected; and if the static scheduling resource with the earliest finishing time exists, adopting the static scheduling resource to send the data to be sent.
In this embodiment of the present invention, if the second candidate resource has multiple statically scheduled resources, the statically scheduled resource with the earliest ending time in the second candidate resource is determined, and the statically scheduled resource with the earliest ending time is preferentially adopted to send the data to be sent.
Further, if there are multiple static scheduling resources with the earliest ending time, selecting the static scheduling resource with the smallest resource sequence number from the second candidate resources to send the data to be sent.
In the embodiment of the invention, when a plurality of static scheduling resources with the earliest finishing time exist, the static scheduling resource with the smallest resource sequence number is preferentially adopted to transmit the data to be transmitted, and different static scheduling resources have different resource sequence numbers, so that the static scheduling resources are uniquely selected to transmit the data to be transmitted under the condition that other conditions of all the static scheduling resources are consistent.
As can be seen from the above, in the embodiment of the present invention, for the case that the HARQ feedback types of all the statically scheduled resources are HARQ new transmission feedback, if there is an uplink conflict in multiple statically scheduled resources with the same priority, the conflict resolution may be comprehensively performed on the statically scheduled resources according to the service characteristics, the comparison relationship between the HARQ new transmission or retransmission, the data amount of the data to be transmitted and the statically scheduled resources, the ending time, the resource sequence number (Index), and other factors, so as to more comprehensively deal with the conflict problem.
Referring to fig. 5, fig. 5 is a flowchart of another static scheduling method in the embodiment of the present invention. The other static scheduling method may include steps S501 to S525.
In the flowchart shown in fig. 5, the relationship and the order of the steps are visually demonstrated, and the steps are explained below.
In step S501, when the priorities of the multiple statically scheduled resources are the same and there is a conflict, the data types that can be carried by the statically scheduled resources are determined.
In step S502, it is determined whether there is and only one persistent scheduling resource capable of carrying the URLLC data type, if yes, step S521 is executed, and if no, step S503 or S504 is executed.
In step S503, if there are multiple persistent scheduling resources capable of carrying the URLLC data type, the HARQ feedback type of each persistent scheduling resource capable of carrying the URLLC data type is determined.
In a first non-limiting embodiment, taking the number of all static scheduling resources as 10 and the number of static scheduling resources capable of bearing a URLLC data type as 6 as an example, the number of static scheduling resources capable of bearing a non-URLLC data type is 4, and in the association step after step S503, a determination is made as to the 6 static scheduling resources capable of bearing a URLLC data type, that is, the number of static scheduling resources to be confirmed is 6.
In step S504, if all the static scheduling resources can only carry non-URLLC data types, the HARQ feedback type of each static scheduling resource is determined.
In the second non-limiting embodiment, taking the number of all static scheduling resources as 10 and the number of static scheduling resources capable of carrying non-URLLC data types as 10 as an example, in the association step after step S504, a judgment is made for all 10 static scheduling resources, that is, the number of static scheduling resources to be confirmed is 10.
In step S505, it is determined whether there is and only one HARQ feedback type of the static scheduling resource is HARQ retransmission feedback, if the determination result is yes, step S522 is executed, and if the determination result is no, step S506 or step S510 is executed.
It should be noted that, in the embodiment of the present invention, when the HARQ feedback type of not and only one static scheduling resource is HARQ retransmission feedback, there may be two cases: the first is that the HARQ feedback type of the multiple static scheduling resources to be acknowledged is HARQ retransmission feedback, and the number of the static scheduling resources for HARQ new feedback is not limited (that is, the number of the static scheduling resources for HARQ new feedback may be zero, or may be one or more), at this time, step S506 is executed; the second is that the HARQ feedback type of the multiple statically scheduled resources to be acknowledged is HARQ new transmission feedback, and then step S510 is executed.
In step S506, if the HARQ feedback type of the multiple statically scheduled resources is HARQ retransmission feedback, the statically scheduled resource with the earliest ending time is determined.
It should be noted that, if the association step before the step S506 is step S503, the to-be-confirmed statically scheduled resources are statically scheduled resources capable of carrying a URLLC data type, in the foregoing first non-limiting embodiment, the number of the to-be-confirmed statically scheduled resources is 6, that is, if there are multiple HARQ feedback types of the statically scheduled resources in the statically scheduled resources capable of carrying the URLLC data type, the HARQ feedback type is HARQ retransmission feedback.
If the association step before the step S506 is step S504, the number of the to-be-confirmed statically scheduled resources is 10, that is, the HARQ feedback type if there are multiple statically scheduled resources in the statically scheduled resources that can carry the non-URLLC data type is HARQ retransmission feedback in the second non-limiting embodiment.
In step S507, it is determined whether there is one and only one persistent scheduling resource with the earliest ending time, if yes, step S522 is executed, and if no, step S508 is executed.
In step S508, if there are multiple persistent scheduling resources having the same ending time and all of which are the earliest, the persistent scheduling resource having the smallest resource number is selected from the multiple persistent scheduling resources having the same ending time and all of which are the earliest, and the retransmission data is transmitted.
In step S509, it is determined whether there is and only one HARQ feedback type of the static scheduling resource is HARQ retransmission feedback, if yes, step S520 is executed, and if no, step S506 or S510 is executed.
It should be noted that, in the embodiment of the present invention, when the HARQ feedback type of not and only one static scheduling resource is HARQ retransmission feedback, there may be two cases: the first is that the HARQ feedback type of the multiple static scheduling resources to be acknowledged is HARQ retransmission feedback, and the number of the static scheduling resources for HARQ new feedback is not limited (that is, the number of the static scheduling resources for HARQ new feedback may be zero, or may be one or more), at this time, step S506 is executed; the second is that the HARQ feedback type of the multiple statically scheduled resources to be acknowledged is HARQ new transmission feedback, and then step S510 is executed.
In step S510, if the HARQ feedback types of the to-be-confirmed statically scheduled resources are HARQ new feedback, the to-be-confirmed statically scheduled resources are determined.
It should be noted that, if the association step before the step S510 is step S503, the number of the to-be-confirmed statically scheduled resources is 6, that is, if there are multiple HARQ feedback types of the statically scheduled resources in the statically scheduled resources capable of carrying the URLLC data type, the HARQ feedback type is HARQ retransmission feedback.
If the association step before the step S510 is step S504, the number of the to-be-confirmed statically scheduled resources is 10, that is, the HARQ feedback type if there are multiple statically scheduled resources in the statically scheduled resources that can carry the non-URLLC data type is HARQ retransmission feedback in the second non-limiting embodiment.
In step S511, it is determined whether or not there is a persistent scheduling resource equal to or larger than the data amount of the data to be transmitted, and if the determination result is yes, step S512 is executed, and if the determination result is no, step S513 is executed.
It should be noted that in step S511, on the basis of step S510, it is determined whether or not there is a persistent scheduling resource with a data amount equal to or larger than the data amount of the data to be transmitted in the persistent scheduling resources to be confirmed.
In step S512, a first resource to be selected is selected.
Specifically, if there is a static scheduling resource that is greater than or equal to the data amount of the data to be transmitted, the data amount of the data to be transmitted is selected, and the smallest static scheduling resource is marked as the first resource to be selected.
In step S513, a second resource to be selected is selected.
Specifically, if there is no static scheduling resource greater than or equal to the data volume of the data to be sent, the largest static scheduling resource smaller than the data volume of the data to be sent is selected and marked as a second resource to be selected.
In step S514, it is determined whether there is and only one persistent scheduling resource, if yes, step S524 is executed, and if no, step S516 is executed.
In step S515, it is determined whether there is and only one persistent scheduling resource, if yes, step S524 is executed, and if no, step S517 is executed.
It should be noted that, in step S514, it is determined whether the range is the first candidate resource and has only one statically scheduled resource, and in step S515, it is determined whether the range is the second candidate resource and has only one statically scheduled resource.
In step S516, the statically scheduled resource with the earliest ending time in the first candidate resource is determined.
In step S517, the statically scheduled resource with the earliest ending time in the second candidate resources is determined.
In step S518, it is determined whether there is and only one persistent scheduling resource, if yes, step S524 is executed, and if no, step S523 is executed.
Specifically, it is determined whether there is one and only one static scheduling resource in the static scheduling resources with the earliest ending time in the first candidate resources.
In step S519, it is determined whether there is one and only one persistent scheduling resource, and if the determination result is yes, step S524 is executed, and if the determination result is no, step S525 is executed.
Specifically, it is determined whether there is one and only one static scheduling resource in the static scheduling resource with the earliest ending time in the second candidate resources.
In step S520, the retransmission data is transmitted using the persistent scheduling resource.
In step S521, the data to be transmitted is transmitted by using the static scheduling resource.
In step S522, the retransmission data is transmitted using the persistent scheduling resource.
In step S523, the static scheduling resource with the smallest resource sequence number is selected to send the data to be sent.
Specifically, in the static scheduling resource with the earliest ending time in the first resource to be selected, if there is one and only one static scheduling resource, the static scheduling resource is used to send data to be sent.
In step S524, the data to be transmitted is transmitted by using the static scheduling resource.
Specifically, in the static scheduling resource with the earliest ending time in the second candidate resources, if there is one or only one static scheduling resource, the static scheduling resource is used to send the data to be sent.
In step S525, the static scheduling resource with the smallest resource sequence number is selected to transmit the data to be transmitted.
It is to be understood that the static scheduling resources described in step S520 to step S525 are all static scheduling resources selected within a corresponding range.
In the specific implementation, please refer to the description of steps S101 and S102 in fig. 1 for further details regarding steps S501 to S525, which are not described herein again.
Referring to fig. 6, fig. 6 is a schematic structural diagram of a static scheduling apparatus in an embodiment of the present invention. The static scheduling apparatus may include:
a data type determining module 61, configured to determine a data type that can be carried by each static scheduling resource when the priorities of the multiple static scheduling resources are the same and conflict;
and a resource selection module 62, configured to, in the multiple static scheduling resources where there is a conflict, if there is one or only one static scheduling resource capable of bearing the URLLC data type, send data to be sent using the static scheduling resource.
In a specific implementation, the apparatus may correspond to a chip having a data processing function in a user equipment; or to a chip module comprising a chip with data processing function in the user equipment, or to the user equipment.
For the principle, specific implementation and beneficial effects of the static scheduling apparatus, please refer to the related description about the static scheduling method described above, and details are not repeated herein.
In the embodiment of the invention, the data types which can be borne by all the static scheduling resources are determined through setting, then when one or only one static scheduling resource can bear the URLLC data type, the static scheduling resource is adopted to send the data to be sent, the data type which can be borne by the static scheduling resource is judged firstly, and then the characteristics of smaller time delay and higher reliability of the URLLC data are utilized to realize that the static scheduling resource which bears the URLLC data is preferentially selected to send the data to be sent.
Embodiments of the present invention also provide a readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to perform the steps of the above method. The readable storage medium may be a computer readable storage medium, and may include, for example, a non-volatile (non-volatile) or non-transitory (non-transitory) memory, and may further include an optical disc, a mechanical hard disk, a solid state hard disk, and the like.
Specifically, in the embodiment of the present invention, the processor may be a Central Processing Unit (CPU), and the processor may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
It will also be appreciated that the memory in the embodiments of the subject application can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. The nonvolatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash memory. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of example and not limitation, many forms of Random Access Memory (RAM) are available, such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (enhanced SDRAM), SDRAM (SLDRAM), synchlink DRAM (SLDRAM), and direct bus RAM (DR RAM).
The embodiment of the invention also provides a terminal, which comprises a memory and a processor, wherein the memory is stored with a computer program capable of running on the processor, and the processor executes the steps of the method when running the computer program. The terminal includes, but is not limited to, a mobile phone, a computer, a tablet computer and other terminal devices.
Specifically, a terminal in this embodiment may refer to various forms of User Equipment (UE), an access terminal, a subscriber unit, a subscriber station, a Mobile Station (MS), a remote station, a remote terminal, a mobile device, a user terminal, a terminal device (terminal device), a wireless communication device, a user agent, or a user equipment. The terminal device may also be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with a Wireless communication function, a computing device or other processing devices connected to a Wireless modem, a vehicle-mounted device, a wearable device, a terminal device in a future 5G Network or a terminal device in a future evolved Public Land Mobile Network (PLMN), and the like, which is not limited in this embodiment.
Each module/unit included in each apparatus and product described in the above embodiments may be a software module/unit, or may also be a hardware module/unit, or may also be a part of a software module/unit and a part of a hardware module/unit. For example, for each device or product applied to or integrated into a chip, each module/unit included in the device or product may be implemented by hardware such as a circuit, or at least a part of the module/unit may be implemented by a software program running on a processor integrated within the chip, and the rest (if any) part of the module/unit may be implemented by hardware such as a circuit; for each device and product applied to or integrated with the chip module, each module/unit included in the device and product may be implemented by hardware such as a circuit, and different modules/units may be located in the same component (e.g., a chip, a circuit module, etc.) or different components of the chip module, or at least part of the modules/units may be implemented by a software program running on a processor integrated inside the chip module, and the rest (if any) part of the modules/units may be implemented by hardware such as a circuit; for each device and product applied to or integrated in the terminal, each module/unit included in the device and product may be implemented by using hardware such as a circuit, and different modules/units may be located in the same component (e.g., a chip, a circuit module, etc.) or different components in the terminal, or at least part of the modules/units may be implemented by using a software program running on a processor integrated in the terminal, and the rest (if any) part of the modules/units may be implemented by using hardware such as a circuit.
Although the present invention is disclosed above, the present invention is not limited thereto. Various changes and modifications may be effected therein by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.

Claims (13)

1. A static scheduling method, comprising:
when the priorities of a plurality of static scheduling resources are the same and conflict, determining the data types which can be borne by each static scheduling resource;
and if one or only one static scheduling resource can bear the URLLC data type in the plurality of the static scheduling resources with conflicts, adopting the static scheduling resource to send the data to be sent.
2. The static scheduling method of claim 1, further comprising:
if a plurality of static scheduling resources can bear the URLLC data type, judging the HARQ feedback type of each static scheduling resource which can bear the URLLC data type;
if the HARQ feedback type of one static scheduling resource is HARQ retransmission feedback, the static scheduling resource is adopted to send retransmission data;
alternatively, the first and second electrodes may be,
if all the static scheduling resources can only bear the non-URLLC data type, judging the HARQ feedback type of each static scheduling resource;
if the HARQ feedback type of one static scheduling resource is HARQ retransmission feedback, the static scheduling resource is adopted to send retransmission data;
wherein the HARQ feedback type is selected from HARQ retransmission feedback and HARQ new transmission feedback.
3. The static scheduling method of claim 2, wherein said non-URLLC data is selected from EMMB data and SRB data.
4. The static scheduling method of claim 2, further comprising:
in the process of judging the HARQ feedback type, if the HARQ feedback type of a plurality of static scheduling resources is HARQ retransmission feedback, determining the static scheduling resource with the earliest ending time;
if the static scheduling resource with the earliest finishing time exists, the static scheduling resource is adopted to send the retransmission data;
and the static scheduling resource fed back by the HARQ retransmission is more than or equal to the data volume of the retransmission data.
5. The static scheduling method of claim 4, further comprising:
and if a plurality of static scheduling resources with the same ending time and the earliest all exist, selecting the static scheduling resource with the minimum resource sequence number from the plurality of static scheduling resources with the same ending time and the earliest all to transmit the retransmission data.
6. The static scheduling method of claim 2, further comprising:
if the HARQ feedback types of all the static scheduling resources are HARQ new feedback, determining all the static scheduling resources;
if the static scheduling resource with the data volume larger than or equal to the data volume of the data to be transmitted exists, selecting the static scheduling resource with the data volume larger than or equal to the data volume of the data to be transmitted and the minimum static scheduling resource as a first resource to be selected;
if the first resource to be selected has one or more static scheduling resources, the static scheduling resources are adopted to send the data to be sent;
if the static scheduling resource which is larger than or equal to the data volume of the data to be sent does not exist, selecting the static scheduling resource which is smaller than the data volume of the data to be sent and has the largest data volume, and marking as a second resource to be selected;
and if the second resource to be selected has one static scheduling resource and only one static scheduling resource, adopting the static scheduling resource to send the data to be sent.
7. The static scheduling method of claim 6, further comprising:
if the first resource to be selected has a plurality of statically scheduled resources, determining the statically scheduled resource with the earliest ending moment in the first resource to be selected;
and if the static scheduling resource with the earliest finishing time exists, adopting the static scheduling resource to send the data to be sent.
8. The static scheduling method of claim 7, further comprising:
and if a plurality of static scheduling resources with the earliest finishing time exist, selecting the static scheduling resource with the minimum resource sequence number from the first to-be-selected resources to send the to-be-sent data.
9. The static scheduling method of claim 6, further comprising:
if the second resource to be selected has a plurality of static scheduling resources, determining the static scheduling resource with the earliest end time in the second resource to be selected;
and if the static scheduling resource with the earliest finishing time exists, adopting the static scheduling resource to send the data to be sent.
10. The static scheduling method of claim 9, further comprising:
and if a plurality of static scheduling resources with the earliest finishing time exist, selecting the static scheduling resource with the minimum resource sequence number from the second resources to be selected to send the data to be sent.
11. A static scheduling apparatus, comprising:
the data type determining module is used for determining the data type which can be borne by each static scheduling resource when the priorities of the static scheduling resources are the same and conflict;
and the resource selection module is used for sending the data to be sent by adopting the static scheduling resources if one or only one static scheduling resource can bear the URLLC data type in the plurality of the static scheduling resources with conflicts.
12. A readable storage medium, having stored thereon a computer program, characterized in that the computer program, when being executed by a processor, is adapted to perform the steps of the static scheduling method according to any of the claims 1 to 10.
13. A terminal comprising a memory and a processor, the memory having stored thereon a computer program operable on the processor, wherein the processor executes the computer program to perform the steps of the static scheduling method of any of claims 1 to 10.
CN202110688172.2A 2021-06-21 2021-06-21 Static scheduling method and device, readable storage medium and terminal Active CN113347730B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110688172.2A CN113347730B (en) 2021-06-21 2021-06-21 Static scheduling method and device, readable storage medium and terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110688172.2A CN113347730B (en) 2021-06-21 2021-06-21 Static scheduling method and device, readable storage medium and terminal

Publications (2)

Publication Number Publication Date
CN113347730A CN113347730A (en) 2021-09-03
CN113347730B true CN113347730B (en) 2022-08-19

Family

ID=77478458

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110688172.2A Active CN113347730B (en) 2021-06-21 2021-06-21 Static scheduling method and device, readable storage medium and terminal

Country Status (1)

Country Link
CN (1) CN113347730B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108882385A (en) * 2018-07-20 2018-11-23 京信通信系统（中国）有限公司 Semi-static scheduling method and device
CN109286986A (en) * 2018-11-09 2019-01-29 维沃移动通信有限公司 Semi-persistent scheduling transfer resource determines method, terminal and the network equipment
CN112135357A (en) * 2019-06-25 2020-12-25 夏普株式会社 User equipment, base station and method thereof
CN112534913A (en) * 2019-07-17 2021-03-19 北京小米移动软件有限公司 PUSCH receiving method and device, and PUSCH sending method and device
CN112567849A (en) * 2018-08-09 2021-03-26 夏普株式会社 Channel collision handling for URLLC, and ACK feedback on/off for HARQ-ACK for URLLC PDSCH transmission
WO2021111424A1 (en) * 2019-12-05 2021-06-10 Telefonaktiebolaget Lm Ericsson (Publ) Resolving collision of semi-persistent scheduling data

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3915314B1 (en) * 2019-01-24 2024-02-21 QUALCOMM Incorporated Enhancements to support multiple semi-persistent resource allocations per serving cell

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108882385A (en) * 2018-07-20 2018-11-23 京信通信系统（中国）有限公司 Semi-static scheduling method and device
CN112567849A (en) * 2018-08-09 2021-03-26 夏普株式会社 Channel collision handling for URLLC, and ACK feedback on/off for HARQ-ACK for URLLC PDSCH transmission
CN109286986A (en) * 2018-11-09 2019-01-29 维沃移动通信有限公司 Semi-persistent scheduling transfer resource determines method, terminal and the network equipment
CN112135357A (en) * 2019-06-25 2020-12-25 夏普株式会社 User equipment, base station and method thereof
CN112534913A (en) * 2019-07-17 2021-03-19 北京小米移动软件有限公司 PUSCH receiving method and device, and PUSCH sending method and device
WO2021111424A1 (en) * 2019-12-05 2021-06-10 Telefonaktiebolaget Lm Ericsson (Publ) Resolving collision of semi-persistent scheduling data

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
R1-1910021 "Discussion on DL SPS enhancements for URLLC";Spreadtrum Communications;《3GPP tsg_ran\wg1_rl1》;20190927;全文 *
R1-1910347 "Discussion on PUSCH resource collision and DL SPS enhancement";CATT;《3GPP tsg_ran\wg1_rl1》;20190930;全文 *

Also Published As

Publication number Publication date
CN113347730A (en) 2021-09-03

Similar Documents

Publication Publication Date Title
WO2022062891A1 (en) Resource indication method and apparatus for prs under sidelink communication, and storage medium and terminal
WO2020248733A1 (en) Dual-card ue data transmission method and device, storage medium and user equipment
US20220330184A1 (en) Method for uplink synchronization, communication apparatus, and storage medium
US11937306B2 (en) System information transmission method, terminal and network device
EP3852456A1 (en) Communication method and communication apparatus
US11706757B2 (en) Data transmission method and terminal device
TW202008838A (en) Random access method, terminal device, and storage medium
WO2020215262A1 (en) Power allocation method and terminal device
TW202019205A (en) Resource allocation method and apparatus, and terminal
CN108293255A (en) Business transmitting method and communication equipment
JP2022516899A (en) Wireless communication method and equipment
JP2020534713A (en) Signal transmission method and terminal device
EP3739772B1 (en) Relay network duplex coordination method and relay node device
CN109996334A (en) Information indicating method, terminal device and the network equipment
CN107534984B (en) Configuration method and equipment of component carrier group
CN108882221A (en) Execute the device and method of modification program
WO2022032654A1 (en) Wireless communication method, terminal device, and network device
CN113347730B (en) Static scheduling method and device, readable storage medium and terminal
CN112311517A (en) Uplink information sending method and related product
WO2021016979A1 (en) Wireless communication method and terminal device
CN109587818B (en) Information transmission method and device
US10165568B2 (en) Data communication apparatus, computer readable medium, and satellite communication system
EP4030843B1 (en) Method processing for split resources and processing device
WO2021134525A1 (en) Wireless communication method and apparatus, and communication device
TW202008817A (en) Signal transmission method and apparatus, terminal device, and network device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant