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 method is executed by a terminal, and comprises: receiving first information; and on the basis of the first information, determining at least one first time slot of a physical uplink shared channel (PUSCH) and at least one first symbol included in the PUSCH on each first time slot, wherein first symbols in the same first time slot are discontinuous, and / or the first symbols in different first time slots are different. In the present disclosure, time-domain resources of a PUSCH can be flexibly allocated, thereby increasing the utilization rate of uplink time-domain resources and improving the uplink coverage performance.

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 sixth-generation mobile communication technology (6G) is rapidly developing. It will inherit and expand the functions of the fifth-generation mobile communication technology (5G) – New Radio (NR) – to achieve higher speeds, lower latency, and greater connectivity. In 6G, network devices can configure time-domain resources for terminals to transmit the Physical Uplink Shared Channel (PUSCH).

[0003] Summary of the Invention

[0004] During the PUSCH transmission process at the terminal, the uplink time domain resources configured by the network device will not be fully utilized, resulting in wasted uplink resources and decreased 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 provided, executed by a terminal, the method comprising: receiving first information; determining, based on the first information, at least one first time slot of a Physical Uplink Shared Channel (PUSCH), and in each first time slot, the PUSCH includes at least one first symbol; wherein the first symbols are discontinuous within the same first time slot, and / or the first symbols are different in different first time slots.

[0007] According to a second aspect of the present disclosure, a communication method is provided, performed by a network device, the method comprising: sending first information; determining, based on the first information, at least one first time slot of a Physical Uplink Shared Channel (PUSCH), and at least one first symbol included in each first time slot; wherein the first symbols are discontinuous within the same first time slot, and / or the first symbols are different in different first time slots.

[0008] According to a third aspect of the present disclosure, a terminal is provided, comprising: a first transceiver module configured to receive first information; and a first processing module configured to determine, based on the first information, at least one first time slot of a Physical Uplink Shared Channel (PUSCH), and at least one first symbol included in each first time slot; wherein the first symbols are discontinuous within the same first time slot, and / or the first symbols are different in different first time slots.

[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; and a second processing module configured to determine, based on the first information, at least one first time slot of a Physical Uplink Shared Channel (PUSCH), and at least one first symbol included in each first time slot; wherein the first symbols are discontinuous within the same first time slot, and / or the first symbols are different in different first time slots.

[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 of the disclosure, the PUSCH is allocated in at least one first time slot. In each first time slot, the PUSCH includes at least one first symbol. The first symbols are not continuous within the same first time slot, and / or the first symbols are different in different first time slots. This allows for flexible allocation of the PUSCH's time domain resources, improving the utilization rate of uplink time domain resources and uplink coverage performance. 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 1I is a schematic diagram of the time-domain resources of PUSCH repetition type A and SRS according to an embodiment of the present disclosure.

[0026] Figure 1J is a schematic diagram of the time-domain resources of PUSCH repeat types A and SSB according to an embodiment of the present disclosure.

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

[0028] Figure 2B is a schematic diagram illustrating the determination of the time-domain resources of the PUSCH based on Case 1 and physical time slot count according to an embodiment of the present disclosure.

[0029] Figure 2C is a schematic diagram illustrating the determination of the time-domain resources of the PUSCH based on Case 1 and the available time slot count, according to an embodiment of the present disclosure.

[0030] Figure 2D is a schematic diagram illustrating the determination of the time-domain resources of the PUSCH based on Case 3-1 and physical time slot count according to an embodiment of the present disclosure.

[0031] Figure 2E is a schematic diagram illustrating the determination of the time-domain resources of the PUSCH based on case 3-1 and the available time slot count, according to an embodiment of the present disclosure.

[0032] Figure 2F is a schematic diagram illustrating the determination of the time-domain resources of the PUSCH based on Case 3 and the physical time slot count, according to an embodiment of the present disclosure.

[0033] Figure 2G is a schematic diagram illustrating the determination of the time-domain resources of the PUSCH based on Case 3 and the available time slot count, according to an embodiment of the present disclosure.

[0034] Figure 2H is a schematic diagram illustrating the determination of the time-domain resources of PUSCH based on case 4-1 according to an embodiment of the present disclosure.

[0035] Figure 2I is a schematic diagram illustrating the determination of the time-domain resources of PUSCH based on case 4-2 according to an embodiment of the present disclosure.

[0036] Figure 2J is a schematic diagram illustrating the determination of the time-domain resources of PUSCH based on case 7 according to an embodiment of the present disclosure.

[0037] Figure 2K is a schematic diagram illustrating the determination of the time-domain resources of PUSCH based on cases 7, K, and N according to an embodiment of the present disclosure.

[0038] Figure 2L is a schematic diagram illustrating the time-domain resources of PUSCH repetition type A and SRS determined based on case 1 according to an embodiment of the present disclosure.

[0039] Figure 2M is a temporal resource diagram illustrating PUSCH repetition type A and SSB determined based on cases 4 and 7 according to an embodiment of the present disclosure.

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

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

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

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

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

[0045] In a first aspect, embodiments of this disclosure provide a communication method executed by a terminal, the method comprising: receiving first information; determining, based on the first information, at least one first time slot of a Physical Uplink Shared Channel (PUSCH), and at least one first symbol included in each first time slot; wherein the first symbols within the same first time slot are discontinuous, and / or the first symbols within different first time slots are different.

[0046] In the embodiments of this disclosure, the PUSCH is allocated in at least one first time slot. In each first time slot, the PUSCH includes at least one first symbol. The first symbols are not continuous within the same first time slot, and / or the first symbols are different in different first time slots. This allows for flexible allocation of the time domain resources of the PUSCH, improving the utilization rate of uplink time domain resources and uplink coverage performance.

[0047] In conjunction with some embodiments of the first aspect, in some embodiments, the first information indicates at least one first parameter and at least one second parameter, the at least one first parameter being used to determine a first time slot, and the at least one second parameter being used to indicate a first symbol within the first time slot.

[0048] In conjunction with some embodiments of the first aspect, in some embodiments, the first information indicates a first parameter and at least one second parameter, the at least one second parameter corresponding one-to-one with at least one first time slot, the first parameter being used to determine the first first time slot, and the at least one second parameter being used to determine at least one first symbol within the first time slot corresponding to the second parameter.

[0049] In this embodiment of the disclosure, at least one first symbol in at least one first time slot can be determined by at least one second parameter, and different values ​​of the second parameter can be configured to have different first symbols in different first time slots.

[0050] In conjunction with some embodiments of the first aspect, in some embodiments, the number of first time slots is the number of second parameters.

[0051] In conjunction with some embodiments of the first aspect, in some embodiments, determining at least one first time slot of PUSCH based on first information includes: starting from the time slot indicated by the first parameter, continuously selecting N... PUSCH The first time slot is determined to be N; among them, N PUSCH This represents the number of the first time slots.

[0052] In conjunction with some embodiments of the first aspect, in some embodiments, determining at least one first time slot of PUSCH based on first information includes: starting from the time slot indicated by the first parameter, NPUSCH A time slot that satisfies the first condition is determined as the first time slot; where, N PUSCH The first time slot is the number of first time slots. The first condition is that at least one first symbol in the first time slot does not overlap with a second symbol. The second symbol includes at least one of the following: a synchronization signal block symbol, a downlink symbol, a probe reference signal symbol, and a symbol indicated by higher-layer signaling.

[0053] In conjunction with some embodiments of the first aspect, in some embodiments, the number of first parameters and the number of second parameters are equal, at least one first parameter corresponds one-to-one with at least one first time slot, at least one second parameter corresponds one-to-one with at least one first time slot, at least one first parameter corresponds one-to-one with at least one second parameter, at least one first parameter is used to determine the first time slot corresponding to the first parameter, and at least one second parameter is used to determine at least one first symbol in the first time slot corresponding to the second parameter.

[0054] In this embodiment of the disclosure, at least one first symbol in at least one first time slot can be determined by at least one second parameter, and different values ​​of the second parameter can be configured to have different first symbols in different first time slots.

[0055] In conjunction with some embodiments of the first aspect, in some embodiments, there are multiple first parameters, and the first symbols indicated by the second parameters corresponding to the first parameters with the same value do not overlap.

[0056] In this embodiment of the disclosure, the second parameter corresponding to the first parameter with the same value is used to determine the first symbol within the same first time slot, and the first symbols indicated by the second parameter do not overlap, that is, the second parameter can configure the first symbols within the same first time slot to be discontinuous.

[0057] In conjunction with some embodiments of the first aspect, in some embodiments, the number of first parameters is less than the number of second parameters, at least one first parameter corresponds one-to-one with at least one first time slot, each first parameter corresponds to n second parameters, at least one first parameter is used to determine the first time slot corresponding to the first parameter, and the n second parameters are used to determine at least one first symbol in the first time slot corresponding to the first parameter, where n is a positive integer greater than 1.

[0058] In this embodiment of the disclosure, n second parameters are used to determine at least one first symbol within the first time slot corresponding to the first parameter, that is, the second parameter can configure the first symbols within the same first time slot to be discontinuous.

[0059] In conjunction with some embodiments of the first aspect, in some embodiments, each second parameter corresponds to a first parameter.

[0060] In conjunction with some embodiments of the first aspect, in some embodiments, the first symbols indicated by n second parameters corresponding to the same first parameter do not overlap.

[0061] In conjunction with some embodiments of the first aspect, in some embodiments, the number of first parameters is multiple, the values ​​of the multiple first parameters are different, and the number of first time slots is the number of first parameters.

[0062] In conjunction with some embodiments of the first aspect, in some embodiments, the number of first parameters is multiple, some of the first parameters have the same value, and the number of first time slots is the number of first parameters with different values.

[0063] In conjunction with some embodiments of the first aspect, in some embodiments, the second parameter includes at least one of the following: a third parameter indicating the starting position and number of at least one first symbol in the first time slot; a fourth parameter indicating the starting position of at least one first symbol in the first time slot; a fifth parameter indicating the number of at least one first symbol in the first time slot; and a bitmap indicating the position of at least one first symbol in the first time slot.

[0064] In conjunction with some embodiments of the first aspect, in some embodiments, the PUSCH carries a transport block TB, and the first information further indicates at least one of the following: the number of time slots for determining the transport block size TBS; the number of repetitions of the PUSCH; wherein the product of the number of repetitions and the number of time slots is the number of first time slots, the number of repetitions is a positive integer, and the number of time slots is a positive integer.

[0065] In conjunction with some embodiments of the first aspect, in some embodiments, the PUSCH carries a TB, where the number of repetitions is 1 and the number of time slots is the number of the first time slots, or the number of time slots is 1 and the number of repetitions is the number of the first time slots, provided that the first information does not indicate the number of repetitions of the PUSCH transmission and the number of time slots used to determine the TBS.

[0066] In some embodiments, in conjunction with the first aspect, the method further includes: determining the TBS of a TB carried by the PUSCH based on the first information; and sending a TB on the PUSCH based on the TBS.

[0067] In conjunction with some embodiments of the first aspect, in some embodiments, determining the TBS of a TB carried by the PUSCH based on the first information includes one of the following: determining the TBS based on the number of first symbols in the first first time slot; determining the TBS based on the maximum number of first symbols in all first time slots; determining the TBS based on the minimum number of first symbols in all first time slots; determining the TBS based on the average number of first symbols in all first time slots; determining the TBS based on the sum of the number of first symbols in the first N first time slots in the time sequence; determining the TBS based on the sum of the number of first symbols in the first N first time slots arranged in a first order; determining the TBS based on the sum of the number of first symbols in the last N first time slots arranged in the first order; wherein N is the number of time slots used to determine the TBS, N is a positive integer greater than or equal to 1, and the first order is the descending order of the number of first symbols in each first time slot.

[0068] In a second aspect, embodiments of this disclosure provide a communication method executed by a network device, the method comprising: sending first information; determining, based on the first information, at least one first time slot configured for a Physical Uplink Shared Channel (PUSCH), and in each first time slot, the PUSCH includes at least one first symbol; wherein the first symbols within the same first time slot are discontinuous, and / or, the first symbols within different first time slots are different.

[0069] In conjunction with some embodiments of the second aspect, in some embodiments, the first information indicates at least one first parameter and at least one second parameter, the at least one first parameter being used to determine a first time slot, and the at least one second parameter being used to indicate the position of a first symbol within the first time slot.

[0070] In conjunction with some embodiments of the second aspect, in some embodiments, the first information indicates a first parameter and at least one second parameter, the at least one second parameter corresponding one-to-one with at least one first time slot, the first parameter being used to determine the first first time slot, and the at least one second parameter being used to determine at least one first symbol within the first time slot corresponding to the second parameter.

[0071] In conjunction with some embodiments of the second aspect, in some embodiments, the number of first time slots is the number of second parameters.

[0072] In conjunction with some embodiments of the second aspect, in some embodiments, determining at least one first time slot of PUSCH based on first information includes: starting from the time slot indicated by the first parameter, continuously selecting N... PUSCH The first time slot is determined to be N; among them, N PUSCH This represents the number of the first time slots.

[0073] In conjunction with some embodiments of the second aspect, in some embodiments, determining at least one first time slot of PUSCH based on first information includes: starting from the time slot indicated by the first parameter, N PUSCH A time slot that satisfies the first condition is determined as the first time slot; where, N PUSCH The first time slot is the number of first time slots. The first condition is that at least one first symbol does not overlap with a second symbol in the first time slot. The second symbol includes at least one of the following: a synchronization signal block symbol, a downlink symbol, a probe reference signal symbol, and a symbol indicated by higher-layer signaling.

[0074] In conjunction with some embodiments of the second aspect, in some embodiments, the number of first parameters and the number of second parameters are equal, at least one first parameter corresponds one-to-one with at least one first time slot, at least one second parameter corresponds one-to-one with at least one first time slot, at least one first parameter corresponds one-to-one with at least one second parameter, at least one first parameter is used to determine the first time slot corresponding to the first parameter, and at least one second parameter is used to determine at least one first symbol within the first time slot corresponding to the second parameter.

[0075] In conjunction with some embodiments of the second aspect, in some embodiments, there are multiple first parameters, and the first symbols indicated by the second parameters corresponding to the first parameters with the same value do not overlap.

[0076] In conjunction with some embodiments of the second aspect, in some embodiments, the number of first parameters is less than the number of second parameters, at least one first parameter corresponds one-to-one with at least one first time slot, each first parameter corresponds to n second parameters, at least one first parameter is used to determine the first time slot corresponding to the first parameter, and the n second parameters are used to determine at least one first symbol in the first time slot corresponding to the first parameter, where n is a positive integer greater than 1.

[0077] In conjunction with some embodiments of the second aspect, in some embodiments, each second parameter corresponds to a first parameter.

[0078] In conjunction with some embodiments of the second aspect, in some embodiments, the first symbols indicated by n second parameters corresponding to the same first parameter do not overlap.

[0079] In conjunction with some embodiments of the second aspect, in some embodiments, the number of first parameters is multiple, the values ​​of the multiple first parameters are different, and the number of first time slots is the number of first parameters.

[0080] In conjunction with some embodiments of the second aspect, in some embodiments, the number of first parameters is multiple, some of the first parameters have the same value, and the number of first time slots is the number of first parameters with different values.

[0081] In conjunction with some embodiments of the second aspect, in some embodiments, the second parameter includes at least one of the following: a third parameter indicating the starting position and number of at least one first symbol in the first time slot; a fourth parameter indicating the starting position of at least one first symbol in the first time slot; a fifth parameter indicating the number of at least one first symbol in the first time slot; and a bitmap indicating the position of the first symbol in the first time slot.

[0082] In conjunction with some embodiments of the second aspect, in some embodiments, the PUSCH carries a transport block TB, and the first information further indicates at least one of the following: the number of time slots for determining the transport block size TBS; the number of repetitions of the PUSCH transmission; wherein the product of the number of repetitions and the number of time slots is the number of first time slots, the number of repetitions is a positive integer, and the number of time slots is a positive integer.

[0083] In conjunction with some embodiments of the second aspect, in some embodiments, the PUSCH carries a TB, where the number of repetitions is 1 and the number of time slots is the number of the first time slot, or the number of time slots is 1 and the number of repetitions is the number of the first time slot, provided that the first information does not indicate the number of repetitions of the PUSCH transmission and the number of time slots used to determine the TBS.

[0084] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes: determining the TBS of a TB carried by the PUSCH based on the first information; and receiving a TB on the PUSCH based on the TBS.

[0085] In conjunction with some embodiments of the second aspect, in some embodiments, determining the TBS of a TB carried by the PUSCH based on the first information includes one of the following: determining the TBS based on the number of first symbols in the first first time slot; determining the TBS based on the maximum number of first symbols in all first time slots; determining the TBS based on the minimum number of first symbols in all first time slots; determining the TBS based on the average number of first symbols in all first time slots; determining the TBS based on the sum of the number of first symbols in the first N first time slots in the time sequence; determining the TBS based on the sum of the number of first symbols in the first N first time slots arranged in a first order; determining the TBS based on the sum of the number of first symbols in the last N first time slots arranged in the first order; wherein, N is the number of time slots used to determine the TBS, N is a positive integer greater than or equal to 1, and the first order is the descending order of the number of first symbols in each first time slot.

[0086] Thirdly, embodiments of this disclosure provide a terminal, including: a first transceiver module configured to receive first information; and a first processing module configured to determine at least one first time slot of a Physical Uplink Shared Channel (PUSCH) based on the first information, and at least one first symbol included in each first time slot of the PUSCH; wherein the first symbols in the same first time slot are discontinuous, and / or the first symbols in different first time slots are different.

[0087] In conjunction with some embodiments of the third aspect, in some embodiments, the first information indicates at least one first parameter and at least one second parameter, the at least one first parameter being used to determine a first time slot, and the at least one second parameter being used to indicate a first symbol within the first time slot.

[0088] In conjunction with some embodiments of the third aspect, in some embodiments, the first information indicates a first parameter and at least one second parameter, the at least one second parameter corresponding one-to-one with at least one first time slot, the first parameter being used to determine the first first time slot, and the at least one second parameter being used to determine at least one first symbol within the first time slot corresponding to the second parameter.

[0089] In conjunction with some embodiments of the third aspect, in some embodiments, the number of first time slots is the number of second parameters.

[0090] In conjunction with some embodiments of the third aspect, in some embodiments, determining at least one first time slot of PUSCH based on first information includes: starting from the time slot indicated by the first parameter, continuously selecting N... PUSCH The first time slot is determined to be N; among them, N PUSCH This represents the number of the first time slots.

[0091] In conjunction with some embodiments of the third aspect, in some embodiments, determining at least one first time slot of PUSCH based on first information includes: starting from the time slot indicated by the first parameter, N PUSCH A time slot that satisfies the first condition is determined as the first time slot; where, N PUSCH The first time slot is the number of first time slots. The first condition is that at least one first symbol in the first time slot does not overlap with a second symbol. The second symbol includes at least one of the following: a synchronization signal block symbol, a downlink symbol, a probe reference signal symbol, and a symbol indicated by higher-layer signaling.

[0092] In conjunction with some embodiments of the third aspect, in some embodiments, the number of first parameters and the number of second parameters are equal, at least one first parameter corresponds one-to-one with at least one first time slot, at least one second parameter corresponds one-to-one with at least one first time slot, at least one first parameter corresponds one-to-one with at least one second parameter, at least one first parameter is used to determine the first time slot corresponding to the first parameter, and at least one second parameter is used to determine at least one first symbol in the first time slot corresponding to the second parameter.

[0093] In conjunction with some embodiments of the third aspect, in some embodiments, there are multiple first parameters, and the first symbols indicated by the second parameters corresponding to the first parameters with the same value do not overlap.

[0094] In conjunction with some embodiments of the third aspect, in some embodiments, the number of first parameters is less than the number of second parameters, at least one first parameter corresponds one-to-one with at least one first time slot, each first parameter corresponds to n second parameters, at least one first parameter is used to determine the first time slot corresponding to the first parameter, and the n second parameters are used to determine at least one first symbol in the first time slot corresponding to the first parameter, where n is a positive integer greater than 1.

[0095] In conjunction with some embodiments of the third aspect, in some embodiments, each second parameter corresponds to a first parameter.

[0096] In conjunction with some embodiments of the third aspect, in some embodiments, the first symbols indicated by n second parameters corresponding to the same first parameter do not overlap.

[0097] In conjunction with some embodiments of the third aspect, in some embodiments, the number of first parameters is multiple, the values ​​of the multiple first parameters are different, and the number of first time slots is the number of first parameters.

[0098] In conjunction with some embodiments of the third aspect, in some embodiments, the number of first parameters is multiple, some of the first parameters have the same value, and the number of first time slots is the number of first parameters with different values.

[0099] In conjunction with some embodiments of the third aspect, in some embodiments, the second parameter includes at least one of the following: a third parameter indicating the starting position and number of at least one first symbol in the first time slot; a fourth parameter indicating the starting position of at least one first symbol in the first time slot; a fifth parameter indicating the number of at least one first symbol in the first time slot; and a bitmap indicating the position of at least one first symbol in the first time slot.

[0100] In conjunction with some embodiments of the third aspect, in some embodiments, the PUSCH carries a transport block TB, and the first information further indicates at least one of the following: the number of time slots for determining the transport block size TBS; the number of repetitions of the PUSCH; wherein the product of the number of repetitions and the number of time slots is the number of the first time slots, the number of repetitions is a positive integer, and the number of time slots is a positive integer.

[0101] In conjunction with some embodiments of the third aspect, in some embodiments, the PUSCH carries a TB, where the number of repetitions is 1 and the number of time slots is the number of the first time slot, or the number of time slots is 1 and the number of repetitions is the number of the first time slot, provided that the first information does not indicate the number of repetitions of the PUSCH transmission and the number of time slots used to determine the TBS.

[0102] In conjunction with some embodiments of the third aspect, in some embodiments, the first processing module is further configured to determine the TBS of a TB carried by the PUSCH based on the first information; the first transceiver module is further configured to transmit a TB on the PUSCH based on the TBS.

[0103] 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 first symbols in the first first time slot; determine the TBS based on the maximum number of first symbols in all first time slots; determine the TBS based on the minimum number of first symbols in all first time slots; determine the TBS based on the average number of first symbols in all first time slots; determine the TBS based on the sum of the number of first symbols in the first N first time slots in the time sequence; determine the TBS based on the sum of the number of first symbols in the first N first time slots arranged in a first order; determine the TBS based on the sum of the number of first symbols in the last N first time slots arranged in the first order; wherein N is the number of time slots used to determine the TBS, N is a positive integer greater than or equal to 1, and the first order is the descending order of the number of first symbols in each first time slot.

[0104] Fourthly, embodiments of this disclosure provide a network device, including: a second transceiver module configured to transmit first information; and a second processing module configured to determine at least one first time slot of a Physical Uplink Shared Channel (PUSCH) based on the first information, and at least one first symbol included in each first time slot of the PUSCH; wherein the first symbols within the same first time slot are discontinuous, and / or the first symbols within different first time slots are different.

[0105] In conjunction with some embodiments of the fourth aspect, in some embodiments, the first information indicates at least one first parameter and at least one second parameter, the at least one first parameter being used to determine a first time slot, and the at least one second parameter being used to indicate the position of a first symbol within the first time slot.

[0106] In conjunction with some embodiments of the fourth aspect, in some embodiments, the first information indicates a first parameter and at least one second parameter, the at least one second parameter corresponding one-to-one with at least one first time slot, the first parameter being used to determine the first first time slot, and the at least one second parameter being used to determine at least one first symbol within the first time slot corresponding to the second parameter.

[0107] In conjunction with some embodiments of the fourth aspect, in some embodiments, the number of first time slots is the number of second parameters.

[0108] In conjunction with some embodiments of the fourth aspect, in some embodiments, determining at least one first time slot of PUSCH based on first information includes: starting from the time slot indicated by the first parameter, continuously selecting N... PUSCH The first time slot is determined to be N; among them, N PUSCH This represents the number of the first time slots.

[0109] In conjunction with some embodiments of the fourth aspect, in some embodiments, determining at least one first time slot of PUSCH based on first information includes: starting from the time slot indicated by the first parameter, N PUSCH A time slot that satisfies the first condition is determined as the first time slot; where, N PUSCH The first time slot is the number of first time slots. The first condition is that at least one first symbol does not overlap with a second symbol in the first time slot. The second symbol includes at least one of the following: a synchronization signal block symbol, a downlink symbol, a probe reference signal symbol, and a symbol indicated by higher-layer signaling.

[0110] In conjunction with some embodiments of the fourth aspect, in some embodiments, the number of first parameters and the number of second parameters are equal, at least one first parameter corresponds one-to-one with at least one first time slot, at least one second parameter corresponds one-to-one with at least one first time slot, at least one first parameter corresponds one-to-one with at least one second parameter, at least one first parameter is used to determine the first time slot corresponding to the first parameter, and at least one second parameter is used to determine at least one first symbol in the first time slot corresponding to the second parameter.

[0111] In conjunction with some embodiments of the fourth aspect, in some embodiments, the number of first parameters is multiple, and the first symbols indicated by the second parameters corresponding to the first parameters with the same value do not overlap.

[0112] In conjunction with some embodiments of the fourth aspect, in some embodiments, the number of first parameters is less than the number of second parameters, at least one first parameter corresponds one-to-one with at least one first time slot, each first parameter corresponds to n second parameters, at least one first parameter is used to determine the first time slot corresponding to the first parameter, and the n second parameters are used to determine at least one first symbol in the first time slot corresponding to the first parameter, where n is a positive integer greater than 1.

[0113] In conjunction with some embodiments of the fourth aspect, in some embodiments, each second parameter corresponds to a first parameter.

[0114] In conjunction with some embodiments of the fourth aspect, in some embodiments, the first symbols indicated by n second parameters corresponding to the same first parameter do not overlap.

[0115] In conjunction with some embodiments of the fourth aspect, in some embodiments, the number of first parameters is multiple, the values ​​of the multiple first parameters are different, and the number of first time slots is the number of first parameters.

[0116] In conjunction with some embodiments of the fourth aspect, in some embodiments, the number of first parameters is multiple, some of the first parameters have the same value, and the number of first time slots is the number of first parameters with different values.

[0117] In conjunction with some embodiments of the fourth aspect, in some embodiments, the second parameter includes at least one of the following: a third parameter indicating the starting position and number of at least one first symbol in the first time slot; a fourth parameter indicating the starting position of at least one first symbol in the first time slot; a fifth parameter indicating the number of at least one first symbol in the first time slot; and a bitmap indicating the position of the first symbol in the first time slot.

[0118] In conjunction with some embodiments of the fourth aspect, in some embodiments, the PUSCH carries a transport block TB, and the first information further indicates at least one of the following: the number of time slots for determining the transport block size TBS; the number of repetitions of the PUSCH transmission; wherein the product of the number of repetitions and the number of time slots is the number of first time slots, the number of repetitions is a positive integer, and the number of time slots is a positive integer.

[0119] In conjunction with some embodiments of the fourth aspect, in some embodiments, the PUSCH carries a TB, where the number of repetitions is 1 and the number of time slots is the number of the first time slot, or the number of time slots is 1 and the number of repetitions is the number of the first time slot, provided that the first information does not indicate the number of repetitions of the PUSCH transmission and the number of time slots used to determine the TBS.

[0120] In conjunction with some embodiments of the fourth aspect, in some embodiments, the second processing module is further configured to determine the TBS of a TB carried by the PUSCH based on the first information; the first transceiver module is further configured to receive a TB on the PUSCH based on the TBS.

[0121] 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 first symbols in the first first time slot; determine the TBS based on the maximum number of first symbols in all first time slots; determine the TBS based on the minimum number of first symbols in all first time slots; determine the TBS based on the average number of first symbols in all first time slots; determine the TBS based on the sum of the number of first symbols in the first N first time slots in the time sequence; determine the TBS based on the sum of the number of first symbols in the first N first time slots arranged in a first order; determine the TBS based on the sum of the number of first symbols in the last N first time slots arranged in the first order; wherein N is the number of time slots used to determine the TBS, N is a positive integer greater than or equal to 1, and the first order is the descending order of the number of first symbols in each first time slot.

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

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

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

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

[0126] 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 an optional implementation of the first or second aspect.

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

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

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

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

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

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

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

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

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

[0136] 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, A and B (both A and B are executed). The same applies when there are more branches such as A, B, C, etc.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0164] 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:

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

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

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

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

[0169] II. PUSCH mapping type

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

[0171] Table 1

[0172] III. PUSCH repetition type

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

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

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

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

[0177] 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 one in which the 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 one in which the symbols indicated by S and L (or SLIV) include downlink symbols, SSB symbols, or SRS symbols.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0197] V. TBS Calculation

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

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

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

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

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

