Data transmission method and apparatus

By determining the number of available symbols based on the time slot format and PUSCH parameters, the terminal decides whether to send PUSCH via frequency hopping, thus solving the problem of low resource utilization under network device configuration and achieving efficient resource utilization.

CN114598434BActive Publication Date: 2026-11-17HUAWEI TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202110055474.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2020-12-03
Filing Date
2021-01-15
Publication Date
2026-11-17
Estimated Expiration
2041-01-15

AI Technical Summary

Technical Problem

When network devices are configured to send PUSCH via frequency hopping, terminal frequency hopping PUSCH transmission may reduce resource utilization.

Method used

The terminal determines whether to hop the PUSCH within the resource based on the received time slot format and PUSCH parameters. It determines whether to hop the frequency by judging the number of available symbols and the threshold, thus ensuring the effective use of symbols.

Benefits of technology

It improves resource utilization, avoids resource waste, and allows for flexible application in various scenarios.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114598434B_ABST
    Figure CN114598434B_ABST
Patent Text Reader

Abstract

This application provides a data transmission method and apparatus, relating to the field of communication technology. In this method, a terminal receives a timeslot format and PUSCH parameters from a network device, determines a first resource in a first timeslot based on the timeslot format and PUSCH parameters, the first resource being composed of available symbols, and determines whether to perform frequency hopping to transmit PUSCH within the first resource based on the number of available symbols in the first resource, rather than directly performing frequency hopping to transmit PUSCH within the first resource based on the network device's configuration, thereby improving resource utilization.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application claims priority to Chinese patent application filed on December 3, 2020, with application number 202011395788.2 and entitled “A PUSCH Type-A Enhancement Scheme Method”, 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, when a terminal sends the Physical Uplink Shared Channel (PUSCH), it determines whether to hop the PUSCH based on the network device's configuration. If the network device is configured to hop the PUSCH, the terminal will hop the PUSCH, which may reduce resource utilization. Summary of the Invention

[0004] This application provides a data transmission method and apparatus to improve resource utilization.

[0005] Firstly, a data transmission method is provided, comprising: receiving a timeslot format and PUSCH parameters from a network device; determining a first resource in a first timeslot based on the timeslot format and PUSCH parameters; and determining whether to frequency-hop PUSCH transmission within the first resource based on the number of available symbols in the first resource, wherein the first resource consists of available symbols. The method provided by the first aspect allows the terminal to determine whether to frequency-hop PUSCH transmission within the first resource based on the number of available symbols in the first resource, rather than directly frequency-hopping PUSCH transmission within the first resource based on the network device configuration, thereby improving resource utilization.

[0006] In one possible implementation, the first resource does not include downlink symbols and flexible downlink-to-uplink conversion symbols. This possible implementation ensures that all symbols in the first resource can be used to transmit PUSCH.

[0007] In one possible implementation, determining whether to frequency-hop PUSCH within the first resource based on the number of available symbols in the first resource includes: frequency-hopping PUSCH within the first resource if the number of available symbols in the first resource is greater than or equal to a first threshold; and non-frequency-hopping PUSCH within the first resource if the number of available symbols in the first resource is less than a second threshold, where the second threshold is less than or equal to the first threshold. This possible implementation allows the terminal to frequency-hop PUSCH when the number of symbols is large and non-frequency-hopping PUSCH when the number of symbols is small, thereby improving resource utilization.

[0008] In one possible implementation, the PUSCH parameter is configured to perform frequency hopping for PUSCH transmission. Even when the network device is configured to perform frequency hopping for PUSCH, this implementation ensures that the terminal still determines whether to perform frequency hopping for PUSCH within the first resource based on the number of available symbols in the first resource, thus avoiding resource waste.

[0009] In one possible implementation, the PUSCH parameter indicates the number of symbols in the PUSCH and / or the number of symbols occupied by the DMRS, and the first threshold and / or the second threshold are related to the number of symbols in the PUSCH and / or the number of symbols occupied by the DMRS. In this possible implementation, the first threshold and / or the second threshold can be reasonably determined by the number of symbols in the PUSCH and / or the number of symbols occupied by the DMRS.

[0010] In one possible implementation, the method further includes: receiving first indication information, the first indication information being used to indicate the DMRS position in a first resource, the DMRS position being one or more symbols from the first to the fourth available symbols in the first resource, or the DMRS position being the third to last symbol and / or the fourth to last symbol in the first resource. This possible implementation can solve the problem of how the DMRS is transmitted when transmitting PUSCH using the method described in this application. Additionally, it can also solve the problem of how the DMRS is transmitted in a specific time slot.

[0011] In one possible implementation, the first time slot is a special time slot, and the PUSCH parameter is used to indicate the start symbol and / or the number of symbols corresponding to the special time slot. This possible implementation can solve the problem of indicating the start symbol and / or the number of symbols corresponding to the special time slot.

[0012] In one possible implementation, the first time slot is one of N time slots, and the N time slots are used to transmit PUSCH or to repeatedly transmit PUSCH; the N time slots are N consecutive time slots starting from the starting time slot, or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots, or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots and special time slots, or, the N time slots are N uplink time slots starting from the starting time slot, or, the N time slots are N time slots starting from the starting time slot such that all symbols starting from the starting symbol S in each time slot are available symbols, or, the N time slots are N time slots starting from the starting time slot such that L symbols starting from the starting symbol S in each time slot are available symbols; wherein, the starting time slot is the first time slot used to transmit PUSCH or to repeatedly transmit PUSCH, and N is an integer greater than 1. This possible implementation method provides multiple possible implementations of this solution, thus enabling this solution to be flexibly applied to various scenarios.

[0013] Secondly, a data transmission method is provided, comprising: receiving a timeslot format and PUSCH parameters from a network device; determining N timeslots based on the PUSCH parameters; and determining whether to transmit data carried on the PUSCH within the N timeslots based on the timeslot format of the N timeslots. The data transmitted within the N timeslots is obtained by channel coding a TB, the size of which is determined based on the available symbols in the N timeslots, where N is an integer greater than 1. The method provided in this second aspect allows the terminal to determine N timeslots based on the PUSCH parameters and determine whether to transmit data carried on the PUSCH within the N timeslots based on the timeslot format of the N timeslots. Thus, if data carried on the PUSCH can be transmitted within the N timeslots, the PUSCH is transmitted in the N timeslots, enabling the transmission of 1 TB across multiple timeslots.

[0014] In one possible implementation, determining whether to transmit data carried on the PUSCH within the N time slots depends on the time slot format of the N time slots. This includes transmitting data within the N time slots if the start symbol of each time slot and all subsequent symbols are available. This possible implementation guarantees that there are available symbols for data transmission within the N time slots.

[0015] In one possible implementation, determining whether to transmit data carried on the PUSCH within the N time slots based on the time slot format includes: transmitting data within the N time slots if all symbols starting from the start symbol in the initial time slot are available, and all symbols in the other time slots are also available. This possible implementation guarantees that there are available symbols for data transmission within the N time slots.

[0016] In one possible implementation, determining whether to transmit data carried on the PUSCH within the N time slots depends on the time slot format. This includes: transmitting data in the starting time slot if all symbols in the starting time slot are available; and transmitting data in the i-th time slot if all symbols in the i-th time slot are available, where i can take values ​​of 2, ..., N. This possible implementation guarantees that there are available symbols for data transmission within the N time slots.

[0017] In one possible implementation, determining whether to transmit data carried on the PUSCH within the N time slots based on the time slot format includes: if available symbols exist in the i-th time slot of the N time slots, transmitting data in the i-th time slot, where i can take values ​​of 1, 2, ..., N. This possible implementation guarantees that there are available symbols for data transmission within the N time slots.

[0018] In one possible implementation, determining whether to transmit data carried on the PUSCH within the N time slots depends on the time slot format. This includes: if the number of available symbols in the i-th time slot is greater than or equal to a third threshold, then data is transmitted in the i-th time slot, where i takes the value 1, 2, ..., N. This possible implementation guarantees that there are available symbols for data transmission within the N time slots.

[0019] In one possible implementation, the value of N is indicated by the PUSCH parameter, or the value of N is determined according to the number of symbols L1 indicated by the PUSCH parameter. This possible implementation solves the problem of how to determine the multiple time slots spanned by 1 TB.

[0020] In one possible implementation, the N time slots are N consecutive time slots starting from the initial time slot; or, the N time slots are N time slots starting from the initial time slot excluding downlink time slots; or, the N time slots are N time slots starting from the initial time slot excluding downlink time slots and special time slots; or, the N time slots are N uplink time slots starting from the initial time slot; or, the N time slots are N time slots starting from the initial time slot satisfying that all symbols in each time slot, starting from the initial symbol S, are available symbols; or, the N time slots are N time slots starting from the initial time slot satisfying... Each time slot can be further categorized into N time slots where all L symbols starting from the start symbol S are available, or N time slots where all L symbols starting from the start symbol S in the start time slot are available, and all symbols in the other N time slots are also available; or N time slots where all symbols starting from the start symbol S in the start time slot are available, and all symbols in the other N time slots are also available. The start time slot is the first time slot used to transmit data carried on the PUSCH. This categorization provides multiple possible implementations of this scheme, allowing it to be flexibly applied to various scenarios.

[0021] In one possible implementation, the first time slot after N time slots is the starting time slot for repeated data transmission; or, the first time slot after N time slots with available symbols is the starting time slot for repeated data transmission; or, the first time slot after N time slots where the number of available symbols is greater than or equal to a fourth threshold is the starting time slot for repeated data transmission; or, the first time slot after N time slots where all L symbols starting from the initial symbol are available symbols is the starting time slot for repeated data transmission. This possible implementation solves the problem of determining the starting time slot for repeated data transmission in a scenario where 1 TB is carried across time slots.

[0022] In one possible implementation, the available symbols are not downlink symbols or flexible downlink-to-uplink conversion symbols. This possible implementation ensures that the available symbols can be used to transmit PUSCH.

[0023] In one possible implementation, whether to hop frequency and transmit data within each of the N time slots is determined based on the number of available symbols in that time slot. This possible implementation can improve resource utilization by determining whether to hop frequency and transmit PUSCH within a time slot based on the number of available symbols.

[0024] In one possible implementation, the frequency domain position corresponding to the time slot within the first time window out of N time slots is designated as the first frequency domain position, and the frequency domain position corresponding to the time slot within the second time window is designated as the second frequency domain position. This possible implementation, using the time window as the unit for frequency hopping between time slots, can improve the channel detection performance.

[0025] Thirdly, a data transmission method is provided, comprising: determining a first resource in a first time slot based on a time slot format and PUSCH parameters; and determining whether to receive PUSCH within the first resource via frequency hopping based on the number of available symbols in the first resource, wherein the first resource consists of available symbols. The method provided in this third aspect allows network devices to determine whether to receive PUSCH within the first resource via frequency hopping based on the number of available symbols, thereby improving resource utilization.

[0026] In one possible implementation, the first resource does not include downlink symbols and flexible downlink-to-uplink conversion symbols. This possible implementation ensures that all symbols in the first resource can be used to transmit PUSCH.

[0027] In one possible implementation, determining whether to receive the PUSCH within the first resource via frequency hopping based on the number of available symbols in the first resource includes: receiving the PUSCH via frequency hopping within the first resource if the number of available symbols in the first resource is greater than or equal to a first threshold; and receiving the PUSCH without frequency hopping within the first resource if the number of available symbols in the first resource is less than a second threshold, wherein the second threshold is less than or equal to the first threshold. In this possible implementation, the network device can receive the PUSCH via frequency hopping when the number of symbols is large, and receive the PUSCH without frequency hopping when the number of symbols is small, thereby improving resource utilization.

[0028] In one possible implementation, the method further includes: sending first indication information, the first indication information being used to indicate the DMRS position in the first resource, the DMRS position being one or more symbols from the first to the fourth available symbols in the first resource, or the DMRS position being the third to last symbol and / or the fourth to last symbol in the first resource. This possible implementation can solve the problem of how the DMRS is transmitted when transmitting PUSCH using the method described in this application. Additionally, it can also solve the problem of how the DMRS is transmitted in specific time slots.

[0029] In one possible implementation, the first time slot is a special time slot, and the PUSCH parameter is used to indicate the start symbol and / or the number of symbols corresponding to the special time slot. This possible implementation can solve the problem of indicating the start symbol and / or the number of symbols corresponding to a special time slot.

