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

Abstract

This disclosure relates to a communication method, communication device, communication system, storage medium, and program product. The communication method, which can be executed by the communication device, includes: acquiring first information, the first information including at least a first parameter, the first parameter being used to determine the number of symbols in a first data transmission, and the value of the first parameter being greater than the number of symbols within a time slot. This disclosure expands the value range of the first parameter, enabling the time-domain resources of the first data transmission to span multiple time slots, thereby improving the flexibility of time-domain resource allocation and enhancing the utilization and coverage performance of time-domain resources.

Description

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

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

[0002] The 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] For PUSCH that supports cross-slot transport block processing, the symbol allocation for each slot is the same, which reduces the flexibility of time-domain resource allocation, wastes some uplink resources, and thus affects uplink coverage performance.

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

[0006] According to a first aspect of the present disclosure, a communication method is proposed, executed by a communication device, the method comprising: acquiring first information, the first information including at least a first parameter, the first parameter being used to determine the number of symbols in a first data transmission, the value of the first parameter being greater than the number of symbols in a time slot.

[0007] According to a second aspect of the present disclosure, a communication method is proposed, executed by a communication device. The method includes: acquiring fourth information, the fourth information including at least a first parameter and a second parameter, the second parameter indicating the number of first time-domain resources included in a first data transmission, the first parameter indicating the number of symbols in the first time-domain resources, the value of the first parameter being less than or equal to the number of symbols in a time slot; determining a consecutive plurality of symbols as symbols for the first data transmission, starting from a starting symbol, or determining a consecutive plurality of symbols satisfying a first condition as symbols for the first data transmission, starting from a starting symbol; wherein the number of symbols for the first data transmission is determined based on the first parameter and the second parameter, the first condition being that the symbols for the first data transmission do not overlap with a first type of symbols, the first type of symbols being symbols not used for the first data transmission.

[0008] According to a third aspect of the present disclosure, a communication device is provided, comprising: a transceiver module configured to acquire first information, the first information including at least a first parameter, the first parameter being used to determine the number of symbols in the first data transmission, the value of the first parameter being greater than the number of symbols in a time slot.

[0009] According to a fourth aspect of the present disclosure, a communication device is provided, comprising: a transceiver module configured to receive fourth information, the fourth information including at least a first parameter and a second parameter, the second parameter indicating the number of first time-domain resources included in a first data transmission, the first parameter indicating the number of symbols in the first time-domain resources, the value of the first parameter being less than or equal to the number of symbols in a time slot; and a processing module configured to, starting from a starting symbol, determine a consecutive plurality of symbols as symbols for the first data transmission, or, starting from a starting symbol, determine a consecutive plurality of symbols satisfying a first condition as symbols for the first data transmission; wherein the number of symbols for the first data transmission is determined based on the first parameter and the second parameter, the first condition being that the symbols for the first data transmission do not overlap with a first type of symbols, the first type of symbols being symbols not used for the first data transmission.

[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 embodiments of this disclosure, a communication system is proposed, including a communication device configured to implement the communication method as described in the first or 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 present disclosure, the communication device acquires first information, which includes at least a first parameter. The first parameter is used to determine the number of symbols in the first data transmission. The value of the first parameter is greater than the number of symbols in a time slot. Thus, by expanding the value range of the first parameter, this embodiment of the present disclosure enables the time domain resources of the first data transmission to span multiple time slots, thereby improving the flexibility of time domain resource allocation and enhancing the utilization and coverage performance of time domain resources. Attached Figure Description

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

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

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

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

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

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

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

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

[0025] Figures 2A and 2B are interactive schematic diagrams of a communication method according to embodiments of the present disclosure.

[0026] Figures 3A and 3E are schematic diagrams of the time-domain resources of PUSCH determined based on physical symbol counts.

[0027] Figures 3B and 3F are schematic diagrams of the time-domain resources of PUSCH determined based on the available symbol count.

[0028] Figures 3C and 3G are schematic diagrams of time-domain resources for PUSCH repetition determined based on physical time slot counts.

[0029] Figures 3D and 3H are schematic diagrams of the time-domain resources for PUSCH repetition determined based on the available symbol count.

[0030] Figures 4A and 4B are interactive schematic diagrams illustrating a communication method according to embodiments of the present disclosure.

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

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

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

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

[0035] In a first aspect, embodiments of this disclosure provide a communication method executed by a communication device. The method includes: acquiring first information, the first information including at least a first parameter, the first parameter being used to determine the number of symbols in a first data transmission, and the value of the first parameter being greater than the number of symbols in a time slot.

[0036] In this embodiment of the disclosure, the communication device acquires first information, which includes at least a first parameter. The first parameter is used to determine the number of symbols in the first data transmission. The value of the first parameter is greater than the number of symbols in a time slot. Thus, by expanding the value range of the first parameter, this embodiment of the disclosure enables the time domain resources of the first data transmission to span multiple time slots, thereby improving the flexibility of time domain resource allocation and enhancing the utilization and coverage performance of time domain resources.

[0037] In conjunction with some embodiments of the first aspect, in some embodiments, the value of the first parameter is less than or equal to the product of a first value and a second value, the first value indicating the maximum number of time slots occupied by the first data transmission, and the second value indicating the number of symbols in a time slot.

[0038] In conjunction with some embodiments of the first aspect, in some embodiments, the first information further includes a third parameter, the third parameter indicating the starting position of the symbol of the first data transmission; or, Where S represents the third parameter, L represents the first parameter, and N′ max Indicates the first value. This indicates the second numerical value.

[0039] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes: determining L consecutive symbols as symbols for the first data transmission, starting from the starting position indicated by the third parameter; wherein L is the number of symbols for the first data transmission.

[0040] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes: starting from the starting position indicated by the third parameter, determining L consecutive symbols that satisfy a first condition as symbols for the first data transmission; wherein L is the number of symbols for the first data transmission, the first condition is that the symbols for the first data transmission do not overlap with a first type of symbols, and the first type of symbols are symbols not used for the first data transmission.

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

[0042] In conjunction with some embodiments of the first aspect, in some embodiments, the number of symbols transmitted in the first data transmission is the value of the first parameter.

[0043] In conjunction with some embodiments of the first aspect, in some embodiments, the first information further includes a fourth parameter, the fourth parameter indicating the number of repetitions of the first data transmission, the value of the fourth parameter being a positive integer greater than or equal to 1; the number of symbols in the first data transmission is the product of the first parameter and the fourth parameter.

[0044] In conjunction with some embodiments of the first aspect, in some embodiments, the communication device is a terminal, and the method further includes: the terminal determining the transport block size TBS of the transport block TB included in the first data transmission based on the first information; and based on the TBS, the terminal transmitting the TB on the symbols of the first data transmission.

[0045] In conjunction with some embodiments of the first aspect, in some embodiments, determining the TBS of the TB included in the first data transmission based on the first information includes: determining second information based on the first information, the second information indicating the number of resource units (REs) in a physical resource block (PRB) used for the first data transmission; determining third information based on the second information, the third information indicating the number of REs used for the first data transmission; and determining the TBS based on the third information.

[0046] In conjunction with some embodiments of the first aspect, in some embodiments, based on the first information, the second information is determined, including one of the following: the second information is determined based on the number of symbols in the first data transmission; the second information is determined based on the number of symbols in the first data transmission and the number of first-class symbols that overlap with the symbols in the first data transmission; wherein the first-class symbols include at least one of the following: synchronization signal block symbols, downlink symbols, probe reference signal symbols, and symbols indicating higher-layer signaling.

[0047] In conjunction with some embodiments of the first aspect, in some embodiments, the third information is determined by one of the following expressions:

[0048] N RE =min(N′·M,N′) RE )·n PRB ;

[0049] N RE =N′ RE ·n PRB ;

[0050] Where, N RE This represents the third piece of information, where N′ represents the number of time slots occupied by the first data transmission, M represents the maximum number of REs in an RB used for the first data transmission, and N′ RE Indicates the second piece of information, n PRB This indicates the number of PRBs transmitted in the first data transfer.

[0051] In conjunction with some embodiments of the first aspect, in some embodiments, the number of time slots occupied by the first data transmission is determined by the following expression: Where S represents the starting position of the symbol in the first data transmission, and L represents the number of symbols in the first data transmission. Indicates the number of symbols included in a time slot.

[0052] Secondly, embodiments of this disclosure provide a communication method executed by a communication device. The method includes: receiving fourth information, the fourth information including at least a first parameter and a second parameter, the second parameter indicating the number of first time-domain resources included in a first data transmission, the first parameter indicating the number of symbols in the first time-domain resources, and the value of the first parameter being less than or equal to the number of symbols in a time slot; determining a consecutive plurality of symbols as symbols for the first data transmission, starting from a starting symbol, or determining a consecutive plurality of symbols satisfying a first condition as symbols for the first data transmission, starting from a starting symbol; wherein the number of symbols for the first data transmission is determined according to the first parameter and the second parameter, and the first condition is that the symbols for the first data transmission do not overlap with a first type of symbols, the first type of symbols being symbols not used for the first data transmission.

