Downlink data sending and receiving method and device

By selecting non-overlapping PDSCHs in the 5G mobile communication system for data transmission and reception, the problem of feedback information transmission failure caused by the terminal device being unable to receive all PDSCHs is solved, and data transmission efficiency and resource utilization are improved.

CN113518445BActive Publication Date: 2024-11-01HUAWEI TECH CO LTD
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202010281126.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-04-10
Publication Date
2024-11-01
Estimated Expiration
2040-04-10

AI Technical Summary

Technical Problem

In 5G mobile communication system, due to limited capabilities, terminal devices may not be able to receive all repeated transmission physical downlink shared channels (PDSCHs), resulting in the failure of feedback information transmission, increasing the probability of retransmission of downlink data and reducing data transmission efficiency.

Method used

In a network device, when multiple PDSCHs overlap in the time domain, non-overlapping PDSCHs are selected for data transmission and reception, ensuring that feedback information is received and reducing the probability of data retransmission. The specific method includes selecting M non-overlapping PDSCHs among P PDSCHs in a time slot for data transmission, and receiving and sending feedback information on M PDSCHs, and preferentially transmitting the repeated transmission data to improve reliability.

Benefits of technology

By reducing the probability of data retransmission, the transmission efficiency of downlink data is improved, the processing complexity and power consumption of network equipment and terminal equipment are reduced, and the resource utilization rate is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113518445B_ABST
    Figure CN113518445B_ABST
Patent Text Reader

Abstract

The downlink data sending and receiving method and device disclosed in the present application relate to the field of communications, and solve the problem that the failure to send feedback information increases the probability of retransmission of downlink data and reduces the transmission efficiency of data. When at least two PDSCHs in P PDSCHs in a time slot overlap in the time domain, the network device will cancel the transmission of the partially overlapping PDSCHs. If one of the first PDSCHs that is canceled is the last repetition of the PDSCH repetition of the first data, and before the first PDSCH, the terminal device receives other repetitions of the PDSCH repetition of the first data, the terminal device will still send the feedback information of the first data to the network device in the feedback time slot corresponding to the first PDSCH, thereby reducing the probability of retransmission of the first data and improving the transmission efficiency of the data.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of communications, and in particular to a method and device for sending and receiving downlink data. Background Art

[0002] In order to cope with the explosive growth of mobile data traffic, massive mobile communication device connections, and the emergence of various new services and application scenarios in the future, the fifth generation (5G) mobile communication system came into being. For wireless control in industrial manufacturing or production processes, motion control of unmanned vehicles and unmanned aircraft, and tactile interactive applications such as remote repair and remote surgery, the International Telecommunication Union (ITU) has defined ultra-reliable and low-latency communications (URLLC). The main characteristics of URLLC services are ultra-high reliability, low latency, small amount of transmitted data, and burstiness.

[0003] In order to ensure the requirements of ultra-high reliability and low latency, the physical downlink shared channel (PDSCH) can be repeatedly transmitted within a time unit (such as a time slot or a sub-time slot). Usually, after receiving the downlink data, the terminal device determines the second time unit based on the first time unit of the last repetition in the received PDSCH repetition and the offset value K1, so as to feedback the decoding result of the downlink data to the network device in the second time unit. However, if there are multiple overlapping PDSCHs within the first time unit, the terminal device may only be able to receive part of the PDSCH due to the limited capabilities of the terminal device. If the last repeatedly transmitted PDSCH is not received, the feedback information fails to be sent, which increases the probability of retransmission of the downlink data and reduces the data transmission efficiency. Summary of the invention

[0004] The method and device for sending and receiving downlink data provided in the present application solve the problem that the failure of sending feedback information increases the probability of retransmission of downlink data and reduces the transmission efficiency of data.

[0005] In order to achieve the above objectives, this application adopts the following technical solutions:

[0006] In a first aspect, the present application provides a method for sending downlink data, which can be applied to a network device, and can also be applied to a communication device that can support the network device to implement the method. For example, the communication device includes a chip system, and the method includes: when the network device determines that there are at least two PDSCHs overlapping in the time domain among the P PDSCHs in the first time unit, M PDSCHs that do not overlap in the time domain are selected from the P PDSCHs, data is sent to the terminal device only on the M PDSCHs, and feedback information corresponding to the M PDSCHs from the terminal device is received. Among them, the P PDSCHs include a PDSCH without a corresponding physical downlink control channel (physical downlink control channel, PDCCH), and P is an integer greater than 1. M is equal to 1; or, M is an integer greater than 1 and less than P.

[0007] In addition, if the first PDSCH is a PDSCH other than M PDSCHs among P PDSCHs. It is understandable that the first PDSCH overlaps with at least one PDSCH among the M PDSCHs, and the network device does not send data to the terminal device on the first PDSCH. If the first PDSCH is the last repetition of the PDSCH repetition of the first data. The method also includes: when the network device sends the first data to the terminal device on the second PDSCH, within the feedback time unit corresponding to the first PDSCH, feedback information of the first data from the terminal device is received. Among them, the second PDSCH is any repetition of the first data before the first PDSCH, and the time domain position of the first PDSCH is after the time domain position of the second PDSCH.

[0008] The downlink data transmission method provided by the present application, when at least two PDSCHs in P PDSCHs in a time slot overlap in the time domain, the network device will cancel the transmission of the partially overlapping PDSCHs. If one of the first PDSCHs whose transmission is canceled is the last repetition in the PDSCH repetition of the first data, and before the first PDSCH, the network sends other repetitions in the PDSCH repetition of the first data to the terminal device, the network device receives feedback information of the first data from the terminal device, thereby reducing the probability of retransmission of the first data and improving the data transmission efficiency.

[0009] Optionally, in the first time unit, when at least two PDSCHs among P PDSCHs overlap in the time domain, the network device sending data to the terminal device may also include the following possible situations.

[0010] Case 1: When the network device sends the second data to the terminal device on the fourth PDSCH, the network device also sends the second data to the terminal device on the third PDSCH. It should be understood that the M PDSCHs include a third PDSCH, wherein the third PDSCH and the fourth PDSCH are both one repetition of the PDSCH repetition of the second data, and the time domain position of the third PDSCH is after the time domain position of the fourth PDSCH. That is to say, for multiple PDSCH repetition transmissions of the second data, if the network device sends one of the PDSCH repetition transmissions, the priority of the subsequent repetition transmission of the second data will be higher than the priority of other PDSCHs, thereby ensuring the reliable transmission of the second data. Generally, repeated transmission is to improve the reliability of data transmission. The use of this priority of PDSCH that prioritizes repeated transmission can ensure the reliable transmission of data using the repeated transmission mechanism.

[0011] Case 2: If the network device does not send the first repetition of the PDSCH in the PDSCH repetition, the network device does not send any repetition of the PDSCH after the first repetition of the PDSCH. For example, the fifth PDSCH is the first repetition in the PDSCH repetition, the first PDSCH is a repetition after the first repetition in the PDSCH repetition, and the time domain position of the first PDSCH is after the time domain position of the fifth PDSCH. When the network device does not send the fifth PDSCH to the terminal device, it does not send the first PDSCH to the terminal device.

[0012] Optionally, the network device may select M PDSCHs from P PDSCHs according to conventional techniques. For example, the network selects the PDSCH with the smallest identifier from the P PDSCHs. Of course, the network device may also select M PDSCHs from the P PDSCHs in other ways. Several possible implementations of the network device selecting M PDSCHs from the P PDSCHs are described below.

[0013] In a possible implementation, M PDSCHs are M PDSCHs among N PDSCHs, each of the N PDSCHs belongs to one PDSCH group among N PDSCH groups, each PDSCH in the N PDSCH groups is one PDSCH in P PDSCHs, and each PDSCH in the P PDSCHs belongs to one PDSCH group among N PDSCH groups, N is an integer greater than or equal to M and less than or equal to P; the PDSCHs in the i-th PDSCH group among the N PDSCH groups overlap with each other; the i-th PDSCH among the N PDSCHs is the PDSCH with the smallest identifier value in the i-th PDSCH group, and i is a positive integer less than or equal to N.

[0014] In another possible implementation, the P PDSCHs also include a dynamically scheduled PDSCH, the M PDSCHs are M PDSCHs of the N PDSCHs, each of the N PDSCHs belongs to one PDSCH group of the N PDSCH groups, each PDSCH of the N PDSCH groups is one PDSCH of the P PDSCHs, and each PDSCH of the P PDSCHs belongs to one PDSCH group of the N PDSCH groups, and N is greater than or equal to M and less than or equal to P. integer, the PDSCHs in the ith PDSCH group among N PDSCH groups overlap with each other; the ith PDSCH among N PDSCHs is a PDSCH in the ith PDSCH group, and i is a positive integer less than or equal to N; when the ith PDSCH group includes a dynamically scheduled PDSCH, the ith PDSCH is the dynamically scheduled PDSCH; and / or, when the ith PDSCH group does not include a dynamically scheduled PDSCH, the ith PDSCH is the PDSCH with the smallest identifier value in the ith PDSCH group.

[0015] The N PDSCH groups are determined according to the end symbols of some PDSCHs in the P PDSCHs.

[0016] Specifically, the N PDSCH groups are determined based on the end symbols of some PDSCHs in the P PDSCHs, specifically including:

[0017] Step 1: record P PDSCHs as a PDSCH set, k is a positive integer less than or equal to N, and the initial value of k is 1;

[0018] Step 2: record the sixth PDSCH and the PDSCH overlapping with the sixth PDSCH in the PDSCH set as the kth PDSCH group in the N PDSCH groups, and the index value of the end symbol of the sixth PDSCH is the smallest among the index values ​​of the end symbols of the PDSCHs in the PDSCH set;

[0019] Step 3: Record the PDSCHs in the PDSCH set except the kth PDSCH group as the PDSCH set, assign k+1 to k, and repeat step 2 until the PDSCH set is empty.

[0020] Compared with the traditional technology, the network device compares the PDSCHs with or without overlap one by one and selects the PDSCHs without overlap, which has high computational complexity and high power consumption. The method provided in the embodiment of the present application reduces the processing complexity and power consumption of the network device by selecting the PDSCH with the smallest identifier for reception when multiple PDSCHs overlap.

[0021] Optionally, if the network device selects N PDSCHs without corresponding PDCCHs. If the N PDSCHs do not overlap with each other, the network device does not need to make any further selections, and N is equal to M. If two of the N PDSCHs overlap in the time domain, indicating that there are overlapping PDSCHs without corresponding PDCCHs among the PDSCHs without corresponding PDCCHs selected by the network device, then N is greater than M, and the network device continues to select PDSCHs using the method provided in the embodiment of the present application. For example, M PDSCHs are M PDSCHs among Q PDSCHs, each of the Q PDSCHs belongs to one PDSCH group among the Q PDSCH groups, each PDSCH in the Q PDSCH groups is one PDSCH among N PDSCHs, and each PDSCH among the N PDSCHs belongs to one PDSCH group among the Q PDSCH groups, Q is a positive integer greater than or equal to M and less than N; the PDSCHs in the j-th PDSCH group among the Q PDSCH groups overlap with each other; the j-th PDSCH among the Q PDSCHs is the PDSCH with the smallest identifier value in the j-th PDSCH group, and j is an integer less than or equal to Q.

[0022] Optionally, if the network device selects N PDSCHs, and the N PDSCHs do not overlap with each other, the network device does not need to make any further selections, and N is equal to M. If two of the N PDSCHs overlap in the time domain, indicating that there are overlapping PDSCHs in the PDSCHs selected by the network device, then N is greater than M, and the network device continues to select PDSCHs using the method provided in the embodiment of the present application. For example, M PDSCHs are M PDSCHs among Q PDSCHs, each of the Q PDSCHs belongs to one PDSCH group among Q PDSCH groups, each PDSCH in the Q PDSCH groups is one PDSCH among N PDSCHs, and each PDSCH among N PDSCHs belongs to one PDSCH group among Q PDSCH groups, Q is an integer greater than or equal to M and less than N; the PDSCHs in the jth PDSCH group among the Q PDSCH groups overlap with each other; the jth PDSCH among the Q PDSCHs is a PDSCH in the jth PDSCH group, j is a positive integer less than or equal to Q; when the jth PDSCH group includes a dynamically scheduled PDSCH, the jth PDSCH is a dynamically scheduled PDSCH; and / or, when the jth PDSCH group does not include a dynamically scheduled PDSCH, the jth PDSCH is the PDSCH with the smallest identifier value in the jth PDSCH group.

[0023] In another possible implementation, the P PDSCHs also include a dynamically scheduled PDSCH, the M PDSCHs include the dynamically scheduled PDSCH and R PDSCHs without corresponding PDCCHs, the R PDSCHs without corresponding PDCCHs are the R PDSCHs without corresponding PDCCHs with the smallest identifiers among the P PDSCHs, excluding the dynamically scheduled PDSCH and the PDSCH without corresponding PDCCH that overlaps with the dynamically scheduled PDSCH, and R is less than M.

[0024] Optionally, a PDSCH without a corresponding PDCCH that overlaps with a dynamically scheduled PDSCH is not sent to the terminal device.

[0025] Since the network device first cancels the PDSCH that overlaps with the dynamically scheduled PDSCH, and then sends the PDSCH with the smallest identifier among the remaining PDSCHs without corresponding PDCCHs, it ensures that as many PDSCHs without corresponding PDCCHs as possible are sent, thereby improving resource utilization. At the same time, since data can be sent in a timely manner, data transmission delay is reduced.