[0203] 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. i ′ nfo The minimum value is taken as TBS. Table 2 shows N. info ≤3824 TBS.

[0204] Table 2

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

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

[0207] if in,

[0208] otherwise,

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

[0210] otherwise,

[0211] VI. Transmission Occasion (TO)

[0212] The transmission timing of PUSCH is defined as a time 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.

[0213] In some embodiments, to avoid conflicts between PUSCH and SRS, the time domain resources of PUSCH need to avoid the time domain resources of SRS. Taking Time Division Duplex (TDD) as an example, Figure 1I is a schematic diagram of the time domain resources of PUSCH repetition type A and SRS. As shown in Figure 1I, SRS is only allocated on the last two symbols of time slot #3. However, to avoid conflicts between PUSCH and SRS, PUSCH repetition (taking repetition number K=2 as an example) can only be allocated on the first 12 symbols of time slot #3 / 4, resulting in the last two uplink symbols of time slot #4 being wasted.

[0214] In some embodiments, PUSCH cannot be transmitted on the time slot where SSB is located, resulting in the waste of uplink resources in the time slot where SSB is located. Taking non-overlapping subband full duplex (SBFD) as an example, Figure 1J is a schematic diagram of the time domain resources of PUSCH repetition type A and SSB. As shown in Figure 1J, PUSCH is transmitted using PUSCH repetition type A, and the frequency domain resources are allocated on the uplink subband. The time domain resource k2 indicates the first time slot in the figure. The repetition number K = 5, and physical time slot counting is used. SSB is located in time slot #0 and time slot #1. Therefore, the uplink resources in downlink time slot #0 and downlink time slot #1 cannot be used to transmit PUSCH, while other time slots can be used to transmit PUSCH. This results in the waste of uplink resources on the 1st, 2nd, 7th, 8th, 13th and 14th symbols in downlink time slot #0 and downlink time slot #1.

[0215] This disclosure provides a communication method, communication device, communication system, storage medium, and program product. The PUSCH is allocated in at least one first time slot. In each first time slot, the PUSCH includes at least one first symbol. The first symbols in the same first time slot are discontinuous, and / or the first symbols in different first time slots are different. This allows for flexible allocation of the PUSCH's time domain resources, improving the utilization rate of uplink time domain resources and uplink coverage performance.

[0216] In some embodiments, the first symbols within the same first time slot are discontinuous. This can be understood as multiple first symbols belonging to the same first time slot being discontinuous, or multiple first symbols within a first time slot being discontinuous.