[0053] In this embodiment of the disclosure, the communication device acquires fourth information. The first information includes at least a first parameter and a second parameter. The second parameter indicates the number of first time-domain resources included in the first data transmission, and the first parameter indicates the number of symbols in the first time-domain resources. The value of the first parameter is less than or equal to the number of symbols in a time slot. The communication device determines the symbols for the first data transmission based on the first and second parameters. Thus, by introducing the second parameter, this embodiment of the disclosure proportionally expands the time-domain resources for the first data transmission, allowing the time-domain resources for the first data transmission to span multiple time slots. Simultaneously, it allocates time-domain resources at the symbol granularity, improving the flexibility of time-domain resource allocation and enhancing the utilization and coverage performance of time-domain resources.

[0054] In conjunction with some embodiments of the second aspect, in some embodiments, the first type of symbols includes at least one of the following: synchronization signal block symbols, downlink symbols, probe reference signal symbols, and symbols indicating higher-layer signaling.

[0055] In conjunction with some embodiments of the second aspect, in some embodiments, the number of symbols in the first data transmission is the product of the first parameter and the second parameter, the product being greater than the number of symbols in a time slot.

[0056] In conjunction with some embodiments of the second aspect, in some embodiments, the fourth information further includes a third parameter, the third parameter indicating the start symbol; or, Where S represents the third parameter, L represents the first parameter, and N represents the second parameter. N represents the number of symbols in a time slot. max This represents the maximum number of resources in the first time domain.

[0057] In conjunction with some embodiments of the second aspect, in some embodiments, the fourth information further includes a fourth parameter, which indicates the number of repetitions of the first data transmission, and the value of the fourth parameter is a positive integer greater than or equal to 1; the number of symbols in the first data transmission is the product of the first parameter, the second parameter, and the fourth parameter.

[0058] In conjunction with some embodiments of the second aspect, in some embodiments, the communication device is a terminal, and the method further includes: the terminal determining the transport block size TBS of the transport block TB included in the first data transmission according to the fourth information; and the terminal transmitting the TB on the symbols of the first data transmission based on the TBS.

[0059] In conjunction with some embodiments of the second aspect, in some embodiments, determining the TBS of the TB included in the first data transmission based on the fourth information includes: determining fifth information based on the fourth information, the fifth information indicating the number of resource units (REs) in a physical resource block (PRB) used for the first data transmission; determining sixth information based on the fifth information, the sixth information indicating the number of REs used for the first data transmission; and determining the TBS based on the sixth information.

[0060] In conjunction with some embodiments of the second aspect, in some embodiments, the fifth information is determined based on the fourth information, including one of the following: determining the fifth information based on the number of symbols in the first data transmission; determining the fifth information based on the number of symbols in the first data transmission and the number of first-class symbols that overlap with the symbols in the first data transmission.

[0061] In conjunction with some embodiments of the second aspect, in some embodiments, the sixth information is determined by one of the following expressions:

[0062] N RE =N·min(M,N′) RE )·n PRB ;

[0063] N RE =N·N′ RE ·n PRB ;

[0064] Where, N RE This represents the sixth information, N represents the second parameter, M represents the maximum number of REs used for the first data transmission in an RB, and N′ RE Indicates the fifth piece of information, n PRB This indicates the number of PRBs transmitted in the first data transfer.

[0065] Thirdly, embodiments of this disclosure provide a communication device, including: a transceiver module configured to acquire first information, the first information including at least a first parameter, the first parameter being used to determine the number of symbols in the first data transmission, the value of the first parameter being greater than the number of symbols in a time slot.

[0066] In conjunction with some embodiments of the third aspect, in some embodiments, the value of the first parameter is less than or equal to the product of a first value and a second value, the first value indicating the maximum number of time slots occupied by the first data transmission, and the second value indicating the number of symbols in a time slot.

[0067] In conjunction with some embodiments of the third aspect, in some embodiments, the first information further includes a third parameter, which indicates the starting position of the symbol of the first data transmission; or, Where S represents the third parameter, L represents the first parameter, and N′ max Indicates the first value. This indicates the second numerical value.

[0068] In conjunction with some embodiments of the third aspect, in some embodiments, the terminal further includes: a processing module configured to determine L consecutive symbols as symbols for the first data transmission, starting from the starting position indicated by the third parameter; wherein L is the number of symbols for the first data transmission.

[0069] In conjunction with some embodiments of the third aspect, in some embodiments, the terminal further includes: a processing module configured to determine L consecutive symbols satisfying a first condition as symbols for the first data transmission, starting from the starting position indicated by the third parameter; wherein L is the number of symbols for the first data transmission, and the first condition is that the symbols for the first data transmission do not overlap with a first type of symbols, and the first type of symbols are symbols not used for the first data transmission.

[0070] In conjunction with some embodiments of the third aspect, in some embodiments, the first type of symbols includes at least one of the following: synchronization signal block symbols, downlink symbols, probe reference signal symbols, and symbols indicating higher-layer signaling.

[0071] In conjunction with some embodiments of the third aspect, in some embodiments, the number of symbols transmitted in the first data transmission is the value of the first parameter.

[0072] In conjunction with some embodiments of the third aspect, in some embodiments, the first information further includes a fourth parameter, the fourth parameter indicating the number of repetitions of the first data transmission, the value of the fourth parameter being a positive integer greater than or equal to 1; the number of symbols in the first data transmission is the product of the first parameter and the fourth parameter.

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

[0074] In conjunction with some embodiments of the third aspect, in some embodiments, the processing module is further configured to determine second information based on the first information, the second information indicating the number of resource units (REs) in a physical resource block (PRB) for the first data transmission; determine third information based on the second information, the third information indicating the number of REs for the first data transmission; and determine a physical resource block (TBS) based on the third information.

[0075] In conjunction with some embodiments of the third aspect, in some embodiments, the processing module is further configured to: determine the second information based on the number of symbols in the first data transmission; determine the second information based on the number of symbols in the first data transmission and the number of a first class of symbols overlapping with the symbols in the first data transmission; wherein the first class of symbols includes at least one of the following: synchronization signal block symbols, downlink symbols, probe reference signal symbols, and symbols indicating higher-layer signaling.

[0076] In conjunction with some embodiments of the third aspect, in some embodiments, the processing module is further configured as one of the following:

[0077] N RE =min(N′·M,N′) RE )·n PRB ;

[0078] N RE =N′ RE ·n PRB ;

[0079] Where, N RE This represents the third piece of information, where N′ represents the number of time slots occupied by the first data transmission, M represents the maximum number of REs in an RB used for the first data transmission, and N′ RE Indicates the second piece of information, n PRB This indicates the number of PRBs transmitted in the first data transfer.

[0080] In conjunction with some embodiments of the third aspect, in some embodiments, the number of time slots occupied by the first data transmission is determined by the following expression: Where S represents the starting position of the symbol in the first data transmission, and L represents the number of symbols in the first data transmission. Indicates the number of symbols included in a time slot.

[0081] Fourthly, embodiments of this disclosure provide a communication device, comprising: a transceiver module configured to acquire fourth information, the fourth information including at least a first parameter and a second parameter, the second parameter indicating the number of first time-domain resources included in the first data transmission, the first parameter indicating the number of symbols in the first time-domain resources, the value of the first parameter being less than or equal to the number of symbols in a time slot; and a processing module configured to, starting from a starting symbol, determine a plurality of consecutive symbols as symbols for the first data transmission, or, starting from a starting symbol, determine a plurality of consecutive symbols satisfying a first condition as symbols for the first data transmission; wherein the number of symbols for the first data transmission is determined based on the first parameter and the second parameter, the first condition being that the symbols for the first data transmission do not overlap with a first type of symbols, the first type of symbols being symbols not used for the first data transmission.

[0082] In conjunction with some embodiments of the fourth aspect, in some embodiments, the first type of symbols includes at least one of the following: a synchronization signal block symbol, a downlink symbol, a probe reference signal symbol, and a symbol indicating higher-layer signaling.

[0083] In conjunction with some embodiments of the fourth aspect, in some embodiments, the number of symbols in the first data transmission is the product of the first parameter and the second parameter, the product being greater than the number of symbols in a time slot.

[0084] In conjunction with some embodiments of the fourth aspect, in some embodiments, the fourth information further includes a third parameter, the third parameter indicating the start symbol; or, Where S represents the third parameter, L represents the first parameter, and N represents the second parameter. N represents the number of symbols in a time slot. max This represents the maximum number of resources in the first time domain.

