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

Abstract

The present disclosure relates to a communication method, a communication device, a communication system, a storage medium, and a program product. The method comprises: a terminal receiving first information sent by a network device; on the basis of the first information, determining a time-domain resource allocation parameter of a physical uplink shared channel (PUSCH), wherein the time-domain resource allocation parameter comprises a first parameter, the first parameter indicates the total number of symbols from a start symbol of the first PUSCH transmission occasion to an end symbol of the last PUSCH transmission occasion, and the PUSCH is allocated to a plurality of slots; and on the basis of the time-domain resource allocation parameter, sending a first signal to the network device on the PUSCH. The method is conducive to improving the performance of a PUSCH.

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] 6th generation mobile communication technology (6 th 6G (5th generation mobile communication technology) is rapidly developing, inheriting and expanding the functions of 5G—New Radio (NR)—to bring higher speeds, lower latency, and greater connectivity to future communication networks. In 6G, the Physical Uplink Shared Channel (PUSCH) will play a crucial role. The PUSCH is a key wireless communication resource that allows user equipment (UE) to send data to the base station (BS). Improving PUSCH performance to enable 6G networks to meet higher user expectations and more complex application scenarios, ultimately achieving faster, smarter, and more reliable global communication connections, is a problem that needs to be solved.

[0003] Summary of the Invention

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

[0005] According to a first aspect of the present disclosure, a communication method is proposed, the method comprising: a terminal receiving first information sent by a network device; determining time-domain resource allocation parameters for a Physical Uplink Shared Channel (PUSCH) based on the first information, the time-domain resource allocation parameters including a first parameter indicating the total number of symbols from the start symbol of a first PUSCH transmission opportunity to the end symbol of a last PUSCH transmission opportunity, wherein the PUSCH is allocated across multiple time slots; and sending a first signal to the network device on the PUSCH based on the time-domain resource allocation parameters.

[0006] According to a second aspect of the present disclosure, a communication method is provided, the method comprising: a network device sending first information to a terminal, the first information being used by the terminal to determine time-domain resource allocation parameters for a Physical Uplink Shared Channel (PUSCH), the time-domain resource allocation parameters including a first parameter indicating the total number of symbols from the start symbol of a first PUSCH transmission opportunity to the end symbol of a last PUSCH transmission opportunity, wherein the PUSCH is allocated across multiple time slots; and receiving a first signal transmitted by the terminal on the PUSCH based on the time-domain resource allocation parameters.

[0007] According to a third aspect of the present disclosure, a communication device is provided for performing the communication method described in the first or second aspect.

[0008] According to a fourth aspect of the present disclosure, a communication system is provided, including a terminal and a network device, wherein the terminal is configured to implement the communication method described in the first aspect, and the network device is configured to implement the communication method described in the second aspect.

[0009] According to a fifth aspect of the present disclosure, a storage medium is provided that stores instructions that, when executed on a communication device, cause the communication method described in the first or second aspect to be performed.

[0010] According to a sixth aspect of the present disclosure, a program product is provided, comprising at least one of a program and instructions, wherein when the program or instructions are executed by a communication device, they implement the steps of the communication method described in the first or second aspect.

[0011] By adopting the above technical solution, at least the following beneficial technical effects can be achieved:

[0012] Based on the first information sent by the network device, the terminal can determine the time-domain resource allocation parameters, including the first parameter. Therefore, when the PUSCH is allocated across multiple time slots, the terminal can send a first signal to the network device on the PUSCH based on these time-domain resource allocation parameters, including the first parameter. Since the first parameter indicates the total number of symbols from the start symbol of the first PUSCH transmission to the end symbol of the last PUSCH transmission, its value is no longer limited by the total number of symbols within a single time slot. This means the value of the first parameter is more flexible, which will improve PUSCH performance. Attached Figure Description

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

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

[0015] Figure 1B is a schematic diagram of a single-slot PUSCH resource provided according to an embodiment of the present disclosure.

[0016] Figure 1C is a resource diagram corresponding to PUSCH repetition type A under a physical time slot count according to an embodiment of the present disclosure.

[0017] Figure 1D is a resource diagram corresponding to PUSCH repetition type A under available time slot count according to an embodiment of the present disclosure.

[0018] Figure 1E is a schematic diagram of resources corresponding to a PUSCH repeating type B according to an embodiment of the present disclosure.

[0019] Figure 1F is a resource diagram illustrating a combination of TBoMS and PUSCH repeating type A according to an embodiment of the present disclosure.

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

[0021] Figure 2B is a table showing the relationship between SLIV and the first and second parameters according to an embodiment of the present disclosure.

[0022] Figure 2C is a schematic diagram illustrating a first PUSCH transmission type under physical time slot counting according to an embodiment of the present disclosure.

[0023] Figure 2D is a schematic diagram illustrating a first PUSCH transmission type under available time slot count according to an embodiment of the present disclosure.

[0024] Figure 2E is a schematic diagram illustrating a second type of PUSCH transmission according to an embodiment of the present disclosure.

[0025] Figure 2F is a schematic diagram illustrating a third type of PUSCH transmission according to an embodiment of the present disclosure.

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

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

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

[0029] Figure 4 is a schematic diagram of the structure of a terminal according to an embodiment of the present disclosure.

[0030] Figure 5 is a schematic diagram of the structure of a network device according to an embodiment of the present disclosure.

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

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

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

[0034] In a first aspect, embodiments of this disclosure propose a communication method, the method comprising: a terminal receiving first information sent by a network device; determining time-domain resource allocation parameters for a Physical Uplink Shared Channel (PUSCH) based on the first information, the time-domain resource allocation parameters including a first parameter indicating the total number of symbols from the start symbol of the first PUSCH transmission opportunity to the end symbol of the last PUSCH transmission opportunity, wherein the PUSCH is allocated across multiple time slots; and sending a first signal to the network device on the PUSCH based on the time-domain resource allocation parameters.

[0035] In the above embodiments, the terminal can determine time-domain resource allocation parameters, including a first parameter, based on the first information sent by the network device. Then, when the PUSCH is allocated across multiple time slots, the terminal can send a first signal to the network device on the PUSCH based on the time-domain resource allocation parameters including the first parameter. Here, the first parameter is a newly defined time-domain resource allocation parameter. Since the first parameter indicates the total number of symbols from the start symbol of the first PUSCH transmission to the end symbol of the last PUSCH transmission, the value of the first parameter is no longer limited by the total number of symbols in a single time slot. That is, the value of the first parameter is more flexible, which will help improve PUSCH performance.

[0036] In conjunction with some embodiments of the first aspect, in some embodiments, a PUSCH transmission opportunity corresponds to all symbols allocated to the PUSCH within a time slot; or, a PUSCH transmission opportunity corresponds to a nominal repetition.

[0037] In the above embodiments, the definition of PUSCH transmission timing is specified.

[0038] In conjunction with some embodiments of the first aspect, in some embodiments, the upper limit of the value of the first parameter is greater than the total number of symbols in a time slot.

[0039] In the above embodiments, since the value of the first parameter is no longer restricted, for example, the value of the first parameter can be greater than 14 symbols, the value of the first parameter is more flexible. The more flexible value of the first parameter can improve the flexibility of PUSCH's time domain resource allocation (TDRA).

[0040] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information includes: determining a third parameter based on the first parameter, the second parameter, and the total number of symbols in a time slot; wherein the second parameter is indicated by the first information, the second parameter indicates the starting symbol of the PUSCH in a time slot or the first nominal repeat, and the third parameter indicates the number of symbols of the PUSCH in a time slot or the first nominal repeat.

[0041] In the above embodiments, if the third parameter can be determined by the first parameter, the second parameter, and the total number of symbols in a time slot, then the first information sent by the network device to the terminal may not indicate the third parameter, thereby reducing resource overhead.

[0042] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information includes: determining a fourth parameter based on the first parameter and the total number of symbols in a time slot, wherein the fourth parameter indicates the number of repeated transmissions.

[0043] In the above embodiments, if the fourth parameter can be determined by the first parameter and the total number of symbols in a time slot, then the first information sent by the network device to the terminal may not indicate the fourth parameter, thereby reducing the indication overhead of the network device.

[0044] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information includes: determining a fourth parameter based on the first parameter and a first condition, wherein the fourth parameter indicates the number of repeated transmissions, and the first condition includes determining the minimum value of |KL / K|, where L represents the first parameter and K represents the fourth parameter.

[0045] In the above embodiments, if the fourth parameter can be determined by the first parameter and the first condition, then the first information sent by the network device to the terminal may not indicate the fourth parameter, thereby reducing the indication overhead of the network device.

[0046] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information further includes: determining a third parameter based on the first parameter and the fourth parameter, wherein the third parameter indicates the number of symbols of the PUSCH within a time slot or a nominal repeat.

[0047] In the above embodiments, if the third parameter can be determined by the first parameter and the fourth parameter, then the first information sent by the network device to the terminal may not indicate the third parameter, thereby reducing the overhead of indication resources.

[0048] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information includes: determining a fourth parameter based on the first parameter and the third parameter, wherein the third parameter is indicated by the first information, the third parameter indicates the number of symbols of the PUSCH within a time slot or a nominal repetition, and the fourth parameter indicates the number of repetitions.

[0049] In the above embodiments, if the fourth parameter can be determined by the first parameter and the third parameter, then the first information sent by the network device to the terminal may not indicate the fourth parameter, thereby reducing the indication overhead of the network device.

[0050] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information includes:

[0051] The third parameter is determined based on the first parameter and the fourth parameter, wherein the fourth parameter is indicated by the first information, the fourth parameter indicates the number of repeated transmissions, and the third parameter indicates the number of symbols in a time slot or a nominal repeat of the PUSCH.

[0052] In the above embodiments, if the third parameter can be determined by the first parameter and the fourth parameter, then the first information sent by the network device to the terminal may not indicate the third parameter, thereby reducing the overhead of indication resources.

[0053] In conjunction with some embodiments of the first aspect, in some embodiments, the first information indicates a fifth parameter, which is used to indicate the first parameter and the second parameter, the second parameter being used to indicate the start symbol of the PUSCH within a time slot or the first nominal repetition, wherein the fifth parameter is calculated in the following manner: In the case of, according to The fifth parameter is calculated, where L represents the first parameter, L maxThis indicates the upper limit of the value that the first parameter can take. The total number of symbols in a time slot is represented by SLIV, which represents the fifth parameter, and S represents the second parameter; in In the case of, according to The fifth parameter is calculated.

[0054] In the above embodiments, the network device enables the terminal to determine both the first and second parameters by indicating a fifth parameter. This reduces the overhead of indicating one parameter.

[0055] In conjunction with some embodiments of the first aspect, in some embodiments, sending a first signal to the network device on the PUSCH based on the time-domain resource allocation parameters includes: determining time-domain resources according to the time-domain resource allocation parameters; determining the transport block size (TBS) according to the third parameter; and sending the first signal to the network device on the PUSCH based on the time-domain resources and the TBS.

[0056] In the above embodiments, when the network device indicates a newly defined first parameter to the terminal, the terminal can calculate the transport block size based on the newly defined first parameter. This facilitates the terminal sending a first signal to the network device on the PUSCH according to the time domain resources and the transport block size.

[0057] Secondly, embodiments of this disclosure propose a communication method, the method comprising: a network device sending first information to a terminal, the first information being used by the terminal to determine time-domain resource allocation parameters for a Physical Uplink Shared Channel (PUSCH), the time-domain resource allocation parameters including a first parameter indicating the total number of symbols from the start symbol of the first PUSCH transmission opportunity to the end symbol of the last PUSCH transmission opportunity, wherein the PUSCH is allocated across multiple time slots; and receiving a first signal transmitted by the terminal on the PUSCH based on the time-domain resource allocation parameters.

[0058] In conjunction with some embodiments of the second aspect, in some embodiments, a PUSCH transmission opportunity corresponds to all symbols allocated to the PUSCH within a time slot; or, a PUSCH transmission opportunity corresponds to a nominal repetition.

[0059] In conjunction with some embodiments of the second aspect, in some embodiments, the upper limit of the value of the first parameter is greater than the total number of symbols in a time slot.

[0060] In conjunction with some embodiments of the second aspect, in some embodiments, the first information indicates a second parameter, the second parameter being used to indicate the start symbol of a PUSCH within a time slot or the first nominal repetition, the method further comprising:

[0061] A third parameter is determined based on the first parameter, the second parameter, and the total number of symbols in a time slot. The third parameter indicates the number of symbols in a time slot or a nominal repeat of a PUSCH.

[0062] In some embodiments, in conjunction with the second aspect, the method further includes: determining a fourth parameter based on the first parameter and the total number of symbols in a time slot, the fourth parameter indicating the number of repeated transmissions.

[0063] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes: determining a fourth parameter based on the first parameter and a first condition, the fourth parameter indicating the number of repeated transmissions, the first condition including determining the minimum value of |KL / K|, where L represents the first parameter and K represents the fourth parameter.

[0064] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes: determining a third parameter based on the first parameter and the fourth parameter, the third parameter indicating the number of symbols in a time slot or a nominal repeat within a PUSCH.

[0065] In conjunction with some embodiments of the second aspect, in some embodiments, the first information indicates a third parameter, the third parameter being used to indicate the number of symbols in a time slot or a nominal repeat within a PUSCH, the method further comprising: determining a fourth parameter based on the first parameter and the third parameter, wherein the fourth parameter indicates the number of repeated transmissions.

[0066] In conjunction with some embodiments of the second aspect, in some embodiments, the first information indicates a fourth parameter, the fourth parameter indicating the number of repeated transmissions, and the method further includes: determining a third parameter based on the first parameter and the fourth parameter, wherein the third parameter indicates the number of symbols in a time slot or a nominal repeat within a PUSCH.

[0067] In conjunction with some embodiments of the second aspect, in some embodiments, the first information indicates a fifth parameter, the fifth parameter being used to indicate the first parameter and the second parameter, the second parameter being used to indicate the start symbol of the PUSCH within a time slot or the first nominal repetition, the method further comprising:

[0068] exist In the case of, according to The fifth parameter is calculated, where L represents the first parameter, L max This indicates the upper limit of the value that the first parameter can take. The total number of symbols in a time slot is represented by SLIV, which represents the fifth parameter, and S represents the second parameter; in In the case of, according to The fifth parameter is calculated.

[0069] In conjunction with some embodiments of the second aspect, in some embodiments, receiving the first signal sent by the terminal on the PUSCH based on the time-domain resource allocation parameters includes: determining time-domain resources according to the time-domain resource allocation parameters; determining the transport block size (TBS) according to the third parameter; receiving the first signal on the time-domain resources; and parsing the first signal according to the TBS.

[0070] Thirdly, embodiments of this disclosure provide a communication device for performing the communication method described in the first or second aspect.

[0071] Fourthly, embodiments of this disclosure propose a terminal, which includes at least one of a transceiver module and a processing module; wherein the terminal is used to execute an optional implementation of the first aspect.

[0072] Fifthly, embodiments of this disclosure provide a network device, which includes at least one of a transceiver module and a processing module; wherein the network device is used to perform an optional implementation of the second aspect.

[0073] In a sixth aspect, embodiments of this disclosure provide a terminal, which includes one or more processors; wherein the terminal is used to execute an optional implementation of the first aspect.

[0074] In a seventh aspect, embodiments of this disclosure provide a network device comprising: one or more processors; wherein the network device is configured to perform an optional implementation of the second aspect.

[0075] Eighthly, embodiments of this disclosure provide a communication system comprising: a terminal and a network device; wherein the terminal is configured to perform the method described in the optional implementation of the first aspect, and the network device is configured to perform the method described in the optional implementation of the second aspect.

[0076] Ninthly, embodiments of this disclosure provide a storage medium storing instructions that, when executed on a communication device, cause the communication device to perform the method as described in the optional implementations of the first and second aspects.

[0077] In a tenth aspect, embodiments of this disclosure provide a program product, including at least one of a program and instructions, which, when executed by a communication device, causes the communication device to perform the method as described in the optional implementations of the first and second aspects.

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

[0079] In a twelfth 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 according to optional implementations of the first and second aspects above.

[0080] It is understood that the aforementioned communication devices, communication systems, storage media, program products, etc., are all used to execute the communication 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.

[0081] 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, information processing method, uplink transmission method, etc., can be used interchangeably.

[0082] 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. In all embodiments of this disclosure, unless otherwise specified or logically conflicting, the terminology and / or descriptions between the embodiments are consistent and can be mutually referenced. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

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

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

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

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

[0087] 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 whether there is a branch B); in some embodiments, B (execute B regardless of whether there is a branch A); in some embodiments, execution is selected from A and B (A and B are selectively executed); in some embodiments, both A and B are executed. The same applies when there are more branches such as A, B, C, etc.