[0030] In one possible implementation, the first time slot is one of N time slots used to receive the PUSCH or to receive a repetition of the PUSCH; the N time slots are N consecutive time slots starting from the starting time slot, or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots, or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots and special time slots, or, the N time slots are N uplink time slots starting from the starting time slot, or, the N time slots are N time slots starting from the starting time slot such that all symbols starting from the starting symbol S in each time slot are available symbols, or, the N time slots are N time slots starting from the starting time slot such that L symbols starting from the starting symbol S in each time slot are available symbols; wherein, the starting time slot is the first time slot used to receive the PUSCH or to receive a repetition of the PUSCH, and N is an integer greater than 1. This possible implementation method provides multiple possible implementations of this solution, thus enabling this solution to be flexibly applied to various scenarios.

[0031] Fourthly, a data transmission method is provided, comprising: determining N time slots based on PUSCH parameters, where N is an integer greater than 1; determining whether to receive data carried on the PUSCH within the N time slots based on the time slot format of the N time slots, wherein the data transmitted within the N time slots is obtained by channel coding of a TB, and the size of the TB is determined based on the available symbols in the N time slots. In the method provided by the fourth aspect, the network device determines N time slots based on PUSCH parameters and determines whether to receive data carried on the PUSCH within the N time slots based on the time slot format of the N time slots, thereby receiving the PUSCH across multiple time slots when data carried on the PUSCH can be received within the N time slots, thus enabling the transmission of 1 TB across multiple time slots.

[0032] In one possible implementation, determining whether to receive data carried on the PUSCH within the N time slots based on the time slot format of the N time slots includes: receiving the data within the N time slots if the start symbol of each time slot and the symbols following the start symbol of each time slot are all available symbols. This possible implementation ensures that there are available symbols for receiving data within the N time slots.

[0033] In one possible implementation, determining whether to receive data carried on the PUSCH within the N time slots based on the time slot format includes: receiving the data within the N time slots if all symbols starting from the start symbol in the starting time slot are available symbols, and all symbols in the other time slots of the N time slots are available symbols. This possible implementation ensures that there are available symbols for receiving data within the N time slots.

[0034] In one possible implementation, determining whether to receive data carried on the PUSCH within the N time slots based on the time slot format includes: receiving the data in the starting time slot if all symbols starting from the start symbol in the starting time slot of the N time slots are available symbols; and receiving the data in the i-th time slot if all symbols in the i-th time slot of the N time slots are available symbols, where i takes the value 2, ..., N. This possible implementation ensures that there are available symbols for receiving data within the N time slots.

[0035] In one possible implementation, determining whether to receive data carried on the PUSCH within the N time slots based on the time slot format of the N time slots includes: if there are available symbols in the i-th time slot of the N time slots, receiving the data in the i-th time slot, where i takes the value 1, 2, ..., N. This possible implementation can guarantee that there are available symbols in the N time slots for receiving data.

[0036] In one possible implementation, determining whether to receive data carried on the PUSCH within the N time slots based on the time slot format of the N time slots includes: receiving the data in the i-th time slot if the number of available symbols in the i-th time slot is greater than or equal to a third threshold, where i takes the value 1, 2, ..., N. This possible implementation ensures that there are available symbols in the N time slots for receiving data.

[0037] In one possible implementation, the N time slots are N consecutive time slots starting from the starting time slot; or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots; or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots and special time slots; or, the N time slots are N uplink time slots starting from the starting time slot; or, the N time slots are N time slots starting from the starting time slot satisfying that all symbols in each time slot starting from the starting symbol S are available symbols; or, the N time slots are N time slots starting from the starting time slot satisfying... Each time slot contains N time slots where all L symbols starting from the start symbol S are available symbols; alternatively, the N time slots can be N time slots where all L symbols starting from the start symbol S in the start time slot are available symbols, and all symbols in the other N time slots are available symbols; or, the N time slots can be N time slots where all symbols starting from the start symbol S in the start time slot are available symbols, and all symbols in the other N time slots are available symbols. The start time slot is the first time slot used to receive data carried on the PUSCH. This possible implementation provides multiple possible implementations of this solution, allowing it to be flexibly applied to various scenarios.

[0038] In one possible implementation, the first time slot after the N time slots is the starting time slot for receiving the repeated data; or, the first time slot after the N time slots with available symbols is the starting time slot for receiving the repeated data; or, the first time slot after the N time slots where the number of available symbols is greater than or equal to a fourth threshold is the starting time slot for receiving the repeated data; or, the first time slot after the N time slots where all L symbols starting from the initial symbol are available symbols is the starting time slot for receiving the repeated data. This possible implementation solves the problem of determining the starting time slot for repeatedly sending data in a scenario where 1TB is carried across time slots.

[0039] In one possible implementation, the available symbols are not downlink symbols or flexible downlink-to-uplink conversion symbols. This possible implementation ensures that the available symbols can be used to transmit PUSCH.

[0040] In one possible implementation, whether to receive the data via frequency hopping in each of the N time slots is determined based on the number of available symbols in that time slot. This possible implementation can improve resource utilization by determining whether to receive PUSCH via frequency hopping within a time slot based on the number of available symbols in the time slot.

[0041] In one possible implementation, the frequency domain position corresponding to the time slot within the first time window of the N time slots is designated as the first frequency domain position, and the frequency domain position corresponding to the time slot within the second time window is designated as the second frequency domain position. This possible implementation, using the time window as the unit for frequency hopping between time slots, can improve the channel detection performance.

[0042] Fifthly, a data transmission apparatus is provided, comprising: a communication unit and a processing unit; the communication unit is configured to receive a time slot format and PUSCH parameters from a network device; the processing unit is configured to determine a first resource in a first time slot based on the time slot format and the PUSCH parameters, the first resource being composed of available symbols; the processing unit is further configured to determine whether to frequency hopping transmit PUSCH within the first resource based on the number of available symbols in the first resource.

[0043] In one possible implementation, the first resource does not include downlink symbols and flexible symbols for downlink-to-uplink conversion.

[0044] In one possible implementation, the processing unit is specifically configured to: transmit the PUSCH via frequency hopping within the first resource when the number of available symbols in the first resource is greater than or equal to a first threshold; and transmit the PUSCH via non-frequency hopping within the first resource via the communication unit when the number of available symbols in the first resource is less than a second threshold, wherein the second threshold is less than or equal to the first threshold.

[0045] In one possible implementation, the PUSCH parameters configure frequency hopping to transmit the PUSCH.

[0046] In one possible implementation, the PUSCH parameter indicates the number of symbols in the PUSCH and / or the number of symbols occupied by the DMRS, and the first threshold and / or the second threshold are related to the number of symbols in the PUSCH and / or the number of symbols occupied by the DMRS.

[0047] In one possible implementation, the communication unit is further configured to receive first indication information, the first indication information being used to indicate the DMRS position in the first resource, the DMRS position being one or more symbols among the first to fourth available symbols in the first resource, or the DMRS position being the third to last symbol and / or the fourth to last symbol in the first resource.

[0048] In one possible implementation, the first time slot is a special time slot, and the PUSCH parameter is used to indicate the start symbol and / or the number of symbols corresponding to the special time slot.

[0049] In one possible implementation, the first time slot is one of N time slots used to transmit the PUSCH or to repeatedly transmit the PUSCH; the N time slots are N consecutive time slots starting from the starting time slot, or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots, or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots and special time slots, or, the N time slots are N uplink time slots starting from the starting time slot, or, the N time slots are N time slots starting from the starting time slot such that all symbols starting from the starting symbol S in each time slot are available symbols, or, the N time slots are N time slots starting from the starting time slot such that L symbols starting from the starting symbol S in each time slot are available symbols; wherein, the starting time slot is the first time slot used to transmit the PUSCH or to repeatedly transmit the PUSCH, and N is an integer greater than 1.

[0050] In a sixth aspect, a data transmission apparatus is provided, comprising: a communication unit and a processing unit; the communication unit is configured to receive a time slot format and PUSCH parameters from a network device; the processing unit is configured to determine N time slots according to the PUSCH parameters, where N is an integer greater than 1; the processing unit is further configured to determine whether to transmit data carried on the PUSCH within the N time slots according to the time slot format of the N time slots, wherein the data transmitted within the N time slots is obtained by channel coding of a TB, and the size of the TB is determined according to the available symbols in the N time slots.

[0051] In one possible implementation, the processing unit is specifically configured to: transmit the data in the N time slots via the communication unit, provided that the starting symbol of each of the N time slots and the symbols following the starting symbol of each time slot are all available symbols.

[0052] In one possible implementation, the processing unit is specifically configured to: transmit the data in the N time slots via the communication unit when all symbols starting from the start symbol in the starting time slot of the N time slots are available symbols and all symbols in the other time slots of the N time slots are available symbols.

[0053] In one possible implementation, the processing unit is specifically used to: send the data in the starting time slot through the communication unit when all symbols starting from the starting symbol in the starting time slot of the N time slots are available symbols; and send the data in the i-th time slot through the communication unit when all symbols in the i-th time slot of the N time slots are available symbols, where i takes the value of 2, ..., N.

[0054] In one possible implementation, the processing unit is specifically used to: send the data in the i-th time slot through the communication unit when there are available symbols in the i-th time slot of the N time slots, where the value of i is 1, 2, ..., N.

[0055] In one possible implementation, the processing unit is specifically used to: send the data in the i-th time slot through the communication unit when the number of available symbols in the i-th time slot of the N time slots is greater than or equal to a third threshold, where i takes the value of 1, 2, ..., N.

[0056] In one possible implementation, the value of N is indicated by the PUSCH parameter, or the value of N is determined according to the number of symbols L1 indicated by the PUSCH parameter.

[0057] In one possible implementation, the N time slots are N consecutive time slots starting from the starting time slot; or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots; or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots and special time slots; or, the N time slots are N uplink time slots starting from the starting time slot; or, the N time slots are N time slots starting from the starting time slot satisfying that all symbols in each time slot starting from the starting symbol S are available symbols; or, the N time slots are N time slots starting from the starting time slot satisfying... N time slots in each time slot are N time slots in which the L symbols starting from the start symbol S are all available symbols, or the N time slots are N time slots in which the L symbols starting from the start symbol S in the start time slot are all available symbols, and the symbols in the other time slots in the N time slots are all available symbols; or the N time slots are N time slots in which the symbols starting from the start symbol S in the start time slot are all available symbols, and the symbols in the other time slots in the N time slots are all available symbols; wherein, the start time slot is the first time slot used to transmit the data carried on the PUSCH.

[0058] In one possible implementation, the first time slot after the N time slots is the starting time slot for repeatedly transmitting the data; or, the first time slot after the N time slots containing available symbols is the starting time slot for repeatedly transmitting the data; or, the first time slot after the N time slots containing a number of available symbols greater than or equal to a fourth threshold is the starting time slot for repeatedly transmitting the data; or, the first time slot after the N time slots where L symbols starting from the initial symbol are all available symbols is the starting time slot for repeatedly transmitting the data.

[0059] In one possible implementation, the available symbols are not downlink symbols or flexible downlink-to-uplink conversion symbols.

[0060] In one possible implementation, whether to hop the data in each of the N time slots is determined based on the number of available symbols in that time slot.

[0061] In a seventh aspect, a data transmission apparatus is provided, comprising: a processing unit; the processing unit is configured to determine a first resource in a first time slot according to a time slot format and PUSCH parameters, the first resource being composed of available symbols; the processing unit is further configured to determine whether to receive PUSCH in the first resource by frequency hopping based on the number of available symbols in the first resource.

[0062] In one possible implementation, the first resource does not include downlink symbols and flexible symbols for downlink-to-uplink conversion.

[0063] In one possible implementation, the data transmission device further includes a communication unit, and the processing unit is specifically configured to: receive the PUSCH via frequency hopping within the first resource when the number of available symbols in the first resource is greater than or equal to a first threshold; and receive the PUSCH via non-frequency hopping within the first resource when the number of available symbols in the first resource is less than a second threshold, wherein the second threshold is less than or equal to the first threshold.