[0026] In the second aspect, the present application provides a method for receiving downlink data, which is a method corresponding to the first aspect, and its beneficial effects can be directly obtained by referring to the first aspect. The method can be applied to a terminal device, and can also be applied to a communication device that can support the terminal device to implement the method. For example, the communication device includes a chip system, and the method includes: the terminal device determines that there are at least two PDSCHs overlapping in the time domain among the P PDSCHs in the first time unit, selects M PDSCHs that do not overlap in the time domain from the P PDSCHs, receives data from the network device only on the M PDSCHs, and sends feedback information corresponding to the M PDSCHs to the network device. Among them, the P PDSCHs include PDSCHs without corresponding PDCCHs, and P is an integer greater than 1. M is equal to 1; or, M is an integer greater than 1 and less than P.

[0027] In addition, if the first PDSCH is a PDSCH other than M PDSCHs among P PDSCHs. It is understandable that the first PDSCH overlaps with at least one PDSCH among the M PDSCHs, and the terminal device does not receive data from the network device on the first PDSCH. If the first PDSCH is the last repetition of the PDSCH repetition of the first data. The method also includes: when the terminal device receives the first data from the network device on the second PDSCH, within the feedback time unit corresponding to the first PDSCH, feedback information of the first data is sent to the network device. Among them, the second PDSCH is any repetition of the first data before the first PDSCH, and the time domain position of the first PDSCH is after the time domain position of the second PDSCH.

[0028] The downlink data receiving method provided by the present application, when at least two PDSCHs in P PDSCHs in a time slot overlap in the time domain, the network device will cancel the transmission of the partially overlapping PDSCHs. If one of the first PDSCHs whose transmission is canceled is the last repetition in the PDSCH repetition of the first data, and before the first PDSCH, the terminal device receives other repetitions in the PDSCH repetition of the first data, the terminal device still sends feedback information of the first data to the network device, thereby reducing the probability of retransmission of the first data and improving the data transmission efficiency.

[0029] Optionally, in the first time unit, when at least two PDSCHs among P PDSCHs overlap in the time domain, the terminal device receiving data from the network device may also include the following possible situations.

[0030] Case 1: When the terminal device receives the second data from the network device on the fourth PDSCH, the terminal device also receives the second data from the network device on the third PDSCH. It should be understood that the M PDSCHs include a third PDSCH, wherein the third PDSCH and the fourth PDSCH are both one repetition of the PDSCH repetition of the second data, and the time domain position of the third PDSCH is after the time domain position of the fourth PDSCH. That is to say, for multiple PDSCH repetition transmissions of the second data, if the terminal device receives one of the PDSCH repetition transmissions, the priority of the subsequent repetition transmission of the second data will be higher than the priority of other PDSCHs, thereby ensuring the reliable transmission of the second data. Generally, repeated transmission is to improve the reliability of data transmission. The use of this priority of PDSCH that prioritizes repeated transmission can ensure the reliable transmission of data using the repeated transmission mechanism.

[0031] Case 2: If the terminal device does not receive the first repetition of the PDSCH in the PDSCH repetition, the terminal device does not receive any repetition of the PDSCH after the first repetition of the PDSCH. For example, the fifth PDSCH is the first repetition in the PDSCH repetition, the first PDSCH is a repetition after the first repetition in the PDSCH repetition, and the time domain position of the first PDSCH is after the time domain position of the fifth PDSCH. When the terminal device does not receive the fifth PDSCH from the network device, it does not receive the first PDSCH either.

[0032] Because the data carried by the first repeated PDSCH may be self-decodable, if the first repetition is not received, the data in the subsequent PDSCH may not be correctly decoded after being parsed and received. Therefore, the first repeated PDSCH is cancelled, and subsequent repeated PDSCHs are also cancelled, which can save resources and improve transmission efficiency.

[0033] Optionally, the terminal device may select M PDSCHs from P PDSCHs according to conventional techniques. For example, the terminal selects the PDSCH with the smallest identifier from the P PDSCHs. Of course, the terminal device may also select M PDSCHs from the P PDSCHs in other ways. Several possible implementations of the terminal device selecting M PDSCHs from the P PDSCHs are described below.

[0034] In a possible implementation, M PDSCHs are M PDSCHs among N PDSCHs, each of the N PDSCHs belongs to one PDSCH group among N PDSCH groups, each PDSCH in the N PDSCH groups is one PDSCH in P PDSCHs, and each PDSCH in the P PDSCHs belongs to one PDSCH group among N PDSCH groups, N is an integer greater than or equal to M and less than or equal to P; the PDSCHs in the i-th PDSCH group among the N PDSCH groups overlap with each other; the i-th PDSCH among the N PDSCHs is the PDSCH with the smallest identifier value in the i-th PDSCH group, and i is a positive integer less than or equal to N.

[0035] In another possible implementation, the P PDSCHs also include a dynamically scheduled PDSCH, the M PDSCHs are M PDSCHs of the N PDSCHs, each of the N PDSCHs belongs to one PDSCH group of the N PDSCH groups, each PDSCH of the N PDSCH groups is one PDSCH of the P PDSCHs, and each PDSCH of the P PDSCHs belongs to one PDSCH group of the N PDSCH groups, and N is greater than or equal to M and less than or equal to P. integer, the PDSCHs in the ith PDSCH group among N PDSCH groups overlap with each other; the ith PDSCH among N PDSCHs is a PDSCH in the ith PDSCH group, and i is a positive integer less than or equal to N; when the ith PDSCH group includes a dynamically scheduled PDSCH, the ith PDSCH is the dynamically scheduled PDSCH; and / or, when the ith PDSCH group does not include a dynamically scheduled PDSCH, the ith PDSCH is the PDSCH with the smallest identifier value in the ith PDSCH group.

[0036] The N PDSCH groups are determined according to the end symbols of some PDSCHs in the P PDSCHs.

[0037] Specifically, the N PDSCH groups are determined based on the end symbols of some PDSCHs in the P PDSCHs, specifically including:

[0038] Step 1: record P PDSCHs as a PDSCH set, k is a positive integer less than or equal to N, and the initial value of k is 1;

[0039] Step 2: record the sixth PDSCH and the PDSCH overlapping with the sixth PDSCH in the PDSCH set as the kth PDSCH group in the N PDSCH groups, and the index value of the end symbol of the sixth PDSCH is the smallest among the index values ​​of the end symbols of the PDSCHs in the PDSCH set;

[0040] Step 3: Record the PDSCHs in the PDSCH set except the kth PDSCH group as the PDSCH set, assign k+1 to k, and repeat step 2 until the PDSCH set is empty.

[0041] Compared with the traditional technology, the terminal device compares the PDSCHs with or without overlap one by one and selects the PDSCH without overlap, which has high computational complexity and high power consumption. The method provided in the embodiment of the present application reduces the processing complexity and power consumption of the terminal device by selecting the PDSCH with the smallest identifier for reception when multiple PDSCHs overlap.

[0042] Optionally, if the terminal device selects N PDSCHs without corresponding PDCCHs. If the N PDSCHs do not overlap with each other, the terminal device does not need to make any further selections, and N is equal to M. If two of the N PDSCHs overlap in the time domain, indicating that there are overlapping PDSCHs among the PDSCHs selected by the terminal device, then N is greater than M, and the terminal device continues to select PDSCHs using the method provided in the embodiment of the present application. For example, M PDSCHs are M PDSCHs among Q PDSCHs, each of the Q PDSCHs belongs to one PDSCH group among the Q PDSCH groups, each PDSCH in the Q PDSCH groups is one PDSCH among N PDSCHs, and each PDSCH among the N PDSCHs belongs to one PDSCH group among the Q PDSCH groups, Q is an integer greater than or equal to M and less than N; the PDSCHs in the j-th PDSCH group among the Q PDSCH groups overlap with each other; the j-th PDSCH among the Q PDSCHs is the PDSCH with the smallest identifier value in the j-th PDSCH group, and j is a positive integer less than or equal to Q.

[0043] Optionally, if the terminal device selects N PDSCHs, and the N PDSCHs do not overlap with each other, the terminal device does not need to make any further selection, and N is equal to M. If two of the N PDSCHs overlap in the time domain, indicating that there are overlapping PDSCHs among the PDSCHs selected by the terminal device, then N is greater than M, and the terminal device continues to select the PDSCH using the method provided in the embodiment of the present application. For example, M PDSCHs are M PDSCHs among Q PDSCHs, each of the Q PDSCHs belongs to one PDSCH group among Q PDSCH groups, each PDSCH in the Q PDSCH groups is one PDSCH among N PDSCHs, and each PDSCH among N PDSCHs belongs to one PDSCH group among Q PDSCH groups, Q is an integer greater than or equal to M and less than N; the PDSCHs in the jth PDSCH group among the Q PDSCH groups overlap with each other; the jth PDSCH among the Q PDSCHs is a PDSCH in the jth PDSCH group, j is a positive integer less than or equal to Q; when the jth PDSCH group includes a dynamically scheduled PDSCH, the jth PDSCH is a dynamically scheduled PDSCH; and / or, when the jth PDSCH group does not include a dynamically scheduled PDSCH, the jth PDSCH is the PDSCH with the smallest identifier value in the jth PDSCH group.

[0044] In another possible implementation, the P PDSCHs also include a dynamically scheduled PDSCH, the M PDSCHs include the dynamically scheduled PDSCH and R PDSCHs without corresponding PDCCHs, the R PDSCHs without corresponding PDCCHs are the R PDSCHs without corresponding PDCCHs with the smallest identifiers among the P PDSCHs, excluding the dynamically scheduled PDSCH and the PDSCH without corresponding PDCCH that overlaps with the dynamically scheduled PDSCH, and R is less than M.

[0045] Optionally, a PDSCH without a corresponding PDCCH that overlaps with a dynamically scheduled PDSCH from a network device is not received.

[0046] Since the terminal device first cancels the PDSCH that overlaps with the dynamically scheduled PDSCH, and then receives the PDSCH with the smallest identifier among the remaining PDSCHs without corresponding PDCCHs, it ensures that as many PDSCHs without corresponding PDCCHs as possible are received, thereby improving resource utilization. At the same time, since data can be received in a timely manner, data transmission delay is reduced.

[0047] In a third aspect, an embodiment of the present application further provides a communication device, and the beneficial effects can be found in the description of the first aspect and will not be repeated here. The communication device has the function of implementing the behavior in the method example of the first aspect. The function can be implemented by hardware, or by hardware executing corresponding software implementation. The hardware or software includes one or more modules corresponding to the above functions. In one possible design, the communication device includes: a transceiver unit and a processing unit. The processing unit is used to determine P PDSCHs within a first time unit, the P PDSCHs include PDSCHs without corresponding PDCCHs, at least two PDSCHs of the P PDSCHs overlap in the time domain, and P is an integer greater than 1 and less than P. The transceiver unit is used to send data to a terminal device only on M PDSCHs among the P PDSCHs, where M is equal to 1; or, M is an integer greater than 1 and less than P, and the M PDSCHs do not overlap in the time domain; data is not sent to the terminal device on the first PDSCH, and the first PDSCH is a PDSCH other than the M PDSCHs among the P PDSCHs. The transceiver unit is further used to receive feedback information corresponding to the M PDSCHs from the terminal device. These modules can perform the corresponding functions in the above-mentioned first aspect method example, and refer to the detailed description in the method example for details, which will not be repeated here.

[0048] In a fourth aspect, an embodiment of the present application further provides a communication device, and the beneficial effects can be found in the description of the second aspect and will not be repeated here. The communication device has the function of implementing the behavior in the method example of the second aspect. The function can be implemented by hardware, or by hardware executing corresponding software implementation. The hardware or software includes one or more modules corresponding to the above functions. In one possible design, the communication device includes: a transceiver unit and a processing unit. The processing unit is used to determine P PDSCHs within a first time unit, the P PDSCHs include a PDSCH without a corresponding PDCCH, at least two of the P PDSCHs overlap in the time domain, and P is an integer greater than 1. The transceiver unit is used to receive data from the network device only on M PDSCHs among P PDSCHs, where M is equal to 1; or, M is an integer greater than 1 and less than P, and the M PDSCHs do not overlap in the time domain; not to receive data from the network device on the first PDSCH, and the first PDSCH is the PDSCH other than the M PDSCHs among the P PDSCHs; the transceiver unit is also used to send feedback information corresponding to the M PDSCHs to the network device. These units can perform the corresponding functions in the above-mentioned second aspect method example, and refer to the detailed description in the method example for details, which will not be repeated here.

[0049] In a fifth aspect, a communication device is provided, which may be a network device in the above method embodiment, or a chip set in the network device. The communication device includes an interface circuit and a processor, and optionally, also includes a memory. The memory is used to store a computer program or instruction, and the processor is coupled to the memory and the interface circuit. When the processor executes the computer program or instruction, the communication device executes the method performed by the network device in the above first aspect.

[0050] In a sixth aspect, a communication device is provided, which may be a terminal device in the above method embodiment, or a chip set in the terminal device. The communication device includes an interface circuit and a processor, and optionally, a memory. The memory is used to store a computer program or instruction, and the processor is coupled to the memory and the interface circuit. When the processor executes the computer program or instruction, the communication device executes the method executed by the terminal device in the above second aspect.

[0051] In a seventh aspect, a computer program product is provided, the computer program product comprising: a computer program code, when the computer program code is run, the method performed by the network device in the above-mentioned first aspect is executed.

[0052] In an eighth aspect, a computer program product is provided, the computer program product comprising: a computer program code, when the computer program code is run, the method performed by the terminal device in the above second aspect is executed.

