Data transmission method and apparatus

Abstract

The application provides a data transmission method and device, and relates to the technical field of communication. In the method, a terminal can receive a time slot format and PUSCH parameters from a network device, determine a PUSCH resource according to the time slot format and the PUSCH parameters, determine N1 resources for sending a first RV of the PUSCH according to the PUSCH resource, and successively send bits in the first RV on the N1 resources. The N1 resources are located on at least two time slots, so that discrete resources for sending the same RV are integrated to send a complete first RV, the problem of incomplete RV sending caused by discrete resources is avoided, and the decoding performance of the network device and the reliability of data transmission are improved.

Description

[0001] This application claims priority to Chinese Patent Application No. 202011410208.2, filed with the State Intellectual Property Office of China on December 3, 2020, entitled "A PUSCH Type-B Enhancement Method", and Chinese Patent Application No. 202110057975.8, filed with the State Intellectual Property Office of China on January 15, 2021, entitled "Data Transmission Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and in particular to a data transmission method and apparatus. Background Technology

[0003] Currently, before a terminal repeatedly transmits the Physical Uplink Shared Channel (PUSCH), the network device can configure the start symbol S, the number of symbols L, and the repetition count to enable the terminal to acquire resources for repeatedly transmitting the PUSCH. Assuming the starting time slot for the terminal's PUSCH transmission is time slot n, then starting from the start symbol S in time slot n, all available symbols (repetition count * L) are used for repeatedly transmitting the PUSCH. For example, see... Figure 1 If S=8, L=14, and the number of repetitions is 4, starting from the first symbol 8 in time slot n, L*4 available symbols are used to repeatedly transmit PUSCH. Each L available symbols starting from the first symbol 8 in time slot n is designated as a nominal repetition, and symbols within the same time slot in a nominal repetition are designated as an actual repetition. A redundant version (RV) of the PUSCH is transmitted on each actual repetition. One possible configuration for the RV transmitted on each actual repetition can be found in [link to relevant documentation]. Figure 1 This method can reuse all available symbols to send PUSCH repeatedly, but because the actual reused resources are relatively scattered, the RV of PUSCH cannot be sent completely, which will affect the decoding performance of network devices and reduce the reliability of data transmission. Summary of the Invention

[0004] This application provides a data transmission method and apparatus to improve the decoding performance of network devices and the reliability of data transmission.

[0005] Firstly, a data transmission method is provided, comprising: receiving a timeslot format and PUSCH parameters from a network device; determining PUSCH resources based on the timeslot format and PUSCH parameters; determining N1 resources based on the PUSCH resources; and continuously transmitting bits from a first RV on the N1 resources. The N1 resources are used to transmit the first RV of the PUSCH, and the N1 resources are located on at least two timeslots, where N1 is an integer greater than 1. The method provided by the first aspect integrates discrete resources that transmit the same RV, and continuously transmits the first RV on the integrated resources. Compared with the prior art of transmitting the RV from scratch on each resource, the terminal can transmit the complete first RV, which can solve the problem of incomplete RV transmission caused by resource discreteness, and improve the decoding performance of the network device and the reliability of data transmission. If the first RV is RV0, it can also reduce the decoding performance loss caused by incomplete transmission of RV0 (i.e., system bit loss).

[0006] In one possible implementation, the sequential transmission of bits in the first RV includes: if the last bit of the first RV is transmitted on the first resource, the first bit of the first RV is transmitted on the second resource, where the first resource is the n1th resource out of N1 resources, and the second resource is the (n1+1)th resource out of N1 resources, where n1 = 1, 2, ..., N1-1. This possible implementation can guarantee the transmission of the first RV as completely as possible.

[0007] In one possible implementation, transmitting the first bit of the first RV on the second resource includes: transmitting the first bit of the first RV on the second resource if the number of REs in the remaining resources of the first resource is less than or equal to a first threshold. This possible implementation can determine the starting position of the first RV without wasting too many resources.

[0008] In one possible implementation, the sequential transmission of bits in the first RV includes: if the last bit of the first RV is transmitted on the first symbol in the first resource, the first bit of the first RV is transmitted on the second symbol in the first resource, where the first resource is the n2th resource out of N1 resources, and the second symbol is the symbol following the first symbol, n2 = 1, 2, ..., N1. This possible implementation can guarantee the transmission of the first RV as completely as possible.

[0009] In one possible implementation, transmitting the first bit of the first RV on the second symbol in the first resource includes transmitting the first bit of the first RV on the second symbol if the number of REs in the remaining resources on the first symbol is less than or equal to a second threshold. This possible implementation can determine the starting position of the first RV without wasting too many resources.

[0010] In one possible implementation, the sequential transmission of bits in the first RV includes: if the last bit of the first RV is transmitted on the first symbol of the first resource, the first bit of the first RV is transmitted on the remaining resources on the first symbol of the first resource. The first resource is the n3rd resource out of N1 resources, where n3 = 1, 2, ..., N1. This possible implementation can guarantee the transmission of the first RV as completely as possible. This possible implementation can determine the starting position of the first RV without wasting too many resources.

[0011] In one possible implementation, the continuation of transmission of bits in the first RV further includes: if the last bit transmitted on the third resource is not the last bit of the first RV, then the last bit transmitted on the third resource and the first bit transmitted on the fourth resource are two adjacent bits of the first RV. The third resource is the n4th resource out of N1 resources, and the fourth resource is the (n4+1)th resource out of N1 resources, where n4 = 1, 2, ..., N1-1. This possible implementation ensures that the first RV is transmitted as completely as possible. With this possible implementation, the fourth resource does not need to start transmitting the first RV from the beginning, thus achieving the effect of transmitting all bits in the first RV.

[0012] In one possible implementation, transmitting bits from the first RV sequentially on N1 resources includes: if the number of symbols occupied by the PUSCH resource is greater than or equal to a third threshold, or if the repetition count indicated by the PUSCH parameter is greater than or equal to a fourth threshold, then transmitting bits from the first RV sequentially on N1 resources. This possible implementation can use the method provided in this application to transmit RV when necessary, and not use the method provided in this application to transmit RV when unnecessary, thereby improving transmission efficiency.

[0013] In one possible implementation, the third threshold is related to the number of symbols and the number of repetitions in the PUSCH, which are indicated by the PUSCH parameters. In this possible implementation, if PUSCH resources are too scarce, it is difficult to obtain the gain of the continuous transmission RV. Therefore, triggering the continuous transmission RV only when PUSCH resources are sufficient can obtain the gain of the continuous transmission RV.

[0014] In one possible implementation, if two time-contiguous resources among N1 resources have the same frequency-domain resource, the resource with the later time domain transmission does not send DMRS in the PUSCH. This possible implementation allows more resources to be used for data transmission, improving resource utilization.

[0015] In one possible implementation, the method further includes: determining N2 resources based on the PUSCH resources, wherein the N2 resources are used to transmit the second RV of the PUSCH, the N2 resources are located on at least two time slots, and N2 is an integer greater than 1; and continuously transmitting bits from the second RV on the N2 resources. This possible implementation, while ensuring the complete transmission of the first RV, can also ensure the complete transmission of the second RV, further improving the decoding performance of the network device and the reliability of data transmission.

[0016] Secondly, a data transmission method is provided, comprising: receiving a timeslot format and PUSCH parameters from a network device; determining a PUSCH resource and a first value based on the timeslot format and PUSCH parameters; determining X RVs of the PUSCH based on the first value; and transmitting at least one of the X RVs on the PUSCH resource, where X is an integer greater than 0. The method provided in this second aspect introduces more RVs (e.g., more than 4 RVs), determining the number of RVs by the number of resources or repetitions in the PUSCH resource, and transmitting more RVs on the resource. This aims to ensure that different resources carry different RVs, reducing the problem of repeatedly transmitting the same RV on resources with a small number of RVs, maximizing the integrity of system bit transmission, and minimizing the decoding performance loss caused by incomplete system bit transmission due to discrete resources.

[0017] In one possible implementation, X is the same as the first numerical value; or, X is a value among multiple optional values ​​that is greater than and closest to the first numerical value, or a value less than the first numerical value that is closest to the first numerical value, where the multiple optional values ​​are pre-configured. This possible implementation provides multiple methods for determining X, improving the flexibility of this application.

[0018] Thirdly, a data transmission method is provided, comprising: determining PUSCH resources according to PUSCH parameters and a time slot format, wherein the PUSCH resources include M resources, one of the M resources being used to carry a RV of the PUSCH; sending first indication information to a terminal, causing the first RV of the PUSCH to be transmitted on a first resource, wherein the first RV is the RV with index 0; wherein the first indication information indicates the RV of the PUSCH transmitted by the first resource among the M resources, and the first resource is the resource with the most symbols among the M resources, or the first resource is the resource with the most symbols among the resources among the M resources used to transmit the same RV. The method provided in the third aspect, since RV0 contains the most system bits, can be scheduled so that the terminal transmits RV0 on the resource with the most symbols, thereby receiving as many system bits as possible and improving decoding performance.

[0019] In one possible implementation, before sending the first indication information to the terminal, the method further includes: determining that k values ​​of the first indication information all cause the first RV of the PUSCH to be sent on the first resource, where k is an integer greater than 1; determining the lengths of the resources occupied by the second RV as L1, L2, ..., Lk according to the k values, where the second RV is an RV with an index of 1 or 3; when the first indication information is the first value among the k values, the second RV is sent on the second resource, where the first value among the k values ​​is the value of the first indication information, wherein the second resource is a resource occupied by the second RV with a length of Lmax, where Lmax refers to the largest value among L1, L2, ..., Lk. In this possible implementation, since RV1 and RV3 contain more system bits than RV2, when there are multiple resources with the most symbols, while ensuring that RV0 is sent on the resource with the most symbols, it is also possible to encourage the terminal to send RV1 or RV3 on resources with a larger number of symbols, thereby enabling the network device to receive more system bits and improving decoding performance.

[0020] Fourthly, a data transmission method is provided, comprising: determining PUSCH resources according to a timeslot format and PUSCH parameters; determining N1 resources according to the PUSCH resources; the N1 resources being used to continuously transmit a first RV of PUSCH; and receiving bits in the first RV on the N1 resources. Wherein, the N1 resources are located on at least two timeslots, and N1 is an integer greater than 1.

[0021] In one possible implementation, the first RV of the PUSCH continuation transmission includes: if the last bit of the first RV is transmitted on a first resource, the first bit of the first RV is transmitted on a second resource, where the first resource is the n1th resource among the N1 resources, and the second resource is the (n1+1)th resource among the N1 resources, n1 = 1, 2, ..., N1-1.

[0022] In one possible implementation, transmitting the first bit of the first RV on the second resource includes: transmitting the first bit of the first RV on the second resource if the number of REs in the remaining resources of the first resource is less than or equal to a first threshold.

[0023] In one possible implementation, the first RV of the PUSCH continuation transmission includes: if the last bit of the first RV is transmitted on the first symbol in the first resource, the first bit of the first RV is transmitted on the second symbol in the first resource, the first resource is the n2th resource among the N1 resources, the second symbol is the next symbol after the first symbol, and n2 = 1, 2, ..., N1.

[0024] In one possible implementation, transmitting the first bit of the first RV on a second symbol in the first resource includes: transmitting the first bit of the first RV on the second symbol if the number of REs in the remaining resources on the first symbol is less than or equal to a second threshold.

[0025] In one possible implementation, the first RV of the PUSCH continuation transmission includes: if the last bit of the first RV is transmitted on the first symbol of the first resource, the first bit of the first RV is transmitted on the remaining resources of the first symbol of the first resource, where the first resource is the n3rd resource among the N1 resources, n3 = 1, 2, ..., N1.

[0026] In one possible implementation, the first RV for sequentially transmitting PUSCH further includes: if the last bit transmitted on the third resource is not the last bit of the first RV, the last bit transmitted on the third resource and the first bit transmitted on the fourth resource are two adjacent bits of the first RV, the third resource is the n4th resource among the N1 resources, and the fourth resource is the n4+1th resource among the N1 resources, where n4 = 1, 2, ..., N1-1.

[0027] In one possible implementation, if the number of symbols occupied by the PUSCH resource is greater than or equal to a third threshold, or if the number of repetitions indicated by the PUSCH parameter is greater than or equal to a fourth threshold, the N1 resources are used to continuously transmit the first RV of the PUSCH.

[0028] In one possible implementation, the third threshold is related to the number of symbols and the number of repetitions of the PUSCH, which are indicated by the PUSCH parameters.