[0064] In one possible implementation, the apparatus further includes: a communication unit; the communication unit is configured to send first indication information, the first indication information being used to indicate a DMRS position in the first resource, the DMRS position being one or more symbols among the first to fourth available symbols in the first resource, or the DMRS position being the third to last symbol and / or the fourth to last symbol in the first resource.

[0065] In one possible implementation, the first time slot is a special time slot, and the PUSCH parameter is used to indicate the start symbol and / or the number of symbols corresponding to the special time slot.

[0066] In one possible implementation, the first time slot is one of N time slots used to receive the PUSCH or to receive a repetition of the PUSCH; the N time slots are N consecutive time slots starting from the starting time slot, or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots, or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots and special time slots, or, the N time slots are N uplink time slots starting from the starting time slot, or, the N time slots are N time slots starting from the starting time slot such that all symbols starting from the starting symbol S in each time slot are available symbols, or, the N time slots are N time slots starting from the starting time slot such that L symbols starting from the starting symbol S in each time slot are available symbols; wherein, the starting time slot is the first time slot used to receive the PUSCH or to receive a repetition of the PUSCH, and N is an integer greater than 1.

[0067] Eighthly, a data transmission apparatus is provided, comprising: a processing unit; the processing unit is configured to determine N time slots according to PUSCH parameters, where N is an integer greater than 1; the processing unit is further configured to determine whether to receive data carried on the PUSCH within the N time slots according to the time slot format of the N time slots, wherein the data transmitted within the N time slots is obtained by channel coding of a TB, and the size of the TB is determined according to the available symbols in the N time slots.

[0068] In one possible implementation, the data transmission device further includes a communication unit, and the processing unit is specifically configured to: receive the data in the N time slots through the communication unit when the starting symbol of each time slot and the symbols following the starting symbol of each time slot are all available symbols.

[0069] In one possible implementation, the data transmission device further includes a communication unit. The processing unit is specifically configured to: receive the data in the N time slots through the communication unit when all symbols starting from the start symbol in the starting time slot of the N time slots are available symbols and all symbols in the other time slots of the N time slots are available symbols.

[0070] In one possible implementation, the data transmission device further includes a communication unit. The processing unit is specifically configured to: receive the data in the starting time slot through the communication unit when all symbols starting from the starting symbol in the starting time slot of the N time slots are available symbols; and receive the data in the i-th time slot through the communication unit when all symbols in the i-th time slot of the N time slots are available symbols, where i takes the value of 2, ..., N.

[0071] In one possible implementation, the data transmission device further includes a communication unit. The processing unit is specifically configured to: receive the data in the i-th time slot through the communication unit when there are available symbols in the i-th time slot among the N time slots, where i takes the value of 1, 2, ..., N.

[0072] In one possible implementation, the data transmission device further includes a communication unit. The processing unit is specifically configured to: receive the data in the i-th time slot through the communication unit when the number of available symbols in the i-th time slot of the N time slots is greater than or equal to a third threshold, wherein the value of i is 1, 2, ..., N.

[0073] In one possible implementation, the N time slots are N consecutive time slots starting from the starting time slot; or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots; or, the N time slots are N time slots starting from the starting time slot excluding downlink time slots and special time slots; or, the N time slots are N uplink time slots starting from the starting time slot; or, the N time slots are N time slots starting from the starting time slot satisfying that all symbols in each time slot starting from the starting symbol S are available symbols; or, the N time slots are N time slots starting from the starting time slot satisfying... N time slots in each time slot are N time slots in which the L symbols starting from the start symbol S are all available symbols, or the N time slots are N time slots in which the L symbols starting from the start symbol S in the start time slot are all available symbols, and the symbols in the other time slots in the N time slots are all available symbols; or the N time slots are N time slots in which the symbols starting from the start symbol S in the start time slot are all available symbols, and the symbols in the other time slots in the N time slots are all available symbols; wherein, the start time slot is the first time slot used to receive data carried on the PUSCH.

[0074] In one possible implementation, the first time slot after the N time slots is the starting time slot for receiving the repeated data; or, the first time slot after the N time slots containing available symbols is the starting time slot for receiving the repeated data; or, the first time slot after the N time slots containing a number of available symbols greater than or equal to a fourth threshold is the starting time slot for receiving the repeated data; or, the first time slot after the N time slots where L symbols starting from the initial symbol are all available symbols is the starting time slot for receiving the repeated data.

[0075] In one possible implementation, the available symbols are not downlink symbols or flexible downlink-to-uplink conversion symbols.

[0076] In one possible implementation, whether to receive the data via frequency hopping in each of the N time slots is determined based on the number of available symbols in that time slot.

[0077] In one possible implementation, the frequency domain position corresponding to the time slot in the first time window among the N time slots is the first frequency domain position, and the frequency domain position corresponding to the time slot in the second time window is the second frequency domain position.

[0078] A ninth aspect provides a data transmission apparatus, comprising: a processor. The processor is connected to a memory for storing computer-executable instructions, and the processor executes the computer-executable instructions stored in the memory to implement any one of the methods provided in the first to fourth 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 or second aspect, the data transmission apparatus can exemplary be a terminal or a chip located inside or outside a terminal. When executing any one of the methods provided in the third or fourth aspect, the data transmission apparatus can exemplary be a network device or a chip located inside or outside a network device.

[0079] 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.

[0080] 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.

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

[0082] In a tenth 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 fourth aspects is executed.

[0083] Eleventhly, a communication system is provided, comprising: a data transmission device for performing any one of the methods provided in the first or second aspect, and a data transmission device for performing any one of the methods provided in the third or fourth aspect.

[0084] In a twelfth 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 fourth aspects.

[0085] In a thirteenth 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 fourth aspects.

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

[0087] 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

[0088] Figure 1 This is a schematic diagram illustrating actual and nominal repetition.

[0089] Figure 2 This is a schematic diagram of a frequency domain resource;

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

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

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

[0093] Figure 6 A schematic diagram of frequency hopping transmission provided in an embodiment of this application;

[0094] Figure 7 A schematic diagram illustrating a method for carrying 1 TB across multiple time slots, as provided in an embodiment of this application;

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

[0096] Figure 9 A schematic diagram of available symbols in a time slot provided for an embodiment of this application;

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

[0098] Figure 11 A schematic diagram of a resource provided in an embodiment of this application;

[0099] Figure 12 A schematic diagram illustrating yet another resource provided in an embodiment of this application;

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

[0101] Figure 14 This is a schematic diagram illustrating a method for repeatedly transmitting data, as provided in an embodiment of this application.

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

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

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

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

[0106] 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.

[0107] 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.

[0108] 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.

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

[0110] 1. Time slot

[0111] 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.

[0112] 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.

[0113] 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).

[0114] Time slots can be divided into uplink time slots, downlink time slots, and special time slots. An uplink time slot is a time slot that only includes uplink symbols, a downlink time slot is a time slot that only includes downlink symbols, and a special time slot is a time slot that includes at least two of the following: downlink symbols, uplink symbols, and flexible symbols.

[0115] 2. Resource element (RE)

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

[0117] 3. Demodulation reference signal (DMRS)

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

[0119] 4. PUSCH mapping type

[0120] 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.

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

[0122]

[0123] 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.

[0124] Table 1 can be called the Time Domain Resource Assignment (TDRA) table.

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

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

[0127] 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.

[0128] 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.

[0129] 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.

[0130] Table 2

[0131] 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

[0132] Table 3

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

[0134] If S = 10 and L = 14, then see [reference needed]. Figure 1 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 has 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 called a nominal repetition, the transmission from the 11th symbol in time slot n to the 14th symbol in time slot n is called 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 called another actual repetition (i.e., actual repetition 1).

[0135] 6. Frequency domain resource allocation for PUSCH

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

[0137] 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 2 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.

[0138] 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 3 If RB start =2, L'=3. Then the frequency domain resources occupied by PUSCH are RB2, RB3 and RB4.

[0139] 7. Redundancy version (RV)

[0140] 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.

[0141] 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.

[0142] 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.

[0143] Because the channel coding process is rather complex to describe, a simplified description is used in this application. Specifically, in the following description, if it is described as channel coding the TB based on certain available symbols, it means that the TBS is determined based on information such as the number of these available symbols, the number of RBs configured by the network device for transmitting PUSCH, and the number of DMRS resources, and then the TB is channel coded; if it is described as channel coding based on certain resources, it means that the TBS is determined based on information such as the number of available symbols in these resources, the number of RBs configured by the network device for transmitting PUSCH, and the number of DMRS resources, and then the TB is channel coded.

[0144] 8. Repeated transmission of PUSCH

[0145] 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 system bits. During repeated transmission, channel coding of the TB is performed based on L available symbols.

[0146] 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". For example, see... Figure 4 If S = 8, L = 14, and the number of repetitions = 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 denoted as a nominal repetition, and symbols within the same time slot in a nominal repetition are denoted as an actual repetition. One RV of PUSCH is transmitted on each actual repetition. One possible configuration of the RV transmitted on each actual repetition can be found in [reference needed]. Figure 4 This method can reuse all available symbols to repeatedly send PUSCH.

[0147] 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.

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

[0149] 9. RV of repeatedly sent PUSCH

[0150] 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".

[0151] Table 4

[0152]

[0153] 10. Frequency hopping

[0154] Frequency hopping refers to a change in frequency domain resources. Frequency-hopping PUSCH transmission means transmitting PUSCH using different frequency domain resources on two consecutive time domain resources. In the description of this application, frequency-hopping PUSCH transmission means transmitting PUSCH using frequency hopping within a time slot, and non-frequency-hopping PUSCH transmission means transmitting PUSCH without using frequency hopping within a time slot.

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

[0156] 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.

[0157] 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).

[0158] 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.

[0159] 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.

[0160] There are two problems with PUSCH transmission between network devices and terminals.

[0161] Question 1

[0162] When a terminal sends a PUSCH, it determines whether to perform frequency hopping based on the network device's configuration. If the network device is configured to perform frequency hopping for PUSCH, the terminal will perform frequency hopping. In this case, if the number of symbols available for sending the PUSCH is limited, the resources after frequency hopping need to carry DMRS separately, resulting in fewer resources available for sending the PUSCH and reduced resource utilization. For example, see... Figure 6In time slot n, the resources used for sending PUSCH are symbols 8 to 13. If PUSCH is sent without frequency hopping, only one of the six symbols is needed to carry DMRS. If PUSCH is sent with frequency hopping, two of the six symbols are needed to carry DMRS, which will reduce the resources available for sending PUSCH data and decrease resource utilization.

[0163] Question 2

[0164] In the above Figure 5 The 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.