[0053] In a ninth aspect, the present application provides a chip system, which includes a processor for implementing the functions of the network device in the method of the first aspect. In a possible design, the chip system also includes a memory for storing program instructions and / or data. The chip system can be composed of a chip, or it can include a chip and other discrete devices.

[0054] In a tenth aspect, the present application provides a chip system, which includes a processor for implementing the functions of the terminal device in the method of the second aspect. In a possible design, the chip system also includes a memory for storing program instructions and / or data. The chip system can be composed of a chip, or it can include a chip and other discrete devices.

[0055] In an eleventh aspect, the present application provides a computer-readable storage medium storing a computer program, which, when executed, implements the method performed by the network device in the first aspect.

[0056] In a twelfth aspect, the present application provides a computer-readable storage medium, which stores a computer program. When the computer program is executed, the method performed by the terminal device in the above-mentioned second aspect is implemented.

[0057] In this application, the names of terminal equipment, network equipment and communication devices do not limit the equipment themselves. In actual implementation, these equipment may appear with other names. As long as the functions of each equipment are similar to those of this application, they fall within the scope of the claims of this application and their equivalent technologies. BRIEF DESCRIPTION OF THE DRAWINGS

[0058] Figure 1 A schematic diagram of the architecture of a mobile communication system provided in one embodiment of the present application;

[0059] Figure 2 A schematic diagram of PDSCH transmission provided in an embodiment of the present application;

[0060] Figure 3 A flowchart of sending PDSCH using SPS mode provided in an embodiment of the present application;

[0061] Figure 4 A schematic diagram of PDSCH transmission provided in an embodiment of the present application;

[0062] Figure 5 A schematic diagram of PDSCH transmission provided in an embodiment of the present application;

[0063] Figure 6 A schematic diagram of sending feedback information provided by the prior art;

[0064] Figure 7 A schematic diagram of the PDSCH time domain position of the SPS configuration provided in an embodiment of the present application;

[0065] Figure 8 A schematic diagram of sending feedback information provided by the prior art;

[0066] Fig. 9 A flow chart of a method for sending and receiving downlink data provided in an embodiment of the present application;

[0067] Fig.10 A schematic diagram of sending feedback information provided in an embodiment of the present application;

[0068] Fig.11 A schematic diagram of the time domain position of sending and receiving PDSCH provided in an embodiment of the present application;

[0069] Fig.12 A schematic diagram of the time domain position of sending and receiving PDSCH provided in an embodiment of the present application;

[0070] Fig.13 A schematic diagram of PDSCH grouping provided in an embodiment of the present application;

[0071] Fig.14 A schematic diagram of PDSCH grouping provided in an embodiment of the present application;

[0072] Fig.15 A schematic diagram of PDSCH grouping provided in an embodiment of the present application;

[0073] Fig.16 A schematic diagram of the structure of a communication device provided in one embodiment of the present application;

[0074] Fig.17 A schematic diagram of the structure of a communication device provided in one embodiment of the present application. DETAILED DESCRIPTION

[0075] The terms "first", "second", "third", etc. in the specification and claims of this application and the above-mentioned drawings are used to distinguish different objects rather than to limit a specific order.

[0076] In the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0077] In order to meet the latency requirements of the service, the time domain granularity of resource scheduling in the 5G mobile communication system should be more flexible. Specifically, 5G supports both time domain scheduling granularity at the time slot level and time domain scheduling granularity at the micro-time unit level. For example, scheduling at the time unit granularity is mainly used for eMBB services, and scheduling at the micro-time unit granularity is mainly used for URLLC services. The above-mentioned time units and micro-time units are general terms. A specific example may be that the time unit may be a time slot, and the micro-time unit may be a micro-time slot, a sub-time slot, a non-slot-based time slot, or a mini-time slot; or, the time unit may be a subframe, and the micro-time unit may be a micro-subframe; or, the time unit may also be a micro-time slot, a sub-time slot, a non-slot-based time slot, or a mini-time slot. The following examples of this application are all based on the time unit as a time slot, where a time slot may include 14 time domain symbols, and a micro time slot includes less than 14 time domain symbols, such as 2, 3, 4, 5, 6 or 7, etc.; or, a time slot may include 7 time domain symbols, and a micro time slot includes less than 7 time domain symbols, such as 2 or 4, etc., and the specific values ​​are not limited. The time domain symbol here can be an orthogonal frequency division multiplexing (orthogonal frequency division multiplexing, OFDM) symbol or a single carrier-frequency division multiplexing (single carrier-frequency division multiplexing, SC-FDM) symbol. Unless otherwise specified, the symbols in the embodiments of the present application refer to time domain symbols. For a time slot with a subcarrier spacing of 15 kilohertz (kHz), including 12 or 14 time domain symbols, the corresponding time length is 1ms; for a time slot with a subcarrier spacing of 60kHz, the corresponding time length is shortened to 0.25ms.