[0217] In some embodiments, the first symbols in different first time slots are different, which can be understood as the allocation of the first symbols in different first time slots being different, or the starting position and / or number of the first symbols in different first time slots being different.

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

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

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

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

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

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

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

[0225] In some embodiments, the first information indicates at least one first symbol within each first time slot of the PUSCH. In this case, the first time slot is a time slot of the PUSCH, and the first symbol is a symbol of the PUSCH.

[0226] In some embodiments, the first information indicates at least one first parameter and at least one second parameter. The at least one first parameter is used to determine at least one first time slot of the PUSCH, and the second parameter is used to determine at least one first symbol within each first time slot. That is, the second parameter is used to determine the allocation of the first symbols within each first time slot. The second parameter can be used to determine that the first symbols within the same first time slot are not contiguous, or it can be used to determine that the first symbols in different first time slots are different.

[0227] In some embodiments, the first information indicates a row in a TDRA table, where a row includes at least one first parameter and at least one second parameter. In one example, the first information includes a first index indicating a row in the TDRA table.

[0228] In some embodiments, the TDRA table is predefined, or configured by the network device to the terminal via higher-layer signaling. In one example, the first information includes a first index, and the network device sends second information to the terminal, the second information including the TDRA table. In one example, the first information includes both the TDRA table and the first index.

[0229] In some embodiments, the second parameter may include at least one of the following: a third parameter, a fourth parameter, a fifth parameter, and a bitmap. The third parameter indicates the starting position and number of at least one first symbol within each first time slot; the fourth parameter indicates the starting position of at least one first symbol within each first time slot; the fifth parameter indicates the number of at least one first symbol within each first time slot; and the bitmap indicates the position of at least one first symbol within each first time slot. A third parameter can be replaced by a set of fourth and fifth parameters.

[0230] In some embodiments, the first information may indicate at least one first parameter and at least one third parameter. In some embodiments, the first information may indicate at least one first parameter, at least one fourth parameter, and at least one fifth parameter. In some embodiments, the first parameter may indicate at least one first parameter and at least one bitmap.

[0231] In some embodiments, the first parameter is used to represent k2, the third parameter is represented by SLIV, the fourth parameter is represented by S, and the fifth parameter is represented by L. In one example, the first information indicates at least one k2 and at least one SLIV. In one example, the first information indicates at least one k2, at least one S, and at least one L. In one example, the first information indicates at least one k2 and at least one bitmap.

[0232] In some embodiments, the first information may indicate one of the following:

[0233] Case 1: One k2 and at least one SLIV;

[0234] Case 2: A k2 and at least one bitmap;

[0235] Case 3: one k2, at least one S, and at least one L;

[0236] Case 4: At least one k2 and at least one SLIV, where the number of k2s is equal to the number of SLIVs;

[0237] Case 5: At least one k2 and at least one bitmap, where the number of k2s is equal to the number of bitmaps;

[0238] Case 6: at least one k2, at least one S, and at least one L, where the number of k2 is equal to the number of S, and / or the number of k2 is equal to the number of L;

[0239] Case 7: At least one k2 and at least one SLIV, where the number of k2 is less than the number of SLIV;

[0240] Case 8: at least one k2, at least one S and at least one L, where the number of k2 is less than the number of S, and the number of S is equal to the number of L.

[0241] In some embodiments, since a SLIV can be replaced by a set of S and L, the above case 1 can be replaced by case 3, the above case 4 can be replaced by case 6, and the above case 7 can be replaced by case 8.