[0085] In conjunction with some embodiments of the fourth aspect, in some embodiments, the fourth information further includes a fourth parameter, the fourth parameter indicating the number of repetitions of the first data transmission, the value of the fourth parameter being a positive integer greater than or equal to 1; the number of symbols in the first data transmission is the product of the first parameter, the second parameter, and the fourth parameter.

[0086] In conjunction with some embodiments of the fourth aspect, in some embodiments, the processing module is further configured to determine the transport block size TBS of the transport block TB included in the first data transmission based on the fourth information; the transceiver module is further configured to transmit the TB on symbols of the first data transmission based on the TBS.

[0087] In conjunction with some embodiments of the fourth aspect, in some embodiments, the processing module is further configured to determine fifth information based on the fourth information, the fifth information indicating the number of resource units (REs) in a physical resource block (PRB) for the first data transmission; determine sixth information based on the fifth information, the sixth information indicating the number of REs for the first data transmission; and determine a physical resource block (TBS) based on the sixth information.

[0088] In conjunction with some embodiments of the fourth aspect, in some embodiments, the processing module is further configured to: determine the fifth information based on the number of symbols transmitted in the first data transmission; and determine the fifth information based on the number of symbols transmitted in the first data transmission and the number of first-class symbols that overlap with the symbols transmitted in the first data transmission.

[0089] In conjunction with some embodiments of the fourth aspect, in some embodiments, the sixth information is determined by one of the following expressions:

[0090] N RE =N·min(M,N′) RE )·n PRB ;

[0091] N RE =N·N′ RE ·n PRB ;

[0092] Where, N RE This represents the sixth information, N represents the second parameter, M represents the maximum number of REs used for the first data transmission in an RB, and N′ RE Indicates the fifth piece of information, n PRB This indicates the number of PRBs transmitted in the first data transfer.

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

[0094] In a sixth aspect, embodiments of this disclosure provide a communication system, including: a communication device configured to implement a communication method as described in the first or second aspect.

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

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

[0097] In a ninth aspect, embodiments of this disclosure provide a computer program that, when run on a computer, causes the computer to perform the method as described in an optional implementation of the first or second aspect.

[0098] 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 methods described in the optional implementations of the first or second aspects above.

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

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

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

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

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

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

[0105] In the embodiments of this disclosure, "multiple" refers to two or more.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0140] II. PUSCH mapping type

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

[0142] Table 1

[0143] III. PUSCH repetition type

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

[0145] 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 instructs the terminal device on the repetition number of the PUSCH, which is 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).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0168] V. TBS Calculation

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

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

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

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

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

[0174] 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 not less than N′. info The minimum value is taken as TBS. Table 2 shows N. info ≤3824 TBS.

[0175] Table 2

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

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

[0178] if in,

[0179] otherwise,

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

[0181] otherwise,

[0182] VI. Transmission Occasion (TO)

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

[0184] In some embodiments, for PUSCHs that support cross-slot transport block processing, the symbol allocation for each slot is the same, which reduces the flexibility of time-domain resource allocation, wastes some uplink resources, and thus affects uplink coverage performance.

[0185] This disclosure provides a communication method, communication device, communication system, storage medium, and program product. The communication device acquires first information, which includes at least a first parameter. The first parameter is used to determine the number of symbols in the first data transmission. The value of the first parameter is greater than the number of symbols in a time slot. Thus, by expanding the value range of the first parameter, this disclosure enables the time domain resources of the first data transmission to span multiple time slots, improving the flexibility of time domain resource allocation and enhancing the utilization and coverage performance of time domain resources.

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

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

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

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

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

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

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

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

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

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

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

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

[0198] In some embodiments, the first information indicates at least the number of symbols in the PUSCH.

[0199] In some embodiments, the first information also indicates at least one of the following: the start symbol of the PUSCH, the number of repetitions of the PUSCH, and the start time slot of the PUSCH.

[0200] In some embodiments, the first information includes at least a first parameter, which is used to determine the number of symbols in the PUSCH, and the value of the first parameter is greater than the number of symbols in a time slot.

[0201] In one example, the first parameter is represented by L, then in, The number of symbols in a time slot.

[0202] In some embodiments, the number of symbols in PUSCH is equal to the value of L, that is, PUSCH consists of L symbols.

[0203] In some embodiments, the value of L provided by the legacy protocol, as shown in Table 1, is less than or equal to 14, meaning the value of L is less than or equal to the number of symbols in a time slot. In other words, the L provided in this embodiment of the present disclosure, compared to L in the legacy protocol, raises the lower limit of L, allowing PUSCH time-domain resources to span multiple time slots and improving the flexibility of PUSCH time-domain resource allocation.

[0204] In some embodiments, the number of symbols in a PUSCH is less than or equal to the product of a first value and a second value, i.e., the value of L is less than or equal to the product of the first value and the second value. The first value indicates the maximum number of time slots a PUSCH can occupy, and the second value indicates the number of symbols within a single time slot. In other words, the first value indicates the maximum number of time slots a PUSCH can occupy, and the product of the first and second values ​​can be understood as the maximum number of symbols a PUSCH can occupy.

[0205] In one example, the first value is N′ max Indicates that the second value is... Indicate, then

[0206] In one example, the range of values ​​for L is:

[0207] In some embodiments, N′max It can be predefined or configured by the network device. In one example, the first value N′ max The first value N′ configured for the network device via the first information. max It is carried in the first piece of information. In one example, N′ max It can be equal to 16, 32, 64, 128, or 256.

[0208] In one example, the maximum number of symbols L occupied by PUSCH is no more than or Expressed as a formula or

[0209] In one example, the maximum number of time slots occupied by PUSCH is 16, 32, 64, 128, or 256, expressed by the formula: or

[0210] In some embodiments, the first information further includes at least one of the following: a third parameter, a fourth parameter, and a fifth parameter. The third parameter is used to determine the start symbol of the PUSCH, the fourth parameter indicates the number of repetitions of the PUSCH, and the fifth parameter is used to determine the start time slot of the PUSCH. In one example, the third parameter is represented by S, the fourth parameter by K, and the fifth parameter by k2.

[0211] In some embodiments, when the first information includes L and S, L and S satisfy the following conditions: or,

[0212] In some embodiments, when the first information includes L and S, L and S satisfy the following conditions:

[0213] In one example, or,

[0214] In one example, the maximum number of time slots occupied by PUSCH is 16, 32, 64, 128, or 256, expressed by the formula: or

[0215] In some embodiments, when the first information includes L and K, the number of symbols in the PUSCH is the product of L and K, that is, the PUSCH includes L×K symbols. Here, K is a positive integer greater than or equal to 1.

[0216] In some embodiments, the number of symbols L×K in PUSCH is less than or equal to the product of the first value and the second value, expressed by the formula:

[0217] In one example, the maximum number of symbols used by PUSCH, L×K, does not exceed [a certain value]. or Expressed as a formula or

[0218] In one example, the maximum number of time slots occupied by PUSCH is 16, 32, 64, 128, or 256, expressed by the formula: or

[0219] In some embodiments, when the first information includes L, S, and K, L, S, and K satisfy the following conditions: or,

[0220] In one example, the maximum number of time slots occupied by PUSCH is 16, 32, 64, 128, or 256, expressed by the formula: or

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

[0222] In some embodiments, when the first information includes k2, S, and L, the terminal determines the symbol of PUSCH based on k2, S, and L.

[0223] In some embodiments, the terminal determines L consecutive symbols as symbols for PUSCH, starting from the start position indicated by S in the time slot indicated by k2 (denoted as the physical symbol count).

[0224] In one example, Figure 3A is a schematic diagram of the time-domain resources of PUSCH determined based on the physical symbol count. As shown in Figure 3A, k2 indicates special time slot #2, S=2, that is, S indicates the third symbol, and L=30, that is, L indicates that the number of symbols in PUSCH is 30. Then, starting from the third symbol in special time slot #2, the terminal determines 30 consecutive symbols as PUSCH symbols, that is, the symbols of PUSCH include the third symbol in special time slot #2 to the fourth symbol in uplink time slot #4.

[0225] In some embodiments, the terminal, starting from the beginning position indicated by S in the time slot indicated by k2, determines L consecutive symbols that satisfy a first condition as PUSCH symbols, wherein the first condition is that the PUSCH symbols do not overlap with a first type of symbols. The first type of symbols are symbols not used for PUSCH (denoted as the available symbol count).

[0226] In some embodiments, the available symbol count can also be understood as starting from the starting position indicated by S in the time slot indicated by k2, traversing each symbol sequentially, and not determining the symbols that do not meet the first condition as PUSCH symbols.

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

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

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

