Communication method, communication device, communication system, storage medium, and program product

Abstract

The embodiments of the present disclosure relate to a communication method, a communication device, a communication system, a storage medium, and a program product. The communication method is executed by means of a terminal, and comprises: receiving first information, which indicates a time-domain resource configuration of first data transmission; and on the basis of the time-domain resource configuration, determining a symbol of a first data transmission, wherein the symbol of the first data transmission meets a first condition, the first condition is that the symbol of the first data transmission does not overlap a first-type symbol, and the first-type symbol is a symbol that is not used for the first data transmission. By means of the present disclosure, the allocation of time domain resources can be performed at a symbol granularity, such that the allocation of the time-domain resources is more flexible, thereby improving the utilization rate and coverage performance of the time-domain resources.

Description

Communication methods, communication equipment, communication systems, storage media and software products Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to a communication method, communication device, communication system, storage medium, and program product. Background Technology

[0002] The physical uplink shared channel (PUSCH) is a physical channel for transmitting uplink data and control information from the terminal. The time-domain resources of the PUSCH are allocated continuously within a time slot, and the symbol allocation of the PUSCH is the same within each time slot.

[0003] Summary of the Invention

[0004] For PUSCH time-domain resource allocation, the symbol allocation for each time slot is the same, which reduces the flexibility of time-domain resource allocation, wastes some uplink resources, and thus affects uplink coverage performance.

[0005] This disclosure provides a communication method, communication device, communication system, storage medium, and program product.

[0006] According to a first aspect of the present disclosure, a communication method is proposed, executed by a terminal, the method comprising: receiving first information, the first information indicating a time-domain resource configuration for a first data transmission; determining a symbol for the first data transmission based on the time-domain resource configuration; wherein the symbol for the first data transmission satisfies a first condition, the first condition being that the symbol for the first data transmission does not overlap with a first type of symbol, the first type of symbol being a symbol not used for the first data transmission.

[0007] According to a second aspect of the present disclosure, a communication method is proposed, executed by a network device, the method comprising: sending first information, the first information indicating a time-domain resource configuration for a first data transmission; determining a symbol for the first data transmission based on the time-domain resource configuration; wherein the symbol for the first data transmission satisfies a first condition, the first condition being that the symbol for the first data transmission does not overlap with a first type of symbol, the first type of symbol being a symbol not used for the first data transmission.

[0008] According to a third aspect of the present disclosure, a terminal is provided, comprising: a first transceiver module configured to receive first information, the first information indicating a time-domain resource configuration for a first data transmission; and a first processing module configured to determine a symbol for the first data transmission based on the time-domain resource configuration; wherein the symbol for the first data transmission satisfies a first condition, the first condition being that the symbol for the first data transmission does not overlap with a first type of symbol, the first type of symbol being a symbol not used for the first data transmission.

[0009] According to a fourth aspect of the present disclosure, a network device is provided, comprising: a second transceiver module configured to transmit first information, the first information indicating a time-domain resource configuration for a first data transmission; and a second processing module configured to determine a symbol for the first data transmission based on the time-domain resource configuration; wherein the symbol for the first data transmission satisfies a first condition, the first condition being that the symbol for the first data transmission does not overlap with a first type of symbol, the first type of symbol being a symbol not used for the first data transmission.

[0010] According to a fifth aspect of the present disclosure, a communication device is provided, comprising: one or more processors; wherein the communication device is configured to perform a communication method as described in the first or second aspect.

[0011] According to a sixth aspect of the present disclosure, a communication system is provided, including a terminal and a network device; the terminal is configured to implement the communication method of the first aspect; and the network device is configured to implement the communication method of the second aspect.

[0012] According to a seventh aspect of the present disclosure, a storage medium is provided that stores instructions which, when executed on a communication device, cause the communication device to perform a communication method as described in the first or second aspect.

[0013] According to an eighth aspect of the present disclosure, a computer program product is provided, including a computer program that, when executed by a processor, implements the communication method of the first or second aspect.

[0014] According to a ninth aspect of the present disclosure, a computer program is provided that includes code, which, when executed by a processor, implements the communication method of the first or second aspect.

[0015] According to a tenth aspect of the present disclosure, a chip or chip system is provided, the chip or chip system including processing circuitry configured to perform a communication method as described in the first or second aspect.

[0016] In this embodiment, the symbols for the first data transmission are determined based on the temporal resource configuration of the first data transmission. The symbols for the first data transmission satisfy a first condition: the symbols for the first data transmission do not overlap with a first type of symbol, and the first type of symbol is not used for the first data transmission. Thus, this disclosure allows for the allocation of temporal resources at the symbol granularity, making the allocation of temporal resources more flexible and improving the utilization and coverage performance of temporal resources. Attached Figure Description

[0017] To more clearly illustrate the technical solutions in the embodiments of this disclosure, the accompanying drawings required for the description of the embodiments are introduced below. The following drawings are only some embodiments of this disclosure and do not impose specific limitations on the protection scope of this disclosure.

[0018] Figure 1A is a schematic diagram of the architecture of a communication system according to an embodiment of the present disclosure.

[0019] Figure 1B is a schematic diagram of the time-domain resources of a single-slot PUSCH according to an embodiment of the present disclosure.

[0020] Figure 1C is a temporal resource diagram of PUSCH repetition type A based on physical time slot counting, according to an embodiment of the present disclosure.

[0021] Figure 1D is a schematic diagram of time-domain resources for PUSCH repetition type A based on available time slot counts, according to an embodiment of the present disclosure.

[0022] Figure 1E is a schematic diagram of the time-domain resources of PUSCH repetition type B according to an embodiment of the present disclosure.

[0023] Figure 1F is a schematic diagram of time-domain resources combining TBoMS and PUSCH repeat type A according to an embodiment of the present disclosure.

[0024] Figures 1G and 1H are schematic diagrams of time-domain resources for scheduling multiple PUSCHs according to embodiments of the present disclosure.

[0025] Figure 2A is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure.

[0026] Figure 2B is a schematic diagram illustrating the time-domain resources of the PUSCH determined by method 1 according to an embodiment of the present disclosure.

[0027] Figure 2C is a schematic diagram of the time-domain resources of PUSCH determined by method 2-1 according to an embodiment of the present disclosure.

[0028] Figure 2D is a schematic diagram of the time-domain resources of PUSCH determined by method 2-2 according to an embodiment of the present disclosure.

[0029] Figure 2E is a schematic diagram of the temporal resources of PUSCH repetition type A determined by method 3 and method A-1 according to an embodiment of the present disclosure.

[0030] Figure 2F is a schematic diagram of the temporal resources of PUSCH repetition type A determined by method 3 and method A-2 according to an embodiment of the present disclosure.

[0031] Figure 2G is a schematic diagram of the temporal resources of PUSCH repetition type A determined by method 3 and method A-2 according to an embodiment of the present disclosure.

[0032] Figure 2H is a schematic diagram of the temporal resources of PUSCH repetition type A determined based on method 4 and physical time slot count, according to an embodiment of the present disclosure.

[0033] Figure 2I is a schematic diagram of the time-domain resources of PUSCH repetition type A determined based on method 4 and available time slot count, according to an embodiment of the present disclosure.

[0034] Figure 2J is a schematic diagram of the temporal resources of PUSCH repetition type B determined by method B-1 according to an embodiment of the present disclosure.

[0035] Figure 2K is a schematic diagram of the temporal resources of PUSCH repetition type B determined by method B-2 according to an embodiment of the present disclosure.

[0036] Figure 2L is a schematic diagram of the temporal resources of PUSCH repetition type B determined by method B-3 according to an embodiment of the present disclosure.

[0037] Figure 3 is another interactive schematic diagram of a communication method according to an embodiment of the present disclosure.

[0038] Figure 4 is a schematic diagram of the structure of a communication device provided according to an embodiment of the present disclosure.

[0039] Figure 5 is a schematic diagram of a communication device provided according to an embodiment of the present disclosure.

[0040] Figure 6 is a schematic diagram of a chip structure provided according to an embodiment of the present disclosure. Detailed Implementation

[0041] This disclosure provides a communication method, communication device, communication system, storage medium, and program product.

[0042] In a first aspect, embodiments of this disclosure provide a communication method executed by a terminal, the method comprising: receiving first information, the first information indicating a time-domain resource configuration for a first data transmission; determining a symbol for the first data transmission based on the time-domain resource configuration; wherein the symbol for the first data transmission satisfies a first condition, the first condition being that the symbol for the first data transmission does not overlap with a first type of symbol, the first type of symbol being a symbol not used for the first data transmission.

[0043] In this embodiment of the disclosure, the terminal can allocate time-domain resources at the symbol granularity, making the allocation of time-domain resources more flexible and improving the utilization and coverage performance of time-domain resources.

[0044] In conjunction with some embodiments of the first aspect, in some embodiments, the time-domain resource configuration of the first data transmission includes: a first parameter indicating the starting time slot of the first data transmission; and a second parameter indicating the starting symbol and the number of symbols of the first data transmission.

[0045] In conjunction with some embodiments of the first aspect, in some embodiments, determining the symbols for the first data transmission based on the time-domain resource configuration includes: starting from the starting symbol within the starting time slot, sequentially traversing each symbol, and determining the symbols that satisfy the first condition as the symbols for the first data transmission, until the number of symbols for the first data transmission is L; or, starting from the starting symbol within the starting time slot, sequentially traversing each symbol within the starting time slot, and determining the symbols that satisfy the first condition as the symbols for the first data transmission, until one of the following is true: the number of symbols for the first data transmission is L; or the last symbol within the starting time slot; wherein L is the number of symbols indicated by the second parameter.

[0046] In this embodiment of the disclosure, the symbols of the first data transmission determined by the terminal can span time slots and be discontinuous, which makes the allocation of time domain resources more flexible and improves the utilization rate and coverage performance of time domain resources.

[0047] In conjunction with some embodiments of the first aspect, in some embodiments, the time-domain resource configuration of the first data transmission further includes: a third parameter indicating the number of repetitions of the first data transmission; determining the symbols of the first data transmission according to the time-domain resource configuration, including: for the first repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traversing each symbol, and determining the symbols that satisfy the first condition as the symbols of the first repetition, until the number of symbols of the first repetition is L; or, for the first repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traversing each symbol in the starting time slot, and determining the symbols that satisfy the first condition as the symbols of the first repetition, until one of the following: the number of symbols of the first data transmission is L; the last symbol in the starting time slot; wherein, L is the number of symbols indicated by the second parameter.

[0048] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes: for the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, sequentially traversing each symbol, and determining the symbol that satisfies the first condition as the symbol of the i-th repetition, until the number of symbols in the i-th repetition is L; or, for the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, sequentially traversing each symbol in the reference time slot, and determining the symbol that satisfies the first condition as the symbol of the i-th repetition, until one of the following: the number of symbols in the i-th repetition is L; or the last symbol in the reference time slot; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

[0049] In conjunction with some embodiments of the first aspect, in some embodiments, the reference time slot corresponding to the i-th repetition is the time slot where the end symbol of the (i-1)-th repetition is located, or the next time slot after the time slot where the end symbol of the (i-1)-th repetition is located.

[0050] In conjunction with some embodiments of the first aspect, in some embodiments, the end symbol of the (i-1)th repetition precedes the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the time slot where the end symbol of the (i-1)th repetition is located; or, the end symbol of the (i-1)th repetition overlaps with the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located; or, the end symbol of the (i-1)th repetition follows the start symbol of the i-th repetition, and the reference time slot for the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located.

[0051] In conjunction with some embodiments of the first aspect, in some embodiments, the temporal resource configuration of the first data transmission further includes: a third parameter indicating the number of repetitions of the first data transmission; determining the symbols of the first data transmission according to the temporal resource configuration, including: for the first nominal repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traversing each symbol, and determining the symbols that satisfy the first condition as the symbols of the first nominal repetition, until the number of symbols of the first nominal repetition is L; for the i-th nominal repetition of the first data transmission, starting from the first symbol that satisfies the first condition after the ending symbol of the (i-1)-th nominal repetition, sequentially traversing each symbol, and determining the symbols that satisfy the first condition as the symbols of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; or, for the i-th nominal repetition of the first data transmission, starting from the first symbol after the ending symbol of the (i-1)-th nominal repetition, sequentially traversing each symbol, and determining the symbols that satisfy the first condition as the symbols of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

[0052] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes: determining at least one actual repetition symbol included in each nominal repetition.

[0053] In conjunction with some embodiments of the first aspect, in some embodiments, each nominal repetition occupies two consecutive time slots, and includes an actual repetition, wherein the symbols included in the actual repetition are located in different time slots.

[0054] In this embodiment of the disclosure, the terminal can directly perform the first data transmission by repeating the nominal transmission K times. This reduces the number of times the RM is executed and the corresponding number of RVs is reduced, which can effectively reduce resource consumption and improve transmission performance.

[0055] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes one of the following: determining K nominal repetitions as the first data transmission; determining the actual repetitions included in the K nominal repetitions as the first data transmission.

[0056] In this embodiment of the disclosure, the terminal no longer splits the nominal repetition that crosses the time slot boundary into two actual repetitions. This reduces the number of times RM is executed and the corresponding number of RVs is reduced, which can effectively reduce resource overhead and improve transmission performance.

[0057] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes: determining the transport block size TBS of the transport block TB included in the first data transmission according to the time-domain resource configuration; and transmitting the TB on the symbols of the first data transmission based on the TBS.

[0058] In conjunction with some embodiments of the first aspect, in some embodiments, determining the transport block size (TBS) of the transport block (TB) included in the first data transmission based on the time-domain resource configuration of the first data transmission includes one of the following: determining the TBS based on the number of symbols indicated by the second parameter; determining the TBS based on the number of symbols in the first repetition of the first data transmission; determining the TBS based on the average number of symbols in all repetitions of the first data transmission; determining the TBS based on the maximum number of symbols in all repetitions of the first data transmission; or determining the TBS based on the minimum number of symbols in all repetitions of the first data transmission.

[0059] Secondly, embodiments of this disclosure provide a communication method executed by a network device. The method includes: sending first information, the first information indicating a time-domain resource configuration for a first data transmission; determining a symbol for the first data transmission based on the time-domain resource configuration; wherein the symbol for the first data transmission satisfies a first condition, the first condition being that the symbol for the first data transmission does not overlap with a first type of symbol, the first type of symbol being a symbol not used for the first data transmission.

[0060] In conjunction with some embodiments of the second aspect, in some embodiments, the time-domain resource configuration of the first data transmission includes: a first parameter indicating the starting time slot of the first data transmission; and a second parameter indicating the starting symbol and the number of symbols of the first data transmission.

[0061] In conjunction with some embodiments of the second aspect, in some embodiments, determining the symbols for the first data transmission based on the time-domain resource configuration includes: starting from the starting symbol within the starting time slot, sequentially traversing each symbol, and determining the symbols that satisfy the first condition as the symbols for the first data transmission, until the number of symbols for the first data transmission is L; or, starting from the starting symbol within the starting time slot, sequentially traversing each symbol within the starting time slot, and determining the symbols that satisfy the first condition as the symbols for the first data transmission, until one of the following is true: the number of symbols for the first data transmission is L; or the last symbol within the starting time slot; wherein L is the number of symbols indicated by the second parameter.

[0062] In conjunction with some embodiments of the second aspect, in some embodiments, the time-domain resource configuration of the first data transmission further includes: a third parameter indicating the number of repetitions of the first data transmission; determining the symbols of the first data transmission according to the time-domain resource configuration, including: for the first repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traversing each symbol, and determining the symbols that satisfy the first condition as the symbols of the first repetition, until the number of symbols of the first repetition is L; or, for the first repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traversing each symbol in the starting time slot, and determining the symbols that satisfy the first condition as the symbols of the first repetition, until one of the following: the number of symbols of the first data transmission is L; the last symbol in the starting time slot; wherein, L is the number of symbols indicated by the second parameter.

[0063] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes: for the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, sequentially traversing each symbol, and determining the symbol that satisfies the first condition as the symbol of the i-th repetition, until the number of symbols in the i-th repetition is L; or, for the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, sequentially traversing each symbol in the reference time slot, and determining the symbol that satisfies the first condition as the symbol of the i-th repetition, until one of the following: the number of symbols in the i-th repetition is L; or the last symbol in the reference time slot; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

[0064] In conjunction with some embodiments of the second aspect, in some embodiments, the reference time slot corresponding to the i-th repetition is the time slot where the end symbol of the (i-1)-th repetition is located, or the next time slot after the time slot where the end symbol of the (i-1)-th repetition is located.