[0242] In some embodiments, for case 1, the first information indicates a k2 and at least one SLIV, with each SLIV corresponding one-to-one with at least one first time slot. The number of first time slots is equal to the number of SLIVs. A k2 is used to determine the first first time slot, and each SLIV indicates the starting position and number of first symbols within its corresponding first time slot. In one example, if the first information indicates a k2 and three SLIVs (including SLIV#1, SLIV#2, and SLIV#3), then the number of first time slots is 3. SLIV#1 is used to determine the first symbol within first time slot #1, SLIV#2 is used to determine the first symbol within first time slot #2, SLIV#3 is used to determine the first symbol within first time slot #3, and a k2 is used to determine the position of first time slot #1.

[0243] In some embodiments, when there are multiple SLIVs, if the values ​​of multiple SLIVs are the same, then the first symbols in the multiple first time slots corresponding to the multiple SLIVs are the same; if the values ​​of multiple SLIVs are different, then the first symbols in the multiple first time slots corresponding to the multiple SLIVs are different. In some embodiments, when the number of first symbols indicated by each SLIV is multiple, the first symbols in the first time slot corresponding to each SLIV are consecutive.

[0244] In some implementations, for case 2, the first information indicates a k2 and at least one bitmap, with each bitmap corresponding one-to-one with at least one first time slot. The number of first time slots equals the number of bitmaps. A k2 is used to determine the first first time slot, and each bitmap indicates the first symbol within its corresponding first time slot. Each bitmap includes multiple bits, each corresponding one-to-one with multiple symbols included in a time slot. The number of bits is equal to the number of symbols included in a time slot. Each bit has a first value or a second value. The first value indicates that the symbol corresponding to the bit is a first symbol (or, in other words, the first value indicates that the symbol corresponding to the bit is assigned to PUSCH), and the second value indicates that the symbol corresponding to the bit is a second symbol (or, in other words, the second value indicates that the symbol corresponding to the bit is not assigned to PUSCH). The second symbol includes at least one of the following: a downlink symbol, an SSB symbol, an SRS symbol, or a symbol indicated by higher-layer signaling. Understandably, this method supports discontinuous allocation of first symbols within a first time slot. In some embodiments, if the values ​​of multiple bits in each bitmap are the same, then the first symbols within the first time slot corresponding to each bitmap are the same. If the values ​​of multiple bits in each bitmap are different, then the first symbol in the first time slot corresponding to each bitmap is different. In one example, if the first information indicates a k2 and three bitmaps (including bitmap #1, bitmap #2, and bitmap #3), then the number of first time slots is 3. Bitmap #1 is used to determine the first symbol in first time slot #1, bitmap #2 is used to determine the first symbol in first time slot #2, bitmap #3 is used to determine the first symbol in first time slot #3, and a k2 is used to determine the position of first time slot #1.

[0245] In one example, for each bitmap in at least one bitmap, a time slot includes 14 symbols, and each bitmap includes 14 bits, where the first value is 1 and the second value is 0. Assuming the value of the 14 bits is "00111001111100", then this bitmap indicates that the third to fifth symbols in a first time slot are the first symbols, the eighth to twelfth symbols are the second symbols, and the other symbols are the third symbols.

[0246] In some embodiments, for case 3, the first information indicates a k2, at least one S, and at least one L, where a k2 is used to determine the first first time slot. In this case, the following three scenarios exist:

[0247] Case 3-1: The number of S is greater than the number of L, and multiple S correspond one-to-one with multiple first time slots. The number of first time slots is equal to the number of S.

[0248] Case 3-2: The number of L is greater than the number of S, and multiple L correspond one-to-one with multiple first time slots. The number of first time slots is equal to the number of L.

[0249] In case 3-3, the number of S is equal to the number of L, at least one S corresponds to at least one L, at least one S corresponds to at least one first time slot, at least one L corresponds to at least one first time slot, and the number of first time slots is equal to the number of S and also equal to the number of L.

[0250] In some embodiments, for case 3-1, each S indicates the starting position of the first symbol in its corresponding first time slot. If the number of L is one, then L corresponds to all S, meaning that the number of first symbols in the first time slot corresponding to each S is the same. In one example, if the first information indicates one k2, three S (including S#1, S#2, and S#3), and one L, then the number of first time slots is 3. S#1 is used to determine the starting position of the first symbol in first time slot #1, S#2 is used to determine the starting position of the first symbol in first time slot #2, S#3 is used to determine the starting position of the first symbol in first time slot #3, one k2 is used to determine the position of first time slot #1, and one L is used to determine the number of first symbols in first time slots #1, #2, and #3. If the number of L is multiple and less than the number of S, then each L corresponds to n S, or, in one part of L, each L corresponds to one S, and in another part of L, each L corresponds to n S, where n is a positive integer greater than 1. In other words, when there are multiple L's, the number of first symbols in the first time slot corresponding to n S's of the same L is the same, while the number of first symbols in the first time slot corresponding to S's of different L's is different. In one example, for case 3-1, assuming there are 4 S's and 2 L's, then each L corresponds to two S's. In another example, for case 3-1, assuming there are 4 S's (e.g., S#1, S#2, S#3, S#4) and 3 L's (e.g., L#1, L#2, L#3), then L#1 corresponds to S#1 and S#2, L#2 corresponds to S#3, and L#3 corresponds to S#4.

[0251] In some embodiments, for case 3-2, each L indicates the number of first symbols in its corresponding first time slot. If the number of S is one, then S corresponds to all L, meaning that the starting positions of the first symbols in the first time slot corresponding to each L are the same. In one example, if the first information indicates one k2, three Ls (including L#1, L#2, and L#3), and one S, then the number of first time slots is 3. L#1 is used to determine the number of first symbols in first time slot #1, L#2 is used to determine the number of first symbols in first time slot #2, L#3 is used to determine the number of first symbols in first time slot #3, one k2 is used to determine the position of first time slot #1, and one S is used to determine the starting positions of the first symbols in first time slots #1, #2, and #3. If the number of S is multiple and less than the number of L, then each S corresponds to n Ls, or, in one part of the S, each S corresponds to one L, and in another part of the S, each S corresponds to n Ls. In other words, when there are multiple S's, the starting positions of the first symbols in the first time slot corresponding to the n L's of the same S are the same, while the starting positions of the first symbols in the first time slot corresponding to L's of different S's are different. In one example, for case 3-2, assuming there are 4 L's and 2 S's, then each S corresponds to two L's. In another example, for case 3-2, assuming there are 4 L's (e.g., L#1, L#2, L#3, L#4) and 3 S's (e.g., S#1, S#2, S#3), then S#1 corresponds to L#1 and L#2, S#2 corresponds to L#3, and S#3 corresponds to L#4.

[0252] In some embodiments, when there are multiple S values, if the values ​​of multiple S values ​​are the same, the starting positions of the first symbols in the multiple first time slots corresponding to the multiple S values ​​are the same; if the values ​​of multiple S values ​​are different, the starting positions of the first symbols in the multiple first time slots corresponding to the multiple S values ​​are different. In some embodiments, when there are multiple L values, if the values ​​of multiple L values ​​are the same, the number of first symbols in the multiple first time slots corresponding to the multiple L values ​​is the same; if the values ​​of multiple L values ​​are different, the number of first symbols in the multiple first time slots corresponding to the multiple L values ​​is different.

[0253] In some embodiments, for case 4, the first information indicates at least one k2 and at least one SLIV, the number of k2s and the number of SLIVs are equal, at least one k2 corresponds one-to-one with at least one SLIV, at least one k2 corresponds one-to-one with at least one first time slot, at least one SLIV corresponds one-to-one with at least one first time slot, at least one k2 indicates its corresponding first time slot, and at least one SLIV indicates the starting position and number of first symbols within its corresponding first time slot. In other words, case 4 can be understood as: the first information indicates at least one set of {k2, SLIV}, and at least one set of {k2, SLIV} corresponds one-to-one with at least one first time slot.

[0254] In some embodiments, if there are multiple k2s, then the following two cases exist:

[0255] Case 4-1: Multiple k2 values ​​are different;

[0256] Case 4-2: At least some of the multiple k2 values ​​are the same.

[0257] In some embodiments, for case 4-1, if multiple k2 values ​​are different, the number of first time slots is the number of k2 values. In other words, case 4-1 can be understood as: the first information indicates multiple sets of {k2, SLIV}, and if any two sets of k2 values ​​are different, then the number of first time slots is the number of sets of {k2, SLIV}. In some embodiments, if each SLIV indicates multiple first symbols, then the first symbols in the first time slot corresponding to each SLIV are consecutive. In some embodiments, if multiple SLIV values ​​are the same, then the first symbols in the multiple first time slots are the same. If multiple SLIV values ​​are different, then the first symbols in the multiple first time slots are different. In one example, if the first information indicates three k2s (including k2#1, k2#2, and k2#3) and three SLIVs (including SLIV#1, SLIV#2, and SLIV#3), and the values ​​of the three k2s are all different, then the number of first time slots is 3. k2#1 is used to determine the first time slot #1, k2#2 is used to determine the first time slot #2, and k2#3 is used to determine the first time slot #3; SLIV#1 is used to determine the first symbol in the first time slot #1, SLIV#2 is used to determine the first symbol in the first time slot #2, and SLIV#3 is used to determine the first symbol in the first time slot #3.

[0258] In some embodiments, for case 4-2, if at least some of the k2 values ​​are the same, then the number of first time slots is the number of k2 values ​​that are different. In this case, the first symbols indicated by the SLIVs corresponding to the k2 values ​​that are the same do not overlap. In other words, case 4-2 can be understood as: the first information indicates multiple sets of {k2, SLIV}, and if at least two sets of k2 values ​​are the same, then the first symbols indicated by the SLIVs of at least two sets do not overlap. It can be understood that case 4-2 supports discontinuous allocation of first symbols within a first time slot. In one example, if the first information indicates three k2s (including k2#1, k2#2, and k2#3) and three SLIVs (including SLIV#1, SLIV#2, and SLIV#3), where the values ​​of k2#1 and k2#2 are the same, then the number of first time slots is 2. k2#1 and k2#2 are used to determine the first time slot #1, and k2#3 is used to determine the first time slot #2. SLIV#1 and SLIV#2 are used to determine the first symbol in the first time slot #1, and SLIV#3 is used to determine the first symbol in the first time slot #2.

[0259] In some embodiments, corresponding to case 5, the first information indicates at least one k2 and at least one bitmap, the number of k2s is equal to the number of bitmaps, at least one k2 corresponds one-to-one with at least one bitmap, at least one k2 corresponds one-to-one with at least one first time slot, at least one bitmap corresponds one-to-one with at least one first time slot, at least one k2 indicates its corresponding first time slot, at least one bitmap indicates the first symbol within its corresponding first time slot, and the number of first time slots is equal to the number of k2s and also equal to the number of bitmaps. In other words, case 5 can be understood as: the first information indicates at least one set of {k2, bitmap}, at least one set of {k2, bitmap} corresponds one-to-one with at least one first time slot, and the number of first time slots is equal to the number of sets of {k2, bitmap}. In some embodiments, when there are multiple k2s, the values ​​of the multiple k2s are not the same. In one example, if the first information indicates three k2s (including k2#1, k2#2, and k2#3) and three bitmaps (including bitmap #1, bitmap #2, and bitmap #3), and the values ​​of the three k2s are all different, then the number of the first time slots is 3. k2#1 is used to determine the first time slot #1, k2#2 is used to determine the first time slot #2, and k2#3 is used to determine the first time slot #3; bitmap #1 is used to determine the first symbol in the first time slot #1, bitmap #2 is used to determine the first symbol in the first time slot #2, and bitmap #3 is used to determine the first symbol in the first time slot #3.

[0260] In some embodiments, for case 6, the first information indicates at least one k2, at least one S, and at least one L, and the quantity and correspondence of the three k2, S, and L can be in the following three cases:

[0261] Case 6-1: The number of k2s is equal to the number of Ss, the number of Ss is greater than the number of Ls, multiple k2s correspond one-to-one with multiple Ss, multiple k2s correspond one-to-one with multiple first time slots, and multiple Ss correspond one-to-one with multiple first time slots.

[0262] Case 6-2: The number of k2 is equal to the number of L, the number of L is greater than the number of S, multiple k2 correspond to multiple L, multiple k2 correspond to multiple first time slots, and multiple L correspond to multiple first time slots.

[0263] In case 6-3, the number of k2 is equal to the number of S and also equal to the number of L. At least one k2 corresponds to at least one S, at least one S corresponds to at least one L, at least one k2 corresponds to at least one first time slot, at least one S corresponds to at least one first time slot, and at least one L corresponds to at least one first time slot.

[0264] In some embodiments, for case 6-1, if the number of L is one, then L corresponds to all S, that is, the number of first symbols in the first time slot corresponding to each S is the same. In one example, if the first information indicates three k2s (including k2#1, k2#2, and k2#3), three Ss (including S#1, S#2, and S#3), and one L, and the values ​​of the three k2s are all different, then the number of first time slots is 3. k2#1 is used to determine the first time slot #1, k2#2 is used to determine the first time slot #2, and k2#3 is used to determine the first time slot #3; S#1 is used to determine the starting position of the first symbol in the first time slot #1, S#2 is used to determine the starting position of the first symbol in the first time slot #2, S#3 is used to determine the starting position of the first symbol in the first time slot #3, and one L is used to determine the number of first symbols in the first time slots #1, #2, and #3. If the number of L is multiple and less than the number of S, then each L corresponds to n S, or, in one part of the L, each L corresponds to one S, and in another part of the L, each L corresponds to n S, where n is a positive integer greater than 1. A specific example of case 6-1 can be found in case 3-1, and will not be elaborated upon here.

[0265] In some embodiments, for case 6-2, if the number of S is one, then S corresponds to all L, meaning that the starting positions of the first symbols in the first time slot corresponding to each L are the same. In one example, if the first information indicates three k2s (including k2#1, k2#2, and k2#3), three Ls (including L#1, L#2, and L#3), and one S, and the values ​​of the three k2s are all different, then the number of first time slots is 3. k2#1 is used to determine the first time slot #1, k2#2 is used to determine the first time slot #2, and k2#3 is used to determine the first time slot #3; L#1 is used to determine the number of first symbols in the first time slot #1, L#2 is used to determine the number of first symbols in the first time slot #2, L#3 is used to determine the number of first symbols in the first time slot #3, and one S is used to determine the starting positions of the first symbols in the first time slots #1, #2, and #3. If the number of S is multiple and less than the number of L, then each S corresponds to n L, or, in one part of S, each S corresponds to one L, and in another part of S, each S corresponds to n L. For a specific example of case 6-2, please refer to case 3-2, which will not be elaborated here.

[0266] In some embodiments, for the three cases described above, when there are multiple k2 values, if the values ​​of the multiple k2 values ​​are different, the number of first time slots is the number of k2 values. If at least some of the multiple k2 values ​​are the same, the number of first time slots is the number of k2 values ​​that are different. In this case, the first symbol indicated by the S corresponding to the k2 with the same value and the L corresponding to the S does not overlap, or the first symbol indicated by the L corresponding to the k2 with the same value and the S corresponding to the L does not overlap.

[0267] In some embodiments, case 6-1 can be understood as follows: the first information indicates at least one set of {k2, S} and at least one L, the number of L is less than the number of sets of {k2, S}, and at least one set of {k2, S} corresponds one-to-one with at least one first time slot, wherein each L corresponds to n sets of {k2, S}, or, in a portion of L, each L corresponds to one set of {k2, S}, and in another portion of L, each L corresponds to n sets of {k2, S}. In some embodiments, if the k2 values ​​of any two sets are different, the number of first time slots is the number of sets of {k2, S}. If the k2 values ​​of at least two sets are the same, the number of first time slots is the number of k2 values ​​that are different.

[0268] In some embodiments, case 6-2 can be understood as follows: the first information indicates at least one set of {k2, L} and at least one S, the number of S being less than the number of sets of {k2, L}, and at least one set of {k2, L} corresponds one-to-one with at least one first time slot, wherein each S corresponds to n sets of {k2, L}, or, in a portion of the S, each S corresponds to one set of {k2, L}, and in another portion of the S, each S corresponds to n sets of {k2, L}. In some embodiments, if the k2 values ​​of any two sets are different, then the number of first time slots is the number of sets of {k2, L}. If the k2 values ​​of at least two sets are the same, then the number of first time slots is the number of k2 values ​​that are different.

[0269] In some embodiments, case 6-3 can be understood as: the first information indicates at least one set of {k2, S, L}, and at least one set of {k2, S, L} corresponds one-to-one with at least one first time slot. In some embodiments, if the k2 values ​​of any two sets are different, the number of first time slots is the number of sets of {k2, S, L}. If the k2 values ​​of at least two sets are the same, the number of first time slots is the number of k2 values ​​that are different.

[0270] In some embodiments, for case 7, the first information indicates at least one k2 and at least one SLIV, the number of k2s is less than the number of SLIVs, at least one k2 corresponds one-to-one with at least one first time slot, each k2 corresponds to n SLIVs, at least one k2 is used to determine its corresponding first time slot, and the n SLIVs are used to determine at least one first symbol within the first time slot corresponding to k2. In one example, if the first information indicates two k2s (including k2#1 and k2#2) and four SLIVs (including SLIV#1, SLIV#2, SLIV#3, and SLIV#4), and the values ​​of the two k2s are all different, then the number of first time slots is 2, k2#1 is used to determine first time slot #1, k2#2 is used to determine first time slot #2; SLIV#1 and SLIV#2 are used to determine the first symbol within first time slot #1, and SLIV#3 and SLIV#4 are used to determine the first symbol within first time slot #2.

[0271] In some embodiments, each SLIV corresponds to a k2, and the first symbols indicated by n SLIVs corresponding to the same k2 do not overlap. When there are multiple k2s, the values ​​of the multiple k2s are different, and the number of first time slots is equal to the number of k2s.

[0272] In some embodiments, case 7 can be understood as follows: the first information indicates at least one set of {k2, {at least one SLIV}}, and the at least one set of {k2, {at least one SLIV}} corresponds one-to-one with at least one first time slot, the number of first time slots being the number of sets of {k2, {at least one SLIV}}. When each set includes multiple SLIVs, the first symbols indicated by the multiple SLIVs in each set do not overlap. When the first information indicates multiple sets of {k2, {multiple SLIVs}}, the values ​​of k2 in any two sets are different.

[0273] In one example, if the first information indicates {k2#1, {SLIV#1, SLIV#2}} and {k2#2, {SLIV#3, SLIV#4}}, then the number of first time slots is 2. The values ​​of k2#1 and k2#2 are different. The first symbols indicated by SLIV#1 and SLIV#2 do not overlap, and the first symbols indicated by SLIV#3 and SLIV#4 do not overlap. In one example, the values ​​of SLIV#1 and SLIV#3 can be the same, and the values ​​of SLIV#2 and SLIV#4 can be the same. In another example, the values ​​of SLIV#1, SLIV#2, SLIV#3, and SLIV#4 can be different from each other.

[0274] In some embodiments, for case 8, the first information includes at least one k2, at least one S, and at least one L. The number of k2s is less than the number of Ss, the number of Ss is equal to the number of Ls, at least one k2 corresponds one-to-one with at least one first time slot, each k2 corresponds to n Ss, each k2 corresponds to n Ls, at least one k2 is used to determine its corresponding first time slot, the n Ss are used to determine the starting position of the first symbol in the first time slot corresponding to k2, and the n Ls are used to determine the number of the first symbols in the first time slot corresponding to k2. In one example, if the first information indicates two k2s (including k2#1 and k2#2), four Ss (including S#1, S#2, S#3 and S#4), and four Ls (including L#1, L#2, L#3 and L#4), and the values ​​of the two k2s are all different, then the number of the first time slots is 2. k2#1 is used to determine the first time slot #1, and k2#2 is used to determine the first time slot #2. S#1 and L#1 are used to determine the first symbol in the first time slot #1, S#2 and L#2 are used to determine the first symbol in the first time slot #1, S#3 and L#3 are used to determine the first symbol in the first time slot #2, and S#4 and L#4 are used to determine the first symbol in the first time slot #2.

[0275] In some embodiments, each S corresponds to one k2, each L corresponds to one k2, and the first symbols indicated by n S and n L corresponding to the same k2 do not overlap. When there are multiple k2s, the values ​​of the multiple k2s are different, and the number of first time slots is equal to the number of k2s.

[0276] In some embodiments, Case 8 can be understood as follows: the first information indicates at least one set of {k2, {at least one set of {S, L}}}, and the at least one set of {k2, {at least one set of {S, L}}} corresponds one-to-one with at least one first time slot, the number of first time slots being the number of sets of {k2, {at least one set of {S, L}}}. When each set includes multiple sets of {S, L}, the first symbols indicated by the multiple sets of {S, L} in each set do not overlap. When the first information indicates multiple sets of {k2, {at least one set of {S, L}}}, the values ​​of k2 in any two sets are different.

[0277] In one example, if the first information indicates {k2#1, {{S#1, L#1}, {S#2, L#2}}} and {k2#2, {{S#3, L#3}, {S#4, L#4}}}, then the number of first time slots is 2. The values ​​of k2#1 and k2#2 are different. The first symbols indicated by {S#1, L#1} and {S#2, L#2} do not overlap, and the first symbols indicated by {S#3, L#3} and {S#4, L#4} do not overlap. In one example, the values ​​of {S#1, L#1} and {S#3, L#3} can be the same, and the values ​​of {S#2, L#2} and {S#4, L#4} can be the same. In one example, the values ​​of {S#1, L#1}, {S#2, L#2}, {S#3, L#3}, and {S#4, L#4} can be different from each other.

[0278] In some embodiments, for cases 1 to 8 above, cases 1 to 8 above can be used in combination with each other if there is no conflict in the embodiments.

[0279] In some embodiments, the first information may also indicate at least one of the following: the number of time slots used to determine the transport block size (TBS); the number of repetitions of the PUSCH.

[0280] In some embodiments, the number of TBS slots is represented by parameter N, and the number of repetitions is represented by parameter K, then K × N = N PUSCH , where N PUSCH This represents the number of the first time slots, where K is a positive integer and N is a positive integer.

[0281] In some embodiments, if the first information does not indicate K and N, K = 1, N = N. PUSCH Or, N=1, K=N PUSCH .

[0282] In step S2102, the terminal determines at least one first time slot of PUSCH and at least one first symbol within each first time slot based on the first information.

[0283] In some embodiments, the terminal determines at least one first time slot and at least one first symbol within each first time slot based on at least one first parameter and at least one third parameter.

[0284] In some embodiments, the terminal determines at least one first time slot and at least one first symbol within each first time slot based on at least one first parameter, at least one fourth parameter, and at least one fifth parameter.

[0285] In some embodiments, the terminal determines at least one first time slot and at least one first symbol within each first time slot based on at least one first parameter and at least one bitmap.

[0286] In some embodiments, for case 1, Table 3 is an example of the TDRA table in case 1, where the terminal determines N based on the number of SLIVs. PUSCH The value. As shown in Table 3, if the first information indicates the first row of the TDRA table, that is, indicating a k2 (candidate value #1) and a SLIV#1, then the number of first time slots N PUSCH =1. If the first information indicates the fourth row of the TDRA table, that is, indicating one k2 (candidate value #4) and four SLIVs (including SLIV#1, SLIV#2, SLIV#3, and SLIV#4), then the number of first time slots N PUSCH =4.

[0287] Table 3

[0288] In some embodiments, the terminal is based on k2 and N PUSCH Determine the first time slot and the first symbol based on SLIV.

[0289] In some embodiments, the terminal is based on k2 and N PUSCH Determining the first time slot involves two methods: First, starting from the time slot indicated by k2, consecutive N... PUSCH The first time slot is determined by the first time slot. The second method involves starting from the time slot indicated by k2 and assigning N... PUSCH A time slot that satisfies the first condition is determined as the first time slot, wherein at least one first symbol in the first time slot does not overlap with a second symbol, and the second symbol is not used for PUSCH.

[0290] In some embodiments, the second symbol may be a predefined symbol or a symbol configured by the network device.

[0291] In some embodiments, the second 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).

[0292] In some embodiments, the second symbol includes at least one of the following: a synchronization signal block symbol, a downlink symbol, a probe reference signal symbol, and a symbol indicating a higher-layer signaling.

[0293] In some embodiments, the first method may be simply referred to as "physical time slot counting" and the second method may be simply referred to as "available time slot counting".

[0294] In some embodiments, the available time slot count can also be understood as: starting from the time slot indicated by k2, the time slot that does not meet the first condition is not determined as the first time slot.

[0295] In one example, for physical time slot counting, if N PUSCH =4, as shown in Figure 2B. Figure 2B is a schematic diagram of determining the time domain resources of PUSCH based on Case 1 and physical time slot count. Starting from the time slot indicated by k2 (candidate value #4) (uplink time slot #3), four consecutive time slots are determined as the first time slot. That is, the first time slot includes uplink time slot #3, uplink time slot #4, downlink time slot #5 and downlink time slot #6. The first symbol in the first first time slot (i.e., uplink time slot #3) is determined according to the candidate value #4 of SLIV#1. The first symbol in the second first time slot (i.e., uplink time slot #4) is determined according to the candidate value #3 of SLIV#2. The first symbol in the third first time slot (i.e., downlink time slot #5) is determined according to the candidate value #2 of SLIV#1. The first symbol in the fourth first time slot (i.e., downlink time slot #6) is determined according to the candidate value #1 of SLIV#4. Therefore, it can be seen that the first symbol in uplink time slot #3, the first symbol in uplink time slot #4, the first symbol in downlink time slot #5, and the first symbol in downlink time slot #6 are different, that is, the first symbol in different first time slots is different.

[0296] In one example, since downlink slots #5 and #6 include the second symbol, the terminal will not send PUSCH on downlink slots #5 and #6, that is, the PUSCH on downlink slots #5 and #6 is dropped.

[0297] In one example, for the available time slot count, if N PUSCH=4, as shown in Figure 2C. Figure 2C is a schematic diagram of determining the time domain resources of PUSCH based on Case 1 and the available time slot count. Starting from the time slot indicated by k2 (candidate value #4) (uplink time slot #3), the four time slots that meet the first condition are determined as the first time slot. Since downlink time slot #5, downlink time slot 6 and special time slot #7 all include the second symbol, the terminal does not determine downlink time slot #5, downlink time slot 6 and special time slot #7 as the first time slot, but instead determines uplink time slot #3, uplink time slot #4, uplink time slot #8 and uplink time slot #9 as the first time slot. In one example, the first symbol in the first first time slot (i.e., uplink time slot #3) is determined based on candidate value #4 of SLIV #1; the first symbol in the second first time slot (i.e., uplink time slot #4) is determined based on candidate value #3 of SLIV #2; the first symbol in the third first time slot (i.e., uplink time slot #8) is determined based on candidate value #2 of SLIV #1; and the first symbol in the fourth first time slot (i.e., uplink time slot #9) is determined based on candidate value #1 of SLIV #4. Therefore, the first symbol in uplink time slot #3, uplink time slot #4, uplink time slot #8, and uplink time slot #9 are different; that is, the first symbol is different in different first time slots.

[0298] In some embodiments, for case 2, Table 4 is an example of the TDRA table in case 2, where the terminal determines N based on the number of bitmaps. PUSCH The value of . As shown in Table 4, if the first information indicates the first row of the TDRA table, that is, indicating a k2 (candidate value #1) and a bitmap #1, then the number of the first time slots N PUSCH =1. If the first information indicates the fourth row of the TDRA table, that is, indicating a k2 (candidate value #4) and four bitmaps (including bitmap #1, bitmap #2, bitmap #3, and bitmap #4), then the number of the first time slots N PUSCH =4.

[0299] In some embodiments, the terminal is based on k2 and N PUSCH The first time slot is determined, and the first symbol is determined based on the bitmap.

[0300] In one example, the terminal is based on k2 (candidate value #4) and N. PUSCH=4. The method for determining the first time slot can refer to the embodiment of Case 1, and will not be repeated here. In one example, as shown in Table 4, for the first first time slot, the terminal determines the first symbol based on bitmap #1, that is, in the first first time slot, the first symbol is the eighth to thirteenth symbols. For the second first time slot, the terminal determines the first symbol based on bitmap #2, that is, in the second first time slot, the first symbol is the first to second symbols, and the sixth to eleventh symbols. For the third first time slot, the terminal determines the first symbol based on bitmap #3, that is, in the third first time slot, the first symbol is the first to fourth symbols, and the tenth to thirteenth symbols. For the fourth first time slot, the terminal determines the first symbol based on bitmap #4, that is, in the fourth first time slot, the first symbol is the second to fifth symbols, and the eighth to thirteenth symbols. It can be seen that the bitmap supports the allocation of discontinuous first symbols.

[0301] Table 4

[0302] In some embodiments, for case 3-1, Table 5 is an example of the TDRA table in case 3-12, where the terminal determines N based on the number of S. PUSCH The value of . As shown in Table 5, if the first information indicates the fourth row of the TDRA table, that is, indicating one k2 (candidate value #4), one L (candidate value #4), and four S (S#1, S#2, S#3, S#4), then the number of the first time slot N PUSCH =4.

[0303] Table 5

[0304] In some embodiments, the terminal is based on k2 and N PUSCH Determine the first time slot, and determine the first symbol based on S and L.

[0305] In one example, the terminal is based on k2 (candidate value #4) and N. PUSCH=4 The method for determining the first time slot can refer to the embodiment of Case 1, and will not be repeated here. In one example, as shown in Table 5, for the first first time slot, the terminal determines the first symbol based on S#1 and L (candidate value #4); for the second first time slot, the terminal determines the first symbol based on S#2 and L (candidate value #4); for the third first time slot, the terminal determines the first symbol based on S#3 and L (candidate value #4); and for the fourth first time slot, the terminal determines the first symbol based on S#4 and L (candidate value #4). Figure 2D is a schematic diagram of determining the time domain resources of PUSCH based on Case 3-1 and physical time slot count. Figure 2E is a schematic diagram of determining the time domain resources of PUSCH based on Case 3-1 and available time slot count. As shown in Figures 2D and 2E, the number of first symbols in each first time slot is the same, but the starting position of the first symbol in each first time slot is different.

[0306] In some embodiments, for case 3-2, Table 6 is an example of the TDRA table in case 3-2, where the terminal determines N based on the number of L. PUSCH The value of N. As shown in Table 6, if the first information indicates the third row of the TDRA table, that is, indicating one k2 (candidate value #4), one S (candidate value #4), and four L (L#1, L#2, L#3, L#4), then the number of the first time slots N. PUSCH =4.

[0307] Table 6

[0308] In some embodiments, the terminal is based on k2 and N PUSCH Determine the first time slot, and determine the first symbol based on S and L.

[0309] In one example, the terminal is based on k2 (candidate value #4) and N. PUSCH =4 The method for determining the first time slot can refer to the embodiment of Case 1, and will not be repeated here. In one example, as shown in Table 6, for the first first time slot, the terminal determines the first symbol based on S (candidate value #4) and L#1; for the second first time slot, the terminal determines the first symbol based on S (candidate value #4) and L#2; for the third first time slot, the terminal determines the first symbol based on S (candidate value #4) and L#3; and for the fourth first time slot, the terminal determines the first symbol based on S (candidate value #4) and L#4. Figure 2F is a schematic diagram of determining the time domain resources of PUSCH based on Case 3 and physical time slot count. Figure 2G is a schematic diagram of determining the time domain resources of PUSCH based on Case 3 and available time slot count. As shown in Figures 2F and 2G, the starting position of the first symbol in each first time slot is the same, but the number of first symbols in each first time slot is different.

[0310] In some embodiments, for case 3-3, Table 7 is an example of the TDRA table in case 3-3, where the terminal determines N based on the number of L or the number of S. PUSCH The value of . As shown in Table 7, if the first information indicates the first row of the TDRA table, that is, indicating a k2 (candidate value #1), an S#1 and an L#1, then the number of the first time slots N PUSCH =1. If the first information indicates the fourth row of the TDRA table, that is, indicating one k2 (candidate value #4), four S (S#1, S#2, S#3, S#4) and four L (L#1, L#2, L#3, L#4), then the number of the first time slots N PUSCH =4.

[0311] Table 7

[0312] In some embodiments, the terminal is based on k2 and N PUSCH Determine the first time slot, and determine the first symbol based on S and L.

[0313] In one example, the terminal is based on k2 (candidate value #4) and N. PUSCH =4 The method for determining the first time slot can refer to the embodiment of Case 1, and will not be repeated here. In one example, as shown in Table 7, for the first first time slot, the terminal determines the first symbol based on S#1 and L#1; for the second first time slot, the terminal determines the first symbol based on S#2 and L#2; for the third first time slot, the terminal determines the first symbol based on S#3 and L#3; and for the fourth first time slot, the terminal determines the first symbol based on S#4 and L#4. It can be seen that the starting position of the first symbol in each first time slot is different, and the number of first symbols in each first time slot is also different.

[0314] In some embodiments, for case 4, Table 8 is an example of the TDRA table in case 4, where the terminal determines N based on the number of distinct k2 values. PUSCH The value of . As shown in Table 8, if the first information indicates the first row in the TDRA table, that is, indicating one k2 and one SLIV, then the number N of the first time slot. PUSCH =1. If the first information indicates the fourth row of the TDRA table, that is, indicating four k2s and four SLIVs, and if the values ​​of the four k2s are not the same, then the number of the first time slots is N. PUSCH =4. If the values ​​of k2#3 and k2#4 among the four k2 values ​​are the same, then the number of the first time slots is N. PUSCH =3, in this case, SLIV#3 and SLIV#4 are used to determine the first symbol within the same first time slot, and the first symbols determined by SLIV#3 and SLIV#4 do not overlap.

[0315] Table 8

[0316] In some embodiments, the terminal determines the first time slot based on the value of k2 and the first symbol based on the value of SLIV.

[0317] In one example, the terminal determines the location of the first time slot based on the indications of k2#1, k2#2, k2#3, and k2#4.

[0318] In one example, Figure 2H is a schematic diagram of determining the time-domain resources of PUSCH based on case 4-1. As shown in Figure 2H, the first first time slot indicated by k2#1 is uplink time slot #3, the second first time slot indicated by k2#2 is uplink time slot #4, the third first time slot indicated by k2#3 is uplink time slot #8, and the fourth first time slot indicated by k2#4 is uplink time slot #9. For each first time slot, the terminal determines the first symbol based on the SLIV corresponding to each first time slot. Figure 2I is a schematic diagram of determining the time-domain resources of PUSCH based on case 4-2. As shown in Figure 2I, the first first time slot indicated by k2#1 is uplink time slot #3, the second first time slot indicated by k2#2 is uplink time slot #4, and the values ​​of k2#3 and k2#4 are the same, both indicating that the third first time slot is uplink time slot #8. For uplink time slot #3, the terminal determines the first symbol based on SLIV #1; for uplink time slot #4, the terminal determines the first symbol based on SLIV #2; and for uplink time slot #8, the terminal determines the first symbol based on both SLIV #3 and SLIV #4. As shown in Figure 2I, the first symbol in uplink time slot #8 consists of the first 6 symbols and the last 6 symbols. These 12 first symbols are discontinuous within uplink time slot #8, meaning that the first symbols within the same first time slot are not consecutive.

[0319] In some embodiments, for case 5, Table 9 is an example of the TDRA table in case 5, where the values ​​of k2#1, k2#2, k2#3, and k2#4 are all different. The terminal determines N based on the number of k2 or the number of bitmaps. PUSCH The value of . As shown in Table 8, if the first information indicates the first row in the TDRA table, that is, indicating a k2 and a bitmap, then the number of the first time slot N PUSCH =1. If the first information indicates the fourth row of the TDRA table, that is, indicating four k2s and four bitmaps, then the number of the first time slots N PUSCH =4.

[0320] In some embodiments, the terminal determines the first time slot based on the value of k2 and the first symbol based on the bitmap.

[0321] In one example, the terminal determines the location of the first time slot based on the indications of k2#1, k2#2, k2#3, and k2#4, and determines the first symbol within its respective first time slot based on bitmap #1, bitmap #2, bitmap #3, and bitmap #4. The method for determining the first symbol based on the bitmap can be found in the embodiment of Case 2, and will not be elaborated upon here.

[0322] Table 9

[0323] In some embodiments, for case 6-1, Table 10 is an example of the TDRA table in case 6-1, where the terminal determines N based on the number of distinct k2 values. PUSCH The value. As shown in Table 10, if the first information indicates the third row of the TDRA table, that is, indicating four k2, four S and one L, and if the values ​​of the four k2 are not the same, then the number of the first time slot N. PUSCH =4. If the values ​​of k2#3 and k2#4 among the four k2 values ​​are the same, then the number of the first time slots is N. PUSCH =3. In this case, S#3 and L (candidate value #4) and S#4 and L (candidate value #4) are used to determine the first symbol in the same time slot. The first symbols determined by S#3 and L (candidate value #4) and by S#4 and L (candidate value #4) do not overlap. In one example, assuming S#3 indicates the first symbol, S#4 indicates the ninth symbol, and the value of L is 6, then the first symbols determined by S#3 and L are the first to sixth symbols, and the first symbols determined by S#4 and L are the ninth to fourteenth symbols.

[0324] In some embodiments, the terminal determines the first time slot based on the value of k2 and the first symbol based on S and L. In one example, the terminal determines the position of the first time slot based on the indications of k2#1, k2#2, k2#3, and k2#4, and determines the position of the first symbol within the corresponding time slot based on S#1 and L, S#2 and L, S#3 and L, and S#4 and L. The specific determination method can be referred to the embodiment of case 3-1, which will not be repeated here.

[0325] Table 10

[0326] In some embodiments, for case 6-2, Table 11 is an example of the TDRA table in case 6-2, where the values ​​of k2#1, k2#2, k2#3, and k2#4 are all different, and the terminal determines N based on the number of k2. PUSCH The value of N. As shown in Table 11, if the first information indicates the third row of the TDRA table, that is, indicating four k2s, four Ls and one S, then the number of the first time slots N. PUSCH =4.

[0327] In some embodiments, the terminal determines the first time slot based on the value of k2 and the first symbol based on S and L. The specific determination method can be referred to the embodiment of case 3-2, which will not be repeated here.

[0328] Table 11

[0329] In some embodiments, for case 6-3, Table 12 is an example of the TDRA table in case 6-3, where the terminal determines N based on the number of distinct k2 values. PUSCH The value. As shown in Table 12, if the first information indicates the fourth row of the TDRA table, that is, indicating four k2, four S, and four L, and if the values ​​of the four k2 are not the same, then the number of the first time slot N. PUSCH =4. If the values ​​of k2#3 and k2#4 among the four k2 values ​​are the same, then the number of the first time slots is N. PUSCH =3, in this case, S#3 and L#3 and S#4 and L#4 are used to determine the first symbol in the same time slot, and the first symbols determined by S#3 and L#3 and by S#4 and L#4 do not overlap.

[0330] In some embodiments, the terminal determines the first time slot based on the value of k2 and the first symbol based on S and L. The specific determination method can be referred to the embodiment of case 3-3, which will not be repeated here.

[0331] Table 12

[0332] In some embodiments, for case 7, Table 13 is an example of the TDRA table in case 7, where the values ​​of k2#1 and k2#2 are different, and the terminal determines N based on the number of k2. PUSCH The value of N. As shown in Table 13, if the first information indicates the first row of the TDRA table, i.e., one k2 and two SLIVs, then the number of the first time slots N. PUSCH =1. If the first information indicates the second row of the TDRA table, that is, indicating two k2s and four SLIVs, then the number of the first time slots N PUSCH =2.

[0333] Table 13

[0334] In some embodiments, the terminal determines the first time slot based on the value of k2, and determines the first symbol based on the values ​​of multiple SLIVs corresponding to k2.

[0335] In one example, Figure 2J is a schematic diagram of determining the time-domain resources of PUSCH based on Case 7. As shown in Figure 2J, the first first time slot indicated by k2#1 is uplink time slot #8, and the second first time slot indicated by k2#2 is uplink time slot #9. For uplink time slot #8, the terminal determines the first symbol as the first to sixth symbols and the ninth to fourteenth symbols based on SLIV#1 and SLIV#2 corresponding to k2#1. For uplink time slot #9, the terminal determines the first symbol as the first to fourth symbols and the seventh to fourteenth symbols based on SLIV#3 and SLIV#4 corresponding to k2#2. As shown in Figure 2J, the first symbol in uplink time slot #8 consists of the first 6 symbols and the last 6 symbols. These 12 first symbols are discontinuous in uplink time slot #8. The first symbol in uplink time slot #9 consists of the first 4 symbols and the last 8 symbols. These 12 first symbols are discontinuous in uplink time slot #9. That is, the first symbol is discontinuous within the same first time slot.

[0336] In some embodiments, for case 8, Table 14 is an example of the TDRA table in case 8, where the values ​​of k2#1 and k2#2 are different, and the terminal determines N based on the number of k2. PUSCH The value of N. As shown in Table 13, if the first information indicates the first row of the TDRA table, i.e., one k2, two S and two L, then the number of the first time slot N. PUSCH =1. If the first information indicates the second row of the TDRA table, that is, indicating two k2s, four Ss, and four Ls, then the number of the first time slots N PUSCH =2.

[0337] Table 14

[0338] In some embodiments, the terminal determines the first time slot based on the value of k2, and determines the first symbol based on the values ​​of multiple S corresponding to k2 and multiple L corresponding to k2. For a specific determination method, please refer to the embodiment of case 7, which will not be elaborated here.

[0339] In some embodiments, where the first information also indicates the number of times PUSCH is repeated K, the terminal can base its actions on... Determine N. The first information also indicates the number of time slots N used to determine the TBS, which the terminal can base on. Determine K.

[0340] In one example, taking case 7 as an example, Table 15 is an example of a TDRA table including K, and Figure 2K is a schematic diagram of determining the time-domain resources of PUSCH based on case 7, K, and N. As shown in Table 15 and Figure 2K, if the first information indicates the second row of the TDRA table, where K#2 = 2, then N = 2, that is, the PUSCH transmission is repeated twice, and each time the PUSCH is repeatedly allocated on two time slots. Specifically, the first repetition of the PUSCH is allocated on uplink time slot #3 and uplink time slot #4, and the second repetition of the PUSCH is allocated on uplink time slot #8 and uplink time slot #9. The first to sixth symbols and the ninth to fourteenth symbols of uplink time slot #3 and uplink time slot #8 are allocated to the PUSCH, and the first to fifth symbols and the eighth to fourteenth symbols of uplink time slot #4 and uplink time slot #9 are allocated to the PUSCH.

[0341] Table 15

[0342] In some embodiments, for cases 1 to 8 and tables 3 to 15, cases 1 to 8 and tables 3 to 15 can be used in combination without conflict with the embodiments.

[0343] In step S2103, the network device determines at least one first time slot of PUSCH and at least one first symbol within each first time slot based on the first information.

[0344] In some embodiments, the network device and the terminal determine at least one first timeslot and at least one first symbol 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.

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

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

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

[0348] In some embodiments, the terminal determines the TBS of the TB carried by the PUSCH based on at least one first time slot of the PUSCH and at least one first symbol within each first time slot.

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

[0350] Method 1: Determine the TBS based on the number of symbols in the first time slot.

[0351] Method 2: Determine the TBS based on the maximum number of first symbols in all first time slots;

[0352] Method 3: Determine the TBS based on the minimum number of first symbols in all first time slots;

[0353] Method 4: Determine the TBS based on the average number of first symbols in all first time slots;

[0354] Method 5: Determine the TBS based on the sum of the number of first symbols in the first N first time slots in the time sequence;

[0355] Method 6: Determine the TBS based on the sum of the number of first symbols in the first N first time slots arranged in the first order;

[0356] Method 7: Determine the TBS based on the sum of the number of first symbols in the last N first time slots arranged in the first order.

[0357] In some embodiments, N is the number of time slots used to determine the TBS, where N is a positive integer greater than or equal to 1, and the first order is the descending order of the number of first symbols in each first time slot.

[0358] In some embodiments, for methods 1 to 7, the first time slot may be a first time slot determined based on the physical time slot count or a first time slot determined based on the available time slot count.

[0359] In some embodiments, for method 1, the terminal determines the number of symbols allocated to the PUSCH based on the number L1 of the first symbols within the first first time slot. 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.

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

[0361] In one example, as shown in Figures 2B and 2C, N PUSCH =4; Assuming N=1, then K=4, L1=12.

[0362] In one example, as shown in Figures 2D and 2E, N PUSCH =4; Assuming N=1, then K=4, L1=10.

[0363] In one example, as shown in Figure 2I, N PUSCH =3; Assuming N=1, then K=3, L1=12.

[0364] In one example, as shown in Figure 2J, where N PUSCH =2; Assuming N=1, then K=2, L1=12.

[0365] In some embodiments, for method 2, the terminal calculates based on the maximum value L of the number of first symbols in all first time slots. 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.

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

[0367] In one example, Where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH , max represents the minimum value operation.

[0368] In one example, as shown in Figures 2B and 2C, where N PUSCH =4; assuming N=1, then K=4, L max =14.

[0369] In one example, as shown in Figures 2D and 2E, N PUSCH =4; assuming N=1, then K=4, L max =10.

[0370] In one example, as shown in Figure 2J, where N PUSCH =2; assuming N=1, then K=2, L max =12.

[0371] In some embodiments, for method 3, the terminal calculates the minimum value L of the number of first symbols in all first time slots. 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.

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

[0373] In one example, Where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH min represents the minimum value operation.

[0374] In one example, as shown in Figures 2B and 2C, where N PUSCH =4; assuming N=1, then K=4, L min =8.

[0375] In one example, as shown in Figures 2D and 2E, N PUSCH =4; assuming N=1, then K=4, L min =10.

[0376] In one example, as shown in Figure 2J, where N PUSCH =2; assuming N=1, then K=2, L min =12.

[0377] In some embodiments, for method 4, if N=1, the average number of first symbols in all first time slots is used. 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.

[0378] In one example, In one example, In one example, N RE =min(156,N′) RE )·n PRB .

[0379] In one example, Where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0380] In one example, as shown in Figures 2B and 2C, where N PUSCH =4; assuming N=1, then K=4,

[0381] In one example, as shown in Figures 2D and 2E, where N PUSCH =4; assuming N=1, then K=4,

[0382] In one example, as shown in Figure 2J, where N PUSCH =2; assuming N=1, then K=2,

[0383] In some embodiments, for method 4, if N>1, the average number of symbols allocated to PUSCH per N time slots is used. 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.

[0384] In one example, Where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0385] In one example, In one example, In one example, N RE =min(N×N′,N′) RE )·n PRB , or

[0386] In one example, as shown in Figure 2K, where N PUSCH =4, N=2, K=2, then

[0387] In some embodiments, for method 5, the sum L of the number of first symbols in the first N first time slots in the time sequence is used. N 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.

[0388] In one example, In one example, In one example, N RE =min(N×N′,N′) RE )·n PRB In one example, or

[0389] In one example, L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH In one example, In one example, In one example,

[0390] In one example, as shown in Figure 2K, where N PUSCH =4, N=2, K=2, then L1=12, L2=12, L N =24.

[0391] In some embodiments, for method 6, the sum L of the number of first symbols in the first N first time slots arranged according to the first order N,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.

[0392] In one example, In one example, In one example, N RE =min(N×N′,N′) RE )·n PRB In one example, or

[0393] In one example, L N,max For set {L n |n=1,2,...,N PUSCH The sum of the largest N values ​​in}, L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0394] In one example, For set {L n |n=1,2,...,N PUSCH The largest N values ​​in}, where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH In one example, In one example,

[0395] In one example, as shown in Figure 2K, where N PUSCH =4, N=2, K=2, then L N,max =24.

[0396] In some embodiments, for method 7, the sum L of the number of first symbols in the last N first time slots arranged according to the first order N,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.

[0397] In one example, In one example, In one example, N RE =min(N×N′,N′) RE )·n PRB In one example, or

[0398] In one example, L N,min For set {L n |n=1,2,...,N PUSCH The sum of the smallest N values ​​in}, L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0399] In one example, For set {L n |n=1,2,...,N PUSCH The smallest N values ​​in}, where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH In one example, In one example,

[0400] In one example, as shown in Figure 2K, where N PUSCH =4, N=2, K=2, then

[0401] L N,min =24.

[0402] In some embodiments, for methods 1 to 7, other implementation details for determining TBS can be found in the aforementioned "V. TBS Calculation".

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

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

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

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

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

[0408] In some embodiments, if the terminal determines at least one first time slot of PUSCH and at least one first symbol within the first time slot based on physical time slot counts, and if the first time slot includes a second symbol, i.e. a symbol not used for PUSCH, then the terminal does not transmit the TB carried by PUSCH in that first time slot.

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

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

[0411] In some embodiments, taking Case 1 as an example, it is assumed that the terminal transmits PUSCH and SRS of repetition type A in the first time slot. Figure 2L is a schematic diagram of the time domain resources of PUSCH repetition type A and SRS determined based on Case 1. As shown in Figure 2L, the terminal transmits TB on the first to twelfth symbols of uplink time slot #3 and the first to fourteenth symbols of uplink time slot #4. The network device receives TB on the first to twelfth symbols of uplink time slot #3 and the first to fourteenth symbols of uplink time slot #4.

[0412] In some embodiments, compared with Figure 1I, the configuration method of PUSCH time domain resources in Case 1 of Figure 2L can also determine the last two uplink symbols of uplink time slot #4 as PUSCH symbols, thereby making full use of uplink time domain resources and improving uplink coverage performance.

[0413] In some embodiments, taking a combination of scenarios 4 and 7 as an example, it is assumed that the terminal transmits PUSCH and SSB of repetition type A in the first time slot. Figure 2M is a schematic diagram of the time-domain resources of PUSCH repetition type A and SSB determined based on scenarios 4 and 7. As shown in Figure 2M, the terminal transmits TB on the first to second symbols, the seventh to eighth symbols, and the thirteenth to fourteenth symbols of downlink time slots #0 and #1, and on the first to fourteenth symbols of downlink time slots #2, # (special time slot), and #4 (uplink time slot). The network device receives TB on the first to second symbols, the seventh to eighth symbols, and the thirteenth to fourteenth symbols of downlink time slots #0 and #1, and on the first to fourteenth symbols of downlink time slots #2, # (special time slot), and #4 (uplink time slot).

[0414] In some embodiments, compared with Figure 1J, the configuration method of PUSCH time domain resources in cases 4 and 7 in Figure 2M can also determine the 1st, 2nd, 7th, 8th, 13th and 14th symbols in downlink time slot #0 and downlink time slot #1 as PUSCH symbols, thereby making full use of uplink time domain resources and improving uplink coverage performance.

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

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

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

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

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

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

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

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

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

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

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

[0426] In step S3102, the terminal determines at least one first time slot of PUSCH and at least one first symbol within each first time slot based on the first information.

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

[0428] In step S3103, the network determines at least one first time slot of PUSCH and at least one first symbol within each first time slot based on the first information.

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

[0430] In some embodiments, the first symbols within the same first time slot are discontinuous, and / or the first symbols within different first time slots are different.

[0431] In some embodiments, the first information indicates at least one first parameter and at least one second parameter, wherein the at least one first parameter is used to determine a first time slot and the at least one second parameter is used to indicate a first symbol within the first time slot.

[0432] In some embodiments, the first information indicates a first parameter and at least one second parameter, the at least one second parameter corresponding one-to-one with at least one first time slot, the first parameter being used to determine the first first time slot, and the at least one second parameter being used to determine at least one first symbol within the first time slot corresponding to the second parameter.

[0433] In some embodiments, the number of first time slots is the number of second parameters.

[0434] In some embodiments, starting from the time slot indicated by the first parameter, N consecutive N PUSCH The first time slot is determined to be N; among them, N PUSCH This represents the number of the first time slots.

[0435] In some embodiments, starting from the time slot indicated by the first parameter, N PUSCH A time slot that satisfies the first condition is determined as the first time slot; where, N PUSCH The first time slot is the number of first time slots. The first condition is that at least one first symbol in the first time slot does not overlap with a second symbol. The second symbol includes at least one of the following: a synchronization signal block symbol, a downlink symbol, a probe reference signal symbol, and a symbol indicated by higher-layer signaling.

[0436] In some embodiments, the number of first parameters and the number of second parameters are equal, at least one first parameter corresponds to at least one first time slot, at least one second parameter corresponds to at least one first time slot, at least one first parameter corresponds to at least one second parameter, at least one first parameter is used to determine the first time slot corresponding to the first parameter, and at least one second parameter is used to determine at least one first symbol in the first time slot corresponding to the second parameter.

[0437] In some embodiments, there are multiple first parameters, and the first symbols indicated by the second parameters corresponding to the first parameters with the same value do not overlap.

[0438] In some embodiments, the number of first parameters is less than the number of second parameters, at least one first parameter corresponds one-to-one with at least one first time slot, each first parameter corresponds to n second parameters, at least one first parameter is used to determine the first time slot corresponding to the first parameter, and the n second parameters are used to determine at least one first symbol in the first time slot corresponding to the first parameter, where n is a positive integer greater than 1.

[0439] In some embodiments, each second parameter corresponds to a first parameter.

[0440] In some embodiments, the first symbols indicated by n second parameters corresponding to the same first parameter do not overlap.

[0441] In some embodiments, the number of first parameters is multiple, the values ​​of the multiple first parameters are different, and the number of first time slots is the number of first parameters.

[0442] In some embodiments, the number of first parameters is multiple, some of the first parameters have the same value, and the number of first time slots is the number of first parameters with different values.

[0443] In some embodiments, the second parameter includes at least one of the following: a third parameter indicating the starting position and number of at least one first symbol in the first time slot; a fourth parameter indicating the starting position of at least one first symbol in the first time slot; a fifth parameter indicating the number of at least one first symbol in the first time slot; and a bitmap indicating the position of at least one first symbol in the first time slot.

[0444] In some embodiments, the PUSCH carries a transport block TB, and the first information further indicates at least one of the following: the number of time slots used to determine the transport block size TBS; the number of repetitions of the PUSCH; wherein the product of the number of repetitions and the number of time slots is the number of the first time slots, the number of repetitions is a positive integer, and the number of time slots is a positive integer.

[0445] In some embodiments, if the first information does not indicate the number of repetitions of the PUSCH transmission and the number of time slots used to determine the TBS, the number of repetitions is 1 and the number of time slots is the number of the first time slots, or the number of time slots is 1 and the number of repetitions is the number of the first time slots.

[0446] In some embodiments, the TBS of a TB carried by the PUSCH is determined based on the first information; based on the TBS, a TB is sent on the PUSCH.

[0447] In some embodiments, the TBS is determined based on the number of first symbols in the first first time slot. In some embodiments, the TBS is determined based on the maximum number of first symbols in all first time slots. In some embodiments, the TBS is determined based on the minimum number of first symbols in all first time slots. In some embodiments, the TBS is determined based on the average number of first symbols in all first time slots. In some embodiments, the TBS is determined based on the sum of the number of first symbols in the first N first time slots in chronological order. In some embodiments, the TBS is determined based on the sum of the number of first symbols in the first N first time slots arranged in a first order. In some embodiments, the TBS is determined based on the sum of the number of first symbols in the last N first time slots arranged in a first order. In some embodiments, N is the number of time slots used to determine the TBS, N is a positive integer greater than or equal to 1, and the first order is the descending order of the number of first symbols in each first time slot.

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

[0449] In some embodiments, PUSCH is allocated on at least one time slot, and the symbol allocation of PUSCH on each time slot may be different, and / or the symbols of PUSCH on each time slot may be discontinuous.

[0450] In some embodiments, the time-domain resources of PUSCH on each time slot can be indicated separately.

[0451] In some embodiments, Method 1-1: A row index of the TDRA table corresponds to a k2 and at least one SLIV, and the number of PUSCH slots N PUSCH The number of SLIVs is equal to the row index. At least one SLIV corresponding to this row index corresponds one-to-one with a PUSCH slot. The SLIV corresponding to each slot is used to determine the symbol allocated to the PUSCH in that slot. In some embodiments, a SLIV can be replaced by a set of {S, L}.

[0452] In some embodiments, in methods 1-2, a row index of the TDRA table corresponds to a k2, an S, and at least one L, and the number of PUSCH slots N. PUSCH The number of L is equal to the number of times the row index corresponds to at least one L and a time slot of PUSCH. The L corresponding to the time slot and the S corresponding to the row index are used to determine the symbol allocated to PUSCH in the time slot.

[0453] In some embodiments, methods 1-3, a row index of the TDRA table corresponds to a k2, an L, and at least one S, and the number of PUSCH slots N. PUSCH The number of S is equal to the number of L corresponding to the row index. At least one L corresponds to the PUSCH time slot. The S corresponding to the time slot and the L corresponding to the row index are used to determine the symbol allocated to the PUSCH in the time slot.

[0454] In some embodiments, in methods 1-4, a row index of the TDRA table corresponds to at least one set of {k2, SLIV}, where k2 and SLIV in each set of {k2, SLIV} indicate the time slot allocated to PUSCH and the symbol allocated to PUSCH in that time slot, respectively.

[0455] In some embodiments, in method 1-4-1, if a row index corresponds to at least two sets of {k2, SLIV}, it is not expected that the value of k2 in any two sets of {k2, SLIV} will be the same, and the number of PUSCH slots N will be... PUSCH The number of groups equal to {k2, SLIV}.

[0456] In some embodiments, in method 1-4-2, if a row index corresponds to at least two sets of {k2, SLIV}, and there exist two sets of {k2, SLIV} where the value of k2 is the same, then it is not expected that the symbols indicated by the SLIVs in these two sets of {k2, SLIV} will overlap in the time domain, and the number of time slots N of PUSCH will be determined. PUSCH It equals the number of distinct k2 values ​​in at least two sets of {k2, SLIV}. A SLIV can be replaced by a set of {S, L}.

[0457] In some embodiments, methods 1-5, a row index of the TDRA table corresponds to at least one set of {k2, {at least one SLIV}}, where k2 and at least one SLIV in each set of {k2, {at least one SLIV}} indicate the time slot allocated to the PUSCH and the symbol allocated to the PUSCH on that time slot, respectively. The number of time slots N for the PUSCH is... PUSCH The number of sets {k2, {at least one SLIV}}. If a row index corresponds to at least two sets {k2, {at least one SLIV}}, then the value of k2 in any two sets {k2, {at least one SLIV}} is not expected to be the same. If at least one SLIV in a set {k2, {at least one SLIV}} corresponding to a row index includes at least two SLIVs, then the symbols indicated by these at least two SLIVs are not expected to overlap in the time domain. A SLIV can be replaced by a set {S, L}.

[0458] In some embodiments, in method 2-1, a row index of the TDRA table also corresponds to the number of PUSCH repetitions K, then the number of time slots... Not expected Not an integer.

[0459] In some embodiments, in method 2-2, a row index of the TDRA table is also used to determine the number of time slots N for determining the TBS, and the number of PUSCH repetitions. Not expected Not an integer.

[0460] In some embodiments, in methods 2-3, a row index of the TDRA table also corresponds to the PUSCH repetition count K and the number of time slots N used to determine the TBS, and it is not expected that the PUSCH repetition count K×N ≠ N. PUSCH .

[0461] In some embodiments, in methods 2-4, if a row index of the TDRA table does not correspond to the PUSCH repetition count K and the number of time slots N used to determine the TBS, then the PUSCH repetition count K = N. PUSCH The number of time slots N = 1.

[0462] In some embodiments, in methods 2-5, if a row index of the TDRA table does not correspond to the PUSCH repetition count K and the number of time slots N used to determine the TBS, then the number of time slots N = N PUSCH The number of times PUSCH is repeated is K = 1.

[0463] In some embodiments, if the number of time slots N = 1, the method for determining the TBS includes one of the following: Method 3-1-1, determining the TBS based on the number of symbols L1 allocated to the PUSCH on the first (physical / available) time slot. Method 3-1-2, determining the TBS based on the maximum value L among the number of symbols allocated to the PUSCH on all (physical / available) time slots. max Determine the TBS. Method 3-1-3, based on the minimum L among the number of symbols allocated to the PUSCH across all (physical / available) time slots. min Determine TBS. Method 3-1-4, based on the average number of symbols allocated to PUSCH per (physical / available) timeslot. Determine TBS.

[0464] In some embodiments, if the number of time slots N>1, the method for determining TBS includes one of the following: Method 3-2-1, based on the total number L of symbols allocated to PUSCH on the first N (physical / available) time slots. N Determine the TBS. Method 3-2-2, based on the sum of N maximum values ​​of the number of symbols allocated to PUSCH across all (physical / available) time slots. N,max Determine TBS. Method 3-2-3, based on the sum of the N minimum values ​​of the number of symbols allocated to PUSCH across all (physical / available) time slots. N,min Determine TBS. Method 3-2-4, based on the average number of symbols allocated to PUSCH per N (physical / available) time slots. Determine the TBS. Method 3-2-5, based on the average number of time slots N and the number of symbols allocated to the PUSCH per (physical / available) time slot. Determine TBS.

[0465] 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 sends a first signal. Step 1-2: The terminal 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.

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

[0467] In some embodiments, the first information includes a first index that indicates a row in a TDRA table, the TDRA table including at least one row, each row including parameters for determining a first time-domain resource.

[0468] In some embodiments, the TDRA table can be predefined by the protocol or configured by the network device for the terminal via higher-layer signaling.

[0469] In some embodiments, for method 1-1, a row of the TDRA table includes a k2 and at least one SLIV.

[0470] In one example, as shown in Table 3, the TDRA table comprises four rows, each containing a candidate value for k2 and at least one candidate value for SLIV. The first row contains candidate values ​​for one SLIV, the second row contains candidate values ​​for two SLIVs, the third row contains candidate values ​​for three SLIVs, and the fourth row contains candidate values ​​for four SLIVs. The first time-domain resource includes the number of time slots N. PUSCH The number of time slots (i.e., the number of PUSCH slots) is equal to the number of SLIVs corresponding to the first index. If the first index indicates row index #1, then N PUSCH =1; if the first index indicates row index #2, then N PUSCH =2; if the first index indicates row index #3, then N PUSCH =3; if the first index indicates row index #4, then N PUSCH =4.

[0471] In one example, as shown in Table 3, if the first index indicates row index #4, N PUSCH =4, then SLIV#1 to SLIV#4 correspond sequentially to the first to fourth time slots of PUSCH. That is, the symbol allocation on the first time slot of PUSCH is determined by candidate value #4 of SLIV#1, the symbol allocation on the second time slot of PUSCH is determined by candidate value #3 of SLIV#2, the symbol allocation on the third time slot of PUSCH is determined by candidate value #2 of SLIV#3, and the symbol allocation on the fourth time slot of PUSCH is determined by candidate value #1 of SLIV#4. In one example, based on k2 and N... PUSCH Determine the time slots included in the first time domain resource. The time slots of the PUSCH can be determined based on the physical time slot counting method and the available time slot counting method, as shown in Figures 2B and 2C.

[0472] In some embodiments, one SLIV in method 1-1 can be replaced with a set of S and L.

[0473] In some embodiments, for methods 1-2, a row of the TDRA table includes a k2, an S, and at least one L.

[0474] In one example, as shown in Table 6, the TDRA table includes 4 rows, each row including a candidate value for k2, a candidate value for S, and at least one candidate value for L, wherein the first row includes two candidate values ​​for L, the second row includes three candidate values ​​for L, and the third row includes four candidate values ​​for L.

[0475] In one example, the first time-domain resource includes N time slots. PUSCH (That is, the number of PUSCH slots) is equal to the number of L corresponding to the first index. As shown in Table 6, if the first index indicates row index #1, then N PUSCH =2; if the first index indicates row index #2, then N PUSCH =3; if the first index indicates row index #3, then N PUSCH =4.

[0476] In one example, at least one L corresponds one-to-one with the time slots included in the first time-domain resource. At least one L corresponds sequentially with the time slots of PUSCH, as shown in Table 6. If the first index indicates row index #3, N PUSCH =4, then L#1 to L#4 correspond sequentially to the first to fourth time slots of PUSCH. That is, the symbol allocation in the first time slot of PUSCH is determined based on candidate value #4 of S and candidate value #4 of L#1; the symbol allocation in the second time slot of PUSCH is determined based on candidate value #4 of S and candidate value #3 of L#2; the symbol allocation in the third time slot of PUSCH is determined based on candidate value #4 of S and candidate value #2 of L#3; and the symbol allocation in the fourth time slot of PUSCH is determined based on candidate value #4 of S and candidate value #1 of L#4. In one example, based on k2 and N... PUSCH Determine the time slots included in the first time domain resource. The time slots of the PUSCH can be determined based on the physical time slot counting method and the available time slot counting method, as shown in Figures 2F and 2G.

[0477] In some embodiments, for methods 1-3, a row of the TDRA table includes a k2, an L, and at least one S.

[0478] In one example, as shown in Table 5, the TDRA table includes 4 rows, each row including a candidate value for k2, a candidate value for L, and at least one candidate value for S, wherein the first row includes a candidate value for S, the second row includes two candidate values ​​for S, the third row includes three candidate values ​​for S, and the fourth row includes four candidate values ​​for S.

[0479] In one example, the first time-domain resource includes N time slots. PUSCH (i.e., the number of PUSCH slots) is equal to the number of S corresponding to the first index. As shown in Table 5, if the first index indicates row index #1, then N PUSCH=2; if the first index indicates row index #2, then N PUSCH =3; if the first index indicates row index #3, then N PUSCH =4.

[0480] In one example, at least one S corresponds one-to-one with the time slots included in the first time domain resource, and at least one S corresponds sequentially with the time slots of PUSCH, as shown in Table 5. If the first index indicates row index #4, N PUSCH =4, then S#1 to S#4 correspond sequentially to the first to fourth time slots of PUSCH. That is, the symbol allocation in the first time slot of PUSCH is determined based on candidate value #4 of L and candidate value #4 of S#1; the symbol allocation in the second time slot of PUSCH is determined based on candidate value #4 of L and candidate value #3 of S#2; the symbol allocation in the third time slot of PUSCH is determined based on candidate value #4 of L and candidate value #2 of S#3; and the symbol allocation in the fourth time slot of PUSCH is determined based on candidate value #4 of L and candidate value #1 of S#4. In one example, based on k2 and N... PUSCH =4. Determine the time slots included in the first time domain resources. The time slots of PUSCH can be determined based on the physical time slot count and the available time slot count, as shown in Figures 2D and 2E.

[0481] In some embodiments, for methods 1-4, a row of the TDRA table includes at least one set of k2 and SLIV; for ease of description, the set of k2 and SLIV is denoted as {k2, SLIV}.

[0482] In one example, as shown in Table 8, the TDRA table includes 4 rows, each containing at least one set of candidate values ​​for {k2, SLIV}, where the first row contains one set of candidate values ​​for {k2, SLIV}, the second row contains two sets of candidate values ​​for {k2, SLIV}, the third row contains three sets of candidate values ​​for {k2, SLIV}, and the fourth row contains four sets of candidate values ​​for {k2, SLIV}.

[0483] In one example, in at least one set of {k2, SLIV}, k2 and SLIV respectively indicate the time slot included in the first time-domain resource and the symbol included in the first time-domain resource on that time slot, specifically including the following two possible methods:

[0484] In Method 1-4-1, if a row of the TDRA table contains at least two sets of {k2, SLIV}, it is not expected that the values ​​of k2 in any two sets of {k2, SLIV} will be the same; it should be understood that in Method 1-4-1, different SLIVs correspond to symbol assignments on different time slots, and the symbol assignments on each time slot are continuous.

[0485] In one example, the first time-domain resource includes N time slots. PUSCHThe number of time slots (i.e., the number of PUSCH slots) is equal to the number of groups {k2, SLIV} corresponding to the first index. In one example, as shown in Table 8, if the first index indicates row index #1, then N PUSCH =1; if the first index indicates row index #2, then N PUSCH =2; if the first index indicates row index #3, then N PUSCH =3; if the first index indicates row index #4, then N PUSCH =4.

[0486] Method 1-4-2 states that if a row in the TDRA table contains at least two sets of {k2, SLIV}, and there exist two sets of {k2, SLIV} where the value of k2 is the same, then the symbols indicated by the SLIVs in these two sets of {k2, SLIV} are not expected to overlap in the time domain. Compared to Method 1-4-1, Method 1-4-2 allows different SLIVs to correspond to symbol assignments on the same time slot.

[0487] In one example, the symbols indicated by SLIV in these two sets {k2, SLIV} may be discontinuous in the time domain. Method 1-4-2 allows for discontinuous time-domain resource allocation within a time slot.

[0488] In one example, if a value of k2 corresponds to at least two SLIVs, then the transmission timing of a PUSCH on the slot corresponding to k2 is defined as all symbols indicated by the at least two SLIVs corresponding to the value of k2. It should be understood that if multiple discontinuous symbols can be allocated on a slot, these symbols together constitute a PUSCH transmission timing; further, for PUSCH time-domain resource allocation at the slot level, such as PUSCH repetition types A and TBoMS, this slot is considered a single PUSCH transmission, i.e., one rate matching and resource mapping is performed.

[0489] In one example, the first time-domain resource includes N time slots. PUSCH This equals the number of distinct k2 values ​​in at least two sets of {k2, SLIV}. In one example, if a row in the TDRA table includes a set of {k2, SLIV}, then the number of time slots N included in the first time-domain resource is... PUSCH =1. Figures 2H and 2I show the first time-domain resources determined according to methods 1-4-1 and 1-4-2, respectively. The first index indicates row index #4 in table 5. In one example, a SLIV in method 1-4 can be replaced with a set of S and L.

[0490] In some embodiments, for methods 1-5: associating a k2 with at least one SLIV, denoted as a set {k2, {at least one SLIV}}, then a row of the TDRA table includes at least one set {k2, {at least one SLIV}}.

[0491] In one example, as shown in Table 13, in each of at least one set of {k2, {at least one SLIV}}, k2 and at least one SLIV respectively indicate the time slot included in the first time-domain resource and the symbol included in the first time-domain resource on that time slot. If a row in the TDRA table includes at least two sets of {k2, {at least one SLIV}}, it is not expected that the values ​​of k2 in any two sets of {k2, {at least one SLIV}} are the same.

[0492] In one example, as shown in Table 13, if a row in the TDRA table includes at least one SLIV from a set {k2, {at least one SLIV}} that includes at least two SLIVs, then it is not expected that the symbols indicated by these at least two SLIVs will overlap in the time domain. It should be understood that if at least one SLIV includes only one SLIV, then Method 1-5 is equivalent to Method 1-4-1, and if at least one SLIV includes at least two SLIVs, then Method 1-5 is equivalent to Method 1-4-2.

[0493] In one example, the first time-domain resource includes N time slots. PUSCH (i.e., the number of time slots for PUSCH) is equal to the number of groups {k2, {at least one SLIV}} corresponding to the first index. As shown in Table 13, if the first index indicates row index #1, then N PUSCH =1; if the first index indicates row index #2, then N PUSCH =2. Figure 2J shows the first time-domain resource determined according to method 1-5.

[0494] In one example, one of the SLIVs in methods 1-5 can be replaced with a set of S and L.

[0495] In some embodiments, for methods 1-6, a row of the TDRA table includes a k2 and at least one bitmap. Methods 1-6 are similar to methods 1-1, but can indicate discontinuous symbol allocations within a time slot. The length of the bitmap is the number of symbols included in a time slot, and each bit in the bitmap is associated with a symbol within the time slot. When the value of a bit in the bitmap is a first value, it indicates that the symbol corresponding to that bit is allocated to a first time-domain resource.

[0496] In some embodiments, for methods 1-7, a row of the TDRA table includes at least one set of k2 and bitmaps, which, for ease of description, are denoted as {k2, bitmap}. Methods 1-7 are similar to methods 1-4, but can indicate discontinuous symbol allocations within a time slot. The characteristics of the bitmaps are consistent with those in methods 1-6.

[0497] In some embodiments, the number of PUSCH repetitions K and the number of time slots N satisfy the relationship: K × N = NPUSCH .

[0498] In some embodiments, the method for determining the number of PUSCH repetitions K and the number of time slots N includes:

[0499] Method 2-1: If the first index indicates a row in the TDRA table that also includes the number of PUSCH repetitions K, then the number of time slots... Not expected Not an integer.

[0500] Method 2-2: If a row in the TDRA table indicated by the first index also includes the number of time slots N, then the number of PUSCH repetitions is... Not expected Not an integer.

[0501] In methods 2-3, a row in the TDRA table indicated by the first index also includes the number of PUSCH repetitions K and the number of time slots N; if not desired, then the number of PUSCH repetitions K×N ≠ N. PUSCH .

[0502] Method 2-4: If a row in the TDRA table indicated by the first index does not include the number of PUSCH repetitions K and the number of time slots N, then the number of PUSCH repetitions K = N. PUSCH The number of time slots N = 1.

[0503] Method 2-5: If a row in the TDRA table indicated by the first index does not include the number of PUSCH repetitions K and the number of time slots N, then the number of time slots N = N PUSCH The number of times PUSCH is repeated is K = 1.

[0504] In one example, as shown in Figure 2J, taking method 1-5 as an example, the TDRA table indicated by the first index includes four groups {k2, {two SLIVs}}, therefore N PUSCH =4; Assuming a row in the TDRA table indicated by the first index includes N=2, then K=2, or, if a row in the TDRA table indicated by the first index includes K=2, then N=2; then, the PUSCH transmission is repeated twice, with each PUSCH reassigned to two time slots, where the first reassignment of PUSCH is to time slot #3 and time slot #4, and the second reassignment of PUSCH is to time slot #8 and time slot #9; the first to sixth symbols and the ninth to fourteenth symbols of time slots #3 and #8 are assigned to PUSCH, and the first to fifth symbols and the eighth to fourteenth symbols of time slots #4 and #9 are assigned to PUSCH.

[0505] In some embodiments, determining a first TBS based on first information by a terminal device includes:

[0506] If the number of time slots N = 1:

[0507] Method 3-1-1: The number of symbols L1 allocated to PUSCH on the first (physical / available) time slot determines TBS.

[0508] In one example,

[0509] In one example, as shown in Figures 2B and 2C, where N PUSCH =4; Assuming N=1, then K=4, L1=12.

[0510] In one example, as shown in Figure 2J, where N PUSCH =2; Assuming N=1, then K=2, L1=12.

[0511] Method 3-1-2: Based on the maximum value L among the number of symbols allocated to PUSCH across all time slots. max Determine TBS.

[0512] In one example, Where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH , max represents the minimum value operation.

[0513] In one example,

[0514] In one example, as shown in Figures 2B and 2C, where N PUSCH =4; assuming N=1, then K=4, L max =14.

[0515] In one example, as shown in Figure 2J, where N PUSCH =2; assuming N=1, then K=2, L max =12.

[0516] Method 3-1-3: Based on the minimum number L among all time slots allocated to PUSCH min Determine TBS.

[0517] In one example, Where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH min represents the minimum value operation.

[0518] In one example,

[0519] In one example, as shown in Figures 2B and 2C, where N PUSCH=4; assuming N=1, then K=4, L min =8.

[0520] In one example, as shown in Figure 2J, where N PUSCH =2; assuming N=1, then K=2, L min =12.

[0521] Method 3-1-4: Based on the average number of symbols allocated to PUSCH in each time slot Determine TBS.

[0522] In one example, Where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0523] In one example,

[0524] In one example, as shown in Figures 2B and 2C, where N PUSCH =4; assuming N=1, then K=4,

[0525] In one example, as shown in Figure 2J, where N PUSCH =2; assuming N=1, then K=2,

[0526] If the number of time slots N > 1:

[0527] Method 3-2-1, based on the total number L of symbols allocated to PUSCH in the first N (physical / available) time slots. N Determine TBS.

[0528] In one example, L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0529] In one example, N RE =min(N×N′,N′) RE )·n PRB , or

[0530] In one example, Where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0531] In one example, as shown in Figure 2K, where N PUSCH =4, N=2, K=2, then L1=12, L2=12, L N =24.

[0532] in, This indicates the number of subcarriers included in an RB. Indicates the number of symbols included in a time slot, in For example, N′ = 156 or 168. This applies to the entire text.

[0533] Method 3-2-2, based on the sum of the N largest values ​​of the number of symbols allocated to PUSCH across all time slots, L N,max Determine TBS.

[0534] In one example, L N,max For set {L n |n=1,2,...,N PUSCH The sum of the largest N values ​​in}, L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0535] In one example, N RE =min(N×N′,N′) RE )·n PRB , or

[0536] In one example, For set {L n |n=1,2,...,N PUSCH The largest N values ​​in}, where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0537] In one example, as shown in Figure 2K, where N PUSCH =4, N=2, K=2, then L N,max =24.

[0538] Method 3-2-3: Based on the sum of the N minimum values ​​of the number of symbols allocated to PUSCH across all time slots, L N,min Determine TBS.

[0539] In one example, L N,min For set {Ln |n=1,2,...,N PUSCH The sum of the smallest N values ​​in}, L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0540] In one example, N RE =min(N×N′,N′) RE )·n PRB , or

[0541] In one example, For set {L n |n=1,2,...,N PUSCH The smallest N values ​​in}, where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0542] In one example, as shown in Figure 2K, where N PUSCH =4, N=2, K=2, then

[0543] L N,min =24.

[0544] Method 3-2-4, based on the average number of symbols allocated to PUSCH per N time slots. Determine TBS.

[0545] In one example, Where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH .

[0546] In one example, N RE =min(N×N′,N′) RE )·n PRB , or

[0547] In one example, as shown in Figure 2K, where N PUSCH =4, N=2, K=2, then

[0548] Method 3-2-5: Based on the average of the number of time slots N and the number of symbols allocated to PUSCH in each time slot. Determine TBS.

[0549] In one example, Where L n This represents the number of symbols allocated to the nth time slot of PUSCH, where n = 1, 2, ..., N. PUSCH

[0550] In one example, N RE =N·min(N′,N′) RE,n )·n PRB , or

[0551] In one example, as shown in Figure 2K, where N PUSCH =4, N=2, K=2, then

[0552] In some embodiments, the communication method of this disclosure 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 network device determines the first TB based on the first signal and the first TBS.

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

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

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

[0556] In some embodiments, prior to step 1-1, the network device instructs the terminal device to use the PUSCH transmission method via higher-layer signaling.

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

[0558] 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). 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). Taking a field-programmable gate array (FPGA) as an example, it 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.

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

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