[0230] In some embodiments, when the first data transmission is PUSCH, the first type of symbol includes at least one of the following: downlink symbol, SSB symbol, SRS symbol, symbol indicated by higher-layer signaling, etc.

[0231] In some embodiments, when the first data transmission is PDSCH, the first type of symbols includes at least one of the following: uplink symbols, symbols indicated by higher-layer signaling, etc.

[0232] In one example, Figure 3B is a schematic diagram of the time-domain resources of PUSCH determined based on the available symbol count. As shown in Figure 3B, k2 indicates special time slot #2, S=2, that is, S indicates the third symbol, and L=30, that is, L indicates that the number of PUSCH symbols is 30. Then, starting from the third symbol in special time slot #2, the terminal judges each symbol one by one. Since the third to eighth symbols and the eleventh symbol in special time slot #2 are first-class symbols, these symbols are not determined as PUSCH symbols. Instead, the ninth to tenth symbols, the twelfth to fourteenth symbols in special time slot #2, all symbols in uplink time slot #3, and the first to eleventh symbols in uplink time slot #4, a total of 30 symbols, are determined as PUSCH symbols.

[0233] In some embodiments, when the first information includes k2, S, L, and K, the terminal determines the symbol of PUSCH based on k2, S, L, and K.

[0234] In some embodiments, the method for determining the symbols of PUSCH based on k2, S, L, and K is similar to the physical symbol counting method described above, that is: the terminal determines L×K consecutive symbols as the symbols of PUSCH starting from the starting position indicated by S in the time slot indicated by k2.

[0235] In some embodiments, the method for determining the symbols of PUSCH based on k2, S, L, and K is similar to the available symbol counting method described above, that is: starting from the starting position indicated by S in the time slot indicated by k2, the terminal determines L×K consecutive symbols that satisfy the first condition as the symbols of PUSCH.

[0236] In some embodiments, when K>1, the PUSCH is transmitted K times in the time domain, with each repetition including the same number of symbols, i.e., each repetition includes L symbols, and all repetitions of the PUSCH include a total of L×K symbols. In other words, starting from the first symbol of the PUSCH, every L consecutive PUSCH symbols form a group, which can be divided into K groups in total. The symbols of each group of L PUSCH symbols are sequentially assigned to one PUSCH repetition.

[0237] In one example, Figure 3C is a schematic diagram of the time-domain resources for PUSCH repetition determined based on physical time slot counts. As shown in Figure 3C, k2 indicates special time slot #2, S=12, meaning S indicates the thirteenth symbol, L=30, meaning L indicates the number of symbols in one PUSCH repetition is 30, K=2, meaning PUSCH is repeated twice, and the total number of PUSCH symbols is 30×2=60. Therefore, starting from the thirteenth symbol in special time slot #2, the terminal identifies 60 consecutive symbols as PUSCH symbols, meaning the PUSCH symbols include the thirteenth symbol in special time slot #2 to the second symbol in special time slot #7. Specifically, the terminal identifies the thirteenth symbol in special time slot #2 to the fourteenth symbol in uplink time slot #4 as the first PUSCH repetition (i.e., PUSCH repetition #0 in the figure), and the terminal identifies the first symbol in downlink time slot #5 to the second symbol in special time slot #7 as the second PUSCH repetition (i.e., PUSCH repetition #1 in the figure).

[0238] In one example, Figure 3D is a schematic diagram of the time-domain resources for PUSCH repetition determined based on the available symbol count. As shown in Figure 3D, k2 indicates special time slot #2, S=12, meaning S indicates the thirteenth symbol, L=30, meaning L indicates the number of symbols in one PUSCH is 30, K=2, meaning PUSCH is repeated twice, and the total number of PUSCH symbols is 30×2=60. The terminal then starts judging each symbol from the thirteenth symbol in special time slot #2. Since all symbols in downlink time slot #5, all symbols in downlink time slot #6, and the first to twelfth symbols in special time slot #7 are Class I symbols, these symbols are not considered PUSCH symbols. Instead, the thirteenth symbol in special time slot #2 to the fourteenth symbol in uplink time slot #4, and the thirteenth symbol in special time slot #7 to the fourteenth symbol in uplink time slot #9, a total of 60 symbols, are determined as PUSCH symbols. Specifically, the terminal determines the thirteenth symbol in special time slot #2 to the fourteenth symbol in uplink time slot #4 as the first repetition of PUSCH (i.e., PUSCH repetition #0 in the figure), and the terminal determines the thirteenth symbol in special time slot #7 to the fourteenth symbol in uplink time slot #9 as the second repetition of PUSCH (i.e., PUSCH repetition #1 in the figure).

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

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

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

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

[0243] In some embodiments, the terminal determines second information based on first information, the second information indicating the number of REs used for PUSCH in a PRB. Based on the second information, it determines third information, the third information indicating the number of REs used for PUSCH. Based on the third information, it determines the TBS.

[0244] In some embodiments, the terminal determines the number of symbols for the PUSCH based on the first information, and determines the second information based on the number of symbols for the PUSCH.

[0245] In some embodiments, the terminal determines the number of symbols of PUSCH and the number of first-class symbols that overlap with the symbols of PUSCH based on the first information, and determines the second information based on the number of symbols of PUSCH and the number of first-class symbols that overlap with the symbols of PUSCH.

[0246] In some embodiments, the number of symbols in PUSCH is L, the number of first-class symbols overlapping with the symbols in PUSCH is L′, and L′ is the number of first-class symbols among the L symbols. The second information is represented by N′. RE This indicates that the third information is used for N. RE This indicates that the methods used by the terminal to determine the TBS include:

[0247] Method a: Determine the number of symbols to be allocated to PUSCH based on L. according to Determine N′ RE According to N′ RE Determine N RE According to N RE , determine TBS.

[0248] Method b: Determine the number of symbols to be assigned to PUSCH based on the difference between L and L′. according to Determine N′ RE According to N′ RE Determine N RE According to N RE , determine TBS.

[0249] In some embodiments, for method a and method b,

[0250] In some embodiments, for method a and method b, N RE =min(N′·M,N′) RE )·n PRB Or, N RE =N′ RE ·n PRB Where N′ represents the number of time slots occupied by PUSCH, M represents the maximum number of REs available for PUSCH in a RB, and n PRB This indicates the number of PRBs in the PUSCH. In some embodiments,

[0251] In some embodiments, for method a, In some embodiments, for method b,

[0252] In one example, as shown in Figure 3A, for method a, For method b,

[0253] In one example, as shown in Figure 3C, for method a, For method b,

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

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

[0256] In some embodiments, the network device and the terminal determine the TBS using the same method 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.

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

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

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

[0260] In some embodiments, when the symbols of PUSCH are determined based on the physical symbol count, if the symbols of PUSCH include first-class symbols, i.e. symbols not used for PUSCH, then the terminal does not transmit the TB carried by PUSCH on the first-class symbols.

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

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

[0263] In some embodiments, when the symbols of PUSCH are determined based on the physical symbol count, if the symbols of PUSCH include first-class symbols, i.e. symbols not used for PUSCH, then the network device does not receive the TB carried by PUSCH on the first-class symbols.

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

[0265] This disclosure also provides a communication method, communication device, communication system, storage medium, and program product. The communication device acquires fourth information, whereby the first information includes at least a first parameter and a second parameter. The second parameter indicates the number of first time-domain resources included in the first data transmission, and the first parameter indicates the number of symbols in the first time-domain resources. The value of the first parameter is less than or equal to the number of symbols within a time slot. The communication device determines the symbols for the first data transmission based on the first and second parameters. Thus, by introducing the second parameter, this disclosure proportionally expands the time-domain resources for the first data transmission, allowing them to span multiple time slots. Simultaneously, it allocates time-domain resources at the symbol granularity, improving the flexibility of time-domain resource allocation and enhancing the utilization and coverage performance of time-domain resources.

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

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

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

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

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

[0271] In step S2201, the network device sends the fourth information.

[0272] In some embodiments, the terminal receives fourth information.

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

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

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

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

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

[0278] In some embodiments, the fourth information indicates at least the number of symbols in the PUSCH.

[0279] In some embodiments, the fourth information indicates at least the number of first time-domain resources included in the PUSCH and the number of symbols in the first time-domain resources, the number of symbols in the PUSCH being determined based on the number of first time-domain resources and the number of symbols in the first time-domain resources.

[0280] In some embodiments, the fourth information also indicates at least one of the following: the start symbol of the PUSCH, the number of repetitions of the PUSCH, and the start time slot of the PUSCH.

[0281] In some embodiments, the fourth information includes at least a first parameter and a second parameter, wherein the second parameter indicates the number of first time-domain resources included in the PUSCH, the first parameter indicates the number of symbols in the first time-domain resources, the value of the first parameter is less than or equal to the number of symbols in a time slot, and the value of the second parameter is a positive integer greater than 1.

