Communication method, communication device, communication system, storage medium, and program product
By flexibly configuring the time-domain resources and repetition mechanism of PUSCH in 6G networks, the problem of improving PUSCH performance is solved, achieving more efficient resource utilization and more reliable communication connections.
Patent Information
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- BEIJING XIAOMI MOBILE SOFTWARE CO LTD
- Filing Date
- 2024-11-08
- Publication Date
- 2026-05-15
AI Technical Summary
How to improve the performance of the Physical Uplink Shared Channel (PUSCH) in 6G networks to meet higher user demands and more complex application scenarios, and achieve faster, smarter, and more reliable global communication connections.
By acquiring the first information, the time-domain resources of PUSCH are determined, including parameters k2, S, L and SLIV. The number of symbols in the time-domain resources is allowed to be greater than the number of symbols included in a time slot. Combined with the repetition mechanism, uplink resources are flexibly configured to improve the transport block size and the gain of low-density parity-check code (LDPC) coding.
It improves the uplink coverage performance and transmission reliability of PUSCH, enables more flexible resource utilization, and enhances the overall performance of the communication system.
Smart Images

Figure CN2024131108_15052026_PF_FP_ABST
Abstract
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 provided, executed by a terminal, the method comprising:
[0006] Obtain first information;
[0007] The time-domain resources of PUSCH are determined based on the first information;
[0008] The first information is used to indicate at least one of the following:
[0009] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0010] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0011] The third parameter L indicates the number of symbols in the time-domain resource.
[0012] The fourth parameter, Start and Length Indicator Value (SLIV), is used to indicate the second parameter S and the third parameter L.
[0013] Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot.
[0014] According to a second aspect of the present disclosure, a communication method is provided, executed by a terminal, the method comprising:
[0015] Obtain first information;
[0016] The time-domain resources of PUSCH are determined based on the first information;
[0017] The first information is used to indicate at least one of the following:
[0018] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0019] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0020] The third parameter L is used to indicate the number of symbols corresponding to one nominal repetition;
[0021] The seventh parameter K indicates the nominal number of repetitions, and K is greater than or equal to 1.
[0022] Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot;
[0023] A nominal repetition includes at least one actual repetition, and the time-domain resources of the PUSCH include all symbols corresponding to the actual repetition.
[0024] According to a third aspect of the present disclosure, a communication method is provided, the method comprising:
[0025] Send first information, which is used by the terminal to determine the time domain resources of PUSCH;
[0026] The first information is used to indicate at least one of the following:
[0027] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0028] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0029] The third parameter L indicates the number of symbols in the time-domain resource.
[0030] The fourth parameter SLIV is used to indicate the second parameter S and the third parameter L;
[0031] Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot.
[0032] According to a fourth aspect of the present disclosure, a communication method is provided, performed by a network device, the method comprising:
[0033] Send first information, which is used by the terminal to determine the time domain resources of PUSCH;
[0034] The first information is used to indicate at least one of the following:
[0035] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0036] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0037] The third parameter L is used to indicate the number of symbols corresponding to one nominal repetition;
[0038] The seventh parameter K indicates the nominal number of repetitions, and K is greater than or equal to 1.
[0039] Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot;
[0040] A nominal repetition includes at least one actual repetition, and the time-domain resources of the PUSCH include all symbols corresponding to the actual repetition.
[0041] According to a fifth aspect of the present disclosure, a communication device is provided for performing the communication method described in the first, second, third, or fourth aspect.
[0042] According to a sixth 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 or second aspect, and the network device is configured to implement the communication method described in the third or fourth aspect.
[0043] According to a seventh 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, second, third, or fourth aspect to be performed.
[0044] According to an eighth 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, second, third, or fourth aspects.
[0045] By adopting the above technical solution, at least the following beneficial technical effects can be achieved:
[0046] The value of the third parameter L is no longer limited by the number of symbols in a single time slot. The number of symbols in the time domain resources of PUSCH can be configured to be greater than the number of symbols included in a single time slot. This allows for more flexible use of uplink resources and can increase the transport block size (TBS), thereby improving the gain of low-density parity check coding (LDPC) and effectively enhancing the uplink coverage performance of PUSCH. Attached Figure Description
[0047] 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.
[0048] Figure 1A is an exemplary schematic diagram of the architecture of a communication system provided according to an embodiment of the present disclosure.
[0049] Figure 1B is a schematic diagram of a single-slot PUSCH resource provided according to an embodiment of the present disclosure.
[0050] 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.
[0051] 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.
[0052] Figure 1E is a schematic diagram of resources corresponding to a PUSCH repeating type B according to an embodiment of the present disclosure.
[0053] Figure 1F is a resource diagram illustrating a combination of TBoMS and PUSCH repeating type A according to an embodiment of the present disclosure.
[0054] Figure 2A is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure.
[0055] Figure 2B is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure.
[0056] Figure 3A is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure.
[0057] Figure 3B is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure.
[0058] Figure 3C is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure.
[0059] Figure 3D is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure.
[0060] Figure 3E is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure.
[0061] Figure 4A is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure.
[0062] Figure 4B is a schematic diagram of symbol allocation for a type 1 PUSCH transmission without repetition under physical time slot counting, according to an embodiment of the present disclosure.
[0063] Figure 4C is a schematic diagram of symbol allocation for a first-type PUSCH transmission without repetition under available time slot count, according to an embodiment of the present disclosure.
[0064] Figure 4D is a schematic diagram of symbol allocation for a type 1 PUSCH transmission with repetition under physical time slot counting, according to an embodiment of the present disclosure.
[0065] Figure 4E is a schematic diagram of symbol allocation for a type 1 PUSCH transmission with repeating available slot counts, according to an embodiment of the present disclosure.
[0066] Figure 4F is a schematic diagram of symbol allocation for a second type of PUSCH transmission according to an embodiment of the present disclosure.
[0067] Figure 5A is a schematic diagram of the structure of a terminal according to an embodiment of the present disclosure.
[0068] Figure 5B is a schematic diagram of the structure of a terminal according to an embodiment of the present disclosure.
[0069] Figure 6A is a schematic diagram of the structure of a communication device according to an embodiment of the present disclosure.
[0070] Figure 6B is a schematic diagram of a chip structure according to an embodiment of the present disclosure. Detailed Implementation
[0071] This disclosure provides a communication method, communication device, communication system, storage medium, and program product.
[0072] In a first aspect, embodiments of this disclosure provide a communication method executed by a terminal, the method comprising:
[0073] Obtain first information;
[0074] The time-domain resources of PUSCH are determined based on the first information;
[0075] The first information is used to indicate at least one of the following:
[0076] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0077] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0078] The third parameter L indicates the number of symbols in the time-domain resource.
[0079] The fourth parameter SLIV is used to indicate the second parameter S and the third parameter L;
[0080] Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot.
[0081] In the above embodiments, the value of the third parameter L is no longer limited by the number of symbols in a single time slot. The number of symbols in the time domain resources of PUSCH can be configured to be greater than the number of symbols included in a time slot, which can make more flexible use of uplink resources and increase the transport block size (TBS) to improve the gain of low density parity check coding (LDPC) coding, effectively improving the uplink coverage performance of PUSCH.
[0082] In conjunction with some embodiments of the first aspect, in some embodiments, the third parameter L is less than or equal to Alternatively, the sum of the second parameter S and the third parameter L is less than or equal to... m is an integer greater than or equal to 2 and less than 32.
[0083] In the above embodiments, the maximum number of symbols included in the time-domain resources of PUSCH can be limited, effectively ensuring the reliability of scheduling.
[0084] In conjunction with some embodiments of the first aspect, in some embodiments, the first information is further used to indicate a fifth parameter K, which is used to indicate the number of times the PUSCH is repeated, K being greater than or equal to 1, and each PUSCH repetition corresponding to one time-domain resource.
[0085] In the above embodiments, the range of values for the third parameter can be increased while repetition is combined, further improving the flexible utilization of uplink resources.
[0086] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resources of the PUSCH based on the first information includes at least one of the following:
[0087] Determine N consecutive time slots starting from the initial time slot as the time slots included in the time domain resource;
[0088] The N time slots that satisfy the first condition, starting from the initial time slot, are determined as the time slots included in the time domain resource;
[0089] Wherein, N is the number of time slots included in the time-domain resources.
[0090] In the above embodiments, the terminal can determine the time slots included in the time domain resources of PUSCH based on the first information by using physical time slot counting or available time slot counting, which can effectively ensure the reliability and flexibility of uplink transmission.
[0091] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resources of the PUSCH based on the first information includes at least one of the following:
[0092] Determine the time domain resources including the time slots for the consecutive N·K time slots starting from the initial time slot as K times the PUSCH repetition;
[0093] The time-domain resources corresponding to the K repetitions of the PUSCH that satisfy the first condition, starting from the initial time slot, are determined as the time slots included in the time domain resources.
[0094] Wherein, N is the number of time slots included in the time-domain resources.
[0095] In the above embodiments, even when repetition is involved, the terminal can still determine the time slots included in the time domain resources of the PUSCH based on the first information by using physical time slot counting or available time slot counting, which can effectively ensure the reliability and flexibility of uplink transmission.
[0096] In conjunction with some embodiments of the first aspect, in some embodiments, the first condition includes: the symbols allocated to the PUSCH within the time slot do not overlap with the first type of symbols;
[0097] The first type of symbols includes at least one of the following: downlink symbols, SSB symbols, and symbols indicating higher-level signaling.
[0098] In the above embodiments, determining the time slots included in the time domain resources of PUSCH based on the first condition can ensure that all symbols allocated to PUSCH can be reliably transmitted uplink, thus ensuring the reliability of communication.
[0099] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resources of the PUSCH based on the first information includes:
[0100] The L consecutive symbols starting from the starting symbol of the starting time slot are determined as the symbols included in the time-domain resource.
[0101] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resources of the PUSCH based on the first information includes:
[0102] The L consecutive symbols starting from the start symbol in the starting time slot of the time-domain resource corresponding to the r-th PUSCH repetition are determined as the symbols included in the time-domain resource corresponding to the r-th PUSCH repetition, where r is an integer greater than 1 and less than or equal to K.
[0103] In conjunction with some embodiments of the first aspect, in some embodiments, determining the time-domain resources of the PUSCH based on the first information includes:
[0104] The number of time slots N included in the time domain resource is determined based on the second parameter S and the third parameter L;
[0105] in,
[0106] In conjunction with some embodiments of the first aspect, in some embodiments, the method includes:
[0107] The number N of resource elements (REs) allocated to the PUSCH within the time-domain resources is determined according to the following formula. RE :
[0108] N RE =min(N·M,N′) RE )·n PRB , or, N RE =N′ RE ·n PRB ;
[0109] in,
[0110] The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to the PUSCH within a Physical Resource Block (PRB). PRB This indicates the number of PRBs allocated to the PUSCH within the time-domain resources;
[0111] This indicates the number of subcarriers included in a PRB. This represents the number of symbols allocated to the PUSCH within the time-domain resources. This indicates the number of first REs in each symbol within the time-domain resource, where the first REs are REs not occupied by data-unused Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) groups. This indicates the overhead of high-level signaling configuration.
[0112] In conjunction with some embodiments of the first aspect, in some embodiments, the method includes:
[0113] Send a second message to the network device, the second message being used to instruct the terminal to support type 1 PUSCH transmission;
[0114] Wherein, when the terminal supports the first type of PUSCH transmission, the terminal supports the third parameter L being greater than
[0115] In the above embodiments, the terminal can report its ability to support the first type of PUSCH transmission through the second information, and then the network device can schedule the corresponding PUSCH time domain resources for the terminal based on this capability. For example, the third parameter can be configured to be greater than the number of symbols in a time slot, thus ensuring the reliability of the scheduling.
[0116] Secondly, embodiments of this disclosure provide a communication method executed by a terminal, the method comprising:
[0117] Obtain first information;
[0118] The time-domain resources of PUSCH are determined based on the first information;
[0119] The first information is used to indicate at least one of the following:
[0120] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0121] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0122] The sixth parameter L indicates the number of symbols corresponding to one nominal repetition.
[0123] The seventh parameter K indicates the nominal number of repetitions, and K is greater than or equal to 1.
[0124] Wherein, the sixth parameter L is greater than Indicates the number of symbols included in a time slot;
[0125] A nominal repetition includes at least one actual repetition, and the time-domain resources of the PUSCH include all symbols corresponding to the actual repetition.
[0126] In the above embodiments, the value of the sixth parameter L is no longer limited by the number of symbols in a single time slot. The number of symbols corresponding to one nominal repetition can be configured to be greater than the number of symbols included in a time slot. This allows for more flexible use of uplink resources and can increase the transport block size (TBS), thereby improving the gain of low-density parity check coding (LDPC) and effectively improving the uplink coverage performance of PUSCH.
[0127] In conjunction with some embodiments of the second aspect, in some embodiments, the sum of the second parameter and the sixth parameter is less than or equal to And / or, the sixth parameter is less than or equal to m is an integer greater than or equal to 2 and less than 32.
[0128] In the above embodiments, the maximum number of symbols included in a single nominal repetition can be limited, effectively ensuring the reliability of scheduling.
[0129] In conjunction with some embodiments of the second aspect, in some embodiments, determining the time-domain resources of the PUSCH based on the first information includes at least one of the following:
[0130] The K·L consecutive symbols starting from the initial symbol in the initial time slot are determined as the symbols corresponding to the K nominal repetitions.
[0131] In the above embodiments, the symbols corresponding to the K nominal repetitions can be accurately determined based on the information indicated by the first information, thus ensuring the reliability of uplink transmission.
[0132] In conjunction with some embodiments of the second aspect, in some embodiments, determining the time-domain resources of the PUSCH based on the first information includes:
[0133] Determine the symbol corresponding to each actual repetition in each of the nominal repetitions;
[0134] In this case, the multiple symbols corresponding to one actual repetition are located in multiple time slots.
[0135] In the above embodiments, nominal repetition is no longer split across time slot boundaries, which can effectively realize actual repetition across time slot boundaries and effectively improve the flexibility of PUSCH time domain resource scheduling.
[0136] In conjunction with some embodiments of the second aspect, in some embodiments, the symbols corresponding to the actual repetition do not include the first type of symbols, which include at least one of the following: downlink symbols, SSB symbols, and symbols indicating higher-layer signaling.
[0137] In conjunction with some embodiments of the second aspect, in some embodiments, the method includes:
[0138] For each of the N time slots corresponding to a nominal repetition, the number N of resource units (REs) allocated to the PUSCH within the N time slots is determined according to the following formula. RE :
[0139] N RE =min(N·M,N′) RE )·n PRB , or, N RE =N′ RE ·n PRB ;
[0140] in,
[0141] The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to the PUSCH within a Physical Resource Block (PRB). PRB This represents the number of PRBs allocated to the PUSCH within the N time slots;
[0142] This indicates the number of subcarriers included in a PRB. This represents the number of symbols allocated to the PUSCH within the N time slots. This represents the number of first REs in each symbol within the N time slots, where the first REs are the REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) groups that are not used by data. This indicates the overhead of high-level signaling configuration.
[0143] In conjunction with some embodiments of the second aspect, in some embodiments, the method includes:
[0144] The number of time slots N corresponding to one nominal repetition is determined based on the second parameter S and the sixth parameter L;
[0145] in,
[0146] In conjunction with some embodiments of the second aspect, in some embodiments, the method includes:
[0147] Send a second message to the network device, the second message being used to instruct the terminal to support type 2 PUSCH transmission;
[0148] Wherein, when the terminal supports the second type of PUSCH transmission, the terminal supports the sixth parameter L being greater than
[0149] In the above embodiments, the terminal can report its ability to support the first type of PUSCH transmission through the second information, and then the network device can schedule the corresponding PUSCH time domain resources for the terminal based on this capability. For example, the sixth parameter can be configured to be greater than the number of symbols in a time slot, thus ensuring the reliability of the scheduling.
[0150] Thirdly, embodiments of this disclosure provide a communication method executed by a network device, the method comprising:
[0151] Send first information, which is used by the terminal to determine the time domain resources of PUSCH;
[0152] The first information is used to indicate at least one of the following:
[0153] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0154] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0155] The third parameter L indicates the number of symbols in the time-domain resource.
[0156] The fourth parameter SLIV is used to indicate the second parameter S and the third parameter L;
[0157] Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot.
[0158] In conjunction with some embodiments of the third aspect, in some embodiments, the third parameter L is less than or equal to Alternatively, the sum of the second parameter S and the third parameter L is less than or equal to... m is an integer greater than or equal to 2 and less than 32.
[0159] In conjunction with some embodiments of the third aspect, the first information is also used to indicate a fifth parameter K, which indicates the number of times the PUSCH is repeated, K being greater than or equal to 1, and each PUSCH repetition corresponding to one time-domain resource.
[0160] In conjunction with some embodiments of the third aspect, N consecutive time slots starting from the initial time slot are the time slots included in the time domain resource;
[0161] The N time slots that satisfy the first condition, starting from the initial time slot, are the time slots included in the time domain resource;
[0162] Wherein, N is the number of time slots included in the time-domain resources.
[0163] In conjunction with some embodiments of the third aspect, the N·K consecutive time slots starting from the initial time slot are the time slots included in the time domain resources corresponding to the K repetitions of the PUSCH;
[0164] Starting from the initial time slot, the N·K time slots that satisfy the first condition are the time slots included in the time domain resources corresponding to the K repetitions of the PUSCH;
[0165] Wherein, N is the number of time slots included in the time-domain resources.
[0166] In conjunction with some embodiments of the third aspect, the first condition includes: the symbols allocated to the PUSCH within the time slot do not overlap with the first type of symbols;
[0167] The first type of symbols includes at least one of the following: downlink symbols, SSB symbols, and symbols indicating higher-level signaling.
[0168] In conjunction with some embodiments of the third aspect, L consecutive symbols starting from the starting symbol of the starting time slot are the symbols included in the time-domain resource.
[0169] In conjunction with some embodiments of the third aspect, L consecutive symbols starting from the start symbol in the starting time slot of the time-domain resource corresponding to the r-th PUSCH repetition constitute the symbols included in the time-domain resource corresponding to the r-th PUSCH repetition, where r is an integer greater than 1 and less than or equal to K. In conjunction with some embodiments of the third aspect, the number of time slots included in the time-domain resource...
[0170] In conjunction with some embodiments of the third aspect, the number N of resource units (REs) allocated to the PUSCH within the time-domain resources is... RE Determined by the following formula:
[0171] N RE =min(N·M,N′) RE )·n PRB , or, N RE =N′ RE ·n PRB ;
[0172] in,
[0173] The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to the PUSCH within a Physical Resource Block (PRB). PRB This indicates the number of PRBs allocated to the PUSCH within the time-domain resources;
[0174] This indicates the number of subcarriers included in a PRB. This represents the number of symbols allocated to the PUSCH within the time-domain resources. This indicates the number of first REs in each symbol within the time-domain resource, where the first REs are REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) group that is not used by data. This indicates the overhead of high-level signaling configuration.
[0175] In conjunction with some embodiments of the third aspect, the method includes:
[0176] The receiving terminal sends a second message, the second message being used to indicate that the terminal supports type 1 PUSCH transmission;
[0177] Wherein, when the terminal supports the first type of PUSCH transmission, the terminal supports the third parameter L being greater than
[0178] Fourthly, embodiments of this disclosure provide a communication method executed by a network device, the method comprising:
[0179] Send first information, which is used by the terminal to determine the time domain resources of PUSCH;
[0180] The first information is used to indicate at least one of the following:
[0181] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0182] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0183] The sixth parameter L indicates the number of symbols corresponding to one nominal repetition.
[0184] The seventh parameter K indicates the nominal number of repetitions, and K is greater than or equal to 1.
[0185] Wherein, the sixth parameter L is greater than Indicates the number of symbols included in a time slot;
[0186] A nominal repetition includes at least one actual repetition, and the time-domain resources of the PUSCH include all symbols corresponding to the actual repetition.
[0187] In some embodiments of the fourth aspect, the sum of the second parameter and the sixth parameter is less than or equal to And / or, the sixth parameter is less than or equal to m is an integer greater than or equal to 2 and less than 32.
[0188] In conjunction with some embodiments of the fourth aspect, K·L consecutive symbols starting from the initial symbol in the initial time slot are the symbols corresponding to the K nominal repetitions.
[0189] In conjunction with some embodiments of the fourth aspect, the multiple symbols corresponding to one actual repetition are located in multiple time slots.
[0190] In conjunction with some embodiments of the fourth aspect, the symbols corresponding to the actual repetition do not include the first type of symbols, which include at least one of the following: downlink symbols, SSB symbols, and symbols indicating higher-layer signaling.
[0191] In conjunction with some embodiments of the fourth aspect, the method includes:
[0192] For each of the N time slots corresponding to a nominal repetition, the number of Resource Units (REs) N allocated to the PUSCH within those N time slots is N. RE Determined by the following formula:
[0193] N RE =min(N·M,N′) RE )·n PRB , or, N RE =N′ RE ·n PRB ;
[0194] in,
[0195] The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to the PUSCH within a Physical Resource Block (PRB). PRB This represents the number of PRBs allocated to the PUSCH within the N time slots;
[0196] This indicates the number of subcarriers included in a PRB. This represents the number of symbols allocated to the PUSCH within the N time slots. This represents the number of first REs in each symbol within the N time slots, where the first REs are the REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) groups that are not used by data. This indicates the overhead of high-level signaling configuration.
[0197] In conjunction with some embodiments of the fourth aspect, the number of time slots corresponding to one nominal repetition
[0198] In conjunction with some embodiments of the fourth aspect, the method includes:
[0199] Receive second information sent by the terminal, the second information being used to indicate that the terminal supports type 2 PUSCH transmission;
[0200] Wherein, when the terminal supports the second type of PUSCH transmission, the terminal supports the sixth parameter L being greater than
[0201] Fifthly, embodiments of this disclosure provide a communication device for performing the communication method described in the first, second, third, or fourth aspects.
[0202] 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 or the second aspect.
[0203] Fifthly, embodiments of this disclosure propose 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 third or fourth aspect.
[0204] 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 or the second aspect.
[0205] In a seventh aspect, embodiments of this disclosure provide a network device, which includes one or more processors; wherein the network device is configured to perform an optional implementation of the third or fourth aspect.
[0206] 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 or second aspect, and the network device is configured to perform the method described in the optional implementation of the third or fourth aspect.
[0207] 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, second, third, or fourth aspects.
[0208] 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 described in the optional implementations of the first, second, third, or fourth aspects.
[0209] 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, second, third, or fourth aspects.
[0210] 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, second, third, or fourth aspects described above.
[0211] 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.
[0212] 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.
[0213] 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.
[0214] 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.
[0215] 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.
[0216] In the embodiments disclosed herein, "multiple" refers to two or more.
[0217] 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.
[0218] 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.
[0219] 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.
[0220] 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.
[0221] In some embodiments, “including A,” “containing A,” “for indicating A,” and “carrying A” can be interpreted as directly carrying A or indirectly indicating A.
[0222] In some embodiments, terms such as "time / frequency" and "time-frequency domain" refer to the time domain and / or frequency domain.
[0223] 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.
[0224] 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”.
[0225] 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.
[0226] In some embodiments, "network" can be interpreted as devices included in a network (e.g., access network devices, core network devices, etc.).
[0227] 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.
[0228] 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.
[0229] 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.
[0230] 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.
[0231] In some embodiments, the acquisition of data, information, etc., may comply with the laws and regulations of the country where the location is situated.
[0232] In some embodiments, data, information, etc., may be obtained with the user's consent.
[0233] 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.
[0234] 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.
[0235] 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.
[0236] In some embodiments, network device 102 may include at least one of access network device and core network device.
[0237] 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.
[0238] 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.
[0239] 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).
[0240] 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.
[0241] 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.
[0242] 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.
[0243] 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.
[0244] 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).
[0245] 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:
[0246] 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.
[0247] 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.
[0248] 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.
[0249] 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.
[0250] 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.
[0251] 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.
[0252] 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.
[0253] 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.
[0254] 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。
[0255] 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.
[0256] In some embodiments, 5G NR PUSCH can support two mapping types:
[0257] 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.
[0258] 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.
[0259] 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.
[0260] Table 1
[0261] 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.
[0262] In some embodiments, 5G NR PUSCH supports repetition transmission, including two repetition types: PUSCH repetition type A and PUSCH repetition type B.
[0263] 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:
[0264] 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.
[0265] 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.
[0266] 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.
[0267] PUSCH Repetition Type B: When the network device configures the terminal device's PUSCH repetition type 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 terminal device to the repetition count K. 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 (Act Rep), as detailed below:
[0268] 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.
[0269] 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.
[0270] 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.
[0271] 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).
[0272] 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).
[0273] 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.
[0274] 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:
[0275] 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.
[0276] 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.
[0277] 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.
[0278] In some embodiments, this disclosure also provides a 5G NR TBS calculation method. The TBS calculation process is as follows:
[0279] Step 1: Determine the number N of REs used for PUSCH transmission within a time slot.RE :
[0280] 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 in 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.
[0281] Then, determine N. RE :
[0282] 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 .
[0283] 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.
[0284] If N info If the value is ≤3824, proceed to step 3; otherwise, proceed to step 4.
[0285] Step 3: If N info If the value is ≤3824, perform the following steps:
[0286] Calculate intermediate variables for quantification in
[0287] Based on Table 2 below, find the value not less than N′. info The minimum value is taken as TBS.
[0288] Table 2
[0289] For example, suppose N′ info The minimum value of TBS, which is not less than 24, is 24, as shown in Table 2.
[0290] For example, suppose N′ info The minimum TBS value, which is not less than 50, is 56, as shown in Table 2.
[0291] 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.
[0292] Step 4: If N info >3824, perform the following steps:
[0293] Calculate intermediate variables for quantification in The round operation represents rounding.
[0294] If R ≤ 1 / 4, in
[0295] If R > 1 / 4, and N′ info >8424, in
[0296] If R > 1 / 4, and N′ info ≤8424 Otherwise,
[0297] 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 repeat. For example, the symbol containing the PUSCH in time slot 3 of FIG1B corresponds to a transmission opportunity. For example, the symbol containing nominal repeat #0 of FIG1E corresponds to a transmission opportunity; the symbol containing nominal repeat #1 of FIG1E corresponds to a transmission opportunity.
[0298] 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 embodiments of the present disclosure relate to a communication method, which includes:
[0299] Step S2101: The terminal sends the second information to the network device.
[0300] In some embodiments, the second information is used to indicate that the terminal supports the first type of PUSCH transmission. Optionally, when the terminal supports the first type of PUSCH transmission, the terminal supports a third parameter L greater than... Indicates the number of symbols included in a time slot.
[0301] In some embodiments, in a first type of PUSCH transmission, the time-domain resources of a PUSCH may include multiple time slots, that is, the symbol length or number of symbols of the time-domain resources of the PUSCH is greater than... Optionally, the determination of multiple time slots of the time domain resources of PUSCH can be made by physical time slot counting or available time slot counting.
[0302] Optionally, when the first type of PUSCH transmission is combined with repetition, each repetition corresponds to a time-domain resource of a PUSCH, and the time-domain resource corresponding to each repetition adopts the same symbol allocation.
[0303] In some implementation examples, the network device receives second information sent by the terminal. Optionally, in response to the second information, the network device configures the time-domain resources of the PUSCH for the terminal and sends first information. Optionally, the number of symbols in the time-domain resources of the PUSCH configured by the network device (i.e., the third parameter L) is greater than or equal to...
[0304] In some embodiments, the method by which the network device configures the time-domain resources of the PUSCH is basically the same as the method by which the terminal determines the time-domain resources of the PUSCH based on the first information, and will not be described in detail here. For example, the network device may determine one or more of the first parameter k2, the second parameter S, the third parameter L, and the fourth parameter SLIV, configure the time-domain resources of the PUSCH according to the above parameters, and instruct the terminal through the first information.
[0305] In some embodiments, the second information may also be referred to as "capability indication information", "transmission type indication", etc., and this disclosure does not limit it.
[0306] In some embodiments, step S2101 can be omitted. Optionally, the terminal can be assumed to support Type 1 PUSCH transmission. In this case, the network device configures the time-domain resources of the PUSCH for the terminal, wherein the number of symbols in the time-domain resources of the PUSCH can be greater than [a certain value].
[0307] In step S2102, the network device sends the first information to the terminal.
[0308] In some embodiments, the first information is used by the terminal to determine the time-domain resources of the PUSCH. Optionally, the number of symbols in the time-domain resources of the PUSCH is greater than... Indicates the number of symbols included in a time slot.
[0309] In some embodiments, the number of symbols included in a time slot may be equal to 14 or other values, and this disclosure does not limit this.
[0310] In some embodiments, the time-domain resources of PUSCH are used to transmit PUSCH.
[0311] In some embodiments, the number of symbols in the time-domain resources of a PUSCH can refer to the number of symbols included in the time-domain resources of the PUSCH.
[0312] In some embodiments, the first information is used by the terminal to determine the time-domain resource allocation parameters of the PUSCH. Optionally, the terminal can determine the time-domain resource allocation parameters of the PUSCH based on the first information. Optionally, 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.
[0313] In some embodiments, the first information is used to indicate one or more time-domain resource allocation parameters.
[0314] 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.
[0315] In some embodiments, the first information or the aforementioned time-domain resource allocation parameters include at least one of the following:
[0316] The first parameter k2 is used to indicate the starting time slot of the time domain resources of PUSCH;
[0317] The second parameter S is used to indicate the starting symbol of the time-domain resources of PUSCH in the starting time slot;
[0318] The third parameter L is used to indicate the number of symbols in the time-domain resources of PUSCH;
[0319] The fourth parameter, SLIV, is used to indicate the second parameter, S, and the third parameter, L.
[0320] In some embodiments, the third parameter L can be greater than 1. That is, the symbol length of the time-domain resources of PUSCH can be greater than the number of symbols included in a time slot.
[0321] It is understandable that the starting time slot of the PUSCH time domain resources is the first time slot included in the PUSCH time domain resources, and the starting symbol of the PUSCH time domain resources in the starting time slot is the first symbol used to transmit PUSCH in the first time slot.
[0322] In some embodiments, the symbol length of a PUSCH can refer to the total number of symbols from the start symbol of the first PUSCH transmission to the end symbol of the last PUSCH transmission.
[0323] The names of the above parameters are not limited. For example, the third parameter L can be called resource length, transmission start and end length, PUSCH symbol length, etc.
[0324] It should be noted that the definition of the third parameter L in the embodiment of Figure 2A differs from the definition of the symbol length L within a time slot or a nominal repetition described in the embodiments preceding Figure 2A. Furthermore, the range of values for the third parameter L in the embodiment of Figure 2A differs from the range of values for the symbol length L in the embodiments preceding Figure 2A.
[0325] For example, referring to Table 1 above, in the case of PUSCH mapping type A and normal cyclic prefix, the value range of the symbol length L is 4 to 14. In the case of PUSCH mapping type B and normal cyclic prefix, the value range of the symbol length L is 1 to 14. In the case of PUSCH mapping type A and extended cyclic prefix, the value range of the symbol length L is 4 to 12. In the case of PUSCH mapping type B and extended cyclic prefix, the value range of the symbol length L is 1 to 12. It can be seen that the upper limit of the symbol length L is limited, and the maximum value of the symbol length L is 14.
[0326] However, in this embodiment, according to the definition of the third parameter L, the upper limit of the value 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 value of the third parameter L is unlimited, making its value more flexible. This flexibility in the value of the third 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. L max It can be 192, 384, or 896, etc.
[0327] In some embodiments, the third parameter L may be directly or indirectly indicated by the first information.
[0328] Direct indication methods include, for example, a first information indication or including a third parameter L.
[0329] An indirect indication method is, for example, that the first information indicates or includes a fourth parameter SLIV. The third parameter L and the second parameter S can be determined based on the fourth parameter SLIV.
[0330] Optionally, the fourth parameter (SLIV) is calculated by the network device in the following way:
[0331] exist In the case of, according to The fourth 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.
[0332] exist In the case of, according to The fourth parameter SLIV is calculated.
[0333] In some embodiments, the third parameter L is less than or equal to Alternatively, the sum of the second parameter S and the third parameter L is less than or equal to... m is an integer greater than or equal to 2 and less than 32.
[0334] In some embodiments, m can be used to limit the number of time slots and symbols included in the time-domain resources of a PUSCH, ensuring that the number of symbols occupied by the time-domain resources of a PUSCH is not excessive. For example, when m = 5, the number of time slots included in the time-domain resources of a PUSCH is less than or equal to 6, and the number of symbols included in the time-domain resources of a PUSCH is less than or equal to... The value of m can be determined according to actual needs, such as 2, 5, 10, etc., and this embodiment does not limit it.
[0335] In some embodiments, the first information is further used to indicate the fifth parameter K, which indicates the number of times PUSCH is repeated, K is greater than or equal to 1, and each PUSCH repetition corresponds to a time-domain resource.
[0336] In some embodiments, the allocation of symbols in the time-domain resources corresponding to each PUSCH repetition can be the same. For example, if K=2, then two symbols can be used to allocate the same time-domain resources for the PUSCH transmission.
[0337] In some embodiments, the terminal obtains the first information specified by the protocol, in which case step S2102 can be omitted.
[0338] In some embodiments, the terminal obtains the first information from the upper layer(s), in which case step S2102 can be omitted.
[0339] In some embodiments, the terminal processes the information to obtain the first information, and step S2102 can be omitted.
[0340] In some embodiments, the terminal 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.
[0341] In step S2103, the terminal determines the time domain resources of PUSCH based on the first information.
[0342] In some embodiments, the terminal first determines the time slots included in the time-domain resources of the PUSCH based on the first information. Optionally, after determining the time slots included in the time-domain resources of the PUSCH, the terminal then determines the symbols included in the time-domain resources of the PUSCH based on the first information.
[0343] In some embodiments, the terminal may determine the time slots included in the time domain resources of the PUSCH based on physical time slot counting. Optionally, the terminal determines that the N consecutive time slots starting from the start time slot are the time slots included in the time domain resources of the PUSCH. Correspondingly, for the network device, the N consecutive time slots starting from the start time slot are the time slots included in the time domain resources of the PUSCH.
[0344] In some embodiments, the terminal may determine the time slots included in the time domain resources of the PUSCH based on the number of available time slots. Optionally, N time slots that satisfy a first condition starting from the initial time slot are determined as the time slots included in the time domain resources of the PUSCH. Correspondingly, for the network device, the N time slots that satisfy the first condition starting from the initial time slot are the time slots included in the time domain resources of the PUSCH.
[0345] In some embodiments, N represents the number of time slots included in the time-domain resources of the PUSCH. Optionally, the number of time slots included in the time-domain resources of the PUSCH can be determined based on the second parameter S and the third parameter L. Optionally, the number of time slots included in the time-domain resources... For example, if L = 18 and S = 3, Then N = 2.
[0346] In some embodiments, the first condition includes: the symbols allocated to the PUSCH within the time slot do not overlap with the first type of symbols. Optionally, the first type of symbols includes at least one of the following: downlink symbols, SSB symbols, and symbols indicated by higher-layer signaling.
[0347] For example, starting from the time slot indicated by the first parameter k2, the judgment is made one time slot at a time. If the symbol allocated to PUSCH in the time slot overlaps with the first type of symbol, then the time slot is not included in the time domain resources of PUSCH. Otherwise, the time slot is included in the time domain resources of PUSCH, until the time domain resources of PUSCH include N time slots.
[0348] In some embodiments, the terminal may determine, based on first information, the symbols allocated to the PUSCH from among the N time slots included in the PUSCH's time-domain resources. Optionally, L consecutive symbols starting from the start symbol of the start time slot are determined as the symbols included in the time-domain resources. Correspondingly, for the network device, L consecutive symbols starting from the start symbol of the start time slot are the symbols included in the time-domain resources.
[0349] For example, if the first parameter k2 = 3, the second parameter S = 2, and the third parameter L = 18, The terminal can use time slot #3 (i.e., time slot with index 3) as the starting time slot, and use symbol #2 (i.e., symbol with index 2) in the starting time slot as the first symbol of the time domain resource of the PUSCH, and the 18 consecutive symbols starting from this symbol (i.e., symbols #2 to #13 in time slot #3, and symbols #0 to #5 in time slot #4) as the symbols included in the time sequence resource of the PUSCH.
[0350] In some embodiments, when physical slot counting is used, if a first-class symbol is determined to exist among L symbols based on a collision criterion, PUSCH can be omitted from transmission on these symbols. For example, if slot #4 is determined to be a downlink slot, the PUSCH on slot #4 can be discarded.
[0351] In some embodiments, if an available time slot counting method is used, N potentially discontinuous time slots can be treated as continuous time slots, and the symbols included in the time-domain resources of PUSCH in these N time slots can be determined. For example, if the first parameter k2 = 3, the second parameter S = 2, and the third parameter L = 18, Then N = 2. When using available time slot counting, if it is determined that symbol #2 (i.e., symbol with index 2, hereinafter the same) to the last symbol in time slot #3 (i.e., time slot with index 3, the same applies to the following identifiers) are not first-class symbols, then time slot #3 satisfies the first condition. If symbols #0 to #5 in time slot #4 include SSB symbols, then time slot #4 does not satisfy the first condition. If symbols #0 to #5 in time slot #5 do not include first-class symbols, then time slot #5 satisfies the first condition. Furthermore, it can be determined that time slots #3 and #5 are time slots included in the time domain resources of PUSCH, and it can be determined that symbols #2 to the last symbol in time slot #3, and symbols #0 to #5 in time slot #5 are symbols included in the time domain resources of PUSCH.
[0352] In some embodiments, the first information includes a fifth parameter K. The terminal determines the temporal resources corresponding to the K repetitions of PUSCH based on the first information; that is, the terminal can determine the temporal resources of the K PUSCHs based on the first information. Optionally, the temporal resources of each PUSCH use the same symbol allocation.
[0353] In some embodiments, the terminal may determine the time-domain resources corresponding to K PUSCH repetitions based on physical timeslot counts. Optionally, the terminal determines that the N·K consecutive timeslots starting from the start timeslot are the timeslots included in the time-domain resources corresponding to the K PUSCH repetitions. Correspondingly, for the network device, the N·K consecutive timeslots starting from the start timeslot are the timeslots included in the time-domain resources corresponding to the K PUSCH repetitions.
[0354] In some embodiments, the terminal may determine the time-domain resources corresponding to K PUSCH repetitions based on the number of available time slots. Optionally, the terminal determines that N·K time slots satisfying a first condition starting from the initial time slot are the time slots included in the time-domain resources corresponding to the K PUSCH repetitions. Correspondingly, for the network device, N·K time slots satisfying the first condition starting from the initial time slot are the time slots included in the time-domain resources corresponding to the K PUSCH repetitions.
[0355] The first condition and the optional implementation methods related to determining N have been described in detail in the above embodiments, and will not be repeated here.
[0356] It is understandable that the aforementioned N·K time slots can be regarded as K groups of time slots, each group of time slots includes N time slots, and each group of N time slots corresponds to the time domain resource of one PUSCH, that is, to one PUSCH repetition. Furthermore, the symbols allocated to the PUSCH in each group of N time slots can be the same.
[0357] In some embodiments, the symbols allocated to the PUSCH can be determined in the same manner for the time-domain resources corresponding to each PUSCH repetition. Optionally, L consecutive symbols starting from the start symbol in the starting timeslot of the time-domain resources corresponding to the r-th PUSCH repetition are determined as the symbols included in the time-domain resources corresponding to the r-th PUSCH repetition, where r is an integer greater than 1 and less than or equal to K. Accordingly, for the network device, L consecutive symbols starting from the start symbol in the starting timeslot of the time-domain resources corresponding to the r-th PUSCH repetition are defined as the symbols included in the time-domain resources corresponding to the r-th PUSCH repetition.
[0358] In some embodiments, the time-domain resources corresponding to the r-th PUSCH repetition may include L consecutive symbols starting from the S-th symbol in the N·(r-1)+1-th time slot out of N·K time slots.
[0359] Optionally, the first parameter k2 is used to indicate the starting time slot of the time-domain resource for the first PUSCH repetition, the second parameter S is used to indicate the starting symbol of the time-domain resource corresponding to each PUSCH repetition in the corresponding starting time slot, and the third parameter L is used to indicate the number of symbols of the time-domain resource corresponding to one PUSCH repetition.
[0360] The starting time slot for each PUSCH repetition can be different. The index of the starting symbol in the starting time slot for each PUSCH repetition can be indicated by the second parameter. For example, if physical time slot counting is used, the first parameter k2 = 3, the second parameter S = 2, the third parameter L = 18, and the fifth parameter K = 2. Then, the starting time slot for the first PUSCH repetition can be time slot #3, the starting time slot for the second PUSCH repetition can be time slot #5, the starting symbol for the first PUSCH repetition is symbol #2 in time slot #3, and the starting symbol for the second PUSCH repetition is symbol #2 in time slot #5.
[0361] It is understandable that if the available time slot count method is used to determine the time domain resources corresponding to a PUSCH repetition, the N potentially discontinuous time slots included in the time domain resources corresponding to a single PUSCH repetition can be regarded as continuous time slots, and the symbols included in the time domain resources of this PUSCH repetition in these N time slots can be determined.
[0362] In this embodiment of the disclosure, the terminal determines the time slots included in the time domain resources of the PUSCH by using available time slot counting or by using physical time slot counting. This can be indicated by the network device, agreed upon by the protocol, or configured by a higher layer. This embodiment of the disclosure does not limit this.
[0363] Step S2104: The terminal determines the number of resource units (REs) allocated to the PUSCH within the time domain resources of the PUSCH.
[0364] In some embodiments, the number (N) of resource units (REs) allocated to the PUSCH within the time-domain resources is determined according to the following formula. RE ): N RE =min(N·M,N′) RE )·n PRB , or, N RE =N′ RE ·n PRB ;
[0365] in,
[0366] The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to PUSCH within a Physical Resource Block (PRB). PRB This indicates the number of PRBs allocated to PUSCH within the time-domain resources;
[0367] This indicates the number of subcarriers included in a PRB. This indicates the number of symbols allocated to PUSCH within the time-domain resources. This indicates the number of first REs in each symbol within the time-domain resource. The first REs are the REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) group that is not used by data. This indicates the overhead of high-level signaling configuration.
[0368] In some embodiments, the number of REs allocated to PUSCH within the time-domain resources of PUSCH is used to determine TBS. Wherein, based on For details on the specific implementation of TBS, please refer to the relevant description preceding Figure 2A, which will not be repeated here.
[0369] 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.
[0370] In some embodiments, terms such as "physical uplink shared channel (PUSCH)" and "UL data" can be used interchangeably.
[0371] In some embodiments, the terms “radio”, “wireless”, “radio access network (RAN)”, “access network (AN)”, and “RAN-based” can be used interchangeably.
[0372] In some embodiments, the terms "synchronization signal (SS)," "synchronization signal block (SSB)," "reference signal (RS)," "pilot," and "pilot signal" can be used interchangeably.
[0373] 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.
[0374] In some embodiments, terms such as “send,” “transmit,” “report,” “distribute,” “transmit,” “bidirectional transmission,” “send and / or receive” can be used interchangeably.
[0375] 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.
[0376] The communication method involved in the embodiments of this disclosure may include at least one of steps S2101 to S2104. 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.
[0377] In some embodiments, steps S2101, S2103 to S2104 are optional, and one or more of these steps may be omitted or substituted in different embodiments.
[0378] In some embodiments, steps S2101, S2102, and S2104 are optional, and one or more of these steps may be omitted or substituted in different embodiments.
[0379] In some embodiments, steps S2101 to S2103 are optional, and one or more of these steps may be omitted or substituted in different embodiments.
[0380] 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.
[0381] Figure 2B is an interactive schematic diagram of a communication method according to an embodiment of the present disclosure. As shown in Figure 2B, the present disclosure relates to a communication method, which includes:
[0382] Step S2201: The terminal sends the second information to the network device.
[0383] In some embodiments, the second information is used to indicate that the terminal supports the second type of PUSCH transmission. Optionally, when the terminal supports the second type of PUSCH transmission, the terminal supports a sixth parameter L greater than... Indicates the number of symbols included in a time slot.
[0384] In some embodiments, a second type of PUSCH transmission may include one or more nominal repetitions, each nominal repetition including at least one actual repetition, and the time-domain resources of the PUSCH include all symbols corresponding to the actual repetitions.
[0385] In some embodiments, the number of symbols corresponding to one nominal repetition is greater than... Indicates the number of symbols included in a time slot.
[0386] In some embodiments, a single actual repetition may include symbols within multiple time slots.
[0387] In some embodiments, each actual repetition is a set of all potentially valid symbols that can be used to transmit PUSCH within a nominal repetition. Potentially valid symbols are symbols other than invalid symbols. Invalid symbols include downlink symbols, SSB symbols, symbols indicated by higher-layer signaling, etc.
[0388] In some embodiments, the network device receives second information sent by the terminal. Optionally, in response to the second information, the network device configures the time-domain resources of the PUSCH for the terminal and sends first information. Optionally, the number of symbols (i.e., the sixth parameter L) of the time-domain resources of the PUSCH configured by the network device is greater than or equal to...
[0389] In some embodiments, the method by which the network device configures the time-domain resources of the PUSCH is basically the same as the method by which the terminal determines the time-domain resources of the PUSCH based on the first information, and will not be described in detail here. For example, the network device may determine one or more of the first parameter k2, the second parameter S, the sixth parameter L, and the seventh parameter K, configure the time-domain resources of the PUSCH according to the above parameters, and instruct the terminal through the first information.
[0390] In some embodiments, the second information may also be referred to as "capability indication information", "transmission type indication", etc., and this disclosure does not limit it.
[0391] In some embodiments, step S2201 is optional. Optionally, the terminal may be assumed to support Type II PUSCH transmission. In this case, the network device configures the time-domain resources for PUSCH for the terminal, wherein the number of symbols in a single nominal repetition may be greater than [missing information].
[0392] In step S2202, the network device sends the first information to the terminal.
[0393] In some embodiments, the first information is used by the terminal to determine the time-domain resources of the PUSCH.
[0394] In some embodiments, the time-domain resources of PUSCH are used to transmit PUSCH.
[0395] In some embodiments, the number of symbols corresponding to a nominal repetition may refer to the number of symbols included in the temporal resource of a nominal repetition.
[0396] In some embodiments, the first information is used by the terminal to determine the time-domain resource allocation parameters of the PUSCH. Optionally, the terminal can determine the time-domain resource allocation parameters of the PUSCH based on the first information. Optionally, 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.
[0397] In some embodiments, the first information is used to indicate one or more time-domain resource allocation parameters.
[0398] 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.
[0399] In some embodiments, the first information or the aforementioned time-domain resource allocation parameters include at least one of the following:
[0400] The first parameter k2 is used to indicate the starting time slot of the time domain resources of PUSCH;
[0401] The second parameter S is used to indicate the starting symbol of the time-domain resources of PUSCH in the starting time slot;
[0402] The sixth parameter L indicates the number of symbols corresponding to one nominal repetition;
[0403] The seventh parameter, K, indicates the nominal number of repetitions.
[0404] In some embodiments, the sixth parameter L can be greater than 1. That is, the number of symbols corresponding to a single nominal repetition can be greater than the number of symbols included in a time slot.
[0405] The names of the above parameters are not limited. For example, the sixth parameter L can be called resource length, transmission start and end length, PUSCH symbol length, etc.
[0406] It should be noted that the definition of the sixth parameter L in the embodiment of Figure 2B is different from the definition of the symbol length L within a time slot or a nominal repetition described in the embodiments preceding Figure 2B. Furthermore, the range of values for the sixth parameter L in the embodiment of Figure 2B is different from the range of values for the symbol length L in the embodiments preceding Figure 2B.
[0407] For example, referring to Table 1 above, in the case of PUSCH mapping type A and normal cyclic prefix, the value range of the symbol length L is 4 to 14. In the case of PUSCH mapping type B and normal cyclic prefix, the value range of the symbol length L is 1 to 14. In the case of PUSCH mapping type A and extended cyclic prefix, the value range of the symbol length L is 4 to 12. In the case of PUSCH mapping type B and extended cyclic prefix, the value range of the symbol length L is 1 to 12. It can be seen that the upper limit of the symbol length L is limited, and the maximum value of the symbol length L is 14.
[0408] However, in this embodiment, according to the definition of the sixth parameter L, the upper limit of the value 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 value of the sixth parameter L is unlimited, making its value more flexible. This flexibility in the value of the sixth parameter L is beneficial for improving the TDRA flexibility of PUSCH. For example, for a regular cycle prefix, L... max It can be 224, 488, or 896, etc.; for extended cyclic prefixes. L max It can be 192, 384, or 896, etc.
[0409] In some embodiments, the sixth parameter L is less than or equal to Alternatively, the sum of the second parameter S and the sixth parameter L is less than or equal to... m is an integer greater than or equal to 2 and less than 32.
[0410] In some embodiments, m can be used to limit the number of time slots and symbols included in a nominally repeated time-domain resource, ensuring that the number of symbols occupied by a nominally repeated time-domain resource is not excessive. For example, when m = 5, the number of time slots included in a nominal repetition is less than or equal to 6, and the number of symbols included in a nominal repetition is less than or equal to... The value of m can be determined according to actual needs, such as 2, 5, 10, etc., and this embodiment does not limit it.
[0411] In some embodiments, the terminal obtains the first information specified by the protocol, in which case step S2202 can be omitted.
[0412] In some embodiments, the terminal obtains the first information from the upper layer(s), in which case step S2202 can be omitted.
[0413] In some embodiments, the terminal processes the information to obtain the first information, and step S2202 can be omitted.
[0414] In some embodiments, the terminal autonomously implements the function indicated by the first information, or the above function is a default or default value, in which case step S2202 can be omitted.
[0415] In step S2203, the terminal determines the time domain resources of PUSCH based on the first information.
[0416] In some embodiments, the terminal first determines the time slots included in the time-domain resources of the PUSCH based on the first information. Optionally, after determining the time slots included in the time-domain resources of the PUSCH, the terminal then determines the symbols included in the time-domain resources of the PUSCH based on the first information.
[0417] In some embodiments, the symbols corresponding to the K nominal repetitions can be determined first, and then the symbols that are actually repeated can be determined. The actual number of repetitions is greater than or equal to K.
[0418] In some embodiments, the terminal may determine that K·L consecutive symbols starting from the start symbol in the start time slot are the symbols corresponding to K nominal repetitions. This start time slot is the start time slot indicated by the first information (e.g., the time slot with index k2), and the start symbol is also the start symbol indicated by the first information (e.g., the symbol with index S in time slot #k2). Correspondingly, for the network device, K·L consecutive symbols starting from the start symbol in the start time slot are the symbols corresponding to K nominal repetitions.
[0419] In some embodiments, the terminal can determine the symbol corresponding to each actual repetition in each nominal repetition. Optionally, the multiple symbols corresponding to one actual repetition can be located in multiple time slots.
[0420] In some embodiments, the symbols corresponding to the actual repeats do not include the first type of symbols, which include at least one of the following: downlink symbols, SSB symbols, and symbols indicated by higher-layer signaling. Optionally, the first type of symbols included in the nominal repeats can be excluded, and the remaining symbols are the symbols corresponding to the actual repeats. Optionally, each nominal repeat can be divided into one or more actual repeats based on the first type of symbols.
[0421] For example, if the first parameter k2 = 3, the second parameter S = 2, the sixth parameter = 18, and the seventh parameter K = 2, Therefore, it can be determined that the symbols corresponding to these two nominal repetitions are the 36 consecutive symbols starting from symbol #2 (symbol with index 2) in time slot #3 (time slot with index 3). That is, the first nominal repetition includes symbols #2 to #13 in time slot #3 and symbols #0 to #5 in time slot #4, and the second nominal repetition includes symbols #0 to #13 in time slot #5 and symbols #0 to #3 in time slot #6.
[0422] In some embodiments, after determining the symbols corresponding to the K nominal repetitions, the terminal determines the symbols corresponding to each actual repetition in each nominal repetition. Optionally, the multiple symbols corresponding to one nominal repetition may be located in multiple time slots. For example, in the first nominal repetition in the above example, the symbols corresponding to one actual repetition may include symbols #8 to #13 in time slot #3 and symbols #0 to #5 in time slot #4, wherein symbol #7 in time slot #3 may be a first-class symbol.
[0423] In step S2204, the terminal determines the number of resource units (REs) allocated to PUSCH within the time-domain resources corresponding to one nominal repetition.
[0424] In some embodiments, the terminal determines the number of Resource Units (REs) allocated to the PUSCH within N time slots corresponding to one nominal repetition according to the following formula (N). RE ): N RE =min(N·M,N′) RE )·n PRB , or, N RE =N′ RE ·n PRB ;
[0425] in,
[0426] The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to PUSCH within a Physical Resource Block (PRB). PRB This represents the number of PRBs allocated to PUSCH within N time slots;
[0427] This indicates the number of subcarriers included in a PRB. This represents the number of symbols allocated to PUSCH within N time slots. This represents the number of first REs in each symbol within N time slots. The first REs are the REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) groups that are not used by data. This indicates the overhead of high-level signaling configuration.
[0428] In some embodiments, N is the number of time slots included in the time-domain resources corresponding to one nominal repetition. Optionally, the number of time slots included in the time-domain resources corresponding to one nominal repetition can be determined based on the second parameter S and the sixth parameter L. Optionally, For example, if L = 18 and S = 3, Then N = 2.
[0429] In some embodiments, the number of REs allocated to PUSCH within the time-domain resources corresponding to a single nominal repetition is used to determine the TBS. Wherein, based on For details on the specific implementation of TBS, please refer to the relevant description preceding Figure 2B, which will not be repeated here.
[0430] 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.
[0431] In some embodiments, terms such as "physical uplink shared channel (PUSCH)" and "UL data" can be used interchangeably.
[0432] In some embodiments, the terms “radio”, “wireless”, “radio access network (RAN)”, “access network (AN)”, and “RAN-based” can be used interchangeably.
[0433] In some embodiments, the terms "synchronization signal (SS)," "synchronization signal block (SSB)," "reference signal (RS)," "pilot," and "pilot signal" can be used interchangeably.
[0434] 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.
[0435] In some embodiments, terms such as “send,” “transmit,” “report,” “distribute,” “transmit,” “bidirectional transmission,” “send and / or receive” can be used interchangeably.
[0436] 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.
[0437] The communication method involved in the embodiments of this disclosure may include at least one of steps S2201 to S2204. 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.
[0438] In some embodiments, steps S2201, S2203 to S2204 are optional, and one or more of these steps may be omitted or substituted in different embodiments.
[0439] In some embodiments, steps S2201, S2202, and S2204 are optional, and one or more of these steps may be omitted or substituted in different embodiments.
[0440] In some embodiments, steps S2201 to S2203 are optional, and one or more of these steps may be omitted or substituted in different embodiments.
[0441] 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.
[0442] Figure 3A is an interactive schematic diagram illustrating a communication method according to an embodiment of the present disclosure. As shown in Figure 3A, the present disclosure relates to a communication method, which includes:
[0443] Step S3101: The network device sends the first information to the terminal.
[0444] The optional implementation of step S3101 can be found in the optional implementation of step S2102 in Figure 2A, and other related parts in the embodiments involved in Figure 2A, which will not be repeated here.
[0445] In some embodiments, the first information is used to indicate at least one of the following: a first parameter k2, which indicates the starting time slot of the time-domain resource; a second parameter S, which indicates the starting symbol of the time-domain resource in the starting time slot; a third parameter L, which indicates the number of symbols of the time-domain resource; and a fourth parameter SLIV, which indicates the second parameter S and the third parameter L.
[0446] Where L is greater than Indicates the number of symbols included in a time slot.
[0447] In step S3102, the terminal determines the time domain resources of PUSCH based on the first information.
[0448] The optional implementation of step S3102 can be found in the optional implementation of step S2103 in Figure 2A, as well as other related parts in the embodiments involved in Figure 2A, which will not be repeated here.
[0449] In some embodiments, the third parameter L is less than or equal to Alternatively, the sum of the second parameter S and the third parameter L is less than or equal to... m is an integer greater than or equal to 2 and less than 32.
[0450] In some embodiments, the first information is further used to indicate the fifth parameter K, which indicates the number of times PUSCH is repeated, K is greater than or equal to 1, and each PUSCH repetition corresponds to a time-domain resource.
[0451] In some embodiments, the terminal determines the time-domain resources of the PUSCH based on the first information, including at least one of the following:
[0452] Determine the N consecutive time slots starting from the initial time slot as the time slots included in the time domain resources;
[0453] The N time slots that satisfy the first condition, starting from the initial time slot, are identified as the time slots included in the time domain resources;
[0454] Where N is the number of time slots included in the time-domain resources.
[0455] In some embodiments, the terminal determines the time-domain resources of the PUSCH based on the first information, including at least one of the following:
[0456] Determine the time domain resources including the time slots for the K consecutive time slots starting from the initial time slot, corresponding to the K PUSCH repetitions;
[0457] Determine the time-domain resources including the time slots that satisfy the first condition starting from the initial time slot for K PUSCH repetitions;
[0458] Where N is the number of time slots included in the time-domain resources.
[0459] In some embodiments, the first condition includes: the symbols allocated to PUSCH within a time slot do not overlap with the first type of symbols;
[0460] The first category of symbols includes at least one of the following: downlink symbols, SSB symbols, and symbols indicating higher-level signaling.
[0461] In some embodiments, the terminal determines the time-domain resources of the PUSCH based on the first information, including:
[0462] The L consecutive symbols starting from the first symbol of the initial time slot are identified as the symbols included in the time-domain resources.
[0463] In some embodiments, the terminal determines the time-domain resources of the PUSCH based on the first information, including:
[0464] The L consecutive symbols starting from the start symbol in the start time slot of the time-domain resource corresponding to the r-th PUSCH repetition are determined as the symbols included in the time-domain resource corresponding to the r-th PUSCH repetition, where r is an integer greater than 1 and less than or equal to K. In some embodiments, determining the time-domain resource of the PUSCH based on the first information includes:
[0465] Based on the second parameter S and the third parameter L, determine the number of time slots N included in the time domain resources;
[0466] in,
[0467] In some embodiments, the method further includes:
[0468] The terminal determines the number N of resource units (REs) allocated to the PUSCH within the time domain resources according to the following formula. RE :
[0469] N RE =min(N·M,N′) RE )·n PRB , or, N RE =N′ RE ·n PRB ;
[0470] in,
[0471] The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to PUSCH within a Physical Resource Block (PRB). PRB This indicates the number of PRBs allocated to PUSCH within the time-domain resources;
[0472] This indicates the number of subcarriers included in a PRB. This indicates the number of symbols allocated to PUSCH within the time-domain resources. This indicates the number of first REs in each symbol within the time-domain resource. The first REs are the REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) group that is not used by data. This indicates the overhead of high-level signaling configuration.
[0473] In some embodiments, the method further includes:
[0474] The terminal sends a second message to the network device, the second message being used to indicate that the terminal supports Type I PUSCH transmission;
[0475] When the terminal supports Type I PUSCH transmission, the terminal supports the third parameter L being greater than...
[0476] 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.
[0477] Figure 3B is an interactive schematic diagram illustrating a communication method according to an embodiment of the present disclosure. As shown in Figure 3B, the embodiments of the present disclosure relate to a communication method, which includes:
[0478] Step S3201: The network device sends the first information to the terminal.
[0479] The optional implementation of step S3201 can be found in step S2102 of Figure 2A, the optional implementation of step S3101 of Figure 3A, and other related parts in the embodiments involved in Figures 2A and 3A, which will not be repeated here.
[0480] In step S3202, the terminal determines the N time slots included in the time domain resources of PUSCH.
[0481] The optional implementation of step S3202 can be found in step S2103 of Figure 2A, the optional implementation of step S3102 of Figure 3A, and other related parts in the embodiments involved in Figures 2A and 3A, which will not be repeated here.
[0482] In step S3203, the terminal determines the symbols included in the time domain resources of PUSCH in N time slots.
[0483] The optional implementation of step S3203 can be found in step S2103 of Figure 2A, the optional implementation of step S3102 of Figure 3A, and other related parts in the embodiments involved in Figures 2A and 3A, which will not be repeated here.
[0484] 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.
[0485] Figure 3C is an interactive schematic diagram illustrating a communication method according to an embodiment of the present disclosure. As shown in Figure 3C, the embodiments of the present disclosure relate to a communication method, which includes:
[0486] Step S3301: The network device sends the first information to the terminal.
[0487] The optional implementation of step S3301 can be found in the optional implementation of step S3101 in Figure 3A, and other related parts in the embodiments involved in Figures 2A and 3A, which will not be repeated here.
[0488] In step S3302, the terminal determines the time slots included in the time domain resources corresponding to the K PUSCH repetitions for N·K time slots.
[0489] The optional implementation of step S3302 can be found in step S2103 of Figure 2A, the optional implementation of step S3102 of Figure 3A, and other related parts in the embodiments involved in Figures 2A and 3A, which will not be repeated here.
[0490] In step S3303, the terminal determines the symbols included in the time-domain resources corresponding to each PUSCH repetition.
[0491] The optional implementation of step S3303 can be found in step S2103 of Figure 2A, the optional implementation of step S3102 of Figure 3A, and other related parts in the embodiments involved in Figures 2A and 3A, which will not be repeated here.
[0492] 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.
[0493] Figure 3D is an interactive schematic diagram illustrating a communication method according to an embodiment of the present disclosure. As shown in Figure 3D, the embodiments of the present disclosure relate to a communication method, which includes:
[0494] Step S3401: The network device sends the first information to the terminal.
[0495] The optional implementation of step S3401 can be found in step S2102 of Figure 2A, the optional implementation of step S3101 of Figure 3A, and other related parts in the embodiments involved in Figures 2A and 3A, which will not be repeated here.
[0496] In step S3402, the terminal determines the symbol corresponding to the K nominal repetitions.
[0497] The optional implementation of step S3402 can be found in step S2103 of Figure 2A, the optional implementation of step S3102 of Figure 3A, and other related parts in the embodiments involved in Figures 2A and 3A, which will not be repeated here.
[0498] In step S3403, the terminal determines the symbol corresponding to each actual repetition in each nominal repetition.
[0499] The optional implementation of step S3403 can be found in step S2103 of Figure 2A, the optional implementation of step S3102 of Figure 3A, and other related parts in the embodiments involved in Figures 2A and 3A, which will not be repeated here.
[0500] 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.
[0501] Figure 3E is an interactive schematic diagram illustrating a communication method according to an embodiment of the present disclosure. As shown in Figure 3E, the present disclosure relates to a communication method, which includes:
[0502] Step S3501: The network device sends the first information to the terminal.
[0503] The optional implementation of step S3501 can be found in the optional implementation of step S2202 in Figure 2B, as well as other related parts in the embodiments involved in Figures 2A and 2B, which will not be repeated here.
[0504] In some embodiments, the first information is used to indicate at least one of the following: a first parameter k2, which indicates the starting time slot of the time-domain resource; a second parameter S, which indicates the starting symbol of the time-domain resource in the starting time slot; a sixth parameter L, which indicates the number of symbols corresponding to one nominal repetition; and a seventh parameter K, which indicates the number of nominal repetitions, where K is greater than or equal to 1.
[0505] Where L is greater than Indicates the number of symbols included in a time slot.
[0506] In step S3502, the terminal determines the time domain resources of PUSCH based on the first information.
[0507] The optional implementation of step S3502 can be found in the optional implementation of step S2203 in Figure 2B, as well as other related parts in the embodiments involved in Figures 2A and 2B, which will not be repeated here.
[0508] In some embodiments, a nominal repetition includes at least one actual repetition, and the time-domain resources of PUSCH include all symbols corresponding to the actual repetition.
[0509] In some embodiments, the sum of the second parameter and the sixth parameter is less than or equal to And / or, the sixth parameter is less than or equal to m is an integer greater than or equal to 2 and less than 32.
[0510] In some embodiments, the terminal determines the time-domain resources of the PUSCH based on the first information, including at least one of the following:
[0511] Identify the K·L consecutive symbols starting from the initial symbol in the initial time slot as the symbols corresponding to the K nominal repetitions.
[0512] In some embodiments, determining the time-domain resources of the PUSCH based on the first information includes:
[0513] Determine the symbol corresponding to each actual repetition in each nominal repetition;
[0514] In this case, the multiple symbols corresponding to one actual repetition are located in multiple time slots.
[0515] In some embodiments, the symbols actually repeated do not include the first type of symbols, which include at least one of the following: downlink symbols, SSB symbols, and symbols indicated by higher-level signaling.
[0516] In some embodiments, the method includes:
[0517] For a single nominal repetition corresponding to N time slots, the terminal determines the number N resource units (REs) allocated to the PUSCH within those N time slots according to the following formula. RE :
[0518] N RE =min(N·M,N′) RE )·n PRB , or, N RE =N′ RE ·n PRB ;
[0519] in,
[0520] The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to PUSCH within a Physical Resource Block (PRB). PRB This represents the number of PRBs allocated to PUSCH within N time slots;
[0521] This indicates the number of subcarriers included in a PRB. This represents the number of symbols allocated to PUSCH within N time slots. This represents the number of first REs in each symbol within N time slots. The first REs are the REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) groups that are not used by data. This indicates the overhead of high-level signaling configuration.
[0522] In some embodiments, the method includes:
[0523] The terminal determines the number of time slots N corresponding to one nominal repetition based on the second parameter S and the sixth parameter L;
[0524] in,
[0525] In some embodiments, the method includes:
[0526] The terminal sends a second message to the network device, which is used to indicate that the terminal supports type 2 PUSCH transmission;
[0527] When the terminal supports Type II PUSCH transmission, the terminal supports the sixth parameter L being greater than...
[0528] 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.
[0529] Figure 4A is a flowchart illustrating a communication method according to an embodiment of the present disclosure. As shown in Figure 4A, the present disclosure relates to a communication method, which includes:
[0530] Step S4101: The terminal determines the time domain resources of PUSCH.
[0531] In some embodiments, the first information is used to indicate a first time-domain resource, the time-domain resource of which is PUSCH. Optionally, the first time-domain resource is a time-domain resource used by the terminal device to transmit a first signal.
[0532] In some embodiments, the terminal device receives first information sent by the network device and determines a first time domain resource based on the first information.
[0533] In some embodiments, the terminal device determines the first TBS based on the first information.
[0534] Among them, the first time-domain resource is the time-domain resource of PUSCH.
[0535] In some embodiments, the method for determining the first time-domain resource differs depending on the transmission type of the PUSCH.
[0536] For the first type of PUSCH transmission:
[0537] Optionally, the first information includes a first parameter k2, which is used to determine the starting time slot of the first time domain resource.
[0538] Optionally, the first information includes a second parameter S, which is used to determine the start symbol of the first time-domain resource in its start time slot. For example, the second parameter S indicates the index of the start symbol of the first time-domain resource in its start time slot; that is, the index of the start symbol of the first time-domain resource in its start time slot is the second parameter S.
[0539] Optionally, the first information includes a third parameter L, which is used to determine the number of symbols for the first time-domain resource.
[0540] Among them, S+L>14.
[0541] Optional, in This indicates the number of symbols included in a time slot.
[0542] Optionally, the number of time slots N included in the first time-domain resource is determined based on the first parameter k2, the second parameter S, and the third parameter L. For example,
[0543] Optionally, the symbol of each of the N time slots included in the first time domain resource is determined according to the second parameter S and the third parameter L.
[0544] For example:
[0545] For the first time slot out of N time slots: the first time domain resource includes the symbol indicated by the start symbol S to the last symbol in that time slot;
[0546] For the last time slot out of N time slots: the first time domain resource includes the first symbol within that time slot up to the index... The symbol (or the first) (a symbol);
[0547] For the other time slots in the N time slots: the first time domain resource includes all symbols within that time slot.
[0548] Optionally, the time slots included in the first time-domain resource are determined based on the first parameter k2 and the number of time slots N. For example, the first time-domain resource includes N consecutive time slots starting from the time slot indicated by the first parameter k2. It should be understood that this method is referred to as physical time slot counting.
[0549] Optionally, the time slots included in the first time domain resource are determined based on the first parameter k2, the number of time slots N, and "the symbol of each of the N time slots included in the first time domain resource". For example, starting from the time slot indicated by the first parameter k2, each time slot is evaluated sequentially. If the symbol of the first time domain resource in that time slot overlaps with a first type of symbol, then that time slot is not included in the first time domain resource; otherwise, that time slot is included in the first time domain resource, until the first time domain resource includes N time slots. It should be understood that this method is called available time slot counting.
[0550] Optionally, the first type of symbols includes downlink symbols and SSB symbols. For example, the downlink symbols are configured by the higher-level signaling tdd-UL-DL-ConfigurationCommon and tdd-UL-DL-ConfigurationDedicated, and the SSB symbols are configured by the higher-level signaling ssb-PositionsInBurst.
[0551] Optionally, the first type of PUSCH transfer can be used in conjunction with repetition. The method for determining the first time domain resource when the first type of PUSCH is used in conjunction with repetition will be introduced later.
[0552] Optionally, the first information includes a fourth parameter K, which indicates the number of repetitions of PUSCH. It should be understood that K > 1.
[0553] Optionally, the number of time slots included in the first time domain resource is N×K.
[0554] Optionally, the symbol for each of the N×K time slots included in the first time-domain resource is:
[0555] For the 1st, N+1th, 2N+1th, ... (K-1)N+1th time slot, or the time slot indexed 0, N, 2N, ... (K-1)N, or the first time slot of each repetition: the first time domain resource includes the symbol indicated by the start symbol S to the last symbol in that time slot;
[0556] For the Nth, 2N, 3N, ..., KNth time slot, or the time slot with index N-1, 2N-1, 3N-1, ..., KN-1, or the last time slot in each repetition: the first time domain resource includes the first symbol within that time slot up to the index... The symbol (or the first) (a symbol);
[0557] For other time slots in the N×K time slots: all symbols within that time slot.
[0558] Optionally, the physical time slot counting method: The first time domain resource includes N×K consecutive time slots starting from the time slot indicated by the first parameter k2.
[0559] Optionally, a time slot counting scheme can be used: starting from the time slot indicated by the first parameter k2, each time slot is judged one by one. If the symbol of the first time domain resource in the time slot overlaps with the first type of symbol, then the time slot is not included in the first time domain resource. Otherwise, the time slot is included in the first time domain resource, until the first time domain resource includes N×K time slots.
[0560] It should be understood that if the first type of PUSCH is combined and reused, the first time-domain resource is repeated in the time domain with N time slots as the granularity.
[0561] It should be understood that if K=1, it is equivalent to the first type of PUSCH not using repetition.
[0562] It should be understood that the number of symbols of the first time-domain resource in a set (i.e., in one repetition) of N time slots is L. If it is a physical time slot count, these L symbols must be continuous in the time domain; if it is an available time slot count, these L symbols may be discontinuous in the time domain; between repetitions, the first time-domain resource may also be discontinuous.
[0563] For example, Figures 4B to 4E provide schematic diagrams of the first type of PUSCH transmission.
[0564] Figures 4B and 4C are schematic diagrams of the first type of PUSCH transmission without reuse. Figure 4A shows the physical timeslot count, and Figure 4C shows the available timeslot count. k2 indicates timeslot #4 in the figure. S=2, L=24, so the number of timeslots for the first time domain resource is N=2. As can be seen from Figure 4B, the first time domain resource includes two timeslots, namely timeslot #4 and timeslot #5, i.e., PUSCH slot #0 and PUSCH slot #1 in Figure 4B. The first time domain resource includes the last 12 symbols in timeslot #4 and the first 12 symbols in timeslot #5. Since timeslot #5 is a downlink timeslot, according to the conflict criterion, the PUSCH on timeslot #5 will be discarded. As can be seen from Figure 4C, the first time domain resource includes the last 12 symbols in the first time slot and the first time domain resource includes the first 12 symbols in the second time slot. According to the available time slot counting criteria, the first time slot is time slot #4 and the second time slot is time slot #9. That is, time slots #4 and #9 are the first two time domain resources that will not overlap with downlink symbols and SSB symbols, i.e., PUSCH slot #0 and PUSCH slot #1 in Figure 4C.
[0565] Figures 4D and 4E are schematic diagrams of the first type of PUSCH transmission combined with reuse. Figure 4D shows the physical timeslot count, and Figure 4E shows the available timeslot count. k2 indicates timeslot #3 in the figure. S=2, L=24, K=2, so the number of timeslots in the first time domain resource is N×K=4. As can be seen from Figure 4D, the first time domain resource includes four timeslots, namely timeslot #3, timeslot #4, timeslot #5, and timeslot #6. The first time domain resource includes the last 12 symbols of timeslots #3 and #5, and the first 12 symbols of timeslots #4 and #6. Since timeslots #5 and #6 are downlink timeslots, according to the conflict criterion, the PUSCH on timeslots #5 and #6 will be discarded, that is, PUSCH repetition #1 in Figure 4D is discarded. As shown in Figure 4E, the first time domain resource includes the last 12 symbols of the first and third time slots, and the first 12 symbols of the second and fourth time slots. According to the available time slot counting criteria, the first time slot is time slot #3, the second time slot is time slot #4, the third time slot is time slot #8, and the fourth time slot is time slot #9. That is, time slots #3, #4, #8, and #9 are the first four time slots of the first time domain resource that will not overlap with downlink symbols and SSB symbols, i.e., PUSCH repetition #0 and PUSCH repetition #1 in Figure 4E.
[0566] Optionally, for the first type of PUSCH transmission, the transmission timing defines all symbols included in the first time domain resource within a time slot, that is, all symbols allocated to PUSCH within a time slot.
[0567] Optionally, TBS can be determined based on the following parameters: N RE =min(N·M,N′) RE )·n PRB or N RE =N′ RE ·n PRB ,in
[0568] Where M = 156, 168, or configured via higher-level signaling.
[0569] It should be understood that in the embodiments prior to Figure 2A or Figure 2B, the time-domain resources of TBoMS are the same in each time slot, but in the embodiments of this disclosure, the time-domain resources of TBoMS are different in each time slot; in addition, the details of the calculation formula for TBS are also different, but they are essentially the same, that is, resources on multiple time slots determine TBS.
[0570] For the second type of PUSCH transmission:
[0571] It should be understood that the second type of PUSCH transmission is an improvement on the PUSCH repetition type B mentioned in the embodiments preceding Figure 2A or Figure 2B.
[0572] Optionally, the first information includes the first parameter k2, the second parameter S, the third parameter L, and the fourth parameter K. Further optional, in This indicates the number of symbols included in a time slot.
[0573] Optionally, the second time-domain resource is determined based on the first parameter k2, the second parameter S, the third parameter L, and the fourth parameter K. The second time-domain resource is the time-domain resource corresponding to the nominal repetition.
[0574] Optionally, the first time-domain resource is the time-domain resource corresponding to the actual repeat. A nominal repeat includes at least one actual repeat, and each actual repeat is a set of all potentially valid symbols within a nominal repeat that can be used to transmit PUSCH. Potentially valid symbols are symbols other than invalid symbols, and invalid symbols include downlink symbols, SSB symbols, symbols indicated by higher-layer signaling, etc. It should be understood that this invention does not limit the nominal repeat to being split into two actual repeats when crossing time slot boundaries, so that the actual repeat can be transmitted completely. The system bits under certain conditions ensure communication reliability.
[0575] For example, Figure 4F is a schematic diagram of the second type of PUSCH transmission according to an embodiment of this disclosure, where k2 indicates time slot #2, S=0, L=21, K=2, and the 8th and 9th symbols of time slot #2 are invalid symbols. As can be seen from the figure, the PUSCH includes two nominal repetitions. Due to the invalid symbols, the first nominal repetition includes two actual repetitions. The second nominal repetition is the actual repetition, where the second actual repetition (Act rep #1) and the third actual repetition (Act rep #2) both cross time slot boundaries.
[0576] Optionally, for the second type of PUSCH transmission, the TBS calculation method is the same as that for the first type of PUSCH transmission.
[0577] In some embodiments, the terminal device sends a first signal, the time domain resources for sending the first signal are determined based on the first time domain resources, the first signal carries a first TB, and the size of the first TB is a first TBS.
[0578] In some embodiments, the network device receives a first signal sent by the terminal device according to a first time domain resource.
[0579] In some embodiments, the terminal device determines the first TB based on the first signal and the first TBS.
[0580] It should be understood that network devices and terminal devices use the same method to determine the first time domain resource and the first TBS.
[0581] It should be understood that the first time-domain resource is used to determine the time-domain resources for transmitting and receiving the first signal. The time-domain resources actually used for transmitting and receiving the first signal may be different from the first time-domain resource. For example, according to some conflict criteria, the time-domain resources in the first time-domain resource that are conflicted cannot be used to transmit the first signal.
[0582] Optionally, the terminal device may report terminal capabilities to the network device, including:
[0583] Does it support Type 1 PUSCH transport type; and / or,
[0584] Does it support Type 2 PUSCH transport type; and / or,
[0585] Whether it supports the determination of actual repetition, that nominal repetition is no longer split across time slot boundaries, or in other words, whether it supports execution rate matching between time slot edges.
[0586] In this embodiment of the disclosure, by increasing the length of L, uplink resources can be utilized more flexibly, and a larger L can result in a larger TBS, thereby improving the gain of LDPC encoding. Both of these aspects can effectively improve the uplink coverage performance of PUSCH.
[0587] 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.
[0588] 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.
[0589] 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.
[0590] 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.
[0591] In this embodiment, the processor is a circuit with signal processing capabilities. In one implementation, the processor can be a circuit with instruction read and execute capabilities, such as a Central Processing Unit (CPU), a microprocessor, a graphics processing unit (GPU) (which can be understood as a microprocessor), or a digital signal processor (DSP). In another implementation, the processor can implement certain functions through the logical relationships of hardware circuits. The logical relationships of the aforementioned hardware circuits are fixed or reconfigurable. For example, the processor is a hardware circuit implemented using an application-specific integrated circuit (ASIC) or a programmable logic device (PLD), such as an FPGA. In a reconfigurable hardware circuit, the process of the processor loading a configuration document and configuring the hardware circuit can be understood as the process of the processor loading instructions to implement the functions of some or all of the above units or modules. In addition, it can also be hardware circuits designed for artificial intelligence, which can be understood as ASICs, such as Neural Network Processing Units (NPUs), Tensor Processing Units (TPUs), and Deep Learning Processing Units (DPUs).
[0592] Figure 5A is a schematic diagram of the structure of a terminal proposed in an embodiment of this disclosure. As shown in Figure 5A, the terminal 5100 may include at least one of a transceiver module 5101, a processing module 5102, etc.
[0593] In some embodiments, the transceiver module 5101 is used to acquire first information;
[0594] Processing module 5102 is used to determine the time-domain resources of PUSCH based on the first information;
[0595] The first information is used to indicate at least one of the following:
[0596] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0597] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0598] The third parameter L indicates the number of symbols in the time-domain resource.
[0599] The fourth parameter SLIV is used to indicate the second parameter S and the third parameter L;
[0600] Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot.
[0601] In some embodiments, the transceiver module 5101 is used to acquire first information;
[0602] Processing module 5102 is used to determine the time-domain resources of PUSCH based on the first information;
[0603] The first information is used to indicate at least one of the following:
[0604] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0605] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0606] The sixth parameter L indicates the number of symbols corresponding to one nominal repetition.
[0607] The seventh parameter K indicates the nominal number of repetitions, and K is greater than or equal to 1.
[0608] Wherein, the sixth parameter L is greater than Indicates the number of symbols included in a time slot;
[0609] A nominal repetition includes at least one actual repetition, and the time-domain resources of the PUSCH include all symbols corresponding to the actual repetition.
[0610] Optionally, the transceiver module 5101 is used to perform at least one of the communication steps such as sending and / or receiving performed by the terminal in any of the above methods, which will not be described in detail here. Optionally, the processing module 5102 is used to perform at least one of the other steps performed by the terminal in any of the above methods, which will not be described in detail here.
[0611] Figure 5B is a schematic diagram of the structure of a network device proposed in an embodiment of this disclosure. As shown in Figure 5B, the network device 5200 may include at least one of a transceiver module 5201, a processing module 5202, etc.
[0612] In some embodiments, the transceiver module 5201 is used to send first information, which is used by the terminal to determine the time domain resources of the PUSCH.
[0613] The first information is used to indicate at least one of the following:
[0614] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0615] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0616] The third parameter L indicates the number of symbols in the time-domain resource.
[0617] The fourth parameter SLIV is used to indicate the second parameter S and the third parameter L;
[0618] Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot.
[0619] In some embodiments, the transceiver module 5201 is used to send first information, which is used by the terminal to determine the time domain resources of the PUSCH.
[0620] The first information is used to indicate at least one of the following:
[0621] The first parameter k2 is used to indicate the starting time slot of the time domain resource;
[0622] The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot;
[0623] The sixth parameter L indicates the number of symbols corresponding to one nominal repetition.
[0624] The seventh parameter K indicates the nominal number of repetitions, and K is greater than or equal to 1.
[0625] Wherein, the sixth parameter L is greater than Indicates the number of symbols included in a time slot;
[0626] A nominal repetition includes at least one actual repetition, and the time-domain resources of the PUSCH include all symbols corresponding to the actual repetition.
[0627] Optionally, the transceiver module 5201 is used to perform at least one of the communication steps such as sending and / or receiving performed by the network device in any of the above methods, which will not be described in detail here. Optionally, the processing module 5202 is used to perform at least one of the other steps performed by the network device in any of the above methods, which will not be described in detail here.
[0628] 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.
[0629] 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. Optionally, the processing module may be interchangeable with a processor.
[0630] Figure 6A is a schematic diagram of the structure of the communication device 6100 proposed in an embodiment of this 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.
[0631] As shown in Figure 6A, the communication device 6100 includes one or more processors 6101. The processor 6101 can be a general-purpose processor or a dedicated processor, such as a baseband processor or a central processing unit (CPU). The baseband processor can be used to process communication protocols and communication data, while the CPU can be used to control communication devices (e.g., base stations, baseband chips, terminal devices, terminal device chips, DUs or CUs, etc.), execute programs, and process program data. Optionally, the communication device 6100 can be used to execute any of the above methods. Optionally, one or more processors 6101 can be used to invoke instructions to cause the communication device 6100 to execute any of the above methods.
[0632] In some embodiments, the communication device 6100 further includes one or more transceivers 6102. When the communication device 6100 includes one or more transceivers 6102, the transceiver 6102 performs at least one of the communication steps such as sending and / or receiving in the above method, and the processor 6101 performs at least one of the other steps. 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; and the terms receiver, receiving unit, receiver, receiving circuit, etc., can be used interchangeably.
[0633] In some embodiments, the communication device 6100 further includes one or more memories 6103 for storing data. Optionally, all or part of the memories 6103 may be located outside the communication device 6100. In optional embodiments, the communication device 6100 may include one or more interface circuits 6104. Optionally, the interface circuits 6104 are connected to the memories 6102 and can be used to receive data from the memories 6102 or other devices, and to send data to the memories 6102 or other devices. For example, the interface circuits 6104 can read data stored in the memories 6102 and send the data to the processor 6101.
[0634] 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 and programs; (3) an ASIC, such as a modem; (4) a module that can be embedded in other devices; (5) a receiver, terminal device, smart terminal device, cellular phone, wireless device, handheld device, mobile unit, vehicle device, network device, cloud device, artificial intelligence device, etc.; (6) others, etc.
[0635] Figure 6B is a schematic diagram of the structure of chip 6200 according to an embodiment of this disclosure. For cases where the communication device 6100 can be a chip or a chip system, please refer to the schematic diagram of chip 6200 shown in Figure 6B, but it is not limited thereto.
[0636] Chip 6200 includes one or more processors 6201. Chip 6200 is used to perform any of the methods described above.
[0637] 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. Optionally, all or part of the memories 6203 may be located outside chip 6200. Optionally, interface circuit 6202 is connected to memory 6203, and interface circuit 6202 can be used to receive data from memory 6203 or other devices, and interface circuit 6202 can be used to send data to memory 6203 or other devices. For example, interface circuit 6202 can read data stored in memory 6203 and send the data to processor 6201.
[0638] 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. 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 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 the other steps.
[0639] 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.
[0640] This disclosure also proposes a storage medium storing instructions that, when executed on the communication device 6100, cause the communication device 6100 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.
[0641] This disclosure also provides a program product that, when executed by the communication device 6100, causes the communication device 6100 to perform any of the above methods. Optionally, the program product is a computer program product.
[0642] This disclosure also proposes a computer program that, when run on a computer, causes the computer to perform any of the above methods.
Claims
A communication method, characterized in that, The method, executed by a terminal, includes: Obtain first information; The time-domain resources of PUSCH are determined based on the first information; The first information is used to indicate at least one of the following: The first parameter k2 is used to indicate the starting time slot of the time domain resource; The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot; The third parameter L indicates the number of symbols in the time-domain resource. The fourth parameter SLIV is used to indicate the second parameter S and the third parameter L; Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot. The method according to claim 1, characterized in that, The third parameter L is less than or equal to Alternatively, the sum of the second parameter S and the third parameter L is less than or equal to... m is an integer greater than or equal to 2 and less than 32. The method according to claim 1 or 2, characterized in that, The first information is also used to indicate a fifth parameter K, which indicates the number of times the PUSCH is repeated. K is greater than or equal to 1, and each PUSCH repetition corresponds to one time-domain resource. The method according to claim 1 or 2, characterized in that, The determination of the time-domain resources of PUSCH based on the first information includes at least one of the following: Determine N consecutive time slots starting from the initial time slot as the time slots included in the time domain resource; The N time slots that satisfy the first condition, starting from the initial time slot, are determined as the time slots included in the time domain resource; Wherein, N is the number of time slots included in the time-domain resources. The method according to claim 3, characterized in that, The determination of the time-domain resources of PUSCH based on the first information includes at least one of the following: Determine the time domain resources including the time slots for the consecutive N·K time slots starting from the initial time slot as K times the PUSCH repetition; The time-domain resources corresponding to the K repetitions of the PUSCH that satisfy the first condition, starting from the initial time slot, are determined as the time slots included in the time domain resources. Wherein, N is the number of time slots included in the time domain resources, and the first condition includes: the symbols allocated to the PUSCH within the time slot do not overlap with the first type of symbols; The first type of symbols includes at least one of the following: downlink symbols, SSB symbols, and symbols indicating higher-level signaling. The method according to any one of claims 1-2, characterized in that, The step of determining the time-domain resources of the PUSCH based on the first information includes: The L consecutive symbols starting from the starting symbol of the starting time slot are determined as the symbols included in the time-domain resource. The method according to any one of claims 3-5, characterized in that, The step of determining the time-domain resources of the PUSCH based on the first information includes: The L consecutive symbols starting from the start symbol in the starting time slot of the time-domain resource corresponding to the r-th PUSCH repetition are determined as the symbols included in the time-domain resource corresponding to the r-th PUSCH repetition, where r is an integer greater than 1 and less than or equal to K. The method according to any one of claims 4-7, characterized in that, The step of determining the time-domain resources of the PUSCH based on the first information includes: The number of time slots N included in the time domain resource is determined based on the second parameter S and the third parameter L; in, The method according to any one of claims 4-8, characterized in that, The method includes: The number N of resource units (REs) allocated to the PUSCH within the time-domain resources is determined according to the following formula. RE : N RE = min(N·M, N' RE )·n PRB , or, N RE = N' RE ·n PRB ; in, The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to the PUSCH within a Physical Resource Block (PRB). PRB This indicates the number of PRBs allocated to the PUSCH within the time-domain resources; This indicates the number of subcarriers included in a PRB. This represents the number of symbols allocated to the PUSCH within the time-domain resources. This indicates the number of first REs in each symbol within the time-domain resource, where the first REs are REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) group that is not used by data. This indicates the overhead of high-level signaling configuration. The method according to any one of claims 1-9, characterized in that, The method includes: Send a second message to the network device, the second message being used to instruct the terminal to support type 1 PUSCH transmission; Wherein, when the terminal supports the first type of PUSCH transmission, the terminal supports the third parameter L being greater than A communication method, characterized in that, The method, executed by a terminal, includes: Obtain first information; The time-domain resources of PUSCH are determined based on the first information; The first information is used to indicate at least one of the following: The first parameter k2 is used to indicate the starting time slot of the time domain resource; The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot; The sixth parameter L indicates the number of symbols corresponding to one nominal repetition. The seventh parameter K indicates the nominal number of repetitions, and K is greater than or equal to 1. Wherein, the sixth parameter L is greater than Indicates the number of symbols included in a time slot; A nominal repetition includes at least one actual repetition, and the time-domain resources of the PUSCH include all symbols corresponding to the actual repetition. The method according to claim 11, characterized in that, The sum of the second parameter and the sixth parameter is less than or equal to And / or, the sixth parameter is less than or equal to m is an integer greater than or equal to 2 and less than 32. The method according to claim 11 or 12 is characterized in that, The determination of the time-domain resources of PUSCH based on the first information includes at least one of the following: The K·L consecutive symbols starting from the initial symbol in the initial time slot are determined as the symbols corresponding to the K nominal repetitions. The method according to claim 13, characterized in that, The step of determining the time-domain resources of the PUSCH based on the first information includes: Determine the symbol corresponding to each actual repetition in each of the nominal repetitions; In this case, the multiple symbols corresponding to one actual repetition are located in multiple time slots. The method according to claim 14, characterized in that, The symbols corresponding to the actual repetition do not include the first type of symbols, which include at least one of the following: downlink symbols, SSB symbols, and symbols indicated by higher-level signaling. The method according to any one of claims 11-15, characterized in that, The method includes: For each of the N time slots corresponding to a nominal repetition, the number N of resource units (REs) allocated to the PUSCH within the N time slots is determined according to the following formula. RE : N RE = min(N·M, N' RE )·n PRB , or, N RE = N' RE ·n PRB ; in, The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to the PUSCH within a Physical Resource Block (PRB). PRB This represents the number of PRBs allocated to the PUSCH within the N time slots; This indicates the number of subcarriers included in a PRB. This represents the number of symbols allocated to the PUSCH within the N time slots. This represents the number of first REs in each symbol within the N time slots, where the first REs are the REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) groups that are not used by data. This indicates the overhead of high-level signaling configuration. The method according to claim 16, characterized in that, The method includes: The number of time slots N corresponding to one nominal repetition is determined based on the second parameter S and the sixth parameter L; in, The method according to any one of claims 11-17, characterized in that, The method includes: Send a second message to the network device, the second message being used to instruct the terminal to support type 2 PUSCH transmission; Wherein, when the terminal supports the second type of PUSCH transmission, the terminal supports the sixth parameter L being greater than A communication method, characterized in that, Performed by a network device, the method includes: Send first information, which is used by the terminal to determine the time domain resources of PUSCH; The first information is used to indicate at least one of the following: The first parameter k2 is used to indicate the starting time slot of the time domain resource; The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot; The third parameter L indicates the number of symbols in the time-domain resource. The fourth parameter SLIV is used to indicate the second parameter S and the third parameter L; Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot. The method according to claim 19, characterized in that, The third parameter L is less than or equal to Alternatively, the sum of the second parameter S and the third parameter L is less than or equal to... m is an integer greater than or equal to 2 and less than 32. The method according to claim 19 or 20 is characterized in that, The first information is also used to indicate a fifth parameter K, which indicates the number of times the PUSCH is repeated. K is greater than or equal to 1, and each PUSCH repetition corresponds to one time-domain resource. The method according to claim 19 or 20 is characterized in that, The N consecutive time slots starting from the initial time slot constitute the time slots included in the time domain resource; The N time slots that satisfy the first condition, starting from the initial time slot, are the time slots included in the time domain resource; Wherein, N is the number of time slots included in the time-domain resources. The method according to claim 21, characterized in that, The N·K consecutive time slots starting from the initial time slot are the time slots included in the time domain resources corresponding to the K repetitions of the PUSCH; Starting from the initial time slot, the N·K time slots that satisfy the first condition are the time slots included in the time domain resources corresponding to the K repetitions of the PUSCH; Wherein, N is the number of time slots included in the time domain resources, and the first condition includes: the symbols allocated to the PUSCH within the time slot do not overlap with the first type of symbols; The first type of symbols includes at least one of the following: downlink symbols, SSB symbols, and symbols indicating higher-level signaling. The method according to any one of claims 19-20, characterized in that, The L consecutive symbols starting from the starting symbol of the starting time slot are the symbols included in the time-domain resource. The method according to any one of claims 21-24, characterized in that, The L consecutive symbols starting from the starting symbol in the starting time slot of the time-domain resource corresponding to the r-th PUSCH repetition are the symbols included in the time-domain resource corresponding to the r-th PUSCH repetition, where r is an integer greater than 1 and less than or equal to K. The method according to any one of claims 22-25, characterized in that, The time-domain resources include the number of time slots. The method according to any one of claims 22-26, characterized in that, The number N of resource units (REs) allocated to the PUSCH within the time-domain resources. RE Determined by the following formula: N RE = min(N·M, N' RE )·n PRB , or, N RE = N' RE ·n PRB ; in, The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to the PUSCH within a Physical Resource Block (PRB). PRB This indicates the number of PRBs allocated to the PUSCH within the time-domain resources; This indicates the number of subcarriers included in a PRB. This represents the number of symbols allocated to the PUSCH within the time-domain resources. This indicates the number of first REs in each symbol within the time-domain resource, where the first REs are REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) group that is not used by data. This indicates the overhead of high-level signaling configuration. The method according to any one of claims 19-27, characterized in that, The method includes: The receiving terminal sends a second message, the second message being used to indicate that the terminal supports type 1 PUSCH transmission; Wherein, when the terminal supports the first type of PUSCH transmission, the terminal supports the third parameter L being greater than A communication method, characterized in that, Performed by a network device, the method includes: Send first information, which is used by the terminal to determine the time domain resources of PUSCH; The first information is used to indicate at least one of the following: The first parameter k2 is used to indicate the starting time slot of the time domain resource; The second parameter S is used to indicate the start symbol of the time-domain resource in the start time slot; The third parameter L is used to indicate the number of symbols corresponding to one nominal repetition; The seventh parameter K indicates the nominal number of repetitions, and K is greater than or equal to 1. Wherein, the third parameter L is greater than Indicates the number of symbols included in a time slot; A nominal repetition includes at least one actual repetition, and the time-domain resources of the PUSCH include all symbols corresponding to the actual repetition. The method according to claim 29, characterized in that, The sum of the second parameter and the third parameter is less than or equal to And / or, the third parameter is less than or equal to m is an integer greater than or equal to 2 and less than 32. The method according to claim 29 or 30 is characterized in that, The K·L consecutive symbols starting from the initial symbol in the initial time slot are the symbols corresponding to the K nominal repetitions. The method according to claim 31, characterized in that, The multiple symbols corresponding to one actual repetition are located in multiple time slots. The method according to claim 32, characterized in that, The symbols corresponding to the actual repetition do not include the first type of symbols, which include at least one of the following: downlink symbols, SSB symbols, and symbols indicated by higher-level signaling. The method according to any one of claims 29-33, characterized in that, The method includes: For each of the N time slots corresponding to a nominal repetition, the number of Resource Units (REs) N allocated to the PUSCH within those N time slots is N. RE Determined by the following formula: N RE = min(N·M, N′ RE )·n PRB , or, N RE = N′ RE ·n PRB ; in, The value of M is any one of the following: 156, 168, or the value configured in the higher-level signaling, N′ RE n represents the number of REs allocated to the PUSCH within a Physical Resource Block (PRB). PRB This represents the number of PRBs allocated to the PUSCH within the N time slots; This indicates the number of subcarriers included in a PRB. This represents the number of symbols allocated to the PUSCH within the N time slots. This represents the number of first REs in each symbol within the N time slots, where the first REs are the REs not occupied by the Modulation-Demodulation Reference Signal (DMRS) Code Division Multiplexing (CDM) groups that are not used by data. This indicates the overhead of high-level signaling configuration. The method according to claim 34, characterized in that, The number of time slots corresponding to one nominal repetition The method according to any one of claims 29-35, characterized in that, The method includes: Receive second information sent by the terminal, the second information being used to indicate that the terminal supports type 2 PUSCH transmission; Wherein, when the terminal supports the second type of PUSCH transmission, the terminal supports the third parameter L being greater than A communication device, characterized in that, The communication device is used to perform the communication method according to any one of claims 1-10, 11-18, 19-28, or 29-36. 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 of any one of claims 1-10 or 11-18, and the network device is configured to implement the communication method of any one of claims 19-28 or 29-36. 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-10, 11-18, 19-28, or 29-36 is performed. 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 as described in any one of claims 1-10, 11-18, 19-28, or 29-36.