[0029] In one possible implementation, if two time-domain consecutive resources among the N1 resources have the same frequency-domain resource, the DMRS in the PUSCH is not transmitted on the resource with the later time domain.

[0030] In one possible implementation, the method further includes: determining N2 resources based on the PUSCH resources, the N2 resources being used to continuously transmit the second RV of the PUSCH, the N2 resources being located on at least two time slots, and N2 being an integer greater than 1; and receiving bits from the second RV on the N2 resources.

[0031] Fifthly, a data transmission method is provided, comprising: determining a PUSCH resource and a first value according to a time slot format and PUSCH parameters, determining X RVs of the PUSCH according to the first value, and receiving at least one RV among the X RVs on the PUSCH resource, wherein X is an integer greater than 0.

[0032] In one possible implementation, X is the same as the first value; or, X is a value among a plurality of optional values ​​that is greater than the first value and closest to the first value, or a value less than the first value and closest to the first value, wherein the plurality of optional values ​​are pre-configured.

[0033] A sixth aspect provides a data transmission apparatus, comprising: a communication unit and a processing unit; the communication unit is configured to receive a timeslot format and PUSCH parameters from a network device; the processing unit is configured to determine PUSCH resources based on the timeslot format and PUSCH parameters; the processing unit is further configured to determine N1 resources based on the PUSCH resources, the N1 resources being used to transmit a first RV of the PUSCH, the N1 resources being located on at least two timeslots, and N1 being an integer greater than 1; the communication unit is further configured to continuously transmit bits in the first RV on the N1 resources.

[0034] In one possible implementation, the sequential transmission of bits in the first RV includes: if the last bit of the first RV is transmitted on the first resource, the first bit of the first RV is transmitted on the second resource, where the first resource is the n1th resource out of N1 resources, and the second resource is the (n1+1)th resource out of N1 resources, where n1 = 1, 2, ..., N1-1.

[0035] In one possible implementation, transmitting the first bit of the first RV on the second resource includes transmitting the first bit of the first RV on the second resource if the number of REs in the remaining resources in the first resource is less than or equal to a first threshold.

[0036] In one possible implementation, the sequential transmission of bits in the first RV includes: if the last bit of the first RV is transmitted on the first symbol in the first resource, the first bit of the first RV is transmitted on the second symbol in the first resource, where the first resource is the n2th resource out of N1 resources, and the second symbol is the next symbol after the first symbol, n2 = 1, 2, ..., N1.

[0037] In one possible implementation, transmitting the first bit of the first RV on the second symbol in the first resource includes transmitting the first bit of the first RV on the second symbol if the number of REs in the remaining resources on the first symbol is less than or equal to a second threshold.

[0038] In one possible implementation, the sequential transmission of bits in the first RV includes: if the last bit of the first RV is transmitted on the first symbol of the first resource, the first bit of the first RV is transmitted on the remaining resources of the first symbol of the first resource, where the first resource is the n3rd resource among N1 resources, n3 = 1, 2, ..., N1.

[0039] In one possible implementation, the subsequent transmission of bits in the first RV further includes: if the last bit transmitted on the third resource is not the last bit of the first RV, the last bit transmitted on the third resource and the first bit transmitted on the fourth resource are two adjacent bits of the first RV, the third resource is the n4th resource among N1 resources, and the fourth resource is the n4+1th resource among N1 resources, where n4 = 1, 2, ..., N1-1.

[0040] In one possible implementation, the communication unit is specifically configured to: transmit bits in the first RV consecutively on N1 resources if the number of symbols occupied by the PUSCH resource is greater than or equal to a third threshold, or if the number of repetitions indicated by the PUSCH parameter is greater than or equal to a fourth threshold.

[0041] In one possible implementation, the third threshold is related to the number of symbols and the number of repetitions of PUSCH, which are indicated by the PUSCH parameter.

[0042] In one possible implementation, if two resources that are consecutive in the time domain among N1 resources have the same frequency domain resources, the DMRS in the PUSCH is not sent on the resource that is later in the time domain among the two resources.

[0043] In one possible implementation, the processing unit is further configured to determine N2 resources based on the PUSCH resources, the N2 resources being used to transmit the second RV of the PUSCH, the N2 resources being located on at least two time slots, and N2 being an integer greater than 1; the communication unit is further configured to continuously transmit bits in the second RV on the N2 resources.

[0044] In a seventh aspect, a data transmission apparatus is provided, comprising: a communication unit and a processing unit; the communication unit is configured to receive a timeslot format and PUSCH parameters from a network device; the processing unit is configured to determine a PUSCH resource and a first value based on the timeslot format and PUSCH parameters; the processing unit is further configured to determine X RVs of the PUSCH based on the first value, where X is an integer greater than 0; the communication unit is further configured to transmit at least one RV among the X RVs on the PUSCH resource.

[0045] In one possible implementation, X is the same as the first value; or, X is a value among a plurality of optional values ​​that is greater than the first value and closest to the first value, or a value less than the first value and closest to the first value, wherein the plurality of optional values ​​are pre-configured.

[0046] Eighthly, a data transmission apparatus is provided, comprising: a communication unit and a processing unit; the processing unit is configured to determine PUSCH resources according to PUSCH parameters and a time slot format, the PUSCH resources comprising M resources, one of the M resources being used to carry a RV of the PUSCH; the communication unit is configured to send first indication information to a terminal, causing the first RV of the PUSCH to be transmitted on a first resource, the first RV being the RV with index 0; wherein the first indication information indicates the RV of the PUSCH transmitted by the first resource among the M resources, the first resource being the resource with the most symbols among the M resources, or the first resource being the resource with the most symbols among the resources among the M resources used to transmit the same RV.

[0047] In one possible implementation, the processing unit is further configured to: determine that all k values ​​of the first indication information cause the first RV of the PUSCH to be sent on the first resource, where k is an integer greater than 1; determine that the lengths of the resources occupied by the second RV are L1, L2, ..., Lk according to the k values, where the second RV is an RV with an index of 1 or 3; when the first indication information is the first value among the k values, the second RV is sent on the second resource, where the first value among the k values ​​is the value of the first indication information, wherein the second resource is a resource occupied by the second RV with a length of Lmax, where Lmax refers to the largest value among L1, L2, ..., Lk.

[0048] A ninth aspect provides a data transmission apparatus, comprising: a communication unit and a processing unit; the processing unit is configured to determine PUSCH resources according to a time slot format and PUSCH parameters; the processing unit is further configured to determine N1 resources according to the PUSCH resources, the N1 resources being used for a first RV of PUSCH continuation transmission, the N1 resources being located on at least two time slots, and N1 being an integer greater than 1; the communication unit is configured to receive bits in the first RV on the N1 resources.

[0049] In one possible implementation, the first RV of the PUSCH continuation transmission includes: if the last bit of the first RV is transmitted on a first resource, the first bit of the first RV is transmitted on a second resource, where the first resource is the n1th resource among the N1 resources, and the second resource is the (n1+1)th resource among the N1 resources, n1 = 1, 2, ..., N1-1.

[0050] In one possible implementation, transmitting the first bit of the first RV on the second resource includes: transmitting the first bit of the first RV on the second resource if the number of REs in the remaining resources of the first resource is less than or equal to a first threshold.

[0051] In one possible implementation, the first RV of the PUSCH continuation transmission includes: if the last bit of the first RV is transmitted on the first symbol in the first resource, the first bit of the first RV is transmitted on the second symbol in the first resource, the first resource is the n2th resource among the N1 resources, the second symbol is the next symbol after the first symbol, and n2 = 1, 2, ..., N1.

[0052] In one possible implementation, transmitting the first bit of the first RV on a second symbol in the first resource includes: transmitting the first bit of the first RV on the second symbol if the number of REs in the remaining resources on the first symbol is less than or equal to a second threshold.

[0053] In one possible implementation, the first RV of the PUSCH continuation transmission includes: if the last bit of the first RV is transmitted on the first symbol of the first resource, the first bit of the first RV is transmitted on the remaining resources of the first symbol of the first resource, where the first resource is the n3rd resource among the N1 resources, n3 = 1, 2, ..., N1.

[0054] In one possible implementation, the first RV for sequentially transmitting PUSCH further includes: if the last bit transmitted on the third resource is not the last bit of the first RV, the last bit transmitted on the third resource and the first bit transmitted on the fourth resource are two adjacent bits of the first RV, the third resource is the n4th resource among the N1 resources, and the fourth resource is the n4+1th resource among the N1 resources, where n4 = 1, 2, ..., N1-1.

[0055] In one possible implementation, if the number of symbols occupied by the PUSCH resource is greater than or equal to a third threshold, or if the number of repetitions indicated by the PUSCH parameter is greater than or equal to a fourth threshold, the N1 resources are used to continuously transmit the first RV of the PUSCH.

[0056] In one possible implementation, the third threshold is related to the number of symbols and the number of repetitions of the PUSCH, which are indicated by the PUSCH parameters.

[0057] In one possible implementation, if two time-domain consecutive resources among the N1 resources have the same frequency-domain resource, the DMRS in the PUSCH is not transmitted on the resource with the later time domain.

[0058] In one possible implementation, the processing unit is further configured to determine N2 resources based on the PUSCH resources, the N2 resources being used to continuously transmit the second RV of the PUSCH, the N2 resources being located on at least two time slots, and N2 being an integer greater than 1; the communication unit is further configured to receive bits in the second RV on the N2 resources.

[0059] In a tenth aspect, a data transmission apparatus is provided, comprising: a communication unit and a processing unit; the processing unit is configured to determine a PUSCH resource and a first value according to a time slot format and PUSCH parameters; the processing unit is further configured to determine X RVs of the PUSCH according to the first value, where X is an integer greater than 0; the communication unit is configured to receive at least one RV among the X RVs on the PUSCH resource.

[0060] In one possible implementation, X is the same as the first value; or, X is a value among a plurality of optional values ​​that is greater than the first value and closest to the first value, or a value less than the first value and closest to the first value, wherein the plurality of optional values ​​are pre-configured.

[0061] Eleventhly, a data transmission apparatus is provided, comprising: a processor. The processor is connected to a memory for storing computer execution instructions, and the processor executes the computer execution instructions stored in the memory to implement any one of the methods provided in the first to fifth aspects. Exemplarily, the memory and processor can be integrated together or are separate devices. If the latter, the memory can be located within or outside the data transmission apparatus. When executing any one of the methods provided in the first to third aspects, the data transmission apparatus can exemplary be a terminal or a chip located inside or outside the terminal. When executing any one of the methods provided in the fourth or fifth aspect, the data transmission apparatus can exemplary be a network device or a chip located inside or outside the network device.

[0062] In one possible implementation, the processor includes logic circuitry, as well as input and / or output interfaces. For example, the output interface is used to perform the sending action in the corresponding method, and the input interface is used to perform the receiving action in the corresponding method.

[0063] In one possible implementation, the data transmission device further includes a communication interface and a communication bus, with the processor, memory, and communication interface connected via the communication bus. The communication interface is used to perform the sending and receiving actions in the corresponding method. The communication interface can also be called a transceiver. Optionally, the communication interface includes at least one of a transmitter and a receiver; in this case, the transmitter is used to perform the sending action in the corresponding method, and the receiver is used to perform the receiving action in the corresponding method.

[0064] In one possible implementation, the data transmission device exists in the form of a chip.

[0065] In a twelfth aspect, a chip is provided, comprising: a processor and an interface, wherein the processor is coupled to a memory via the interface, and when the processor executes a computer-executable program or computer-executable instruction in the memory, any one of the methods provided in any one of the first to fifth aspects is executed.

[0066] In a thirteenth aspect, a communication system is provided, comprising: a data transmission device for performing any one of the methods provided in the first to third aspects, and a data transmission device for performing any one of the methods provided in the fourth or fifth aspect.

[0067] In a fourteenth aspect, a computer-readable storage medium is provided, including computer-executable instructions that, when executed on a computer, cause the computer to perform any one of the methods provided in any one of the first to fifth aspects.

[0068] In a fifteenth aspect, a computer program product comprising computer execution instructions is provided, which, when executed on a computer, cause the computer to perform any one of the methods provided in any one of the first to fifth aspects.

[0069] The technical effects of any of the implementation methods in aspects four through fifteen can be found in the technical effects of the corresponding implementation methods in aspects one through three, and will not be repeated here.

[0070] It should be noted that, provided the solutions do not contradict each other, the solutions in the above aspects can be combined. Attached Figure Description

[0071] Figure 1 This is a schematic diagram of an RV that is actually repeatedly transmitted.