[0065] In conjunction with some embodiments of the second aspect, in some embodiments, the end symbol of the (i-1)th repetition precedes the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the time slot where the end symbol of the (i-1)th repetition is located; or, the end symbol of the (i-1)th repetition overlaps with the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located; or, the end symbol of the (i-1)th repetition follows the start symbol of the i-th repetition, and the reference time slot for the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located.

[0066] In conjunction with some embodiments of the second aspect, in some embodiments, the temporal resource configuration of the first data transmission further includes: a third parameter indicating the number of repetitions of the first data transmission; determining the symbols of the first data transmission according to the temporal resource configuration, including: for the first nominal repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traversing each symbol, and determining the symbols that satisfy the first condition as the symbols of the first nominal repetition, until the number of symbols of the first nominal repetition is L; for the i-th nominal repetition of the first data transmission, starting from the first symbol that satisfies the first condition after the ending symbol of the (i-1)-th nominal repetition, sequentially traversing each symbol, and determining the symbols that satisfy the first condition as the symbols of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; or, for the i-th nominal repetition of the first data transmission, starting from the first symbol after the ending symbol of the (i-1)-th nominal repetition, sequentially traversing each symbol, and determining the symbols that satisfy the first condition as the symbols of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

[0067] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes: determining at least one actual repetition symbol included in each nominal repetition.

[0068] In conjunction with some embodiments of the second aspect, in some embodiments, each nominal repetition occupies two consecutive time slots, and includes an actual repetition, wherein the symbols included in the actual repetition are located in different time slots.

[0069] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes one of the following: determining K nominal repetitions as the first data transmission; determining the actual repetitions included in the K nominal repetitions as the first data transmission.

[0070] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes: determining the transport block size TBS of the transport block TB included in the first data transmission according to the time-domain resource configuration; and receiving the TB on the symbols of the first data transmission based on the TBS.

[0071] In conjunction with some embodiments of the second aspect, in some embodiments, determining the transport block size (TBS) of the transport block TB included in the first data transmission based on the time-domain resource configuration of the first data transmission includes one of the following: determining the TBS based on the number of symbols indicated by the second parameter; determining the TBS based on the number of symbols in the first repetition of the first data transmission; determining the TBS based on the average number of symbols in all repetitions of the first data transmission; determining the TBS based on the maximum number of symbols in all repetitions of the first data transmission; or determining the TBS based on the minimum number of symbols in all repetitions of the first data transmission.

[0072] Thirdly, embodiments of this disclosure provide a terminal, including: a first transceiver module configured to receive first information, the first information indicating a time-domain resource configuration for a first data transmission; and a first processing module configured to determine a symbol for the first data transmission based on the time-domain resource configuration; wherein the symbol for the first data transmission satisfies a first condition, the first condition being that the symbol for the first data transmission does not overlap with a first type of symbol, the first type of symbol being a symbol not used for the first data transmission.

[0073] In conjunction with some embodiments of the third aspect, in some embodiments, the time-domain resource configuration of the first data transmission includes: a first parameter indicating the starting time slot of the first data transmission; and a second parameter indicating the starting symbol and the number of symbols of the first data transmission.

[0074] In conjunction with some embodiments of the third aspect, in some embodiments, the first processing module is further configured to: starting from the starting symbol in the starting time slot, sequentially traverse each symbol, and determine the symbols that satisfy the first condition as symbols for the first data transmission, until the number of symbols for the first data transmission is L; or, starting from the starting symbol in the starting time slot, sequentially traverse each symbol in the starting time slot, and determine the symbols that satisfy the first condition as symbols for the first data transmission, until one of the following: the number of symbols for the first data transmission is L; or the last symbol in the starting time slot; wherein L is the number of symbols indicated by the second parameter.

[0075] In conjunction with some embodiments of the third aspect, in some embodiments, the temporal resource configuration of the first data transmission further includes: a third parameter indicating the number of repetitions of the first data transmission; the first processing module is further configured to: for the first repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traverse each symbol, and determine the symbols that satisfy the first condition as the symbols of the first repetition, until the number of symbols of the first repetition is L; or, for the first repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traverse each symbol in the starting time slot, and determine the symbols that satisfy the first condition as the symbols of the first repetition, until one of the following: the number of symbols of the first data transmission is L; the last symbol in the starting time slot; wherein, L is the number of symbols indicated by the second parameter.

[0076] In conjunction with some embodiments of the third aspect, in some embodiments, the first processing module is further configured to: for the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, sequentially traverse each symbol, and determine the symbol that satisfies the first condition as the symbol of the i-th repetition, until the number of symbols in the i-th repetition is L; or, for the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, sequentially traverse each symbol in the reference time slot, and determine the symbol that satisfies the first condition as the symbol of the i-th repetition, until one of the following: the number of symbols in the i-th repetition is L; or the last symbol in the reference time slot; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

[0077] In conjunction with some embodiments of the third aspect, in some embodiments, the reference time slot corresponding to the i-th repetition is the time slot where the end symbol of the (i-1)-th repetition is located, or the next time slot after the time slot where the end symbol of the (i-1)-th repetition is located.

[0078] In conjunction with some embodiments of the third aspect, in some embodiments, the end symbol of the (i-1)th repetition is before the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the time slot where the end symbol of the (i-1)th repetition is located; or, the end symbol of the (i-1)th repetition overlaps with the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located; or, the end symbol of the (i-1)th repetition is after the start symbol of the i-th repetition, and the reference time slot of the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located.

[0079] In conjunction with some embodiments of the third aspect, in some embodiments, the temporal resource configuration of the first data transmission further includes: a third parameter indicating the number of repetitions of the first data transmission; the first processing module is further configured to: for the first nominal repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traverse each symbol, and determine the symbols that satisfy the first condition as the symbols of the first nominal repetition, until the number of symbols of the first nominal repetition is L; for the i-th nominal repetition of the first data transmission, starting from the first symbol that satisfies the first condition after the ending symbol of the (i-1)-th nominal repetition, sequentially traverse each symbol, and determine the symbols that satisfy the first condition as the symbols of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; or, for the i-th nominal repetition of the first data transmission, starting from the first symbol after the ending symbol of the (i-1)-th nominal repetition, sequentially traverse each symbol, and determine the symbols that satisfy the first condition as the symbols of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

[0080] In conjunction with some embodiments of the third aspect, in some embodiments, the first processing module is further configured to: determine at least one actual repeating symbol included in each nominal repeat.

[0081] In conjunction with some embodiments of the third aspect, in some embodiments, each nominal repetition occupies two consecutive time slots, and includes an actual repetition, wherein the symbols included in the actual repetition are located in different time slots.

[0082] In conjunction with some embodiments of the third aspect, in some embodiments, the first processing module is further configured to: determine K nominal repetitions as the first data transmission; determine the actual repetitions included in the K nominal repetitions as the first data transmission.

[0083] In conjunction with some embodiments of the third aspect, in some embodiments, the first processing module is further configured to: determine the transport block size TBS of the transport block TB included in the third data transmission according to the time domain resource configuration; the first transceiver module is further configured to transmit TB on symbols of the first data transmission based on TBS.

[0084] In conjunction with some embodiments of the third aspect, in some embodiments, the first processing module is further configured to: determine the TBS based on the number of symbols indicated by the second parameter; determine the TBS based on the number of symbols in the first repetition of the first data transmission; determine the TBS based on the average number of symbols in all repetitions of the first data transmission; determine the TBS based on the maximum number of symbols in all repetitions of the first data transmission; and determine the TBS based on the minimum number of symbols in all repetitions of the first data transmission.

[0085] Fourthly, embodiments of this disclosure provide a network device, including: a second transceiver module configured to send first information, the first information indicating a time-domain resource configuration for a first data transmission; and a second processing module configured to determine a symbol for the first data transmission based on the time-domain resource configuration; wherein the symbol for the first data transmission satisfies a first condition, the first condition being that the symbol for the first data transmission does not overlap with a first type of symbol, the first type of symbol being a symbol not used for the first data transmission.

[0086] In conjunction with some embodiments of the fourth aspect, in some embodiments, the time-domain resource configuration of the first data transmission includes: a first parameter indicating the starting time slot of the first data transmission; and a second parameter indicating the starting symbol and the number of symbols of the first data transmission.

[0087] In conjunction with some embodiments of the fourth aspect, in some embodiments, the second processing module is further configured to: starting from the starting symbol in the starting time slot, sequentially traverse each symbol, and determine the symbols that satisfy the first condition as symbols for the first data transmission, until the number of symbols for the first data transmission is L; or, starting from the starting symbol in the starting time slot, sequentially traverse each symbol in the starting time slot, and determine the symbols that satisfy the first condition as symbols for the first data transmission, until one of the following: the number of symbols for the first data transmission is L; or the last symbol in the starting time slot; wherein L is the number of symbols indicated by the second parameter.

[0088] In conjunction with some embodiments of the fourth aspect, in some embodiments, the temporal resource configuration of the first data transmission further includes: a third parameter indicating the number of repetitions of the first data transmission; the second processing module is further configured to: for the first repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traverse each symbol, and determine the symbols that satisfy the first condition as the symbols of the first repetition, until the number of symbols of the first repetition is L; or, for the first repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traverse each symbol in the starting time slot, and determine the symbols that satisfy the first condition as the symbols of the first repetition, until one of the following: the number of symbols of the first data transmission is L; the last symbol in the starting time slot; wherein, L is the number of symbols indicated by the second parameter.

[0089] In conjunction with some embodiments of the fourth aspect, in some embodiments, the second processing module is further configured to: for the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, sequentially traverse each symbol, and determine the symbol that satisfies the first condition as the symbol of the i-th repetition, until the number of symbols in the i-th repetition is L; or, for the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, sequentially traverse each symbol in the reference time slot, and determine the symbol that satisfies the first condition as the symbol of the i-th repetition, until one of the following: the number of symbols in the i-th repetition is L; or the last symbol in the reference time slot; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

[0090] In conjunction with some embodiments of the fourth aspect, in some embodiments, the reference time slot corresponding to the i-th repetition is the time slot where the end symbol of the (i-1)-th repetition is located, or the next time slot after the time slot where the end symbol of the (i-1)-th repetition is located.

[0091] In conjunction with some embodiments of the fourth aspect, in some embodiments, the end symbol of the (i-1)th repetition precedes the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the time slot where the end symbol of the (i-1)th repetition is located; or, the end symbol of the (i-1)th repetition overlaps with the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located; or, the end symbol of the (i-1)th repetition follows the start symbol of the i-th repetition, and the reference time slot for the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located.

[0092] In conjunction with some embodiments of the fourth aspect, in some embodiments, the temporal resource configuration of the first data transmission further includes: a third parameter indicating the number of repetitions of the first data transmission; the second processing module is further configured to: for the first nominal repetition of the first data transmission, starting from the starting symbol in the starting time slot, sequentially traverse each symbol, and determine the symbols that satisfy the first condition as the symbols of the first nominal repetition, until the number of symbols of the first nominal repetition is L; for the i-th nominal repetition of the first data transmission, starting from the first symbol that satisfies the first condition after the ending symbol of the (i-1)-th nominal repetition, sequentially traverse each symbol, and determine the symbols that satisfy the first condition as the symbols of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; or, for the i-th nominal repetition of the first data transmission, starting from the first symbol after the ending symbol of the (i-1)-th nominal repetition, sequentially traverse each symbol, and determine the symbols that satisfy the first condition as the symbols of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

[0093] In conjunction with some embodiments of the fourth aspect, in some embodiments, the second processing module is further configured to: determine at least one actual repeating symbol included in each nominal repeat.

[0094] In conjunction with some embodiments of the fourth aspect, in some embodiments, each nominal repetition occupies two consecutive time slots, and includes an actual repetition, wherein the symbols included in the actual repetition are located in different time slots.

[0095] In conjunction with some embodiments of the fourth aspect, in some embodiments, the second processing module is further configured to: determine K nominal repetitions as the first data transmission; determine the actual repetitions included in the K nominal repetitions as the first data transmission.

[0096] In conjunction with some embodiments of the fourth aspect, in some embodiments, the second processing module is further configured to: determine the transport block size TBS of the transport block TB included in the first data transmission according to the time-domain resource configuration; the second transceiver module is further configured to: receive TB on the symbols of the first data transmission based on TBS.

[0097] In conjunction with some embodiments of the fourth aspect, in some embodiments, the second processing module is further configured to: determine the TBS based on the number of symbols indicated by the second parameter; determine the TBS based on the number of symbols in the first repetition of the first data transmission; determine the TBS based on the average number of symbols in all repetitions of the first data transmission; determine the TBS based on the maximum number of symbols in all repetitions of the first data transmission; or determine the TBS based on the minimum number of symbols in all repetitions of the first data transmission.

[0098] Fifthly, embodiments of this disclosure provide a communication device, including: one or more processors; wherein the communication device is used to perform a communication method as described in the first or second aspect.

[0099] In a sixth aspect, embodiments of this disclosure provide a communication system, including: a terminal and a network device, wherein the terminal is configured to implement the communication method as described in the first aspect; and the network device is configured to implement the communication method as described in the second aspect.

[0100] In a seventh aspect, embodiments of this disclosure provide a storage medium storing instructions that, when executed on a communication device, cause the communication device to perform a communication method as described in the first or second aspect.

[0101] Eighthly, embodiments of this disclosure provide a program product that, when executed by a communication device, causes the communication device to perform a communication method as described in the first or second aspect.

[0102] In a ninth aspect, embodiments of this disclosure provide a computer program that, when run on a computer, causes the computer to perform the methods described in the optional implementations of the first or second aspect.

[0103] In a tenth aspect, embodiments of this disclosure provide a chip or chip system. The chip or chip system includes processing circuitry configured to perform the method described according to an optional implementation of the first or second aspect above.

[0104] It is understood that the aforementioned communication devices, communication systems, storage media, program products, computer programs, chips, or chip systems are all used to execute the methods proposed in the embodiments of this disclosure. Therefore, the beneficial effects they can achieve can be referred to the beneficial effects in the corresponding methods, and will not be repeated here.

[0105] This disclosure provides a communication method, a communication device, a communication system, a storage medium, and a program product. In some embodiments, the terms "communication method," "uplink transmission method," "PUSCH transmission method," and "time domain resource configuration method" can be used interchangeably, as can the terms "communication system," "uplink transmission system," "PUSCH transmission system," and "time domain resource configuration system."

[0106] This disclosure is not exhaustive, but merely illustrative of some embodiments, and is not intended to limit the scope of protection of this disclosure. Unless otherwise specified, each step in a particular embodiment can be implemented as an independent embodiment, and the steps can be arbitrarily combined. For example, a solution after removing some steps in a particular embodiment can also be implemented as an independent embodiment, and the order of the steps in a particular embodiment can be arbitrarily interchanged. Furthermore, the optional implementation methods in a particular embodiment can be arbitrarily combined; moreover, the embodiments can be arbitrarily combined, for example, some or all steps of different embodiments can be arbitrarily combined, and a particular embodiment can be arbitrarily combined with the optional implementation methods of other embodiments.

[0107] In each of the disclosed embodiments, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions of the embodiments are consistent and can be referenced by each other. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0108] The terminology used in the embodiments of this disclosure is for the purpose of describing particular embodiments only and is not intended to limit the scope of this disclosure.

[0109] In this embodiment of the disclosure, unless otherwise stated, elements expressed in the singular form, such as "a," "an," "the," "the," "the," "the," "the," "the," "this," etc., can mean "one and only one," or "one or more," "at least one," etc. For example, when using articles such as "a," "an," "the," etc. in translation, the noun following the article can be understood as either a singular expression or a plural expression.

[0110] In the embodiments disclosed herein, "multiple" refers to two or more.

[0111] In some embodiments, the terms “at least one of”, “one or more”, “a plurality of”, “multiple”, etc., may be used interchangeably.

[0112] In some embodiments, the notation "at least one of A and B", "A and / or B", "A in one case, B in another", "in response to one case A, in response to another case B", etc., may include the following technical solutions depending on the situation: in some embodiments, A (execute A regardless of B); in some embodiments, B (execute B regardless of A); in some embodiments, execution is selected from A and B (A and B are selectively executed); in some embodiments, both A and B are executed. The same applies when there are more branches such as A, B, C, etc.

[0113] In some embodiments, the notation "A or B" may include the following technical solutions, depending on the situation: in some embodiments, A (execution of A regardless of B); in some embodiments, B (execution of B regardless of A); in some embodiments, execution is selected from A and B (A and B are selectively executed). The same applies when there are more branches such as A, B, C, etc.