[0078] Figure 1 Schematic diagram of the architecture of the mobile communication system used in the embodiment of the present application. Figure 1 As shown, the mobile communication system includes a core network device 110, a wireless access network device 120 and at least one terminal device (such as Figure 1The terminal device 130 and the terminal device 140 in the figure are connected to the wireless access network device by wireless means, and the wireless access network device is connected to the core network device by wireless or wired means. The core network device and the wireless access network device can be independent and different physical devices, or the functions of the core network device and the logical functions of the wireless access network device can be integrated on the same physical device, or part of the functions of the core network device and part of the functions of the wireless access network device can be integrated on one physical device. The terminal device can be fixed or movable. Figure 1 This is just a schematic diagram. The communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices. Figure 1 The embodiments of the present application do not limit the number of core network devices, wireless access network devices and terminal devices included in the mobile communication system.

[0079] The wireless access network device is an access device that the terminal device accesses to the mobile communication system by wireless means, which may be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next generation NodeB (gNB) in a 5G mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system, etc.; it may also be a module or unit that completes some functions of a base station, for example, it may be a centralized unit (CU) or a distributed unit (DU). The embodiments of the present application do not limit the specific technology and specific device form adopted by the wireless access network device. In the present application, the wireless access network device is referred to as the network device. If there is no special explanation, the network device refers to the wireless access network device. For example, the wireless access network device 120 may also be the network device 120.

[0080] The terminal device may also be referred to as a terminal, user equipment (UE), a mobile station, a mobile terminal, etc. The terminal device may be a mobile phone, a tablet computer (Pad), a computer with wireless transceiver function, a virtual reality terminal device, an augmented reality terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in remote surgery, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal device.

[0081] The present application can be applied to a 5G new radio (NR) system or to other communication systems, as long as there is an entity in the communication system that needs to send transmission direction indication information, and another entity needs to receive the indication information and determine the transmission direction within a certain time based on the indication information.

[0082] The network equipment and terminal equipment can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on the water surface; they can also be deployed on airplanes, balloons and artificial satellites in the air. The embodiments of the present application do not limit the application scenarios of the network equipment and terminal equipment.

[0083] The network device and the terminal device can communicate through the licensed spectrum, or through the unlicensed spectrum, or through both the licensed spectrum and the unlicensed spectrum. The network device and the terminal device can communicate through the spectrum below 6 gigahertz (GHz), or through the spectrum above 6 GHz, or through the spectrum below 6 GHz and the spectrum above 6 GHz at the same time. The embodiments of the present application do not limit the spectrum resources used between the network device and the terminal device.

[0084] It can be understood that in the embodiments of the present application, the physical downlink control channel (PDCCH), PDSCH and physical uplink control channel (PUCCH) are only used as examples of downlink control channels, downlink data channels and uplink control channels. In different systems and different scenarios, the data channels may have different names, and the embodiments of the present application do not limit this.

[0085] In order to make the description of the following embodiments clear and concise, a brief introduction to the related technology is first given:

[0086] Typically, a network device can use dynamic scheduling to send downlink data to a terminal device. Specifically, before sending downlink data to a terminal device each time, the network device sends an indication message to the terminal device, instructing the terminal device how to receive downlink data from the network device. The indication message can be downlink control information (DCI).

[0087] The network device sends DCI to the terminal device. Since DCI is carried on PDCCH, it can also be understood that the network device sends DCI to the terminal device through PDCCH. The network device sends downlink data to the terminal device. Since the downlink data is carried on PDSCH, it can also be understood that the network device sends downlink data to the terminal device through PDSCH. A PDCCH can schedule a PDSCH or multiple repetitions of PDSCH. It can be understood that PDSCH will correspond to a time-frequency resource, and the network device may send data to the terminal device on the time-frequency resource corresponding to PDSCH. Therefore, in this application, PDSCH can be understood as the time-frequency resource corresponding to PDSCH, and can also be understood as data carried on PDSCH. In the same way, PDSCH repetition can also be understood as a time-frequency resource corresponding to PDSCH repetition, or it can also be understood as data sent to the terminal device on the time-frequency resource corresponding to PDSCH repetition.

[0088] The DCI indicates the time unit where the PDSCH is located, and the starting symbol S and length L of the PDSCH in the time unit. For example, the DCI includes a field for indicating an offset value K0, a starting symbol S, and a length L. The K0 represents the difference between the number of the time unit where the DCI is received and the number of the time unit where the PDSCH is received.

[0089] The terminal device can determine that there is a PDCCH sent to itself in a certain time unit through PDCCH blind detection, and obtain the information of the PDSCH scheduled by the DCI by parsing the DCI carried by the PDCCH. For example, the time unit where the PDSCH is located is determined based on the time unit where the PDCCH is located plus the offset value K0 indicated in the DCI, and the time domain position occupied by the PDSCH in its transmission time unit is determined based on the starting symbol S and length L indicated by the DCI, and then the downlink data from the network device is received at this time domain position.

[0090] The DCI indicates a row in a time domain resource allocation (TDRA) table. The time domain resource allocation table may be a predefined table or a table configured by high-layer signaling.

[0091] The so-called pre-defined can be understood as pre-defined in a standard or protocol. The terminal device and the network device need to pre-store the pre-defined time domain resource allocation table. After the terminal device obtains the DCI, the time domain resource of the PDSCH can be determined according to the time domain resource allocation table and the DCI.

[0092] In the present application, high-layer signaling may refer to signaling sent by a high-layer protocol layer, for example, high-layer signaling may be a medium access control (MAC) control element (CE) or a radio resource control (RRC) signaling.

[0093] The time domain resource allocation table contains multiple rows, each row contains an offset value K0, a start symbol S and a length L. Optionally, the start symbol S and the length L can be jointly encoded as a parameter start and length indicator value (start and lengthindicator value, SLIV), or two independent parameters. It should be understood that SLIV is the time domain position (time domain resource) at which the terminal device sends PDSCH within a time unit, and the time domain resource may include at least one symbol. Here, whether it is SLIV or two independent parameters, the start symbol S and the length L, can be expressed as (S, L). For example, as shown in Table 1, a schematic diagram of a time domain resource allocation table provided in an embodiment of the present application is provided.

[0094] Table 1 Time domain resource allocation table

[0095] Index K0 (S,L) 0 1 (2,4) 1 1 (2,2) 2 2 (3,4) 3 2 (0,7)

[0096] As can be seen from Table 1, the time domain resource allocation table includes an index, an offset value K0, a starting symbol S, and a length L. Each index indicates a row in the time domain resource allocation table. For example, the DCI contains a 2-bit indication field, indicating index 0, then K0 is 1, the starting symbol S is symbol 2, and the length L is 4 symbols. For another example, if the DCI indicates index 1, then K0 is 1, the starting symbol S is symbol 2, and the length L is 2 symbols. For another example, if the DCI indicates index 2, then K0 is 2, the starting symbol S is symbol 3, and the length L is 4 symbols.

[0097] For example, Figure 2 As shown, assuming K0=1, the starting symbol S is symbol 4, and the length L is 4 symbols. If the terminal device receives DCI in time slot n, since K0=1, the terminal device receives PDSCH in the 4th to 7th symbols of time slot n+1. Figure 2 The symbols in a time slot are numbered from 1 to 14. It can be understood that the symbols in a time slot can also be numbered from 0 to 13.

[0098] Generally, in order to reduce the overhead of control instructions, the network device can use semi-persistent scheduling (SPS) to send PDSCH to the terminal device, and the corresponding PDSCH is also called SPS PDSCH. The dynamic scheduling method can also be called non-semi-persistent scheduling method.

[0099] It is understandable that the execution subject of the embodiment of the present application can be a terminal device and a network device, or a module applied to a terminal device and a module applied to a network device, where the module can be a chip. The following description is made with the terminal device and the network device as the execution subject.

[0100] For example, Figure 3 As shown, it is a flowchart of sending PDSCH using SPS mode provided by an embodiment of the present application.

[0101] S301. The network device sends configuration information to the terminal device.

[0102] The configuration information indicates the SPS configuration to the terminal device. The SPS configuration includes an SPS index, an SPS period and a repetition number K. The SPS index is used to identify the SPS configuration. The SPS index may also be referred to as an SPS identity (ID). The SPS period is the number of time units in the time unit interval between two adjacent PDSCHs in the time domain, and the value of the SPS period may be an integer multiple of the time slot. The repetition number indicates that the PDSCH is repeated K times, where K is an integer greater than or equal to 1. Assuming that the network device sends a PDSCH once in each time unit and repeats it K times, the network device sends a PDSCH once in each time unit within the K time units, and sends a total of K PDSCH repetitions. K time units are less than or equal to the SPS period. The PDSCH repetition means that each PDSCH in multiple PDSCH repetitions carries the same data.

[0103] Optionally, the configuration information may be high-layer signaling.

[0104] S302: The terminal device receives the configuration information from the network device.

[0105] After receiving the configuration information, the terminal device determines information such as the SPS index, SPS period, and number of repetitions K.

[0106] S303: The network device sends indication information to the terminal device.

[0107] The indication information is used to activate the SPS configuration. The indication information may indicate the SPS index, and may also indicate the time unit where the PDSCH corresponding to the SPS configuration is located, the time unit where the feedback information of the PDSCH corresponding to the SPS configuration is located, and the starting symbol S and length L in the time unit where the PDSCH is located.

[0108] For example, the indication information may be DCI. The DCI includes K0, the SPS index, a start symbol S, and a length L. For explanations of K0, the start symbol S, and the length L, reference may be made to the explanation in the above-mentioned dynamic scheduling method.

[0109] S304: The terminal device receives the indication information from the network device.

[0110] The indication information is used to activate the SPS configuration. After receiving the indication information, the terminal device determines the time-frequency resources for receiving the PDSCH according to the indication information.

[0111] S305. The network device sends a PDSCH to the terminal device.

[0112] S306. The terminal device receives the PDSCH from the network device according to the indication information.

[0113] The terminal device can determine through PDCCH blind detection that there is a PDCCH sent to itself within the first time unit, and obtain the information of the PDSCH scheduled by the DCI by parsing the DCI carried by the PDCCH. For example, the second time unit where the PDSCH is located is determined based on the first time unit and K0 indicated in the DCI, and the time domain position occupied by the PDSCH in the second time unit is determined based on the starting symbol S and length L indicated by the DCI, and then the PDSCH from the network device is received at this time domain position.

[0114] In addition, after the second time unit, the terminal device can determine the time unit in which to continue receiving other PDSCHs corresponding to the SPS configuration according to the SPS period, and determine the time domain position of other PDSCHs corresponding to the SPS configuration according to the starting symbol S and the length L.

[0115] For example, Figure 4As shown, assuming K0=0, the starting symbol S is symbol 4, and the length L is 4 symbols. If the terminal device receives DCI on time slot n, since K0=0, the terminal device receives the first PDSCH on the 4th symbol to the 7th symbol of time slot n. If the SPS period is 1 time slot, the terminal device receives other PDSCHs on the 4th symbol to the 7th symbol of each time slot starting from time slot n. For example, the terminal device receives the second PDSCH on the 4th symbol to the 7th symbol of time slot n+1, the terminal device receives the third PDSCH on the 4th symbol to the 7th symbol of time slot n+2, and the terminal device receives the fourth PDSCH on the 4th symbol to the 7th symbol of time slot n+3.

[0116] Optional, such as Figure 5 As shown, if the SPS period is 2, the terminal device receives a PDSCH transmitting certain data from the 4th symbol to the 7th symbol of the corresponding time slot every time slot starting from time slot n. For example, the terminal device receives the first PDSCH from the 4th symbol to the 7th symbol of time slot n. The terminal device receives the second PDSCH from the 4th symbol to the 7th symbol of time slot n+2. Optionally, if the number of repetitions K is 2, such as Figure 4 As shown, the terminal device receives PDSCH on the 4th symbol to the 7th symbol of each time slot starting from time slot n, wherein, starting from time slot n, the PDSCH in every two adjacent time slots is two repetitions of the same data.

[0117] In this article, for the semi-persistent scheduling mode, the first PDSCH can be called a PDSCH with scheduling information, because the first PDSCH has a corresponding PDCCH for activating the PDSCH, and subsequent PDSCHs are PDSCHs without scheduling information. Optionally, the PDSCH with scheduling information can also be called a dynamically scheduled PDSCH. The PDSCH without scheduling information can also be called a PDSCH without a corresponding PDCCH. In this article, the PDSCH without scheduling information is recorded as an SPS PDSCH. It can be understood that the dynamically scheduled PDSCH can refer to the PDSCH sent in a dynamic scheduling mode or the first PDSCH sent in a semi-persistent scheduling mode.

[0118] Furthermore, after receiving the downlink data, the terminal device sends feedback information to the network device to indicate whether the terminal device correctly receives the PDSCH. The PDSCH to HARQ feedback timing field indicates the time unit where the feedback information corresponding to the PDSCH is located.

[0119] The DCI for scheduling PDSCH can indicate one K1 in the K1 set through the PDSCH to HARQ timing field. The K1 set can be a set configured by high-level signaling. The K1 represents the difference between the number of the time unit for transmitting PDSCH and the number of the time unit for sending feedback information of PDSCH. Assuming that the terminal device receives PDSCH in the n+1th time unit, the terminal device sends the feedback information corresponding to the PDSCH to the network device in the n+1+K1th time unit. The feedback information can be an acknowledgement (ACK) or a negative acknowledgement (NACK). The terminal device sends feedback information to the network device. Since the feedback information is carried on the PUCCH, it can also be understood that the terminal device sends feedback information to the network device through the PUCCH. PUCCH is a channel that carries uplink control information (UCI), and UCI mainly includes feedback information (ACK / NACK) corresponding to the PDSCH.

[0120] Optionally, if the SPS activated by the network device is configured with a repetition number K, the terminal device sends feedback information corresponding to the PDSCH to the network device at the time unit where the last repetition in the PDSCH repetition is received plus the time unit of K1. Although the PDSCH is repeated N times, the terminal device only sends one piece of feedback information, and the specific one piece of feedback information can be 1 bit or multiple bits.

[0121] For example, Figure 6 As shown, assuming K1=1, the terminal device receives the last repetition of PDSCH in time slot n+1, and the terminal device sends the feedback information corresponding to the PDSCH to the network device in time slot n+2. For another example, if K1=4, the terminal device feeds back the feedback information of the PDSCH in time slot n+5.

[0122] In the NR system, the network device can configure multiple SPS configurations for the terminal device. The specific values ​​of the parameters contained in each SPS configuration may be different. Different SPS indexes indicate different SPS configurations. The SPS periods of different SPS configurations may be the same or different. The number of repetitions K of different SPS configurations may be the same or different. Optionally, the network device may configure multiple SPS configurations through different configuration information according to the method of step S301, or may configure multiple SPS configurations simultaneously through one configuration information.

[0123] The network device may instruct the terminal device to activate multiple SPS configurations through different indication information according to the method of step S304. For example, multiple SPS configurations may be activated through different DCIs, and this DCI may be called the activation DCI of the SPS configuration, and the PDCCH carrying the DCI may be called the activation PDCCH of the SPS configuration.

[0124] For example, assume that the network device sends 4 indication messages to the terminal device, each indication message indicates activation of 1 SPS configuration, and the 4 indication messages indicate activation of 4 SPS configurations. Here, it is assumed that the 4 SPS configurations are SPS1, SPS2, SPS3, and SPS4. Among them, the period of SPS1 and the period of SPS3 are both 1 time slot, the period of SPS2 is 2 time slots, and the period of SPS4 is 4 time slots. Figure 7 As shown, it is a schematic diagram of the time domain position of the SPS configuration provided in an embodiment of the present application. It can be seen that the PDSCHs corresponding to multiple SPS configurations may overlap in the time slot. For ease of understanding, the PDSCHs corresponding to multiple SPS configurations are illustrated in multiple rows.

[0125] For example, in time slot n+1, the PDSCH corresponding to SPS1 overlaps with the PDSCH corresponding to SPS2, the PDSCH corresponding to SPS2 overlaps with the PDSCH corresponding to SPS3, the PDSCH corresponding to SPS3 overlaps with the PDSCH corresponding to SPS4, and the PDSCH corresponding to SPS4 overlaps with the PDSCH corresponding to SPS2.

[0126] For another example, in time slot n+3, the PDSCH corresponding to SPS1 overlaps with the PDSCH corresponding to SPS2, and the PDSCH corresponding to SPS2 overlaps with the PDSCH corresponding to SPS3.

[0127] In the following, for the convenience of description, SPS PDSCH1 represents the PDSCH corresponding to SPS1, SPS PDSCH2 represents the PDSCH corresponding to SPS2, SPS PDSCH3 represents the PDSCH corresponding to SPS3, and SPS PDSCH4 represents the PDSCH corresponding to SPS4.

[0128] However, due to the limited capabilities of the terminal device, when the PDSCHs corresponding to multiple SPS configurations overlap within a time unit, the terminal device can only receive one or more PDSCHs. Multiple PDSCHs can be determined based on the number of PDSCHs that can be received simultaneously or the number of data that can be received simultaneously reported by the terminal device.

[0129] When the PDSCHs corresponding to multiple SPS configurations overlap within a time unit, the terminal device can receive the PDSCH corresponding to the SPS configuration with the smallest SPS index. For example, when the PDSCH corresponding to SPS1 overlaps with the PDSCH corresponding to SPS2, the terminal device receives the PDSCH corresponding to SPS1. There are two possible implementations for the terminal device to receive the PDSCH corresponding to the SPS configuration with the smallest SPS index from among the PDSCHs corresponding to multiple SPS configurations within a time unit.

[0130] In a first possible implementation, within a time unit, the terminal device first defines a group of SPS PDSCHs that overlap, and then receives the PDSCH corresponding to the SPS configuration with the smallest SPS index in this group. The resources of each SPS PDSCH in a group of SPS PDSCHs meet the following conditions:

[0131] 1. The start symbol of the SPS PDSCH resource is not earlier than the start symbol of the earliest SPS PDSCH in the group, and the end symbol of the SPS PDSCH resource is not later than the end symbol of the latest SPS PDSCH.

[0132] 2. The SPS PDSCH overlaps with at least one SPS PDSCH in the group in the time domain.

[0133] 3. The start symbol and the end symbol of the other SPS PDSCHs except the first and the last SPS PDSCH overlap with at least one SPS PDSCH in the group.

[0134] For example, Figure 7 As shown, in time slot n+1, SPS PDSCH1 to SPS PDSCH4 are a group, and the terminal device only receives SPS PDSCH1; in time slot n+3, SPS PDSCH1 to SPS PDSCH3 are a group, and the terminal device only receives SPS PDSCH1.

[0135] In the second possible implementation, within a time unit, the terminal device first receives the PDSCH corresponding to the SPS configuration with the smallest SPS index, which can be called the target SPS PDSCH; then, all SPS PDSCHs overlapping with the target SPS PDSCH within the time unit are removed, and the SPS PDSCHs overlapping with the target SPS PDSCH within the time unit are not received. Repeat the above steps until there are no activated SPS PDSCHs within the time unit, or until the number of received data or the number of received PDSCHs reaches the capacity of the terminal device, then stop receiving the SPS PDSCH.

[0136] For example, Figure 7 As shown, in time slot n+1, the terminal device receives SPS PDSCH1, removes and does not receive SPS PDSCH2, receives SPS PDSCH3, removes and does not receive SPS PDSCH4. In time slot n+3, the terminal device receives SPS PDSCH1, removes and does not receive SPS PDSCH2, and receives SPS PDSCH3.

[0137] When the PDSCHs corresponding to multiple SPS configurations overlap within a time unit, if the terminal device does not receive a certain SPS PDSCH, it does not send feedback information corresponding to the SPS PDSCH to the network device, thereby saving uplink signaling overhead.

[0138] For example, when the SPS PDSCH is repeated from time slot n-N+1 to time slot n, the terminal device sends feedback information to the network device only in time slot n+K1. If the terminal device does not receive the SPS PDSCH of the last repeated transmission of the SPS PDSCH, that is, the SPS PDSCH in time slot n, the terminal device does not send the feedback information corresponding to the SPS PDSCH to the network device, resulting in a waste of resources of the multiple SPS PDSCHs transmitted previously.

[0139] For example, Figure 8 As shown, assuming that the period of SPS1 is 2 time slots, the number of repetitions K is 1, and one SPS PDSCH1 is sent in time slot 1 and time slot 3. The period of SPS2 is 2 time slots, the number of repetitions K is 2, and one SPS PDSCH2 is sent in time slot 2 and time slot 3.

[0140] In time slot 3, since SPS PDSCH1 and SPS PDSCH2 overlap, according to the first or second possible implementation method mentioned above, the terminal device receives the PDSCH corresponding to the SPS configuration with the smallest SPS index, that is, SPS PDSCH1, and the terminal device does not receive SPS PDSCH2, then the terminal device does not send the feedback information corresponding to the SPS PDSCH2 to the network device. However, in time slot 2, the terminal device has received SPS PDSCH2 once. Since they carry the same data, which is the second repetition of the PDSCH repetition of the same data, the SPS PDSCH2 in time slot 2 may be decoded correctly. If the terminal device does not send the feedback information corresponding to the SPS PDSCH2 to the network device, the network device needs to continue to retransmit, and the SPS PDSCH2 received by the terminal device in time slot 2 is equivalent to being wasted, which reduces the data transmission efficiency. In the drawings of the present application, the black solid line in the figure indicates not receiving or not sending.

[0141] An embodiment of the present application provides a method for sending and receiving downlink data. The method includes: when the network device determines that at least two PDSCHs overlap in the time domain among the P PDSCHs in the first time unit, M PDSCHs that do not overlap in the time domain are selected from the P PDSCHs, data is sent to the terminal device only on the M PDSCHs, and feedback information corresponding to the M PDSCHs from the terminal device is received. Similarly, the terminal device determines that at least two PDSCHs overlap in the time domain among the P PDSCHs in the first time unit, M PDSCHs that do not overlap in the time domain are selected from the P PDSCHs, data is received only on the M PDSCHs, and feedback information corresponding to the M PDSCHs is sent to the network device. Among them, the P PDSCHs include PDSCHs without corresponding PDCCHs, and P is an integer greater than 1. M is equal to 1; or, M is an integer greater than 1 and less than P.

[0142] In addition, if the first PDSCH is a PDSCH other than the M PDSCHs among the P PDSCHs, it is understandable that the first PDSCH overlaps with at least one PDSCH among the M PDSCHs, and the network device does not send data to the terminal device on the first PDSCH. Similarly, the terminal device does not receive data from the network device on the first PDSCH.

[0143] If the first PDSCH is the last repetition of the PDSCH repetition of the first data. The method also includes: when the network device sends the first data to the terminal device on the second PDSCH, within the feedback time unit corresponding to the first PDSCH, feedback information of the first data is received from the terminal device. Similarly, when the terminal device receives the first data from the network device on the second PDSCH, feedback information of the first data is sent to the network device within the feedback time unit corresponding to the first PDSCH. The second PDSCH is any repetition of the first data before the first PDSCH, and the time domain position of the first PDSCH is after the time domain position of the second PDSCH.

[0144] The downlink data sending and receiving method provided by the present application, when at least two PDSCHs in P PDSCHs in a time slot overlap in the time domain, the network device will cancel the sending of the partially overlapping PDSCHs. If one of the first PDSCHs whose transmission is canceled is the last repetition in the PDSCH repetition of the first data, and before the first PDSCH, the terminal device receives other repetitions in the PDSCH repetition of the first data, the terminal device still sends feedback information of the first data to the network device, thereby reducing the probability of retransmission of the first data and improving the data transmission efficiency.

[0145] The implementation of the embodiments of the present application will be described in detail below with reference to the accompanying drawings.

[0146] Fig. 9 A flow chart of a method for sending and receiving downlink data provided in an embodiment of the present application. Fig. 9 As shown, the method may include:

[0147] S901. A network device determines P PDSCHs in a first time unit.

[0148] Before the network device sends PDSCH to the terminal device, the transmission mode of sending PDSCH is first determined, such as: dynamic scheduling mode or semi-continuous scheduling mode. Therefore, the network device can determine the number of PDSCHs transmitted in one time unit according to the transmission mode of multiple PDSCHs. In an embodiment of the present application, it is assumed that the network device determines P PDSCHs in the first time unit. The P PDSCHs include PDSCHs without corresponding PDCCHs, and at least two of the P PDSCHs overlap in the time domain, and P is an integer greater than 1.

[0149] S902. Among P PDSCHs, the network device sends data to the terminal device only on M PDSCHs.

[0150] During the initial establishment, the terminal device reports its capabilities to the network device. Therefore, the network device can determine the number of PDSCHs that the terminal device can receive within a time unit based on the capabilities of the terminal device. In order to avoid wasting time and frequency resources, the network device can send PDSCHs to the terminal device based on the number of PDSCHs that the terminal device can receive within a time unit.

[0151] Specifically, the network device can select M PDSCHs that do not overlap in the time domain from P PDSCHs, and send data to the terminal device only on these M PDSCHs. Where M is equal to 1; or M is an integer greater than 1 and less than P. The network device can select M PDSCHs from P PDSCHs in the same way as the terminal device, which will be explained in detail later.

[0152] S903. The terminal device determines P PDSCHs within the first time unit.

[0153] Before the terminal device receives the PDSCH, it can determine the time domain position of the PDSCH based on the indication information (such as DCI) from the network device. For example, the time unit where the PDSCH indicated by the indication information is located, and the starting symbol S and length L of the PDSCH in the time unit. For a detailed explanation of the indication information, please refer to the above explanation. In an embodiment of the present application, it is assumed that the terminal device determines P PDSCHs in the first time unit. The P PDSCHs include a PDSCH without a corresponding PDCCH, and at least two of the P PDSCHs overlap in the time domain, and P is an integer greater than 1.

[0154] S904. Among P PDSCHs, the terminal device receives data from the network device only on M PDSCHs.

[0155] After the terminal device determines the time domain positions of the P PDSCHs, it can determine the number of PDSCHs that can be received in one time unit according to its own capabilities, so as to receive the PDSCHs, or only receive one PDSCH in one time unit.

[0156] The terminal device selects M PDSCHs that do not overlap in the time domain from P PDSCHs, and receives data from the network device only on these M PDSCHs. Wherein, M is equal to 1, that is, only one PDSCH is received in one time unit; or, M is an integer greater than 1 and less than P, that is, multiple PDSCHs are received in one time unit. The terminal device can select M PDSCHs from P PDSCHs according to the first possible implementation method or the second possible implementation method mentioned above. For a detailed explanation, please refer to the above explanation. Optionally, the terminal device can also select M PDSCHs according to other methods. For example, it can select M PDSCHs that do not overlap in the time domain from P PDSCHs according to the third possible implementation method described below.

[0157] In the present application, receiving PDSCH can be referred to as receiving data on PDSCH, or receiving data on PDSCH, which can specifically include one or more of the following steps: demodulating, reverse rate matching, HARQ combining and decoding the signal on PDSCH. According to predefined rules, when the terminal device believes that the network device has not sent a certain PDSCH, the terminal device will not receive the PDSCH. The terminal device here does not receive PDSCH or does not receive PDSCH, which can be understood as the terminal device will not process the data that may be carried on the PDSCH according to the relevant transmission configuration of the PDSCH. The relevant transmission parameters of PDSCH may include time-frequency resources, modulation mode, HARQ process number, etc. The terminal device will not process the data that may be carried on the PDSCH, specifically including not demodulating, reverse rate matching, HARQ combining and decoding the information on the PDSCH.

[0158] S905. The terminal device sends feedback information corresponding to M PDSCHs to the network device.

[0159] After the terminal device receives data from the network device in the time domain on M PDSCHs, the terminal device sends feedback information corresponding to the M PDSCHs to the network device. For example, the terminal device sends feedback information corresponding to the M PDSCHs to the network device within the feedback time unit corresponding to the M PDSCHs. The feedback time unit corresponding to the M PDSCHs can be determined based on the offset value K1 corresponding to each PDSCH in the M PDSCHs. For a detailed explanation, please refer to the above explanation and will not be repeated here. The feedback time unit corresponding to each PDSCH in the M PDSCHs can be the same or different, without limitation.

[0160] S906. The network device receives feedback information corresponding to M PDSCHs from the terminal device.

[0161] The network device receives feedback information corresponding to the M PDSCHs from the terminal device within the feedback time unit corresponding to the M PDSCHs.

[0162] It should be noted that, since each of the PM PDSCHs in the P PDSCHs overlaps with at least one PDSCH in the M PDSCHs, the terminal device does not receive data from the network device on the PM PDSCHs. The PM PDSCHs are the PDSCHs in the P PDSCHs except the M PDSCHs.

[0163] For example, the first PDSCH is a PDSCH among the P PDSCHs except the M PDSCHs. It can be understood that the first PDSCH overlaps with at least one PDSCH among the M PDSCHs, and the terminal device does not receive data from the network device on the first PDSCH.

[0164] Further, if the first PDSCH is the last repetition in the PDSCH repetition of the first data, the method further includes the following steps.

[0165] Step 1: When the terminal device receives first data from the network device on the second PDSCH, the terminal device may send feedback information corresponding to the first data to the network device within a feedback time unit corresponding to the first PDSCH after the second PDSCH.

[0166] The second PDSCH is any repetition of the first data before the first PDSCH, and the time domain position of the second PDSCH is before the time domain position of the first PDSCH. It can be understood that the PDSCH repetition of the first data includes multiple repeated transmissions of the first data through multiple PDSCHs, and the redundant versions used in each repeated transmission can be the same or different.

[0167] The feedback time unit may be determined by the terminal device according to the first time unit where the first PDSCH is located and K1.

[0168] Step 2: When the network device sends the first data to the terminal device on the second PDSCH, the network device receives feedback information corresponding to the first data from the terminal device within a feedback time unit corresponding to the first PDSCH after the second PDSCH.

[0169] For multiple repeated transmissions of the first data, although the last repeated transmission is discarded, as long as the terminal device receives one of the multiple repeated transmissions of the first data, the terminal device can send feedback information of the first data to the network device on the corresponding feedback time unit, indicating whether the first data is correctly received by the terminal device. The feedback time unit can be determined by the network device or the terminal device based on the first time unit where the first PDSCH is located and K1. The K1 can be determined based on the indication information in the activated PDCCH. Since the terminal device sends feedback information of the first data to the network device, the probability of retransmission of the first data is reduced, thereby improving the transmission efficiency.

[0170] For example, Fig.10 As shown in FIG. 1 , in time slot 3, due to the overlap of SPS PDSCH1 and SPS PDSCH2, the terminal device receives the PDSCH corresponding to the SPS configuration with the smallest SPS index, namely SPS PDSCH1, and the terminal device does not receive SPS PDSCH2. In time slot 2, the terminal device receives SPS PDSCH2 once, and SPS PDSCH2 is decoded correctly. Figure 8The difference is that although the terminal device does not receive the last transmitted SPS PDSCH2, the terminal device still sends feedback information corresponding to the first data carried on the SPS PDSCH2 to the network device, thereby reducing the probability of retransmission of the first data carried by SPS PDSCH2 and improving transmission efficiency.

[0171] The order of the steps of the downlink data sending and receiving method provided in the embodiment of the present application can be appropriately adjusted according to their logical relationship. For example, the order between S902 and S903 can be interchanged, that is, the terminal device first determines the P PDSCHs in the first time unit, and the network device then sends data to the terminal device on M PDSCHs among the P PDSCHs.

[0172] In another possible design, when the network device sends the second data to the terminal device on the fourth PDSCH, the network device also sends the second data to the terminal device on the third PDSCH. It should be understood that the M PDSCHs include the third PDSCH. Among them, the third PDSCH and the fourth PDSCH are both repetitions of the PDSCH repetitions of the second data, and the time domain position of the third PDSCH is after the time domain position of the fourth PDSCH. For the terminal device, when the terminal device receives the second data from the network device on the fourth PDSCH, the terminal device also receives the second data from the network device on the third PDSCH. That is to say, for multiple PDSCH repetition transmissions of the second data, if the network device sends one of the PDSCH repetition transmissions, the priority of the subsequent repetition transmission of the second data will be higher than the priority of other PDSCHs, thereby ensuring the reliable transmission of the second data. Generally, repeated transmission is to improve the reliability of data transmission. The use of this priority of PDSCH that prioritizes repeated transmission can ensure the reliable transmission of data using the repeated transmission mechanism.

[0173] For example, Fig.11As shown, in time slot n+1, SPS PDSCH2, SPS PDSCH3 and SPS PDSCH4 overlap in the time domain, but because the SPS index value of SPS PDSCH2 is the smallest, the network device sends SPS PDSCH2 to the terminal device, and SPS PDSCH2 is a repetition of the PDSCH repetition of the second data. In time slot n+3, SPS PDSCH1, SPS PDSCH2 and SPS PDSCH3 overlap in the time domain. Although the SPS index value of SPS PDSCH1 is the smallest, because SPS PDSCH2 has been transmitted once in time slot n+1, the priority of SPS PDSCH2 is higher than that of SPS PDSCH1, and the network device chooses to send SPS PDSCH2 instead of SPS PDSCH1. Correspondingly, the terminal device receives SPS PDSCH2 in time slot n+3 instead of SPS PDSCH1 and SPS PDSCH3.

[0174] In another possible design, if the network device does not send the first repetition of PDSCH in the PDSCH repetition, the network device no longer sends any repetition of PDSCH after the first repetition of PDSCH. Correspondingly, under the premise that the terminal device does not receive the first repetition of PDSCH in the PDSCH repetition, the terminal device no longer receives any repetition of PDSCH after the first repetition of PDSCH. For example, assuming that the fifth PDSCH is the first repetition in the PDSCH repetition, the first PDSCH is a repetition after the first repetition in the PDSCH repetition, and the time domain position of the first PDSCH is after the time domain position of the fifth PDSCH. When the network device does not send the fifth PDSCH to the terminal device, it does not send the first PDSCH to the terminal device. Correspondingly, when the terminal device does not receive the fifth PDSCH from the network device, it does not receive the first PDSCH.

[0175] For example, Fig.12As shown, in time slot n+1, assuming that SPS PDSCH2 is the first repetition of the PDSCH repetition of the third data, since SPS PDSCH2 overlaps with SPS PDSCH1, SPS PDSCH3 and SPS PDSCH4 in the time domain, the network device does not send the third data to the terminal device on SPS PDSCH2, and the corresponding terminal device does not receive the third data from the network device on SPS PDSCH2. In time slot n+3, SPS PDSCH2 is the second repetition of the PDSCH repetition of the third data, and SPS PDSCH2 overlaps with SPS PDSCH1 and SPS PDSCH3 in the time domain. Therefore, the network device does not send the third data to the terminal device on SPS PDSCH2, and correspondingly, the terminal device does not receive the third data from the network device on SPS PDSCH2.

[0176] If the network device does not send the first repetition of the third data to the terminal device on the fifth PDSCH, the network device does not send the repetition of the third data to the terminal device on the first PDSCH. Because the data carried by the PDSCH in the first repetition may be self-decodable, if the first repetition is not sent, the data carried by the PDSCH in the subsequent repetitions may not be correctly decoded even if received, so the first repetition of the PDSCH is cancelled, and the subsequent multiple repetitions of the PDSCH are also cancelled, which can save resources and improve transmission efficiency.

[0177] When the network device activates multiple SPS configurations, it is unclear how the terminal device defines the PDSCH overlap within a time unit. For example, Figure 7 As shown, in time slot n+1, SPS PDSCH1 and SPS PDSCH2 overlap in the time domain, but SPS PDSCH1 and SPS PDSCH3 do not overlap in the time domain, and SPS PDSCH1 and SPS PDSCH 4 do not overlap in the time domain. If the terminal device selects M PDSCHs from P PDSCHs according to the first possible implementation method or the second possible implementation method mentioned above, it is easy to cause waste of resources. For example, for 4 PDSCHs, if the terminal device receives the PDSCH corresponding to the SPS configuration with the smallest SPS index, it does not receive the PDSCH that does not overlap with the PDSCH corresponding to the SPS configuration with the smallest SPS index, resulting in waste of resources. In order to improve the utilization of resources, the embodiments of the present application provide the following possible selection methods for selecting M PDSCHs that do not overlap in the time domain from P PDSCHs that overlap with each other. The execution subject of the selection process can be a terminal device or a network device, and the following description is based on the terminal device as the main body.

[0178] In a third possible implementation, if all P PDSCHs are PDSCHs without corresponding PDCCHs. The terminal device selects M PDSCHs from the P PDSCHs as follows: the terminal device divides the P PDSCHs into multiple PDSCH groups, and selects the PDSCH with the smallest identifier in each PDSCH group. The PDSCHs contained in each PDSCH group overlap with each other. In the present application, the identifier of the PDSCH may be an identifier configured by the SPS.

[0179] Furthermore, the PDSCH with the smallest identifier in each PDSCH group may also overlap. At this time, the terminal device may continue to select PDSCH according to the third possible implementation manner until M PDSCHs that do not overlap each other in the time domain are selected.

[0180] Assume that the terminal device selects N PDSCHs. If the N PDSCHs do not overlap with each other, the terminal device does not need to make any further selection, and N is equal to M.

[0181] If two PDSCHs among N PDSCHs overlap in the time domain, indicating that there are overlapping PDSCHs among the PDSCHs selected by the terminal device, then N is greater than M, and the terminal device continues to select the PDSCH using the third possible implementation method mentioned above.

[0182] The above process can also be understood as: M PDSCHs are M PDSCHs among N PDSCHs, each of the N PDSCHs belongs to one PDSCH group among N PDSCH groups, each PDSCH among N PDSCH groups is one PDSCH among P PDSCHs, and each PDSCH among P PDSCHs belongs to one PDSCH group among N PDSCH groups, where N is an integer greater than or equal to M and less than or equal to P. PDSCHs in the i-th PDSCH group among N PDSCH groups overlap with each other. The i-th PDSCH among N PDSCHs is the PDSCH with the smallest identifier value in the i-th PDSCH group, where i is a positive integer less than or equal to N.

[0183] Optionally, if N is greater than M, the terminal device selects Q PDSCHs from N PDSCHs according to a third possible implementation method. If the Q PDSCHs selected by the terminal device do not overlap with each other, the terminal device does not need to make any further selection. If at least 2 of the Q PDSCHs selected by the terminal device overlap with each other, then Q is greater than M, indicating that there are overlapping PDSCHs among the PDSCHs selected by the terminal device, and the terminal device continues to select PDSCHs, and the method of continuing to select is still in accordance with the third possible implementation method, until the PDSCHs selected by the terminal device do not overlap with each other, and these non-overlapping PDSCHs are the selected M PDSCHs.

[0184] The above process can also be understood as: M PDSCHs are M PDSCHs among Q PDSCHs, each of the Q PDSCHs belongs to one PDSCH group among Q PDSCH groups, each PDSCH among Q PDSCH groups is one PDSCH among N PDSCHs, and each PDSCH among N PDSCHs belongs to one PDSCH group among Q PDSCH groups, Q is an integer greater than or equal to M and less than N. The PDSCHs in the jth PDSCH group among the Q PDSCH groups overlap with each other. The jth PDSCH among the Q PDSCHs is the PDSCH with the smallest identifier value in the jth PDSCH group, and j is a positive integer less than or equal to Q.

[0185] In some other embodiments, the N PDSCH groups may be determined according to end symbols of some PDSCHs in the P PDSCHs.

[0186] Specifically, step 1: the terminal device records P PDSCHs as a PDSCH set, k is a positive integer less than or equal to N, and the initial value of k is equal to 1;

[0187] Step 2: The terminal device records the sixth PDSCH and the PDSCH overlapping with the sixth PDSCH in the PDSCH set as the kth PDSCH group in the N PDSCH groups, and the index value of the end symbol of the sixth PDSCH is the smallest among the index values ​​of the end symbols of the PDSCHs in the PDSCH set;

[0188] Step 3: The terminal device records the PDSCHs in the PDSCH set except the kth PDSCH group as the PDSCH set, assigns k+1 to k, and repeats step 2 until the PDSCH set is empty.

[0189] Compared with the first possible implementation and the second possible implementation, the terminal device compares the PDSCHs with or without overlap one by one and selects the PDSCHs without overlap, which has a higher computational complexity and consumes more power. The third possible implementation, when multiple SPS PDSCHs overlap, selects the SPS PDSCH with the smallest identifier for reception by grouping, thereby reducing the processing complexity and power consumption of the terminal device.

[0190] For example, Fig.13 As shown in (a), it is assumed that SPS PDSCH1, SPS PDSCH2, SPSPDSCH3 and SPS PDSCH4 in time slot n+1 are recorded as the PDSCH set. In time slot n+1, since the end symbol of SPS PDSCH1 is the first, that is, the first PDSCH to end is SPS PDSCH1, SPS PDSCH1 is taken as the standard, and SPS PDSCH1 and the PDSCHs overlapping with SPS PDSCH1 are divided into the first group. Since SPS PDSCH1 overlaps with SPS PDSCH2, the first group includes SPS PDSCH1 and SPSPDSCH2.

[0191] The remaining SPS PDSCH3 and SPS PDSCH4 are recorded as the PDSCH set. In time slot n+1, since the end symbol of SPS PDSCH3 is the first, that is, the first PDSCH to end is SPS PDSCH3, SPS PDSCH3 and the PDSCH overlapping with SPS PDSCH3 are divided into the second group based on SPS PDSCH3. Since SPS PDSCH3 overlaps with SPS PDSCH4, the second group includes SPS PDSCH3 and SPS PDSCH4.

[0192] Next, the terminal device selects SPS PDSCH1 with the smallest index in the first group and SPS PDSCH3 with the smallest index in the second group. Since SPS PDSCH1 and SPS PDSCH3 do not overlap in the time domain, the PDSCH selection process ends.

[0193] In time slot n+2, since the end symbol of SPS PDSCH1 is the first, that is, the first PDSCH to end is SPS PDSCH1, SPS PDSCH1 and the PDSCHs overlapping with SPS PDSCH1 are divided into the first group based on SPS PDSCH1. Since SPS PDSCH3 does not overlap with SPS PDSCH1, the first group includes SPS PDSCH1.

[0194] The remaining SPS PDSCH3. SPS PDSCH3 is recorded as the PDSCH set. In time slot n+2, since the end symbol of SPS PDSCH3 is the first, that is, the first PDSCH to end is SPS PDSCH3, SPS PDSCH3 and the PDSCHs overlapping with SPS PDSCH3 are divided into the second group based on SPS PDSCH3. At this time, only SPS PDSCH3 is left, and the second group includes SPS PDSCH3.

[0195] Next, the terminal device selects SPS PDSCH1 with the smallest index in the first group and SPS PDSCH3 with the smallest index in the second group. Since SPS PDSCH1 and SPS PDSCH3 do not overlap in the time domain, the PDSCH selection process ends.

[0196] like Fig.13 As shown in (b), the SPS PDSCH1 with the smallest index in the first group selected by the terminal device overlaps with the SPS PDSCH3 with the smallest index in the second group, and the terminal device continues to select the PDSCH according to the third possible implementation manner.

[0197] Specifically, SPS PDSCH1 and SPS PDSCH3 are recorded as the PDSCH set. In time slot n+1, since the end symbol of SPS PDSCH3 is the first, that is, the first PDSCH to end is SPS PDSCH3, SPS PDSCH3 is taken as the standard, and SPS PDSCH3 and the PDSCH overlapping with SPS PDSCH3 are divided into the first group. Since SPS PDSCH3 overlaps with SPS PDSCH1 in the time domain, the first group includes SPS PDSCH3 and SPS PDSCH1.

[0198] Next, the terminal device selects the SPS PDSCH1 with the smallest index in the first group.

[0199] In conventional technology, if a dynamically scheduled PDSCH overlaps with multiple PDSCHs without corresponding PDCCHs, it is usually assumed that the priority of the dynamically scheduled PDSCH is higher than that of the PDSCHs without corresponding PDCCHs, and the dynamically scheduled PDSCH and the multiple PDSCHs without corresponding PDCCHs are processed separately, that is, the dynamically scheduled PDSCHs are grouped together, and the multiple PDSCHs without corresponding PDCCHs are grouped together. If a PDSCH with the smallest index is selected from multiple PDSCHs without corresponding PDCCHs to overlap with the dynamically scheduled PDSCH, multiple PDSCHs without corresponding PDCCHs cannot be sent or received, resulting in a waste of resources.

[0200] For example, Fig.14 As shown, in time slot n+1, PDSCH0 is a dynamically scheduled PDSCH, and the terminal device groups SPS PDSCH1, SPS PDSCH2, and SPS PDSCH3 into one group. The terminal device selects SPS PDSCH1 with the smallest index. Since SPS PDSCH1 overlaps with PDSCH0, SPS PDSCH1, SPS PDSC2, and SPS PDSC3 cannot be sent or received.

[0201] In a fourth possible implementation, the P PDSCHs also include dynamically scheduled PDSCHs. The terminal device selects M PDSCHs from the P PDSCHs in the following manner: the terminal device divides the P PDSCHs into multiple PDSCH groups, the multiple PDSCH groups include a first PDSCH group and / or a second PDSCH group, and the PDSCHs contained in each PDSCH group overlap with each other. The first PDSCH group includes dynamically scheduled PDSCHs and PDSCHs that overlap with the dynamically scheduled PDSCHs and have no corresponding PDCCHs. The PDSCHs contained in the second PDSCH group are all PDSCHs that have no corresponding PDCCHs. Then, the terminal device selects the dynamically scheduled PDSCH from the first PDSCH group, and / or selects the PDSCH with the smallest identifier value and has no corresponding PDCCH from the second PDSCH group. Among them, the M PDSCHs include dynamically scheduled PDSCHs and / or PDSCHs that have no corresponding PDCCHs.

[0202] Optionally, the multiple PDSCH groups include multiple first PDSCH groups and multiple second PDSCH groups. Here, there is no limitation on the number of the first PDSCH groups and the number of the second PDSCH groups.

[0203] In some embodiments, the PDSCHs selected by the terminal device from the first PDSCH group and the second PDSCH group may also overlap. At this time, the terminal device may continue to select PDSCHs according to the fourth possible implementation manner until M PDSCHs that do not overlap with each other are selected.

[0204] Assume that the terminal device selects N PDSCHs. If the N PDSCHs do not overlap with each other, the terminal device does not need to make any further selection, and N is equal to M.

[0205] If two PDSCHs among N PDSCHs overlap in the time domain, indicating that there are overlapping PDSCHs among the PDSCHs selected by the terminal device, then N is greater than M, and the terminal device continues to select the PDSCH using the fourth possible implementation method mentioned above.

[0206] The above process can also be understood as: P PDSCHs also include dynamically scheduled PDSCHs, M PDSCHs are M PDSCHs in N PDSCHs, each PDSCH in N PDSCHs belongs to one PDSCH group in N PDSCH groups, each PDSCH in N PDSCH groups is one PDSCH in P PDSCHs, and each PDSCH in P PDSCHs belongs to one PDSCH group in N PDSCH groups, N is an integer greater than or equal to M and less than or equal to P, and PDSCHs in the i-th PDSCH group in N PDSCH groups overlap with each other. The i-th PDSCH in N PDSCHs is a PDSCH in the i-th PDSCH group, and i is a positive integer less than or equal to N. When the i-th PDSCH group includes a dynamically scheduled PDSCH, the i-th PDSCH is the dynamically scheduled PDSCH; and / or, when the i-th PDSCH group does not include a dynamically scheduled PDSCH, the i-th PDSCH is the PDSCH with the smallest identifier value in the i-th PDSCH group.

[0207] Optionally, if N is greater than M, the terminal device selects Q PDSCHs from the N PDSCHs according to a fourth possible implementation method. If the Q PDSCHs selected by the terminal device do not overlap with each other, the terminal device does not need to make any further selection. If at least 2 of the Q PDSCHs selected by the terminal device overlap with each other, Q is greater than M, indicating that there are overlapping PDSCHs among the PDSCHs selected by the terminal device, and the terminal device continues to select PDSCHs in accordance with the fourth possible implementation method until the PDSCHs selected by the terminal device do not overlap with each other, and these non-overlapping PDSCHs are the selected M PDSCHs.

[0208] The above process can also be understood as: M PDSCHs are M PDSCHs among Q PDSCHs, each of the Q PDSCHs belongs to one PDSCH group among Q PDSCH groups, each PDSCH in the Q PDSCH groups is one PDSCH among N PDSCHs, and each PDSCH in the N PDSCHs belongs to one PDSCH group among Q PDSCH groups, and Q is an integer greater than or equal to M and less than N. The PDSCHs in the jth PDSCH group among the Q PDSCH groups overlap with each other. The jth PDSCH among the Q PDSCHs is a PDSCH in the jth PDSCH group, and j is a positive integer less than or equal to Q. When the jth PDSCH group includes a dynamically scheduled PDSCH, the jth PDSCH is a dynamically scheduled PDSCH; and / or, when the jth PDSCH group does not include a dynamically scheduled PDSCH, the jth PDSCH is the PDSCH with the smallest identifier value in the jth PDSCH group.

[0209] The manner of determining N PDSCH groups is as described in the third possible implementation manner above and will not be described in detail herein.

[0210] Compared with the first possible implementation and the second possible implementation, the terminal device compares the PDSCHs with or without overlap one by one and selects the PDSCHs without overlap, which results in a higher computational complexity and power consumption for the terminal device. The fourth possible implementation, by processing the dynamically scheduled PDSCH and SPS PDSCH in a unified manner, simplifies the processing flow of the terminal device, reduces the computational complexity and power consumption of the terminal device, and ensures that as many PDSCHs without corresponding PDCCHs as possible are received, thereby improving resource utilization and reducing data transmission delay because data can be received in a timely manner.

[0211] For example, Fig.15 As shown, it is assumed that SPS PDSCH1, SPS PDSCH2, SPS PDSCH3 and PDSCH0 in time slot n+1 are recorded as a PDSCH set. In time slot n+1, since the end symbol of PDSCH0 is the first, that is, the first ended PDSCH is the dynamically scheduled PDSCH0, PDSCH0 and the PDSCHs overlapping with PDSCH0 are divided into the first group based on PDSCH0. Since SPS PDSCH1 overlaps with PDSCH0, the first group includes SPS PDSCH1 and PDSCH0.

[0212] The remaining SPS PDSCH2 and SPS PDSCH3 are recorded as the PDSCH set. In time slot n+1, since the end symbol of SPS PDSCH2 is the first, that is, the first PDSCH to end is SPS PDSCH2, SPS PDSCH2 and the PDSCH overlapping with SPS PDSCH2 are divided into the second group based on SPS PDSCH2. Since SPS PDSCH2 overlaps with SPS PDSCH3, the second group includes SPS PDSCH2 and SPS PDSCH3.

[0213] Next, the terminal device selects PDSCH0 in the first group and SPS PDSCH2 with the smallest index in the second group. Since PDSCH0 and SPS PDSCH2 do not overlap in the time domain, the PDSCH selection process ends.

[0214] In time slot n+2, since the end symbol of PDSCH is the first, that is, the first ended PDSCH is the dynamically scheduled PDSCH0, PDSCH0 and the PDSCHs overlapping with PDSCH0 are divided into the first group. Since SPS PDSCH2 does not overlap with PDSCH, the first group includes PDSCH0.

[0215] The remaining SPS PDSCH2. SPS PDSCH2 is recorded as the PDSCH set. In time slot n+2, since the end symbol of SPS PDSCH2 is the first, that is, the first PDSCH to end is SPS PDSCH2, SPS PDSCH2 and the PDSCHs overlapping with SPS PDSCH2 are divided into the second group based on SPS PDSCH2. At this time, only SPS PDSCH2 is left, and the second group includes SPS PDSCH2.

[0216] Next, the terminal device selects PDSCH0 in the first group and SPS PDSCH2 with the smallest index in the second group. Since PDSCH0 and SPS PDSCH2 do not overlap in the time domain, the PDSCH selection process ends.

[0217] In a fifth possible implementation, the P PDSCHs also include a dynamically scheduled PDSCH. First, the terminal device selects a dynamically scheduled PDSCH and multiple PDSCHs without corresponding PDCCHs that do not overlap with the dynamically scheduled PDSCHs from the P PDSCHs; then, from multiple PDSCHs without corresponding PDCCHs that do not overlap with the dynamically scheduled PDSCHs, the terminal device selects the PDSCH without corresponding PDCCH with the smallest identifier. Among them, the M PDSCHs include the dynamically scheduled PDSCH and the PDSCH without corresponding PDCCH with the smallest identifier.

[0218] The above process can also be understood as: the M PDSCHs include dynamically scheduled PDSCHs and R PDSCHs without corresponding PDCCHs, the R PDSCHs without corresponding PDCCHs are the R PDSCHs without corresponding PDCCHs with the smallest identifiers among the P PDSCHs, excluding the dynamically scheduled PDSCHs and the PDSCHs without corresponding PDCCHs that overlap with the dynamically scheduled PDSCHs, and R is a positive integer less than M.

[0219] The terminal device selects R PDSCHs with the smallest identifier from P PDSCHs excluding the dynamically scheduled PDSCH and the PDSCH that overlaps with the dynamically scheduled PDSCH and has no corresponding PDCCH. The method of selecting M PDSCHs from P PDSCHs in the first possible implementation method, or the second possible implementation method, or the third possible implementation method may be referred to, and details will not be repeated here.

[0220] Optionally, if R is greater than 1, the PDSCH identifiers included in the smallest R PDSCHs are the same and the identifier is the smallest.

[0221] Optionally, the R PDSCHs with the smallest identifier are PDSCHs identified from small to large, the R PDSCHs do not overlap, and the terminal device can receive data on the R PDSCHs.

[0222] It should be noted that a PDSCH without a corresponding PDCCH that overlaps with a dynamically scheduled PDSCH from a network device is not received.

[0223] Since the PDSCH without corresponding PDCCH overlapping with the dynamically scheduled PDSCH is canceled first, and then the PDSCH with the smallest identifier among the remaining PDSCH without corresponding PDCCH is received, it is ensured that as many PDSCH without corresponding PDCCH as possible are received, thereby improving resource utilization. At the same time, since data can be received in time, data transmission delay is reduced.

[0224] For example, Fig.15As shown, in time slot n+1, SPS PDSCH1 overlaps with PDSCH0, and the terminal device does not receive SPS PDSCH1. SPS PDSCH2 and SPS PDSCH3 do not overlap with PDSCH0, and SPS PDSCH2 and SPS PDSCH3 are grouped together according to the third possible implementation method, and SPS PDSCH2 with the smallest index is selected. Therefore, the terminal device receives PDSCH0 and SPS PDSCH2. Since PDSCH0 and SPS PDSCH2 do not overlap in the time domain, the PDSCH selection process ends.

[0225] It is understandable that in order to implement the functions in the above embodiments, the network device and the terminal device include hardware structures and / or software modules corresponding to the execution of each function. It should be easily appreciated by those skilled in the art that, in combination with the units and method steps of each example described in the embodiments disclosed in this application, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application scenario and design constraints of the technical solution.

[0226] Fig.16 and Fig.17 The following is a schematic diagram of the structure of possible communication devices provided in the embodiments of the present application. These communication devices can be used to implement the functions of the terminal device or network device in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. In the embodiments of the present application, the communication device can be as follows: Figure 1 The terminal device 130 or the terminal device 140 shown in the figure may also be as follows Figure 1 The wireless access network device 120 shown may also be a module (such as a chip) applied to a terminal device or a network device.

[0227] like Fig.16 As shown, the communication device 1600 includes a processing unit 1610 and a transceiver unit 1620. If the communication device 1600 is a terminal device. The processing unit 1610 is used to determine P PDSCHs within a first time unit, the P PDSCHs include a PDSCH without a corresponding PDCCH, at least two PDSCHs of the P PDSCHs overlap in the time domain, and P is an integer greater than 1. The transceiver unit 1620 is used to receive data from a network device only on M PDSCHs among the P PDSCHs, where M is equal to 1; or, M is an integer greater than 1 and less than P, and the M PDSCHs do not overlap in the time domain; the first PDSCH is a PDSCH other than the M PDSCHs among the P PDSCHs; the terminal device does not receive data from the network device on the first PDSCH, and the transceiver unit 1620 is also used to send feedback information corresponding to the M PDSCHs to the network device.

[0228] If the communication device 1600 is a network device. The processing unit 1610 is used to determine P PDSCHs within the first time unit, the P PDSCHs include a PDSCH without a corresponding PDCCH, at least two PDSCHs among the P PDSCHs overlap in the time domain, and P is an integer greater than 1. The transceiver unit 1620 is used to send data to the terminal device only on M PDSCHs among the P PDSCHs, where M is equal to 1; or, M is an integer greater than 1 and less than P, and the M PDSCHs do not overlap in the time domain; the first PDSCH is a PDSCH among the P PDSCHs except the M PDSCHs, and data is not sent to the terminal device on the first PDSCH. The transceiver unit 1620 is also used to receive feedback information corresponding to the M PDSCHs from the terminal device.

[0229] The communication device 1600 is used to implement the above Fig. 9 The functions of the terminal device or the network device in the method embodiment shown in FIG.

[0230] When the communication device 1600 is used to implement Fig. 9 The functions of the terminal device in the method embodiment shown are: the processing unit 1610 is used to execute S903. The transceiver unit 1620 is used to execute S904 and S905.

[0231] When the communication device 1600 is used to implement Fig. 9 The functions of the network device in the method embodiment shown are: the processing unit 1610 is used to execute S901. The transceiver unit 1620 is used to execute S902 and S906.

[0232] For more detailed description of the processing unit 1610 and the transceiver unit 1620, please refer to Fig. 9 The relevant description in the method embodiment shown is directly obtained and will not be repeated here.

[0233] like Fig.17 As shown, the communication device 1700 includes a processor 1710 and an interface circuit 1720. The processor 1710 and the interface circuit 1720 are coupled to each other. It is understood that the interface circuit 1720 can be a transceiver or an input-output interface. Optionally, the communication device 1700 may also include a memory 1730 for storing instructions executed by the processor 1710 or storing input data required by the processor 1710 to execute instructions or storing data generated after the processor 1710 executes instructions.

[0234] When the communication device 1700 is used to implement Fig. 9When the method is shown, the processor 1710 is used to execute the function of the above-mentioned processing unit 1610, and the interface circuit 1720 is used to execute the function of the above-mentioned transceiver unit 1620.

[0235] When the above communication device is a chip applied to a terminal device, the terminal device chip implements the functions of the terminal device in the above method embodiment. The terminal device chip receives information from other modules in the terminal device (such as a radio frequency module or an antenna), and the information is sent by the network device to the terminal device; or the terminal device chip sends information to other modules in the terminal device (such as a radio frequency module or an antenna), and the information is sent by the terminal device to the network device.

[0236] When the above communication device is a chip applied to a network device, the network device chip implements the function of the network device in the above method embodiment. The network device chip receives information from other modules in the network device (such as a radio frequency module or an antenna), and the information is sent by the terminal device to the network device; or the network device chip sends information to other modules in the network device (such as a radio frequency module or an antenna), and the information is sent by the network device to the terminal device.

[0237] It is understandable that the processor in the embodiments of the present application may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0238] The method steps in the embodiments of the present application can be implemented by hardware or by a processor executing software instructions. The software instructions can be composed of corresponding software modules, and the software modules can be stored in random access memory (RAM), flash memory, read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), registers, hard disks, mobile hard disks, CD-ROMs or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and the storage medium can be located in an ASIC. In addition, the ASIC can be located in a network device or a terminal device. Of course, the processor and the storage medium can also be present in a network device or a terminal device as discrete components.