[0165] One method currently being discussed for improving PUSCH coverage is to carry 1TB over multiple slots by integrating multiple slots (e.g., Figure 7 Resources in time slots (n to n+2) can use a lower bit rate when sending data carried on the PUSCH, thus requiring a lower SNR and improving PUSCH coverage. This scheme is currently only under discussion, and there is no solution yet for how to carry 1TB across multiple time slots.

[0166] Question 3

[0167] To improve PUSCH coverage, besides carrying 1 TB across multiple time slots, PUSCH can also be repeatedly transmitted within multiple time slots. The more repetitions, the more symbols can be included in the PUSCH, thus appropriately reducing the SNR and improving PUSCH coverage. Currently, determining the multiple time slots for transmitting or repeatedly transmitting PUSCH is also a problem that needs to be solved.

[0168] To address the aforementioned problems, this application provides a data transmission method, which can be implemented through either Embodiment 1 or Embodiment 2. In Embodiment 1, the terminal can determine whether to frequency-hop send PUSCH based on the number of available symbols. Frequency-hopping PUSCH can be sent when the number of symbols is large, while non-frequency-hopping PUSCH can be sent when the number of symbols is small, thereby improving resource utilization and solving Problem 1. Embodiment 2 provides a scheme for carrying 1TB across multiple time slots, solving Problem 2. Embodiment 3 provides a method for determining multiple time slots for sending PUSCH or repeatedly sending PUSCH, solving Problem 3. The methods provided in Embodiments 1, 2, and 3 are described below.

[0169] Example 1

[0170] See Figure 8 The method provided in Example 1 includes:

[0171] 801. 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.

[0172] 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.

[0173] The time slot format is used to indicate the type of each symbol in 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 are used to 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 are used to determine PUSCH time-domain resources, and frequency-domain parameters are used to determine PUSCH frequency-domain resources. Time-domain parameters may include one or more of the following information: information indicating the number of time slots (see Embodiment 2 for details), repetition count, and an index corresponding to the starting symbol S, the number of symbols L, and K2 (e.g., a row index in Table 2). The number of time slots refers to the number of time slots carrying one TB. When multiple time slots carry one TB, channel coding is performed on the TB based on some or all available symbols in the multiple time slots, and PUSCH (i.e., channel-coded data) is transmitted on multiple time slots. Frequency-domain parameters include parameters indicating PUSCH frequency-domain resources (e.g., bitmap, RB). startFor 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.

[0174] The PUSCH parameter can be carried in RRC signaling and / or DCI.

[0175] 802. The terminal determines the first resource in the first time slot according to the time slot format and PUSCH parameters. The first resource consists of available symbols.

[0176] The first time slot can be an uplink time slot or a special time slot (e.g., a downlink-to-uplink time slot), and this application does not impose any restrictions. The first resource includes uplink symbols and some flexible symbols, but does not include downlink symbols and flexible symbols for downlink-to-uplink conversion. The available symbols in the first resource are continuous in the time domain. The first resource in this application refers to the time domain resource. The terminal can determine the frequency domain resource corresponding to the first resource based on the frequency domain parameters. For details, please refer to the above section on frequency domain resource allocation for PUSCH, which will not be repeated here.

[0177] The first time slot can be determined through either Case 1 or Case 2. The following explains Case 1 and Case 2, as well as the determination of the first resource in the first time slot under these two cases:

[0178] Case 1: When PUSCH is sent only in one time slot, that time slot is the first time slot.

[0179] In scenario 1, the terminal can determine the time slot for sending the PUSCH as time slot n based on the time domain parameter K2 and the time slot where the DCI for scheduling the PUSCH resides (assuming it's time slot n-K2). In one case, the first resource consists of the available symbols within time slot n. In another case, the terminal can also determine the first resource based on the time slot format and the starting symbol S and the number of symbols L (S+L less than or equal to 14) indicated by the time domain parameter. If all L symbols in time slot n starting from the starting symbol S are available symbols, then the first resource is the L symbols in time slot n starting from the starting symbol S. For example, see... Figure 9 If S = 2 and L = 10, and if the 10 symbols starting from the initial symbol S (i.e., symbols 2 to 11) are all available symbols, then symbols 2 to 11 in time slot n are determined as the first resource.

[0180] Case 2: The first time slot is one of N time slots, where N is an integer greater than 1.

[0181] Among them, the N time slots can have the following situations:

[0182] (1) N time slots are N consecutive time slots starting from the initial time slot.

[0183] (2) N time slots are N time slots starting from the initial time slot, excluding the downlink time slot.

[0184] (3) N time slots are N time slots starting from the initial time slot, excluding downlink time slots and special time slots.

[0185] (4) N time slots are N uplink time slots starting from the initial time slot.

[0186] (5) The N time slots are N time slots starting from the initial time slot, where all symbols in each time slot starting from the initial symbol S are available symbols. In other words, all symbols in each of these N time slots starting from the initial symbol S are available symbols.

[0187] (6) The N time slots are N time slots starting from the initial time slot, where all L symbols in each time slot, starting from the initial symbol S, are available symbols. In other words, all L symbols in each of these N time slots, starting from the initial symbol S, are available symbols.

[0188] (7) N time slots are L*X available symbols starting from the initial symbol S in the initial time slot. Where X is the number of time slots or the number of repetitions. For example, based on... Figure 10 The time slot format shown, if the starting time slot is time slot n, S=8, L=14, and the number of repetitions or time slots is 4, then the N time slots are time slot n to time slot n+5.

[0189] (8) N time slots are N time slots that satisfy the condition that the L symbols starting from the start symbol S in the initial time slot are all available symbols, and the symbols in the other time slots of the N time slots are all available symbols. That is to say, the L symbols starting from the start symbol S in the initial time slot of these N time slots are all available symbols, and the symbols in the second to Nth time slots of these N time slots are all available symbols.

[0190] (9) N time slots are N time slots that satisfy the condition that all symbols in the initial time slot starting from the initial symbol S are available symbols, and all symbols in the other time slots of the N time slots are available symbols. That is to say, all symbols in the initial time slot starting from the initial symbol S of these N time slots are available symbols, and all symbols in the second to Nth time slots of these N time slots are available symbols.

[0191] (10) N time slots are N time slots with available symbols starting from the initial time slot. That is, each of the N time slots has available symbols.

[0192] (11) The N time slots are N time slots starting from the initial time slot that satisfy the condition that the number of available symbols is greater than or equal to the fifth threshold. That is, the number of available symbols in each of the N time slots is greater than or equal to the fifth threshold. Here, "greater than or equal to" can also be replaced with "greater than". The fifth threshold can be preset, or specified by the protocol, or determined by negotiation between the network device and the terminal, and this application does not impose any restrictions.

[0193] It should be noted that the value of N can be configured directly or indirectly by the PUSCH parameter. N can also be determined by the terminal itself. For example, if the PUSCH parameter is configured with N', the terminal can determine N time slots based on the time slot format. For example, the terminal determines all time slots within the N' time slots starting from the initial time slot that satisfy the characteristics described in one of the above cases as the N time slots in that case. For example, for case (1), consecutive time slots within the N' time slots starting from the initial time slot are N time slots, and these N time slots are the N' time slots. For case (2), all time slots within the N' time slots starting from the initial time slot that are not downlink time slots are N time slots. For case (3), all time slots within the N' time slots starting from the initial time slot that are not downlink time slots or special time slots are N time slots. For case (4), all uplink time slots within the N' time slots starting from the initial time slot are N time slots. For case (5), the total number of time slots within the N' time slots starting from the initial time slot, where all symbols starting from the initial symbol S are available symbols, is N time slots. Other cases can be derived similarly and will not be elaborated further.

[0194] In cases (5) to (9) above, S and L can be configured as PUSCH parameters.

[0195] In case (1), there may be unusable time slots among the N time slots. For example, if there is a downlink time slot among the N time slots, then that time slot cannot be used to send PUSCH. In contrast to case (1), in cases (2) to (11), all N time slots can be used to send PUSCH. If the N time slots are the N time slots described in case (1), then the time slots among the N time slots that meet certain conditions are used to send PUSCH. The condition is either that the L symbols starting from the start symbol S in the time slot are available symbols (that is, for each of the N time slots, the time slot can be used to transmit PUSCH only if the L symbols starting from the start symbol S in that time slot are available symbols), or that the time slot has available symbols (that is, for each of the N time slots, the time slot can be used to transmit PUSCH only if the time slot has available symbols), or that all symbols starting from the start symbol S in the time slot are available symbols (that is, for each of the N time slots, the time slot can be used to transmit PUSCH only if all symbols starting from the start symbol S in that time slot are available symbols).

[0196] The terminal can determine the starting time slot for 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).

[0197] In the first scenario, N time slots are used to transmit PUSCH. "N time slots used to transmit PUSCH" means transmitting data after channel coding of the TB (Block Token) on N time slots. This TB is channel coded based on some or all of the available symbols in the N time slots. Specifically, the TB can be channel coded based on all available symbols in the N time slots, or based on the available symbols used for transmitting PUSCH in the N time slots, or based on all available symbols in a portion of the N time slots (e.g., consecutive uplink time slots), or based on the available symbols used for transmitting PUSCH in a portion of the N time slots (e.g., consecutive uplink time slots). For example, assuming the TB is channel coded based on all available symbols in the N time slots, if the N time slots are... Figure 11 The data transmitted in the 6 time slots and N time slots shown can be based on Figure 11 The data after channel coding of TB using available symbols from resources 0 to 5. For example, suppose the TB is channel coded based on available symbols for transmitting PUSCH in N time slots. If N time slots are... Figure 12The six time slots shown are assumed to have L available symbols for transmitting PUSCH in each of the N1 time slots, starting from the start symbol S. The N1 time slots are defined as the N time slots where all L symbols starting from the start symbol S are available. If S = 2 and L = 10, then the number of available symbols for transmitting PUSCH in the N time slots is... Figure 12 In the context of resources 0 to 3, the data transmitted on N time slots can be the data after channel coding of the TB based on resources 0 to 3. For example, suppose the TB is channel coded based on all available symbols in consecutive uplink time slots within N time slots. If N time slots are... Figure 12 The data transmitted in the six time slots shown can be channel-coded data of TB based on the available symbols in time slots n+1 and n+2.

[0198] In the first scenario, the terminal can determine N time slots based on the information in the PUSCH parameters that indicates the number of time slots, or the information in the PUSCH parameters that indicates the number of time slots and the time slot format (specifically, the value of N is determined based on the information that indicates the number of time slots, and the time slot format is determined to determine which time slots are the N time slots, or, based on S and L, L*X available symbols are determined starting from the start symbol S in the start time slot, and then N time slots are determined based on these available symbols, where X is the number of time slots).

[0199] In the second scenario, N time slots are used for repeated PUSCH transmission. "N time slots for repeated PUSCH transmission" means transmitting data on N time slots after channel coding of the TB using available symbols from a specific time slot (e.g., the first time slot, or the time slot with the most available symbols). Alternatively, "N time slots for repeated PUSCH transmission" means transmitting data on N time slots after channel coding of the TB using L available symbols. In this case, the terminal can determine the N time slots based on the repetition count in the PUSCH parameters, or the repetition count and time slot format in the PUSCH parameters (specifically, the value of N is determined by the repetition count, and the time slots are determined by the time slot format; or, based on S and L, L*X available symbols starting from the initial symbol S in the initial time slot are determined, and then N time slots are determined based on these available symbols, where X is the repetition count).

[0200] The first time slot can be an uplink time slot or a special time slot among N time slots.

[0201] The first resource can be a resource composed of available symbols in the first time slot. For example, N time slots are... Figure 11 The six time slots shown can be configured such that if the first time slot is time slot n, the first resource can be resource 0; if the first time slot is time slot n+1, the first resource can be resource 1.

[0202] The first resource can also be a resource consisting of L available symbols starting from the start symbol S in the first time slot. In this case, the first time slot is a time slot where all L symbols starting from the start symbol S are available symbols. For example, N time slots are... Figure 12 The six time slots shown are such that if the first time slot is time slot n+1, then the first resource is resource 0; if the first time slot is time slot n+2, then the first resource is resource 1.

[0203] The first resource can also be the resource in the first time slot used to send the same RV. In this case, the first resource is also the resource corresponding to an actual duplication. For example, N time slots are... Figure 10 The six time slots shown can be configured such that if the first time slot is time slot n, the first resource can be resource 0; if the first time slot is time slot n+1, the first resource can be either resource 1 or resource 2.

[0204] 803. The network device determines the first resource in the first time slot based on the time slot format and PUSCH parameters.

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

[0206] Step 803 can be performed after step 802 or before step 802, and this application does not impose any restrictions.

[0207] 804. The terminal determines whether to send PUSCH in the first resource by frequency hopping based on the number of available symbols in the first resource.

[0208] 805. The network device determines whether to receive PUSCH via frequency hopping within the first resource based on the number of available symbols in the first resource.

[0209] Optionally, step 804 may include: if the number of available symbols in the first resource is greater than or equal to a first threshold, the terminal enables frequency hopping, i.e., transmits PUSCH via frequency hopping within the first resource; if the number of available symbols in the first resource is less than a second threshold, the terminal disables frequency hopping, i.e., transmits PUSCH without frequency hopping within the first resource. Correspondingly, step 805 may include: if the number of available symbols in the first resource is greater than or equal to the first threshold, the network device receives PUSCH via frequency hopping within the first resource; if the number of available symbols in the first resource is less than the second threshold, the network device receives PUSCH without frequency hopping within the first resource.

[0210] Wherein, the second threshold is less than or equal to the first threshold. In this optional method, "greater than or equal to the first threshold" can also be replaced with "greater than the first threshold," and in this case, "less than the second threshold" can also be replaced with "less than or equal to the second threshold." "Non-frequency hopping within the first resource" means no frequency hopping within a time slot, but frequency hopping may or may not occur between time slots. "Frequency hopping within the first resource" means frequency hopping within a time slot, but frequency hopping may or may not occur between time slots.

[0211] The PUSCH parameter can also be configured to transmit PUSCH via frequency hopping.

[0212] Optionally, the PUSCH parameter indicates the number of symbols in the PUSCH and / or the number of symbols occupied by DMRS, and the first threshold and / or the second threshold are related to the number of symbols in the PUSCH and / or the number of symbols occupied by DMRS. The number of symbols in the PUSCH can be the aforementioned number of symbols L. The larger the number of symbols occupied by DMRS, the larger the first threshold and / or the second threshold can be; similarly, the larger the number of symbols in the PUSCH, the larger the first threshold and / or the second threshold can be. The first threshold and the second threshold are generally the same. For example, if the first threshold and / or the second threshold are only related to the number of symbols in the PUSCH, the first threshold and / or the second threshold can be, for example, […]. or or Etc. If the first and second thresholds are only related to the number of symbols occupied by DMRS, then if DMRS occupies 2 symbols, the first and second thresholds can be 10; if DMRS occupies 1 symbol, the first and second thresholds can be 8. If the first and second thresholds are related to the number of symbols in PUSCH and the number of symbols occupied by DMRS, the first and second thresholds can be, for example, or S refers to the number of symbols occupied by DMRS.

[0213] The first threshold and / or the second threshold may also be preset, or specified by the protocol, or determined through negotiation between the network device and the terminal, or indicated by the network device; this application does not impose any restrictions. If indicated by the network device, the network device may notify the terminal of the first threshold and / or the second threshold through configuration signaling such as RRC or indication signaling such as DCI.

[0214] In step 804, regardless of the number of available symbols in the first resource, the terminal will ultimately send PUSCH; the difference lies only in whether it is frequency-hopping or non-frequency-hopping PUSCH. An alternative implementation of step 804 is as follows: the terminal determines whether to send PUSCH within the first resource based on the number of available symbols. In this implementation, if the PUSCH parameter is configured for frequency-hopping PUSCH and the number of available symbols in the first resource is greater than or equal to (or greater than) a sixth threshold, the terminal sends PUSCH within the first resource; otherwise, the terminal does not send PUSCH within the first resource. If the PUSCH parameter is configured for non-frequency-hopping PUSCH and the number of available symbols in the first resource is greater than or equal to (or greater than) a seventh threshold, the terminal sends PUSCH within the first resource; otherwise, the terminal does not send PUSCH within the first resource. When the terminal determines to send PUSCH within the first resource, whether to send PUSCH via frequency hopping depends on the configuration of the PUSCH parameter.

[0215] The sixth threshold can be greater than the seventh threshold. For example, if the sixth threshold is denoted as Y2, the seventh threshold as Y1, and the number of symbols occupied by DMRS as S, then Y2 = Y1 + S. The sixth and / or seventh thresholds can also be preset, or specified by the protocol, or determined through negotiation between the network device and the terminal; this application does not impose any restrictions.

[0216] In the above embodiments, the value of S can be as follows: if the network device is configured with a single-symbol DMRS (i.e., one DMRS occupies 1 symbol) and has no additional DMRS, then S = 1; if the network device is configured with a double-symbol DMRS (i.e., one DMRS occupies 2 symbols) and has no additional DMRS, then S = 2; if the network device is configured with a single-symbol DMRS and has additional DMRS, then S = 2; if the network device is configured with a double-symbol DMRS and has additional DMRS, then S = 4.

[0217] The alternative implementation of step 804 specifies the lower limit of the available symbols for transmitting PUSCH in both frequency hopping and non-frequency hopping cases.

[0218] In the above embodiments, after the terminal determines that it needs to hop the PUSCH within the first resource, in one implementation, the hopping position of the terminal can be related to the number of available symbols in the time slot to which the first resource belongs. For example, if the number of available symbols in the time slot is K, then the hopping position can be the Kth available symbol. or The number of symbols. In another implementation, the frequency hopping position of the terminal can be related to the number of configured symbols L. For example, the frequency hopping position can be the Lth symbol in the time slot to which the first resource belongs. or or A symbol.

[0219] It should be noted that special time slots exist in time-domain resource configuration. For example, in a downlink-to-uplink time slot, the ratio of downlink symbols: flexible symbols: uplink symbols is 10:2:2 or 6:4:4. When special time slots exist among N time slots, and resources in these special time slots need to be used to send PUSCH, the uplink symbols in the special time slot are located in the last few symbols of the special time slot. Since the start symbol S corresponding to Type A is 0, if the start symbol S and the number of symbols L corresponding to Type A are used to determine the resources in the special time slot, it is highly likely that the special time slot cannot be used for PUSCH transmission, resulting in wasted resources.

[0220] Therefore, a start symbol S and the number of symbols L can be configured directly or indirectly for a special time slot, specifically through any of the methods 11 to 13 below. For ease of description in this application, the start symbol S configured for the special time slot (which can also be described as the start symbol S corresponding to the special time slot) is denoted as S. S The number of symbols L allocated for a special time slot (which can also be described as the number of symbols L corresponding to the special time slot) is denoted as L. S .

[0221] Method 11: Directly configure the start symbol S corresponding to the special time slot S And / or number of symbols L S .

[0222] When only S is configured S The time indicates the symbol S from a special time slot. S All available symbols at the beginning are used to send PUSCH; when only L is configured S The time indicates the symbol (14-L) from a special time slot. S L starting with ) S The available symbols among the symbols are used to send PUSCH; when S is configured... S L is also configured S The time indicates the symbol S from a special time slot. S The beginning of L S The available symbols among the symbols are used to send PUSCH.