[0114] The prefixes "first," "second," etc., used in the embodiments of this disclosure are merely for distinguishing different descriptive objects and do not impose restrictions on the position, order, priority, quantity, or content of the descriptive objects. The description of the descriptive objects is found in the claims or the context of the embodiments, and the use of prefixes should not constitute unnecessary restrictions. For example, if the descriptive object is a "field," the ordinal numbers preceding "field" in "first field" and "second field" do not restrict the position or order of the "fields." "First" and "second" do not restrict whether the "fields" they modify are in the same message, nor do they restrict the order of "first field" and "second field." Similarly, if the descriptive object is a "level," the ordinal numbers preceding "level" in "first level" and "second level" do not restrict the priority between "levels." Furthermore, the number of descriptive objects is not limited by ordinal numbers and can be one or more. For example, in "first device," the number of "devices" can be one or more. Furthermore, the objects modified by different prefixes can be the same or different. For example, if the object being described is "device", then "first device" and "second device" can be the same device or different devices, and their types can be the same or different. Similarly, if the object being described is "information", then "first information" and "second information" can be the same information or different information, and their content can be the same or different.

[0115] In some embodiments, “including A,” “containing A,” “for indicating A,” and “carrying A” can be interpreted as directly carrying A or indirectly indicating A.

[0116] In some embodiments, the terms “in response to…”, “in response to determining…”, “in the case of…”, “when…”, “if…”, “if…”, etc., can be used interchangeably.

[0117] In some embodiments, the terms “greater than,” “greater than or equal to,” “not less than,” “more than,” “more than or equal to,” “not less than,” “higher than,” “higher than or equal to,” “not lower than,” and “above” can be used interchangeably, as can the terms “less than,” “less than or equal to,” “not greater than,” “less than,” “less than or equal to,” “not more than,” “lower than,” “lower than or equal to,” “not higher than,” and “below”.

[0118] In some embodiments, devices, etc., can be interpreted as physical or virtual, and their names are not limited to the names recorded in the embodiments. Terms such as “device”, “equipment”, “circuit”, “network element”, “node”, “function”, “unit”, “section”, “system”, “network”, “chip”, “chip system”, “entity”, and “subject” can be used interchangeably.

[0119] In some embodiments, "network" can be interpreted as devices included in a network (e.g., access network devices, core network devices, etc.).

[0120] In some embodiments, the terms "network devices", "access network device (AN device)", "radio access network device (RAN device)", "base station (BS)", "radio base station", "fixed station", "node", "access network node", "access point", "transmission point (TP)", "reception point (RP)", "transmission / reception point (TRP)", "panel", "antenna panel", "antenna array", "cell", "macro cell", "small cell", "femtocell", "pico cell", "sector", "cell group", "serving cell", "carrier", "component carrier", and "bandwidth part (BWP)" can be used interchangeably.

[0121] In some embodiments, the terms "terminal", "terminal device", "user equipment (UE)", "user terminal", "mobile station (MS)", "mobile terminal (MT)", "subscriber station", "mobile unit", "subscriber unit", "wireless unit", "remote unit", "mobile device", "wireless device", "wireless communication device", "remote device", "mobile subscriber station", "access terminal", "mobile terminal", "wireless terminal", "remote terminal", "handset", "user agent", "mobile client", and "client" can be used interchangeably.

[0122] In some embodiments, access network devices, core network devices, or network devices can be replaced by terminals. For example, embodiments of this disclosure can also be applied to structures where communication between access network devices, core network devices, or network devices and terminals is replaced by communication between multiple terminals (e.g., device-to-device (D2D), vehicle-to-everything (V2X), etc.). In this case, the structure can also be configured such that the terminal has all or part of the functions of the access network device. Furthermore, terms such as "uplink" and "downlink" can be replaced with terms corresponding to communication between terminals (e.g., "sidelink"). For example, uplink channel, downlink channel, etc., can be replaced with sidelink channel, and uplink link, downlink, etc., can be replaced with sidelink link.

[0123] In some embodiments, the terminal may be replaced by an access network device, a core network device, or a network device. In this case, the access network device, core network device, or network device may also be configured to have all or some of the functions of the terminal.

[0124] In some embodiments, the acquisition of data, information, etc., may comply with the laws and regulations of the country where the location is situated.

[0125] In some embodiments, data, information, etc., may be obtained with the user's consent.

[0126] Furthermore, each element, each row, or each column in the table of this disclosure can be implemented as an independent embodiment, and any combination of any element, any row, or any column can also be implemented as an independent embodiment.

[0127] Figure 1A is a schematic diagram of an architecture of a communication system according to an embodiment of the present disclosure. As shown in Figure 1A, the communication system 100 includes: a terminal 101 and a network device 102.

[0128] In some embodiments, terminal 101 includes, but is not limited to, at least one of the following: mobile phone, wearable device, Internet of Things device, car with communication function, smart car, tablet computer, computer with wireless transceiver function, virtual reality (VR) terminal device, augmented reality (AR) terminal device, wireless terminal device in industrial control, wireless terminal device in self-driving, wireless terminal device in remote medical surgery, wireless terminal device in smart grid, wireless terminal device in transportation safety, wireless terminal device in smart city, and wireless terminal device in smart home.

[0129] In some embodiments, network device 102 includes access network device and core network device. Access network device is, for example, a node or device that connects a terminal to a wireless network. Access network device may include, but is not limited to, at least one of the following: evolved NodeB (eNB), next-generation eNB (ng-eNB), next-generation NodeB (gNB), node B (NB), home node B (HNB), home evolved node B (HeNB), wireless backhaul device, radio network controller (RNC), base station controller (BSC), base transceiver station (BTS), base band unit (BBU), mobile switching center, base station in a 6G communication system, open RAN, cloud RAN, base station in other communication systems, and access node in a Wi-Fi system.

[0130] In some embodiments, the technical solutions of this disclosure can be applied to the Open RAN architecture. In this case, the interfaces between or within network devices involved in the embodiments of this disclosure can be transformed into internal interfaces of Open RAN. The processes and information interactions between these internal interfaces can be implemented by software or programs.

[0131] In some embodiments, the access network device may be composed of a CU and a DU. The CU may also be called a control unit. The CU-DU structure can separate the protocol layer of the network device. Some of the protocol layer functions are centrally controlled by the CU, while the remaining part or all of the protocol layer functions are distributed in the DU, which is centrally controlled by the CU. However, this is not the only possibility.

[0132] In some embodiments, the core network equipment may be a single device including a first network element, or it may be multiple devices or a group of devices, each including a first network element. Network elements may be virtual or physical. The core network may include, for example, at least one of an Evolved Packet Core (EPC), a 5G Core Network (5GCN), or a Next Generation Core (NGC).

[0133] It is understood that the communication system described in this disclosure is for the purpose of more clearly illustrating the technical solutions of this disclosure, and does not constitute a limitation on the technical solutions provided in this disclosure. As those skilled in the art will know, with the evolution of system architecture and the emergence of new business scenarios, the technical solutions provided in this disclosure are also applicable to similar technical problems.

[0134] The following embodiments of this disclosure can be applied to the communication system 100 shown in FIG1A, or to some of the main bodies, but are not limited thereto. The main bodies shown in FIG1A are illustrative. The communication system may include all or some of the main bodies in FIG1A, or it may include other main bodies outside of FIG1A. The number and form of each main body are arbitrary. The connection relationship between the main bodies is illustrative. The main bodies may not be connected or may be connected. The connection can be in any way, it can be a direct connection or an indirect connection, it can be a wired connection or a wireless connection.

[0135] The embodiments disclosed herein can be applied to Long Term Evolution (LTE), LTE-Advanced (LTE-A), LTE-Beyond (LTE-B), SUPER 3G, IMT-Advanced, 4th generation mobile communication system (4G), 5th generation mobile communication system (5G), 5G new radio (NR), Future Radio Access (FRA), New-Radio Access Technology (RAT), New Radio (NR), New radio access (NX), Future generation radio access (FX), Global System for Mobile communications (GSM), CDMA2000, Ultra Mobile Broadband (UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), and IEEE 802.20, Ultra-Wideband (UWB), Bluetooth (a registered trademark), Public Land Mobile Network (PLMN) networks, Device-to-Device (D2D) systems, Machine-to-Machine (M2M) systems, Internet of Things (IoT) systems, Vehicle-to-Everything (V2X) systems, systems utilizing other communication methods, and next-generation systems built upon them, etc. Furthermore, multiple systems can be combined (e.g., a combination of LTE or LTE-A with 5G).

[0136] The following is an explanation and interpretation of the terminology used in this disclosure.

[0137] I. Time-domain resources of PUSCH.

[0138] Network devices configure time-domain resources for terminals to send PUSCH, including: the time slot for sending PUSCH, the number of symbols for PUSCH, and the start symbol for PUSCH within the time slot. Based on these parameters, the terminal can uniquely determine the time-domain resources for sending PUSCH, and the network device will also receive the PUSCH sent by the terminal on those time-domain resources.

[0139] In some embodiments, the network device can configure the slot offset, start symbol, and allocation length for the terminal to send PUSCH. The slot offset is represented by parameter k2, the start symbol by parameter S, and the allocation length by parameter L.

[0140] In some embodiments, k2 indicates the starting time slot configured for PUSCH, S indicates the starting symbol configured for PUSCH, and L indicates the number of symbols configured for PUSCH. The value of S is the symbol index of the starting symbol within a time slot, with the symbol index starting from 0. A symbol index of 0 corresponds to the first symbol in the time slot, and so on, until the last symbol of the time slot. In some embodiments, S and L can be replaced by a start and length indicator value (SLIV), which is determined based on S and L, as follows:

[0141] If (L-1)≤7, then SLIV=14×(L-1)+S;

[0142] Otherwise, SLIV = 14 × (14 - L + 1) + (14 - 1 - S), where 0 <L≤14-S。

[0143] In some embodiments, Figure 1B is a schematic diagram of the time domain resources of a single-slot PUSCH. As shown in Figure 1B, k2=3, S=2, L=10, k2 indicates that the starting time slot of the PUSCH is uplink time slot #3, S indicates that the starting symbol of the PUSCH is the 3rd symbol in the time slot, and L indicates that the number of symbols of the PUSCH is 10. Then, the time domain resources of the PUSCH configured by the network device for the terminal are 10 consecutive symbols starting from the 3rd symbol in time slot #3.

[0144] In some embodiments, all symbols in the downlink slot of Figure 1B are downlink symbols, all symbols in the uplink slot are uplink symbols, the first 8 symbols in the special slot are downlink symbols, the last 2 symbols are uplink symbols, and the remaining symbols are flexible symbols.

[0145] II. PUSCH mapping type

[0146] PUSCH supports two mapping types: PUSCH mapping type A and PUSCH mapping type B. The two mapping types have different restrictions on S and L, as well as S plus L. Table 1 shows the PUSCH mapping types. As shown in Table 1, for PUSCH mapping type A, only the starting symbol of the PUSCH is allowed to be the first symbol of the time slot, and the time-domain resources of the PUSCH are not allowed to cross time slot boundaries. For PUSCH mapping type B, the starting symbol of the PUSCH is allowed to be any symbol of the time slot.

[0147] Table 1

[0148] III. PUSCH repetition type

[0149] PUSCH supports repetition, including two repetition types: PUSCH repetition type A and PUSCH repetition type B. PUSCH repetition type A is slot-level repetition, where each slot uses the same symbol allocation, meaning the start symbol S and length L are identical. PUSCH repetition type B is mini-slot-level or symbol-level repetition. For PUSCH repetition type A, time-domain resources of PUSCH are not allowed to cross slot boundaries; for PUSCH repetition type B, time-domain resources of PUSCH are allowed to cross slot boundaries, but not consecutively across two slot boundaries.

[0150] In some embodiments, for PUSCH repetition type A, when the network device configures the terminal's PUSCH repetition type to PUSCH repetition type A through higher-layer parameters, the terminal sends PUSCH using PUSCH repetition type A. The network device indicates the repetition number of the backup PUSCH, represented by the parameter K. The K repetitions are sequentially allocated across K time slots, and the K time slots use the same symbol allocation, i.e., the symbol on each time slot is determined according to S and L (or SLIV).

[0151] In some embodiments, the determination of the K time slots is divided into two methods: physical time slot counting and available time slot counting.

[0152] In some embodiments, the physical time slot count refers to K consecutive time slots starting from the time slot indicated by k2. In some embodiments, subject to conflict criteria, not all K time slots may be used to transmit PUSCH. For example, if the symbols indicated by S and L (or SLIV) in one of the K time slots include downlink symbols, synchronization signal block (SSB) symbols, or sounding reference signal (SRS) symbols, then PUSCH cannot be transmitted in that time slot.

[0153] In some embodiments, available time slot counting refers to checking each time slot one by one, starting from the time slot indicated by k2, until K time slots that can be used to transmit PUSCH are found. A time slot that can be used to transmit PUSCH is a time slot within a time slot whose symbols indicated by S and L (or SLIV) do not include downlink symbols, SSB symbols, or SRS symbols. A time slot that cannot be used to transmit PUSCH is a time slot within a time slot whose symbols indicated by S and L (or SLIV) include downlink symbols, SSB symbols, or SRS symbols.

[0154] In one example, Figure 1C is a time-domain resource diagram of PUSCH repetition type A based on physical time slot count, where k2=3, S=2, L=10, and K=4. As shown in Figure 1C, time slots #3 to #6 are allocated to PUSCH repetition type A. In time slots #3 and #4, the symbols indicated by S and L (or SLIV) do not include downlink symbols, SSB symbols, or SRS symbols. In time slots #5 and #6, the symbols indicated by S and L (or SLIV) include downlink symbols. Therefore, the terminal device will send PUSCH in time slots #3 and #4, but will not send PUSCH in time slots #5 and #6.

[0155] In one example, Figure 1D is a temporal resource diagram of PUSCH repetition type A based on available time slot counts. The values ​​of parameters k2, S, L, and K are the same as in Figure 1C. As shown in Figure 1D, starting from time slot #3, the first four time slots (excluding downlink symbols, SSB symbols, or SRS symbols) indicated by S and L (or SLIV) are time slots #3, #4, #8, and #9, respectively. Therefore, the terminal device will transmit PUSCH on these four time slots.

[0156] In some embodiments, for PUSCH repetition type B, when the network device configures the terminal's PUSCH repetition type to PUSCH repetition type B through higher-layer parameters, the terminal sends PUSCH using PUSCH repetition type B. The network device will indicate the terminal device to the number of repetitions K. The time-domain resource allocation for PUSCH repetition type B consists of two steps: first, determining the nominal repetition; second, determining the actual repetition.

[0157] In some embodiments, the number of nominal repetitions is K, each nominal repetition includes L consecutive symbols, the starting symbol of the first nominal repetition is the symbol indicated by S in the time slot indicated by k2, the second nominal repetition is the symbol following the last symbol of the first nominal repetition, and so on.

[0158] In some embodiments, a nominal repeat includes at least one actual repeat, each actual repeat being a consecutive set of all valid symbols available for transmission of PUSCH within a time slot, wherein valid symbols are symbols other than invalid symbols, including downlink symbols, SSB symbols, SRS symbols, symbols indicated by higher-layer signaling, etc. If an actual repeat includes only one symbol, then that actual repeat is ignored.

[0159] In some embodiments, PUSCH repeat type B can only use PUSCH mapping type B, so only S and L can be used to indicate time-domain resources, and SLIV cannot be used to indicate time-domain resources.

[0160] In some embodiments, Figure 1E is a time-domain resource diagram of PUSCH repetition type B, where k2 = 3, S = 12, L = 4, and K = 4. As shown in Figure 1E, the PUSCH includes 4 nominal repetitions, each of which includes 4 symbols. The 4 nominal repetitions are contiguous in the time domain. Due to the crossing of time slot boundaries, nominal repetition #0 includes two actual repetitions (actual repetition #0 and actual repetition #1). Actual repetition #0 includes the 13th and 14th symbols located in time slot #3, and actual repetition #1 includes the 1st and 2nd symbols located in time slot #4. Since the 4th and 9th symbols in time slot #4 are invalid symbols, and the number of symbols in an actual repetition must be greater than 1, nominal repetition #1 includes one actual repetition (actual repetition #2), which includes the 5th and 6th symbols located in time slot #4. Nominal repetition #2 includes one actual repetition (actual repetition #3), which includes the 7th and 8th symbols located in time slot #4. Since there are no invalid symbols and it does not cross the time slot boundary, nominal repetition #3 is an actual repetition (actual repetition #4), which includes the 14th symbol of the 11th symbol value located in time slot #4.

[0161] IV. Transport block processing over multiple slots (TBoMS)