[0561] 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 processing module 4102 is a first processing module configured to determine, based on the first information, at least one first time slot of the PUSCH, and at least one first symbol included in the PUSCH in each first time slot; wherein the first symbols are discontinuous within the same first time slot, and / or the first symbols are different in different first time slots.

[0562] In some embodiments, the communication device is a network device, and the transceiver module 4101 is a second transceiver module configured to transmit first information. The processing module 4102 is a second processing module configured to determine, based on the first information, at least one first time slot of the PUSCH, and at least one first symbol included in the PUSCH in each first time slot; wherein the first symbols are discontinuous within the same first time slot, and / or the first symbols are different in different first time slots.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0577] 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 the first message; Based on the first information, at least one first time slot of the Physical Uplink Shared Channel (PUSCH) is determined, and at least one first symbol is included in each first time slot of the PUSCH. Wherein, the first symbol is discontinuous within the same first time slot, and / or the first symbol is different in different first time slots.

2. The method of claim 1, wherein, The first information indicates at least one first parameter and at least one second parameter, the at least one first parameter being used to determine the first time slot, and the at least one second parameter being used to indicate the first symbol within the first time slot.

3. The method of claim 2, wherein, The first information indicates a first parameter and at least one second parameter, the at least one second parameter corresponding one-to-one with the at least one first time slot, the first parameter being used to determine the first first time slot, and the at least one second parameter being used to determine the at least one first symbol within the first time slot corresponding to the second parameter.