[0223] Method 12: Configure the start symbol S corresponding to the special time slot S And the number of symbols L corresponding to special time slots S The sum of the number of uplink symbols in the next time slot (denoted as L2 here because this number of symbols has a different meaning than the existing number of symbols). At this time, For example, time slot n is a special time slot, and time slot n+1 is an uplink time slot. The terminal determines the time slot based on S. S The values ​​of L2 and S2 can be used to calculate the number of PUSCH symbols transmitted in a specific time slot. If S... S =10, L2=18=L S +14, in special time slots, S is used. S =10, L S =4 sends PUSCH. In the uplink time slot, PUSCH is sent with S=0 and L=14. If S S =12, L2=16=L S +14, in special time slots, S is used. S =12, L S =2 sends PUSCH, and on the uplink time slot, PUSCH is sent with S=0 and L=14.

[0224] Method 13: When sending PUSCH on N time slots or repeatedly sending PUSCH, configure the start symbol S in the start time slot and the total number of symbols for PUSCH resources (since the meaning of this number of symbols is different from the existing number of symbols, it is denoted as L3 here).

[0225] If the starting time slot in a group of N time slots is a special time slot, and the other time slots are uplink time slots, then the configured starting symbol S is S_0.05. S L S =14-S S At this point, L3 = (14 - S) S )+(N-1)*14. If the network device does not configure N for the terminal, then

[0226] If the first time slot in a set of N time slots is a special time slot, and the other time slots include an uplink time slot and another special time slot, then the S corresponding to the first special time slot... S That is, the configured start symbol S, and the L corresponding to the first special time slot. S =14-S S At this point, L3 = (14 - S) S )+(N-2)*14+L S2 L S2 This refers to the number of symbols corresponding to the second special time slot. If the network device has not configured N for the terminal, then... The second special time slot corresponds to The start symbol corresponding to the second special time slot is S. S2 =14-L S2 .

[0227] If one of the N time slots (excluding the initial time slot) is a special time slot, then L3 = (14-S) + (N-2)*14 + L SAt this point, if the network device is configured with N for the terminal, then L can be determined. S = L3 - (14 - S) - (N - 2) * 14, if the network device does not configure N for the terminal, then L S =L3-(14-S)-(N-2)*14, where the starting symbol for the special time slot is S. S =14-L S .

[0228] If the starting time slot in N time slots is a special time slot, and the L symbols in the other N time slots, starting from the start symbol S, are used to transmit PUSCH, then the configured start symbol S is S0. S L S =14-S S At this point, L3 = (14 - S) S )+L*(N-1). If the network device does not configure N for the terminal, then

[0229] If one of the N time slots (excluding the start time slot) is a special time slot, and L symbols from the start symbol S in the other N time slots are used to send PUSCH, then L3 = (14-S) + L*(N-2) + L S At this point, if the network device is configured with N for the terminal, then L can be determined. S =L3-(14-S)-L*(N-2), if the network device does not configure N for the terminal, then Then L S =L3-(14-S)-L*(N-2), where the starting symbol for the special time slot is S. S =14-L S .

[0230] Methods 11 and 12 enable the terminal to determine S S and L S In method 13, the terminal can not only determine S S and L S Furthermore, N can be determined. Therefore, in mode 13, the network device may not need to configure N for the terminal, but can indirectly indicate the value of N through L3.

[0231] In specific implementations of methods 11 to 13, the network device can send configuration information to the terminal. This configuration information is used to configure the start symbol S corresponding to a special time slot. S And / or number of symbols L S The terminal determines the start symbol S corresponding to the special time slot based on this configuration information. S And / or number of symbols L SThe value configured in this information can be the same as the value configured in the corresponding method.

[0232] In the specific implementation of method 11, a time-domain resource allocation table similar to Table 1 can be configured separately for special time slots. For example, a new parameter "startSymbol_special_slot" can be added to the PUSCH configuration parameters in 3GPP TS38.331 to configure the starting symbol corresponding to the special time slot, and a new parameter "length_special_slot" can be added to configure the symbol length corresponding to the special time slot. In the specific implementation of method 12 or method 13, if L2 or L3 is greater than 14, a row for the value range of L can be added to Table 1. This value range of L refers to some possible values ​​of L2 or L3 configured in method 12 or method 13.

[0233] The values ​​configured in any of the methods 11 to 13 above can also be configured in Table 2 above. For example, by configuring the RRC signaling, add one (or more) rows of values ​​configured in any of the methods 11 to 13 to Table 2.

[0234] Optionally, the PUSCH parameter can also be used to indicate the start symbol and / or the number of symbols corresponding to a special time slot. In this case, if the first time slot is a special time slot, the terminal can determine the start symbol and / or the number of symbols corresponding to the first time slot based on the PUSCH parameter. For example, when the value configured in any of modes 11 to 13 is configured in Table 2 above, the PUSCH parameter can carry a row index from Table 2, and the parameter corresponding to this row index can directly or indirectly indicate the start symbol and the number of symbols corresponding to the special time slot.

[0235] Optionally, the method further includes: the network device sending first indication information to the terminal, the first indication information indicating the location of the DMRS in the first resource, wherein the DMRS location is one or more symbols (the symbols may be consecutive or non-consecutive) among the first to fourth available symbols in the first resource, or the DMRS location is the third-to-last symbol and / or the fourth-to-last symbol in the first resource. Correspondingly, the terminal receives the first indication information from the network device. In subsequent processes, the terminal can determine the location of the DMRS in the transmitted PUSCH based on the first indication information.

[0236] This alternative method can solve the problem of how DMRS is sent when PUSCH is sent using the method described in this application.

[0237] In existing technology, when PUSCH is repeatedly transmitted, if the PUSCH mapping type is Type A, the 3rd (with a value of 2) or 4th (with a value of 3) symbol in each time slot is configured to carry DMRS via the parameter "dmrs-TypeA-Position". However, since the first few symbols in a special time slot may be downlink symbols, this configuration is not applicable, and therefore the position of DMRS in the special time slot needs to be redefined. This alternative method can also solve this problem. For example, the following methods can be used:

[0238] Method 21: A value of 2 for “dmrs-TypeA-Position” indicates that the third symbol of the PUSCH resource is used to send DMRS, and a value of 3 for “dmrs-TypeA-Position” indicates that the fourth symbol of the PUSCH resource is used to send DMRS.

[0239] Method 22: A value of 2 for “dmrs-TypeA-Position” indicates that the first symbol of the PUSCH resource is used to send DMRS, and a value of 3 for “dmrs-TypeA-Position” indicates that the second symbol of the PUSCH resource is used to send DMRS.

[0240] Method 23: A value of 2 for “dmrs-TypeA-Position” indicates that the second symbol of the PUSCH resource is used to send DMRS, and a value of 3 for “dmrs-TypeA-Position” indicates that the third symbol of the PUSCH resource is used to send DMRS.

[0241] In Method 24, a value of 2 for the "dmrs-TypeA-Position" configuration indicates that the third symbol of the PUSCH resource is used to send DMRS, and a value of 3 for the "dmrs-TypeA-Position" configuration indicates that the fourth symbol of the PUSCH resource is used to send DMRS.