[0088] In some embodiments, the notation "A or B" may include the following technical solutions, depending on the situation: in some embodiments, A (execute A regardless of whether a branch B exists); in some embodiments, B (execute B regardless of whether a branch A exists); 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, and C.

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

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

[0091] In some embodiments, terms such as "time / frequency" and "time-frequency domain" refer to the time domain and / or frequency domain.

[0092] In some embodiments, terms such as “in response to…”, “in response to determining…”, “in the case of…”, “when…”, “when…”, “if…”, etc. can be used interchangeably. These descriptions all refer to the device making a corresponding action under certain objective circumstances. They do not necessarily limit the time, nor do they require the device to make a judgment action when implementing it, nor do they mean that there must be other limitations.

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

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

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

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

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

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

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

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

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

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

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

[0104] In some embodiments, terminal 101 includes, for example, 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, but is not limited thereto.

[0105] In some embodiments, network device 102 may include at least one of access network device and core network device.

[0106] In some embodiments, the access network device is, for example, a node or device that connects a terminal to a wireless network. The access network device may include at least one of the following in a 5G communication system: evolved Node B (eNB), next-generation eNB (ng-eNB), next-generation Node B (gNB), node B (NB), home node B (HNB), home evolved node B (HeNB), radio 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, but is not limited thereto.

[0107] In some embodiments, network device 102 is a base station. Optionally, a base station may be, for example, a macro base station, micro base station (also called a small station), relay station, access point, 5 / 6G base station or future base station, satellite, Transmitting and Receiving Point (TRP), Transmitting Point (TP), mobile switching center, or other equipment that performs base station functions in a communication system, etc., and this disclosure does not specifically limit this type of device. For ease of description, in all embodiments of this disclosure, the apparatus that provides wireless communication functions for terminal devices is collectively referred to as a network device or base station.

[0108] In some embodiments, network device 102 is a core network device. Optionally, the core network device can be a single device, including a first network element, a second network element, etc., or it can be multiple devices or a group of devices, each including all or part of the first network element, the second network element, etc. Network elements can be virtual or physical. The core network includes, for example, at least one of the Evolved Packet Core (EPC), 5G Core Network (5GCN), and Next Generation Core (NGC).

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

[0110] In some embodiments, the access network device may be composed of a central unit (CU) and a distributed unit (DU). The CU may also be called a control unit. The CU-DU structure can separate the protocol layer of the access 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 and centrally controlled by the CU. However, this is not the only possibility.

[0111] 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 proposed 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 proposed in this disclosure are also applicable to similar technical problems.

[0112] 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. Each main body may be physical or virtual. 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.

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

[0114] In some embodiments, during the development of 6G networks, the International Telecommunication Union (ITU) has defined a series of performance indicators to guide and evaluate the performance of 6G technology. Among these, the performance indicators for 6G PUSCH include the following:

[0115] Peak uplink rate: The 6G PUSCH is expected to support a peak uplink rate of 500Gbps. This metric reflects the high data transmission rate requirements of 6G to support large-scale data transmission and high-bandwidth applications.

[0116] Uplink latency: The goal of 6G is to reduce uplink latency to less than 0.5 milliseconds to support real-time applications and low-latency communication. This metric requires the PUSCH to maintain extremely low latency during data transmission.

[0117] Device connections per square kilometer: 6G PUSCH needs to support 10 million device connections per square kilometer. This indicates that 6G networks will maintain stable uplink performance even with extremely high connection density.

[0118] Spectrum bandwidth: The 6G PUSCH will support spectrum bandwidths exceeding 100GHz. This wider bandwidth can provide greater data transmission capacity and improve spectrum utilization efficiency.

[0119] Energy consumption per bit: The energy efficiency target for 6G PUSCH is to reduce energy consumption per bit of data transmission by more than 10 times. This means that PUSCH will have higher energy efficiency at high data transmission rates, supporting the goal of green networks.

[0120] Resource scheduling granularity: 6G PUSCH will support finer-grained dynamic resource allocation, capable of adjusting resource allocation based on real-time network load and user demand. This will include flexible time slot allocation and spectrum allocation mechanisms.

[0121] These metrics not only drive technological innovation but also provide clear direction for future 6G networks. By continuously improving PUSCH performance, 6G networks will be able to meet higher user expectations and more complex application scenarios, ultimately achieving faster, smarter, and more reliable global communication connections.

[0122] In some embodiments, 5G NR PUSCH time-domain resource allocation includes: the network device scheduling the terminal device to send PUSCH. For example, the network device notifies the terminal device of time-domain resource allocation parameters for sending PUSCH. These parameters include: the time slot for sending PUSCH, the start symbol of PUSCH within the time slot, and the number of symbols for PUSCH. The symbols of PUSCH are contiguous in the time domain. Based on these parameters, the terminal device can uniquely determine the time-domain resources for sending PUSCH, and the network device will receive the PUSCH sent by the terminal device on those time-domain resources.

[0123] In some embodiments, the network device notifies the terminal device of the slot offset (k2), start symbol (S), and allocation length (L) within a slot or a nominal repetition for sending the PUSCH. k2 determines the slot for sending the PUSCH, S determines the start symbol, and L determines the number of symbols in the PUSCH. Additionally, in some cases (e.g., PUSCH mapping type A), S and L can be replaced with a start and length indicator value (SLIV). SLIV is determined based on S and L, using the following method: if (L-1)≤7, then SLIV=14×(L-1)+S; otherwise, SLIV=14×(14-L+1)+(14-1-S), where 0 ≤ 1 ≤ 7. <L≤14-S。

[0124] The following example uses Figure 1B. In Figure 1B, all symbols in the uplink slot are uplink symbols. In the special slot, the first 8 symbols are downlink symbols, the last 2 symbols are uplink symbols, and the remaining symbols are flexible symbols. Referring to Figure 1B, assuming that k2 indicates the slot for sending PUSCH is slot #3 in Figure 1B, S indicates that the starting symbol of PUSCH is the 3rd symbol in the slot (i.e., S=2, where S is the symbol index of the starting symbol in a slot, and the symbol index starts counting from 0; if the symbol index is 0, it corresponds to the first symbol in the slot, and so on, until the last symbol of the slot), and L indicates that the number of symbols for PUSCH is 10 (i.e., L=10), then the time domain resource allocation of PUSCH is the 10 consecutive symbols starting from the 3rd symbol in slot #3, as shown in Figure 1B.

[0125] In some embodiments, 5G NR PUSCH can support two mapping types:

[0126] The first type is PUSCH mapping type A: only the starting symbol of PUSCH is allowed to be the first symbol of the time slot, and the time domain resources of PUSCH are not allowed to cross the time slot boundary.

[0127] The second type is PUSCH mapping type B: This allows the starting symbol of a PUSCH to be any symbol within the time slot. For PUSCH repetition type A, time-domain resources of a PUSCH are not allowed to cross time slot boundaries; for PUSCH repetition type B, time-domain resources of a PUSCH are allowed to cross time slot boundaries, but cannot cross two consecutive time slot boundaries.

[0128] It should be noted that the two mapping types have different restrictions on S and L, as well as S+L, as shown in Table 1 below.

[0129] Table 1

[0130] For example, referring to Table 1, in the case of a normal cyclic prefix, PUSCH mapping type A only allows the starting symbol of PUSCH to be the first symbol in the time slot, i.e., S = 0. PUSCH mapping type A restricts the value range of L to 4 to 14. PUSCH mapping type A restricts the value range of S+L to 4 to 14.

[0131] In some embodiments, 5G NR PUSCH supports repetition transmission, including two repetition types: PUSCH repetition type A and PUSCH repetition type B.