[0072] Figure 2 This is a schematic diagram illustrating actual and nominal repetition.

[0073] Figure 3 This is a schematic diagram of a frequency domain resource;

[0074] Figure 4 This is a schematic diagram of yet another type of frequency domain resource;

[0075] Figure 5 This is a schematic diagram of a communication scenario to which this application applies;

[0076] Figure 6 An interactive flowchart of a data transmission method provided in an embodiment of this application;

[0077] Figure 7 A schematic diagram of a resource and an RV transmitted on the resource, provided as an embodiment of this application;

[0078] Figure 8 A schematic diagram of another resource and an RV transmitted on the resource, provided as an embodiment of this application;

[0079] Figure 9 A schematic diagram illustrating a continuous transmission RV provided in an embodiment of this application;

[0080] Figure 10 A schematic diagram illustrating yet another method of sequential RV transmission provided in this application embodiment;

[0081] Figure 11 A schematic diagram illustrating yet another method of sequential RV transmission provided in this application embodiment;

[0082] Figure 12 A schematic diagram illustrating yet another method of sequential RV transmission provided in this application embodiment;

[0083] Figure 13 An interactive flowchart illustrating another data transmission method provided in an embodiment of this application;

[0084] Figure 14 A schematic diagram of another resource and an RV transmitted on the resource, provided as an embodiment of this application;

[0085] Figure 15 An interactive flowchart illustrating another data transmission method provided in an embodiment of this application;

[0086] Figure 16 A schematic diagram of another resource and an RV transmitted on the resource, provided as an embodiment of this application;

[0087] Figure 17 A schematic diagram of another resource and an RV transmitted on the resource, provided as an embodiment of this application;

[0088] Figure 18 This is a schematic diagram illustrating the composition of a data transmission device provided in an embodiment of this application;

[0089] Figure 19 This is a schematic diagram of the hardware structure of a data transmission device provided in an embodiment of this application;

[0090] Figure 20 This is a schematic diagram of the hardware structure of another data transmission device provided in an embodiment of this application. Detailed Implementation

[0091] In the description of this application, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. In the description of this application, unless otherwise stated, "at least one" means one or more, and "more than" means two or more.

[0092] Furthermore, to facilitate a clear description of the technical solutions in the embodiments of this application, the terms "first" and "second" are used in the embodiments of this application to distinguish identical or similar items with substantially the same function and effect. Those skilled in the art will understand that the terms "first" and "second" do not limit the quantity or execution order, and the terms "first" and "second" are not necessarily different.

[0093] It should be noted that, in this application, the terms "exemplary" or "for example" are used to indicate that something is being described as an example, illustration, or illustration. Any embodiment or design described as "exemplary" or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or design solutions. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0094] To facilitate understanding of this application, some concepts and contents involved in the embodiments of this application will be briefly introduced first.

[0095] 1. Time slot

[0096] In new radio (NR), for a normal cyclic prefix (CP), one time slot contains 14 orthogonal frequency division multiplexing (OFDM) symbols (hereinafter simply referred to as symbols). For extended CP, one time slot contains 12 symbols. For ease of description, this application uses 14 symbols per time slot as an example, but it is not limited to 14 symbols per time slot.

[0097] In a time slot, 14 symbols are numbered sequentially in ascending order, with the smallest number being 0 and the largest being 13. In this embodiment, the symbol with index (i.e., number) i is denoted as symbol i, and a time slot contains symbols 0 to 13. Furthermore, in this application, the time slot with index (i.e., number) f is denoted as time slot f. f is an integer greater than or equal to 0, and i is an integer greater than or equal to 0 and less than or equal to 13. This application describes the example where both time slots and symbols are numbered starting from 0. In actual implementation, the numbering of time slots and / or symbols can also start from 1 or other numbers; this application does not impose any restrictions.

[0098] A time slot can consist of one or more types of symbols. Symbol types include: symbols used for downlink transmission (denoted as downlink symbols), symbols used for flexible transmission (denoted as flexible symbols), symbols used for uplink transmission (denoted as uplink symbols), guard interval symbols, etc. The structure of a time slot can be called a slot format (SF).

[0099] 2. Resource element (RE)

[0100] RE is the smallest unit of physical resources. It occupies 1 symbol in the time domain and 1 subcarrier in the frequency domain.

[0101] 3. Demodulation reference signal (DMRS)

[0102] DMRS is used to demodulate PUSCH. DMRS is carried on a portion of the symbols in PUSCH. PUSCH consists of DMRS and data.

[0103] 4. PUSCH mapping type

[0104] PUSCH includes two mapping types: Type A and Type B. A mapping type can be understood as a resource allocation type. In NR communication standards, both Type A and Type B indicate the start symbol (identified as S), the symbol length (identified as L), and the possible range of values ​​for S+L. For example, Table 6.1.2.1-1 (referred to as Table 1 in this application) in section 6.1.2.1 of the 3rd Generation Partnership Project (3GPP) Technical Specification (TS) 38.214 shows valid S and L combinations under Type A and Type B.

[0105] Table 1: Valid combinations of S and L

[0106]

[0107] Specifically, the parameters in the Type A row only apply to repetitions of Type A. The "{1,…,14}" and "{1,…,12}" in the S+L column of the Type B row apply to repetitions of Type A, while the "{1,…,27}" and "{1,…,23}" in the S+L column of the Type B row apply to repetitions of Type B.

[0108] 5. Time-domain resource allocation for PUSCH

[0109] Currently, network devices can configure the time-domain resource allocation table for PUSCH for terminals via higher-layer signaling (e.g., radio resource control (RRC) signaling). The time-domain resource allocation table includes multiple rows, with each row representing a combination of time-domain resource allocation parameters, and each row corresponding to a row index. Each row includes the following parameter configurations: PUSCH mapping type, K2, and start and length indicator value (SLIV).

[0110] The PUSCH mapping type is either Type A or Type B. K2 is used to configure the offset between the time slot where the PUSCH is located and the time slot where the downlink control information (DCI) that schedules the PUSCH is located. For example, if the time slot where the DCI of the scheduled PUSCH is located is time slot n-K2, then the time slot for PUSCH transmission is time slot n. SLIV is used to configure the start symbol S and symbol length L of the PUSCH, where S and L satisfy the constraints in Table 1 above.

[0111] Specifically, PUSCH needs to be scheduled via the physical downlink control channel (PDCCH). DCI Format 0-0 and DCI Format 0-1 are used for PUSCH scheduling. The Time Domain Resource Assignment (TWA) field in the DCI corresponds to a row in the Time Domain Resource Allocation table. The time domain resources of PUSCH are determined by two parameters: K2 determines the PUSCH transmission time slot, and S and L determine the symbol position occupied by the PUSCH within that time slot.

[0112] For example, the default time-domain resource allocation table can be Table 2. Here, j is determined by μ. PUSCH Confirmed, μ PUSCH The values ​​of μ can be found in Table 3. PUSCH It is related to the subcarrier spacing, which is 15*2. μ kHz (kilohertz). j and μ PUSCH The correspondence can be found in Table 3.

[0113] Table 2

[0114] row index PUSCH mapping type <![CDATA[K2]]> S L 1 Type A j 0 14 2 Type A j 0 12 3 Type A j 0 10 4 Type B j 2 10 5 Type B j 4 10 6 Type B j 4 8 7 Type B j 4 6 8 Type A j+1 0 14 9 Type A j+1 0 12 10 Type A j+1 0 10 11 Type A j+2 0 14 12 Type A j+2 0 12 13 Type A j+2 0 10 14 Type B j 8 6 15 Type A j+3 0 14 16 Type A j+3 0 10

[0115] Table 3

[0116] <![CDATA[μ PUSCH ]]> j 0 1 1 1 2 2 3 3

[0117] If S = 10 and L = 14, then see [reference needed]. Figure 2 The PUSCH transmission begins at the 11th symbol (starting symbol 10) in the first time slot carrying the PUSCH (let's say time slot n) and lasts for 14 symbols. Since a time slot contains 14 symbols, the 14 consecutive symbols include the last 4 symbols in time slot n and the first 10 symbols in time slot n+1. In this case spanning two time slots, the transmission from the 11th symbol in time slot n to the 10th symbol in the next time slot is considered a nominal repetition, the transmission from the 11th symbol in time slot n to the 14th symbol in time slot n is considered an actual repetition (i.e., actual repetition 0), and the transmission from the 1st symbol in time slot n+1 to the 10th symbol in time slot n+1 is considered another actual repetition (i.e., actual repetition 1).

[0118] 6. Frequency domain resource allocation for PUSCH

[0119] PUSCH frequency domain resources are indicated through the frequency domain resource indication field of PDCCH. There are two methods for indicating frequency domain resources.

[0120] The first indication method is type 0. The frequency domain granularity of this method is resource block groups (RBGs). For example, with a bandwidth of 10 resource blocks (RBs) and an RBG size (i.e., the number of RBs contained in the RBG) of 2, ... Figure 3 As shown, the 10 RBs can be divided into 5 groups, resulting in 5 RBGs. The frequency domain resources occupied by the PUSCH are indicated in the form of a bitmap. Taking the indication information in the PDCCH as 10001 as an example, the PUSCH occupies RBG0 and RBG4.

[0121] The second indication method is type 1, in which the starting position of the RB in the frequency domain is indicated in the PDCCH (denoted as RB). start ) and L', where L' represents the length of the RB occupied. For example, with a bandwidth of 10 RBs, see [link to example]. Figure 4 If RB start =2, L'=3. Then the frequency domain resources occupied by PUSCH are RB2, RB3 and RB4.

[0122] 7. RV

[0123] The data in a transport block (TB) after turbocoding consists of three segments. The first segment can be considered as system bits (i.e., information bits), and the other two segments are redundant data. These three segments are placed sequentially in a circular buffer. The RV (Reference Container Registry) indicates the starting position for data retrieval within this circular buffer. Currently, RVs are indexed as 0, 2, 3, and 1, which can be denoted as RV0, RV2, RV3, and RV1, respectively. Each of RV0, RV2, RV3, and RV1 corresponds to a starting position for data retrieval within the circular buffer. RV0 contains the most system bits, followed by RV1 and RV3, with RV2 containing the fewest.

[0124] The size of the TB (TB size, TBS), which is the number of bits contained in the TB, can be determined based on the number of REs used to transmit the PUSCH. The number of REs used for PUSCH transmission can be determined based on information such as the number of symbols nominally repeated, the number of RBs configured in the network device for PUSCH transmission, and the number of resources in the DMRS. For example, if the number of REs used for PUSCH transmission is 396 and the TBS is 120 bits, and if the channel-coded data of the TB contains 360 bits, then the 396 REs are used to transmit these 360 ​​bits. If the number of REs used for PUSCH transmission is greater than the number of bits in the encoded data, the remaining resources may not carry any bits.

[0125] The transmission of PUSCH described in this application embodiment can be understood as transmission of data carried on PUSCH. The data carried on PUSCH refers to the data obtained after channel coding of TB.

[0126] 8. Repeated transmission of PUSCH

[0127] Repeated transmission of a PUSCH refers to transmitting multiple PUSCHs, each representing multiple identical uplink data. Transmitting a single PUSCH (i.e., one piece of uplink data) can be considered a single repeated transmission of the PUSCH. Multiple identical uplink data refers to multiple identical or different RVs obtained after channel coding of the same set of system bits.

[0128] For Type B, the communication standard introduces the parameter "numberOfRepetitions-r16" to configure the number of repetitions. numberOfRepetitions-r16 has eight configurable values, indicated by 3 bits. These 3 bits correspond to {n1, n2, n3, n4, n7, n8, n12, n16}, where the value after n indicates the number of repetitions. For example, n1 indicates one transmission, and n16 indicates 16 transmissions. Network devices can configure one of these eight configurable values ​​for the terminal via higher-layer signaling, such as RRC signaling, thereby indicating the number of repetitions to the terminal. For Type B, starting from the start symbol S in the initial time slot of the repetitive PUSCH transmission, L*numberOfRepetitions-r16 available symbols are all used for the repetitive transmission of the PUSCH. In this application, "*" means "multiplied".