4. The method of claim 3, wherein, The number of the first time slots is the same as the number of the second parameters.

5. The method of claim 3 or 4, wherein, Determining at least one first time slot of PUSCH based on the first information includes: N consecutive time slots starting from the time slot indicated by the first parameter are determined as the first time slots. PUSCH ​ where N PUSCH is the number of first slots.

6. The method of claim 3 or 4, wherein, Determining at least one first time slot of PUSCH based on the first information includes: N slots satisfying a first condition are determined as the first slots from a slot indicated by the first parameter PUSCH ​ wherein N PUSCH is the number of the first slots, the first condition is that the at least one first symbol within the first slots does not overlap with a second symbol, the second symbol comprises at least one of: a synchronization signal block symbol, a downlink symbol, a sounding reference signal symbol, a symbol indicated by higher layer signaling.

7. The method of claim 2, wherein, The number of the first parameter and the number of the second parameter are equal. The at least one first parameter corresponds one-to-one with the at least one first time slot. The at least one second parameter corresponds one-to-one with the at least one first time slot. The at least one first parameter is used to determine the first time slot corresponding to the first parameter. The at least one second parameter is used to determine the at least one first symbol in the first time slot corresponding to the second parameter.

8. The method of claim 7, wherein, There are multiple first parameters, and the first symbols indicated by the second parameters corresponding to the first parameters with the same value do not overlap.