[0282] In one example, the first parameter is represented by L, and the second parameter is represented by N, then in, The number of symbols in a time slot.

[0283] In some embodiments, the number of symbols in a PUSCH is equal to the product of the first parameter and the second parameter, i.e., the number of symbols in a PUSCH is L×N. In some embodiments, the product of the first parameter and the second parameter, L×N, is greater than the number of symbols in a time slot.

[0284] In some embodiments, the first information further includes at least one of the following: a third parameter, a fourth parameter, and a fifth parameter. The third parameter is used to determine the start symbol of the PUSCH, the fourth parameter indicates the number of repetitions of the PUSCH, and the fifth parameter is used to determine the start time slot of the PUSCH. In one example, the third parameter is represented by S, the fourth parameter by K, and the fifth parameter by k2.

[0285] In some embodiments, when the fourth information includes L, N, and S, L, N, and S satisfy the following conditions: or, Where, N max N represents the maximum number of first-time-domain resources included in PUSCH, or in other words, the maximum number of first-time-domain resources that PUSCH can include. max It is the maximum value of N.

[0286] In some embodiments, N max It can be predefined or configured by the network device. In one example, N max N is configured for network devices through the first information. max It is carried in the first piece of information. In one example, N max It can be equal to 16, 32, 64, 128, or 256.

[0287] In one example, the maximum number of time slots occupied by PUSCH is 16, 32, 64, 128, or 256, expressed by the formula: or

[0288] In one example, the maximum number of time slots occupied by PUSCH is 16, 32, 64, 128, or 256, expressed by the formula: or

[0289] In one example, the maximum number of symbols L×N used by PUSCH is no more than or Expressed as a formula or

[0290] In some embodiments, when the fourth information includes L, N, and K, the number of symbols in the PUSCH is the product of L, N, and K, that is, the PUSCH includes L×N×K symbols. Here, K is a positive integer greater than or equal to 1.

[0291] In some embodiments, when the fourth information includes L, N, S, and K, L, N, S, and K satisfy the following conditions: or,

[0292] In one example, the maximum number of time slots occupied by PUSCH is 16, 32, 64, 128, or 256, expressed by the formula: or

[0293] In one example, the maximum number of symbols used by PUSCH, L×N×K, does not exceed [a certain value]. or Expressed as a formula or

[0294] In one example, the maximum number of time slots occupied by PUSCH is 16, 32, 64, 128, or 256, expressed by the formula: or

[0295] In step S2202, the terminal determines the symbol of PUSCH based on the fourth information.

[0296] In some embodiments, when the fourth information includes k2, S, N, and L, the terminal determines the symbol of PUSCH based on k2, S, N, and L.

[0297] In some embodiments, the terminal determines L×N consecutive symbols as symbols for PUSCH, starting from the start position indicated by S in the time slot indicated by k2 (denoted as physical symbol count).

[0298] In one example, Figure 3E is a schematic diagram of the time-domain resources of PUSCH determined based on physical symbol count. As shown in Figure 3E, k2 indicates special time slot #2, S=2, that is, S indicates the third symbol, N=6, that is, the number of first time-domain resources included in PUSCH is 6, L=5, that is, L indicates the number of symbols in the first time-domain resources is 5. Therefore, the number of symbols in PUSCH is 5×6=30. Then, starting from the third symbol in special time slot #2, the terminal determines 30 consecutive symbols as symbols for PUSCH, that is, the symbols of PUSCH include the third symbol in special time slot #2 to the fourth symbol in uplink time slot #4.

[0299] In some embodiments, the terminal, starting from the beginning position indicated by S in the time slot indicated by k2, determines L×N consecutive symbols that satisfy a first condition as PUSCH symbols, wherein the first condition is that the PUSCH symbols do not overlap with a first type of symbols. The first type of symbols are symbols not used for PUSCH (denoted as the available symbol count).

[0300] In some embodiments, the available symbol count can also be understood as starting from the starting position indicated by S in the time slot indicated by k2, traversing each symbol sequentially, and not determining the symbols that do not meet the first condition as PUSCH symbols.

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

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

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

[0304] In some embodiments, when the first data transmission is PUSCH, the first type of symbol includes at least one of the following: downlink symbol, SSB symbol, SRS symbol, symbol indicated by higher-layer signaling, etc.

[0305] In some embodiments, when the first data transmission is PDSCH, the first type of symbols includes at least one of the following: uplink symbols, symbols indicated by higher-layer signaling, etc.

[0306] In one example, Figure 3F is a schematic diagram of the time-domain resources of PUSCH determined based on the available symbol count. As shown in Figure 3F, k2 indicates special time slot #2, S=2, that is, S indicates the third symbol, N=6, that is, the number of first time-domain resources included in PUSCH is 6, L=5, that is, L indicates the number of symbols of the first time-domain resources is 5. Therefore, the number of symbols in PUSCH is 5×6=30. Then, starting from the third symbol in special time slot #2, the terminal judges each symbol one by one. Since the third to eighth symbols and the eleventh symbol in special time slot #2 are first-class symbols, these symbols are not determined as PUSCH symbols. Instead, the ninth to tenth symbols, the twelfth to fourteenth symbols in special time slot #2, all symbols in uplink time slot #3, and the first to eleventh symbols in uplink time slot #4, a total of 30 symbols, are determined as PUSCH symbols.

[0307] In some embodiments, when the first information includes k2, S, L, N, and K, the terminal determines the symbol of PUSCH based on k2, S, L, N, and K.

[0308] In some embodiments, the method for determining the symbols of PUSCH based on k2, S, L, N, and K is similar to the physical symbol counting method described above, that is: the terminal determines L×N×K consecutive symbols as the symbols of PUSCH, starting from the starting position indicated by S in the time slot indicated by k2.

[0309] In some embodiments, the method for determining the symbols of PUSCH based on k2, S, L, and K is similar to the available symbol counting method described above, that is: starting from the starting position indicated by S in the time slot indicated by k2, the terminal determines the symbols of PUSCH as L×N×K consecutive symbols that satisfy the first condition.

[0310] In some embodiments, when K>1, the PUSCH is transmitted K times in the time domain, with each repetition including the same number of symbols, i.e., each repetition includes L×N symbols, and all repetitions of the PUSCH include a total of L×N×K symbols. In other words, starting from the first symbol of the PUSCH, every L×N consecutive PUSCH symbols form a group, which can be divided into K groups in total. The symbols of each group of L×N PUSCHs are sequentially allocated to one PUSCH repetition.

[0311] In one example, Figure 3G is a schematic diagram of the time-domain resources for PUSCH repetition determined based on physical time slot counts. As shown in Figure 3G, k2 indicates special time slot #2, S=12, meaning S indicates the thirteenth symbol, N=6, meaning the number of first time-domain resources included in PUSCH is 6, L=5, meaning L indicates the number of symbols in the first time-domain resources is 5, and K=2, meaning PUSCH is repeated twice. Therefore, the total number of symbols in PUSCH is 5×6×2=60. The terminal then determines 60 consecutive symbols as PUSCH symbols, starting from the thirteenth symbol in special time slot #2. That is, the symbols in PUSCH include the thirteenth symbol in special time slot #2 to the second symbol in special time slot #7. Specifically, the terminal determines the thirteenth symbol in special time slot #2 to the fourteenth symbol in uplink time slot #4 as the first repetition of PUSCH (i.e., PUSCH repetition #0 in the figure), and the terminal determines the first symbol in downlink time slot #5 to the second symbol in special time slot #7 as the second repetition of PUSCH (i.e., PUSCH repetition #1 in the figure).

[0312] In one example, Figure 3H is a schematic diagram of the time-domain resources for PUSCH repetition determined based on the available symbol count. As shown in Figure 3H, k2 indicates special time slot #2, S=12, that is, S indicates the thirteenth symbol, N=6, that is, the number of first time-domain resources included in PUSCH is 6, L=5, that is, L indicates the number of symbols of the first time-domain resources is 5, K=2, that is, PUSCH is repeated 2 times, so the total number of PUSCH symbols is 5×6×2=60. Then the terminal starts from the thirteenth symbol in special time slot #2 and judges each symbol one by one. Since all symbols in downlink time slot #5, all symbols in downlink time slot #6, and the first to twelfth symbols in special time slot #7 are first-class symbols, these symbols are not determined as PUSCH symbols. Instead, the thirteenth symbol in special time slot #2 to the fourteenth symbol in uplink time slot #4, and the thirteenth symbol in special time slot #7 to the fourteenth symbol in uplink time slot #9, a total of 60 symbols, are determined as PUSCH symbols. Specifically, the terminal determines the thirteenth symbol in special time slot #2 to the fourteenth symbol in uplink time slot #4 as the first repetition of PUSCH (i.e., PUSCH repetition #0 in the figure), and the terminal determines the thirteenth symbol in special time slot #7 to the fourteenth symbol in uplink time slot #9 as the second repetition of PUSCH (i.e., PUSCH repetition #1 in the figure).