[0129] For Type A, S+L is less than or equal to 14. When the terminal is configured with a repetition count (let's say R1), the terminal will check in each of the R1 time slots (R1 consecutive time slots starting from the start time slot). If all L symbols starting from the start symbol S in a certain time slot are available symbols, then PUSCH will be sent in that time slot; otherwise, PUSCH will not be sent in that time slot, and the terminal will continue to check if other time slots meet the conditions.

[0130] The available symbols in this application are not downlink symbols, flexible downlink-to-uplink symbols, or symbols occupied by other transmissions.

[0131] 9. RV of repeatedly sent PUSCH

[0132] To enable the receiver to improve decoding capabilities using incremental redundancy (IR) merging reception, network devices are configured to use different RVs for multiple PUSCH transmissions. The RV used for each PUSCH transmission is determined by the actual repetition index p corresponding to that transmission and the RV indicated by the RV indicator field in the DCI used to schedule the PUSCH. id It was jointly determined that rv id This refers to the index of the RV. For example, 3GPP TS 38.214 specifies that the RV corresponding to the actual repeat of the PUSCH with index p is determined by Table 4. In Table 4, "mod" means "modulo".

[0133] Table 4

[0134]

[0135] The above is a brief introduction to some of the concepts and contents involved in the embodiments of this application.

[0136] The technical solutions of this application can be applied to fourth-generation (4G) systems, various systems evolved from 4G systems, fifth-generation (5G) systems, various systems evolved from 5G systems, or future evolution systems or multiple communication convergence systems. The 4G system can also be called an evolved packet system (EPS). The core network (CN) of the 4G system can be called an evolved packet core (EPC), and the access network can be called Long Term Evolution (LTE). The core network of the 5G system can be called 5GC (5G core), and the access network can be called NR. The 5G system can be a non-standalone (NSA) 5G system or a standalone (SA) 5G system.

[0137] The network elements involved in this application include network devices and terminals in communication systems. See also... Figure 5 The method provided in this application mainly relates to communication between network devices and terminals. Network devices and terminals can communicate via an air interface (Uu interface, i.e., UTRAN-to-UE interface).

[0138] The network device in this embodiment is an entity on the network side used to transmit signals, or receive signals, or both transmit and receive signals. The network device can be a device deployed in a radio access network (RAN) to provide wireless communication functions for terminals, such as a transmission reception point (TRP), a base station, or various forms of control nodes (e.g., network controllers, wireless controllers (e.g., wireless controllers in cloud radio access network (CRAN) scenarios)). Specifically, the network device can be various forms of macro base stations, micro base stations (also called small stations), relay stations, access points (APs), etc., or it can be the antenna panel of a base station. The control node can connect to multiple base stations and configure resources for multiple terminals covered by the multiple base stations. In systems employing different wireless access technologies, the names of devices with base station functions may differ. For example, in Universal Mobile Telecommunications System (UMTS) or LTE systems, it can be an evolved NodeB (eNB or eNodeB); in heterogeneous network (HetNet) scenarios, it can be a micro base station (eNB); in distributed base station scenarios, it can be a baseband unit (BBU) and a remote radio unit (RRU); in CRAN scenarios, it can be a BBU pool and an RRU; and in 5G or NR systems, it can be a next-generation node base station (gNB). This application does not limit the specific name of the base station. The network equipment can also be network equipment in a future evolved public land mobile network (PLMN), etc.

[0139] In this application's embodiments, the terminal is a user-side entity used to receive signals, or transmit signals, or both. The terminal is used to provide users with one or more of voice services and data connectivity services. The terminal may also be referred to as user equipment (UE), terminal equipment, access terminal, user unit, user station, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication equipment, user agent, or user device. Terminals can be mobile stations (MS), subscriber units, drones, Internet of Things (IoT) devices, stations (ST) in wireless local area networks (WLANs), cellular phones, user handheld communication devices (e.g., smartphones, mobile phones, tablets), cordless phones, wireless data cards, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistant (PDA) devices, laptop computers, machine-type communication (MTC) terminals, handheld devices with wireless communication capabilities, computing devices or other processing devices connected to a wireless modem, in-vehicle devices (e.g., in-vehicle communication modules or other embedded communication modules), and wearable devices (also known as wearable smart devices). Terminals can also be terminals in future evolutionary PLMNs, etc.

[0140] In the above Figure 5The architecture shown includes downlink transmission from network device to terminal and uplink transmission from terminal to network device. Due to the relatively high cost of network devices, the coverage of downlink transmission is generally higher than that of uplink transmission. Because of cost constraints on the terminal side, only cheaper power amplifiers can be used, and their power limits are relatively lower than those on the network device side. Therefore, coverage enhancement research mainly focuses on how to improve the coverage of uplink transmission. Uplink transmission generally includes the physical uplink control channel (PUCCH) and the PUSCH. The PUCCH is a control channel, transmitting a small amount of information and not requiring a high signal-to-noise ratio (SNR). Even if the terminal is far from the network device, the SNR requirement can be met, thus its coverage is relatively wide. The PUSCH is a data channel, transmitting a large amount of information and requiring a higher SNR. The SNR requirement can only be met when the terminal is close to the network device, thus its coverage is relatively small. Therefore, improving the coverage of the PUSCH is a more pressing issue.

[0141] One way to improve PUSCH coverage is to repeatedly send PUSCH. The more times it's repeated, the more symbols can be included in the PUSCH. In this case, the SNR can be appropriately reduced, thereby improving PUSCH coverage. As mentioned above, Type A can only send PUSCH at fixed positions within a time slot. If the symbol at that position is unavailable, the transmission is abandoned. Type B, on the other hand, can utilize all available symbols to send PUSCH as much as possible. Therefore, Type B can utilize resources to a greater extent than Type A.

[0142] Although Type B can utilize all available symbols as much as possible, symbols located in different time slots within a nominal repeat are divided into different actual repeats, resulting in very fragmented resources corresponding to the actual repeats. Since only one RV of PUSCH is sent on each actual repeat, the RV of PUSCH cannot be sent completely, which in turn affects the decoding performance of network devices and reduces the reliability of data transmission.

[0143] For example, see Figure 1A PUSCH transmission with 4 nominal repetitions is scheduled. The first nominal repetition spans 2 time slots and is therefore divided into actual repetition 0 and actual repetition 1. The second nominal repetition spans 2 time slots and is therefore divided into actual repetition 2 and actual repetition 3. The third nominal repetition spans 3 time slots and is therefore divided into actual repetition 4, actual repetition 5, and actual repetition 6. The fourth nominal repetition spans 2 time slots and is therefore divided into actual repetition 7 and actual repetition 8. According to Table 4 above, the 9 actual repetitions cyclically carry different RVs according to the actual repetition index. Based on the DCI instruction, the version carried is determined by taking the actual repetition index modulo 4. For example, the RV carried by the DCI... id As shown in Table 4, the RV carried by actual repetition 0, actual repetition 4 and actual repetition 8 is RV0, the RV carried by actual repetition 1 and actual repetition 5 is RV2, the RV carried by actual repetition 2 and actual repetition 6 is RV3, and the RV carried by actual repetition 3 and actual repetition 7 is RV1.

[0144] Since the TBS is determined based on the symbol length of the nominal repetition, and each actual repetition carries one RV, each RV carried on an actual repetition only carries the first part of the information in that RV; the second part of the information in that RV is not sent. For example, for actual repetition 0, the first part of the information of RV0 is sent on actual repetition 0, and the second part is not sent. For actual repetition 1, the first part of the information of RV2 is sent on actual repetition 1, and the second part is not sent. For actual repetition 2, the first part of the information of RV3 is sent on actual repetition 2, and the second part is not sent. For actual repetition 3, the first part of the information of RV1 is sent on actual repetition 3, and the second part is not sent. Among these, since RV0 contains the most system bits, the incomplete transmission of RV0 will cause a loss of decoding performance.

[0145] To improve the decoding performance of network devices and the reliability of data transmission, this application provides a data transmission method, which can be implemented by the methods shown in Embodiment 1, Embodiment 2, or Embodiment 3. In Embodiment 1, the terminal transmits PUSCH RVs consecutively on different resources, thereby transmitting as many complete RVs as possible and improving transmission performance. In Embodiment 2, the terminal transmits more RVs on different resources, thereby transmitting as many complete system bits as possible and improving transmission performance. In Embodiment 3, the terminal transmits RV0 on the resource with the most symbols, thereby transmitting as many complete system bits as possible and improving transmission performance. The methods provided in Embodiments 1 to 3 are described below.

[0146] Example 1

[0147] See Figure 6 The method provided in Example 1 includes:

[0148] 601. The network device sends the timeslot format and PUSCH parameters to the terminal. Correspondingly, the terminal receives the timeslot format and PUSCH parameters from the network device.

[0149] In various embodiments of this application, the actions performed by the network device can also be performed by a chip located outside or inside the network device, and the actions performed by the terminal can also be performed by a chip located outside or inside the terminal. For ease of description, this application uses network devices and terminals as examples to illustrate the methods provided in this application.

[0150] The time slot format indicates the type of each symbol within the time slot. Network devices can configure the time slot format for terminals semi-statically or dynamically; the specific configuration process is well-known to those skilled in the art and will not be elaborated further. PUSCH parameters determine PUSCH resources. PUSCH resources include PUSCH time-domain resources and PUSCH frequency-domain resources. PUSCH parameters include time-domain parameters and frequency-domain parameters. Time-domain parameters determine PUSCH time-domain resources, and frequency-domain parameters determine PUSCH frequency-domain resources. Time-domain parameters may include one or more of the following: an index corresponding to the start symbol S, the number of symbols L, and K2 (e.g., a row index in Table 2), and the number of repetitions. Frequency-domain parameters include parameters indicating PUSCH frequency-domain resources (e.g., bitmap, RB). start For details regarding PUSCH frequency domain resource allocation (and L'), please refer to the section above on PUSCH frequency domain resource allocation. PUSCH parameters can also be called PUSCH scheduling parameters.

[0151] 602. The terminal determines the PUSCH resources based on the timeslot format and PUSCH parameters.

[0152] In specific implementation, step 602 allows the terminal to determine the starting time slot for repeatedly sending PUSCH as time slot n based on the time domain parameter K2 and the time slot where the DCI for scheduling PUSCH is located (assuming it is time slot n-K2).

[0153] After determining the starting timeslot, the terminal can determine the PUSCH time domain resources through either method 11 or method 12.

[0154] Method 11: Based on the time slot format and the start symbol S, number of symbols L, and repetition count indicated by the time domain parameters, determine the available symbols for the PUSCH time domain, starting from the start symbol S in the initial time slot and multiplied by L. For example, if S = 8, L = 14, and repetition count = 4, the time slot format for each time slot is as follows: Figure 7 (a) and Figure 7 As shown in (b), the 56 symbols (i.e., 14*4) starting from symbol 8 in time slot n are the PUSCH time-domain resources. Therefore, the PUSCH time-domain resources determined by the terminal include... Figure 7 (a) and Figure 7 The temporal resources corresponding to resources 0 to 8 shown in (b) are shown.

[0155] Method 12: Determine the time-domain resources consisting of available symbols from the R time slots based on the number of repetitions (assuming R). The R time slots can have the following configurations:

[0156] 1) R time slots are R consecutive time slots starting from the initial time slot.

[0157] 2) R time slots are R time slots starting from the initial time slot, excluding downlink time slots.

[0158] 3) The R time slots are the R time slots starting from the initial time slot, excluding downlink time slots and special time slots.

[0159] 4) The R time slots are the R uplink time slots starting from the initial time slot.

[0160] 5) The R time slots are the R time slots that satisfy the second condition, starting from the initial time slot. The second condition is that the L symbols in the initial time slot, starting from the initial symbol S, are all available symbols, and the symbols in each time slot after the initial time slot in the R time slots are all available symbols. S and L are configured by the PUSCH parameters.

[0161] For example, assuming R = 6, and the R time slots are N time slots excluding downlink time slots starting from the initial time slot, then see [link to relevant documentation]. Figure 8 (a) and Figure 8 In (b), since time slots n to n+5 do not contain downlink time slots, the available symbols in R time slots (i.e., time slots n to n+5) constitute the PUSCH time domain resources. That is, the PUSCH time domain resources include... Figure 8 (a) and Figure 8 The temporal resources corresponding to resources 0 to 5 are shown in (b) above. Figure 7 (a) and Figure 7 (b) in the middle, and Figure 8 (a) and Figure 8 For details on determining the resources corresponding to the RVs other than the first RV in (b) and the RVs sent on each resource, please refer to the relevant descriptions below.

[0162] The process by which the terminal determines the PUSCH frequency domain resources based on the frequency domain parameters can be found in the section on PUSCH frequency domain resource allocation above, and will not be repeated here.