9. The method of claim 2, wherein, The number of the first parameters is less than the number of the second parameters. The at least one first parameter corresponds one-to-one with the at least one first time slot. Each first parameter corresponds to n second parameters. The at least one first parameter is used to determine the first time slot corresponding to the first parameter. The n second parameters are used to determine the at least one first symbol in the first time slot corresponding to the first parameter. n is a positive integer greater than 1.

10. The method of claim 9, wherein, Each second parameter corresponds to one first parameter.

11. The method of claim 9 or 10, wherein, The first symbols indicated by n second parameters corresponding to the same first parameter do not overlap.

12. The method according to any one of claims 7 to 11, wherein, The number of the first parameters is multiple, and the values ​​of the multiple first parameters are different. The number of the first time slots is the number of the first parameters.

13. The method of claim 7, wherein, The number of the first parameters is multiple, some of which have the same value, and the number of the first time slots is the number of first parameters with different values.

14. The method of any one of claims 2 to 13, wherein, The second parameter includes at least one of the following: The third parameter indicates the starting position and number of the at least one first symbol within the first time slot; The fourth parameter indicates the starting position of at least one first symbol within the first time slot; The fifth parameter indicates the number of at least one first symbol within the first time slot; A bitmap indicating the position of at least one first symbol within the first time slot.