[0239] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instruction is loaded and executed on a computer, the process or function described in the embodiment of the present application is executed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device or other programmable device. The computer program or instruction may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer program or instruction may be transmitted from one website site, computer, server or data center to another website site, computer, server or data center by wired or wireless means. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium may be a magnetic medium, for example, a floppy disk, a hard disk, a tape; it may also be an optical medium, for example, a digital video disc (DVD); it may also be a semiconductor medium, for example, a solid state drive (SSD).

[0240] In the various embodiments of the present application, unless otherwise specified or provided for in any logical conflict, the terms and / or descriptions between the different embodiments are consistent and may be referenced to each other, and the technical features in the different embodiments may be combined to form new embodiments according to their inherent logical relationships.

[0241] In this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. In the text description of this application, the character " / " generally indicates that the previous and next associated objects are in an "or" relationship; in the formula of this application, the character " / " indicates that the previous and next associated objects are in a "division" relationship.

[0242] It is understood that the various numbers involved in the embodiments of the present application are only for the convenience of description and are not used to limit the scope of the embodiments of the present application. The size of the sequence number of the above-mentioned processes does not mean the order of execution, and the execution order of each process should be determined by its function and internal logic.

Claims

1. A method for sending downlink data, characterized in that: include: Determine P physical downlink shared channels PDSCHs within a first time unit, where the P PDSCHs include a PDSCH without a corresponding physical downlink control channel PDCCH, at least two of the P PDSCHs overlap in the time domain, and P is an integer greater than 1; Among the P PDSCHs, data is sent to the terminal device only on M PDSCHs, where M is equal to 1; or, M is an integer greater than 1 and less than P, and the M PDSCHs do not overlap in the time domain; Among the P PDSCHs, data is sent only on M PDSCHs, including: Step 1: Send data in a target semi-persistent scheduling SPS PDSCH, where the target SPS PDSCH is the PDSCH corresponding to the SPS configuration with the smallest SPS index within the first time unit; Step 2: not sending the SPSPDSCH in the first time unit that overlaps with the target SPS PDSCH in the time domain; Repeat step 1 and step 2 until there is no activated SPS PDSCH in the first time unit, or until the number of sent data or the number of sent PDSCHs reaches the capacity of the terminal device, then stop sending; Receiving feedback information corresponding to the M PDSCHs from the terminal device; The first PDSCH is the last repetition of the PDSCH repetition of the first data, and the first PDSCH is the PDSCH other than the M PDSCHs among the P PDSCHs; the method further includes: When the first data is sent to the terminal device on the second PDSCH, feedback information of the first data from the terminal device is received within a feedback time unit corresponding to the first PDSCH, wherein the second PDSCH is any repetition of the first data before the first PDSCH.