[0163] PUSCH resources consist of multiple resources, each corresponding to an index. Resources with larger indices are located later in the time domain. In one scenario, a resource may be identical to a resource that actually duplicates another resource; in this case, the resource's index can also be considered the index of the actual duplicate. For example... Figure 7 (a) and Figure 7 Resources 0 through 8 are shown in (b) above. In another case, a resource is the resource corresponding to an available symbol in a time slot, for example, Figure 8 (a) and Figure 8 Resources 0 to 5 are shown in (b) in the table.

[0164] It should be noted that, unless otherwise specified, all resources in this application refer to time-frequency resources.

[0165] 603. The terminal determines N1 resources based on the PUSCH resources. The N1 resources are used to send the first RV of the PUSCH. The N1 resources are located on at least two time slots, and N1 is an integer greater than 1.

[0166] The first RV can be any one of RV0, RV2, RV3, and RV1. The N1 resources can be contiguous in the time domain or discontinuous in the time domain. The terminal can determine the N1 resources through method 21 or method 22.

[0167] Method 21: The multiple resources used for sending the first RV of PUSCH are determined as N1 resources. Specifically, the terminal can determine the location of each resource based on the timeslot format and PUSCH parameters, according to the RV indicated by the DCI. id Determine the RV to be sent on each resource, and then determine N1 resources from the multiple resources used to send the first RV of PUSCH. For example, if the RV indicated by DCI... id RV0 is the first RV, based on RV0. Figure 7 In the example shown in (a), the resources used to send RV0 include resource 0, resource 4, and resource 8, then N1 resources include resource 0, resource 4, and resource 8. For another example, if the DCI indicates RV... id RV0 is the first RV, based on RV0. Figure 8 In the example shown in (a), the resources used to send RV0 include resource 0 and resource 4, then N1 resources include resource 0 and resource 4.

[0168] Method 22: Connect consecutive indices that satisfy... T resources with the same value are identified as N1 resources, and the RV corresponding to these N1 resources is the first RV. Here, p refers to the resource index, and the value of T can be pre-configured, protocol-specified, or determined through negotiation between the network device and the terminal. For example, if the RV indicated by DCI... id Let RV0 be the first RV, T=3, and the first RV be RV0, based on... Figure 7 In the example shown in (b), the N1 resources are resource 0, resource 1, and resource 2. For example, if the DCI indicates rv... id Let RV0 be RV0, T=2, and the first RV be RV0, based on Figure 8 In the example shown in (b), N1 resources are resource 0 and resource 1.

[0169] 604. Network devices determine PUSCH resources based on the timeslot format and PUSCH parameters.

[0170] The specific implementation of step 604 can be found in step 602 above, except that the terminal is replaced with a network device.

[0171] 605. The network device determines the above N1 resources based on the PUSCH resources.

[0172] The specific implementation of step 605 can be found in step 603 above, except that the terminal is replaced with a network device.

[0173] It should be noted that steps 604 and 605 can be performed after steps 602 and 603 or before steps 602 and 603, and this application does not impose any restrictions.

[0174] 606. The terminal sequentially transmits bits from the first RV on N1 resources. Correspondingly, the network device receives bits from the first RV on N1 resources. The sequential transmission of bits from the first RV can also be described as sequential transmission of the first RV.

[0175] Step 606 can be understood as the terminal merging the N1 resources and sending the bits in the first RV, or in other words, the terminal treating the N1 resources as a whole and sending the bits in the first RV.

[0176] Continuing to send the first RV means sending the complete first RV from the next resource. Specifically, it means starting from the first resource out of N1 resources, sending the bits in the first RV sequentially. If not all bits in the first RV are sent on the first resource, then the remaining bits in the first RV are sent on the second resource, continuing from the last bit sent on the first resource, and so on, until all bits in the first RV are sent. When all bits in the first RV are sent on a resource, and there are no remaining REs on that resource, and there are still unused resources among the N1 resources, the first RV is sent again from the next resource in the same manner as the first first RV. When all bits in the first RV are sent on a resource, and there are still remaining REs on that resource, the first RV can be sent again from the remaining REs in the same manner as the first first RV, or the number of remaining REs on that resource can be used to determine which resources to start sending the next first RV.

[0177] When the last bit of the first RV is sent on a resource, there are three ways to send the first bit of the first RV and continue sending the bits in the first RV.

[0178] Method 1: If the last bit of the first RV is sent on the first resource and the first bit of the first RV is sent on the second resource, the first resource is the n1th resource among N1 resources and the second resource is the (n1+1)th resource among N1 resources, where n1 = 1, 2, ..., N1-1.