[0162] PUSCH supports TBoMS. For single-slot PUSCH and PUSCH repetition type A, one time slot processes one transport block (TB). The transport block size (TBS) is determined based on the time-domain resources on one time slot. The TB will be transmitted on one time slot (i.e., single-slot PUSCH), or the TB will be transmitted repeatedly on K time slots (i.e., PUSCH repetition type A). For TBoMS, multiple time slots process one TB. The TBS is determined based on the time-domain resources on multiple time slots, and the TB will be transmitted on these multiple time slots. Therefore, the network device will notify the terminal of the number of time slots N for TBoMS. The terminal will determine the TBS based on the time-domain resources on N time slots and complete the transmission of the TB on N time slots.

[0163] In some embodiments, the time-domain resource allocation method of TBoMS (including N time slots and symbol allocation within each time slot) is the same as the time-domain resource allocation method of PUSCH repetition type A, but only the available time slot count can be used. TBoMS can be used in combination with PUSCH repetition type A. When TBoMS and PUSCH repetition type A are used in combination, the terminal determines N×K time slots according to the available time slot count method, where K groups of N time slots represent K repetitions of one TBoMS.

[0164] In one example, Figure 1F is a schematic diagram of the time-domain resources combining TBoMS and PUSCH repetition type A, where k2 = 3, N = 2, K = 2, S = 2, and L = 10. According to the time-domain resource allocation method of PUSCH repetition type A, TBoMS uses the same symbol allocation in each time slot, i.e., the 3rd to 12th symbols of each time slot; according to the available time slot counting method, TBoMS is allocated in time slots #3, #4, #8, and #9, with the first TBoMS repetition allocated to time slots #3 and #4, and the second TBoMS repetition allocated to time slots #8 and #9.

[0165] In some embodiments, in order to support flexible time domain resource allocation without incurring a large amount of signaling overhead, the time domain resources for sending PUSCH can be indicated by a "time domain resource allocation (TDRA) table + row index".

[0166] In some embodiments, the network device configures a TDRA table for the terminal via higher-layer signaling, or the terminal device uses the default TDRA table.

[0167] In some embodiments, the TDRA table includes at least one row, each row corresponding to a candidate value of a PUSCH mapping type, a candidate value of k2, a candidate value of S, a candidate value of L, a candidate value of SLIV, a candidate value of K, and / or a candidate value of N.

[0168] In some embodiments, the network device notifies the terminal of a row index that indicates a row in the TDRA table. The terminal uses the candidate values ​​of the PUSCH mapping type corresponding to that row, the candidate values ​​of k2, S, L, K, and N to determine the time domain resources for sending PUSCH.

[0169] In some embodiments, a row in the TDRA table does not necessarily need to include all parameters (PUSCH mapping type, k2, S, L, SLIV, K, N); these parameters are optional. In one example, for a single-slot PUSCH, K and N may not be configured. In one example, if it is not a TBoMS, N may not be configured. In one example, for repeating type B, SLIV may not be configured. In one example, if SLIV is used, S and L may not be configured.

[0170] In some embodiments, a row in the TDRA table may include multiple sets of parameters, each set including at least one of the following: PUSCH mapping type, k2, S, L, SLIV, K, N. In this case, multiple PUSCHs (Multi-PUSCHs, Multiple PUSCHs) can be scheduled at once, and each PUSCH uses one of the sets of parameters to determine the time-domain resources. The number of PUSCHs is equal to the number of SLIVs, or the number of sets of S and L.

[0171] In some embodiments, multiple PUSCH scheduling does not support PUSCH duplication. If the higher-layer signaling is configured with K greater than 1, then K is assumed to be equal to 1; or, if a row in the TDRA table includes multiple SLIVs and multiple Ks, and at least one K is greater than 1, then all Ks greater than 1 are assumed to be 1.

[0172] In one example, Figures 1G and 1H illustrate time-domain resource scheduling for multiple PUSCHs. In Figure 1G, assuming a row in the TDRA table includes a k2 and two SLIVs, with the two SLIVs corresponding to the first 7 symbols and the last 7 symbols of slot #4 respectively, then this row schedules two PUSCHs. The first PUSCH is allocated to the first 7 symbols of the slot indicated by k2, and the second PUSCH is allocated to the last 7 symbols of the slot indicated by k2. In Figure 1H, assuming a row in the TDRA table includes two k2s and two SLIVs, the first k2 and the first SLIV indicate that the first PUSCH is allocated to all symbols of slot #3, and the second k2 and the second SLIV indicate that the second PUSCH is allocated to all symbols of slot #4.

[0173] V. TBS Calculation

[0174] The process of TBS calculation is as follows:

[0175] Step 1: Determine the number N of REs used for PUSCH transmission within a time slot. RE .

[0176] Step 1-1: Determine the number N′ of resource elements (REs) within a physical resource block (PRB) allocated to PUSCH. RE , in The number of subcarriers included in a PRB. The number of symbols L allocated to PUSCH, This refers to the number of REs (Remote Elements) occupied by the code division multiplexing (CDM) blocks in each PRB (Programmable Block) corresponding to L symbols, excluding the data in the demodulation reference signal (DMRS). The overhead of configuring higher-level signaling. For PUSCH repetition type B, It is determined by the nominal repetition of L symbols.

[0177] Steps 1-2, determine N RE If TBoMS is configured, then N RE =N·min(156,N′) RE )·n PRB , where n PRB N is the number of PRBs allocated to PUSCH, and N is the number of time slots in TBoMS. Otherwise, N RE =min(156,N′) RE )·n PRB .

[0178] Step 2: Calculate the non-quantified intermediate variable N info =N RE ·R·Q m ·v, where R is the target code rate of PDSCH, and Q m v represents the modulation order of the PDSCH, and v represents the layer number of the PDSCH.

[0179] Step 3: If N info If the value is ≤3824, perform the following steps: Calculate the intermediate variables for quantification. in, Based on Table 2, find the value of N not less than N. i ′ nfo The minimum value is taken as TBS. Table 2 shows N. info ≤3824 TBS.

[0180] Table 2

[0181] Step 4: If N info >3824, perform the following steps:

[0182] Calculate intermediate variables for quantification in, The round operation represents rounding.

[0183] if in,

[0184] otherwise,

[0185] If N′ info >8424, in,

[0186] otherwise,

[0187] VI. Transmission Occasion (TO)

[0188] The transmission timing of PUSCH is defined as a slot index within the system frame corresponding to system frame number (SFN) #SFN. Time slot index The first symbol S in the corresponding time slot, and the number of consecutive symbols L. For PUSCH repetition type B, a PUSCH transmission timing is defined as a nominal repetition.

[0189] In some embodiments, the symbol allocation for each time slot is currently the same for the time domain resource allocation of PUSCH. This reduces the flexibility of time domain resource allocation, wastes some uplink resources, and thus affects uplink coverage performance.

[0190] This disclosure provides a communication method, communication device, communication system, storage medium, and program product. Based on the temporal resource configuration of a first data transmission, the symbols for the first data transmission are determined. The symbols for the first data transmission satisfy a first condition: the symbols for the first data transmission do not overlap with a first type of symbol, and the first type of symbol is not used for the first data transmission. Thus, this disclosure allows for the allocation of temporal resources at the symbol granularity, making the allocation of temporal resources more flexible and improving the utilization and coverage performance of temporal resources.

[0191] In some embodiments, the first data transmission can be either an uplink transmission or a downlink transmission.

[0192] In some embodiments, the first data transmission may be PUSCH, physical downlink shared channel (PDSCH), SRS transmission, or SSB transmission.

[0193] In some embodiments, the first data transmission may be a PUSCH of repeating type A, a PUSCH of repeating type B, or a PUSCH of TBoMS.

[0194] In some embodiments, the first type of symbol may be a predefined symbol or a symbol configured by the network device.

[0195] In some embodiments, the first type of symbol may be a semi-statically configured symbol, a symbol configured by the network device through higher-layer signaling, or a symbol configured by the network device through a system information block (SIB).

[0196] In some embodiments, the first type of symbols includes at least one of the following: synchronization signal block symbols, uplink symbols, downlink symbols, probe reference signal symbols, and symbols indicating higher-layer signaling.

[0197] In some embodiments, when the first data transmission is PUSCH, the first type of symbols are symbols not used for PUSCH. In one example, the first type of symbols includes at least one of the following: downlink symbols, SSB symbols, SRS symbols, symbols indicated by higher-layer signaling, etc.

[0198] In some embodiments, when the first data transmission is PDSCH, the first type of symbols are symbols not used for PDSCH. In one example, the first type of symbols includes at least one of the following: uplink symbols, symbols indicating higher-layer signaling, etc.

[0199] In some embodiments, when the first data transmission is an SRS transmission, the first type of symbols are symbols not used for SRS transmission. In one example, the first type of symbols includes at least one of the following: downlink symbols, PUSCH symbols, SSB symbols, symbols indicating higher-layer signaling, etc.

[0200] The communication method of this disclosure embodiment is described below using PUSCH as an example of the first data transmission.

[0201] Figure 2A is an interactive schematic diagram of a communication method provided according to an embodiment of the present disclosure. As shown in Figure 2A, the present disclosure relates to a communication method. Executed by a communication system 100, the communication method includes steps S2101 to S2106.

[0202] In step S2101, the network device sends the first information.

[0203] In some embodiments, the terminal receives first information.

[0204] In some embodiments, the first information indicates the time-domain resources of the PUSCH.

[0205] In some embodiments, the first information indicates the time-domain resource configuration of the PUSCH.

[0206] In some embodiments, the first information indicates parameters used to determine the time-domain resources of the PUSCH.

[0207] In some embodiments, the first information indicates at least one time slot of the PUSCH.

[0208] In some embodiments, the first information indicates at least one symbol of PUSCH.

[0209] In some embodiments, the first information indicates the start time slot of the PUSCH, the start symbol of the PUSCH, and the number of symbols in the PUSCH.

[0210] In some embodiments, the first information also indicates the number of times PUSCH is repeated.

[0211] In some embodiments, the first information indicates a first parameter and a second parameter. The first parameter indicates the start time slot of the PUSCH, and the second parameter indicates the start symbol and the number of symbols in the PUSCH.

[0212] In some embodiments, the first information indicates a first parameter, a second parameter, and a third parameter. The third parameter indicates the number of times PUSCH is repeated.

[0213] In some embodiments, the first information indicates a first parameter, a fourth parameter, and a fifth parameter. The fourth parameter indicates the starting symbol of the PUSCH, and the fifth parameter indicates the number of symbols in the PUSCH.

[0214] In some embodiments, the first information indicates the first parameter, the third parameter, the fourth parameter, and the fifth parameter.

[0215] In some embodiments, the first parameter is represented by k2, the second parameter by SLIV, the third parameter by K, the fourth parameter by S, and the fifth parameter by L. In one example, the first information indicates k2 and SLIV. In another example, the first information indicates k2, SLIV, and K. In yet another example, the first information indicates k2, S, and L. In yet another example, the first information indicates k2, S, L, and K.

[0216] In step S2102, the terminal determines the symbol of PUSCH based on the first information.

[0217] In some embodiments, the terminal determines the starting time slot, the starting symbol, and the number of symbols of the PUSCH based on the first information, and determines the number of symbols of the PUSCH based on the starting time slot, the starting symbol, and the number of symbols of the PUSCH.

[0218] In some embodiments, the first information indicates k2, S, and L. The terminal determines the starting time slot of the PUSCH based on k2, the starting symbol of the PUSCH based on S, and the number of symbols of the PUSCH based on L.

[0219] In some embodiments, the first information indicates k2 and SLIV, and the terminal determines the starting time slot of the PUSCH based on k2 and the starting symbol and number of symbols of the PUSCH based on SLIV.

[0220] In some embodiments, the terminal starts from the start symbol in the start time slot, determines the symbols that satisfy the first condition as PUSCH symbols, and determines the symbols that do not satisfy the first condition as PUSCH symbols.

[0221] In some embodiments, the terminal starts from the starting symbol in the starting time slot, traverses each symbol sequentially, and determines the symbols that meet the first condition as PUSCH symbols until the number of PUSCH symbols is L (denoted as Method 1).

[0222] In some embodiments, the terminal starts from the starting symbol in the starting time slot, traverses each symbol in the starting time slot in turn, and determines the symbol that satisfies the first condition as the symbol of PUSCH until the last symbol in the starting time slot (denoted as method 2-1).

[0223] In some embodiments, the terminal starts from the starting symbol in the starting time slot, traverses each symbol in the starting time slot in turn, and determines the symbols that meet the first condition as PUSCH symbols until the number of PUSCH symbols is L (denoted as method 2-2).

[0224] In some embodiments, for method 1, the symbols of the PUSCH determined by the terminal can be located in the same time slot or in different time slots, that is, method 1 supports PUSCH symbols spanning time slots. For method 2 (including method 2-1 and method 2-2), the symbols of the PUSCH determined by the terminal are located in the same time slot, that is, method 2 supports PUSCH symbols within one time slot.

[0225] In some embodiments, for method 1, the number of symbols for the PUSCH determined by the terminal is equal to the number of symbols for the PUSCH indicated by the first information. For method 2, the number of symbols for the PUSCH determined by the terminal is less than or equal to the number of symbols for the PUSCH indicated by the first information.

[0226] In one example, taking method 1 as an example, Figure 2B is a schematic diagram of the time-domain resources of the PUSCH determined based on method 1. As shown in Figure 2B, k2 indicates the starting time slot as uplink time slot #3, S indicates the starting symbol as the first symbol, and L indicates the number of symbols as 8. The terminal starts from the first symbol in uplink time slot #3 and traverses each symbol in turn. Since the third to sixth symbols and the ninth to twelfth symbols in uplink time slot #3 are first-class symbols, these symbols are not determined as PUSCH symbols. Instead, the first to second symbols, the seventh to eighth symbols, the thirteenth to fourteenth symbols in uplink time slot #3, and the first to second symbols in uplink time slot #4, a total of 8 symbols, are determined as PUSCH symbols.

[0227] In one example, taking method 2-1 as an example, Figure 2C is a schematic diagram of the time-domain resources of the PUSCH determined based on method 2-1. As shown in Figure 2C, k2 indicates the starting time slot as uplink time slot #3, S indicates the starting symbol as the first symbol, and L indicates the number of symbols as 8. The terminal starts from the first symbol in uplink time slot #3 and traverses each symbol in uplink time slot #3 in sequence. Since the third to sixth symbols and the ninth to twelfth symbols in uplink time slot #3 are first-class symbols, these symbols are not determined as PUSCH symbols. Instead, the first to second symbols, the seventh to eighth symbols, and the thirteenth to fourteenth symbols in uplink time slot #3, a total of 6 symbols, are determined as PUSCH symbols.

[0228] In one example, taking method 2-2 as an example, Figure 2D is a schematic diagram of the time-domain resources of PUSCH determined based on method 2-2. As shown in Figure 2D, k2 indicates the starting time slot as uplink time slot #3, S indicates the starting symbol as the first symbol, and L indicates the number of symbols as 4. The terminal starts from the first symbol in uplink time slot #3 and traverses each symbol in uplink time slot #3 in sequence. Since the third to sixth symbols and the ninth to twelfth symbols in uplink time slot #3 are first-class symbols, these symbols are not determined as PUSCH symbols. Instead, the first to second symbols and the seventh to eighth symbols in uplink time slot #3, a total of 4 symbols, are determined as PUSCH symbols.

[0229] In some embodiments, the terminal determines the starting time slot of the PUSCH, the starting symbol of the PUSCH, the number of symbols of the PUSCH, and the number of repetitions of the PUSCH based on the first information, and determines the symbol of the PUSCH based on the starting time slot of the PUSCH, the starting symbol of the PUSCH, the number of symbols of the PUSCH, and the number of repetitions of the PUSCH.

[0230] In some embodiments, the first information indicates k2, S, L and K, and the terminal determines the starting time slot of PUSCH according to k2, the starting symbol of PUSCH according to S, the number of symbols of PUSCH according to L, and the number of repetitions of PUSCH according to K.

[0231] In some embodiments, the first information indicates k2, SLIV, and K. The terminal determines the starting time slot of the PUSCH based on k2, the starting symbol and the number of symbols of the PUSCH based on SLIV, and the number of repetitions of the PUSCH based on K.

[0232] In some embodiments, for the first repetition of PUSCH repetition type A, the terminal may use method 1, method 2-1, and method 2-2 to determine the symbol of the first repetition. Specific implementation details can be found in the embodiments of method 1, method 2-1, and method 2-2, and will not be elaborated here.

[0233] In some embodiments, for the i-th repetition of PUSCH repetition type A, the terminal starts from the starting symbol in the reference time slot corresponding to the i-th repetition, traverses each symbol sequentially, and determines the symbol that satisfies the first condition as the symbol of the i-th repetition, until the number of symbols in the i-th repetition is L (denoted as method 3). Where i = 2, 3, ..., K.