[0132] In this context, PUSCH repetition type A is used when the network device configures the terminal device's PUSCH repetition type to A via higher-layer parameters. The terminal device then sends PUSCH using PUSCH repetition type A. The network device instructs the terminal device on the repetition number, K. These K repetitions are sequentially allocated across K time slots, with each time slot using the same symbol allocation, determined by S and L (or SLIV). The determination of the K time slots is achieved using two methods: physical time slot counting and available time slot counting, as detailed below:

[0133] Physical time slot count: K consecutive time slots are determined starting from the time slot indicated by k2. It should be noted that, due to the conflict criteria defined by 5G NR, 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 or synchronization signal blocks (SSBs), then PUSCH cannot be transmitted in that time slot.

[0134] Available slot count: If the symbols indicated by S and L (or SLIV) in a slot include downlink symbols or SSBs, then the slot cannot be used to send PUSCH; otherwise, the slot can be used to send. According to the above criteria, starting from the slot indicated by k2, each slot is judged one by one until K slots that can be used to send PUSCH are found.

[0135] The following examples use Figures 1C and 1D as examples. In Figures 1C and 1D, slots #5 and #6 are downlink slots. All symbols in a downlink slot are downlink symbols, and all symbols in an uplink slot are uplink symbols. In a special slot, the first 8 symbols are downlink symbols, the last 2 are uplink symbols, and the remaining symbols are flexible symbols. Referring to Figures 1C and 1D, assume that Figures 1C and 1D give a PUSCH repetition type A, and assume that k2, S, and L are consistent with Figure 1B, and K = 4. As shown in Figure 1C, using physical time slot counting, 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 and SSB 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 not in time slots #5 and #6. As shown in Figure 1D, using available time slot counting, assuming k2, S, and L are the same as in Figure 1B, and K = 4. Starting from time slot #3, the first four time slots where the symbols indicated by S and L (or SLIV) do not include downlink symbols and SSB symbols are time slots #3, #4, #8, and #9, respectively. Therefore, the terminal device will send PUSCH in these four time slots.

[0136] PUSCH Repetition Type B: When a network device configures the PUSCH repetition type of a terminal device to PUSCH repetition type B through higher-layer parameters, the terminal device sends PUSCH using PUSCH repetition type B; the network device will indicate the repetition count K to the terminal device. The time-domain resource allocation for PUSCH repetition type B consists of two steps: the first step is to determine the nominal repetition, and the second step is to determine the actual repetition, as detailed below:

[0137] Nominal repetition: The number of nominal repetitions is K. Each nominal repetition consists of 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.

[0138] Actual repetition: A nominal repetition includes at least one actual repetition. Each actual repetition is a consecutive set of all potentially valid symbols available for PUSCH transmission within a time slot. Potentially valid symbols are symbols other than invalid symbols. Invalid symbols include downlink symbols, SSB symbols, symbols indicated by higher-layer signaling, etc. If an actual repetition includes only one symbol, it is ignored.

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

[0140] The following example uses Figure 1E. In Figure 1E, all symbols in the uplink slot are uplink symbols. In the special slot, the first 8 symbols are downlink symbols, the last 2 are uplink symbols, and the remaining symbols are flexible symbols. Referring to Figure 1E, assume that Figure 1E gives a PUSCH repetition type B, where k2 indicates slot #3 in Figure 1E, S=12, L=4, K=4. As shown in Figure 1E, the PUSCH includes 4 nominal repetitions, each of which includes 4 symbols. The 4 nominal repetitions are consecutive in the time domain. Due to crossing slot boundaries, nominal repetition #0 includes two actual repetitions (actual repetition #0 (Act #0) and actual repetition #1). Assuming that the 4th and 9th symbols in time slot #4 are invalid symbols, since the number of actual nominal repeats must be greater than 1, nominal repeat #1 includes one actual repeat (actual repeat #2), located on the 5th and 6th symbols in time slot #4; nominal repeat #2 includes one actual repeat (actual repeat #3), located on the 7th and 8th symbols in time slot #4; since nominal repeat #3 has no invalid symbols and does not cross time slot boundaries, nominal repeat #3 is an actual repeat (actual repeat #4).

[0141] In some embodiments, 5G NR PUSCH supports Transport Block Processing over Multiple Slots (TBoMS). For single-slot PUSCH and PUSCH repetition type A, one transport block (TB) is processed per slot, meaning the transport block size (TBS) is determined based on the time-domain resources on one slot. The TB is transmitted on one slot (single-slot PUSCH), or the TB is transmitted repeatedly on K slots (PUSCH repetition type A). For TBoMS, multiple slots process one TB, meaning the TBS is determined based on the time-domain resources on multiple slots, and the TB is transmitted on these multiple slots. Therefore, the network device informs the terminal device of the number of slots N for TBoMS. The terminal device determines the TBS based on the time-domain resources on N slots and transmits the TB on N slots. The time-domain resource allocation method of TBoMS (N time slots and symbol allocation within each time slot) is the same as that of PUSCH repetition type A, but it can only use the available time slot count. Furthermore, TBoMS can be used in conjunction with PUSCH repetition type A. When TBoMS and PUSCH repetition type A are used in conjunction, the terminal device determines N×K time slots according to the available time slot count method, where K groups of N time slots constitute K repetitions of one TBoMS (N time slots).

[0142] The following example uses Figure 1F, where slots #5 and #6 are not shown, but are downlink slots. All symbols in a downlink slot are downlink symbols, and all symbols in an uplink slot are uplink symbols. In a special slot, the first eight symbols are downlink symbols, the last two are uplink symbols, and the remaining symbols are flexible symbols. For example, Figure 1F shows a combination of TBoMS and PUSCH repetition type A, where k2 indicates slot #3 in the figure, N=2, K=2, S=2, 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, that is, the 3rd to 12th symbols of each time slot; according to the available time slot counting method, TBoMS is allocated on time slot #3, time slot #4, time slot #8, and time slot #9, wherein the first TBoMS repetition is allocated on time slot #3 and time slot #4, and the second TBoMS repetition is allocated on time slot #8 and time slot #9.

[0143] In some embodiments, to support flexible time-domain resource allocation without incurring significant signaling overhead, 5G NR can use a "TDRA table + row index" approach to indicate the time-domain resources for sending PUSCH. First, the network device configures a TDRA table for the terminal device via higher-layer signaling, or the terminal device uses the default TDRA table (Default PUSCH TDRA A). The TDRA table includes at least one row, each corresponding to at least one of the following: a candidate value for a PUSCH mapping type, a candidate value for k2, a candidate value for S, a candidate value for L, a candidate value for SLIV, a candidate value for K, and a candidate value for N. Then, the network device notifies the terminal device of a row index, which indicates a row in the TDRA table. The terminal device uses the candidate value for the corresponding PUSCH mapping type, k2, S, L, K, and N to determine the time-domain resources for sending PUSCH. The following two points should be noted:

[0144] First, a row in the TDRA table does not necessarily need to include all parameters (i.e., PUSCH mapping type, k2, S, L, SLIV, K, N); these parameters are optional. For example, for a single-slot PUSCH, K and N can be left unconfigured. For example, if it is not TBoMS, N can be left unconfigured. For example, for repeating type B, SLIV can be left unconfigured. For example, if SLIV is used, S and L can be left unconfigured.

[0145] Secondly, a row in the TDRA table can include multiple sets of parameters (PUSCH mapping type, k2, S, L, SLIV, K, N), indicating that multiple PUSCHs (Multi-PUSCHs, Multiple PUSCHs) can be scheduled at once. Each PUSCH uses one set 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.

[0146] As can be seen from the above, limiting L to no more than 12 or 14 may result in lower TDRA flexibility for PUSCH. Furthermore, the time-domain resource indication of PUSCH includes indications L and K, leading to significant overhead. Therefore, embodiments of this disclosure propose a communication method, communication device, communication system, storage medium, and program product. Embodiments of this disclosure can improve the TDRA flexibility of PUSCH and / or reduce time-domain resource indication overhead.

[0147] In some embodiments, this disclosure also provides a 5G NR TBS calculation method. The TBS calculation process is as follows:

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

[0149] First, 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 these L symbols, excluding the data from the demodulation reference signal (DMRS). The overhead of configuring higher-level signaling. Specifically, for PUSCH repetition type B, It is determined by the nominal repetition of L symbols.

[0150] Then, determine N. RE :

[0151] If TBoMS is configured: N RE =N·min(156,N′) RE )·n PRB , where n PRB N is the number of PRBs allocated to PUSCH, where N is the number of time slots in TBoMS. Otherwise: N RE =min(156,N′) RE )·n PRB .

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

[0153] If N info If the value is ≤3824, proceed to step 3; otherwise, proceed to step 4.

[0154] Step 3: If N info If the value is ≤3824, perform the following steps:

[0155] Calculate intermediate variables for quantification in

[0156] Based on Table 2 below, find the value not less than N′. info The minimum value is taken as TBS.

[0157] Table 2

[0158] For example, suppose N′ info The minimum value of TBS, which is not less than 24, is 24, as shown in Table 2.

[0159] For example, suppose N′ info The minimum TBS value, which is not less than 50, is 56, as shown in Table 2.

[0160] For example, suppose N′ info The value is 1011. As shown in Table 2, the minimum TBS value that is not less than 1011 is 1032.

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

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

[0163] If R ≤ 1 / 4, in

[0164] If R > 1 / 4, and N′ info >8424, in

[0165] If R > 1 / 4, and N′ info ≤8424 Otherwise,

[0166] Figure 2A is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure. As shown in Figure 2A, the embodiment of the present disclosure relates to a communication method executed by a communication system 100, the method including:

[0167] In step S2101, network device 102 sends first information to terminal 101.

[0168] In some embodiments, the terminal receives first information sent by the network device. Optionally, the network device sends the first information via higher-layer signaling.

[0169] In some embodiments, the first information is used by the terminal to determine the time-domain resource allocation parameters for the PUSCH. That is, the terminal can determine the time-domain resource allocation parameters for the PUSCH based on the first information. Further, the terminal can uniquely determine the time-domain resource for sending the PUSCH based on the time-domain resource allocation parameters, and correspondingly, the network device will also receive the PUSCH sent by the terminal device on that time-domain resource. The PUSCH is allocated across multiple time slots.

[0170] In some embodiments, the first information is used to indicate one or more time-domain resource allocation parameters.

[0171] In some embodiments, the name of the first information is not limited, and it may be, for example, a resource allocation instruction, a time-domain resource, etc.

[0172] Optionally, the time-domain resource allocation parameters include one of the following:

[0173] The first parameter L indicates the total number of symbols from the start symbol of the first PUSCH transmission to the end symbol of the last PUSCH transmission.

[0174] The second parameter S indicates the starting symbol of the PUSCH within a time slot or the first nominal repeat;

[0175] The third parameter L′ indicates the number of symbols in a time slot or a nominal repeat of a PUSCH.

[0176] The fourth parameter K indicates the number of times the transmission is repeated;

[0177] The fifth parameter SLIV is an indication value for the first parameter L and the second parameter S, used to indicate the first parameter L and the second parameter S;

[0178] The sixth parameter indicates the mapping type of PUSCH;

[0179] The seventh parameter, k2, indicates the first time slot of PUSCH;

[0180] The eighth parameter N indicates the number of time slots required to process a transport block in the cross-time-slot transport block processing mode.

[0181] The names of the above parameters are not limited. For example, the first parameter L can be called resource length, transmission start and end length, etc. For example, the third parameter L′ can be called allocation length, etc.

[0182] It should be noted that the definition of the first parameter L in the embodiment of Figure 2A is different from the definition of the allocation length L within a time slot or a nominal repeat described in the embodiments preceding Figure 2A. Furthermore, the range of values ​​for the first parameter L in the embodiment of Figure 2A is different from the range of values ​​for the allocation length L in the embodiments preceding Figure 2A.

[0183] For example, referring to Table 1 above, in the case of PUSCH mapping type A and normal cyclic prefix, the allocation length L ranges from 4 to 14. In the case of PUSCH mapping type B and normal cyclic prefix, the allocation length L ranges from 1 to 14. In the case of PUSCH mapping type A and extended cyclic prefix, the allocation length L ranges from 4 to 12. In the case of PUSCH mapping type B and extended cyclic prefix, the allocation length L ranges from 1 to 12. It can be seen that the upper limit of the allocation length L is limited, and the maximum value of the allocation length L is 14.