[0179] For example, see Figure 9 Assume there are N1 resources. Figure 7 In (a), resources 0, 4, and 8 are shown. The frequency domain resources of N1 resources are all subcarriers 0 to 3, and the first RV is RV0. Figure 9 A square box in the diagram represents a RE, a 'D' in the square box indicates that the DMRS in the PUSCH is transmitted on that RE, and a number (let's say x) in the square box indicates that the x-th bit in the first RV is transmitted on that RE. (The rest of the text is omitted as it is not part of the diagram.) Figures 10 to 12 Similarly, suppose the first RV contains 30 bits. The first resource (resource 0) out of N1 resources can carry the first 20 bits of the first RV. The second resource (resource 4) out of N1 resources starts transmitting bits from the 21st bit of the first RV. When the 30th bit is transmitted, the first RV transmission is complete. At this point, the first RV transmission continues from the third resource (resource 8) out of N1 resources.

[0180] Optionally, in Method 1, transmitting the first bit of the first RV on the second resource includes: transmitting the first bit of the first RV on the second resource if the number of REs in the remaining resources of the first resource is less than or equal to a first threshold. That is, the terminal transmits the first bit of the first RV on the second resource if the first condition is met. If the first condition is not met, the terminal can transmit the first bit of the first RV using Method 2 or Method 3. The first condition is that the number of REs in the remaining resources of the first resource is less than or equal to the first threshold. The number of REs in the remaining resources of the first resource can be 0. "Less than or equal to" in the first condition can also be "less than".

[0181] For example, based on Figure 9 In the example shown, when the terminal sends the 30th bit on resource 4, there are 10 REs remaining. If the first threshold is 12, and 10 is less than the first threshold, the terminal continues sending the first RV starting from resource 8. If the first threshold is 8, and 10 is greater than the first threshold, the terminal can send the first bit of the first RV using either method two or method three.

[0182] Method 2: If the last bit of the first RV is sent on the first symbol of the first resource, and the first bit of the first RV is sent on the second symbol of the first resource, the first resource is the n2th resource among N1 resources, and the second symbol is the next symbol after the first symbol, n2 = 1, 2, ..., N1.

[0183] For example, see Figure 10 Assume there are N1 resources. Figure 7 In (a) of the diagram, resources 0, 4, and 8, and N1 resources, all have frequency domain resources of subcarriers 0 to 3, with the first RV being RV0. Assuming the first RV contains 30 bits, the first 20 bits of the first RV can be carried on the first resource (resource 0) of the N1 resources. Bits from the first RV are transmitted starting from the 21st bit on the second resource (resource 4). The first RV transmission is complete when the 30th bit is transmitted on symbol 11. At this point, the first RV transmission continues from symbol 12 on resource 4.

[0184] Optionally, transmitting the first bit of the first RV on the second symbol in the first resource includes: transmitting the first bit of the first RV on the second symbol if the number of REs in the remaining resources on the first symbol is less than or equal to a second threshold. That is, the terminal transmits the first bit of the first RV on the second symbol if the second condition is met. If the second condition is not met, the terminal can transmit the first bit of the first RV using either method one or method three. The second condition is that the number of REs in the remaining resources on the first symbol is less than or equal to the second threshold. "Less than or equal to" in the second condition can also be "less than".

[0185] For example, based on Figure 10 In the example shown, when the terminal sends the 30th bit on symbol 11 in resource 4, there are 2 REs remaining. If the second threshold is 3 and 2 is less than the second threshold, the terminal continues to send the first RV starting from symbol 12 in resource 4. If the second threshold is 1 and 2 is greater than the second threshold, the terminal can send the first bit in the first RV using either method one or method three.

[0186] The first threshold and / or the second threshold may be preset, specified by the protocol, or determined through negotiation between the terminal and the network equipment, and this application does not impose any restrictions.

[0187] Method 3: If the last bit of the first RV is sent on the first symbol of the first resource, and the first bit of the first RV is sent on the remaining resources of the first symbol of the first resource, then the first resource is the n3rd resource out of N1 resources, where n3 = 1, 2, ..., N1. It can be understood that if there are no remaining resources on the first symbol of the first resource, then the first bit of the first RV is sent on the second symbol of the first resource, and the second symbol is the next symbol after the first symbol.

[0188] For example, see Figure 11 Assume there are N1 resources. Figure 7 In (a) of the diagram, resources 0, 4, and 8, and N1 resources, all have frequency domain resources of subcarriers 0 to 3, with the first RV being RV0. Assuming the first RV contains 30 bits, the first 20 bits of the first RV can be carried on the first resource (resource 0) of the N1 resources. Bits from the first RV are transmitted starting from the 21st bit on the second resource (resource 4) of the N1 resources. The first RV transmission is complete when the 30th bit is transmitted on symbol 11. At this point, the first RV transmission continues on the remaining resources on symbol 11 of resource 4.

[0189] When a portion of the bits in the first RV are sent on a resource, how should the bits in the first RV be sent on the next resource? The subsequent sending of bits in the first RV includes: if the last bit sent on the third resource is not the last bit of the first RV, the last bit sent on the third resource and the first bit sent on the fourth resource are two adjacent bits of the first RV, the third resource is the n4th resource out of N1 resources, the fourth resource is the n4+1th resource out of N1 resources, and n4 = 1, 2, ..., N1-1.

[0190] For example, based on Figure 9 , Figure 10 or Figure 11 In the example shown, the first RV includes 30 bits. The first 20 bits of the first RV are carried on the first resource (i.e., resource 0) of the N1 resources. Bits in the first RV are sent starting from the 21st bit of the first RV on the second resource (i.e., resource 4) of the N1 resources.

[0191] Figure 9 , Figure 10 and Figure 11 The examples for Method 1, Method 2, and Method 3 all use N1 resources that are not contiguous in the time domain as examples. Methods 1, 2, and 3 are also applicable to N1 resources that are contiguous in the time domain, and the implementation process is similar. These methods can be used for reference and understanding. For examples, see [link to example]. Figure 12 In (a), if N1 resources are Figure 7 As shown in (b) above, if the first bit of the first RV is sent using the above method three, the bits sent on each resource are as follows: Figure 12 As shown in (a) in the figure.

[0192] Optionally, if two time-contiguous resources among the N1 resources have the same frequency-domain resources, the resource with the later time domain transmission does not send DMRS in the PUSCH. This description assumes two resources have the same frequency-domain resources and are time-contiguous. In actual implementation, if more resources among the N1 resources have the same frequency-domain resources and are time-contiguous, the number of DMRS transmitted on these additional resources can be configured or reduced. For example, DMRS can be transmitted on the first of these additional resources, while DMRS is not transmitted on the other resources; that is, the other resources reuse the DMRS of the first resource. In other words, when demodulating data received on other resources, demodulation can be performed based on the channel state information measured by the DMRS on the first resource, thereby allowing more resources to be used for data transmission and improving resource utilization.

[0193] For example, if N1 resources are Figure 7Resources 0, 1, and 2, shown in (b) above, have the same frequency domain resources. See also Figure 12 In (a) of the prior art, the first symbol of each resource is used to send DMRS. See also Figure 12 In (b) of this application, since the frequency domain resources of resources 0, 1 and 2 are the same, the DMRS on resource 1 may not be transmitted and the DMRS transmitted on resource 0 may be reused. Figure 12 In (b) of the above, DMRS can be sent on resource 0 and resource 1, but DMRS on resource 2 can be omitted, and DMRS sent on resource 1 can be reused. See also Figure 12 In (c), since the frequency domain resources of resources 0, 1 and 2 are the same, the DMRS on resources 1 and 2 can be omitted and the DMRS transmitted on resource 0 can be reused.

[0194] This application Figures 9 to 12 The illustrations assume that N1 resources have the same frequency domain resources. However, in actual implementations, the frequency domain resources of different resources among the N1 resources may differ. Figure 9 , Figure 10 , Figure 11 and Figure 12 In the examples shown, the frequency domain resources of N1 resources are all taken as subcarriers 0 to 3. However, this is not a limitation on the frequency domain resources of N1 resources. In actual implementation, the frequency domain resources can be one or more RBs.

[0195] Optionally, if the third condition is met, the terminal sequentially transmits one or more RVs of the PUSCH (e.g., sequentially transmits all RVs of the PUSCH) using a continuous RV transmission method. The third condition can be: the number of symbols occupied by the terminal in the PUSCH resource is greater than or equal to (here, "greater than or equal to" can also mean "greater than") a third threshold, and / or, the number of repetitions indicated by the PUSCH parameters is greater than or equal to (here, "greater than or equal to" can also mean "greater than") a fourth threshold. In this case, if the third condition is met, the terminal sequentially transmits the bits in the first RV on N1 resources. It is understood that when the resources in the N1 resources are actually repeated, the "number of symbols occupied by the PUSCH resource" in the third condition is the number of repetitions multiplied by the nominal repetition symbol length. The number of repetitions is equal to the nominal number of repetitions.

[0196] Since a single RV will correspond to multiple resources only when there are a sufficient number of repetitions and / or a sufficient number of symbols occupied by the PUSCH resource, this optional method allows the RV to be sent when necessary and not when not necessary, thereby improving sending efficiency.

[0197] Optionally, the third threshold is related to the number of symbols (i.e., L) and the number of repetitions in the PUSCH, which are indicated by the PUSCH parameters. For example, if L is required to be greater than or equal to 10 and the number of repetitions is required to be greater than or equal to 2, then the third threshold can be 10*2=20. The third threshold can also be preset, specified by the protocol, or determined through negotiation between the terminal and the network device; this application does not impose any restrictions.

[0198] Optionally, the fourth threshold is related to the number of RVs. For example, the fourth threshold can be the upper limit of the number of RVs (currently 4). The fourth threshold can also be preset, specified by the protocol, or determined through negotiation between the terminal and the network device; this application does not impose any restrictions. For example, the fourth threshold can be 3 or 4.

[0199] 607. The network device performs joint demodulation on the bits received from the first RV on N1 resources.

[0200] Specifically, the network device combines the bits received from the first RV on N1 resources and then demodulates them.

[0201] It should be noted that since the bits transmitted from each of the N1 resources do not necessarily start from the first bit of the first RV, the network device needs to combine the bits transmitted by the terminal on the N1 resources for demodulation. After receiving the PUSCH on the PUSCH resource, the network device needs to combine the bits from the first RV transmitted from each of the N1 resources in the received PUSCH according to the position of the N1 resources in the PUSCH resource to obtain the complete first RV, and then demodulation can be performed based on the complete first RV.

[0202] Optionally, the method further includes: the terminal determining N2 resources based on the PUSCH resources, the N2 resources being used to transmit the second RV of the PUSCH, the terminal sequentially transmitting bits from the second RV on the N2 resources, the N2 resources being located on at least two time slots, and N2 being an integer greater than 1. Correspondingly, the network device determining N2 resources based on the PUSCH resources, the network device receiving bits from the second RV on the N2 resources, and the network device performing joint demodulation on the bits from the second RV received on the N2 resources. The second RV is different from the first RV; for example, if the first RV is RV0, then the second RV can be RV1, RV2, or RV3. In this method, the process of the terminal determining the N2 resources is similar to the process of determining the N1 resources, and the process of the terminal sequentially transmitting the second RV on the N2 resources is similar to the process of sequentially transmitting the first RV, and will not be described again. The process of determining N2 resources by the network device is similar to that of determining N1 resources. The process of jointly demodulating the bits in the second RV received from the N2 resources is similar to that of jointly demodulating the bits in the first RV received from the N1 resources, and will not be described again.

[0203] In practice, the terminal can determine the resource corresponding to each RV and then continuously transmit the bits in that RV on the corresponding resource. Specifically, the terminal can first group the PUSCH resources into four resource groups, and then transmit the RVs indicated by the DCI. id Determine the RVs corresponding to the four resource groups, and continuously send the corresponding RVs on each resource group. The four resource groups include N1 resources, N2 resources, N3 resources, and N4 resources, respectively.

[0204] In the first case, resources with the same value obtained by taking the remainder of their resource index modulo 4 can be grouped into one resource group. In this case, resources with an index of 4q (where q is an integer greater than or equal to 0) are grouped into one resource group, resources with an index of 4q+1 into another, resources with an index of 4q+2 into another, and resources with an index of 4q+3 into yet another. Based on... Figure 7 As shown in (a), N1 resources can be resources 0, 4, and 8; N2 resources can be resources 1 and 5; N3 resources can be resources 2 and 6; and N4 resources can be resources 3 and 7. (The last part, "rv," appears to be a typo and can be omitted.) id Taking a scenario where the RV cycle order is {0,2,3,1} and the total number of resources is 0, the terminal will continuously send RV0 on the N1 resources, RV2 on the N2 resources, RV3 on the N3 resources, and RV1 on the N4 resources. Figure 8As shown in (a), N1 resources can be resources 0 and 4, N2 resources can be resources 1 and 5, N3 resources can be resources 2, and N4 resources can be resources 3. (The last part, "rv," appears to be a typo and can be omitted.) id If 0 = RV and the RV cycle order is {0,2,3,1}, then N1 resources correspond to RV0, N2 resources correspond to RV2, N3 resources correspond to RV3, and N4 resources correspond to RV1. In this case, the terminal will continuously send RV0 on N1 resources, continuously send RV2 on N2 resources, continuously send RV3 on N3 resources, and continuously send RV1 on N4 resources.

[0205] In the second case, the indexes are consecutive and satisfy... Resources with the same value are grouped into one resource group. In this case, based on... Figure 7 As shown in (b), N1 resources can be resources 0, 1, and 2; N2 resources can be resources 3, 4, and 5; N3 resources can be resources 6, 7, and 8; and the fourth resource group contains no resources. (rv) id Taking RV=0 as an example, with the RV cycle order being {0,2,3,1}, N1 resources correspond to RV0, N2 resources correspond to RV2, and N3 resources correspond to RV3. The terminal will then continuously send RV0 on N1 resources, RV2 on N2 resources, and RV3 on N3 resources. Figure 8 As shown in (b), N1 resources can be resources 0 and 1, N2 resources can be resources 2 and 3, N3 resources can be resources 4 and 5, and the fourth resource group has no resources. (rv) id For example, if the RV cycle order is {0,2,3,1}, then N1 resources correspond to RV0, N2 resources correspond to RV2, and N3 resources correspond to RV3. In this case, the terminal will continuously send RV0 on N1 resources, continuously send RV2 on N2 resources, and continuously send RV3 on N3 resources.

[0206] In the second case, assuming that each resource group contains T resources, the RV sent on the resource with index p can be found in Table 5.

[0207] Table 5

[0208]

[0209] In actual implementation, the terminal can continue to send the corresponding RV on some of the RVs used to send PUSCH, or it can continue to send the corresponding RV on all the RVs used to send PUSCH. This application does not impose any restrictions.

[0210] The method provided in Example 1 integrates discrete resources that transmit the same RV, and then continuously transmits the first RV on the integrated resources. Compared with the prior art, which transmits the RV from scratch on each resource, the terminal can transmit the complete first RV, which can solve the problem of incomplete RV transmission caused by the discreteness of resources, and improve the decoding performance of network devices and the reliability of data transmission. If the first RV is RV0, it can also reduce the decoding performance loss caused by the incomplete transmission of RV0 (i.e., system bit leakage).

[0211] Example 2

[0212] See Figure 13 The method provided in Example 2 includes:

[0213] 1301. The network device sends the timeslot format and PUSCH parameters to the terminal. Correspondingly, the terminal receives the timeslot format and PUSCH parameters from the network device.

[0214] The relevant description of step 1301 can be found in step 601 above, and will not be repeated here.

[0215] 1302. The terminal determines the PUSCH resource and the first value based on the timeslot format and PUSCH parameters.

[0216] The relevant description of the terminal determining the PUSCH resource based on the time slot format and PUSCH parameters in step 1302 can be found in step 602 above, and will not be repeated here.

[0217] The first value can be either the number of repetitions or the number of resources in the PUSCH resource.

[0218] 1303. The terminal determines X RVs of PUSCH based on the first value. X is an integer greater than 0, and more specifically, X can be an integer greater than 4.

[0219] The value of X can take the following three cases:

[0220] Case 1: X is the same as the first value. In this case, the first value is less than or equal to the upper limit of the number of RVs. For example, if the upper limit of the number of RVs is 10 and the first value is 9, then X can be equal to 9.

[0221] Case 2: X is the value among multiple optional values ​​that is greater than and closest to the first value, and these optional values ​​are pre-configured. For example, if the multiple optional values ​​are 4, 6, 8, 10, and 12, and the first value is 7, then X can be 8.

[0222] Case 3: X is the value among multiple optional values ​​that is less than the first value and closest to the first value, and the multiple optional values ​​are pre-configured. For example, if the multiple optional values ​​are 4, 6, 8, 10, and 12, and the first value is 7, then X can be 6.

[0223] The aforementioned optional values ​​can be specified by the protocol or determined through negotiation between the terminal and network equipment. These optional values ​​can be configured in a table format.

[0224] 1304. The network device determines the PUSCH resource and the first value based on the timeslot format and PUSCH parameters.

[0225] The specific implementation of step 1304 is similar to that of step 1302, the only difference being that it involves a network device. You can refer to this for understanding, and it will not be described again.

[0226] 1305. The network device determines the above X RVs of PUSCH based on the first value.

[0227] The specific implementation of step 1305 is similar to that of step 1303, the only difference being that it involves a network device. You can refer to this for understanding, and it will not be described again.

[0228] It should be noted that steps 1304 and 1305 can be performed after steps 1302 and 1303 or before steps 1302 and 1303, and this application does not impose any restrictions.

[0229] 1306. The terminal transmits at least one of X RVs on the PUSCH resource. Correspondingly, the network device receives at least one of X RVs on the PUSCH resource.

[0230] It should be noted that after the terminal determines X RVs, the number of resources in the PUSCH may be less than X. In this case, the terminal can send some of the X RVs on the PUSCH resources.

[0231] Optionally, after step 1303, the method further includes: the terminal determining the cyclic order of the X RVs. In this case, in a specific implementation of step 1306, the terminal sends the X RVs on the PUSCH resource according to the cyclic order of the X RVs. For example, if X = 6, and the six RVs are RV0, RV1, RV2, RV3, RV4, and RV5, the cyclic order of the six RVs can be RV0, RV3, RV5, RV2, RV4, and RV1. In this case, Figure 7 The RVs sent on the various resources shown in (a) can be found in [reference]. Figure 14 (a) in the middle, Figure 8 The RVs sent on the various resources shown in (a) can be found in [reference]. Figure 14 (b) in the middle.

[0232] In practical implementation, each of the above optional values ​​can correspond to a table similar to Table 4, indicated by the DCI rv. id The table can be in a cyclical order of RV. For example, the table corresponding to the optional value 8 can be found in Table 6.

[0233] Table 6

[0234]

[0235] In the prior art, the terminal can only send RV0, RV2, RV3 and RV1 of PUSCH in a loop. In the second embodiment, more RVs (i.e. more than 4 RVs) are introduced. The number of RVs is determined by the number of resources or the number of repetitions in the PUSCH resources. More RVs are sent on the resources, so that different resources carry different RVs as much as possible. This reduces the problem of repeatedly sending the same RV on resources when there are fewer RVs, improves the integrity of system bit transmission as much as possible, and reduces the loss of decoding performance caused by incomplete system bit transmission due to discrete resources.

[0236] Example 3

[0237] See Figure 15 The method provided in Example 3 includes:

[0238] 1501. The network device determines the PUSCH resources based on the PUSCH parameters and time slot format. The PUSCH resources include M resources, and one of the M resources is used to carry one RV of the PUSCH.

[0239] The PUSCH resource can contain M resources. The process by which the network device determines the resources (i.e., the M resources) within the PUSCH resource can be found in step 1302 above, which can be used for reference and understanding; the only difference is that in this case, it is the network device. For example, in... Figure 7 (a) and Figure 7 In example (b) above, the M resources are resources 0 through 8. Figure 8 (a) and Figure 8 In example (b) in the example, the M resources are resources 0 to resources 5.

[0240] 1502. The network device sends a first indication message to the terminal, causing the first RV of PUSCH to be sent on the first resource. The first RV is the RV with index 0 (i.e., the first RV is RV0). Correspondingly, the terminal receives the first indication message from the network device.

[0241] The first indication information indicates the RV of the PUSCH sent by the first resource among the M resources, that is, the first indication information indicates the RV indicated by the DCI mentioned above. id The first instruction information can be carried in the DCI.

[0242] The first resource can be one of the following two cases:

[0243] Case 1: The first resource is the resource with the largest number of symbols among the M resources. Specifically, the first resource can be the resource with the largest total number of symbols among the M resources, or it can be the resource with the largest number of symbols used for transmitting data among the M resources. Taking the former as an example, based on... Figure 7 In the example shown in (a), M resources are 9 resources in total. Resource 7 is the resource with the most symbols among the 9 resources, so the first resource is resource 7. Taking the RV cycle order as {0,2,3,1} as an example, based on Table 4, the first indication information indicates the RV... id =2.

[0244] Case 2: The first resource is the resource with the most symbols among the M resources used to send the same RV. The resources used to send the same RV include the resource groups determined in the first or second case of Example 1.

[0245] In the first case, the number of symbols in a resource used to send data to the same RV can be either the total number of symbols in that resource or the number of symbols in that resource used for sending data. For the former example, see [link to relevant documentation]. Figure 16 Resources 0, 4, and 8 form a resource group for transmitting the same RV, containing 14 symbols. Resources 1 and 5 form another resource group for transmitting the same RV, also containing 14 symbols. Resources 2 and 6 form yet another resource group for transmitting the same RV, containing 8 symbols. Resources 3 and 7 form yet another resource group for transmitting the same RV, containing 20 symbols. Resources 3 and 7 have the most symbols; therefore, the first resource group is composed of resources 3 and 7, and the terminal transmits RV0 on resources 3 and 7. Taking an RV cycle order of {0, 2, 3, 1} as an example, based on Table 4, the first indication information indicates the RV... id =2.

[0246] In the second scenario, some resources may reuse the DMRS of other resources. The number of symbols in a resource used to transmit data within the same RV can be either the total number of symbols in that resource or the number of symbols used for data transmission within that resource. For the former example, see [link to relevant documentation]. Figure 17In (a), resources 0, 1, and 2 are a resource group used to transmit the same RV, containing 20 symbols; resources 3, 4, and 5 are a resource group used to transmit the same RV, containing 20 symbols; and resources 6, 7, and 8 are a resource group used to transmit the same RV, containing 16 symbols. Therefore, the first resource is either a resource group consisting of resources 0, 1, and 2, or a resource group consisting of resources 3, 4, and 5. The terminal transmits RV0 on resources 0, 1, and 2 (e.g., ...). Figure 17 As shown in (a)), or, the terminal sends RV0 on resources 3, 4, and 5. Taking the RV cycle order as {0,2,3,1} as an example, based on Table 4, when the terminal sends RV0 on resources 0, 1, and 2, the RV indicated by the first indication information is... id =0; When the terminal sends RV0 on resources 3, 4 and 5, the first indication information indicates RV. id =1. For the latter example, see [link to relevant documentation]. Figure 17 In (b), resources 0, 1, and 2 are resource groups used to transmit the same RV. Resource 1 reuses the DMRS of resource 0. The number of symbols used for transmitting data in this resource group is 18. Resources 3, 4, and 5 are resource groups used to transmit the same RV. Resource 4 reuses the DMRS of resource 3. The number of symbols used for transmitting data in this resource group is 18. Resources 6, 7, and 8 are resource groups used to transmit the same RV. Resource 7 reuses the DMRS of resource 6. The number of symbols used for transmitting data in this resource group is 14. Then the first resource is a resource group composed of resources 0, 1, and 2, or a resource group composed of resources 3, 4, and 5. The terminal transmits RV0 on resources 0, 1, and 2 (for example, ...). Figure 17 As shown in (b)), or, the terminal sends RV0 on resources 3, 4, and 5. Taking the RV cycle order as {0,2,3,1} as an example, based on Table 4, when the terminal sends RV0 on resources 0, 1, and 2, the RV indicated by the first indication information is... id =0; When the terminal sends RV0 on resources 3, 4 and 5, the first indication information indicates RV. id =1.