[0234] In some embodiments, for the i-th repetition of PUSCH repetition type A, the terminal starts from the first symbol in the reference time slot corresponding to the i-th repetition, sequentially traverses each symbol in the reference time slot, and determines the symbol that satisfies the first condition as the symbol of the i-th repetition, until the last symbol in the reference time slot (denoted as method 4-1). Where i = 2, 3, ..., K.

[0235] In some embodiments, for the i-th repetition of PUSCH repetition type A, the terminal starts from the starting symbol in the reference time slot corresponding to the i-th repetition, and sequentially traverses each symbol in the reference time slot, determining the symbol that satisfies the first condition as the symbol of the i-th repetition, until the number of symbols in the i-th repetition is L (denoted as method 4-2). Where i = 2, 3, ..., K.

[0236] In some embodiments, for method 3, the i-th repeating symbol determined by the terminal can be located in the same time slot or in different time slots, that is, method 3 supports the i-th repeating symbol spanning time slots. For method 4 (including method 4-1 and method 4-2), the i-th repeating symbol determined by the terminal is located in the same time slot, that is, method 4 supports the i-th repeating symbol being in one time slot.

[0237] In some embodiments, for method 3, the number of symbols in the i-th repetition determined by the terminal is equal to the number of symbols indicated by the first information. For method 4, the number of symbols in the i-th repetition determined by the terminal is less than or equal to the number of symbols indicated by the first information.

[0238] In some embodiments, the reference time slot corresponding to the i-th repetition of PUSCH repetition type A is the time slot where the end symbol of the (i-1)-th repetition is located (denoted as method A-1).

[0239] In some embodiments, the reference time slot corresponding to the i-th repetition of PUSCH repetition type A is the time slot following the time slot of the end symbol of the (i-1)-th repetition (denoted as method A-2).

[0240] In some embodiments, for method A-1, when the terminal determines the symbol of the i-th repetition starting from the start symbol in the time slot where the end symbol of the (i-1)-th repetition is located, the first type of symbol also includes: the symbol of the (i-1)-th repetition. That is, when the terminal adopts method A-1, it should avoid the overlap between the symbol of the i-th repetition and the symbol of the (i-1)-th repetition.

[0241] In some embodiments, the terminal may use method A-1 or method A-2 to determine the reference time slot corresponding to the i-th repetition. In some embodiments, the terminal may determine to use method A-1 or method A-2 based on its own implementation, based on the instruction of the network device, or based on the protocol specification.

[0242] In some embodiments, if the end symbol of the (i-1)th repetition precedes the start symbol of the i-th repetition, the terminal determines the reference time slot corresponding to the i-th repetition based on method A-1. If the end symbol of the (i-1)th repetition overlaps with the start symbol of the i-th repetition, the terminal determines the reference time slot corresponding to the i-th repetition based on method A-2. If the end symbol of the (i-1)th repetition follows the start symbol of the i-th repetition, the terminal determines the reference time slot corresponding to the i-th repetition based on method A-2.

[0243] In some embodiments, for method 4-1 or method 4-1, the terminal can determine the reference time slot corresponding to the i-th repetition based on method A-2, where i = 2, 3, ..., K.

[0244] In some embodiments, for method 4-1 or method 4-2, the terminal may determine each time slot of each repetition (including the first repetition and the i-th repetition) based on the physical time slot count or the available time slot count, and determine the symbol of each repetition within each time slot based on method 4-1 or method 4-2.

[0245] In one example, taking method 3 and method A-1 as examples, Figure 2E is a schematic diagram of the time-domain resources of PUSCH repetition type A determined based on method 3 and method A-1. As shown in Figure 2E, k2 indicates the starting time slot as uplink time slot #2, S indicates the starting symbol as the third symbol, L indicates the number of symbols as 6, and K indicates the number of repetitions as 2. For the first repetition (i.e., repetition #0 in the figure), the terminal starts from the third symbol in uplink time slot #2 and traverses each symbol sequentially. Since the third to sixth symbols and the ninth to twelfth symbols in uplink time slot #2 are first-class symbols, these symbols are not determined as PUSCH symbols. Instead, the seventh to eighth symbols, the thirteenth to fourteenth symbols in uplink time slot #2, and the first to second symbols in uplink time slot #3, a total of 6 symbols, are determined as the symbols of the first repetition of PUSCH repetition type A. For the second repetition (i.e., repetition #1 in the diagram), since the end symbol of the first repetition (i.e., the second symbol in uplink time slot #3) is before the start symbol of the second repetition (i.e., the third symbol in uplink time slot #3), the reference time slot for the second repetition is the time slot where the end symbol of the first repetition is located, i.e., uplink time slot #3. Then, starting from the third symbol in uplink time slot #3, the terminal traverses each symbol in turn, and determines the symbols from the third symbol to the eighth symbol in uplink time slot #3, a total of 6 symbols, as the symbols for the second repetition of PUSCH repetition type A.

[0246] In one example, taking method 3 and method A-2 as examples, Figure 2F is a schematic diagram of the time-domain resources of PUSCH repetition type A determined based on method 3 and method A-2. As shown in Figure 2F, k2 indicates the starting time slot as uplink time slot #2, S indicates the starting symbol as the third symbol, L indicates the number of symbols as 8, and K indicates the number of repetitions as 2. For the first repetition (i.e., repetition #0 in the figure), the terminal starts from the third symbol in uplink time slot #2 and traverses each symbol sequentially. Since the third to sixth symbols and the ninth to twelfth symbols in uplink time slot #2 are first-class symbols, these symbols are not determined as PUSCH symbols. Instead, the seventh to eighth symbols, the thirteenth to fourteenth symbols in uplink time slot #2, and the first to fourth symbols in uplink time slot #3, a total of 8 symbols, are determined as the symbols of the first repetition of PUSCH repetition type A. For the second repetition (i.e., repetition #1 in the diagram), since the end symbol of the first repetition (i.e., the fourth symbol in uplink time slot #3) is after the start symbol of the second repetition (i.e., the third symbol in uplink time slot #3), the reference time slot corresponding to the second repetition is the next time slot after the time slot where the end symbol of the first repetition is located, i.e., uplink time slot #4. Then, starting from the third symbol in uplink time slot #4, the terminal traverses each symbol in turn, and determines the symbols of the second repetition of PUSCH repetition type A from the third symbol to the tenth symbol in uplink time slot #4.

[0247] In one example, taking method 3 and method A-2 as examples, Figure 2G is a schematic diagram of the time-domain resources of PUSCH repetition type A determined based on method 3 and method A-2. As shown in Figure 2G, k2 indicates the starting time slot as uplink time slot #2, S indicates the starting symbol as the third symbol, L indicates the number of symbols as 7, and K indicates the number of repetitions as 2. For the first repetition (i.e., repetition #0 in the figure), the terminal starts from the third symbol in uplink time slot #2 and traverses each symbol sequentially. Since the third to sixth symbols and the ninth to twelfth symbols in uplink time slot #2 are first-class symbols, these symbols are not determined as PUSCH symbols. Instead, the seventh to eighth symbols, the thirteenth to fourteenth symbols in uplink time slot #2, and the first to third symbols in uplink time slot #3, a total of 7 symbols, are determined as the symbols of the first repetition of PUSCH repetition type A. For the second repetition (i.e., repetition #1 in the diagram), since the end symbol of the first repetition (i.e., the third symbol in uplink time slot #3) overlaps with the start symbol of the second repetition (i.e., the third symbol in uplink time slot #3), the reference time slot corresponding to the second repetition is the next time slot after the time slot where the end symbol of the first repetition is located, i.e., uplink time slot #4. Then, starting from the third symbol in uplink time slot #4, the terminal traverses each symbol in turn, and determines the symbols from the third symbol to the ninth symbol in uplink time slot #4, a total of 7 symbols, as the symbols for the second repetition of PUSCH repetition type A.

[0248] In one example, taking method 4 and physical time slot counting as examples, Figure 2H is a schematic diagram of the time domain resources of PUSCH repetition type A determined based on method 4 and physical time slot counting. As shown in Figure 2H, k2 indicates the starting time slot as special time slot #2, S indicates the starting symbol as the ninth symbol, L indicates the number of symbols as 6, and K indicates the number of repetitions as 2. Then, starting from special time slot #2, the terminal determines two consecutive time slots as time slots for two repetitions, namely special time slot #2 and uplink time slot #3. For the first repetition (i.e., repetition #0 in the figure), the terminal starts from the ninth symbol in special time slot #2 and traverses each symbol in special time slot #2 in sequence. Since the ninth and tenth symbols in special time slot #2 are first-class symbols, the ninth and tenth symbols are not determined as PUSCH symbols. Instead, the eleventh to fourteenth symbols in special time slot #2, a total of 4 symbols, are determined as the symbols for the first repetition of PUSCH repetition type A. For the second repetition (i.e. repetition #1 in the diagram), the terminal starts from the ninth symbol in uplink time slot #3 and sequentially traverses each symbol in uplink time slot #3, identifying the ninth to the fourteenth symbols in uplink time slot #3, a total of 6 symbols, as the symbols for the second repetition of PUSCH repetition type A.

[0249] In one example, taking method 4 and available time slot counting as examples, Figure 2I is a schematic diagram of the time domain resources for PUSCH repetition type A determined based on method 4 and available time slot counting. As shown in Figure 2I, k2 indicates the starting time slot as special time slot #2, S indicates the starting symbol as the ninth symbol, L indicates the number of symbols as 6, and K indicates the repetition count as 2. Then, starting from special time slot #2, the terminal judges each time slot one by one until it finds two time slots that can be used to send PUSCH. The time slots that can be used to send PUSCH are the time slots in which the symbols indicated by S and L (or SLIV) do not include the first type of symbols. Since the symbols indicated by S and L in special time slot #2 include the first type of symbols, and the symbols indicated by S and L in uplink time slots #3 and #4 do not include the first type of symbols, the consecutive uplink time slots #3 and #4 are determined as two repetition time slots. For the first repetition (i.e., repetition #0 in the diagram), the terminal starts from the ninth symbol in uplink time slot #3 and sequentially traverses each symbol in uplink time slot #3, identifying the six symbols from the ninth to the fourteenth as the first repetition symbols of PUSCH repetition type A. For the second repetition (i.e., repetition #1 in the diagram), the terminal starts from the ninth symbol in uplink time slot #4 and sequentially traverses each symbol in uplink time slot #4, identifying the six symbols from the ninth to the fourteenth as the second repetition symbols of PUSCH repetition type A.

[0250] In some embodiments, for the first nominal repetition of PUSCH repetition type B, the terminal uses method 1 to determine the symbol of the first nominal repetition. Specific implementation details can be found in the embodiments of method 1, and will not be repeated here.

[0251] In some embodiments, for the i-th nominal repetition of PUSCH repetition type B, the terminal starts from the first symbol after the end symbol of the i-th nominal repetition, traverses each symbol sequentially, and determines the symbol that satisfies the first condition as the symbol of the i-th nominal repetition, until the number of symbols in the i-th nominal repetition is L. Where i = 2, 3, ..., K.

[0252] In some embodiments, for the i-th nominal repetition of PUSCH repetition type B, the terminal starts from the first symbol that satisfies the first condition after the end symbol of the i-th nominal repetition, and sequentially traverses each symbol, determining the symbol that satisfies the first condition as the symbol of the i-th nominal repetition, until the number of symbols in the i-th nominal repetition is L. Where i = 2, 3, ..., K.

[0253] In some embodiments, the terminal may determine the symbol of the K nominal repetitions as the symbol of PUSCH repetition type B (denoted as method B-1).

[0254] In some embodiments, the terminal may determine, based on K nominal repetitions, at least one actual repetition of the symbol included in each nominal repetition.

[0255] In some embodiments, the terminal may determine the actual repeated symbol as a symbol of PUSCH repeat type B.

[0256] In some embodiments, the method for a terminal to determine actual repetitions includes: for each of the K nominal repetitions, each nominal repetition includes at least one actual repetition, each actual repetition being a set of all valid symbols available for transmission of PUSCH within a time slot, wherein valid symbols are symbols other than those of the first type. If an actual repetition includes only one symbol, then that actual repetition is ignored.

[0257] In some embodiments, during the process of determining actual repetitions based on K nominal repetitions, for each nominal repetition that occupies two consecutive time slots, the terminal can divide the nominal repetition into two actual repetitions (denoted as method B-2).

[0258] In some embodiments, during the process of determining actual repetitions based on K nominal repetitions, the terminal determines a nominal repetition that occupies two consecutive time slots within each nominal repetition as a single actual repetition, wherein the symbols included in this single actual repetition are located in different time slots (denoted as Method B-3). In other words, Method B-3 no longer divides nominal repetitions that cross time slot boundaries into two actual repetitions.

[0259] In some embodiments, for method B-1, the terminal can directly send PUSCH based on K nominal repetitions. In this case, it is not necessary to further determine the actual repetitions; that is, rate matching (RM) is performed once for each nominal repetition, and each nominal repetition corresponds to a redundancy version (RV). A bit sequence is selected starting with the RV and mapped to the time-frequency resources of each nominal repetition. In other words, compared with methods B-2 and B-3, method B-1 may perform RM fewer times and has fewer corresponding RVs, thus effectively reducing resource overhead and improving transmission performance.

[0260] In some embodiments, for methods B-2 and B-3, the terminal sends PUSCH based on the actual repetitions included in the K nominal repetitions. In this case, RM is performed once for each actual repetition, and each actual repetition corresponds to a RV. A bit sequence is selected starting with the RV and mapped to the time-frequency resources of each actual repetition. That is, for the actual repetitions included in the nominal repetitions that cross time slot boundaries, method B-3 performs fewer RM operations and has fewer corresponding RVs compared to method B-2, thus effectively reducing resource overhead and improving transmission performance.

[0261] In one example, taking method B-1 as an example, Figure 2J is a schematic diagram of the time-domain resources of PUSCH repetition type B determined based on method B-1. As shown in Figure 2J, k2 indicates the starting time slot as uplink time slot #3, S indicates the starting symbol as the third symbol, L indicates the number of symbols as 6, and K indicates the number of repetitions as 3. Then, for the first nominal repetition (i.e., nominal repetition #0 in the figure), the terminal starts from the third symbol in uplink time slot #3 and traverses each symbol in turn. Since the third to sixth symbols and the ninth to twelfth symbols in uplink time slot #3 are first-class symbols, these symbols are not determined as PUSCH symbols. Instead, the seventh to eighth symbols, the thirteenth to fourteenth symbols in uplink time slot #3, and the first to second symbols in uplink time slot #4, a total of 6 symbols, are determined as the symbols of the first nominal repetition of PUSCH repetition type B. For the second nominal repetition (i.e., nominal repetition #1 in the diagram), since the first symbol satisfying the first condition after the end symbol of the first nominal repetition is the third symbol in uplink time slot #4, the terminal determines the symbols for the second nominal repetition from the third symbol to the eighth symbol in uplink time slot #4, a total of 6 symbols. For the third nominal repetition (i.e., nominal repetition #2 in the diagram), since the first symbol satisfying the first condition after the end symbol of the second nominal repetition is the ninth symbol in uplink time slot #4, the terminal determines the symbols for the third nominal repetition of PUSCH repetition type B from the ninth symbol to the fourteenth symbol in uplink time slot #4, a total of 6 symbols.

[0262] In one example, taking method B-2 as an example, Figure 2K is a schematic diagram of the time-domain resources of PUSCH repetition type B determined based on method B-2. As shown in Figure 2K, k2 indicates the starting time slot as uplink time slot #3, S indicates the starting symbol as the third symbol, L indicates the number of symbols as 6, and K indicates the number of repetitions as 3. Then, the method for determining the first nominal repetition (i.e., nominal repetition #0 in the figure) to the third nominal repetition (i.e., nominal repetition #2 in the figure) can refer to the embodiments of method B-1 and Figure 2J, which will not be repeated here. For the first nominal repetition, the terminal determines the seventh to eighth symbols in uplink time slot #3 as the first actual repetition (i.e., actual repetition #0 in the figure). Since the first nominal repetition crosses the time slot boundary between uplink time slot #3 and uplink time slot #4, according to method B-2, the thirteenth to fourteenth symbols in uplink time slot #3 are determined as the second actual repetition (i.e., actual repetition #1 in the figure), and the first to second symbols in uplink time slot #4 are determined as the third actual repetition (i.e., actual repetition #2 in the figure). For the second and third nominal repetitions, the symbol of the actual repetition can be determined by referring to the aforementioned embodiments for determining the actual repetition, which will not be repeated here.