[0184] However, in this embodiment, according to the definition of the first parameter L, the upper limit L of the first parameter L is known. max It can be greater than the total number of symbols in a single time slot. For example L max Greater than 14. This means the upper limit of the first parameter L is unlimited, making its value more flexible. This flexibility in the value of the first parameter L is beneficial for improving the TDRA flexibility of PUSCH. For example, for a regular loop prefix, L... max It can be 224, 488, or 896, etc.; for extended cyclic prefixes. max It can be 192, 384, or 896, etc.

[0185] It should be explained that one PUSCH transmission opportunity corresponds to all symbols allocated to the PUSCH within a time slot; or, one PUSCH transmission opportunity corresponds to one nominal repeat. For example, the symbol containing the PUSCH in time slot 3 of Figure 1B corresponds to one transmission opportunity. For example, the symbol containing nominal repeat #0 of Figure 1E corresponds to one transmission opportunity; the symbol containing nominal repeat #1 of Figure 1E corresponds to one transmission opportunity.

[0186] In some embodiments, the mapping type of PUSCH includes a first mapping type and a second mapping type.

[0187] The first mapping type: only allows the second parameter S to be the first symbol of the time slot, i.e., second parameter S = 0, and allows the first parameter L = L. min ,L min +1,…,L max Correspondingly, S + L = L min ,L min +1,…,L max , where L min It is the minimum number of symbols that can be assigned. For example, L min It can be 0 or 4.

[0188] The second mapping type allows the second parameter S to be any symbol within the time slot, i.e., the second parameter... And the first parameter L = 1, 2, ..., L is allowed. max Correspondingly,

[0189] In some embodiments, terminal 101 receives first information sent by network device 102, but is not limited thereto. Terminal 101 may also receive first information sent by other entities, in which case step S2101 can be omitted. Other entities include, but are not limited to, relay devices between terminal 101 and network device 102.

[0190] In some embodiments, the terminal 101 obtains the first information specified by the protocol, in which case step S2101 can be omitted.

[0191] In some embodiments, the terminal 101 obtains the first information from the upper layer(s), in which case step S2101 can be omitted.

[0192] In some embodiments, the terminal 101 processes the information to obtain the first information, and step S2101 can be omitted.

[0193] In some embodiments, the terminal 101 autonomously implements the function indicated by the first information, or the above function is a default or default value, in which case step S2101 can be omitted.

[0194] In step S2102, terminal 101 determines the first parameter based on the first information.

[0195] In some embodiments, the first information may indicate one or more of the eight parameters described above. For example, the first information may indicate the first parameter L.

[0196] In some embodiments, the implementation of the terminal determining the time-domain resource allocation parameters of PUSCH based on the first information includes: the terminal determining the first parameter based on the first information.

[0197] In some embodiments, the first parameter L may be directly or indirectly indicated by the first information.

[0198] A direct indication method is, for example, a first information indication or including a first parameter L.

[0199] Indirect indication can be achieved, for example, by having the first information indicate or include the fifth parameter SLIV. The first parameter L and the second parameter S can be determined based on the fifth parameter SLIV. For instance, referring to Figure 2B, assuming SLIV is 88, then it can be determined from Figure 2B that 88 is located in the eighth column and sixth row of the table in Figure 2B, where the eighth column indicates the first parameter L is 7 and the sixth row indicates the second parameter S is 4.

[0200] Optionally, the fifth parameter (SLIV) is calculated by the network device in the following way:

[0201] exist In the case of, according to The fifth parameter SLIV is calculated, where L max This indicates the upper limit of the value of the first parameter L. This represents the total number of symbols within a time slot.

[0202] exist In the case of, according to The fifth parameter, SLIV, is calculated.

[0203] In some embodiments, the first parameter L can be used to determine at least one of the third parameter L′ and the fourth parameter K. For example, if the first information indicates the first parameter L, the third parameter L′ and the fourth parameter K may not be indicated, which can reduce the resource overhead of the first information.

[0204] In some embodiments, the first information may indicate or include one or more of the following parameters in addition to indicating the first parameter L or the fifth parameter SLIV: the second parameter S, the sixth parameter k2, and the eighth parameter N. For example, the first information indicates the first parameter L, the second parameter S, the sixth parameter, and the seventh parameter k2. For example, the first information indicates the fifth parameter SLIV, the sixth parameter, and the seventh parameter k2. For example, the first information indicates the first parameter L, the second parameter S, the sixth parameter, the seventh parameter k2, and the eighth parameter N. For example, the first information indicates the fifth parameter SLIV, the sixth parameter, the seventh parameter k2, and the eighth parameter N.

[0205] In some embodiments, the first information does not indicate or include the third parameter L′ and the fourth parameter K.

[0206] In step S2103, terminal 101 determines the third parameter and the fourth parameter based on at least one of the first parameter and the second parameter.

[0207] In some embodiments, the first information indicates or includes a second parameter. The second parameter can be determined based on the first information before step S2103.

[0208] In some embodiments, the terminal can determine the third parameter L′ based on the first parameter L, the second parameter S, and the total number of symbols in a time slot.

[0209] Optionally, the first parameter L, the second parameter S, and the total number of symbols in a time slot are... The relationship between the third parameter L′ and the first calculation formula is satisfied.

[0210] For example, the third parameter L′ can be calculated using the first formula based on the first parameter L, the second parameter S, and the total number of symbols in a time slot.

[0211] For example, the first calculation is: Here, mod(a,b) represents finding the remainder when a is divided by b. It should be noted that the terminal does not expect...

[0212] In some embodiments, the fourth parameter K is determined based on the first parameter L and the first condition.

[0213] Optionally, the first condition may include a numerical condition, such as the total number of symbols within a time slot.

[0214] In some embodiments, the fourth parameter K is determined based on the first parameter L and the total number of symbols in a time slot.

[0215] Optionally, the first parameter L is the total number of symbols in a time slot. The relationship between the fourth parameter K and the second calculation formula is satisfied.

[0216] For example, based on the first parameter L and the total number of symbols within a time slot. The fourth parameter K can be calculated using the second formula.

[0217] For example, the second calculation formula is: in, Indicates whether to round up or down to the nearest integer.

[0218] It should be noted that, in scenarios involving cross-time-slot transmission, the second calculation formula can be... This means that one repeated transmission corresponds to N time slots. For example, this is based on the first parameter L, the eighth parameter N, and the total number of symbols within a time slot. Through the second calculation formula The fourth parameter K can be calculated. The terminal expects the fourth parameter K to be an integer.

[0219] Optionally, the first condition may include relational conditions, such as conditions that minimize the value of |KL / K|.

[0220] In some embodiments, the fourth parameter K can be determined based on the first parameter L and the condition that minimizes the value of |KL / K|. It should be noted that the terminal expects the fourth parameter K to be an integer. If the fourth parameter K determined based on the first parameter L and the condition that minimizes the value of |KL / K| is not an integer, it can be rounded up or down to obtain an integer K.

[0221] In some embodiments, after determining the fourth parameter K based on the first parameter L and the first condition, the third parameter L′ can be determined based on the first parameter L and the fourth parameter K.

[0222] Optionally, the first parameter L, the third parameter L′, and the fourth parameter K satisfy the third calculation formula.

[0223] For example, the third parameter L′ can be calculated using the third formula based on the first parameter L and the fourth parameter K.

[0224] Alternatively, the third calculation formula may be, for example, L′=L / K, or, Here, || represents rounding up or rounding down. It should be noted that the terminal device does not expect...

[0225] In some embodiments, after determining the third parameter L′ based on the first parameter L and the second parameter S, the fourth parameter K can be determined based on the first parameter L and the third parameter L′. For example, the fourth parameter K can be calculated using a third formula based on the first parameter L and the third parameter L′.

[0226] In step S2104, terminal 101 determines time domain resources based on time domain resource allocation parameters.

[0227] In some embodiments, prior to step S2104, the terminal may determine the PUSCH transmission type indicated by the network device. For example, the network device may indicate the PUSCH transmission type using first information. For example, the network device may indicate the PUSCH transmission type using second information, which is different from the first information.

[0228] In some embodiments, the PUSCH transport type includes at least one of the following:

[0229] First PUSCH transmission type: After determining the second parameter S, the third parameter L′, the fourth parameter K, the PUSCH mapping type indicated by the sixth parameter, and the seventh parameter k2, the K repetitions are sequentially allocated to K time slots. The K time slots use the same symbol allocation, i.e., the symbol for each time slot is determined based on S and L′. The determination of the K time slots can be done using two methods: physical time slot counting and available time slot counting. The implementation methods for physical time slot counting and available time slot counting can be found in the embodiments preceding Figure 2A, and will not be repeated here.

[0230] Second PUSCH transfer type: After determining the PUSCH mapping type indicated by the second parameter S, the third parameter L′, the fourth parameter K, the sixth parameter k2, and the seventh parameter k2, the first step is to determine the nominal repetition, and the second step is to determine the actual repetition, as follows:

[0231] Nominal repetition: The number of nominal repetitions is K. Each nominal repetition consists of 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.

[0232] Actual repetition: A nominal repetition includes at least one actual repetition. Each actual repetition is a consecutive set of all potentially valid symbols available for PUSCH transmission within a time slot. Potentially valid symbols are symbols other than invalid symbols. Invalid symbols include downlink symbols, SSB symbols, symbols indicated by higher-layer signaling, etc. If an actual repetition includes only one symbol, it is ignored.

[0233] The third PUSCH transmission type is a combination of TBoMS and the first PUSCH transmission type, and only K groups of time slots can be determined using the available time slot count. After determining the second parameter S, the third parameter L′, the fourth parameter K, the PUSCH mapping type indicated by the sixth parameter, the seventh parameter k2, and the eighth parameter N, N×K time slots are determined according to the available time slot count method, where the K groups of N time slots are K repetitions of one TBoMS (N time slots). The N time slots and the symbol allocation within each time slot are the same as the first PUSCH transmission type, and will not be repeated here.

[0234] In some embodiments, the implementation of determining the third and fourth parameters based on at least one of the first and second parameters may differ depending on the PUSCH transmission type.

[0235] For example, when the network device indicates a first PUSCH transmission type, the implementation of the terminal determining the third and fourth parameters based on at least one of the first and second parameters includes: determining the third and fourth parameters based on the first parameter L, the second parameter S, and the total number of symbols in a time slot using a first calculation formula such as... The third parameter L′ is calculated based on the first parameter L and the total number of symbols within a time slot. Through the second calculation formula, as follows The fourth parameter K is calculated.

[0236] For example, when the network device indicates a second PUSCH transmission type, an implementation of the terminal determining the third and fourth parameters based on at least one of the first and second parameters includes: determining the fourth parameter K based on the first parameter L and a condition that minimizes the value of |KL / K|; and calculating the third parameter L′ based on the first parameter L and the fourth parameter K using a third formula such as L′=L / K.

[0237] For example, when the network device indicates a third PUSCH transmission type, the implementation of the terminal determining the third and fourth parameters based on at least one of the first and second parameters includes: determining the third and fourth parameters based on the first parameter L, the second parameter S, and the total number of symbols in a time slot using a first calculation formula such as... The third parameter L′ is calculated based on the first parameter L and the total number of symbols within a time slot. Through the second calculation formula, as follows The fourth parameter K is calculated. It should be explained here that... The reason for dividing by N is that K groups of N time slots are K repetitions of one TBoMS (N time slots), that is, one repetition of transmission corresponds to N time slots.

[0238] In some embodiments, the method for determining time-domain resources differs depending on the PUSCH transmission type.

[0239] Optionally, if the network device indicates a first PUSCH transmission type, after determining the second parameter S, the third parameter L′, the fourth parameter K, the PUSCH mapping type indicated by the sixth parameter, and the seventh parameter k2, the time-domain resources for sending the PUSCH can be determined according to a time-domain resource determination method similar to that for PUSCH repetition type A.