2. The method according to claim 1, characterized in that The first PDSCH overlaps with at least one PDSCH among the M PDSCHs in the time domain.

3. The method according to claim 1, characterized in that When the second data is sent to the terminal device on the fourth PDSCH, the M PDSCHs include a third PDSCH, wherein the third PDSCH and the fourth PDSCH are both repetitions of the PDSCH repetitions of the second data, and the time domain position of the third PDSCH is after the time domain position of the fourth PDSCH.

4. The method according to claim 1, characterized in that: When the fifth PDSCH is not sent to the terminal device, the first PDSCH is not sent to the terminal device, the fifth PDSCH is the first repetition in the PDSCH repetition, the first PDSCH is a repetition after the first repetition in the PDSCH repetition, and the time domain position of the first PDSCH is after the time domain position of the fifth PDSCH.

5. The method according to claim 1, characterized in that The M PDSCHs are M PDSCHs among N PDSCHs, each of the N PDSCHs belongs to one PDSCH group among the N PDSCH groups, each PDSCH in the N PDSCH groups is one PDSCH among the P PDSCHs, and each PDSCH in the P PDSCHs belongs to one PDSCH group among the N PDSCH groups, and N is an integer greater than or equal to M and less than or equal to P; The PDSCHs in the i-th PDSCH group of the N PDSCH groups overlap with each other; The i-th PDSCH among the N PDSCHs is a PDSCH with a smallest identifier value in the i-th PDSCH group, and i is a positive integer less than or equal to N.