[0247] 1503. The terminal sends one or more RVs of PUSCH on M resources according to the first instruction information.

[0248] In specific implementation, step 1503 can be performed by the terminal based on the rv indicated by the first indication information. id Determine the RV corresponding to each of the M resources, and send the corresponding RV on each of the M resources.

[0249] Prior to step 1503, the method may further include steps 601 and 602 described above, whereby the terminal may further determine M resources to send one or more RVs of PUSCH on the M resources. In this case, steps 601 and 602 may be performed before or after step 1501 or 1502, and this application does not impose any restrictions.

[0250] Optionally, prior to step 1502, the method further includes:

[0251] 11) The network device determines that all k values ​​of the first indication information cause the first RV of PUSCH to be sent on the first resource, where k is an integer greater than 1.

[0252] 12) The network device determines the length of the resource occupied by the second RV according to the k values, namely L1, L2, ..., Lk. The second RV is the RV with index 1 or 3.

[0253] 13) When the first indication information is the first value among k values, the second RV is sent on the second resource, and the network device determines that the first value among k values ​​is the value of the first indication information. Here, the second resource is the resource with a length of Lmax occupied by the second RV, where Lmax refers to the largest value among L1, L2, ..., Lk.

[0254] It should be noted that in actual implementation, there may be multiple resources with the most symbols (i.e., there may be multiple first resources). In this case, the first indication information may have multiple values ​​that allow RV0 to be sent on the resource with the most symbols. Since RV1 and RV3 contain more system bits than RV2, under the premise that RV0 is sent on the resource with the most symbols, RV1 or RV3 can be sent on the resource with more symbols, thereby sending as many complete system bits as possible and improving performance.

[0255] When the first resource is the resource with the most symbols among the M resources, for one of the k values, the second RV may occupy multiple resources. In this case, the resource with the most symbols among the multiple resources occupied by the second RV is considered to be the resource occupied by the second RV in step 12). For example, based on Figure 8 The resource shown in (a) can be resource 1, resource 2, resource 4, or resource 5. Based on Table 4, rv id It can be 3, 0, or 1. Assuming the second RV is RV1, the first indicator information indicates the RV... idWhen = 1, the first resource is resource 1 or resource 5, and the second resource is resource 0 or resource 4. Since the number of symbols for resource 4 is greater than the number of symbols for resource 0, the resource occupied by the second RV is considered to be resource 4; the first indication information indicates the RV. id When = 3, the first resource is resource 2, and the second resource is either resource 1 or resource 5. Since resource 1 and resource 5 have the same number of symbols, the resource occupied by the second resource can be either resource 1 or resource 5; the first indication information indicates the rv. id When rv = 0, the first resource is resource 4, and the second resource is resource 3. Therefore, rv id =1 and rv id When = 3, the number of symbols for the resources occupied by the second RV is 14, rv id When = 0, the number of symbols for the resources occupied by the second RV is 6. At this time, the RV indicated by the first indication information... id It can be 1 or 3. Furthermore, due to the first indication information indicating the rv... id When the value is 3, the resources occupied by RV3 include resource 4, and the RV indicated by the first indication information. id When the value is 1, RV3 occupies resource 3. The number of symbols in resource 4 is greater than the number of symbols in resource 3. Based on the principle of ensuring that RV3 is also transmitted on a longer resource, the first indication information indicates RV3. id It can be 3.

[0256] When the first resource is the resource with the most symbols among the M resources used to send the same RV, the resource occupied by the second RV in step 12) refers to the resource used to send the second RV. For example (denoted as Example 1), suppose multiple resources with consecutive resource indices are grouped into a resource group for sending the same RV, and each resource group includes T (assuming T = 3) resources. Let the resource index be p. Then the first resource group includes... The corresponding resources (i.e., resource 0, resource 1, and resource 2), the second resource group includes The corresponding resources (i.e., resources 3, 4, and 5) are included in the third resource group. The corresponding resources (i.e., resources 6, 7, and 8) are included in the fourth resource group. The corresponding resources (i.e., resources 9, 10, and 11). The total number of symbols in the first, second, third, and fourth resource groups are 20, 20, 16, and 14, respectively. At this time, RV0 can send on the first resource group (at this time, RV...). id =0), or it can be sent on the second resource group (in this case, rv id =1). Assume the second RV is RV1, rv idWhen = 0, RV1 sends on the fourth resource group, rv id When RV1 = 1, RV1 is transmitted on the first resource group. The total number of symbols in the first resource group (i.e., 20) is greater than the total number of symbols in the fourth resource group (i.e., 14), meaning RV1 is transmitted on the first resource group. id =0 and rv id =1 compared to rv id =1 allows the second RV to occupy more symbols; therefore, determining rv... id =1.

[0257] In the method provided in Embodiment 3, since RV0 contains the most system bits, the network device can schedule the terminal to send RV0 on the resource with the most symbols, thereby receiving as many system bits as possible and improving decoding performance. Furthermore, when there are multiple resources with the most symbols, while ensuring that RV0 is sent on the resource with the most symbols, the terminal can also be scheduled to send RV1 or RV3 on resources with a relatively large number of symbols, thereby enabling the network device to receive even more system bits and improve decoding performance.

[0258] In the above embodiments, the cyclic order of RVs is not limited to the cyclic order shown in Table 4. The cyclic order of RVs can be indicated by more than 2 bits. For example, when RVs include RV0, RV1, RV2, and RV3, there are 24 possible cyclic orders of RVs. In this case, 5 bits can be used to indicate the 24 cyclic orders of the 4 RVs. The same applies when the number of RVs is greater than 4, and will not be described again.

[0259] The various embodiments mentioned above in this application can be combined without contradiction, and no limitation is imposed. For example, in Embodiment 1, more RVs can be configured, and the resources corresponding to these RVs can be determined. The RV can be continuously transmitted on the resources corresponding to each RV, or RV0 can be transmitted on the resource group with the largest number of symbols among the determined multiple resource groups. As another example, in Embodiment 2, RV0 from more RVs can also be transmitted on the resource with the largest number of symbols.

[0260] In the above embodiments and corresponding figures of this application, the PUSCH transmitted by this application is illustrated by taking the DMRS occupying 1 symbol in the PUSCH as an example. In actual implementation, the DMRS can occupy more symbols in the PUSCH, such as 2, 3, or 4, etc., and this application does not impose any limitation. In addition, the time slots shown in the various figures of this application (e.g., Figure 1There may be downlink time slots between time slots n+2 and n+3. Since this application does not involve transmitting data on downlink time slots, they are not shown in the accompanying drawings. However, it should be understood that each time slot shown in the accompanying drawings of this application is an example and is not a limitation on the time slot format and time slot position in actual implementation.

[0261] In the above embodiments of this application, the PUSCH parameter may not indicate an index when indicating the start symbol S, the number of symbols L, and K2. Instead, it may directly indicate one or more of the start symbol S, the number of symbols L, and K2. This application does not impose any restrictions on this.

[0262] The foregoing primarily describes the solutions of the embodiments of this application from a methodological perspective. It is understood that each network element, such as a terminal and network device, includes at least one of the hardware structures and software modules corresponding to the execution of each function in order to achieve the aforementioned functions. Those skilled in the art should readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in a hardware-driven or software-driven manner depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0263] This application embodiment can divide the terminal and network device into functional units according to the above method example. For example, each function can be divided into a separate functional unit, or two or more functions can be integrated into one processing unit. The integrated unit can be implemented in hardware or as a software functional unit. It should be noted that the unit division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[0264] For example, Figure 18 A possible structural diagram of the data transmission device (denoted as data transmission device 180) involved in the above embodiments is shown. The data transmission device 180 includes a processing unit 1801 and a communication unit 1802. Optionally, it also includes a storage unit 1803. The data transmission device 180 can be used to illustrate the structure of the terminal and network device in the above embodiments.

[0265] When the data transmission device 180 is used to illustrate the structure of the terminal in the above embodiment, the processing unit 1801 is used to control and manage the actions of the terminal. For example, the processing unit 1801 is used to execute... Figure 6 Numbers 601, 602, 603, and 606 in the series... Figure 13Numbers 1301, 1302, 1303, and 1306 in the series... Figure 15 Actions performed by the terminal in processes 1502 and 1503, and / or other processes described in the embodiments of this application. Processing unit 1801 can communicate with other network entities via communication unit 1802, for example, with... Figure 6 The network device communicates within the terminal. Storage unit 1803 is used to store the terminal's program code and data.

[0266] When the data transmission device 180 is used to illustrate the structure of the network device in the above embodiment, the processing unit 1801 is used to control and manage the operation of the network device. For example, the processing unit 1801 is used to execute... Figure 6 Numbers 601, 604, 605, 606, and 607 in the series... Figure 13 Numbers 1301, 1304, 1305, and 1306 in the series... Figure 15 The actions performed by the network device in processes 1501 and 1502, and / or other processes described in the embodiments of this application. Processing unit 1801 can communicate with other network entities via communication unit 1802, for example, with... Figure 6 Terminal communication in the network. Storage unit 1803 is used to store the program code and data of the network device.