[0240] For example, referring to Figures 2C and 2D, in Figures 2C and 2D, all symbols in the downlink slot are downlink symbols, all symbols in the uplink slot are uplink symbols, and in the special slot, the first 8 symbols are downlink symbols, the last 2 symbols are uplink symbols, and the remaining symbols are flexible symbols. Figure 2C is a schematic diagram of the first PUSCH transmission type under physical slot counting, and Figure 2D is a schematic diagram of the first PUSCH transmission type under available slot counting. Assume that the first information indicates the first parameter L = 24, the second parameter S = 2, and the seventh parameter k2 indicates slot #4. Furthermore, assume... Therefore, we can use the first calculation formula... The third parameter L′ is calculated to be 10, according to the second calculation formula. The fourth parameter K is calculated to be 2.

[0241] As can be seen from Figure 2C, the first PUSCH repetition is allocated in time slot #4, and the second PUSCH repetition is allocated in time slot #5. Since the second PUSCH repetition includes downlink symbols, the second PUSCH repetition is discarded. Therefore, the time domain resources can be determined to be the 3rd to 12th symbols of time slot #4.

[0242] As can be seen from Figure 2D, the first PUSCH is repeatedly allocated to time slot #4, and the second PUSCH is repeatedly allocated to time slot #9. Therefore, the time domain resources can be determined to be the 3rd to 12th symbols of time slot #4 and the 3rd to 12th symbols of time slot #9.

[0243] Optionally, if the network device indicates a second PUSCH transmission type, after determining the second parameter S, the third parameter L′, the fourth parameter K, the PUSCH mapping type indicated by the sixth parameter, and the seventh parameter k2, the time-domain resources for sending the PUSCH can be determined according to a time-domain resource determination method similar to that for PUSCH repetition type B.

[0244] For example, referring to Figure 2E, all symbols in the downlink slot are downlink symbols, all symbols in the uplink slot are uplink symbols, and in the special slot, the first 8 symbols are downlink symbols, the last 2 symbols are uplink symbols, and the remaining symbols are flexible symbols. Figure 2E is a schematic diagram of the second type of PUSCH transmission. Assume that the first information indicates the first parameter L = 16, the second parameter S = 12, and the seventh parameter k2 indicates slot #3 in Figure 2E, and assume... Therefore, based on the first parameter L and the condition that minimizes the value of |KL / K|, and L′=L / K, we can obtain: K=4, L′=4.

[0245] As can be seen from Figure 2E, the time-domain resources are the 13th and 14th symbols of time slot #3, and the 1st, 2nd, 5th, 6th, 7th, 8th, 11th, 12th, 13th, and 14th symbols of time slot #4.

[0246] Optionally, if the network device indicates a third PUSCH transmission type, after determining the second parameter S, the third parameter L′, the fourth parameter K, the PUSCH mapping type indicated by the sixth parameter, the seventh parameter k2, and the eighth parameter N, the time-domain resources for sending PUSCH can be determined according to a time-domain resource determination method similar to that of TBoMS transmission combined with PUSCH repetition type A.

[0247] For example, refer to Figure 2F, which illustrates the third type of PUSCH transmission. Downlink slot #5 and downlink slot #6 are not shown in Figure 2F. All symbols in the downlink slot are downlink symbols, all symbols in the uplink slot are uplink symbols, and in the special slot, the first 8 symbols are downlink symbols, the last 2 symbols are uplink symbols, and the remaining symbols are flexible symbols. Assume that the first information indicates the first parameter L = 52, the second parameter S = 2, the seventh parameter k2 indicates slot #3 in Figure 2F, and the eighth parameter N = 2. And assume... So, according to and We can obtain: K = 2, L′ = 10. As can be seen from Figure 2F, the time-domain resources are the 3rd to 12th symbols of time slots #3, #4, #8, and #9.

[0248] In step S2105, terminal 101 determines the transport block size based on the third parameter.

[0249] In some embodiments, the transport block size (TBS) is determined based on a third parameter L′. For example, in, The number of subcarriers included in a PRB. For 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 (excluding data) in each PRB (Programmable Block) corresponding to these L′ symbols. The overhead of configuring higher-level signaling. Specifically, for PUSCH repetition type B, It is determined by the nominal repetition of L′ symbols.

[0250] In some embodiments, determining the transport block size based on a third parameter includes at least one of the following steps:

[0251] Step 1: Determine the number N of resource elements (REs) used for PUSCH transmission within a time slot. RE :

[0252] First, 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. For 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 (excluding data) in each PRB (Programmable Block) corresponding to these L′ symbols. The overhead of configuring higher-level signaling. Specifically, for PUSCH repetition type B, It is determined by the nominal repetition of L′ symbols.

[0253] Then, determine N. RE :

[0254] If TBoMS is configured: N RE =N·min(156,N′) RE )·n PRB , where n PRB N represents the number of PRBs allocated to PUSCH, and N represents the number of time slots in TBoMS.

[0255] Otherwise: N RE =min(156,N) R ′ E )·n PRB .

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

[0257] If N info If the value is ≤3824, proceed to step 3.

[0258] Otherwise, proceed to step 4.

[0259] Step 3: If N info If the value is ≤3824, perform the following steps:

[0260] Calculate intermediate variables for quantification in

[0261] Based on Table 2 above, find a value not less than N′. info The minimum value is taken as TBS.

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

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

[0264] If R ≤ 1 / 4, then, in

[0265] If R > 1 / 4, N′ info >8424, then in

[0266] Otherwise, R > 1 / 4, N′ info ≤8424, then,

[0267] In step S2106, terminal 101 sends a first signal to the network device on PUSCH according to the time domain resources and the transport block size.

[0268] In some embodiments, the network device receives a first signal on time-domain resources.

[0269] The method by which network devices determine time-domain resources is the same as that of terminals, and will not be elaborated here.

[0270] In step S2107, network device 102 parses the first signal according to the transport block size.

[0271] In some embodiments, the network device determines the transport block size in the same way that the terminal calculates the transport block size, which will not be described again here.

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

[0273] In some embodiments, terms such as "physical uplink shared channel (PUSCH)" and "UL data" can be used interchangeably.

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

[0275] In some embodiments, the terms "synchronization signal (SS)," "synchronization signal block (SSB)," "reference signal (RS)," "pilot," and "pilot signal" can be used interchangeably.

[0276] In some embodiments, "acquire," "get," "obtain," "receive," "transmit," "bidirectional transmission," and "send and / or receive" can be used interchangeably and can be interpreted as receiving from other entities, acquiring from protocols, acquiring from higher layers, obtaining through self-processing, or autonomous implementation. Protocols include, for example, at least one of the 3GPP protocol, Wi-Fi protocol, and audio and / or video protocols.

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

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

[0279] The communication method involved in the embodiments of this disclosure may include at least one of steps S2101 to S2107. For example, step S2101 may be implemented as a standalone embodiment, step S2102 may be implemented as a standalone embodiment, and steps S2102 and S2103 may be implemented as standalone embodiments, but are not limited thereto.

[0280] In some embodiments, the order of any two steps S2101 to S2107 can be interchanged or they can be performed simultaneously. For example, the order of steps S2104 and S2105 can be interchanged or they can be performed simultaneously.

[0281] In some embodiments, steps S2102 to S2107 are optional, and one or more of these steps may be omitted or substituted in different embodiments.

[0282] In some embodiments, steps S2101 and S2103 to S2107 are optional, and one or more of these steps may be omitted or substituted in different embodiments.

[0283] In some embodiments, steps S2101 and S2104 to S2107 are optional, and one or more of these steps may be omitted or substituted in different embodiments.

[0284] In some embodiments, reference can be made to the steps and their optional implementations in other embodiments described before or after this embodiment, as well as other related parts in the specification, which will not be repeated here.

[0285] It should be noted that the embodiment in Figure 2A can be adapted to downlink transmission scenarios with simple modifications to indicate or determine the time-domain resources of the PDSCH. For example, in the embodiment of Figure 2A, the PUSCH can be replaced with the PDSCH, and the seventh parameter k2 can be replaced with the seventh parameter k0 to indicate the first time slot of the PDSCH. The sending and receiving actions can then be adjusted accordingly.

[0286] Figure 2G is an interactive schematic diagram illustrating a communication method according to an embodiment of the present disclosure. As shown in Figure 2G, the embodiment of the present disclosure relates to a communication method executed by a communication system 100, the method including:

[0287] In step S2201, network device 102 sends first information to terminal 101.

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

[0289] In step S2202, terminal 101 determines the first parameter and the third parameter based on the first information.

[0290] In some embodiments, the first information may indicate one or more of the eight parameters described above. For example, the first information may indicate the first parameter L and the third parameter L′.

[0291] In some embodiments, the implementation of the terminal determining the time-domain resource allocation parameters of PUSCH based on the first information includes: the terminal determining a first parameter L and a third parameter L′ based on the first information.

[0292] In some embodiments, the third parameter L′ can be directly indicated by the first information. For example, the first information includes the third parameter L′.

[0293] In some embodiments, the first parameter L may be directly or indirectly indicated by the first information.

[0294] A direct indication method is, for example, a first information indication or including a first parameter L.

[0295] Indirect indication can be achieved by the first information indicating or including a fifth parameter SLIV. The first parameter L and the second parameter S can be determined based on the fifth parameter SLIV. For example, referring to Figure 2B, assuming SLIV is 88, then it can be determined from Figure 2B that 88 is located in the eighth column and sixth row of the table in Figure 2B. The eighth column indicates that the first parameter L is 7, and the sixth row indicates that the second parameter S is 4. The calculation method of the fifth parameter SLIV can be found in the optional implementation of step S2102 in Figure 2A, and will not be repeated here.

[0296] In some embodiments, if the first information indicates the first parameter L and the third parameter L′, the fourth parameter K may not be indicated.

[0297] In some embodiments, the first information may indicate or include one or more of the following parameters in addition to indicating the first parameter L (or the fifth parameter SLIV) and the third parameter L′: the second parameter S, the sixth parameter k2, and the eighth parameter N. For example, the first information indicates the first parameter L, the second parameter S, the third parameter L′, the sixth parameter, and the seventh parameter k2. For example, the first information indicates the fifth parameter SLIV, the third parameter L′, the sixth parameter, and the seventh parameter k2. For example, the first information indicates the first parameter L, the second parameter S, the third parameter L′, the sixth parameter, the seventh parameter k2, and the eighth parameter N. For example, the first information indicates the third parameter L′, the fifth parameter SLIV, the sixth parameter, the seventh parameter k2, and the eighth parameter N.

[0298] In some embodiments, the first information does not indicate or include the fourth parameter K.

[0299] In step S2203, terminal 101 determines the fourth parameter based on the first parameter and the third parameter.

[0300] In some embodiments, the fourth parameter K can be calculated using a third formula based on the first parameter L and the third parameter L′.

[0301] Alternatively, the third calculation formula may be, for example, L′=L / K, or, Here, || represents rounding up or rounding down. It should be noted that the terminal device does not expect...

[0302] In step S2204, terminal 101 determines time domain resources based on time domain resource allocation parameters.

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

[0304] Step S2205: Determine the transport block size based on the third parameter.

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

[0306] In step S2206, terminal 101 sends a first signal to the network device on the PUSCH according to the time domain resources and the transport block size.

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

[0308] In step S2207, network device 102 parses the first signal according to the transport block size.

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

[0310] The communication method involved in the embodiments of this disclosure may include at least one of steps S2201 to S2207. For example, step S2201 may be implemented as a standalone embodiment, step S2202 may be implemented as a standalone embodiment, and steps S2202 and S2203 may be implemented as standalone embodiments, but are not limited thereto.

[0311] In some embodiments, the order of any two steps S2201 to S2207 can be interchanged or they can be performed simultaneously. For example, the order of steps S2204 and S2205 can be interchanged or they can be performed simultaneously.

[0312] In some embodiments, steps S2202 to S2207 are optional, and one or more of these steps may be omitted or substituted in different embodiments.

[0313] In some embodiments, steps S2201 and S2203 to S2207 are optional, and one or more of these steps may be omitted or substituted in different embodiments.

[0314] In some embodiments, steps S2201 and S2204 to S2207 are optional, and one or more of these steps may be omitted or substituted in different embodiments.

[0315] In some embodiments, reference can be made to the steps and their optional implementations in other embodiments described before or after this embodiment, as well as other related parts in the specification, which will not be repeated here.