[0263] In one example, taking method B-3 as an example, Figure 2L is a schematic diagram of the time-domain resources of PUSCH repetition type B determined based on method B-3. As shown in Figure 2L, k2 indicates the starting time slot as uplink time slot #3, S indicates the starting symbol as the third symbol, L indicates the number of symbols as 6, and K indicates the number of repetitions as 3. Then, the method for determining the first nominal repetition (i.e., nominal repetition #0 in the figure) to the third nominal repetition (i.e., nominal repetition #2 in the figure) can refer to the embodiments of method B-1 and Figure 2J, which will not be repeated here. For the first nominal repetition, the terminal determines the seventh to eighth symbols in uplink time slot #3 as the first actual repetition (i.e., actual repetition #0 in the figure). Since the first nominal repetition crosses the time slot boundary of uplink time slot #3 and uplink time slot #4, according to method B-3, the thirteenth to fourteenth symbols in uplink time slot #3 and the first to second symbols in uplink time slot #4 are determined as the second actual repetition (i.e., actual repetition #1 in the figure). For the second and third nominal repetitions, the symbol of the actual repetition can be determined by referring to the aforementioned embodiments for determining the actual repetition, which will not be repeated here.

[0264] In step S2103, the network device determines the symbol of PUSCH based on the first information.

[0265] In some embodiments, the network device and the terminal determine the symbol of the PUSCH in the same way, so that the network device and the terminal can reach a consensus on the time domain resources of the PUSCH, and thus determine on which time domain resources the TB carried by the PUSCH is received.

[0266] In some embodiments, the implementation details of step S2103 can be referred to step S2102, and will not be repeated here.

[0267] In some embodiments, step S2103 may be performed before step S2102 or simultaneously with step S2102.

[0268] In step S2104, the terminal determines the TBS of the TB carried by the PUSCH based on the first information.

[0269] In some embodiments, the terminal determines the TBS of the TB carried by the PUSCH based on the symbol of the PUSCH.

[0270] In some embodiments, the terminal may determine the TBS based on one of the following methods:

[0271] Method a: Determine the TBS based on the number of symbols indicated by the first information;

[0272] Method b: Determine TBS based on the number of symbols in the first repetition of PUSCH;

[0273] Method c: Determine TBS based on the average number of repeated symbols in PUSCH;

[0274] Method d: Determine TBS based on the maximum number of repeated symbols in PUSCH;

[0275] Method e determines TBS based on the minimum number of all repeating symbols in PUSCH.

[0276] In some embodiments, for methods b to e, the PUSCH can be a PUSCH of repeating type A or a PUSCH of repeating type B.

[0277] In some embodiments, for a PUSCH of repetition type B, if the notation of the PUSCH repetition type B determined by method B-1 is used, then the first repetition is the first nominal repetition, and all repetitions include all nominal repetitions. If the notation of the PUSCH repetition type B determined by method B-2 is used, then the first repetition is the first actual repetition, and all repetitions include all actual repetitions.

[0278] In some embodiments, for method a, the terminal determines the number of symbols to be allocated to the PUSCH based on the number of symbols L indicated by the first information. based on Determine the number N′ of REs used for PUSCH within a PRB. RE Based on N′ RE Determine the total number of REs N used for PUSCH.RE Based on N RE Determine the TBS of the TB carried by the PUSCH.

[0279] In one example, In one example, In one example, if TBoMS is configured, N RE =N·min(156,N′) RE )·n PRB If TBoMS is not configured, N RE =min(156,N′) RE )·n PRB .

[0280] In some embodiments, for method b, the terminal determines the number of symbols to be allocated to the PUSCH based on the number L′1 of symbols in the first repetition of the PUSCH. based on Determine the number N′ of REs used for PUSCH within a PRB. RE Based on N′ RE Determine the total number of REs N used for PUSCH. RE Based on N RE Determine the TBS of the TB carried by the PUSCH.

[0281] In one example, In one example, In one example, if TBoMS is configured, N RE =N·min(156,N′) RE )·n PRB If TBoMS is not configured, N RE =min(156,N′) RE )·n PRB .

[0282] In one example, as shown in Figure 2E, L′1 = 6. In another example, as shown in Figure 2H, L′1 = 4. In yet another example, as shown in Figure 2K, L′1 = 2.

[0283] In some embodiments, for method c, the terminal calculates the average number of repeated symbols in the PUSCH. Determine the number of symbols to be assigned to PUSCH based on Determine the number N′ of REs used for PUSCH within a PRB. RE Based on N′ RE Determine the total number of REs N used for PUSCH. RE Based on N REDetermine the TBS of the TB carried by the PUSCH.

[0284] In one example, In one example, L′ k This represents the number of symbols corresponding to the k-th PUSCH repetition. In one example, In one example, if TBoMS is configured, N RE =N·min(156,N′) RE )·n PRB If TBoMS is not configured, N RE =min(156,N′) RE )·n PRB .

[0285] In one example, as shown in Figure 2H, In one example, as shown in Figure 2I,

[0286] In some embodiments, for method d, the terminal calculates the maximum value L′ of the total number of repeated symbols in PUSCH. max Determine the number of symbols to be assigned to PUSCH based on Determine the number N′ of REs used for PUSCH within a PRB. RE Based on N′ RE Determine the total number of REs N used for PUSCH. RE Based on N RE Determine the TBS of the TB carried by the PUSCH.

[0287] In one example, In one example, L′ max =max{L′ k ,k=1,2,...,K},L′ k This represents the number of symbols corresponding to the k-th PUSCH repetition. In one example, In one example, if TBoMS is configured, N RE =N·min(156,N′) RE )·n PRB If TBoMS is not configured, N RE =min(156,N′) RE )·n PRB .

[0288] In one example, as shown in Figure 2H, L′ max =6.

[0289] In some embodiments, for method e, the terminal calculates the minimum value L′ of all repeating symbols in PUSCH. min Determine the number of symbols to be assigned to PUSCH based on Determine the number N′ of REs used for PUSCH within a PRB. RE Based on N′ RE Determine the total number of REs N used for PUSCH. RE Based on N RE Determine the TBS of the TB carried by the PUSCH.

[0290] In one example, In one example, L′ min =min{L′ k ,k=1,2,...,K},L′ k This represents the number of symbols corresponding to the k-th PUSCH repetition. In one example, In one example, if TBoMS is configured, N RE =N·min(156,N′) RE )·n PRB If TBoMS is not configured, N RE =min(156,N′) RE )·n PRB .

[0291] In one example, as shown in Figure 2H, L′ min =4.

[0292] In some embodiments, step S2104 may be performed before step S2103 or simultaneously with step S2102.

[0293] In step S2105, the network device determines the TBS of the TB carried by the PUSCH based on the first information.

[0294] In some embodiments, the network device and the terminal determine the TBS in the same way based on the first information, so that the network device and the terminal can reach a consensus on the TBS carried by the PUSCH, and thus can accurately receive the TBS carried by the PUSCH.

[0295] In some embodiments, step S2105 may be performed before step S2104 or simultaneously with step S2103.

[0296] In step S2106, the terminal sends TB on PUSCH based on TBS.

[0297] In some embodiments, the terminal transmits a TB on a defined symbol of a PUSCH, and the size of the transmitted TB is TBS.

[0298] In some embodiments, the network device receives TB on PUSCH based on TBS.

[0299] In some embodiments, the network device receives a TB on a defined symbol of a PUSCH, and the size of the received TB is TBS.

[0300] The communication method involved in the embodiments of this disclosure may include at least one of steps S2101 to S2106. For example, step S2101 may be implemented as a standalone embodiment. For example, step S2102 may be implemented as a standalone embodiment. For example, step S2103 may be implemented as a standalone embodiment. For example, step S2104 may be implemented as a standalone embodiment. For example, step S2105 may be implemented as a standalone embodiment. For example, step S2106 may be implemented as a standalone embodiment. For example, steps S2102 and S2104 may be combined as a standalone embodiment. For example, steps S2101, S2102, S2104, and S2106 may be combined as a standalone embodiment. For example, steps S2101, S2103, S2105, and S2106 may be combined as a standalone embodiment.

[0301] In some embodiments, the names of information, etc., are not limited to the names described in the embodiments. Terms such as "information", "message", "signal", "signaling", "report", "configuration", "indication", "instruction", "command", "channel", "parameter", "domain", "field", "symbol", "symbol", "codebook", "codeword", "codepoint", "bit", "data", "program", and "chip" can be used interchangeably.

[0302] In some embodiments, the terms “carrying,” “including,” “containing,” and “encapsulating” can be used interchangeably.

[0303] In some embodiments, the terms “radio”, “wireless”, “radio access network (RAN)”, “access network (AN)”, and “RAN-based” can be used interchangeably.

[0304] In some embodiments, “get,” “obtain,” “receive,” “transmit,” “bidirectional transmission,” and “send and / or receive” can be used interchangeably and can be interpreted as receiving from other entities, obtaining from protocols, obtaining from higher layers, obtaining through self-processing, or autonomous implementation, among other meanings.

[0305] In some embodiments, terms such as “send,” “transmit,” “report,” “transmit,” “request,” “bidirectional transmission,” “send and / or receive” can be used interchangeably.

[0306] In some embodiments, the terms “issue,” “return,” “feedback,” “response,” and “acknowledgement” can be used interchangeably.

[0307] In some embodiments, terms such as "certain," "preset," "default," "set," "indicated," "a certain," "any," and "first" can be used interchangeably. "Certain A," "preset A," "default A," "set A," "indicated A," "a certain A," "any A," and "first A" can be interpreted as A pre-defined in a protocol or the like, or as A obtained through setting, configuration, or instruction, or as specific A, a certain A, any A, or first A, but are not limited thereto.

[0308] In some embodiments, the determination or judgment can be made by a value represented by 1 bit (0 or 1), or by a true or false value (boolean), or by a comparison of numerical values ​​(e.g., a comparison with a predetermined value), but is not limited thereto.

[0309] Figure 3 is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure. As shown in Figure 3, the communication method includes steps S3101 to S3103.

[0310] In step S3101, the network device sends the first information.

[0311] The optional implementation of step S3101 can be found in the optional implementation of step S2101 in Figure 2A and other related parts in the embodiments involved in Figure 2A, which will not be repeated here.

[0312] In step S3102, the terminal determines the symbol for the first data transmission based on the first information.

[0313] The optional implementation of step S3102 can be found in the optional implementation of step S2102 in Figure 2A and other related parts in the embodiments involved in Figure 2A, which will not be repeated here.

[0314] In step S3103, the network device determines the symbol for the first data transmission based on the first information.

[0315] The optional implementation of step S3103 can be found in the optional implementation of step S2102 in Figure 2A and other related parts in the embodiments involved in Figure 2A, which will not be repeated here.

[0316] In some embodiments, the first information indicates the time-domain resource configuration of the first data transmission, and the terminal and network device determine the symbol of the first data transmission based on the time-domain resource configuration of the first data transmission. The symbol of the first data transmission satisfies a first condition, which is that it is a symbol not used for the first data transmission.

[0317] In some embodiments, the time-domain resource configuration of the first data transmission includes: a first parameter indicating the starting time slot of the first data transmission; and a second parameter indicating the starting symbol and the number of symbols for the first data transmission.

[0318] In some embodiments, starting from the first symbol in the initial time slot, each symbol is traversed sequentially, and symbols that satisfy the first condition are identified as symbols for the first data transmission, until the number of symbols for the first data transmission is L; or, starting from the first symbol in the initial time slot, each symbol in the initial time slot is traversed sequentially, and symbols that satisfy the first condition are identified as symbols for the first data transmission, until one of the following is true: the number of symbols for the first data transmission is L; or the last symbol in the initial time slot; where L is the number of symbols indicated by the second parameter.

[0319] In some embodiments, the temporal resource configuration of the first data transmission further includes a third parameter indicating the number of repetitions of the first data transmission.

[0320] In some embodiments, for the first repetition of the first data transmission, starting from the starting symbol in the starting time slot, each symbol is traversed sequentially, and symbols that satisfy the first condition are identified as symbols of the first repetition, until the number of symbols of the first repetition is L; or, for the first repetition of the first data transmission, starting from the starting symbol in the starting time slot, each symbol in the starting time slot is traversed sequentially, and symbols that satisfy the first condition are identified as symbols of the first repetition, until one of the following is true: the number of symbols of the first data transmission is L; or the last symbol in the starting time slot; where L is the number of symbols indicated by the second parameter.

[0321] In some embodiments, for the i-th repetition of the first data transmission, starting from the first symbol in the reference time slot corresponding to the i-th repetition, each symbol is traversed sequentially, and symbols that satisfy the first condition are determined as symbols of the i-th repetition, until the number of symbols of the i-th repetition is L; or, for the i-th repetition of the first data transmission, starting from the first symbol in the reference time slot corresponding to the i-th repetition, each symbol in the reference time slot is traversed sequentially, and symbols that satisfy the first condition are determined as symbols of the i-th repetition, until one of the following is true: the number of symbols of the i-th repetition is L; or the last symbol in the reference time slot; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

[0322] In some embodiments, the reference time slot corresponding to the i-th repetition is the time slot where the end symbol of the (i-1)-th repetition is located, or the next time slot after the time slot where the end symbol of the (i-1)-th repetition is located.

[0323] In some embodiments, the end symbol of the (i-1)th repetition precedes the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the time slot where the end symbol of the (i-1)th repetition is located; or, the end symbol of the (i-1)th repetition overlaps with the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located; or, the end symbol of the (i-1)th repetition follows the start symbol of the i-th repetition, and the reference time slot for the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located.

[0324] In some embodiments, for the first nominal repetition of the first data transmission, starting from the initial symbol in the initial time slot, each symbol is traversed sequentially, and the symbol that satisfies the first condition is determined as the symbol of the first nominal repetition, until the number of symbols of the first nominal repetition is L.

[0325] In some embodiments, for the i-th nominal repetition of the first data transmission, starting from the first symbol that satisfies the first condition after the end symbol of the (i-1)-th nominal repetition, each symbol is traversed sequentially, and the symbol that satisfies the first condition is determined as the symbol of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; or, for the i-th nominal repetition of the first data transmission, starting from the first symbol after the end symbol of the (i-1)-th nominal repetition, each symbol is traversed sequentially, and the symbol that satisfies the first condition is determined as the symbol of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

[0326] In some embodiments, at least one symbol of actual repetition is determined for each nominal repetition.

[0327] In some embodiments, a nominal repetition that occupies two consecutive time slots in each nominal repetition includes an actual repetition, wherein the symbols included in the actual repetition are located in different time slots.

[0328] In some embodiments, the method further includes one of: determining K nominal repetitions as the first data transmission; and determining the actual repetitions included in the K nominal repetitions as the first data transmission.

[0329] In some embodiments, the transport block size TBS of the transport block TB included in the first data transmission is determined according to the time-domain resource configuration; based on the TBS, the TB is transmitted on the symbols of the first data transmission.

[0330] In some embodiments, determining the transport block size (TBS) of the transport block TB included in the first data transmission based on the time-domain resource configuration of the first data transmission includes one of the following: determining the TBS based on the number of symbols indicated by the second parameter; determining the TBS based on the number of symbols in the first repetition of the first data transmission; determining the TBS based on the average number of symbols in all repetitions of the first data transmission; determining the TBS based on the maximum number of symbols in all repetitions of the first data transmission; or determining the TBS based on the minimum number of symbols in all repetitions of the first data transmission.

[0331] In the following, the technical solutions of the embodiments of this disclosure will be described by way of specific implementation.

[0332] In some embodiments, this disclosure provides a PUSCH transmission method, which specifically includes: counting available symbols: starting from the starting symbol, judging each symbol one by one; if the symbol is a first type of symbol, then the symbol is not included in L symbols; otherwise, the symbol is included in L symbols.

[0333] In some embodiments, the first type of symbols is predefined by the protocol and includes at least one of the following: downlink symbols, SSB symbols, sounding reference signal (SRS) symbols, uplink rate matching resource symbols, etc.

[0334] In some embodiments, the first type of symbol is configured by the network device.

[0335] In some embodiments, the available symbol counting termination conditions include: Method 1: End the available symbol counting after finding L symbols. Method 2: Within a time slot, if after traversing the last symbol in the time slot, even if the symbol count is less than L symbols, end the available symbol counting; otherwise, end the available symbol counting after finding L symbols.

[0336] In some embodiments, the method for determining PUSCH repetition based on available symbol counting method 1 is as follows: For PUSCH repetition type A, except for the first repetition, the symbols for each repetition start from the beginning symbol of the reference time slot and are determined according to available symbol counting method 1.

[0337] In some embodiments, method A-1: ​​the reference time slot is the end time slot of the previous repetition. In some embodiments, the first type of symbols also includes symbols that have been assigned to the previous PUSCH repetition; method A-2: the reference time slot is the next time slot after the end time slot of the previous repetition;

[0338] In some embodiments, if the end symbol of the previous repetition precedes the start symbol, then method A-1 is used; otherwise, method A-2 is used.