6. The method according to claim 1, characterized in that The P PDSCHs also include a dynamically scheduled PDSCH, the M PDSCHs are M PDSCHs among N PDSCHs, each of the N PDSCHs belongs to one PDSCH group among the N PDSCH groups, each PDSCH in the N PDSCH groups is one PDSCH in the P PDSCHs, and each PDSCH in the P PDSCHs belongs to one PDSCH group among the N PDSCH groups, N is an integer greater than or equal to M and less than or equal to P, and the PDSCHs in the i-th PDSCH group among the N PDSCH groups overlap with each other; The i-th PDSCH among the N PDSCHs is a PDSCH in the i-th PDSCH group, where i is a positive integer less than or equal to N; When the i-th PDSCH group includes a dynamically scheduled PDSCH, the i-th PDSCH is the dynamically scheduled PDSCH; and / or, When the i-th PDSCH group does not include a dynamically scheduled PDSCH, the i-th PDSCH is a PDSCH with a smallest identifier value in the i-th PDSCH group.

7. The method according to claim 5 or 6, characterized in that: The N PDSCH groups are determined according to end symbols of some PDSCHs in the P PDSCHs.

8. The method according to claim 7, characterized in that The N PDSCH groups are determined according to the end symbols of some PDSCHs in the P PDSCHs, and specifically include: Step 1: The P PDSCHs are recorded as a PDSCH set, k is a positive integer less than or equal to N, and the initial value of k is 1; Step 2: Record the sixth PDSCH and the PDSCH overlapping with the sixth PDSCH in the PDSCH set as the kth PDSCH group in the N PDSCH groups, and the index value of the end symbol of the sixth PDSCH is the smallest among the index values ​​of the end symbols of the PDSCHs in the PDSCH set; Step 3: record the PDSCHs in the PDSCH set except the k-th PDSCH group as the PDSCH set, assign k+1 to k, and repeat step 2 until the PDSCH set is empty.