[0316] It should be noted that the embodiment in Figure 2G can be adapted to downlink transmission scenarios after simple modifications to indicate or determine the time-domain resources of the PDSCH. For example, by replacing the PUSCH with the PDSCH in the embodiment of Figure 2G, and replacing the seventh parameter k2 with the seventh parameter k0 to indicate the first time slot of the PDSCH, the transmission and reception actions can be adaptively adjusted.

[0317] Figure 2H is an interactive schematic diagram illustrating a communication method according to an embodiment of the present disclosure. As shown in Figure 2H, the embodiment of the present disclosure relates to a communication method executed by a communication system 100, the method including:

[0318] In step S2301, network device 102 sends first information to terminal 101.

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

[0320] In step S2302, terminal 101 determines the first parameter and the fourth parameter based on the first information.

[0321] In some embodiments, the first information may indicate one or more of the eight parameters described above. For example, the first information may indicate the first parameter L and the fourth parameter K.

[0322] In some embodiments, the implementation of the terminal determining the time-domain resource allocation parameters of PUSCH based on the first information includes: the terminal determining the first parameter L and the fourth parameter K based on the first information.

[0323] In some embodiments, the fourth parameter K may be directly indicated by the first information. For example, the first information includes the fourth parameter K.

[0324] In some embodiments, the first parameter L may be directly or indirectly indicated by the first information.

[0325] A direct indication method is, for example, a first information indication or including a first parameter L.

[0326] Indirect indication can be achieved by the first information indicating or including a fifth parameter SLIV. The first parameter L and the second parameter S can be determined based on the fifth parameter SLIV. For example, referring to Figure 2B, assuming SLIV is 88, then it can be determined from Figure 2B that 88 is located in the eighth column and sixth row of the table in Figure 2B. The eighth column indicates that the first parameter L is 7, and the sixth row indicates that the second parameter S is 4. The calculation method of the fifth parameter SLIV can be found in the optional implementation of step S2102 in Figure 2A, and will not be repeated here.

[0327] In some embodiments, if the first information indicates the first parameter L and the fourth parameter K, the third parameter L′ may not be indicated.

[0328] In some embodiments, the first information, in addition to indicating the first parameter L (or the fifth parameter SLIV) and the fourth parameter K, may also indicate or include one or more of the second parameter S, the sixth parameter, the seventh parameter k2, and the eighth parameter N. For example, the first information indicates the first parameter L, the second parameter S, the fourth parameter K, the sixth parameter, and the seventh parameter k2. For example, the first information indicates the fifth parameter SLIV, the fourth parameter K, the sixth parameter, and the seventh parameter k2. For example, the first information indicates the first parameter L, the second parameter S, the fourth parameter K, the sixth parameter, the seventh parameter k2, and the eighth parameter N. For example, the first information indicates the fourth parameter K, the fifth parameter SLIV, the sixth parameter, the seventh parameter k2, and the eighth parameter N.

[0329] In some embodiments, the first information does not indicate or include the third parameter L′.

[0330] In step S2303, terminal 101 determines the third parameter based on the first parameter and the fourth parameter.

[0331] In some embodiments, the third parameter L′ can be calculated using a third formula based on the first parameter L and the fourth parameter K.

[0332] Alternatively, the third calculation formula may be, for example, L′=L / K, or, Here, || represents rounding up or rounding down. It should be noted that the terminal device does not expect...

[0333] In step S2304, terminal 101 determines time domain resources based on time domain resource allocation parameters.

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

[0335] Step S2305: Determine the transport block size based on the third parameter.

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

[0337] In step S2306, terminal 101 sends a first signal to the network device on the PUSCH according to the time domain resources and the transport block size.

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

[0339] In step S2307, network device 102 parses the first signal according to the transport block size.

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

[0341] The communication method involved in the embodiments of this disclosure may include at least one of steps S2301 to S2307. For example, step S2301 may be implemented as a standalone embodiment, step S2302 may be implemented as a standalone embodiment, and steps S2302 and S2303 may be implemented as standalone embodiments, but are not limited thereto.

[0342] In some embodiments, the order of any two steps S2301 to S2307 can be interchanged or they can be performed simultaneously. For example, the order of steps S2304 and S2305 can be interchanged or they can be performed simultaneously.

[0343] In some embodiments, steps S2302 to S2307 are optional, and one or more of these steps may be omitted or substituted in different embodiments.

[0344] In some embodiments, steps S2301 and S2303 to S2307 are optional, and one or more of these steps may be omitted or substituted in different embodiments.

[0345] In some embodiments, steps S2301 and S2304 to S2307 are optional, and one or more of these steps may be omitted or substituted in different embodiments.

[0346] In some embodiments, reference can be made to the steps and their optional implementations in other embodiments described before or after this embodiment, as well as other related parts in the specification, which will not be repeated here.

[0347] It should be noted that the embodiment in Figure 2H can be adapted to downlink transmission scenarios with simple modifications to indicate or determine the time domain resources of the PDSCH. For example, in the embodiment of Figure 2H, the PUSCH can be replaced with the PDSCH, and the seventh parameter k2 can be replaced with the seventh parameter k0 to indicate the first time slot of the PDSCH. The sending and receiving actions can then be adjusted accordingly.

[0348] Figure 3 is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure. As shown in Figure 3, the embodiment of the present disclosure relates to a communication method executed by a communication system 100, the method including:

[0349] In step S301, network device 102 sends first information to terminal 101.

[0350] The optional implementations of step S301 can be found in the optional implementations of step S2101 in Figure 2A, step S2201 in Figure 2G, and step S2301 in Figure 2H, as well as other related parts in the embodiments involved in Figures 2A, 2G, and 2H, which will not be repeated here.

[0351] Optionally, the network device determines the third parameter L′ based on the first parameter L, the second parameter S, and the total number of symbols in a time slot.

[0352] Optionally, the network device determines the fourth parameter K based on the first parameter L and the total number of symbols in a time slot.

[0353] Optionally, the network device determines the fourth parameter K based on the first parameter L, the total number of symbols in a time slot, and the eighth parameter N.

[0354] Optionally, the network device determines the fourth parameter K based on the first parameter L and the condition that minimizes the value of |KL / K|.

[0355] Optionally, the network device determines the third parameter L′ based on the first parameter L and the fourth parameter K.

[0356] Optionally, the network device determines the fourth parameter based on the first parameter L and the third parameter L′.

[0357] In step S302, terminal 101 determines the time domain resource allocation parameters of PUSCH based on the first information.

[0358] The optional implementations of step S302 can be found in steps S2102 and S2103 in Figure 2A, steps S2202 and S2203 in Figure 2G, steps S2302 and S2303 in Figure 2H, and other related parts in the embodiments involved in Figures 2A, 2G, and 2H, which will not be repeated here.

[0359] Optionally, the time-domain resource allocation parameters include a first parameter L, which indicates the total number of symbols from the start symbol of the first PUSCH transmission timing to the end symbol of the last PUSCH transmission timing, wherein the PUSCH is allocated across multiple time slots.

[0360] Optionally, the first parameter L is directly indicated by the first information or indirectly indicated through SLIV.

[0361] Optionally, a PUSCH transmission opportunity corresponds to all symbols allocated to the PUSCH within a time slot; or, a PUSCH transmission opportunity corresponds to a nominal repetition.

[0362] Optionally, the upper limit of the value of the first parameter L is greater than the total number of symbols in a time slot. For example, the upper limit of the value of the first parameter L is allowed to be greater than 14.

[0363] Optionally, determining the time-domain resource allocation parameters of the PUSCH based on the first information includes: determining a third parameter L′ based on the first parameter L, the second parameter S, and the total number of symbols in a time slot. The first parameter L and the second parameter S are indicated by the first information.

[0364] Optionally, determining the time-domain resource allocation parameters of PUSCH based on the first information includes: determining the fourth parameter K based on the first parameter L and the total number of symbols in a time slot. The first parameter L is indicated by the first information.

[0365] Optionally, determining the time-domain resource allocation parameters of PUSCH based on the first information includes: determining the fourth parameter K based on the first parameter L, the total number of symbols in a time slot, and the eighth parameter N. The first parameter L and the eighth parameter N are indicated by the first information.

[0366] Optionally, the time-domain resource allocation parameters of PUSCH are determined based on the first information, including: determining the fourth parameter K based on the first parameter L and the condition that minimizes the value of |KL / K|. The first parameter L is indicated by the first information.

[0367] Optionally, determining the time-domain resource allocation parameters of PUSCH based on the first information further includes: determining the third parameter L′ based on the first parameter L and the fourth parameter K. The first parameter L is indicated by the first information.

[0368] Optionally, determining the time-domain resource allocation parameters of PUSCH based on the first information includes: determining the fourth parameter K based on the first parameter L and the third parameter L′. The first parameter L is indicated by the first information.

[0369] Optionally, determining the time-domain resource allocation parameters of PUSCH based on the first information includes: determining the third parameter L′ based on the first parameter L and the fourth parameter K. The first parameter L and the fourth parameter K are indicated by the first information.

[0370] Optionally, determining the time-domain resource allocation parameters of PUSCH based on the first information includes: determining the fourth parameter K based on the first parameter L and the third parameter L′. The first parameter L and the third parameter L′ are indicated by the first information.

[0371] Optionally, the first information indicates the fifth parameter SLIV, which is calculated as follows:

[0372] exist In the case of, according to The fifth parameter SLIV is calculated;

[0373] exist In the case of, according to The fifth parameter, SLIV, is calculated.

[0374] In step S303, terminal 101 sends a first signal to network device 102 on PUSCH based on time-domain resource allocation parameters.

[0375] The optional implementations of step S303 can be found in steps S2104 to S2106 in Figure 2A, steps S2204 to S2206 in Figure 2G, steps S2304 to S2306 in Figure 2H, and other related parts in the embodiments involved in Figures 2A, 2G, and 2H, which will not be repeated here.

[0376] Optionally, the terminal sends a first signal to the network device on the PUSCH based on time-domain resource allocation parameters, including: determining time-domain resources according to the time-domain resource allocation parameters; determining the transport block size (TBS) according to the third parameter L′; and sending the first signal to the network device on the PUSCH based on the time-domain resources and the TBS.

[0377] Optionally, network device 102 receives and parses the first signal. Optional implementations of this can be found in the optional implementations of step S2107 in Figure 2A, step S2207 in Figure 2G, and step S2307 in Figure 2H, as well as other related parts in the embodiments involved in Figures 2A, 2G, and 2H, which will not be repeated here.

[0378] In some embodiments, the steps and their optional implementations in other embodiments described before or after this embodiment, as well as other related parts in the specification, can be referred to, and will not be repeated here.

[0379] It should be noted that the embodiment in Figure 3 can be adapted to downlink transmission scenarios after simple modifications to indicate or determine the time domain resources of the PDSCH. For example, by replacing the PUSCH with the PDSCH in the embodiment of Figure 3, and replacing the seventh parameter k2 with the seventh parameter k0 to indicate the first time slot of the PDSCH, the sending and receiving actions can be adjusted accordingly.

[0380] In some embodiments, this disclosure proposes a new parameter, namely a first parameter L, which is defined as the number of symbols between the first symbol of a PUSCH and the last symbol of that PUSCH. In other words, L indicates the total number of symbols from the start symbol of the first PUSCH transmission to the end symbol of the last PUSCH transmission.

[0381] Optionally, the maximum value of L is Lmax max More than the number of symbols in one time slot

[0382] This disclosure provides two mapping methods. The first mapping type is: S = 0, L = L. min ,L min +1,…,L max S + L = L min ,L min +1,…,L max L min It is the minimum number of symbols that can be assigned; the second mapping type: L = 1, 2, ..., L max ,

[0383] This disclosure provides a method for calculating SLIV: if otherwise,

[0384] This disclosure provides three PUSCH transmission methods as follows:

[0385] The first PUSCH transmission method: S indicates the starting symbol (index) of each time slot, and the number of symbols in each time slot. Number of repetitions Not expected

[0386] Optionally, TBS can be determined based on L′.

[0387] The second PUSCH transmission method: S indicates the start symbol of the first nominal repetition, S+L-1 indicates the end symbol of the last nominal repetition, and the number of nominal repetitions K and the number of symbols in the nominal repetition L′ are:

[0388] Method 1: K is the integer that minimizes |KL / K|, where K is an integer and L′ = L / K;

[0389] Method 2: The network device indicates K or L′;

[0390] Optionally, not expected

[0391] The third PUSCH transmission method: the number of time slots N calculated by TBS, and the number of repetitions.

[0392] Optionally, it is not expected that K is not an integer.

[0393] Optionally, the TBS is determined based on the number of symbols L′ in each time slot.

[0394] The meanings of the above symbols can be found in the explanation in Figure 2A, and will not be repeated here.

[0395] In some embodiments, this disclosure provides an interaction method for a communication method, including one of the following steps:

[0396] Step 1-1: The network device sends first information to the terminal device. The first information is used to indicate a first time domain resource, and the first time domain resource is used by the terminal device to send a first signal.

[0397] Step 1-2: The terminal device receives the first information sent by the network device and determines the first time domain resource based on the first information.

[0398] Optionally, the first signal is carried on the PUSCH; it should be understood that the first time-domain resource is a time-domain resource allocated to the PUSCH.

[0399] Optionally, the network device sends second information to the terminal device, the second information being used to indicate the type of the PUSCH.

[0400] Optionally, the first signal and the second signal can be the same signal or different signals.

[0401] Optionally, the PUSCH types include: a first PUSCH transmission type, a second PUSCH transmission type, and a third PUSCH transmission type. It should be understood that the three PUSCH transmission types are similar to the PUSCH repetition type A, PUSCH repetition type B, and TBoMS transmission described earlier in Figure 2A.

[0402] Optionally, the methods for determining the first time-domain resources differ depending on the PUSCH transmission type, as detailed below:

[0403] First, let's explain the first type of PUSCH transmission:

[0404] Optionally, the first information includes k2, which is used to indicate the first time slot of PUSCH.

[0405] Optionally, the first information includes S, which is used to indicate the index of the starting symbol of PUSCH within a time slot.

[0406] Optionally, the first information includes L, which indicates the number of symbols for the start symbol of the first PUSCH transmission timing and the end symbol of the last transmission timing. It should be understood that the definition of L differs from that in related technologies.

[0407] Optional, the maximum value of L. max More than the number of symbols in one time slot For example, For a regular cyclic prefix, L max =224, 488, or 896, etc.; for the extended cyclic prefix, L max =192, 384 or 896, etc.

[0408] Optionally, the first information includes a PUSCH mapping type, which includes a first mapping type and a second mapping type. It should be understood that the first mapping type is similar to PUSCH mapping type A in the foregoing embodiments, and the second mapping type is similar to PUSCH mapping type B in the foregoing embodiments.

[0409] Optionally, for the first mapping type, S = 0, L = L min ,L min +1,…,L max S + L = L min ,L min +1,…,L max L min It is the minimum number of symbols that can be assigned. For example, L min = 0 or 4.

[0410] Optionally, for the second mapping type, L = 1, 2, ..., L max ,

[0411] Optionally, the first information includes SLIV, and the method for determining the SLIV is: if otherwise, For example, L max =28, then the value of SLIV is shown in Figure 2B. It should be understood that L used to determine SLIV is defined as the total number of symbols from the start symbol of the first PUSCH transmission timing to the end symbol of the last PUSCH transmission timing.

[0412] Optional, the number of symbols in each time slot for PUSCH It should be understood that the cutoff symbol for PUSCH within each time slot is... Further, optionally, the terminal device does not expect It should be understood that the PUSCH cutoff symbol cannot precede the start symbol within each time slot.

[0413] Optionally, the number of repetitions of PUSCH is:

[0414] Optionally, after determining the PUSCH mapping type, k2, S, L′ and K, the time-domain resources used for sending the PUSCH, i.e. the first time-domain resources, are determined according to a time-domain resource determination method similar to that for PUSCH repetition type A.

[0415] For example, Figure 2C shows a schematic diagram of the first PUSCH transmission type under physical timeslot counting, and Figure 2D shows a schematic diagram of the first PUSCH transmission type under available timeslot counting, where k2 indicates timeslot #4 in the figure, S=2, L=24. According to the above formula, K = 2, L′ = 10. As shown in Figure 2C, the first PUSCH repetition is allocated to time slot #4, and the second PUSCH repetition is allocated to time slot #5. Since the second PUSCH repetition includes downlink symbols, it is discarded. Therefore, the first time domain resource is the 3rd to 12th symbols of time slot #4. As shown in Figure 2D, the first PUSCH repetition is allocated to time slot #4, and the second PUSCH repetition is allocated to time slot #9. Therefore, the first time domain resource is the 3rd to 12th symbols of time slot #4 and the 3rd to 12th symbols of time slot #9.

[0416] It should be understood that the advantage of the method is that it does not require indicating the number of repetitions, thereby reducing signaling overhead.

[0417] Next, let's explain the second type of PUSCH transmission:

[0418] Optionally, the first information includes k2, which indicates the first slot of the PUSCH. It should be understood that the definition of k2 is similar to that in PUSCH repetition type B.

[0419] Optionally, the first information includes S, which indicates the index of the starting symbol of the first nominal repetition. It should be understood that the definition of S is similar to that in PUSCH repetition type B.

[0420] Optionally, the first information includes L, the definition of which is the same as that in the first type of PUSCH transmission, and will not be repeated here. It should be understood that S+L-1 indicates the cutoff symbol of the last nominal repetition.

[0421] Optionally, the first information includes a PUSCH mapping type, and the definition of the PUSCH mapping type is the same as that in the first PUSCH transmission type, except that the second PUSCH transmission type only supports the second mapping type.

[0422] It should be understood that for the second PUSCH transmission type, the terminal device does not expect the first information to include SLIV.

[0423] Optionally, the number of symbols L′ for each nominal repetition and the number of nominal repetitions K are determined according to the following method:

[0424] Method 1: K is the integer that minimizes |K - L / K|, K is an integer, and L′ = L / K;

[0425] Optionally, K ≥ L′, or K < L′, which can be configured by the network device;

[0426] Method 2: The network device indicates K or L′ to the terminal device

[0427] Optionally, if the network device indicates K, then L′ = L / K; otherwise, K = L / L′;

[0428] Optionally, the terminal device does not expect

[0429] Optionally, after determining the PUSCH mapping type, k2, S, L′, and K, the actual repeated time-domain resources, that is, the first time-domain resources, are determined according to a time-domain resource determination method similar to that of PUSCH repetition type B.

[0430] Exemplarily, FIG. 2E shows a schematic diagram of the second PUSCH transmission type, where k2 indicates slot #3 in FIG. 2E, S = 12, L = 16, According to the above formula or indicated by the network device, it can be obtained that: K = 4, L′ = 4. As can be seen from FIG. 3, the first time-domain resources are the 13th and 14th symbols of slot #3, and the 1st, 2nd, 5th, 6th, 7th, 8th, 11th, 12th, 13th, and 14th symbols of slot #4.

[0431] It should be understood that the advantage of this method is that it does not require indicating the number of repetitions (Method 1), thereby reducing signaling overhead.

[0432] Finally, the third PUSCH transmission type is introduced:

[0433] Optionally, the first information includes k2, and k2 is used to indicate the first slot of the PUSCH. It should be understood that the definition of k2 is similar to that in TBoMS.

[0434] Optionally, the first information includes S, which indicates the index of the start symbol of PUSCH within the first time slot. It should be understood that the definition of S is similar to that in TBoMS.

[0435] Optionally, the first information includes L, and the definition of L is the same as that in the first type of PUSCH transmission, which will not be repeated here.

[0436] Optionally, the first information includes a PUSCH mapping type, the definition of which is the same as that in the first type of PUSCH transmission type, and will not be repeated here.

[0437] Optionally, the first information includes SLIV, and the method for determining the SLIV is the same as the method for determining it in the first type of PUSCH transmission, which will not be described again here.

[0438] Optionally, the method for determining the number of symbols L′ in each PUSCH slot is the same as the method for determining the number of symbols in the first PUSCH transmission type, and will not be repeated here.

[0439] Optionally, the first information includes the number of time slots N, the definition of which is similar to that in TBoMS.

[0440] Optional, the number of repetitions of PUSCH

[0441] Optionally, after determining the PUSCH mapping type, k2, S, L′, K, and N, the actual repeated time-domain resource, i.e., the first time-domain resource, is determined according to a time-domain resource determination method similar to that in TBoMS.

[0442] For example, Figure 2F shows a schematic diagram of the third type of PUSCH transmission, where k2 indicates time slot #3 in Figure 2F, S=2, L=52, N=2. According to the above formula or as indicated by the network device, K = 2, L′ = 10. As can be seen from Figure 4, the first time-domain resource is the 3rd to 12th symbols of time slots #3 / 4 / 8 / 9.

[0443] It should be understood that the advantage of the method is that it does not require indicating the number of repetitions K, thereby reducing signaling overhead.

[0444] Step 2: The terminal device determines the first TBS based on the first information.

[0445] Optionally, for the three different PUSCH transmission methods (the first PUSCH transmission type, the second PUSCH transmission type, and the third PUSCH transmission type), TBS is based on the number of symbols L′ in each time slot; for example,

[0446] Step 3-1: The terminal device sends the first signal based on the first time domain resource and the first TBS.

[0447] Step 3-2: The network device receives the first signal sent by the terminal device on the first time domain resource.

[0448] Step 4: The network device parses the first signal according to the first TBS.

[0449] It should be understood that the network device uses the same method as the terminal device to determine the first time domain resource and TBS.

[0450] In some embodiments, the steps and their optional implementations in other embodiments described before or after this embodiment, as well as other related parts in the specification, can be referred to, and will not be repeated here.

[0451] It should be noted that any of the embodiments described above in this disclosure can be applied to downlink transmission scenarios after simple modifications to achieve the purpose of indicating or determining the time domain resources of the PDSCH. For example, by replacing PUSCH with PDSCH in any of the above embodiments, and replacing parameter k2 with parameter k0 to indicate the first time slot of the PDSCH, adaptive adjustments can be made to the transmission and reception actions to obtain a technical solution suitable for downlink scenarios.

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

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

[0454] 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. Furthermore, it can also be a hardware circuit designed for artificial intelligence, which can be understood as an ASIC, such as a Neural Network Processing Unit (NPU), a Tensor Processing Unit (TPU), or a Deep Learning Processing Unit (DPU).

[0455] Figure 4 is a schematic diagram of a terminal structure according to an embodiment of the present disclosure. Terminal 400 is used to execute any of the above methods. In some embodiments, as shown in Figure 4, terminal 400 may include at least one of a transceiver module 401, a processing module 402, etc. In some embodiments, the transceiver module is used to receive first information sent by a network device, determine time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information, the time-domain resource allocation parameters including a first parameter (L), the first parameter (L) indicating the total number of symbols from the start symbol of the first PUSCH transmission opportunity to the end symbol of the last PUSCH transmission opportunity, wherein the PUSCH is allocated across multiple time slots; and send a first signal to the network device on the PUSCH based on the time-domain resource allocation parameters. Optionally, the transceiver module is used to execute at least one of the communication steps (e.g., steps S2101, S2106, S2201, S2206, S2301, S2306, but not limited thereto) performed by terminal 101 in any of the above methods, which will not be elaborated further here. Optionally, the above processing module is used to execute at least one of the other steps executed by the terminal 101 in any of the above methods (e.g., steps S2102, S2103, S2104, S2105, S2107, S2202, S2203, S2204, S2205, S2207, S2302, S2303, S2304, S2305, S2307, but not limited thereto), which will not be elaborated here.