[0339] In some embodiments, for nominal repetitions of PUSCH repetition type B: except for the first nominal repetition, the start symbol of each nominal repetition is the symbol of the first non-first type symbol after the end symbol of the previous nominal repetition.

[0340] In some embodiments, for actual repetition of PUSCH repetition type B: Method B-1: No actual repetition, send PUSCH directly based on nominal repetition. Method B-2: Reuse existing actual repetition determination methods. Method B-3: Do not segment actual repetition across time slot boundaries.

[0341] In some embodiments, the TBS determination method based on available symbol counting method 2 is as follows: TBS is determined according to the indicated L; TBS is determined according to the number of symbols in the PUSCH of the first time slot; TBS is determined according to the average number of symbols in the PUSCH of all time slots; TBS is determined according to the maximum number of symbols in the PUSCH of all time slots; and TBS is determined according to the minimum number of symbols in the PUSCH of all time slots.

[0342] In some embodiments, terminal capability reporting: the reporting terminal device supports the above-described PUSCH transmission method.

[0343] In some embodiments, the communication method of this disclosure includes: Step 1-1: A network device sends first information to a terminal device, the first information indicating a first time-domain resource, the first time-domain resource being a time-domain resource used to determine when the terminal device sends a first signal. Step 1-2: The terminal device receives the first information sent by the network device and determines the first time-domain resource based on the first information. Step 1-3: The terminal device determines a first TBS based on the first information.

[0344] In some embodiments, the first signal is carried on the PUSCH, and the first time-domain resource is the time-domain resource of the PUSCH.

[0345] In some embodiments, the first information includes a first parameter k2, which is used to determine the starting time slot of the first time domain resource.

[0346] In some embodiments, the first information includes a second parameter S, which is used to determine the start symbol of the first time-domain resource in the start time slot. For example, the second parameter S indicates the index of the start symbol of the first time-domain resource in the start time slot; that is, the index of the start symbol of the first time-domain resource in the start time slot is the second parameter S.

[0347] In some embodiments, the first information includes a third parameter L, which is used to determine the number of symbols in the first time-domain resource. For example, the third parameter L indicates the number of symbols in the first time-domain resource; that is, the number of symbols included in the first time-domain resource is the third parameter L.

[0348] In some embodiments, the symbols of the first time-domain resource are determined according to the first parameter k2, the second parameter S, and the third parameter L, as follows: starting from the symbol indicated by the second parameter S in the time slot indicated by the first parameter k2, each symbol is judged one by one. If the symbol is a first type of symbol, the symbol is not included in the first time-domain resource; otherwise, the symbol is included in the first time-domain resource.

[0349] In some embodiments, the first type of symbols is predefined by the protocol and includes at least one of the following: downlink symbols, SSB symbols, uplink rate matching resources, SRS symbols, etc.

[0350] In some embodiments, the first type of symbol is configured by the network device through higher-layer signaling and / or SIB;

[0351] In some embodiments, the first type of symbols is semi-statically configured.

[0352] In some embodiments, the determination of the symbols of the first time-domain resource is completed according to the following conditions: Method 1: until the first time-domain resource includes L symbols. Method 2: within the time slot indicated by the first parameter k2, if the number of symbols included in the first time-domain resource is less than L symbols after traversing the last symbol in the time slot, then the determination of the symbols of the first time-domain resource is completed; otherwise, the determination of the symbols of the first time-domain resource is completed after the first time-domain resource includes L symbols.

[0353] In some embodiments, Figure 2B shows a schematic diagram of method 1, where k2 indicates time slot #3, S indicates that the starting symbol is the first symbol of the time slot, L = 8, and the first type of symbols are the 3rd to 6th and 9th to 12th symbols in time slot #3. Then the symbols of the first resource are the 8 non-first type symbols starting from the first symbol of time slot #3, which exceeds one time slot. Figure 2C shows a schematic diagram of method 2, where all parameters are the same as in Figure 2(a). However, method 2 restricts the symbols of the first resource from exceeding one time slot, even if the number of symbols of the first resource is less than L symbols. Figure 2D also shows a schematic diagram of method 2, where L = 4, and other parameters are the same as in Figure 2(a). In this case, the first resource will not exceed one time slot, so the number of symbols of the first resource is L symbols.

[0354] In some embodiments, the first information includes a fourth parameter K, which indicates the number of times PUSCH is repeated.

[0355] In some embodiments, for PUSCH repetition type A, if method 1 is used, then: the first time-domain resource corresponding to the first PUSCH repetition is determined according to the first parameter k2, the second parameter S, and the third parameter L; it should be understood that this is the same as described in method 1. Except for the first PUSCH repetition, the first time-domain resource corresponding to each PUSCH repetition starts from the symbol indicated by the second parameter S on the reference time slot and is then determined according to method 1.

[0356] In some embodiments, method A-1: ​​the reference time slot is the end time slot of the previous PUSCH repetition. In some embodiments, the first type of symbols also includes symbols already allocated to the previous PUSCH repetition. It should be understood that this method is to avoid temporal overlap between the first time-domain resources corresponding to the current PUSCH repetition and the first time-domain resources corresponding to the previous PUSCH repetition.

[0357] In some embodiments, method A-2: the reference time slot is the next time slot after the end time slot of the previous PUSCH repetition. In some embodiments, if the end symbol of the first time-domain resource corresponding to the previous PUSCH repetition precedes the symbol indicated by the second parameter S, then method A-1 is used; otherwise, method A-2 is used. It should be understood that this is also to avoid the first time-domain resource corresponding to the current PUSCH repetition overlapping with the first time-domain resource corresponding to the previous PUSCH repetition in the time domain; at the same time, it can also efficiently utilize uplink time-domain resources to improve uplink coverage performance.

[0358] For example, as shown in Figure 2E, method A-1 is used, where k2 indicates time slot #2, S indicates that the starting symbol is the 3rd symbol in the time slot, L = 6, and the first type of symbols are the 3rd to 6th symbols and the 9th to 12th symbols in time slot #2. According to method 1, the first time domain resource corresponding to the first PUSCH repetition spans two time slots, namely time slot #2 and time slot #3. Then, the reference time slot for the second PUSCH repetition is time slot #3. Taking time slot #3 as the starting time slot, according to S and L and method 1, the first time domain resource corresponding to the second PUSCH repetition is determined to be the 3rd to 8th symbols in time slot #3. As shown in Figure 2F, using method A-1, where L = 8 and the remaining parameters are the same as in Figure 2E, in time slot #3, the start symbol (the 3rd symbol) indicated by S precedes the end symbol (the 4th symbol) of the first PUSCH repetition. Therefore, the reference time slot for the second PUSCH repetition is time slot #4. Taking time slot #4 as the starting time slot, according to S and L and method 1, the first time domain resource corresponding to the second PUSCH repetition is determined to be the 3rd to 10th symbols in time slot #4. As shown in Figure 2G, using method A-2, the start symbol (the 3rd symbol) indicated by S overlaps with the end symbol (the 3rd symbol) of the first PUSCH repetition. The reference time slot for the second PUSCH repetition is time slot #4 instead of time slot #3. According to S and L and method 1, the first time domain resource corresponding to the second PUSCH repetition is determined to be the 3rd to 9th symbols in time slot #4.

[0359] In some embodiments, for PUSCH repetition type A, if method 2 is used, each slot of PUSCH repetition type A can be determined using available slot count or physical slot count, wherein the symbols included in the first resource are determined according to method 2 within each slot.

[0360] In some embodiments, for PUSCH repetition type B, if method 1 is used, then: the first time-domain resource corresponding to the first nominal repetition is determined according to the first parameter k2, the second parameter S, and the third parameter L. It should be understood that this is the same as described in method 1. Except for the first nominal repetition, the start symbol of each nominal repetition is the symbol of the first non-first type symbol after the end symbol of the previous nominal repetition.

[0361] In some embodiments, for PUSCH repetition type B actual repetition: Method B-1: No actual repetition, send PUSCH directly based on nominal repetition. Method B-2: Reuse existing actual repetition determination methods. Method B-3: When nominal repetition crosses a slot boundary, it is no longer split into two actual repetitions.

[0362] In some embodiments, the method for determining nominal repetition is shown in Figure 2J, where k2 indicates time slot #3, S indicates the starting symbol is the 3rd symbol of that time slot, L=6, and the first type of symbols are the 3rd to 6th symbols and the 9th to 12th symbols in time slot #3. According to method 1, the first time-domain resource corresponding to the first nominal repetition includes the 7th, 8th, 13th, and 14th symbols in time slot #3 and the 1st and 2nd symbols in time slot #4. Then, the first time-domain resource corresponding to the second nominal repetition starts from the 3rd symbol in time slot #4 and includes a total of 6 consecutive symbols. The first time-domain resource corresponding to the third nominal repetition starts from the 9th symbol in time slot #4 and includes a total of 6 symbols. At the same time, Figure 2J also shows a schematic diagram of method B-1. In this case, it is not necessary to further determine the actual repetition. That is, each nominal repetition is executed once by RM, and each nominal repetition corresponds to an RV. The bit sequence is selected with RV as the starting bit and mapped to the time-frequency resource of each nominal repetition. Figure 2K illustrates method B-2. This scheme requires further determination of the actual repetitions. Each actual repetition is executed once using RM, and each actual repetition corresponds to a RV. A bit sequence is selected starting with the RV and mapped to the time-frequency resources of each actual repetition. The method for determining the actual repetitions is existing technology. Figure 2L illustrates method B-3. The difference from Figure 2K is that when the nominal repetition crosses the time slot boundary, it is no longer divided into two actual repetitions, but rather into one actual repetition.

[0363] In some embodiments, for PUSCH repetition type B, nominal repetition in the prior art can span time slot boundaries, so it is not desirable to use method 2 to determine the first time domain resource for each nominal repetition.

[0364] In some embodiments, for method 2, the method for calculating TBS includes:

[0365] Method a: Determine TBS based on L; in one example, In one example,

[0366] Method b: Determine the TBS based on the symbol count L1′ of the first time-domain resource corresponding to the first PUSCH repetition. In one example, In one example,

[0367] Method c: Calculate the average number of symbols for the first resource corresponding to all PUSCH repetitions. Determine the TBS. In one example, In one example, L′ k This represents the number of symbols corresponding to the k-th PUSCH repetition.

[0368] Method d: The maximum value L′ of the number of symbols corresponding to the first resource for all PUSCH repetitions. max Determine the TBS. In one example, In one example, L′ max =max{L′ k ,k=1,2,...,K},L′ k This represents the number of symbols corresponding to the k-th PUSCH repetition.

[0369] Method e: The minimum value L′ of the number of symbols corresponding to the first resource for all PUSCH repetitions. min Determine the TBS. In one example, In one example, L′ min =min{L′ k ,k=1,2,...,K},L′ k This represents the number of symbols corresponding to the k-th PUSCH repetition.

[0370] In some embodiments, for method 1, the calculation method of TBS can refer to the specific details in "V. TBS Calculation" above, and will not be repeated here.

[0371] In some embodiments, the communication method of this disclosure further includes: Step 2-1: A terminal device sends a first signal, wherein the time domain resources for sending the first signal are determined based on the first time domain resources, the first signal carries a first TB, and the size of the first TB is a first TBS. Step 2-2: A network device receives the first signal sent by the terminal device based on the first time domain resources. Step 2-3: The terminal device determines the first TB based on the first signal and the first TBS.

[0372] In some embodiments, the network device and the terminal device determine the first time domain resource and the first TBS in the same way.

[0373] In some embodiments, the first time-domain resource is used to determine the time-domain resources for transmitting and receiving the first signal. The time-domain resources actually used for transmitting and receiving the first signal may be different from the first time-domain resource. For example, according to some conflict criteria, time-domain resources that are conflicted in the first time-domain resource cannot be used to transmit the first signal.

[0374] In some embodiments, prior to step 1-1, the terminal device may report terminal capabilities to the network device, including indicating the PUSCH transmission method.

[0375] This disclosure also proposes an apparatus for implementing any of the above methods. For example, a terminal is proposed, which includes units or modules for implementing the steps performed by the terminal in any of the above methods. Furthermore, another network device is proposed, including units or modules for implementing the steps performed by the network device (e.g., access network device, core network functional node, core network device, etc.) in any of the above methods.

[0376] It should be understood that the division of units or modules in the above device is only a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, the units or modules in the device can be implemented by a processor calling software: for example, the device includes a processor connected to a memory containing instructions. The processor calls the instructions stored in the memory to implement any of the above methods or to implement the functions of the units or modules in the above device. The processor can be, for example, a general-purpose processor, such as a Central Processing Unit (CPU) or a microprocessor, and the memory can be internal or external to the device. Alternatively, the units or modules in the device can be implemented in the form of hardware circuits. The functionality of some or all of the units or modules can be achieved through the design of these hardware circuits, which can be understood as one or more processors. For example, in one implementation, the hardware circuit is an application-specific integrated circuit (ASIC), and the functionality of some or all of the units or modules is achieved through the design of the logical relationships between the components within the circuit. In another implementation, the hardware circuit can be implemented using a programmable logic device (PLD), such as a field-programmable gate array (FPGA), which can include a large number of logic gates. The connection relationships between the logic gates are configured through configuration files, thereby achieving the functionality of some or all of the units or modules. All units or modules of the above device can be implemented entirely through processor-called software, entirely through hardware circuits, or partially through processor-called software with the remaining parts implemented through hardware circuits.

[0377] In this embodiment, the processor is a circuit with signal processing capabilities. In one implementation, the processor can be a circuit with instruction read and execute capabilities, such as a Central Processing Unit (CPU), a microprocessor, a graphics processing unit (GPU) (which can be understood as a microprocessor), or a digital signal processor (DSP). In another implementation, the processor can implement certain functions through the logical relationships of hardware circuits. The logical relationships of the aforementioned hardware circuits are fixed or reconfigurable. For example, the processor is a hardware circuit implemented using an application-specific integrated circuit (ASIC) or a programmable logic device (PLD), such as an FPGA. In a reconfigurable hardware circuit, the process of the processor loading a configuration document and configuring the hardware circuit can be understood as the process of the processor loading instructions to implement the functions of some or all of the above units or modules. In addition, it can also be hardware circuits designed for artificial intelligence, which can be understood as ASICs, such as Neural Network Processing Units (NPUs), Tensor Processing Units (TPUs), and Deep Learning Processing Units (DPUs).

[0378] Figure 4 is a schematic diagram of the structure of a communication device proposed in an embodiment of this disclosure. The communication device can be a terminal or a network device. As shown in Figure 4, the communication device 4100 may include a transceiver module 4101 and a processing module 4102.

[0379] In some embodiments, the communication device is a terminal, and the transceiver module 4101 is a first transceiver module configured to receive first information, the first information indicating the time-domain resource configuration for the first data transmission. The processing module 4102 is a first processing module configured to determine the symbols for the first data transmission based on the time-domain resource configuration; wherein the symbols for the first data transmission satisfy a first condition, the first condition being that the symbols for the first data transmission do not overlap with a first type of symbols, the first type of symbols being symbols not used for the first data transmission.

[0380] In some embodiments, the communication device is a network device, and the transceiver module 4101 is a second transceiver module configured to send first information, the first information indicating the time-domain resource configuration of the first data transmission. The processing module 4102 is a second processing module configured to determine the symbols of the first data transmission according to the time-domain resource configuration; wherein the symbols of the first data transmission satisfy a first condition, the first condition being that the symbols of the first data transmission do not overlap with a first type of symbols, the first type of symbols being symbols not used for the first data transmission.

[0381] Figure 5 is a schematic diagram of the structure of a communication device provided according to an embodiment of this disclosure. The communication device 5100 can be a terminal or a network device, or it can be a chip, chip system, or processor that supports the terminal or network device in implementing any of the above methods. The communication device 5100 can be used to implement the methods described in the above method embodiments; for details, please refer to the descriptions in the above method embodiments.

[0382] As shown in Figure 5, the communication device 5100 includes one or more processors 5101. The processor 5101 can be a general-purpose processor or a dedicated processor, such as a baseband processor or a central processing unit (CPU). The baseband processor can be used to process communication protocols and communication data, while the CPU can be used to control communication devices (e.g., base stations, baseband chips, terminal devices, terminal device chips, DUs or CUs, etc.), execute programs, and process program data. Optionally, the communication device 5100 can be used to execute any of the above methods. Optionally, one or more processors 5101 can be used to invoke instructions to cause the communication device 5100 to execute any of the above methods.