9. The method according to claim 5, characterized in that The M PDSCHs are M PDSCHs among Q PDSCHs, each of the Q PDSCHs belongs to one PDSCH group among the Q PDSCH groups, each PDSCH in the Q PDSCH groups is one PDSCH among the N PDSCHs, and each PDSCH in the N PDSCHs belongs to one PDSCH group among the Q PDSCH groups, and Q is an integer greater than or equal to M and less than N; The PDSCHs in the j-th PDSCH group of the Q PDSCH groups overlap with each other; The j-th PDSCH among the Q PDSCHs is the PDSCH with the smallest identifier value in the j-th PDSCH group, and j is a positive integer less than or equal to Q.

10. The method according to claim 6, characterized in that The M PDSCHs are M PDSCHs among Q PDSCHs, each of the Q PDSCHs belongs to one PDSCH group among the Q PDSCH groups, each PDSCH in the Q PDSCH groups is one PDSCH among the N PDSCHs, and each PDSCH in the N PDSCHs belongs to one PDSCH group among the Q PDSCH groups, and Q is an integer greater than or equal to M and less than N; The PDSCHs in the j-th PDSCH group of the Q PDSCH groups overlap with each other; The j-th PDSCH among the Q PDSCHs is a PDSCH in the j-th PDSCH group, where j is a positive integer less than or equal to Q; When the j-th PDSCH group includes a dynamically scheduled PDSCH, the j-th PDSCH is the dynamically scheduled PDSCH; and / or, When the j-th PDSCH group does not include a dynamically scheduled PDSCH, the j-th PDSCH is a PDSCH with a smallest identifier value in the j-th PDSCH group.

11. The method according to claim 1, characterized in that The P PDSCHs also include a dynamically scheduled PDSCH, the M PDSCHs include the dynamically scheduled PDSCH and R PDSCHs without corresponding PDCCHs, the R PDSCHs without corresponding PDCCHs are the R PDSCHs without corresponding PDCCHs with the smallest identifiers among the P PDSCHs, excluding the dynamically scheduled PDSCH and the PDSCH without corresponding PDCCH that overlaps with the dynamically scheduled PDSCH, and R is less than M.

12. The method according to claim 11, characterized in that A PDSCH without a corresponding PDCCH that overlaps with the dynamically scheduled PDSCH is not sent to the terminal device.

13. A method for receiving downlink data, characterized in that: include: Determine P physical downlink shared channels PDSCHs within a first time unit, where the P PDSCHs include a PDSCH without a corresponding physical downlink control channel PDCCH, at least two of the P PDSCHs overlap in the time domain, and P is an integer greater than 1; Among the P PDSCHs, data from the network device is received only on M PDSCHs, where M is equal to 1; or, M is an integer greater than 1 and less than P, and the M PDSCHs do not overlap in the time domain; Among the P PDSCHs, receiving data from the network device only on M PDSCHs includes: Step 1: receiving data in a target semi-persistent scheduling SPS PDSCH, wherein the target SPS PDSCH is a PDSCH corresponding to the SPS configuration with the smallest SPS index within the first time unit; Step 2: not receiving the SPSPDSCH in the first time unit that overlaps with the target SPS PDSCH in the time domain; Repeat step 1 and step 2 until there is no activated SPS PDSCH in the first time unit, or until the number of received data or the number of received PDSCH reaches the capability of the terminal device, then stop receiving; Sending feedback information corresponding to the M PDSCHs to the network device; The first PDSCH is the last repetition of the PDSCH repetition of the first data, the first PDSCH is the PDSCH other than the M PDSCHs among the P PDSCHs, and the method further includes: When the first data is received from the network device on a second PDSCH, feedback information of the first data is sent to the network device within a feedback time unit corresponding to the first PDSCH, wherein the second PDSCH is any repetition of the first data before the first PDSCH.

14. The method according to claim 13, characterized in that The first PDSCH overlaps with at least one PDSCH among the M PDSCHs in the time domain.

15. The method according to claim 13, characterized in that When the second data is received from the network device on the fourth PDSCH, the M PDSCHs include a third PDSCH, wherein the third PDSCH and the fourth PDSCH are both repetitions of the PDSCH repetitions of the second data, and the time domain position of the third PDSCH is after the time domain position of the fourth PDSCH.

16. The method according to claim 13, characterized in that When the fifth PDSCH is not received, the first PDSCH is also not received, the fifth PDSCH is the first repetition in the PDSCH repetition, the first PDSCH is a repetition after the first repetition in the PDSCH repetition, and the time domain position of the first PDSCH is after the time domain position of the fifth PDSCH.

17. The method according to claim 13, characterized in that The M PDSCHs are M PDSCHs among N PDSCHs, each of the N PDSCHs belongs to one PDSCH group among the N PDSCH groups, each PDSCH in the N PDSCH groups is one PDSCH among the P PDSCHs, and each PDSCH in the P PDSCHs belongs to one PDSCH group among the N PDSCH groups, and N is an integer greater than or equal to M and less than or equal to P; The PDSCHs in the i-th PDSCH group of the N PDSCH groups overlap with each other; The i-th PDSCH among the N PDSCHs is a PDSCH with a smallest identifier value in the i-th PDSCH group, and i is a positive integer less than or equal to N.

18. The method according to claim 13, characterized in that The P PDSCHs also include a dynamically scheduled PDSCH, the M PDSCHs are M PDSCHs among N PDSCHs, each of the N PDSCHs belongs to one PDSCH group among the N PDSCH groups, each PDSCH in the N PDSCH groups is one PDSCH in the P PDSCHs, and each PDSCH in the P PDSCHs belongs to one PDSCH group among the N PDSCH groups, N is an integer greater than or equal to M and less than or equal to P, and the PDSCHs in the i-th PDSCH group among the N PDSCH groups overlap with each other; The i-th PDSCH among the N PDSCHs is a PDSCH in the i-th PDSCH group, where i is a positive integer less than or equal to N; When the i-th PDSCH group includes a dynamically scheduled PDSCH, the i-th PDSCH is the dynamically scheduled PDSCH; and / or, When the i-th PDSCH group does not include a dynamically scheduled PDSCH, the i-th PDSCH is a PDSCH with a smallest identifier value in the i-th PDSCH group.

19. The method according to claim 17 or 18, characterized in that The N PDSCH groups are determined according to end symbols of some PDSCHs in the P PDSCHs.

20. The method according to claim 19, characterized in that The N PDSCH groups are determined according to the end symbols of some PDSCHs in the P PDSCHs, and specifically include: Step 1: The P PDSCHs are recorded as a PDSCH set, k is a positive integer less than or equal to N, and the initial value of k is 1; Step 2: Record the sixth PDSCH and the PDSCH overlapping with the sixth PDSCH in the PDSCH set as the kth PDSCH group in the N PDSCH groups, and the index value of the end symbol of the sixth PDSCH is the smallest among the index values ​​of the end symbols of the PDSCHs in the PDSCH set; Step 3: record the PDSCHs in the PDSCH set except the k-th PDSCH group as the PDSCH set, assign k+1 to k, and repeat step 2 until the PDSCH set is empty.

21. The method according to claim 17, characterized in that The M PDSCHs are M PDSCHs among Q PDSCHs, each of the Q PDSCHs belongs to one PDSCH group among the Q PDSCH groups, each PDSCH in the Q PDSCH groups is one PDSCH among the N PDSCHs, and each PDSCH in the N PDSCHs belongs to one PDSCH group among the Q PDSCH groups, and Q is an integer greater than or equal to M and less than N; The PDSCHs in the j-th PDSCH group of the Q PDSCH groups overlap with each other; The j-th PDSCH among the Q PDSCHs is the PDSCH with the smallest identifier value in the j-th PDSCH group, and j is a positive integer less than or equal to Q.

22. The method according to claim 18, characterized in that The M PDSCHs are M PDSCHs among Q PDSCHs, each of the Q PDSCHs belongs to one PDSCH group among the Q PDSCH groups, each PDSCH in the Q PDSCH groups is one PDSCH among the N PDSCHs, and each PDSCH in the N PDSCHs belongs to one PDSCH group among the Q PDSCH groups, and Q is an integer greater than or equal to M and less than N; The PDSCHs in the j-th PDSCH group of the Q PDSCH groups overlap with each other; The j-th PDSCH among the Q PDSCHs is a PDSCH in the j-th PDSCH group, where j is a positive integer less than or equal to Q; When the j-th PDSCH group includes a dynamically scheduled PDSCH, the j-th PDSCH is the dynamically scheduled PDSCH; and / or, When the j-th PDSCH group does not include a dynamically scheduled PDSCH, the j-th PDSCH is a PDSCH with a smallest identifier value in the j-th PDSCH group.

23. The method according to claim 13, characterized in that The P PDSCHs also include a dynamically scheduled PDSCH, the M PDSCHs include the dynamically scheduled PDSCH and R PDSCHs without corresponding PDCCHs, the R PDSCHs without corresponding PDCCHs are the R PDSCHs without corresponding PDCCHs with the smallest identifiers among the P PDSCHs, excluding the dynamically scheduled PDSCH and the PDSCH without corresponding PDCCH that overlaps with the dynamically scheduled PDSCH, and R is less than M.

24. The method according to claim 23, characterized in that A PDSCH without a corresponding PDCCH that overlaps with the dynamically scheduled PDSCH is not received from the network device.

25. A communication device, characterized in that: A method comprising a module for executing the method of any one of claims 1 to 12 or a module for executing the method of any one of claims 13 to 24.

26. A communication device, characterized in that: It includes a processor and an interface circuit, wherein the interface circuit is used to receive signals from other communication devices outside the communication device and transmit them to the processor or send signals from the processor to other communication devices outside the communication device, and the processor is used to implement the method as described in any one of claims 1 to 12 or the method as described in any one of claims 13 to 24 through a logic circuit or executing code instructions.

27. A computer-readable storage medium, characterized in that: The storage medium stores a computer program or an instruction. When the computer program or the instruction is executed by the communication device, the method according to any one of claims 1 to 12 or the method according to any one of claims 13 to 24 is implemented.

28. A computer program product, characterized in that The computer program product comprises a computer program or instructions. When the computer program or instructions are executed by a communication device, the communication device implements the method according to any one of claims 1 to 12, or implements the method according to any one of claims 13 to 24.

Citation Information

Cited By

  • Downlink data sending method and apparatus, and downlink data receiving method and apparatus

    WO2021204207A1