[0267] For example, the data transmission device 180 can be a device, a chip, or a chip system.

[0268] When the data transmission device 180 is a single device, the processing unit 1801 can be a processor; the communication unit 1802 can be a communication interface, a transceiver, or an input interface and / or an output interface. Optionally, the transceiver can be a transceiver circuit. Optionally, the input interface can be an input circuit, and the output interface can be an output circuit.

[0269] When the data transmission device 180 is a chip or chip system, the communication unit 1802 may be a communication interface, input interface and / or output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip or chip system. The processing unit 1801 may be a processor, processing circuit, or logic circuit.

[0270] Figure 18If the integrated units in the process are implemented as software functional modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of this application, in essence, or the parts that contribute to the prior art, or all or part of the technical solutions, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. Storage media for storing computer software products include: USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, optical disks, and other media capable of storing program code.

[0271] This application also provides a hardware structure diagram of a data transmission device, see [link]. Figure 19 or Figure 20 The data transmission device includes a processor 1901, and optionally, a memory 1902 connected to the processor 1901.

[0272] Processor 1901 can be a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits used to control the execution of the program according to the present application. Processor 1901 may also include multiple CPUs, and processor 1901 can be a single-core processor or a multi-core processor. Here, processor can refer to one or more devices, circuits, or processing cores used to process data (e.g., computer execution instructions).

[0273] The memory 1902 can be a ROM or other type of static storage device capable of storing static information and computer-executable instructions, RAM or other type of dynamic storage device capable of storing information and computer-executable instructions, or it can be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.), a magnetic disk storage medium or other magnetic storage device, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer. This application embodiment does not impose any limitations on this. The memory 1902 can exist independently (in this case, the memory 1902 can be located outside or inside the data transmission device) or it can be integrated with the processor 1901. The memory 1902 can contain computer program code. The processor 1901 is used to execute the computer program code stored in the memory 1902, thereby implementing the method provided in this application embodiment.

[0274] In the first possible implementation, see Figure 19 The data transmission device also includes a transceiver 1903. The processor 1901, memory 1902, and transceiver 1903 are connected via a bus. The transceiver 1903 is used to communicate with other devices or communication networks. Optionally, the transceiver 1903 may include a transmitter and a receiver. The device in the transceiver 1903 that implements the receiving function can be considered as a receiver, and the receiver is used to perform the receiving steps in the embodiments of this application. The device in the transceiver 1903 that implements the transmitting function can be considered as a transmitter, and the transmitter is used to perform the transmitting steps in the embodiments of this application.

[0275] Based on the first possible implementation method Figure 19 The structural diagram shown can be used to illustrate the structure of the terminal and network devices involved in the above embodiments.

[0276] when Figure 19 The schematic diagram shown illustrates the structure of the terminal involved in the above embodiments. The processor 1901 is used to control and manage the actions of the terminal. For example, the processor 1901 is used to execute... Figure 6 Numbers 601, 602, 603, and 606 in the series... Figure 13 Numbers 1301, 1302, 1303, and 1306 in the series... Figure 15Actions performed by the terminal in processes 1502 and 1503, and / or other processes described in the embodiments of this application. Processor 1901 can communicate with other network entities via transceiver 1903, for example, with... Figure 6 The network device communicates within the terminal. Memory 1902 is used to store the terminal's program code and data.

[0277] when Figure 19 The schematic diagram shown illustrates the structure of the network device involved in the above embodiments. The processor 1901 is used to control and manage the actions of the network device. For example, the processor 1901 is used to execute... Figure 6 Numbers 601, 604, 605, 606, and 607 in the series... Figure 13 Numbers 1301, 1304, 1305, and 1306 in the series... Figure 15 The actions performed by the network device in processes 1501 and 1502, and / or other processes described in the embodiments of this application. Processor 1901 can communicate with other network entities via transceiver 1903, for example, with... Figure 6 Terminal communication within the network. Memory 1902 is used to store the program code and data of the network device.

[0278] In a second possible implementation, the processor 1901 includes logic circuitry and input and / or output interfaces. For example, the output interface is used to perform a sending action in the corresponding method, and the input interface is used to perform a receiving action in the corresponding method. See also [link to second possible implementation]. Figure 20 , Figure 20 The structural diagram shown can be used to illustrate the structure of the terminal and network devices involved in the above embodiments.

[0279] when Figure 20 The schematic diagram shown illustrates the structure of the terminal involved in the above embodiments. The processor 1901 is used to control and manage the actions of the terminal. For example, the processor 1901 is used to execute... Figure 6 Numbers 601, 602, 603, and 606 in the series... Figure 13 Numbers 1301, 1302, 1303, and 1306 in the series... Figure 15 Actions performed by the terminal in processes 1502 and 1503, and / or other processes described in the embodiments of this application. Processor 1901 can communicate with other network entities via input and / or output interfaces, for example, with... Figure 6 The network device communicates within the terminal. Memory 1902 is used to store the terminal's program code and data.

[0280] when Figure 20The schematic diagram shown illustrates the structure of the network device involved in the above embodiments. The processor 1901 is used to control and manage the actions of the network device. For example, the processor 1901 is used to execute... Figure 6 Numbers 601, 604, 605, 606, and 607 in the series... Figure 13 Numbers 1301, 1304, 1305, and 1306 in the series... Figure 15 The actions performed by the network device in processes 1501 and 1502, and / or other processes described in the embodiments of this application. The processor 1901 can communicate with other network entities via input and / or output interfaces, for example, with... Figure 6 Terminal communication within the network. Memory 1902 is used to store the program code and data of the network device.

[0281] In implementation, each step of the method provided in this embodiment can be completed by integrated logic circuits in the processor or by instructions in software form. The steps of the method disclosed in the embodiments of this application can be directly manifested as being executed by a hardware processor, or being executed by a combination of hardware and software modules in the processor.

[0282] This application also provides a computer-readable storage medium including computer-executable instructions that, when run on a computer, cause the computer to perform any of the methods described above.

[0283] This application also provides a computer program product containing computer execution instructions, which, when run on a computer, causes the computer to perform any of the methods described above.

[0284] This application also provides a communication system, including the network device and terminal described in the above embodiments.

[0285] This application also provides a chip, including a processor and an interface. The processor is coupled to a memory through the interface. When the processor executes a computer execution program or computer execution instruction in the memory, any of the methods provided in the above embodiments are executed.

[0286] The computer execution instructions in this application may also be referred to as instructions, computer instructions, computer programs, etc.

[0287] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented using software programs, implementation can be, in whole or in part, in the form of a computer program product. This computer program product includes one or more computer-executable instructions. When these computer-executable instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer-executable instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, computer-executable instructions can be transmitted from one website, computer, server, or data center to another via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium accessible to a computer or a data storage device containing one or more servers, data centers, etc., that can be integrated with the medium. The available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media (e.g., solid-state disks, SSDs).

[0288] Although this application has been described herein in conjunction with various embodiments, those skilled in the art, by reviewing the accompanying drawings, the disclosure, and the appended claims, will understand and implement other variations of the disclosed embodiments in carrying out the claimed application. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude multiple instances. A single processor or other unit can implement several functions listed in the claims. While different dependent claims may recite certain measures, this does not mean that these measures cannot be combined to produce good results.

[0289] Although this application has been described in conjunction with specific features and embodiments, it is obvious that various modifications and combinations can be made thereto without departing from the spirit and scope of this application. Accordingly, this specification and drawings are merely exemplary illustrations of this application as defined by the appended claims, and are considered to cover any and all modifications, variations, combinations, or equivalents within the scope of this application. Clearly, those skilled in the art can make various alterations and modifications to this application without departing from the spirit and scope of this application. Thus, if such modifications and modifications of this application fall within the scope of the claims of this application and their equivalents, this application is also intended to include such modifications and modifications.

Claims

1. A data transmission method, characterized in that, include: The terminal device determines N1 time slots based on PUSCH resources. The N1 time slots are used to send the first redundant version RV of PUSCH, where N1 is an integer greater than 1. The terminal device is used to repeatedly send the first RV. If the last bit sent by the terminal device in the first time slot is the last bit of the first RV, then the terminal device sends the first bit of the first RV in the second time slot. The first time slot is the n1th time slot among the N1 time slots, and the second time slot is the (n1+1)th time slot among the N1 time slots, where n1 = 1, 2, ..., N1-1. If the last bit transmitted by the terminal device in the first time slot is not the last bit of the first RV, then the terminal device continues to transmit the first RV in the second time slot, wherein the last bit transmitted by the terminal device in the first time slot and the first bit transmitted in the second time slot are two adjacent bits of the first RV; the last bit transmitted in the first time slot is the bit before the first bit transmitted in the second time slot.

2. The method according to claim 1, characterized in that, The method further includes: The terminal device determines the i-th time slot in the PUSCH resource based on m to send the first RV, where m = mod4, where p is the time slot index of the i-th time slot, and N1 is the number of time slots used to transmit the first RV, i=1,2,...,N1-1.

3. The method according to claim 2, characterized in that, The method further includes: The terminal device receives a first downlink control information (DCI), the first DCI indicating rv id ; The terminal device determines the i-th time slot in the PUSCH resource for transmitting the first RV based on m, including: the terminal device determines the RV based on the RV. id The i-th time slot in the PUSCH resource is determined to be used to transmit the first RV.

4. The method according to any one of claims 1-3, characterized in that, The method further includes: The terminal device receives PUSCH parameters sent by the network device, the PUSCH parameters including the number of repetitions; The terminal device determines the PUSCH resource based on the number of repetitions.

5. The method according to claim 1, characterized in that, The method further includes: If the terminal device transmits the last bit of the first RV on the first symbol in the first time slot, the terminal device transmits the first bit of the first RV on the remaining resources on the first symbol in the first time slot.

6. The method according to any one of claims 1-5, characterized in that, The method further includes: The terminal device determines N2 time slots based on the PUSCH resources. The N2 time slots are used to send the second RV of the PUSCH, where N2 is an integer greater than 1.

7. A data transmission method, characterized in that, include: N1 time slots are determined based on the PUSCH resources. The N1 time slots are used by the terminal device to send the first redundant version RV of the PUSCH, where N1 is an integer greater than 1. The terminal device is used to repeatedly send the first RV. Bits from the first RV are received in the N1 time slots; If the last bit sent by the terminal device in the first time slot is the last bit of the first RV, then the network device receives the first bit of the first RV in the second time slot. The first time slot is the n1th time slot among the N1 time slots, and the second time slot is the (n1+1)th time slot among the N1 time slots, where n1 = 1, 2, ..., N1-1. If the last bit sent by the terminal device in the first time slot is not the last bit of the first RV, then the network device continues to receive the first RV in the second time slot, wherein the last bit sent by the terminal device in the first time slot and the first bit received by the network device in the second time slot are two adjacent bits of the first RV; the last bit sent in the first time slot is the bit before the first bit sent in the second time slot.

8. The method according to claim 7, characterized in that, The method further includes: The network device determines the PUSCH resource based on the number of repetitions.

9. The method according to claim 7, characterized in that, The method further includes: If the terminal device transmits the last bit of the first RV on the first symbol in the first time slot, the network device receives the first bit of the first RV on the remaining resources on the first symbol in the first time slot.

10. The method according to any one of claims 7-9, characterized in that, The method further includes: N2 time slots are determined based on the PUSCH resources. The N2 time slots are used by the terminal device to send the second RV of the PUSCH, where N2 is an integer greater than 1. Bits from the second RV are received in the N2 time slots.

11. A data transmission device, characterized in that, include: processor; The processor is connected to a memory for storing computer execution instructions, and the processor executes the computer execution instructions stored in the memory to enable the device to implement the method as described in any one of claims 1-6.

12. A data transmission device, characterized in that, include: processor; The processor is connected to a memory for storing computer execution instructions, and the processor executes the computer execution instructions stored in the memory to enable the device to implement the method as described in any one of claims 7-10.

13. A computer-readable storage medium, characterized in that, It includes computer execution instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1-6, or to perform the method as described in any one of claims 7-10.

14. A computer program product, characterized in that, It includes computer execution instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1-6, or to perform the method as described in any one of claims 7-10.

15. A data transmission system, characterized in that, include: A data transmission apparatus for implementing the method as described in any one of claims 1-6, and a data transmission apparatus for implementing the method as described in any one of claims 7-10.

Images