[0383] In some embodiments, the communication device 5100 further includes one or more transceivers 5102. When the communication device 5100 includes one or more transceivers 5102, the transceiver 5102 performs at least one of the communication steps such as sending and / or receiving in the above method (e.g., steps S2101, S2106, but not limited thereto), and the processor 5101 performs at least one of other steps (e.g., steps S2102, S2103, S2104, S2105, but not limited thereto). In optional embodiments, the transceiver 5102 may include a receiver and / or a transmitter, which may be separate or integrated together. Optionally, the terms transceiver, transceiver unit, transceiver, transceiver circuit, interface circuit, interface, etc., can be used interchangeably; the terms transmitter, transmitting unit, transmitter, transmitting circuit, etc., can be used interchangeably; and the terms receiver, receiving unit, receiver, receiving circuit, etc., can be used interchangeably.

[0384] In some embodiments, the communication device 5100 further includes one or more memories 5103 for storing data. Optionally, all or part of the memories 5103 may be located outside the communication device 5100. In optional embodiments, the communication device 5100 may include one or more interface circuits 5104. Optionally, the interface circuits 5104 are connected to the memories 5103 and can be used to receive data from the memories 5103 or other devices, and to send data to the memories 5103 or other devices. For example, the interface circuits 5104 can read data stored in the memories 5103 and send the data to the processor 5101.

[0385] The communication device 5100 described in the above embodiments may be a network device or a terminal, but the scope of the communication device 5100 described in this disclosure is not limited thereto, and the structure of the communication device 5100 may not be limited by FIG. 5. The communication device may be a standalone device or a part of a larger device. For example, the communication device may be: (1) a standalone integrated circuit IC, or chip, or chip system or subsystem; (2) a collection of one or more ICs, optionally, the IC collection may also include storage components for storing data and programs; (3) an ASIC, such as a modem; (4) a module that can be embedded in other devices; (5) a receiver, terminal device, smart terminal device, cellular phone, wireless device, handheld device, mobile unit, vehicle device, network device, cloud device, artificial intelligence device, etc.; (6) others, etc.

[0386] Figure 6 is a schematic diagram of the structure of a chip provided according to an embodiment of the present disclosure. For cases where the communication device 5100 can be a chip or a chip system, please refer to the schematic diagram of the chip 6100 shown in Figure 6, but it is not limited thereto.

[0387] Chip 6100 includes one or more processors 6101. Chip 6100 is used to perform any of the above methods.

[0388] In some embodiments, chip 6100 further includes one or more interface circuits 6102. Optionally, terms such as interface circuit, interface, and transceiver pin can be used interchangeably. In some embodiments, chip 6100 further includes one or more memories 6103 for storing data. Optionally, all or part of the memories 6103 may be located outside chip 6100. Optionally, interface circuit 6102 is connected to memory 6103, and interface circuit 6102 can be used to receive data from memory 6103 or other devices, and interface circuit 6102 can be used to send data to memory 6103 or other devices. For example, interface circuit 6102 can read data stored in memory 6103 and send the data to processor 6101.

[0389] In some embodiments, the interface circuit 6102 performs at least one of the communication steps such as sending and / or receiving in the above-described method (e.g., step S2101, step S2106, but not limited thereto). The interface circuit 6102 performing the communication steps such as sending and / or receiving in the above-described method refers, for example, to the interface circuit 6102 performing data interaction between the processor 6101, the chip 6100, the memory 6103, or the transceiver device. In some embodiments, the processor 6101 performs at least one of other steps (e.g., step S2102, step S2103, step S2104, step S2105, but not limited thereto).

[0390] The modules and / or devices described in the various embodiments, such as virtual devices, physical devices, and chips, can be combined or separated arbitrarily as needed. Optionally, some or all steps can also be performed collaboratively by multiple modules and / or devices, which is not limited here.

[0391] This disclosure also proposes a storage medium storing instructions that, when executed on a communication device 5100, cause the communication device 5100 to perform any of the methods described above. Optionally, the storage medium is an electronic storage medium. Optionally, the storage medium is a computer-readable storage medium, but not limited thereto; it may also be a storage medium readable by other devices. Optionally, the storage medium may be a non-transitory storage medium, but not limited thereto; it may also be a temporary storage medium.

[0392] This disclosure also proposes a program product that, when executed by a communication device 5100, causes the communication device 5100 to perform any of the above methods. Optionally, the program product is a computer program product.

[0393] This disclosure also proposes a computer program that, when run on a computer, causes the computer to perform any of the above methods.

[0394] Other embodiments of the invention will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of the invention that follow the general principles of the invention and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of the invention are indicated by the following claims.

[0395] It should be understood that the present invention is not limited to the precise structure described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of the invention is limited only by the appended claims.

Claims

1. A communication method, executed by a terminal, the method comprising: Receive first information, the first information indicating the time domain resource configuration for the first data transmission; Based on the time-domain resource configuration, the symbols for the first data transmission are determined; wherein the symbols for the first data transmission satisfy a first condition, the first condition being that the symbols for the first data transmission do not overlap with a first type of symbols, and the first type of symbols being symbols not used for the first data transmission.

2. The method according to claim 1, wherein, The time-domain resource configuration for the first data transmission includes: The first parameter indicates the start time slot of the first data transmission; The second parameter indicates the starting symbol and the number of symbols for the first data transmission.

3. The method according to claim 2, wherein, The step of determining the symbol for the first data transmission based on the time-domain resource configuration includes: Starting from the initial symbol within the initial time slot, each symbol is traversed sequentially, and symbols that satisfy the first condition are determined as symbols for the first data transmission, until the number of symbols for the first data transmission is L; or, Starting from the initial symbol within the initial time slot, each symbol within the initial time slot is traversed sequentially, and symbols that satisfy the first condition are determined as the symbols for the first data transmission, until one of the following is reached: The number of symbols transmitted in the first data transmission is L; The last symbol within the initial time slot; Where L is the number of symbols indicated by the second parameter.

4. The method according to claim 2 or 3, wherein, The time-domain resource configuration of the first data transmission further includes: a third parameter, indicating the number of repetitions of the first data transmission; The step of determining the symbol for the first data transmission based on the time-domain resource configuration includes: For the first repetition of the first data transmission, starting from the initial symbol within the initial time slot, each symbol is traversed sequentially, and symbols that satisfy the first condition are determined as the symbols of the first repetition, until the number of symbols of the first repetition is L; or, For the first repetition of the first data transmission, starting from the starting symbol within the starting time slot, each symbol within the starting time slot is traversed sequentially, and symbols that satisfy the first condition are determined as the symbols of the first repetition, until one of the following: The number of symbols transmitted in the first data transmission is L; The last symbol within the initial time slot; Where L is the number of symbols indicated by the second parameter.

5. The method according to claim 4, wherein, The method further includes: For the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, each symbol is traversed sequentially, and symbols that satisfy the first condition are determined as symbols of the i-th repetition, until the number of symbols of the i-th repetition is L; or, For the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, each symbol in the reference time slot is traversed sequentially, and the symbol that satisfies the first condition is determined as the symbol of the i-th repetition, until one of the following: The number of symbols repeated in the i-th instance is L; The last symbol within the reference time slot; Where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

6. The method according to claim 5, wherein, The reference time slot corresponding to the i-th repetition is the time slot where the end symbol of the (i-1)-th repetition is located, or the next time slot after the time slot where the end symbol of the (i-1)-th repetition is located.

7. The method according to claim 6, wherein, The end symbol of the (i-1)th repetition precedes the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the time slot where the end symbol of the (i-1)th repetition is located; or, The end symbol of the (i-1)th repetition overlaps with the start symbol of the ith repetition, and the reference time slot corresponding to the (i-1)th repetition is the next time slot after the time slot containing the end symbol of the (i-1)th repetition; or, The end symbol of the (i-1)th repetition follows the start symbol of the i-th repetition, and the reference time slot of the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located.

8. The method according to claim 2 or 3, wherein, The time-domain resource configuration of the first data transmission further includes: a third parameter, indicating the number of repetitions of the first data transmission; The step of determining the symbol for the first data transmission based on the time-domain resource configuration includes: For the first nominal repetition of the first data transmission, starting from the starting symbol in the starting time slot, each symbol is traversed sequentially, and the symbol that satisfies the first condition is determined as the symbol of the first nominal repetition, until the number of symbols of the first nominal repetition is L; For the i-th nominal repetition of the first data transmission, starting from the first symbol satisfying the first condition after the end symbol of the (i-1)-th nominal repetition, each symbol is traversed sequentially, and the symbol satisfying the first condition is determined as the symbol of the i-th nominal repetition, until the number of symbols in the i-th nominal repetition is L; or, For the i-th nominal repetition of the first data transmission, starting from the first symbol after the end symbol of the (i-1)-th nominal repetition, each symbol is traversed sequentially, and the symbol that satisfies the first condition is determined as the symbol of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L. Where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

9. The method according to claim 8, wherein, The method further includes: Identify at least one actual repeating symbol included in each nominal repetition.

10. The method according to claim 9, wherein, Each nominal repetition, which occupies two consecutive time slots, includes one actual repetition, wherein the symbols in the actual repetition are located in different time slots.

11. The method according to any one of claims 8 to 10, wherein, The method also includes one of the following: The K nominal repetitions are defined as the first data transmission; The actual repetitions included in the K nominal repetitions are determined as the first data transmission.

12. The method according to any one of claims 2 to 11, wherein, The method further includes: Based on the time-domain resource configuration, the transport block size TBS of the transport block TB included in the first data transmission is determined; Based on the TBS, the TB is transmitted on the symbol of the first data transmission.

13. The method according to claim 12, wherein, The step of determining the transport block size (TBS) of the transport block (TB) included in the first data transmission based on the time-domain resource configuration of the first data transmission includes one of the following: The TBS is determined based on the number of symbols indicated by the second parameter; The TBS is determined based on the number of symbols repeated in the first data transmission. The TBS is determined based on the average number of repeated symbols in the first data transmission. The TBS is determined based on the maximum number of repeated symbols in the first data transmission. The TBS is determined based on the minimum number of all repeating symbols in the first data transmission.

14. The method according to any one of claims 1 to 13, wherein, The first type of symbols includes at least one of the following: synchronization signal block symbols, uplink symbols, downlink symbols, probe reference signal symbols, and symbols indicating higher-layer signaling.

15. A communication method performed by a network device, the method comprising: Send a first message, the first message indicating the time domain resource configuration for the first data transmission; Based on the time-domain resource configuration, the symbols for the first data transmission are determined; wherein the symbols for the first data transmission satisfy a first condition, the first condition being that the symbols for the first data transmission do not overlap with a first type of symbols, and the first type of symbols being symbols not used for the first data transmission.

16. The method according to claim 15, wherein, The time-domain resource configuration for the first data transmission includes: The first parameter indicates the start time slot of the first data transmission; The second parameter indicates the starting symbol and the number of symbols for the first data transmission.

17. The method according to claim 16, wherein, The step of determining the symbol for the first data transmission based on the time-domain resource configuration includes: Starting from the initial symbol within the initial time slot, each symbol is traversed sequentially, and symbols that satisfy the first condition are determined as symbols for the first data transmission, until the number of symbols for the first data transmission is L; or, Starting from the initial symbol within the initial time slot, each symbol within the initial time slot is traversed sequentially, and symbols that satisfy the first condition are determined as the symbols for the first data transmission, until one of the following is reached: The number of symbols transmitted in the first data transmission is L; The last symbol within the initial time slot; Where L is the number of symbols indicated by the second parameter.

18. The method according to claim 16 or 17, wherein, The time-domain resource configuration of the first data transmission further includes: a third parameter, indicating the number of repetitions of the first data transmission; The step of determining the symbol for the first data transmission based on the time-domain resource configuration includes: For the first repetition of the first data transmission, starting from the initial symbol within the initial time slot, each symbol is traversed sequentially, and symbols that satisfy the first condition are determined as the symbols of the first repetition, until the number of symbols of the first repetition is L; or, For the first repetition of the first data transmission, starting from the starting symbol within the starting time slot, each symbol within the starting time slot is traversed sequentially, and symbols that satisfy the first condition are determined as the symbols of the first repetition, until one of the following: The number of symbols transmitted in the first data transmission is L; The last symbol within the initial time slot; Where L is the number of symbols indicated by the second parameter.

19. The method according to claim 18, wherein, The method further includes: For the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, each symbol is traversed sequentially, and symbols that satisfy the first condition are determined as symbols of the i-th repetition, until the number of symbols of the i-th repetition is L; or, For the i-th repetition of the first data transmission, starting from the starting symbol in the reference time slot corresponding to the i-th repetition, each symbol in the reference time slot is traversed sequentially, and the symbol that satisfies the first condition is determined as the symbol of the i-th repetition, until one of the following: The number of symbols repeated in the i-th instance is L; The last symbol within the reference time slot; Where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

20. The method according to claim 19, wherein, The reference time slot corresponding to the i-th repetition is the time slot where the end symbol of the (i-1)-th repetition is located, or the next time slot after the time slot where the end symbol of the (i-1)-th repetition is located.

21. The method according to claim 20, wherein, The end symbol of the (i-1)th repetition precedes the start symbol of the i-th repetition, and the reference time slot corresponding to the (i-1)th repetition is the time slot where the end symbol of the (i-1)th repetition is located; or, The end symbol of the (i-1)th repetition overlaps with the start symbol of the ith repetition, and the reference time slot corresponding to the (i-1)th repetition is the next time slot after the time slot containing the end symbol of the (i-1)th repetition; or, The end symbol of the (i-1)th repetition follows the start symbol of the i-th repetition, and the reference time slot of the (i-1)th repetition is the next time slot after the time slot where the end symbol of the (i-1)th repetition is located.

22. The method according to claim 16 or 17, wherein, The time-domain resource configuration of the first data transmission further includes: a third parameter, indicating the number of repetitions of the first data transmission; The step of determining the symbol for the first data transmission based on the time-domain resource configuration includes: For the first nominal repetition of the first data transmission, starting from the starting symbol in the starting time slot, each symbol is traversed sequentially, and the symbol that satisfies the first condition is determined as the symbol of the first nominal repetition, until the number of symbols of the first nominal repetition is L; For the i-th nominal repetition of the first data transmission, starting from the first symbol satisfying the first condition after the end symbol of the (i-1)-th nominal repetition, each symbol is traversed sequentially, and the symbol satisfying the first condition is determined as the symbol of the i-th nominal repetition, until the number of symbols in the i-th nominal repetition is L; or, For the i-th nominal repetition of the first data transmission, starting from the first symbol after the end symbol of the (i-1)-th nominal repetition, each symbol is traversed sequentially, and the symbol that satisfies the first condition is determined as the symbol of the i-th nominal repetition, until the number of symbols of the i-th nominal repetition is L; where i = 2, 3, ..., K, K is the number of repetitions, and L is the number of symbols indicated by the second parameter.

23. The method according to claim 22, wherein, The method further includes: Identify at least one actual repeating symbol included in each nominal repetition.

24. The method according to claim 23, wherein, Each nominal repetition, which occupies two consecutive time slots, includes one actual repetition, wherein the symbols in the actual repetition are located in different time slots.

25. The method according to any one of claims 22 to 24, wherein, The method also includes one of the following: The K nominal repetitions are defined as the first data transmission; The actual repetitions included in the K nominal repetitions are determined as the first data transmission.

26. The method according to any one of claims 16 to 25, wherein, The method further includes: Based on the time-domain resource configuration, the transport block size TBS of the transport block TB included in the first data transmission is determined; Based on the TBS, the TB is received on the symbol of the first data transmission.

27. The method according to claim 26, wherein, The step of determining the transport block size (TBS) of the transport block (TB) included in the first data transmission based on the time-domain resource configuration of the first data transmission includes one of the following: The TBS is determined based on the number of symbols indicated by the second parameter; The TBS is determined based on the number of symbols repeated in the first data transmission. The TBS is determined based on the average number of repeated symbols in the first data transmission. The TBS is determined based on the maximum number of repeated symbols in the first data transmission. The TBS is determined based on the minimum number of all repeating symbols in the first data transmission.

28. The method according to any one of claims 15 to 27, wherein, The first type of symbols includes at least one of the following: synchronization signal block symbols, uplink symbols, downlink symbols, probe reference signal symbols, and symbols indicating higher-layer signaling.

29. A communication device configured to implement the communication method as described in any one of claims 1 to 14, 15 to 28.

30. A communication system comprising a terminal and a network device; the terminal being configured to implement the communication method as described in any one of claims 1 to 14; and the network device being configured to implement the communication method as described in any one of claims 15 to 28.

31. A storage medium storing instructions that, when executed on a communication device, cause the communication device to perform the communication method as described in any one of claims 1 to 14, 15 to 28.

32. A computer program product comprising a computer program that, when executed by a processor, implements the communication method as described in any one of claims 1 to 14, 14 to 28.

Images