[0456] Figure 5 is a schematic diagram of a network device according to an embodiment of the present disclosure. The network device 500 is used to perform any of the above methods. In some embodiments, as shown in Figure 5, the network device 500 may include at least one of a transceiver module 501, a processing module 502, etc. In some embodiments, the transceiver module is used to send first information to a terminal, the first information being used by the terminal to determine time-domain resource allocation parameters for the Physical Uplink Shared Channel (PUSCH), the time-domain resource allocation parameters including a first parameter indicating the total number of symbols from the start symbol of the first PUSCH transmission opportunity to the end symbol of the last PUSCH transmission opportunity, wherein the PUSCH is allocated across multiple time slots; and to receive a first signal transmitted by the terminal on the PUSCH based on the time-domain resource allocation parameters. Optionally, the transceiver module is used to perform at least one of the communication steps (e.g., steps S2101, S2106, S2201, S2206, S2301, S2306, but not limited thereto) performed by the network device 102 in any of the above methods, which will not be elaborated here. Optionally, the processing module is used to perform at least one of the other steps (e.g., steps S2102, S2103, S2104, S2105, S2107, S2202, S2203, S2204, S2205, S2207, S2302, S2303, S2304, S2305, S2307, but not limited thereto) performed by the network device 102 in any of the above methods, which will not be elaborated here.

[0457] In some embodiments, the transceiver module may include a transmitting module and / or a receiving module, which may be separate or integrated. Optionally, the transceiver module may be interchangeable with a transceiver.

[0458] In some embodiments, the processing module may be a single module or may include multiple sub-modules. Optionally, the multiple sub-modules may each perform all or part of the steps required by the processing module.

[0459] In some embodiments, the processing module can be replaced by the processor, and the transceiver module can be replaced by the transceiver.

[0460] Figure 6A is a schematic diagram of the structure of a communication device 6100 according to an embodiment of the present disclosure. The communication device 6100 can be a network device (e.g., access network device, core network device, etc.), a terminal (e.g., user equipment, etc.), a chip, chip system, or processor that supports the network device in implementing any of the above methods, or a chip, chip system, or processor that supports the terminal 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.

[0461] As shown in Figure 6A, the communication device 6100 is used to execute any of the above methods. In some embodiments, the communication device 6100 includes one or more processors 6101. The processor 6101 may be a general-purpose processor or a special-purpose processor, such as a baseband processor or a central processing unit. The baseband processor may be used to process communication protocols and communication data, and the central processing unit may 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 is used to execute any of the above methods. Optionally, one or more processors 6101 are used to invoke instructions to cause the communication device 6100 to execute any of the above methods.

[0462] 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 transceivers 6102 perform at least one of the communication steps such as sending and / or receiving in the above method (e.g., steps S2101, S2106, S2201, S2206, S2301, S2306, but not limited thereto), and the processor 6101 performs at least one of other steps (e.g., steps S2102, S2103, S2104, S2105, S2107, S2202, S2203, S2204, S2205, S2207, S2302, S2303, S2304, S2305, S2307, but not limited thereto). In optional embodiments, the transceiver may include a receiver and / or a transmitter, which may be separate or integrated. 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; the terms receiver, receiving unit, receiver, receiving circuit, etc., can be used interchangeably.

[0463] In some embodiments, the communication device 6100 further includes one or more memories 6103 for storing data and / or instructions. Optionally, one or more processors 6101 are used to invoke instructions stored in the memory 6103 to cause the communication device 6100 to perform any of the above methods. Optionally, all or part of the memory 6103 may also be located outside the communication device 6100. In an optional embodiment, the communication device 6100 may include one or more interface circuits 6104. Optionally, the interface circuit 6104 is connected to the memory 6103 and can be used to receive data and / or instructions from the memory 6103 or other devices, and can be used to send data and / or instructions to the memory 6103 or other devices. For example, the interface circuit 6104 can read data and / or instructions stored in the memory 6103 and send the data and / or instructions to the processor 6101.

[0464] 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. 6A. 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, programs and / or instructions; (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.

[0465] Figure 6B is a schematic diagram of the structure of a chip 6200 according to an embodiment of the present disclosure. For cases where the communication device 6100 can be a chip or a chip system, the schematic diagram of the chip 6200 shown in Figure 6B can be referred to, but is not limited thereto.

[0466] Chip 6200 includes one or more processors 6201. Chip 6200 is used to perform any of the methods described above.

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

[0468] In some embodiments, the interface circuit 6202 performs at least one of the communication steps such as sending and / or receiving in the above-described method (e.g., steps S2101, S2106, S2201, S2206, S2301, S2306, but not limited thereto). For example, the interface circuit 6202 performing the communication steps such as sending and / or receiving in the above-described method means that the interface circuit 6202 performs data and / or instruction interaction between the processor 6201, the chip 6200, the memory 6203, or the transceiver device. In some embodiments, the processor 6201 performs at least one of other steps (e.g., steps S2102, S2103, S2104, S2105, S2107, S2202, S2203, S2204, S2205, S2207, S2302, S2303, S2304, S2305, S2307, but not limited thereto).

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

[0470] This disclosure also proposes a storage medium storing instructions that, when executed on a communication device, cause the communication device to perform any of the above methods. 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.

[0471] This disclosure also proposes a program product, including a program and / or instructions, which, when executed by a communication device, cause the communication device to perform any of the above methods. Optionally, the program product is a computer program product. Optionally, the program product is stored on the storage medium.

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

Claims

1. A communication method, characterized in that, The method includes: The terminal receives first information sent by the network device and determines the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information. The time-domain resource allocation parameters include a first parameter, which indicates the total number of symbols from the start symbol of the first PUSCH transmission timing to the end symbol of the last PUSCH transmission timing. The PUSCH is allocated across multiple time slots. Based on the time-domain resource allocation parameters, a first signal is sent to the network device on the PUSCH.

2. The method according to claim 1, characterized in that, A PUSCH transmission opportunity corresponds to all symbols allocated to a PUSCH within a time slot; or, a PUSCH transmission opportunity corresponds to a nominal repetition.

3. The method according to claim 1 or 2, characterized in that, The upper limit of the value of the first parameter is greater than the total number of symbols in a time slot.

4. The method according to any one of claims 1-3, characterized in that, The step of determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information includes: The third parameter is determined based on the first parameter, the second parameter, and the total number of symbols in a time slot; The second parameter is indicated by the first information, indicating the starting symbol of the PUSCH within a time slot or the first nominal repeat, and the third parameter indicates the number of symbols of the PUSCH within a time slot or the first nominal repeat.

5. The method according to any one of claims 1-3, characterized in that, The step of determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information includes: A fourth parameter is determined based on the first parameter and the total number of symbols in a time slot, the fourth parameter indicating the number of repeated transmissions.

6. The method according to any one of claims 1-3, characterized in that, The step of determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information includes: A fourth parameter is determined based on the first parameter and the first condition, the fourth parameter indicating the number of repeated transmissions, the first condition including determining the minimum value of |KL / K|, where L represents the first parameter and K represents the fourth parameter.

7. The method according to claim 5 or 6, characterized in that, The step of determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information further includes: A third parameter is determined based on the first parameter and the fourth parameter, the third parameter indicating the number of symbols in a time slot or a nominal repeat of a PUSCH.

8. The method according to any one of claims 1-3, characterized in that, The step of determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information includes: A fourth parameter is determined based on the first parameter and the third parameter, wherein the third parameter is indicated by the first information, the third parameter indicates the number of symbols in a time slot or a nominal repeat of a PUSCH, and the fourth parameter indicates the number of repeated transmissions.

9. The method according to any one of claims 1-3, characterized in that, The step of determining the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH) based on the first information includes: The third parameter is determined based on the first parameter and the fourth parameter, wherein the fourth parameter is indicated by the first information, the fourth parameter indicates the number of repeated transmissions, and the third parameter indicates the number of symbols in a time slot or a nominal repeat of the PUSCH.

10. The method according to any one of claims 1-9, characterized in that, The first information indicates a fifth parameter, which is used to indicate the first and second parameters. The second parameter is used to indicate the start symbol of the PUSCH within a time slot or the first nominal repetition. The fifth parameter is calculated as follows: exist In the case of, according to The fifth parameter was calculated. The number, where L represents the first parameter, L max This indicates the upper limit of the value that the first parameter can take. This represents the total number of symbols within a time slot, SLIV represents the fifth parameter, and S represents the second parameter; exist In the case of, according to The fifth parameter is calculated.

11. The method according to any one of claims 4, 7-9, characterized in that, Sending a first signal to the network device on the PUSCH based on the time-domain resource allocation parameters includes: Determine time-domain resources based on the time-domain resource allocation parameters; The transport block size (TBS) is determined based on the third parameter. The first signal is sent to the network device on the PUSCH according to the time domain resources and the TBS.

12. A communication method, characterized in that, The method includes: The network device sends first information to the terminal. The first information is used by the terminal to determine the time-domain resource allocation parameters of the Physical Uplink Shared Channel (PUSCH). The time-domain resource allocation parameters include a first parameter, which indicates the total number of symbols from the start symbol of the first PUSCH transmission timing to the end symbol of the last PUSCH transmission timing. The PUSCH is allocated on multiple time slots. The terminal receives the first signal sent on the PUSCH based on the time-domain resource allocation parameters.

13. The method according to claim 12, characterized in that, A PUSCH transmission opportunity corresponds to all symbols allocated to a PUSCH within a time slot; or, a PUSCH transmission opportunity corresponds to a nominal repetition.

14. The method according to claim 12 or 13, characterized in that, The upper limit of the value of the first parameter is greater than the total number of symbols in a time slot.

15. The method according to any one of claims 12-14, characterized in that, The first information indicates a second parameter, the second parameter being used to indicate the start symbol of a PUSCH within a time slot or the first nominal repetition, the method further comprising: A third parameter is determined based on the first parameter, the second parameter, and the total number of symbols in a time slot. The third parameter indicates the number of symbols in a time slot or a nominal repeat of a PUSCH.

16. The method according to any one of claims 12-14, characterized in that, The method further includes: A fourth parameter is determined based on the first parameter and the total number of symbols in a time slot, the fourth parameter indicating the number of repeated transmissions.

17. The method according to any one of claims 12-14, characterized in that, The method further includes: A fourth parameter is determined based on the first parameter and the first condition, the fourth parameter indicating the number of repeated transmissions, the first condition including determining the minimum value of |KL / K|, where L represents the first parameter and K represents the fourth parameter.

18. The method according to claim 16 or 17, characterized in that, The method further includes: A third parameter is determined based on the first parameter and the fourth parameter, the third parameter indicating the number of symbols in a time slot or a nominal repeat of a PUSCH.

19. The method according to any one of claims 12-14, characterized in that, The first information indicates a third parameter, the third parameter being used to indicate the number of symbols in a time slot or a nominal repetition of a PUSCH, the method further comprising: A fourth parameter is determined based on the first parameter and the third parameter, wherein the fourth parameter indicates the number of times the transmission is repeated.

20. The method according to any one of claims 12-14, characterized in that, The first information indicates a fourth parameter, the fourth parameter indicating the number of repeated transmissions, and the method further includes: A third parameter is determined based on the first parameter and the fourth parameter, wherein the third parameter indicates the number of symbols in a time slot or a nominal repeat of a PUSCH.

21. The method according to any one of claims 12-20, characterized in that, The first information indicates a fifth parameter, the fifth parameter being used to indicate the first parameter and the second parameter, the second parameter being used to indicate the start symbol of the PUSCH within a time slot or the first nominal repetition, the method further comprising: exist In the case of, according to The fifth parameter is calculated, where L represents the first parameter, L max This indicates the upper limit of the value that the first parameter can take. This represents the total number of symbols within a time slot, SLIV represents the fifth parameter, and S represents the second parameter; exist In the case of, according to The fifth parameter is calculated.

22. The method according to any one of claims 15, 18-20, characterized in that, Receiving the first signal sent by the terminal on the PUSCH based on the time-domain resource allocation parameters includes: Determine time-domain resources based on the time-domain resource allocation parameters; The transport block size (TBS) is determined based on the third parameter. The first signal is received on the time-domain resource, and the first signal is parsed according to the TBS.

23. A communication device, characterized in that, The communication device is used to perform the communication method according to any one of claims 1-11 and 12-22.

24. A communication system, characterized in that, The device includes a terminal and a network device, wherein the terminal is configured to implement the communication method according to any one of claims 1-11, and the network device is configured to implement the communication method according to any one of claims 12-22.

25. A storage medium storing instructions, characterized in that, When the instructions are executed on the communication device, the communication method of any one of claims 1-11 and 12-22 is performed.

26. A program product comprising at least one of a program and instructions, characterized in that, When at least one of the programs or instructions is executed by the communication device, it implements the steps of the communication method according to any one of claims 1-22.

Images