15. The method of any one of claims 1 to 14, wherein, The PUSCH carries a transport block TB, and the first information also indicates at least one of the following: The number of time slots used to determine the Transport Block Size (TBS); The number of times PUSCH is repeated; Wherein, the product of the number of repetitions and the number of time slots is the number of the first time slots, the number of repetitions is a positive integer, and the number of time slots... The number is a positive integer.

16. The method of any one of claims 1 to 14, wherein, The PUSCH carries one TB, provided that the first information does not indicate the number of repetitions of the PUSCH transmission or the number of time slots used to determine the TBS. The repetition count is 1, and the number of time slots is the number of the first time slots, or... The number of time slots is 1, and the number of repetitions is the number of the first time slots.

17. The method of any one of claims 1 to 16, wherein, The method further includes: Based on the first information, determine a TB TBS carried by the PUSCH; Based on the TBS, the TB is transmitted on the PUSCH.

18. The method of claim 17, wherein, The step of determining a TBS for a TB carried by the PUSCH based on the first information includes one of the following: The TBS is determined based on the number of symbols in the first time slot. The TBS is determined based on the maximum number of first symbols in all first time slots; The TBS is determined based on the minimum number of first symbols in all first time slots; The TBS is determined based on the average number of first symbols in all first time slots; The TBS is determined based on the sum of the number of first symbols in the first N first time slots in the time sequence; The TBS is determined based on the sum of the number of first symbols in the first N first time slots arranged in the first order; The TBS is determined by the sum of the number of first symbols in the last N first time slots arranged in the first order; Wherein, N is the number of time slots used to determine TBS, N is a positive integer greater than or equal to 1, and the first order is the order in descending order of the number of first symbols in each first time slot.

19. A communication method performed by a network device, the method comprising: Send the first message; Based on the first information, at least one first time slot is determined for the Physical Uplink Shared Channel (PUSCH) configuration, and at least one first symbol is included in each first time slot; wherein the first symbols are discontinuous within the same first time slot, and / or the first symbols are different in different first time slots.

20. The method of claim 19, wherein, The first information indicates at least one first parameter and at least one second parameter, wherein the at least one first parameter is used to determine the first time slot, and the at least one second parameter is used to indicate the position of the first symbol within the first time slot.

21. The method of claim 20, wherein, The first information indicates a first parameter and at least one second parameter, the at least one second parameter corresponding one-to-one with the at least one first time slot, the first parameter being used to determine the first first time slot, and the at least one second parameter being used to determine the at least one first symbol within the first time slot corresponding to the second parameter.

22. The method of claim 21, wherein, The number of the first time slots is the same as the number of the second parameters.

23. The method of claim 21 or 22, wherein, Determining at least one first time slot of PUSCH based on the first information includes: N consecutive slots starting from the slot indicated by the first parameter are determined as the first slots. PUSCH ​ where N PUSCH is the number of first slots.

24. The method of claim 21 or 22, wherein, Determining at least one first time slot of PUSCH based on the first information includes: N slots satisfying a first condition are determined as the first slots from a slot indicated by the first parameter PUSCH ​ wherein N PUSCH is the number of the first slots, the first condition is that the at least one first symbol does not overlap with a second symbol in the first slots, the second symbol comprises at least one of: a synchronization signal block symbol, a downlink symbol, a sounding reference signal symbol, a symbol indicated by higher layer signaling.

25. The method of claim 20, wherein, The number of the first parameter and the number of the second parameter are equal. The at least one first parameter corresponds one-to-one with the at least one first time slot. The at least one second parameter corresponds one-to-one with the at least one first time slot. The at least one first parameter is used to determine the first time slot corresponding to the first parameter. The at least one second parameter is used to determine the at least one first symbol in the first time slot corresponding to the second parameter.

26. The method of claim 25, wherein, There are multiple first parameters, and the first symbols indicated by the second parameters corresponding to the first parameters with the same value do not overlap.

27. The method of claim 20, wherein, The number of the first parameters is less than the number of the second parameters. The at least one first parameter corresponds one-to-one with the at least one first time slot. Each first parameter corresponds to n second parameters. The at least one first parameter is used to determine the first time slot corresponding to the first parameter. The n second parameters are used to determine the at least one first symbol in the first time slot corresponding to the first parameter. n is a positive integer greater than 1.

28. The method of claim 27, wherein, Each second parameter corresponds to one first parameter.

29. The method of claim 27 or 28, wherein, The first symbols indicated by n second parameters corresponding to the same first parameter do not overlap.

30. The method of any one of claims 25 to 29, wherein, The number of the first parameters is multiple, and the values ​​of the multiple first parameters are different. The number of the first time slots is the number of the first parameters.

31. The method of claim 25, wherein, The number of the first parameters is multiple, some of which have the same value, and the number of the first time slots is the number of first parameters with different values.

32. The method of any one of claims 20-31, wherein, The second parameter includes at least one of the following: The third parameter indicates the starting position and number of the at least one first symbol within the first time slot; The fourth parameter indicates the starting position of at least one first symbol within the first time slot; The fifth parameter indicates the number of at least one first symbol within the first time slot; The bitmap indicates the position of the first symbol within the first time slot.

33. The method of any one of claims 19 to 32, wherein, The PUSCH carries a transport block TB, and the first information also indicates at least one of the following: The number of time slots used to determine the Transport Block Size (TBS); The number of times the PUSCH transmission is repeated; Wherein, the product of the number of repetitions and the number of time slots is the number of the first time slots, the number of repetitions is a positive integer, and the number of time slots is a positive integer.

34. The method of any one of claims 19 to 32, wherein, The PUSCH carries one TB, provided that the first information does not indicate the number of repetitions of the PUSCH transmission or the number of time slots used to determine the TBS. The repetition count is 1, and the number of time slots is the number of the first time slots, or... The number of time slots is 1, and the number of repetitions is the number of the first time slots.

35. The method of any one of claims 19 to 34, wherein, The method further includes: Based on the first information, determine a TB TBS carried by the PUSCH; Based on the TBS, the TB is received on the PUSCH.

36. The method of claim 35, wherein, The step of determining a TBS for a TB carried by the PUSCH based on the first information includes one of the following: The TBS is determined based on the number of symbols in the first time slot. The TBS is determined based on the maximum number of first symbols in all first time slots; The TBS is determined based on the minimum number of first symbols in all first time slots; The TBS is determined based on the average number of first symbols in all first time slots; The TBS is determined based on the sum of the number of first symbols in the first N first time slots in the time sequence; The TBS is determined based on the sum of the number of first symbols in the first N first time slots arranged in the first order; The TBS is determined by the sum of the number of first symbols in the last N first time slots arranged in the first order; Wherein, N is the number of time slots used to determine TBS, N is a positive integer greater than or equal to 1, and the first order is the order in descending order of the number of first symbols in each first time slot.

37. A communication device for performing the communication method according to any one of claims 1 to 18, 19 to 36.

38. A communication system comprising a terminal and a network device; the terminal being configured to implement the method as claimed in any one of claims 1 to 18; and the network device being configured to implement the communication method as claimed in any one of claims 19 to 36.

39. 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 18, 19 to 36.

40. A computer program product comprising a computer program that, when executed by a processor, implements the communication method according to any one of claims 1 to 18, 19 to 36.

Images