[0313] In step S2203, the network device determines the symbol of PUSCH based on the fourth information.

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

[0315] In some embodiments, step S2203 may be performed before step S2202 or simultaneously with step S2202.

[0316] In step S2204, the terminal determines the TBS of the TB carried by the PUSCH based on the fourth information.

[0317] In some embodiments, the terminal determines the fifth information N′ based on the fourth information. RE The fifth piece of information indicates the number of REs used for PUSCH in a PRB. According to the fifth piece of information N′ RE Determine the sixth information N RE The sixth information indicates the number of REs used for PUSCH. According to the sixth information N... RE , determine TBS.

[0318] In some embodiments, the terminal determines the number of symbols for the PUSCH based on the fourth information, and determines the fifth information N′ based on the number of symbols for the PUSCH. RE .

[0319] In some embodiments, the terminal determines the number of symbols for PUSCH and the number of first-class symbols overlapping with the symbols for PUSCH based on the fourth information, and determines the fifth information N′ based on the number of symbols for PUSCH and the number of first-class symbols overlapping with the symbols for PUSCH. RE .

[0320] In some embodiments, the method for a terminal to determine the TBS includes:

[0321] Method a: Determine the number of symbols to be allocated to PUSCH based on L. according to Determine N′ RE According to N′ RE Determine N RE According to N RE Determine the TBS. Here, L represents the number of symbols in the first time-domain resource.

[0322] Method b: Determine the number of symbols to be assigned to PUSCH based on the difference between L and L′. according to Determine N′ RE According to N′ RE Determine N RE According to N REDetermine the TBS. Here, L represents the number of symbols in the first time-domain resource, and L′ represents the number of first-class symbols among the L symbols.

[0323] In some embodiments, for method a and method b,

[0324] In some embodiments, for method a and method b, N RE =N·min(M,N′) RE )·n PRB Or, N RE =N·N′ RE ·n PRB Where N represents the number of first-time-domain resources included in PUSCH, M represents the maximum number of REs available for PUSCH in a RB, and n PRB This indicates the number of PRBs in PUSCH.

[0325] In some embodiments, for method a, In some embodiments, for method b,

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

[0327] In step S2205, the network device determines the TBS of the TB carried by the PUSCH based on the fourth information.

[0328] In some embodiments, the network device and the terminal determine the TBS using the same method 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.

[0329] In some embodiments, step S2205 may be executed before step S2204, simultaneously with step S2203, or simultaneously with step S2204.

[0330] In step S2206, the terminal sends TB on PUSCH based on TBS.

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

[0332] In some embodiments, when the symbols of PUSCH are determined based on the physical symbol count, if the symbols of PUSCH include first-class symbols, i.e. symbols not used for PUSCH, then the terminal does not transmit the TB carried by PUSCH on the first-class symbols.

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

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

[0335] In some embodiments, when the symbols of PUSCH are determined based on the physical symbol count, if the symbols of PUSCH include first-class symbols, i.e. symbols not used for PUSCH, then the network device does not receive the TB carried by PUSCH on the first-class symbols.

[0336] The communication method involved in the embodiments of this disclosure may include at least one of steps S2201 to S2206. For example, step S2201 may be implemented as a standalone embodiment. For example, step S2202 may be implemented as a standalone embodiment. For example, step S2203 may be implemented as a standalone embodiment. For example, step S2204 may be implemented as a standalone embodiment. For example, step S2205 may be implemented as a standalone embodiment. For example, step S2206 may be implemented as a standalone embodiment. For example, steps S2202 and S2204 may be combined as a standalone embodiment. For example, steps S2201, S2202, S2204, and S2206 may be combined as a standalone embodiment. For example, steps S2201, S2203, S2205, and S2206 may be combined as a standalone embodiment.

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

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

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

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

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

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

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

[0344] Figure 4A is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure. As shown in Figure 4A, the communication method includes step S4101.

[0345] In step S4101, the network device sends the first information.

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

[0347] In some embodiments, the first information includes at least a first parameter, which is used to determine the number of symbols in the first data transmission, and the value of the first parameter is greater than the number of symbols in a time slot.

[0348] In some embodiments, the terminal may obtain the first information, and the network device may also obtain the first information.

[0349] The optional implementation of step S4101 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.

[0350] Figure 4B is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure. As shown in Figure 4B, the communication method includes steps S4201 to S4202.

[0351] In step S4201, the network device sends the fourth message.

[0352] In some embodiments, the fourth information includes at least a first parameter and a second parameter, wherein the second parameter indicates the number of first time-domain resources included in the first data transmission, the first parameter indicates the number of symbols in the first time-domain resources, and the value of the first parameter is less than or equal to the number of symbols in a time slot.

[0353] The optional implementation of step S4201 can be found in the optional implementation of step S2201 in Figure 2B and other related parts in the embodiments involved in Figure 2B, which will not be repeated here.

[0354] In step S4202, the terminal determines a series of consecutive symbols as symbols for the first data transmission, starting from the starting symbol; or, starting from the starting symbol, determines a series of consecutive symbols that satisfy the first condition as symbols for the first data transmission.

[0355] In some embodiments, the number of symbols in the first data transmission is determined based on the first parameter and the second parameter, wherein the first condition is that the symbols in the first data transmission do not overlap with a first type of symbols, and the first type of symbols are symbols not used for the first data transmission.

[0356] In some embodiments, the terminal may obtain the fourth information, and the network device may also obtain the fourth information.

[0357] In some embodiments, step S4202 may also be performed by a network device.

[0358] The optional implementation of step S4202 can be found in the optional implementation of step S2202 in Figure 2B and other related parts in the embodiments involved in Figure 2B, which will not be repeated here.

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

[0360] In some embodiments, Method 1: The time-domain resources of PUSCH include L×K symbols, where L represents the symbol length and K represents the number of repetitions of PUSCH. Then:

[0361] Indicates the number of symbols included in a time slot;

[0362] or

[0363] Where S is used to determine the starting symbol of the time-domain resources of PUSCH, that is, the starting symbol of the L symbols; N′ max The maximum number of symbols that can be represented by L is N′. max Each time slot.

[0364] In some embodiments, Method 2: The time-domain resources of PUSCH include L×N×K symbols, then,

[0365] or

[0366] Where N represents the scaling factor of the time-domain resources, N is an integer, N>1 or N≥1; N max This represents the maximum value of N.

[0367] In some embodiments, the symbols included in the time-domain resources of the PUSCH are determined by the following method: physical symbol counting, starting from the starting symbol and counting L×K consecutive symbols (Method 1) or L×N×K consecutive symbols (Method 2). Available symbols are counted. Starting from the starting symbol, each symbol is evaluated sequentially. If the symbol is a first-class symbol, it is not included in the L×K symbols (Method 1) or L×N×K symbols (Method 2); otherwise, it is included in the L×K symbols (Method 1) or L×N×K symbols (Method 2), until L×K symbols (Method 1) or L×N×K symbols (Method 2) are found.

[0368] In some embodiments, the first type of symbols includes at least one of the following: downlink symbols, SSB symbols, SRS symbols, and uplink rate-matching resource symbols. In some embodiments, the first type of symbols are configured by the network device via higher-layer signaling.

[0369] In some embodiments, the time-domain resources of a PUSCH include a maximum of 32, 64, 128, or 256 time slots. In some embodiments, the time-domain resources of a PUSCH include a maximum of [number missing]. or

[0370] In some embodiments, determining the TBS of a TB carried by a PUSCH includes the following methods:

[0371] Corresponding to method 1 above: Based on N RE =min(N′·M,N′) RE )·nPRB or N RE =N′ RE ·n PRB Determine TBS, where, This indicates the number of time slots for the time-domain resources of PUSCH.

[0372] Method a:

[0373] Method b: L′ represents the number of symbols of the first class among the L symbols.

[0374] Corresponding to method 2 above: based on N RE =N·min(M,N′) RE )·n PRB or N RE =N·N′ RE ·n PRB Determine TBS, where, Where M represents the maximum number of REs that can be used to transmit data in an RB, M = 156 or 168, or can be configured via higher-layer signaling.

[0375] In some embodiments, the terminal reports that the terminal device supports the above-described PUSCH transmission method.

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

[0377] In some embodiments, the first information is carried on the PUSCH, and the time domain resources of the PUSCH are the time domain resources of the PUSCH.