[0242] The method provided in Example 1 illustrates the correlation between frequency hopping and available symbols. The terminal can determine whether to hop the PUSCH based on the number of available symbols in the time slot. It can hop the PUSCH when there are many symbols and hop the PUSCH when there are few symbols, thereby improving resource utilization.

[0243] The PUSCH mapping type in the method provided in Example 1 can be either Type A or Type B.

[0244] In the specific implementation of the method provided in Example 1, the terminal can determine each resource in each of the N time slots and decide whether to hop the PUSCH within that resource based on the number of available symbols in that resource. Alternatively, the terminal can determine some or all resources in some of the N time slots and decide whether to hop the PUSCH within that resource based on the number of available symbols in that resource. Since there may be multiple resources in a single time slot, the method for determining the resources in each time slot is similar to the method for determining the first resource in the first time slot, and will not be described again.

[0245] The method provided in Embodiment 1 allows the terminal to determine whether to transmit PUSCH within the first resource by frequency hopping based on the number of available symbols in the first resource. It can transmit PUSCH by frequency hopping when there are many symbols and transmit PUSCH without frequency hopping when there are few symbols, thereby improving resource utilization.

[0246] Example 2

[0247] The solution of carrying 1TB across multiple time slots is currently only in the discussion stage. There are two problems regarding how to implement carrying 1TB across multiple time slots:

[0248] Problem 1: Since the PUSCH resource spans multiple time slots, the number of symbols is greater than 14, while the L in the original combination of S and L is less than or equal to 14. Therefore, how to indicate the number of symbols in the PUSCH resource or the number of time slots spanned by 1 TB with low overhead is a problem to be solved.

[0249] Question 2: Since one TB spans multiple time slots, how to determine the resources for transmitting the channel-coded data of that TB, i.e., the resource abandonment criteria involved in the transmission of this data, requires further design. Similarly, how to determine the resources for repeated transmission when repeatedly transmitting the channel-coded data of that TB also requires further design.

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

[0251] 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.

[0252] The relevant description of step 1301 can be found in step 801 above. The only difference is that the time-domain parameters do not need to include the repetition count. In some cases, the time-domain parameters may also not include an index corresponding to the start symbol S, the number of symbols L, and K2. This can be referred to for understanding, and will not be elaborated further. If the time-domain parameters include the repetition count but not the information indicating the number of time slots, the repetition count can also be determined as the number of time slots.

[0253] The PUSCH parameter can be carried in RRC and / or DCI.

[0254] The time-domain parameters may include information indicating the number of time slots, which can be indicated in the following three ways.

[0255] Method 31: When configuring the time-domain resource allocation table (e.g., Table 1 or Table 2 above), additionally configure the number of time slots covered by the TB. For example, add a new parameter to configure the number of time slots N, which indicates that the TB is carried across N time slots. In this case, the value of N is indicated by the PUSCH parameter.

[0256] Method 32: When configuring the time-domain resource allocation table (e.g., Table 1 or Table 2 above), configure L as the sum of the number of symbols used for transmission in the initial time slot and 14*(N-1). Since L differs from that in the prior art, it is denoted as L1. For example, by adding one or more rows to Table 2, each row can indicate one L1, and each row can also be configured with an S to indicate the starting symbol in the initial time slot. For example, if S=8 and L1=32, then... That is, N=3, and the length of the symbols used for transmission in the initial time slot is 32-14*(N-1)=4, meaning that the 4 symbols starting from the start symbol S in the initial time slot are used to transmit data. In this case, L1 can be indicated by the PUSCH parameter, and the value of N is determined according to the number of symbols L1 indicated by the PUSCH parameter.

[0257] Method 33: When configuring the time-domain resource allocation table (e.g., Table 1 or Table 2 above), L is configured as the sum of the number of symbols used for transmission in the initial time slot and N-1. Since L differs from that in the prior art, it is denoted as L1. For example, one or more rows can be added to Table 2, each indicating one L1. Each row can also be configured with an S to indicate the starting symbol in the initial time slot. In Method 33, by default, symbols starting from the starting symbol S in the initial time slot are used for transmission. Therefore, L1 = (N-1) + (14-S), and N can be calculated from L1. For example, if S = 8 and L1 = 8, the number of symbols used for transmission in the initial time slot is 14-S = 6, meaning the 6 symbols starting from S in the initial time slot are used for data transmission. Thus, N-1 = L1 - (14-S) = 2, and N = 3. In this case, L1 can be indicated by the PUSCH parameter, and the value of N is determined based on the number of symbols L1 indicated by the PUSCH parameter.

[0258] Compared to methods 32 and 33, method 31 requires the introduction of an additional parameter indicating N, while methods 32 and 33 do not require an additional parameter indicating N, as N can be indicated by L1. Method 33 assumes that all symbols starting from the start symbol S in the start time slot are used for transmission. Therefore, the value range of L1 in method 33 is smaller than that of L1 in method 32, thus saving a certain number of bits.

[0259] Additionally, L1 in methods 32 and 33 can also indicate the PUSCH resources used for data transmission. For example, L1 in method 32 can indicate that L1-14*(N-1) symbols in the starting time slot, starting from the start symbol S, are used for data transmission, and all available symbols in the second to Nth time slots out of the N time slots are used for data transmission. Similarly, L1 in method 33 can indicate that all available symbols in the starting time slot, starting from the start symbol S, are used for data transmission, and all available symbols in the second to Nth time slots out of the N time slots are used for data transmission. It is understandable that methods 32 and 33 require fewer bits compared to directly indicating the number of symbols in the PUSCH resources, thus saving a certain number of bits.

[0260] In specific implementations of methods 31 to 33, the network device can send configuration information to the terminal. This configuration information is used to configure the value of N (corresponding to method 31) or L1 (corresponding to method 32 or method 33). The terminal determines the value of N or L1 based on this configuration information. The value configured in this configuration information can be the value configured in the corresponding method.

[0261] 1302. The terminal determines N time slots based on the PUSCH parameters.

[0262] In specific implementations of step 1302, in some cases, the terminal needs to determine N time slots based on the PUSCH parameters and time slot format.

[0263] The process of the terminal determining N time slots can be found in Example 1 and will not be repeated here. The N time slots can also be any of the cases (1) to (11) in Example 1.

[0264] 1303. The network device determines N time slots based on the PUSCH parameters.

[0265] When implementing step 1303, you can refer to step 1302 for understanding. The only difference is that this step involves a network device.

[0266] Step 1303 can be performed after step 1302 or before step 1302, and this application does not impose any restrictions.

[0267] 1304. The terminal determines whether to transmit the data carried on the PUSCH within the N time slots based on the time slot format of the N time slots. The data transmitted within the N time slots is obtained by channel coding the TB, and the size of the TB is determined based on the available symbols in the N time slots. In other words, the data is channel coded based on the available symbols in the N time slots. The TBS can be determined based on information such as the number of available symbols in the N time slots, the number of RBs configured in the network device for transmitting the PUSCH, and the number of DMRS resources.

[0268] The data transmitted within N time slots can be channel-coded data based on all available symbols in the N time slots, or channel-coded data based on a subset of available symbols in the N time slots. For details, please refer to the relevant description in Example 1, which will not be repeated here.

[0269] In practice, step 1304 can be implemented in the following ways:

[0270] Method 41: If the first condition is met, transmit data within N time slots; otherwise, determine not to transmit data in the N time slots. The first condition is: the starting symbol of each of the N time slots and all symbols following the starting symbol of each time slot are available symbols.

[0271] Method 42: If the second condition is met, transmit data within N time slots; otherwise, determine not to transmit data in N time slots. The second condition is: all symbols starting from the start symbol in the starting time slot of the N time slots are available symbols, and all symbols in the other time slots of the N time slots are available symbols (or, in other words, the start symbol and the N*14-S symbols following the start symbol).

[0272] Method 43: If the third condition is met, data is transmitted in the starting time slot; otherwise, data is determined not to be transmitted in the starting time slot. If the fourth condition is met, data is transmitted in the i-th time slot; otherwise, data is determined not to be transmitted in the i-th time slot, where i takes the value 2, ..., N. Here, S is the index of the starting symbol, indicated by the PUSCH parameter. The third condition is: all symbols starting from the starting symbol in the starting time slot out of the N time slots are available symbols. The fourth condition is: all symbols in the i-th time slot out of the N time slots are available symbols.

[0273] Method 44: If the fifth condition is met, transmit data in the i-th time slot; otherwise, determine not to transmit data in the i-th time slot. The value of i is: 1, 2, ..., N. The fifth condition is: the number of available symbols in the i-th time slot out of N time slots is greater than or equal to the third threshold. "Greater than or equal to" in the fifth condition can also be replaced with "greater than".

[0274] Method 45: If the sixth condition is met, transmit data in the i-th time slot; otherwise, determine not to transmit data in the i-th time slot. The value of i is 1, 2, ..., N. The sixth condition is: there are available symbols in the i-th time slot among the N time slots.

[0275] Of the methods 41 to 45 described above, methods 41 and 42 are multi-slot level rules, methods 43 and 44 are single-slot level rules, and method 45 is a symbol level rule. It should be noted that for any of methods 41 to 45, if the terminal has already determined that N time slots meet the conditions corresponding to the method during the process of determining the N time slots, then it is not necessary to perform the corresponding condition check again before sending data.

[0276] Optionally, in methods 41 to 45 above, the terminal may also send data only if the conditions corresponding to the respective method are met, and the total number of available symbols in the N time slots is greater than or equal to (here, "greater than or equal to" can also be replaced with "greater than") an eighth threshold. The third threshold and / or the eighth threshold can be preset, or specified by the protocol, or determined through negotiation between the network device and the terminal; this application does not impose any restrictions. It is understood that if the terminal sends data when certain conditions are met, the network device also receives data when those conditions are met; to avoid repetition, this will not be elaborated further.

[0277] The conditions in methods 41 to 45 described above can also be used to determine PUSCH resources. Specifically, if the conditions in methods 41, 42, or 43 are met, data is transmitted within the L symbols starting from the start symbol S in each time slot; or, data is transmitted within all available symbols in each time slot; or, data is transmitted on the L symbols starting from the start symbol S in the starting time slot and on available symbols in the other N time slots; or, data is transmitted on all available symbols starting from the start symbol S in the starting time slot and on available symbols in the other N time slots. If the conditions in methods 44 or 45 are met, if all L symbols starting from the start symbol S in a time slot are available, data is transmitted within the L symbols starting from the start symbol S in that time slot; or, data is transmitted within all available symbols in that time slot. If there are unavailable symbols among the L symbols starting from the start symbol S in that time slot, data can be transmitted within all available symbols in that time slot.

[0278] Optionally, if S=0 or S is not configured in any of the conditions, then it can be assumed that all 14 symbols in each of the N time slots are available symbols before they can be used to send data.

[0279] 1305. The network device determines whether to receive the data carried on the PUSCH within the N time slots based on the time slot format of the N time slots. The data transmitted within the N time slots is obtained by channel coding of the TB. The size of the TB is determined based on the available symbols in the N time slots.

[0280] Example 2 also provides a method for determining the starting time slot for repeatedly transmitting data, which may include the following options:

[0281] Case 1: The first time slot after N time slots is the starting time slot for retransmitting data. For example, see... Figure 14 In (a), if N=2, the first data transmission starts from time slot n and covers 2 time slots to time slot n+1. The retransmission starts from time slot n+2 and covers 2 time slots to time slot n+3. The next retransmission starts from time slot n+4 and covers 2 time slots to time slot n+5.

[0282] Case 2: The first available symbol after N time slots is the starting time slot for retransmitting data. See, for example... Figure 14 In (b), if N=2, the first transmission starts from time slot n and covers 2 time slots to time slot n+1. The retransmission starts from the next time slot with available symbols, that is, starting from time slot n+3 and covering 2 time slots to time slot n+4. During this period, since time slot n+2 is a downlink time slot and has no uplink symbols, it is not used as the starting time slot for retransmission.

[0283] Case 3: The first time slot after N time slots, where the number of available symbols is greater than or equal to (or can be replaced by greater than) the fourth threshold, is the starting time slot for retransmitting data. The fourth threshold can be preset, specified by the protocol, or determined through negotiation between the network device and the terminal; this application does not impose any restrictions.