[0378] In some embodiments, the first information includes k2, which is used to determine the starting time slot of the time domain resources of PUSCH.

[0379] In some embodiments, the first information includes S, which is used to determine the start symbol of the PUSCH's time-domain resources in the start time slot. For example, S indicates the index of the start symbol of the PUSCH's time-domain resources in the start time slot; that is, the index of the start symbol of the PUSCH's time-domain resources in the start time slot is S.

[0380] In some embodiments, the first information includes L, which is used to determine the number of symbols in the time-domain resources of the PUSCH. For example, the time-domain resources of the PUSCH include L symbols. It should be understood that, for ease of description, this method is referred to as Method 1. Further optionally, S and L satisfy the following condition:

[0381] Indicates the number of symbols included in a time slot;

[0382] or

[0383] Where, N′ max The maximum number of symbols that can be represented by L is N′. max One time slot; for example, N′ max =16, 32, 64, 128, 256, etc.

[0384] In some embodiments, the first information includes N, which is used to determine the number of symbols in the time-domain resources of the PUSCH. N is an integer, N>1, or N≥1. For example, the time-domain resources of the PUSCH include L×N symbols. It should be understood that, for ease of description, this method is referred to as Method 2. Further optionally, S, L, and N satisfy the following conditions:

[0385] or Where, N max This represents the maximum value of N, for example, N max =16, 32, 64, 128, 256, etc.

[0386] In some embodiments, comparing method 1 and method 2, it can be seen that method 1 expands the range of values ​​for L so that the time domain resources of PUSCH can span multiple time slots, while method 2 introduces N to proportionally expand the time domain resources of PUSCH so that the time domain resources of PUSCH can span multiple time slots.

[0387] In some embodiments, determining the symbols of the PUSCH time-domain resources based on k2, S, and L includes two possible methods: physical symbol counting, where the PUSCH time-domain resources consist of L consecutive symbols starting from the symbol indicated by S in the time slot indicated by k2; and symbol counting, where each symbol is evaluated sequentially starting from the symbol indicated by S in the time slot indicated by k2. If the symbol is a first-class symbol, it is not included in the PUSCH time-domain resources; otherwise, it is included until the PUSCH time-domain resources include L symbols. It should be understood that the above method applies to method 1.

[0388] In some embodiments, the symbols of the PUSCH time-domain resources are determined according to k2, S, L, and N, including the following two possible methods: Physical symbol counting, where the PUSCH time-domain resources include L×N consecutive symbols starting from the symbol indicated by S in the time slot indicated by k2; or symbol counting, where each symbol is evaluated sequentially starting from the symbol indicated by S in the time slot indicated by k2. If the symbol is a first-class symbol, it is not included in the PUSCH time-domain resources; otherwise, it is included until the PUSCH time-domain resources include L×N symbols. It should be understood that the above method applies to method 2.

[0389] Optionally, the first information includes K, which indicates the number of times the PUSCH is repeated, where K>1 or K≥1. It should be understood that if the first information includes K and K>1, then the PUSCH is transmitted repeatedly in the time domain, and the time domain resources of the PUSCH are also repeated in the time domain, repeated K times, each time including the same number of symbols, i.e., L symbols (corresponding to method 1), or L×N symbols (corresponding to method 2).

[0390] In some embodiments, if the first information includes K, the symbols of the PUSCH time-domain resources are determined based on k2, S, L, and K, including the following two possible methods: Physical symbol counting, where the PUSCH time-domain resources include L×K consecutive symbols starting from the symbol indicated by S in the time slot indicated by k2. Available symbol counting: Starting from the symbol indicated by S in the time slot indicated by k2, each symbol is evaluated one by one. If the symbol is a first-class symbol, it is not included in the PUSCH time-domain resources; otherwise, it is included in the PUSCH time-domain resources, until the PUSCH time-domain resources include L×K symbols. It should be understood that the above methods apply to method 1.

[0391] In some embodiments, within the time-domain resources of a PUSCH, starting from the first symbol of the time-domain resources of a PUSCH, every L consecutive symbols are grouped together, and a total of K groups can be formed. Each group of L symbols is sequentially assigned to one PUSCH repetition. For example, in the time-domain resources of a PUSCH, the L consecutive symbols starting from the (k-1)×L+1th symbol (or, the symbol with index (k-1)×L) are assigned to the kth PUSCH repetition, where k = 1, 2, ..., K.

[0392] In some embodiments, if the first information includes K, the symbols of the PUSCH time-domain resources are determined based on k2, S, L, N, and K, including the following two possible methods: Physical symbol counting, where the PUSCH time-domain resources include a continuous L×N×K symbols starting from the symbol indicated by S in the time slot indicated by k2; or Symbol counting, where each symbol is evaluated sequentially starting from the symbol indicated by S in the time slot indicated by k2. If the symbol is a first-class symbol, it is not included in the PUSCH time-domain resources; otherwise, it is included until the PUSCH time-domain resources include L×N×K symbols. It should be understood that the above method applies to method 2.

[0393] In some embodiments, within the time-domain resources of a PUSCH, starting from the first symbol of the time-domain resources of a PUSCH, every consecutive L×N symbols are grouped together, for a total of K groups. Each group of L×N symbols is sequentially assigned to one PUSCH repetition. For example, in the time-domain resources of a PUSCH, the consecutive L×N symbols starting from the (k-1)×L×N+1th symbol (or, the symbol with index (k-1)×L×N) are assigned to the kth PUSCH repetition, where k = 1, 2, ..., K.

[0394] In some embodiments, the time-domain resources of the PUSCH include a maximum of 32, 64, 128, or 256 time slots. For example, in method 1, 64, 128, or 256; for method 2, 64, 128, or 256.

[0395] In some embodiments, the number of symbols included in the time-domain resources of PUSCH shall not exceed a maximum of 1. or For example, for method 1, or For example, for method 2, or For example, suppose For method 1, L×K≤448,896,1792 or 3854; for method 2, L×N×K≤448,896,1792 or 3854.

[0396] In some embodiments, for method 1, the calculation method of TBS includes: based on N RE =min(N′·M,N′) RE )·n PRB or N RE =N′ RE ·n PRB Determine TBS, where This indicates the number of time slots for the time-domain resources of PUSCH.

[0397] Method a:

[0398] Method b: L′ represents the number of first-class symbols among the L symbols. It should be understood that subtracting the number of first-class symbols in method b makes the TBS calculation more accurate.

[0399] In some embodiments, M represents the maximum number of REs that an RB can include for transmitting data, M = 156, 168, or can be configured via higher-layer signaling.

[0400] Optionally, for method 2, the calculation method for TBS includes: based on N RE =N·min(M,N′) RE )·n PRB or N RE =N·N′ RE ·n PRB Determine TBS, It should be understood that the definition of M is the same as above.

[0401] 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 according to the time-domain resources of the PUSCH, 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 according to the time-domain resources of the PUSCH. Step 2-3: The network device determines the first TB according to the first signal and the first TBS.

[0402] In some embodiments, the network device and the terminal device determine the time-domain resources of the PUSCH and the first TBS in the same way.

[0403] In some embodiments, the time-domain resources of the PUSCH are 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 time-domain resources of the PUSCH. For example, according to some collision criteria, the time-domain resources of the PUSCH that are in conflict cannot be used to transmit the first signal.

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

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

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

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

[0408] Figure 5 is a schematic diagram of the structure of a communication device proposed in an embodiment of this disclosure. As shown in Figure 5, the communication device 5100 may include a transceiver module 5101. In some embodiments, the transceiver module 5101 is configured to acquire first information, the first information including at least a first parameter, the first parameter being used to determine the number of symbols in the first data transmission, and the value of the first parameter being greater than the number of symbols in a time slot.

[0409] In some embodiments, the transceiver module 5101 is configured to receive fourth information, the fourth information including at least a first parameter and a second parameter, the second parameter indicating the number of first time-domain resources included in the first data transmission, the first parameter indicating the number of symbols in the first time-domain resources, and the value of the first parameter being less than or equal to the number of symbols in a time slot.

[0410] In some embodiments, the communication device may further include: a processing module 5102, configured to determine a plurality of consecutive symbols as symbols for the first data transmission, starting from a start symbol, or to determine a plurality of consecutive symbols satisfying a first condition as symbols for the first data transmission, starting from a start symbol; wherein the number of symbols for the first data transmission is determined according to the first parameter and the second parameter, the first condition being that the symbols for the first data transmission do not overlap with a first type of symbols, the first type of symbols being symbols not used for the first data transmission.

[0411] In some embodiments, the communication device 5100 may be a terminal or network device as shown in the embodiment of FIG2A. In some embodiments, the communication device 5100 may be a terminal or network device as shown in the embodiment of FIG2B.

[0412] Figure 6 is a schematic diagram of the structure of a communication device provided according to an embodiment of the present disclosure. The communication device 6100 may be a terminal or a network device, or it may be a chip, chip system, or processor that supports the terminal or network device in implementing any of the above methods. The communication device 6100 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.

[0413] As shown in Figure 6, the communication device 6100 includes one or more processors 6101. The processor 6101 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 6100 can be used to execute any of the above methods. Optionally, one or more processors 6101 can be used to invoke instructions to cause the communication device 6100 to execute any of the above methods.

[0414] In some embodiments, the communication device 6100 further includes one or more transceivers 6102. When the communication device 6100 includes one or more transceivers 6102, the transceiver 6102 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 6101 performs at least one of other steps (e.g., steps S2102, S2103, S2104, S2105, but not limited thereto). In optional embodiments, the transceiver 6102 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.

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

[0416] The communication device 6100 described in the above embodiments may be a network device or a terminal, but the scope of the communication device 6100 described in this disclosure is not limited thereto, and the structure of the communication device 6100 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.

[0417] Figure 7 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 6100 can be a chip or a chip system, please refer to the schematic diagram of the chip 7100 shown in Figure 7, but it is not limited thereto.

[0418] Chip 7100 includes one or more processors 7101. Chip 7100 is used to perform any of the above methods.

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

[0420] In some embodiments, the interface circuit 7102 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 7102 performing the communication steps such as sending and / or receiving in the above-described method refers, for example, to the interface circuit 7102 performing data interaction between the processor 7101, the chip 7100, the memory 7103, or the transceiver device. In some embodiments, the processor 7101 performs at least one of other steps (e.g., step S2102, step S2103, step S2104, step S2105, but not limited thereto).

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

[0422] This disclosure also proposes a storage medium storing instructions that, when executed on a communication device 6100, cause the communication device 6100 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.

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

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

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

[0426] 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 communication device, the method comprising: Obtain first information, the first information including at least a first parameter, the first parameter being used to determine the number of symbols in the first data transmission, the value of the first parameter being greater than the number of symbols in a time slot.

2. The method according to claim 1, wherein, The value of the first parameter is less than or equal to the product of the first value and the second value, the first value indicating the maximum number of time slots occupied by the first data transmission, and the second value indicating the number of symbols in one time slot.

3. The method according to claim 1 or 2, wherein, The first information also includes a third parameter, which indicates the starting position of the symbol of the first data transmission; or, Where S represents the third parameter, L represents the first parameter, and N′ max Indicates the first value. This indicates the second numerical value.

4. The method according to claim 3, wherein, The method further includes: Starting from the starting position indicated by the third parameter, L consecutive symbols are determined as the symbols for the first data transmission; Where L is the number of symbols transmitted in the first data transfer.

5. The method according to claim 3, wherein, The method further includes: Starting from the starting position indicated by the third parameter, L consecutive symbols that satisfy the first condition are determined as the symbols for the first data transmission; Where L is the number of symbols in the first data transmission, and the first condition is that the symbols in the first data transmission do not overlap with the first type of symbols, and the first type of symbols are symbols not used in the first data transmission.

6. The method according to claim 5, wherein, The first type of symbols includes at least one of the following: synchronization signal block symbols, downlink symbols, probe reference signal symbols, and symbols indicating higher-layer signaling.

7. The method according to any one of claims 1 to 6, wherein the number of symbols transmitted in the first data transmission is the value of the first parameter.

8. The method according to any one of claims 1 to 6, wherein, The first information also includes a fourth parameter, which indicates the number of times the first data transmission is repeated, and the value of the fourth parameter is a positive integer greater than or equal to 1; The number of symbols transmitted in the first data transmission is the product of the first parameter and the fourth parameter.

9. The method according to any one of claims 1 to 8, wherein, The communication device is a terminal, and the method further includes: Based on the first information, the terminal determines the transport block size TBS of the transport block TB included in the first data transmission; Based on the TBS, the terminal transmits the TB on the symbol of the first data transmission.

10. The method according to claim 9, wherein, The step of determining the TBS of the TB included in the first data transmission based on the first information includes: Based on the first information, second information is determined, which indicates the number of resource units (REs) in a physical resource block (PRB) used for the first data transmission. Based on the second information, third information is determined, the third information indicating the number of REs used for the first data transmission; Based on the aforementioned third information, TBS is determined.

11. The method according to claim 10, wherein, The determination of the second information based on the first information includes one of the following: The second information is determined based on the number of symbols transmitted in the first data transmission; The second information is determined based on the number of symbols transmitted in the first data transmission and the number of first-class symbols that overlap with the symbols transmitted in the first data transmission. The first type of symbols includes at least one of the following: synchronization signal block symbols, downlink symbols, probe reference signal symbols, and symbols indicating higher-layer signaling.

12. The method according to claim 10 or 11, wherein, The third information is determined by one of the following expressions: N RE =min(N′·M,N′) RE )·n PRB N RE =N′ RE ·n PRB ; Where, N RE This represents the third piece of information, where N′ represents the number of time slots occupied by the first data transmission, M represents the maximum number of REs in an RB used for the first data transmission, and N′ RE Indicates the second piece of information, n PRB This indicates the number of PRBs transmitted in the first data transfer.

13. The method according to claim 12, wherein, The number of time slots occupied by the first data transmission is determined by the following expression: Where S represents the starting position of the symbol in the first data transmission, and L represents the number of symbols in the first data transmission. Indicates the number of symbols included in a time slot.

14. A communication method, performed by a communication device, the method comprising: The fourth information is obtained, which includes at least a first parameter and a second parameter. The second parameter indicates the number of first time-domain resources included in the first data transmission, and the first parameter indicates the number of symbols in the first time-domain resources. The value of the first parameter is less than or equal to the number of symbols in one time slot. Starting from the start symbol, a series of consecutive symbols are determined as symbols for the first data transmission; or, starting from the start symbol, a series of consecutive symbols that satisfy the first condition are determined as symbols for the first data transmission. The number of symbols in the first data transmission is determined based on the first parameter and the second parameter. The first condition is that the symbols in the first data transmission do not overlap with the first type of symbols, and the first type of symbols are symbols not used in the first data transmission.

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

16. The method according to claim 14 or 15, wherein, The number of symbols transmitted in the first data transmission is the product of the first parameter and the second parameter, and the product is greater than the number of symbols in a time slot.

17. The method according to any one of claims 14 to 16, wherein, The fourth information also includes a third parameter, which indicates the start symbol; or, Where S represents the third parameter, L represents the first parameter, and N represents the second parameter. N represents the number of symbols in a time slot. max This represents the maximum number of resources in the first time domain.

18. The method according to any one of claims 14 to 17, wherein, The fourth information also includes a fourth parameter, which indicates the number of times the first data transmission is repeated, and the value of the fourth parameter is a positive integer greater than or equal to 1. The number of symbols transmitted in the first data transmission is the product of the first parameter, the second parameter, and the fourth parameter.

19. The method according to any one of claims 14 to 18, wherein, The communication device is a terminal, and the method further includes: Based on the fourth information, the terminal determines the transport block size TBS of the transport block TB included in the first data transmission; Based on the TBS, the terminal transmits the TB on the symbol of the first data transmission.

20. The method according to claim 19, wherein, The step of determining the TBS of the TB included in the first data transmission based on the fourth information includes: Based on the fourth information, a fifth information is determined, which indicates the number of resource units (REs) in a physical resource block (PRB) used for the first data transmission. Based on the fifth information, a sixth information is determined, the sixth information indicating the number of REs used for the first data transmission; Based on the sixth piece of information, TBS is determined.

21. The method according to claim 20, wherein, The determination of the fifth information based on the fourth information includes one of the following: The fifth information is determined based on the number of symbols transmitted in the first data transmission. The fifth information is determined based on the number of symbols transmitted in the first data transmission and the number of first-class symbols that overlap with the symbols transmitted in the first data transmission.

22. The method according to claim 20 or 21, wherein, The sixth piece of information is determined by one of the following expressions: N RE =N·min(M,N′) RE )·n PRB N RE =N·N′ RE ·n PRB ; Where, N RE This represents the sixth information, N represents the second parameter, M represents the maximum number of REs used for the first data transmission in an RB, and N′ RE Represents the fifth piece of information, n PRB This indicates the number of PRBs transmitted in the first data transfer.

23. A communication device configured to implement the communication method according to any one of claims 1 to 13, 14 to 22.

24. A communication system comprising a communication device configured to implement the method as described in any one of claims 1 to 13, 14 to 22.

25. A storage medium storing instructions that, when executed on a communication device, cause the communication device to perform a communication method as described in any one of 1 to 13, 14 to 22.

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

Images