[0284] Case 4: The first time slot after N time slots, starting with the first symbol, is the first available time slot for repeatedly transmitting data. The method provided in Example 2 solves the problem of determining the resources for transmitting channel-coded data for a TB spanning multiple time slots, and how to indicate the number of symbols in the PUSCH resources or the number of time slots spanned by a TB with low overhead, thus enabling a scheme that carries a TB across multiple time slots.

[0285] In the method shown in Embodiment 2, optionally, whether to transmit data via frequency hopping in each of the N time slots is determined based on the number of available symbols in that time slot. Correspondingly, whether to receive data via frequency hopping in each of the N time slots is determined based on the number of available symbols in that time slot. The specific implementation of this optional method is similar to step 805, except that the first resource is replaced with the available symbols in that time slot; further details are omitted.

[0286] In the method shown in Embodiment 2, optionally, the frequency domain position corresponding to the time slot within the first time window of the N time slots is designated as the first frequency domain position, and the frequency domain position corresponding to the time slot within the second time window is designated as the second frequency domain position. The first and second time windows are adjacent in the time domain. The first and second frequency domain positions are different. There can be two or more time windows among the N time slots.

[0287] The size of the time window can be configured by the network device to the terminal via RRC signaling. The size of the time window is related to the channel characteristics. For example, the time window can include K time slots. When data is transmitted on the time slots used to carry PUSCH within the K time slots, the data is located in the same frequency domain position. K can be an integer greater than 1. In this optional method, since the channel characteristics on multiple time slots are generally correlated, using the time window as the unit for frequency hopping between time slots can improve the channel detection performance.

[0288] The method provided in Embodiment 2 involves the terminal determining N time slots based on PUSCH parameters and determining whether to transmit data carried on the PUSCH within the N time slots based on the time slot format. Thus, if data carried on the PUSCH can be transmitted within the N time slots, the PUSCH is transmitted on the N time slots, achieving the transmission of 1 TB across multiple time slots. Furthermore, Embodiment 2 also provides a low-overhead method for indicating the number of symbols in the PUSCH resources, a method for determining the PUSCH resources used for data transmission, and a method for determining the starting time slot for repeated data transmission, thereby ensuring the implementation of the scheme of transmitting 1 TB across multiple time slots.

[0289] If the solutions in Embodiment 1 and Embodiment 2 are considered as a whole, it can be understood that the terminal and / or network device determines the first information based on the time slot format and PUSCH parameters. The first information is either the first resource in the first time slot in Embodiment 1 or N time slots in Embodiment 2. If the first information is determined to be the first resource in the first time slot in Embodiment 1, the specific implementation process of the solution provided in this application can be found in Embodiment 1. If the first information is determined to be the N time slots in Embodiment 2, the specific implementation process of the solution provided in this application can be found in Embodiment 2.

[0290] Example 3

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

[0292] 1501. The terminal determines N time slots, which are used to send PUSCH or to repeatedly send PUSCH.

[0293] The specific implementation of step 1501 can be found in Embodiment 1, and will not be repeated here. The N time slots can be any of cases (1) to (11) in Embodiment 1.

[0294] Prior to step 1501, the method may also include step 1301 as described above, so that the terminal performs step 1501.

[0295] 1502. The network device determines N time slots.

[0296] When implementing step 1502, you can refer to step 1501 for understanding. The only difference is that this step involves a network device.

[0297] 1503. The terminal sends PUSCH in N time slots or repeatedly sends PUSCH. Correspondingly, the network device receives PUSCH in N time slots or receives repeated PUSCH.

[0298] The explanation of the relevant concepts and the implementation of the relevant steps in Example 3 can be found in Examples 1 and 2 above. To avoid repetition, they will not be repeated here.

[0299] The method provided in Example 3 can determine the multiple time slots in cases where the coverage of PUSCH is increased by carrying 1 TB across multiple time slots or by repeatedly sending PUSCH in multiple time slots, thereby enabling these schemes to be successfully implemented.

[0300] The various embodiments mentioned above in this application can be combined without contradiction, and no limitation is imposed. The time slots shown in the various figures of this application (e.g., Figure 1 Downlink time slots may exist 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 the time slots shown in the accompanying drawings are merely examples and not limitations on the actual time slot format and location in implementation. In the above embodiments of this application, the PUSCH parameter, when indicating the start symbol S, the number of symbols L, and K2, may not necessarily indicate an index, but rather directly indicate one or more of the start symbol S, the number of symbols L, and K2. This application does not impose any restrictions.

[0301] Overview of the main inventive points of this application:

[0302] This application provides an enhanced method for repeated transmission in PUSCH Type A mode:

[0303] Example 1: A Type A enhancement scheme within a single time slot, based on the criterion for abandoning available resources when frequency hopping is designed, or the decision to hop frequency is determined based on the number of available resources.

[0304] Example 2: A 1TB Type A repeated transmission scheme across multiple time slots, with design abandonment criteria and granularity including multi-time slot level, time slot level, symbol level, etc.

[0305] Example 3: When instructing the enhancement scheme described in Examples 1 and 2, a new TDRA table is configured. During RRC configuration, a new TimeDomainAllocationList is configured. After the signaling is configured at the higher level, a certain row of the new TimeDomainAllocationList is indicated in the DCI, the difference being that L>14, and its meaning is defined.

[0306] Example 1 of this application: Association between available resources and frequency hopping within a time slot.

[0307] The core idea is to determine the lower limit of available resources based on whether frequency hopping is used as a criterion for abandonment, or to determine whether frequency hopping is necessary when transmitting PUSCH based on the number of symbols of available resources.

[0308] Available symbols: include uplink symbols and some flexible symbols, but exclude downlink symbols and symbols following downlink symbols used for downlink-to-uplink switching.

[0309] Rule 1: When frequency hopping is not performed within a configured time slot, if the available symbols among the L symbols starting from the start symbol (S) are greater than or equal to Y1, PUSCH is transmitted in that time slot; when frequency hopping is performed within a configured time slot, if the available symbols among the L symbols starting from the start symbol (S) are greater than or equal to Y2, PUSCH is transmitted in that time slot, where Y2>Y1.

[0310] Optionally, Y2 = Y1 + number of DMRS symbols. For example, if a single-symbol DMRS is configured and there are no additional DMRS, Y2 = Y1 + 1; if a double-symbol DMRS is configured and there are no additional DMRS, Y2 = Y1 + 2; if a single-symbol DMRS is configured and there is 1 additional DMRS, Y2 = Y1 + 2; if a double-symbol DMRS is configured and there are additional DMRS, Y2 = Y1 + 4.

[0311] Guideline 2: When the number of PUSCH symbols L is configured and intra-slot frequency hopping is configured, if the number of available symbols in a time slot is less than a threshold value X, intra-slot frequency hopping is not enabled, that is, no intra-slot frequency hopping is performed when transmitting PUSCH in that time slot; if the number of available symbols in a time slot is greater than or equal to the threshold value X, intra-slot frequency hopping is enabled when transmitting PUSCH in that time slot.

[0312] Optionally, the threshold value X is related to L, for example... or or Specific threshold values ​​can be communicated to the terminal via configuration signaling such as RRC or indication signaling such as DCI.

[0313] Besides enabling or disabling frequency hopping, a minor inventive point of Embodiment 1 lies in determining the DMRS position. Existing Type-A repetition configures the DMRS to be carried by the 3rd (pos2) or 4th (pos3) symbol of the entire time slot through the parameter dmrs-TypeA-Position. Since the first few symbols of a special time slot may not have downlink symbols, this configuration is not applicable, so the DMRS position needs to be redefined.

[0314] Method 1: pos2 or pos3 indicates the third or fourth symbol of the PUSCH.

[0315] Method 2: pos2 or pos3 indicates the first or second symbol of the PUSCH, or the second or third symbol.

[0316] Method 3: pos2 or pos3 indicates the third or fourth to last symbol of the PUSCH.

[0317] The technical effect of Embodiment 1 of this application: The solution proposed in this application provides the correlation between frequency hopping within a time slot and available resources. It determines whether to perform frequency hopping within a time slot based on available resources or determines the lower limit of the PUSCH carrying available resources based on frequency hopping within a time slot.

[0318] The improvement of Embodiment 1 of this application compared with the prior art is that the solution proposed in this application is more flexible in terms of resource requirements compared with the Type-A method in the prior art, but is still limited to one time slot. Compared with the Type-B method, it reduces the problem of resource fragmentation across time slots.

[0319] Example 2 of this application: Repeated abandonment criterion for 1 TB covering multiple time slots.

[0320] The core idea is to provide abandonment criteria for 1 TB covering N time slots repeatedly, including multi-time slot level, single time slot level and symbol level, thus providing a method for determining available resources (N>1). It should be noted that these abandonment criteria can also be used to determine available resources when 1 TB covers N time slots.

[0321] When 1 TB covers N time slots (N>1), the determination of resources includes the following two parts: one part is the location of the starting time slot, and the other part is which symbols are included in the available resources within the multiple time slots starting from the starting time slot.

[0322] First, the determination of the starting time slot:

[0323] For the initial transmission, the starting time slot position is determined based on the time slot indicated by the DCI and the number of time slots indicated in the RRC or DCI. For subsequent retransmissions, the starting time slot is determined in two ways:

[0324] The first method is similar to Type A, where the first time slot after the last transmission is the starting time slot;

[0325] The second method is similar to Type B. The first time slot after the last transmission that has a usable symbol or the first time slot that can carry a PUSCH is counted as the starting time slot (recommended).

[0326] For example Figure 14 (a) and Figure 14 As shown in (b) in the diagram, the first method (corresponding to...) Figure 14 In (a) of the second method, the first transmission starts from time slot n and covers two time slots to time slot n+1. The retransmission starts from time slot n+2 and covers two time slots to time slot n+3. The second retransmission starts from time slot n+4 and covers two time slots to time slot n+5. Figure 14 In (b)), the first transmission starts from time slot n and covers two time slots to time slot n+1. The retransmission starts from the next time slot with available resources, that is, from time slot n+3 and covers two time slots to time slot n+4. During this period, since time slot n+2 is a full downlink time slot without uplink symbols, it is not used as the starting time slot for retransmission.

[0327] After determining the range of N time slots covered by each transmission, we further determine which resources are available within that range.

[0328] Method 1: Multi-slot level abandonment criterion

[0329] If the first symbol S in the first time slot is not available, and all symbols after the first symbol S are available, or if the N*14-S symbols after the first symbol S are available, the PUSCH retransmission is abandoned. If S=0 or S is not configured, the PUSCH retransmission can only be carried if all N time slots have 14 available symbols.

[0330] Method 2: Single-slot level abandonment criterion

[0331] Transmission is only performed when the S symbol in the initial time slot is a usable symbol, and the 14-S symbols following the S symbol in that time slot are also usable symbols; in the time slots following the initial time slot, transmission is only performed when all 14 symbols are usable symbols.

[0332] If S=0 or S is not configured, each time slot is determined as a transmission resource based on the standard that all 14 symbols are available symbols.

[0333] Method 3: Symbol-level abandonment criterion

[0334] Apart from the downlink symbols and the flexible symbols following the downlink symbols used for transmit / receive conversion, the remaining symbols are included in the available symbols for transmitting PUSCH.

[0335] Technical effect of embodiment 2 of this application: The solution proposed in this application provides a method for determining resources when 1 TB covers multiple time slots, including determining the starting time slot and determining the resources within the time slot.

[0336] The difference between Embodiment 2 of this application and the prior art / Embodiment 1 is that the prior art does not have a method for determining available resources that cover multiple time slots with 1 TB, and this embodiment fills this gap.

[0337] Example 3 of this application: Instructions for enhancing the method.

[0338] Core idea: Existing technology configures S and L through TDRA tables, but it is not applicable to both Embodiment 1 and Embodiment 2 because S is no longer 0 in the special time slot involved in Embodiment 1, and L is no longer limited to 14 symbols in Embodiment 2. This embodiment configures a new TDRA table, which is applicable to the two embodiments mentioned above.

[0339] The PUSCH configuration table in 38.331 is as follows:

[0340]

[0341] Instruction method of Example 1:

[0342] For the scheme of Implementation Example 1, in one method 1, when configuring the RRC table, additional configuration is made of the start symbol and / or symbol length used for special time slots, such as adding startSymbol_special_slot or length_special_slot, to indicate the resource location carrying PUSCH in the special time slot.

[0343] When only `startSymbol_special_slot` is configured, all uplink or flexible symbols starting from `startSymbol_special_slot` are used to transmit PUSCH. When only `length_special_slot` is configured, symbols from the symbol corresponding to 14 - `length_special_slot` are used to carry PUSCH up to the end of the slot. When both `startSymbol_special_slot` and `length_special_slot` are configured, symbols from `startSymbol_special_slot` are used to carry PUSCH up to `length_special_slot`.

[0344] For the scheme of Example 1, another configuration method 2 is to configure startSymbol2 and length2 when the repetition mode is TypeA. In this case, startSymbol2 is the starting symbol in a time slot, and the length of the continuous symbol in the time slot is min(length2-startSymbol2,14). The remaining length2-min(length2-startSymbol2,14) is the symbol length in the special time slot. The starting position starts from the end of the special time slot and includes length2-min(length2-startSymbol2,14) symbols forward.

[0345] For the scheme in Implementation Example 1, there is also a configuration method 3, where startSymbol3 indicates the starting symbol position in a special time slot, and L is the symbol length of the special time slot plus the number of uplink symbols in the next time slot. For example, startSymbol3 = 10, L = 4 + 14 = 18. In the remaining UL time slots, the UE interprets it as startSymbol = 0, L = 14, while in the first time slot, PUSCH is transmitted using startSymbol3 = 10, L = 4.

[0346] startSymbol3 = 12, L = 2 + 14 = 18. In the remaining UL time slots, the UE interprets startSymbol as 0, L = 14, while in the first time slot, start = 12, L = 2 is used to transmit the first time.

[0347] Instruction method of Example 2:

[0348] For the scheme of Example 2, one method a is to additionally configure the number of time slots covered when configuring the RRC table, such as adding a parameter N to indicate that 1 TB is carried across N time slots.

[0349] For the scheme of embodiment 2, another method b is to configure L as the number of symbols starting from S in the initial time slot plus 14*(N-1) when configuring the RRC table, where N is the number of TB carried across N time slots.

[0350] For example, if S = 8 and L = 32, then we get That is, N=3, the symbol length in the first time slot is 32-14*(N-1)=4, that is, the 4 symbols starting from S in the first time slot carry PUSCH.

[0351] For the scheme in Embodiment 2, there is another indication method c. When configuring the RRC table, L is configured as the number of symbols starting from S in the initial time slot plus (N-1), where N is the number of time slots spanning N time slots to carry 1 TB. Since the starting symbol position in the first time slot is known through S, and all symbols starting from S in the first time slot are used to carry PUSCH, the number of available symbols in the first time slot is 14-S. Therefore, based on L, the value of (N-1) can be obtained, and the number of time slots N covered by 1 TB can be determined.

[0352] For example, if S=8 and L=8, the symbol length in the first time slot is 14-S=6, meaning that the 6 symbols starting from S in the first time slot carry PUSCH, thus obtaining N-1=L-(14-S)=2, or N=3.

[0353] It can be seen that method a requires the introduction of additional parameters, while methods b and c do not require the introduction of new parameters. However, by assuming that all symbols starting from S in the first time slot are available resources, method c results in a smaller range of L values ​​than method b, thus saving a certain number of bits.

[0354] Technical effect of embodiment 3 of this application: The solution proposed in this application shows how to indicate the resource location occupied by the PUSCH transmission involved in embodiment 1 and embodiment 2.

[0355] The improvement of Embodiment 3 of this application compared with the prior art / Embodiment 1 is that, compared with the prior art, Embodiment 3 provides an indication or calculation method for a special time slot and / or an indication or calculation method for N when 1 TB covers N time slots.

[0356] 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.

[0357] 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.

[0358] For example, Figure 16 A possible structural diagram of the data transmission device (denoted as data transmission device 160) involved in the above embodiments is shown. The data transmission device 160 includes a processing unit 1601 and a communication unit 1602. Optionally, it also includes a storage unit 1603. The data transmission device 160 can be used to illustrate the structure of the terminal and network device in the above embodiments.

[0359] When the data transmission device 160 is used to illustrate the structure of the terminal in the above embodiment, the processing unit 1601 is used to control and manage the actions of the terminal. For example, the processing unit 1601 is used to execute... Figure 8 801, 802, and 804 in the series, Figure 13 1301, 1302, and 1304 in the list, Figure 15 Actions performed by the terminal in processes 1501 and 1503, and / or other processes described in the embodiments of this application. Processing unit 1601 can communicate with other network entities via communication unit 1602, for example, with... Figure 8The network device communicates within the terminal. Storage unit 1603 is used to store the terminal's program code and data.

[0360] When the data transmission device 160 is used to illustrate the structure of the network device in the above embodiment, the processing unit 1601 is used to control and manage the operation of the network device. For example, the processing unit 1601 is used to execute... Figure 8 801, 803, and 805 in the series, Figure 13 1301, 1303, and 1305 in the list, Figure 15 The actions performed by the network device in processes 1502 and 1503, and / or other processes described in the embodiments of this application. Processing unit 1601 can communicate with other network entities via communication unit 1602, for example, with... Figure 8 Terminal communication in the network. Storage unit 1603 is used to store the program code and data of the network device.

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

[0362] When the data transmission device 160 is a single device, the processing unit 1601 can be a processor; the communication unit 1602 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.

[0363] When the data transmission device 160 is a chip or chip system, the communication unit 1602 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 1601 may be a processor, processing circuit, or logic circuit.

[0364] Figure 16If 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.

[0365] This application also provides a hardware structure diagram of a data transmission device, see [link]. Figure 17 or Figure 18 The data transmission device includes a processor 1701, and optionally, a memory 1702 connected to the processor 1701.

[0366] Processor 1701 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 1701 may also include multiple CPUs, and processor 1701 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).

[0367] The memory 1702 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 1702 can exist independently (in this case, the memory 1702 can be located outside or inside the data transmission device) or it can be integrated with the processor 1701. The memory 1702 can contain computer program code. The processor 1701 is used to execute the computer program code stored in the memory 1702, thereby implementing the method provided in this application embodiment.

[0368] In the first possible implementation, see Figure 17 The data transmission device also includes a transceiver 1703. The processor 1701, memory 1702, and transceiver 1703 are connected via a bus. The transceiver 1703 is used to communicate with other devices or communication networks. Optionally, the transceiver 1703 may include a transmitter and a receiver. The device in the transceiver 1703 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 1703 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.

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

[0370] when Figure 17 The schematic diagram shown illustrates the structure of the terminal involved in the above embodiments. The processor 1701 is used to control and manage the actions of the terminal. For example, the processor 1701 is used to execute... Figure 8 801, 802, and 804 in the series, Figure 13 1301, 1302, and 1304 in the list, Figure 15The actions performed by the terminal in processes 1501 and 1503, and / or other processes described in the embodiments of this application. Processor 1701 can communicate with other network entities via transceiver 1703, for example, with... Figure 8 The network device communicates within the terminal. Memory 1702 is used to store the terminal's program code and data.

[0371] when Figure 17 The schematic diagram shown illustrates the structure of the network device involved in the above embodiments. The processor 1701 is used to control and manage the actions of the network device. For example, the processor 1701 is used to execute... Figure 8 801, 803, and 805 in the series, Figure 13 1301, 1303, and 1305 in the list, Figure 15 The actions performed by the network device in processes 1502 and 1503, and / or other processes described in the embodiments of this application. Processor 1701 can communicate with other network entities via transceiver 1703, for example, with... Figure 8 Terminal communication within the network. Memory 1702 is used to store the program code and data of the network device.

[0372] In a second possible implementation, the processor 1701 includes logic circuitry and input and / or output interfaces. Exemplarily, 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 18 , Figure 18 The structural diagram shown can be used to illustrate the structure of the terminal and network devices involved in the above embodiments.

[0373] when Figure 18 The schematic diagram shown illustrates the structure of the terminal involved in the above embodiments. The processor 1701 is used to control and manage the actions of the terminal. For example, the processor 1701 is used to execute... Figure 8 801, 802, and 804 in the series, Figure 13 1301, 1302, and 1304 in the list, Figure 15 Actions performed by the terminal in processes 1501 and 1503, and / or other processes described in the embodiments of this application. Processor 1701 can communicate with other network entities via input and / or output interfaces, for example, with... Figure 8 The network device communicates within the terminal. Memory 1702 is used to store the terminal's program code and data.

[0374] when Figure 18The schematic diagram shown illustrates the structure of the network device involved in the above embodiments. The processor 1701 is used to control and manage the actions of the network device. For example, the processor 1701 is used to execute... Figure 8 801, 803, and 805 in the series, Figure 13 1301, 1303, and 1305 in the list, Figure 15 Actions performed by the network device in processes 1502 and 1503, and / or other processes described in the embodiments of this application. Processor 1701 can communicate with other network entities via input and / or output interfaces, for example, with... Figure 8 Terminal communication within the network. Memory 1702 is used to store the program code and data of the network device.

[0375] 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.

[0376] 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.

[0377] 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.

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

[0379] 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.

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

[0381] 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).

[0382] 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.

[0383] 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 communication method characterized by comprising: include: Receive the time slot format indicated by the network device; Receive the Physical Uplink Shared Channel (PUSCH) parameters indicated by the network device, wherein the PUSCH parameters include time-domain parameters, and the time-domain parameters include information for indicating the number of time slots N; The number of time slots N is determined based on the information used to indicate the number of time slots N; N time slots are determined based on the number of time slots N and the time slot format; Data carried on the first PUSCH is transmitted on the N time slots. The data is obtained by channel coding of the transport block TB. The size of the TB is determined according to the available symbols in the N time slots. Where N is a positive integer greater than 1.

2. The method of claim 1, wherein, In each of the N time slots, the L symbols starting from the start symbol S are all available symbols, where S and L are both positive integers and are indicated by the network device.

3. The method according to claim 1 or 2, characterized in that, The N time slots are consecutive time slots.

4. The method according to claim 1 or 2, characterized in that, The PUSCH parameter is carried in the RRC signaling.

5. The method according to claim 4, characterized in that, The available symbols do not include downlink symbols, and the available symbols do not include flexible symbols for downlink-to-uplink conversion.

6. A communication method, characterized in that, include: Transmission slot format; Send Physical Uplink Shared Channel (PUSCH) parameters, which include time-domain parameters, including information for indicating the number of time slots N; Data carried on the first PUSCH is received in N time slots. The data is obtained by channel coding of the transport block TB. The size of the TB is determined according to the available symbols in the N time slots. The N time slots are determined according to the number of time slots N and the time slot format. Where N is a positive integer greater than 1.

7. The method according to claim 6, characterized in that, In each of the N time slots, the L symbols starting from the start symbol S are all available symbols, where S and L are both positive integers and are determined and indicated by the network device.

8. The method according to claim 6 or 7, characterized in that, The N time slots are consecutive time slots.

9. The method according to claim 6 or 7, characterized in that, The PUSCH parameter is carried in the RRC signaling.

10. The method according to claim 9, characterized in that, The available symbols do not include downlink symbols, and the available symbols do not include flexible symbols for downlink-to-uplink conversion.

11. A communication device, characterized in that, include: processor; The processor is connected to a memory that stores a computer program or instructions that, when executed by the processor, cause the method as described in any one of claims 1-5 to be implemented by the communication device.

12. A communication device, characterized in that, include: processor; The processor is connected to a memory that stores a computer program or instructions that, when executed by the processor, cause the method as described in any one of claims 6-10 to be implemented by the communication device.

13. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program or instructions that, when executed, cause the method as described in any one of claims 1-5 to be implemented.

14. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program or instructions that, when executed, cause the method as described in any one of claims 6-10 to be implemented.

15. A computer program product, characterized in that, Includes a computer program or instructions that, when executed, cause the method as described in any one of claims 1-5 to be implemented.

16. A computer program product, characterized in that, Includes a computer program or instructions that, when executed, cause the method as described in any one of claims 6-10 to be implemented.

Citation Information

Patent Citations

  • Transmit format for multi-segment pusch

    WO2020165835A1

  • Base station device, terminal device, and communication method

    WO2020218529A1