Resource determination method, communication device, communication system, and storage medium

By optimizing resource allocation in IoT non-terrestrial network systems and adopting a low-code-rate orthogonal overlay code multiplexing transmission method, the problem of low transmission efficiency of narrowband physical uplink shared channels is solved, thereby achieving uplink capacity enhancement and communication performance improvement.

WO2026097536A1PCT designated stage Publication Date: 2026-05-15BEIJING XIAOMI MOBILE SOFTWARE CO LTD
View PDF 4 Cites 0 Cited by

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

Technical Problem

In IoT non-terrestrial network systems, the orthogonal overlay code multiplexing of narrowband physical uplink shared channels leads to low transmission efficiency, high communication resource requirements, and affects communication performance.

Method used

By allocating low-code-rate resources for orthogonal coverage code multiplexing transmission of the narrowband physical uplink shared channel, the transmit and receive code rates are reduced, and resource allocation is optimized to achieve low-code-rate OCC multiplexing transmission.

Benefits of technology

While ensuring enhanced uplink capacity, it improves the transmission efficiency of the narrowband physical uplink shared channel, reduces communication resource requirements, and enhances communication performance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2024131124_15052026_PF_FP_ABST
    Figure CN2024131124_15052026_PF_FP_ABST
Patent Text Reader

Abstract

The present disclosure provides a resource determination method, a communication device, a communication system, and a storage medium. The method comprises: determining a first resource, the first resource being used for performing orthogonal cover code (OCC) multiplexing transmission of a narrowband physical uplink shared channel (NPUSCH); and transmitting the NPUSCH on the basis of the first resource, the transmission bitrate of the NPUSCH on the first resource being lower than the transmission bitrate of the NPUSCH on a second resource, and the second resource being used for performing non-OCC multiplexing transmission of the NPUSCH. The present disclosure achieves low bitrate OCC multiplexing transmission of an NPUSCH, and improves the transmission efficiency of the NPUSCH and reduces communication resources required by the NPUSCH while ensuring uplink capacity enhancement, thereby improving the communication performance of the NPUSCH.
Need to check novelty before this filing date? Find Prior Art

Description

Resource determination methods, communication equipment, communication systems, storage media Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to resource determination methods, communication equipment, communication systems, and storage media. Background Technology

[0002] In communication systems, Orthogonal Cover Code (OCC) technology has been introduced into the Narrowband Physical Uplink Shared Channel (NPUSCH) of Internet of Things (IoTNTN) systems to enable multi-user multiplexing transmission on the same time-frequency resources, thereby enhancing uplink capacity. However, when NPUSCH performs OCC multiplexing transmission, the transmission code rate is relatively high, which may lead to lower transmission efficiency, higher communication resource requirements, and affect communication performance.

[0003] Summary of the Invention

[0004] This disclosure proposes a resource determination method, communication equipment, communication system, and storage medium.

[0005] According to a first aspect of the embodiments of this disclosure, a resource determination method is proposed, executed by a terminal, comprising:

[0006] A first resource is determined, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0007] The NPUSCH is transmitted based on the first resource, wherein the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0008] According to a second aspect of the embodiments of this disclosure, a resource determination method is provided, performed by a network device, the method comprising:

[0009] A first resource is determined, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0010] The NPUSCH is received based on the first resource, wherein the reception code rate of the NPUSCH on the first resource is less than the reception code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0011] According to a third aspect of the present disclosure, a resource determination method is provided for a communication system, the communication system including network devices and terminals, the method comprising:

[0012] The terminal and / or the network device determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0013] The terminal sends the NPUSCH based on the first resource, and the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource. The second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0014] The network device receives the NPUSCH based on the first resource, wherein the reception code rate of the NPUSCH on the first resource is less than the reception code rate of the NPUSCH on the second resource.

[0015] According to a fourth aspect of the embodiments of this disclosure, a terminal is provided, comprising:

[0016] The processing module is used to determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0017] The transceiver module is used to send the NPUSCH based on the first resource, wherein the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0018] According to a fifth aspect of the embodiments of this disclosure, a network device is provided, comprising:

[0019] The processing module is used to determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0020] The transceiver module is configured to receive the NPUSCH based on the first resource, wherein the receiving code rate of the NPUSCH on the first resource is less than the receiving code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0021] According to a sixth aspect of the present disclosure, a communication device is provided, comprising:

[0022] One or more processors;

[0023] The processor is configured to invoke instructions to cause the communication device to execute any of the resource determination methods described in the first or second aspect.

[0024] According to a seventh aspect of the present disclosure, a communication system is provided, including a network device and a terminal, wherein the terminal is configured to implement the resource determination method of the first aspect, and the network device is configured to implement the resource determination method of the second aspect.

[0025] According to an eighth aspect of the present disclosure, a storage medium is provided that stores instructions that, when executed on a communication device, cause the communication device to perform a resource determination method as described in any of the first to second aspects.

[0026] In a ninth aspect, embodiments of this disclosure provide a program product, including a computer program that, when executed by a communication device, implements the resource determination method as described in the first and second aspects.

[0027] In a tenth aspect, embodiments of this disclosure provide a computer program that, when run on a computer, causes the computer to perform the resource determination method as described in the first and second aspects.

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

[0029] The above and / or additional aspects and advantages of this disclosure will become apparent and readily understood from the following description of the embodiments taken in conjunction with the accompanying drawings, in which:

[0030] Figure 1 is a schematic diagram of the architecture of some communication systems provided in the embodiments of this disclosure;

[0031] Figure 2A is a flowchart illustrating a resource determination method provided in an embodiment of this disclosure;

[0032] Figure 2B is a schematic diagram illustrating OCC multiplexing transmission of NPUSCH on a second resource according to an embodiment of the present disclosure.

[0033] Figures 2C and 2D are schematic diagrams illustrating OCC multiplexing transmission of NPUSCH on a first resource according to embodiments of the present disclosure;

[0034] Figure 3 is a flowchart illustrating a resource determination method provided in another embodiment of this disclosure;

[0035] Figure 4 is a flowchart illustrating a resource determination method provided in another embodiment of this disclosure;

[0036] Figure 5 is a flowchart illustrating a resource determination method provided in another embodiment of this disclosure;

[0037] Figure 6A is a schematic diagram of the structure of a terminal provided in an embodiment of this disclosure;

[0038] Figure 6B is a schematic diagram of the structure of a network device provided in an embodiment of this disclosure;

[0039] Figure 7A is a schematic diagram of the structure of a communication device provided in an embodiment of this disclosure;

[0040] Figure 7B is a schematic diagram of the structure of a chip provided in an embodiment of this disclosure. Detailed Implementation

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

[0042] In a first aspect, embodiments of this disclosure propose a resource determination method, executed by a terminal, the method comprising:

[0043] A first resource is determined, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0044] The NPUSCH is transmitted based on the first resource, wherein the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0045] In the above embodiments, the terminal determines a first resource for OCC multiplexing transmission of NPUSCH and transmits NPUSCH on the first resource. The transmission code rate of NPUSCH on the first resource is lower than the transmission code rate of NPUSCH on a second resource, which is used for non-OCC multiplexing transmission of NPUSCH. Therefore, when NPUSCH is OCC multiplexed using the resource determined by the method of this embodiment, the transmission code rate of NPUSCH can be reduced, thereby achieving low-code-rate OCC multiplexing transmission of NPUSCH. This ensures enhanced uplink capacity while improving NPUSCH transmission efficiency, reducing the communication resources required for NPUSCH, and improving NPUSCH communication performance.

[0046] In conjunction with some embodiments of the first aspect, in some embodiments, the first resource satisfies at least one of the following: the transport block size (TBS) occupied by a single repeat transmission in the first resource is smaller than the TBS occupied by a single repeat transmission in the second resource; and the resource length of a single repeat transmission in the first resource is greater than the resource length of a single repeat transmission in the second resource.

[0047] In the above embodiments, by making the transport block size (TBS) of a single repeated transmission in the first resource smaller, and / or making the resource length of a single repeated transmission in the first resource larger, low code rate OCC multiplexing transmission of NPUSCH can be achieved on the first resource. This ensures enhanced uplink capacity while also improving the transmission efficiency of NPUSCH, reducing the communication resources required for NPUSCH, and improving the communication performance of NPUSCH.

[0048] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes:

[0049] The first TBS is determined to be equal to the product of the second TBS and the first value, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource, and the first value is in the range of (0, 1).

[0050] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes:

[0051] A first resource unit (RU) is determined, wherein the time domain length of the first RU is greater than the time domain length of one RU in the second resource;

[0052] The first TBS and the second TBS are determined to be equal, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, and the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource.

[0053] A first time domain length is determined, which is the time domain length occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is equal to the product of the time domain length of the first RU and a second value, where the second value is the number of RUs occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is greater than the time domain length occupied by the NPUSCH in one repeated transmission in the second resource.

[0054] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes:

[0055] A first repeat transmission resource is determined, which is the resource occupied by the NPUSCH in one repeat transmission in the first resource. The time domain length of the first repeat transmission resource is M times the time domain length of the second repeat transmission resource. The second repeat transmission resource is the resource occupied by the NPUSCH in one repeat transmission in the second resource, where M > 1.

[0056] In conjunction with some embodiments of the first aspect, in some embodiments, the OCC multiplexing transmission of the NPUSCH includes at least one of the following:

[0057] One sequence value of an OCC sequence is mapped to one or more symbols;

[0058] One sequence value of an OCC sequence is mapped to one time slot or multiple consecutive time slots;

[0059] One sequence value of an OCC sequence is mapped to multiple non-contiguous time slots, with an interval of L-1 time slots between adjacent time slots mapped to the same sequence value, where L is the sequence length of the OCC sequence.

[0060] In conjunction with some embodiments of the first aspect, in some embodiments, the second time domain length is M times the third time domain length, wherein the second time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the first repeated transmission resource, the second resource is also used for OCC multiplexing transmission of the NPUSCH, and the third time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the second repeated transmission resource.

[0061] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes at least one of the following:

[0062] The OCC sequence is mapped to a symbol of the first resource, and symbols that satisfy the first rule are encoded. The first rule includes: mod(H, L) = k, where the mod function is the modulo function, H is the symbol index, L is the sequence length of the OCC sequence, and k = 0, 1, ..., or L-1.

[0063] The OCC sequence is mapped to multiple consecutive time slots of the first resource. Time slots that satisfy the second rule are encoded. The second rule includes: mod(F, L) = k, where F is the time slot index.

[0064] The OCC sequence is mapped to multiple non-contiguous time slots of the first resource. The time slots mapped by the OCC sequence are sequentially divided into at least one time-domain window. The time-domain length of the time-domain window is L. The at least one time-domain window is sequentially indexed and numbered. The time slots in the time-domain window that satisfy the third rule are encoded. The third rule includes: mod(G, L) = k, where G is the index of the time-domain window.

[0065] In conjunction with some embodiments of the first aspect, in some embodiments, encoding the symbols that satisfy the first rule includes:

[0066] Adjacent symbols that satisfy the first rule are encoded using a first method. The first method is used to make the end bit of the encoding bit corresponding to the first symbol adjacent to the start bit of the encoding bit corresponding to the second symbol. The first symbol and the second symbol are adjacent symbols that satisfy the first rule, and the time domain position of the first symbol is located before the time domain position of the second symbol.

[0067] The encoding of time slots that satisfy the second rule includes:

[0068] The adjacent time slots that satisfy the second rule are encoded using a second method. The second method is used to make the end bit of the encoded bit corresponding to the first time slot adjacent to the start bit of the encoded bit corresponding to the second time slot. The first time slot and the second time slot are adjacent time slots that satisfy the second rule. The time domain position of the first time slot is located before the time domain position of the second time slot.

[0069] The encoding of time slots within a time-domain window that satisfies the third rule includes:

[0070] The time slots in adjacent time-domain windows that satisfy the third rule are encoded using a third method. The third method is used to make the end bit of the encoded bit corresponding to the first time-domain window adjacent to the start bit of the encoded bit corresponding to the second time-domain window. The first time-domain window and the second time-domain window are adjacent time-domain windows that satisfy the third rule, and the time-domain position of the first time-domain window is located before the time-domain position of the second time-domain window.

[0071] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes:

[0072] A third TBS is determined, wherein the third TBS is the TBS corresponding to the encoded bits of the NPUSCH in one repeated transmission of the first resource, and the third TBS is less than the first TBS, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission of the first resource.

[0073] In conjunction with some embodiments of the first aspect, in some embodiments, determining the third TBS includes at least one of the following:

[0074] The third TBS is determined to be equal to the second TBS, where the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource;

[0075] The third TBS is determined to be equal to the product of the first TBS and the first value, where the first value ranges from (0, 1).

[0076] In conjunction with some embodiments of the first aspect, in some embodiments, the method further includes at least one of the following:

[0077] Receive the second TBS and / or the first value configured by the network device;

[0078] The first value is determined based on the first calculation method;

[0079] The second TBS is determined based on the second calculation method.

[0080] The above embodiments illustrate how the terminal specifically determines the first resource to select one with a lower transmission code rate, thereby enabling low-code-rate OCC multiplexing transmission of the NPUSCH and improving its communication performance. Furthermore, the embodiments also explain the specific transmission method for OCC multiplexing of the NPUSCH, allowing the terminal to successfully perform OCC multiplexing transmission of the NPUSCH based on this method, thus enhancing uplink capacity. Additionally, the embodiments further illustrate how to encode the NPUSCH under different OCC multiplexing transmission methods to achieve low-code-rate transmission of the NPUSCH. This ensures enhanced uplink capacity while also improving NPUSCH transmission efficiency, reducing the communication resources required for the NPUSCH, and ultimately enhancing its communication performance.

[0081] Secondly, embodiments of this disclosure provide a resource determination method, executed by a network device, the method comprising:

[0082] A first resource is determined, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0083] The NPUSCH is received based on the first resource, wherein the reception code rate of the NPUSCH on the first resource is less than the reception code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0084] In conjunction with some embodiments of the second aspect, in some embodiments, the first resource satisfies at least one of the following: the transport block size (TBS) occupied by a single repeat transmission in the first resource is smaller than the TBS occupied by a single repeat transmission in the second resource; and the resource length of a single repeat transmission in the first resource is greater than the resource length of a single repeat transmission in the second resource.

[0085] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes:

[0086] The first TBS is determined to be equal to the product of the second TBS and the first value, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource, and the first value is in the range of (0, 1).

[0087] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes:

[0088] A first resource unit (RU) is determined, wherein the time domain length of the first RU is greater than the time domain length of one RU in the second resource;

[0089] The first TBS and the second TBS are determined to be equal, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, and the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource.

[0090] A first time domain length is determined, which is the time domain length occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is equal to the product of the time domain length of the first RU and a second value, where the second value is the number of RUs occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is greater than the time domain length occupied by the NPUSCH in one repeated transmission in the second resource.

[0091] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes:

[0092] A first repeat transmission resource is determined, which is the resource occupied by the NPUSCH in one repeat transmission in the first resource. The time domain length of the first repeat transmission resource is M times the time domain length of the second repeat transmission resource. The second repeat transmission resource is the resource occupied by the NPUSCH in one repeat transmission in the second resource, where M > 1.

[0093] In conjunction with some embodiments of the second aspect, in some embodiments, the OCC multiplexing transmission of the NPUSCH includes at least one of the following:

[0094] One sequence value of an OCC sequence is mapped to one or more symbols;

[0095] One sequence value of an OCC sequence is mapped to one time slot or multiple consecutive time slots;

[0096] One sequence value of an OCC sequence is mapped to multiple non-contiguous time slots, with an interval of L-1 time slots between adjacent time slots mapped to the same sequence value, where L is the sequence length of the OCC sequence.

[0097] In conjunction with some embodiments of the second aspect, in some embodiments, the second time domain length is M times the third time domain length, wherein the second time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the first repeated transmission resource, the second resource is also used for OCC multiplexing transmission of the NPUSCH, and the third time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the second repeated transmission resource.

[0098] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes at least one of the following:

[0099] The OCC sequence is mapped to a symbol of the first resource. Symbols that satisfy the first rule are decoded. The first rule includes: mod(H, L) = k, where the mod function is the modulo function, H is the symbol index, L is the sequence length of the OCC sequence, and k = 0, 1, ..., or L-1.

[0100] The OCC sequence is mapped to multiple consecutive time slots of the first resource. Time slots that satisfy the second rule are decoded. The second rule includes: mod(F, L) = k, where F is the time slot index.

[0101] The OCC sequence is mapped to multiple non-contiguous time slots of the first resource. The time slots mapped by the OCC sequence are sequentially divided into at least one time-domain window, and the time-domain length of the time-domain window is L. The at least one time-domain window is sequentially indexed and numbered. The time slots in the time-domain window that satisfy the third rule are decoded. The third rule includes: mod(G, L) = k, where G is the index of the time-domain window.

[0102] In conjunction with some embodiments of the second aspect, in some embodiments, decoding the symbols that satisfy the first rule includes:

[0103] The adjacent symbols that satisfy the first rule are decoded using a fourth method. The fourth method is used to make the end bit of the decoded bit corresponding to the first symbol adjacent to the start bit of the decoded bit corresponding to the second symbol. The first symbol and the second symbol are adjacent symbols that satisfy the first rule, and the time domain position of the first symbol is located before the time domain position of the second symbol.

[0104] Decoding the time slots that satisfy the second rule includes:

[0105] The adjacent time slots that satisfy the second rule are decoded using a fifth method. The fifth method is used to make the end bit of the decoded bit corresponding to the first time slot adjacent to the start bit of the decoded bit corresponding to the second time slot. The first time slot and the second time slot are adjacent time slots that satisfy the second rule, and the time domain position of the first time slot is located before the time domain position of the second time slot.

[0106] Decoding the time slots in the time-domain window that satisfy the third rule includes:

[0107] The time slots in adjacent time-domain windows that satisfy the third rule are decoded using a sixth method. The sixth method is used to make the end bit of the decoded bit corresponding to the first time-domain window adjacent to the start bit of the decoded bit corresponding to the second time-domain window. The first time-domain window and the second time-domain window are adjacent time-domain windows that satisfy the third rule, and the time-domain position of the first time-domain window is located before the time-domain position of the second time-domain window.

[0108] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes:

[0109] A third TBS is determined, wherein the third TBS is the TBS corresponding to the encoded bits of the NPUSCH in one repeated transmission of the first resource, and the third TBS is less than the first TBS, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission of the first resource.

[0110] In conjunction with some embodiments of the second aspect, in some embodiments, determining the third TBS includes at least one of the following:

[0111] The third TBS is determined to be equal to the second TBS, where the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource;

[0112] The third TBS is determined to be equal to the product of the first TBS and the first value, where the first value ranges from (0, 1).

[0113] In conjunction with some embodiments of the second aspect, in some embodiments, the method further includes:

[0114] Configure the second TBS and / or the first value to the terminal.

[0115] Thirdly, embodiments of this disclosure propose a resource determination method for a communication system, the communication system including network devices and terminals, the method comprising:

[0116] The terminal and / or the network device determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0117] The terminal sends the NPUSCH based on the first resource, and the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource. The second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0118] The network device receives the NPUSCH based on the first resource, wherein the reception code rate of the NPUSCH on the first resource is less than the reception code rate of the NPUSCH on the second resource.

[0119] Fourthly, embodiments of this disclosure provide a terminal, including:

[0120] The processing module is used to determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0121] The transceiver module is used to send the NPUSCH based on the first resource, wherein the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0122] In conjunction with some embodiments of the fourth aspect, in some embodiments, the first resource satisfies at least one of the following: the transport block size (TBS) occupied by a single repeat transmission in the first resource is smaller than the TBS occupied by a single repeat transmission in the second resource; and the resource length of a single repeat transmission in the first resource is greater than the resource length of a single repeat transmission in the second resource.

[0123] In conjunction with some embodiments of the fourth aspect, in some embodiments, the method further includes:

[0124] The first TBS is determined to be equal to the product of the second TBS and the first value, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource, and the first value is in the range of (0, 1).

[0125] In conjunction with some embodiments of the fourth aspect, in some embodiments, the method further includes:

[0126] A first resource unit (RU) is determined, wherein the time domain length of the first RU is greater than the time domain length of one RU in the second resource;

[0127] The first TBS and the second TBS are determined to be equal, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, and the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource.

[0128] A first time domain length is determined, which is the time domain length occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is equal to the product of the time domain length of the first RU and a second value, where the second value is the number of RUs occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is greater than the time domain length occupied by the NPUSCH in one repeated transmission in the second resource.

[0129] In conjunction with some embodiments of the fourth aspect, in some embodiments, the method further includes:

[0130] A first repeat transmission resource is determined, which is the resource occupied by the NPUSCH in one repeat transmission in the first resource. The time domain length of the first repeat transmission resource is M times the time domain length of the second repeat transmission resource. The second repeat transmission resource is the resource occupied by the NPUSCH in one repeat transmission in the second resource, where M > 1.

[0131] In conjunction with some embodiments of the fourth aspect, in some embodiments, the OCC multiplexing transmission of the NPUSCH includes at least one of the following:

[0132] One sequence value of an OCC sequence is mapped to one or more symbols;

[0133] One sequence value of an OCC sequence is mapped to one time slot or multiple consecutive time slots;

[0134] One sequence value of an OCC sequence is mapped to multiple non-contiguous time slots, with an interval of L-1 time slots between adjacent time slots mapped to the same sequence value, where L is the sequence length of the OCC sequence.

[0135] In conjunction with some embodiments of the fourth aspect, in some embodiments, the second time domain length is M times the third time domain length, wherein the second time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the first repeated transmission resource, the second resource is also used for OCC multiplexing transmission of the NPUSCH, and the third time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the second repeated transmission resource.

[0136] In conjunction with some embodiments of the fourth aspect, in some embodiments, the method further includes at least one of the following:

[0137] The OCC sequence is mapped to a symbol of the first resource, and symbols that satisfy the first rule are encoded. The first rule includes: mod(H, L) = k, where the mod function is the modulo function, H is the symbol index, L is the sequence length of the OCC sequence, and k = 0, 1, ..., or L-1.

[0138] The OCC sequence is mapped to multiple consecutive time slots of the first resource. Time slots that satisfy the second rule are encoded. The second rule includes: mod(F, L) = k, where F is the time slot index.

[0139] The OCC sequence is mapped to multiple non-contiguous time slots of the first resource. The time slots mapped by the OCC sequence are sequentially divided into at least one time-domain window. The time-domain length of the time-domain window is L. The at least one time-domain window is sequentially indexed and numbered. The time slots in the time-domain window that satisfy the third rule are encoded. The third rule includes: mod(G, L) = k, where G is the index of the time-domain window.

[0140] In conjunction with some embodiments of the fourth aspect, in some embodiments, encoding the symbols that satisfy the first rule includes:

[0141] Adjacent symbols that satisfy the first rule are encoded using a first method. The first method is used to make the end bit of the encoding bit corresponding to the first symbol adjacent to the start bit of the encoding bit corresponding to the second symbol. The first symbol and the second symbol are adjacent symbols that satisfy the first rule, and the time domain position of the first symbol is located before the time domain position of the second symbol.

[0142] The encoding of time slots that satisfy the second rule includes:

[0143] The adjacent time slots that satisfy the second rule are encoded using a second method. The second method is used to make the end bit of the encoded bit corresponding to the first time slot adjacent to the start bit of the encoded bit corresponding to the second time slot. The first time slot and the second time slot are adjacent time slots that satisfy the second rule. The time domain position of the first time slot is located before the time domain position of the second time slot.

[0144] The encoding of time slots within a time-domain window that satisfies the third rule includes:

[0145] The time slots in adjacent time-domain windows that satisfy the third rule are encoded using a third method. The third method is used to make the end bit of the encoded bit corresponding to the first time-domain window adjacent to the start bit of the encoded bit corresponding to the second time-domain window. The first time-domain window and the second time-domain window are adjacent time-domain windows that satisfy the third rule, and the time-domain position of the first time-domain window is located before the time-domain position of the second time-domain window.

[0146] In conjunction with some embodiments of the fourth aspect, in some embodiments, the method further includes:

[0147] A third TBS is determined, wherein the third TBS is the TBS corresponding to the encoded bits of the NPUSCH in one repeated transmission of the first resource, and the third TBS is less than the first TBS, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission of the first resource.

[0148] In conjunction with some embodiments of the fourth aspect, in some embodiments, determining the third TBS includes at least one of the following:

[0149] The third TBS is determined to be equal to the second TBS, where the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource;

[0150] The third TBS is determined to be equal to the product of the first TBS and the first value, where the first value ranges from (0, 1).

[0151] In conjunction with some embodiments of the fourth aspect, in some embodiments, the method further includes at least one of the following:

[0152] Receive the second TBS and / or the first value configured by the network device;

[0153] The first value is determined based on the first calculation method;

[0154] The second TBS is determined based on the second calculation method.

[0155] Fifthly, embodiments of this disclosure provide a network device, comprising:

[0156] The processing module is used to determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0157] The transceiver module is configured to receive the NPUSCH based on the first resource, wherein the receiving code rate of the NPUSCH on the first resource is less than the receiving code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0158] In conjunction with some embodiments of the fifth aspect, in some embodiments, the first resource satisfies at least one of the following: the transport block size (TBS) occupied by a single repeat transmission in the first resource is smaller than the TBS occupied by a single repeat transmission in the second resource; and the resource length of a single repeat transmission in the first resource is greater than the resource length of a single repeat transmission in the second resource.

[0159] In conjunction with some embodiments of the fifth aspect, in some embodiments, the method further includes:

[0160] The first TBS is determined to be equal to the product of the second TBS and the first value, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource, and the first value is in the range of (0, 1).

[0161] In conjunction with some embodiments of the fifth aspect, in some embodiments, the method further includes:

[0162] A first resource unit (RU) is determined, wherein the time domain length of the first RU is greater than the time domain length of one RU in the second resource;

[0163] The first TBS and the second TBS are determined to be equal, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, and the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource.

[0164] A first time domain length is determined, which is the time domain length occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is equal to the product of the time domain length of the first RU and a second value, where the second value is the number of RUs occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is greater than the time domain length occupied by the NPUSCH in one repeated transmission in the second resource.

[0165] In conjunction with some embodiments of the fifth aspect, in some embodiments, the method further includes:

[0166] A first repeat transmission resource is determined, which is the resource occupied by the NPUSCH in one repeat transmission in the first resource. The time domain length of the first repeat transmission resource is M times the time domain length of the second repeat transmission resource. The second repeat transmission resource is the resource occupied by the NPUSCH in one repeat transmission in the second resource, where M > 1.

[0167] In conjunction with some embodiments of the fifth aspect, in some embodiments, the OCC multiplexing transmission of the NPUSCH includes at least one of the following:

[0168] One sequence value of an OCC sequence is mapped to one or more symbols;

[0169] One sequence value of an OCC sequence is mapped to one time slot or multiple consecutive time slots;

[0170] One sequence value of an OCC sequence is mapped to multiple non-contiguous time slots, with an interval of L-1 time slots between adjacent time slots mapped to the same sequence value, where L is the sequence length of the OCC sequence.

[0171] In conjunction with some embodiments of the fifth aspect, in some embodiments, the second time domain length is M times the third time domain length, wherein the second time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the first repeated transmission resource, the second resource is also used for OCC multiplexing transmission of the NPUSCH, and the third time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the second repeated transmission resource.

[0172] In conjunction with some embodiments of the fifth aspect, in some embodiments, the method further includes at least one of the following:

[0173] The OCC sequence is mapped to a symbol of the first resource. Symbols that satisfy the first rule are decoded. The first rule includes: mod(H, L) = k, where the mod function is the modulo function, H is the symbol index, L is the sequence length of the OCC sequence, and k = 0, 1, ..., or L-1.

[0174] The OCC sequence is mapped to multiple consecutive time slots of the first resource. Time slots that satisfy the second rule are decoded. The second rule includes: mod(F, L) = k, where F is the time slot index.

[0175] The OCC sequence is mapped to multiple non-contiguous time slots of the first resource. The time slots mapped by the OCC sequence are sequentially divided into at least one time-domain window, and the time-domain length of the time-domain window is L. The at least one time-domain window is sequentially indexed and numbered. The time slots in the time-domain window that satisfy the third rule are decoded. The third rule includes: mod(G, L) = k, where G is the index of the time-domain window.

[0176] In conjunction with some embodiments of the fifth aspect, in some embodiments, decoding the symbols that satisfy the first rule includes:

[0177] The adjacent symbols that satisfy the first rule are decoded using a fourth method. The fourth method is used to make the end bit of the decoded bit corresponding to the first symbol adjacent to the start bit of the decoded bit corresponding to the second symbol. The first symbol and the second symbol are adjacent symbols that satisfy the first rule, and the time domain position of the first symbol is located before the time domain position of the second symbol.

[0178] Decoding the time slots that satisfy the second rule includes:

[0179] The adjacent time slots that satisfy the second rule are decoded using a fifth method. The fifth method is used to make the end bit of the decoded bit corresponding to the first time slot adjacent to the start bit of the decoded bit corresponding to the second time slot. The first time slot and the second time slot are adjacent time slots that satisfy the second rule, and the time domain position of the first time slot is located before the time domain position of the second time slot.

[0180] Decoding the time slots in the time-domain window that satisfy the third rule includes:

[0181] The time slots in adjacent time-domain windows that satisfy the third rule are decoded using a sixth method. The sixth method is used to make the end bit of the decoded bit corresponding to the first time-domain window adjacent to the start bit of the decoded bit corresponding to the second time-domain window. The first time-domain window and the second time-domain window are adjacent time-domain windows that satisfy the third rule, and the time-domain position of the first time-domain window is located before the time-domain position of the second time-domain window.

[0182] In conjunction with some embodiments of the fifth aspect, in some embodiments, the method further includes:

[0183] A third TBS is determined, wherein the third TBS is the TBS corresponding to the encoded bits of the NPUSCH in one repeated transmission of the first resource, and the third TBS is less than the first TBS, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission of the first resource.

[0184] In conjunction with some embodiments of the fifth aspect, in some embodiments, determining the third TBS includes at least one of the following:

[0185] The third TBS is determined to be equal to the second TBS, where the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource;

[0186] The third TBS is determined to be equal to the product of the first TBS and the first value, where the first value ranges from (0, 1).

[0187] In conjunction with some embodiments of the fifth aspect, in some embodiments, the method further includes:

[0188] Configure the second TBS and / or the first value to the terminal.

[0189] In a sixth aspect, embodiments of this disclosure provide a communication device comprising: one or more processors; one or more memories for storing instructions; wherein the processors are configured to invoke the instructions to cause the communication device to perform the methods described in the first aspect, the optional implementation of the first aspect, the second aspect, and the optional implementation of the second aspect.

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

[0191] Eighthly, 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 described in the first aspect, an optional implementation of the first aspect, the second aspect, and an optional implementation of the second aspect.

[0192] In a ninth aspect, embodiments of this disclosure provide a program product including a computer program that, when executed by a processor, implements the methods described in the first aspect, optional implementations of the first aspect, the second aspect, and optional implementations of the second aspect.

[0193] In a tenth 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 first aspect, an optional implementation of the first aspect, the second aspect, and an optional implementation of the second aspect.

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

[0195] This disclosure provides a resource determination method, a communication device, a communication system, and a storage medium. In some embodiments, the terms "resource determination method" and "information processing method," "information sending method," and "information receiving method" can be used interchangeably; the terms "communication device" and "information processing device," "information sending device," and "information receiving device" can be used interchangeably; and the terms "information processing system," "communication system," "information sending system," and "information receiving system" can be used interchangeably.

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

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

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

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

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

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

[0202] The descriptions in this disclosure, such as "at least one of A, B, C..." or "A and / or B and / or C...", include the case where any one of A, B, C... exists alone, as well as the case where any combination of any of A, B, C... exists alone. Each case can exist alone. For example, "at least one of A, B, C" includes the cases of A alone, B alone, C alone, A and B combination, A and C combination, B and C combination, and A and B and C combination. For example, A and / or B includes the cases of A alone, B alone, and A and B combination.

[0203] In some embodiments, the notation "in one case A, in another case B" or "in response to one case A, in response to another case B" may include the following technical solutions depending on the situation: A is executed regardless of B, i.e., A is executed in some embodiments; B is executed regardless of A, i.e., B is executed in some embodiments; A and B are selectively executed, i.e., A and B are selected for execution in some embodiments; A and B are both executed, i.e., A and B are executed in some embodiments. The same applies when there are more branches such as A, B, and C.

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

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

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

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

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

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

[0210] 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," "carrier," "component carrier," and "bandwidth part (BWP)" can be used interchangeably.

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

[0212] 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 that replace communication between access network devices, core network devices, or network devices and terminals with communication between multiple terminals (e.g., also referred to as 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, uplink link, downlink link, etc., can be replaced with sidelink link.

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

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

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

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

[0217] The correspondences shown in the tables of this disclosure can be configured or predefined. The values ​​of the information in each table are merely examples and can be configured to other values; this disclosure is not limiting. When configuring the correspondences between information and parameters, it is not necessarily required to configure all the correspondences shown in each table. For example, the correspondences shown in some rows of the tables in this disclosure may not be configured. Furthermore, appropriate modifications and adjustments can be made based on the above tables, such as splitting, merging, etc. The names of the parameters shown in the headers of the above tables can also use other names that the communication device can understand, and the values ​​or representations of the parameters can also be other values ​​or representations that the communication device can understand. In the implementation of the above tables, other data structures can also be used, such as arrays, queues, containers, stacks, linear lists, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables, etc.

[0218] The predefined terms in this disclosure can be understood as defined, predefined, stored, pre-stored, pre-negotiated, pre-configured, solidified, or pre-burned.

[0219] Figure 1 is a schematic diagram of the architecture of a communication system according to an embodiment of the present disclosure. As shown in Figure 1, the communication system 100 may include network devices and terminals; wherein, the network devices may include at least one of access network devices and core network devices.

[0220] In some embodiments, the terminal includes, but is not limited to, at least one of the following: mobile phone, wearable device, Internet of Things (IoT) device, narrowband Internet of Things (NB-IoT) device, car with communication capabilities, smart car, tablet computer, computer with wireless transceiver capabilities, 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.

[0221] 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, but is not limited to, 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), wireless backhaul device, radio network controller (RNC), base station controller (BSC), base transceiver station (BTS), base band unit (BBU), mobile switching center, base station in a 6G communication system, open RAN, cloud RAN, base station in other communication systems, and access node in a wireless fidelity (WiFi) system.

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

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

[0224] In some embodiments, the core network device may be a single device comprising one or more network elements, or multiple devices or a group of devices, each comprising all or part of one or more network elements. Network elements may be virtual or physical. The core network may include, for example, at least one of an Evolved Packet Core (EPC), a 5G Core Network (5GCN), and a Next Generation Core (NGC). Alternatively, the core network device may also be a location management function network element. Exemplarily, the location management function network element includes a location server, which may be implemented as any of the following: a Location Management Function (LMF), an Enhanced Serving Mobile Location Centre (E-SMLC), a Secure User Plane Location (SUPL), and a Secure User Plane Location Platform (SUPLLP).

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

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

[0227] 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 resource determination methods, and next-generation systems extended from them, etc. Furthermore, multiple systems can be combined (e.g., a combination of LTE or LTE-A with 5G).

[0228] Figure 2A is an interactive schematic diagram of a resource determination method according to an embodiment of the present disclosure. As shown in Figure 2A, this embodiment of the disclosure relates to a resource determination method for a communication system 100; the method includes:

[0229] Step 2101: The network device determines the first resource.

[0230] Optionally, the first resource can be used for OCC multiplexing of NPUSCH. In some embodiments, "OCC multiplexing of NPUSCH" can be understood as follows: when different terminals send NPUSCH, the OCC sequence corresponding to the terminal's NPUSCH is used to perform weighted processing on the terminal's NPUSCH. Here, different terminals' NPUSCHs correspond to different OCC sequences. Therefore, the weighted NPUSCHs obtained by different terminals after weighting the terminal's NPUSCH based on the OCC sequence are different. In addition, each terminal can send its own weighted NPUSCH to the network device on the same time-frequency resource. When a network device receives weighted NPUSCHs sent by various terminals on the same time-frequency resources, it can perform inverse weighting based on the OCC sequences corresponding to the NPUSCHs of each terminal to determine the NPUSCH of each terminal. This enables multiple terminals to transmit OCCs on the same time-frequency resources, improving resource utilization. It also achieves uplink capacity enhancement and system expansion, supporting more terminals to perform uplink transmission under the premise of limited time-frequency resources and limited terminal transmission power, thus improving uplink transmission efficiency.

[0231] Optionally, in some embodiments, when NPUSCH performs OCC multiplexing transmission, a sequence value of the OCC sequence can be mapped to one or more symbols. This OCC multiplexing transmission method can be referred to as symbol-level OCC multiplexing. In other embodiments, a sequence value of the OCC sequence can be mapped to one or more time slots. This OCC multiplexing transmission method can be referred to as slot-level OCC multiplexing. Optionally, slot-level OCC multiplexing can be further divided into the following two types: The first type maps one sequence value of an OCC sequence to multiple consecutive time slots, which is called inter-slot OCC spreading and multiplexing or slot-level OCC multiplexing (slot); The second type maps one sequence value of an OCC sequence to multiple non-consecutive time slots, with an interval of L-1 time slots between adjacent time slots mapped by the same sequence value, where L is the sequence length of the OCC sequence (or OCC length, number of OCC multiplexing users, number of multiplexing users, etc.), which is called inter-2slot symbol spreading and occ multiplexing or slot-level OCC multiplexing (2slot).

[0232] Optionally, when a sequence value of an OCC sequence is mapped to multiple time-domain units (e.g., time slots or symbols), it can be called symbol spreading. For example, assuming that in symbol-level OCC multiplexing, a sequence value of an OCC sequence is mapped to multiple symbols, it can be called symbol-based OCC multiplexing spreading. If, in slot-level OCC multiplexing, a sequence value of an OCC sequence is mapped to multiple time slots, it can be called slot-based OCC multiplexing spreading.

[0233] Optionally, in some embodiments, the first resource described above may be determined by the network device based on protocol agreements. In other embodiments, the first resource may be determined autonomously by the network device.

[0234] Optionally, in some embodiments, the network device can determine the first resource by determining at least one of a first transport block size (TBS), a first time domain length, and a first retransmission resource. Optionally, the first TBS can be the TBS occupied by NPUSCH in one retransmission of the first resource. For example, the first TBS may include the TBS corresponding to the resource in which NPUSCH actually carries information bits and / or data bits in one retransmission of the first resource. Optionally, the above-mentioned "actually carrying information bits and / or data bits" can be referred to as effective bits, that is, the first TBS can indicate the effective bit length of NPUSCH in one retransmission of the first resource.

[0235] Optionally, the first time domain length can be the time domain length occupied by one repeated transmission of NPUSCH in the first resource. Optionally, the first time domain length can be greater than or equal to the first TBS.

[0236] Optionally, the first repeated transmission resource can be the resource occupied by one repeated transmission of NPUSCH in the first resource. For example, the first repeated transmission resource may include at least one of the resource start point, resource end point, and resource length. The first repeated transmission resource may include time domain resources and / or frequency domain resources.

[0237] Optionally, in some embodiments, the TBS occupied by a single repetition in the first resource may be less than the TBS occupied by a single repetition in the second resource, and / or, the resource length of a single repetition in the first resource may be greater than the resource length of a single repetition in the second resource. The second resource can be used for non-OCC multiplexed transmission of NPUSCH. Optionally, the "TBS occupied by a single repetition in the second resource (hereinafter referred to as the second TBS)" may, for example, refer to the TBS corresponding to the resource in which NPUSCH actually carries information bits and / or data bits in a single repetition of the second resource; that is, the second TBS can indicate the effective bit length of NPUSCH in a single repetition of the second resource. Optionally, "non-OCC multiplexed transmission of NPUSCH" can, for example, be understood as: NPUSCH is not transmitted based on an OCC sequence; that is, when transmitting NPUSCH, the OCC sequence is not used to weight the NPUSCH of the terminal. The second resource may be determined by the network device based on protocol agreements, and / or the second resource may be determined autonomously by the network device. Optionally, the second resource can also be used for OCC multiplexing transmission of NPUSCH. In some embodiments, the second resource can be understood as, for example, the resource used for transmitting NPUSCH determined by existing resource determination methods, but not by the resource determination methods mentioned in the embodiments of this disclosure.

[0238] Optionally, in some embodiments, the NPUSCH transmission rate is related to the number of encoded bits in a single NPUSCH retransmission and the resource length of a single NPUSCH retransmission. Specifically, the smaller the number of encoded bits in a single NPUSCH retransmission and / or the larger the resource length of a single NPUSCH retransmission, the lower the NPUSCH transmission rate. Based on this, in some embodiments, by making the TBS occupied by a single retransmission in the first resource smaller than the TBS occupied by a single retransmission in the second resource, the effective bit length of a single retransmission in the first resource can be made smaller than the effective bit length of a single retransmission in the second resource. This results in the number of encoded bits in a single retransmission in the first resource being smaller than the number of encoded bits in a single retransmission in the second resource, thereby reducing the NPUSCH transmission rate. Alternatively, in some embodiments, the resource length of a single repeated transmission in the first resource can be made greater than the resource length of a single repeated transmission in the second resource. This can also reduce the NPUSCH transmission code rate, thereby ensuring that the NPUSCH transmission code rate on the first resource is less than the NPUSCH transmission code rate on the second resource. This achieves low code rate OCC multiplexing transmission of NPUSCH, which not only ensures enhanced uplink capacity but also improves NPUSCH transmission efficiency, reduces the communication resources required for NPUSCH, and improves NPUSCH communication performance.

[0239] In some embodiments, when determining the first TBS, the network device may determine that the first TBS is equal to the product of the second TBS and the first value. Optionally, the second TBS may be the TBS occupied by one repeated transmission of NPUSCH in the second resource. The second TBS may be determined by a second calculation method, such as: second TBS = A × B × C × D, where A is the number of time slots occupied by one resource unit (RU) in the second resource, B is the number of subcarriers occupied by one RU in the second resource, C is the number of RUs occupied by one repeated transmission in the second resource, and D is the coding rate of NPUSCH in the second resource. Optionally, the second TBS may be determined by the network device based on protocol agreements, and / or the second TBS may be determined autonomously by the network device. Optionally, the first value may be in the range of (0, 1). Optionally, in some embodiments, the first value may be determined autonomously by the network device; in other embodiments, the first value may be determined by the network device based on protocol agreements. For example, the network device may directly determine the specific value of the first value based on protocol agreements, or the network device may determine a first calculation method for the first value based on protocol agreements, and then calculate the first value based on the first calculation method. For example, the first calculation method may be first value = n ÷ L, 0 < n < L, such as first value = 1 ÷ L.

[0240] Optionally, as can be seen from the above, the network device can make the first TBS corresponding to the first resource smaller than the second TBS corresponding to the second resource. This allows the NPUSCH transmission code rate on the first resource to be smaller than the NPUSCH transmission code rate on the second resource, thus realizing low code rate OCC multiplexing transmission of NPUSCH. While ensuring the uplink capacity enhancement, it also improves the transmission efficiency of NPUSCH, reduces the communication resources required for NPUSCH, and improves the communication performance of NPUSCH.

[0241] In some embodiments, the network device may determine that the first TBS and the second TBS are the same, and the network device may also determine the first RU, wherein the time domain length of the first RU is greater than the time domain length of one RU in the second resource. For example, the number of time slots occupied by the first RU may be equal to N times the number of time slots occupied by one RU in the second resource. N may be agreed upon by the protocol, configured by the network device, indicated by the network device, or determined by a preset method. For example, the preset method may include: N = L. Optionally, in some embodiments, the time domain length of the first RU may be greater than or equal to the time domain length required by the terminal to perform symbol spreading based on the OCC sequence. Optionally, the symbol spreading performed by the OCC sequence may include: slot-based OCC multiplexing spreading or symbol-based OCC multiplexing spreading. Optionally, the network device can further determine the aforementioned first time-domain length, which may be equal to the product of the time-domain length of the first RU and a second value. The second value may, for example, be the number of RUs occupied by NPUSCH in a single repeated transmission in the first resource. Optionally, in some embodiments, the second value may be equal to the aforementioned C, that is, the number of RUs occupied by NPUSCH in a single repeated transmission in the first resource is equal to the number of RUs occupied by NPUSCH in a single repeated transmission in the second resource. Optionally, the aforementioned first time-domain length may be greater than the time-domain length occupied by NPUSCH in a single repeated transmission in the second resource.

[0242] Optionally, as can be seen from the above, the network device can make the first TBS corresponding to the first resource equal to the second TBS corresponding to the second resource, and at the same time, it can make the time domain length occupied by one repeated transmission of NPUSCH in the first resource greater than the time domain length occupied by one repeated transmission of NPUSCH in the second resource. This makes the transmission code rate of NPUSCH on the first resource less than the transmission code rate of NPUSCH on the second resource, realizing low code rate OCC multiplexing transmission of NPUSCH. While ensuring the uplink capacity enhancement, it also improves the transmission efficiency of NPUSCH, reduces the communication resources required by NPUSCH, and improves the communication performance of NPUSCH.

[0243] In some embodiments, when determining the first repeated transmission resource, the network device may determine that the time domain length of the first repeated transmission resource is M times the time domain length of the second repeated transmission resource. For example, the number of RUs in the first repeated transmission resource may be M times the number of RUs in the second repeated transmission resource, where M > 1. M may be configured by the network device, agreed upon by the protocol, indicated by the network device, or determined by a predefined method. This predefined method may, for example, be M = L. Optionally, the second repeated transmission resource may be the resource occupied by one repeated transmission of NPUSCH in the second resource. Furthermore, the network device may also determine that the second time domain length is M times the third time domain length, where the second time domain length may be the time domain length mapped by a sequence value of an OCC sequence in the first repeated transmission resource, and the third time domain length may be the time domain length mapped by a sequence value of an OCC sequence in the second repeated transmission resource.

[0244] For example, Figure 2B is a schematic diagram of OCC multiplexing transmission of NPUSCH on a second resource according to an embodiment of the present disclosure, and Figures 2C and 2D are schematic diagrams of OCC multiplexing transmission of NPUSCH on a first resource according to an embodiment of the present disclosure. Assuming the OCC sequence length is 2, that is, the OCC sequence includes two sequence values, as shown in Figure 2B, the time-domain length of the resource occupied by one repeated transmission of NPUSCH in the second resource is 4 slots, and the bit values ​​carried by these 4 slots are 1, 2, 3, and 4 respectively. The number of repeated transmissions of NPUSCH is 4. Taking the first repeated transmission of NPUSCH in Figure 2B (1... st Taking repetition as an example, the OCC sequence is cyclically mapped twice in the first repetition of NPUSCH. In the first mapping, the first sequence value of the OCC sequence is mapped to the first slot, and the second sequence value can be mapped to the second slot. In the second mapping, the first sequence value of the OCC sequence is mapped to the third slot, and the second sequence value can be mapped to the fourth slot. At this time, the time domain length (i.e., the third time domain length) of one sequence value of the OCC sequence mapped in the second repetition resource is 1 time slot.

[0245] Optionally, assuming NPUSCH performs two symbol spreading operations (for a detailed explanation of symbol spreading, please refer to the description above), as shown in Figure 2C and Figure 2D respectively, then referring to Figure 2C, the OCC sequence is mapped to the first resource using slot-level OCC multiplexing (slot). The time-domain length of the resource occupied by NPUSCH in one repeated transmission in the first resource is 8 slots, and the bit values ​​carried by these 8 slots are 1, 1, 2, 2, 3, 3, 4, 4 respectively. The time-domain length of the resource occupied by NPUSCH in one repeated transmission in the first resource (i.e., 8 slots) is twice the time-domain length of the resource occupied by NPUSCH in one repeated transmission in the second resource (i.e., 4 slots). Taking the first repeated transmission of NPUSCH in Figure 2C (1 st Taking repetition as an example, the OCC sequence is cyclically mapped twice in the first repetition of NPUSCH. In the first mapping, the first sequence value of the OCC sequence is continuously mapped to the first and second slots, and the second sequence value is continuously mapped to the third and fourth slots. In the second mapping, the first sequence value of the OCC sequence is continuously mapped to the fifth and sixth slots, and the second sequence value is continuously mapped to the seventh and eighth slots. At this time, the time domain length (i.e., the second time domain length) of one sequence value of the OCC sequence mapped in the first repetition resource is 2 time slots, and the second time domain length is twice the third time domain length.

[0246] Referring to Figure 2D, the OCC sequence is mapped to the first resource using slot-level OCC multiplexing (2 slots). The time-domain length of the resource occupied by one repeated transmission of NPUSCH in the first resource is 8 slots. The bit values ​​carried by these 8 slots are 1, 2, 1, 2, 3, 4, 3, 4, respectively. The time-domain length of the resource occupied by one repeated transmission of NPUSCH in the first resource (i.e., 8 slots) is twice the time-domain length of the resource occupied by one repeated transmission of NPUSCH in the second resource (i.e., 4 slots). Taking the first repeated transmission of NPUSCH in Figure 2D (1...) as an example... stTaking repetition as an example, the OCC sequence is cyclically mapped twice in the first repetition transmission of NPUSCH. In the first mapping, the first sequence value of the OCC sequence is mapped to the first and third slots, and the second sequence value is mapped to the second and fourth slots. In the second mapping, the first sequence value of the OCC sequence is mapped to the fifth and seventh slots, and the second sequence value is mapped to the sixth and eighth slots. At this time, the second time domain length is 2 slots, which is twice the length of the third time domain.

[0247] Optionally, after determining the first repeated transmission resource, the network device can also determine a third TBS. This third TBS can be the TBS corresponding to the encoded bits in one repeated transmission of the NPUSCH in the first resource, and the third TBS is smaller than the first TBS. Optionally, referring to Figures 2B to 2D above, the time domain length of the first repeated transmission resource is M times the time domain length of the second repeated transmission resource, and the first TBS corresponding to the first repeated transmission resource (i.e., the time domain length of the actual carried bits in the first repeated transmission resource) is also M times the second TBS corresponding to the second repeated transmission resource (i.e., the time domain length of the actual carried bits in the second repeated transmission resource). In this case, if all the first TBSs in the first repeated transmission resource are encoded, it is equivalent to the number of encoded bits in one repeated transmission in the first resource being M times the number of encoded bits in one repeated transmission in the second resource, and the time domain length in one repeated transmission in the first resource being M times the time domain length in one repeated transmission in the second resource. Therefore, the transmission code rate of the first resource is the same as that of the second resource, which does not achieve the purpose of "reducing the NPUSCH transmission code rate" in the embodiments of this disclosure. Therefore, in some embodiments, when encoding a single repeated transmission in the first resource, it is necessary to discard some bits. For example, some redundant bits can be discarded. As shown in Figure 2C above, the bit values ​​carried by the 8 slots occupied by NPUSCH in a single repeated transmission in the first resource are 1, 1, 2, 2, 3, 3, 4, 4, respectively. That is, "1, 2, 3, 4" are carried twice. In this case, 4 bits can be discarded. For example, only the bits 1, 2, 3, 4 carried by "the second slot, the fourth slot, the sixth slot, and the eighth slot" can be encoded (regarding the terminal). For details on how to determine the encoded bits, please refer to the following step 2104. This makes the TBS (i.e., the third TBS) corresponding to the actual number of encoded bits in a single repetition transmission in the first resource less than the TBS (i.e., the first TBS) occupied by a single repetition transmission in the first resource. In other words, it is equivalent to the time domain length of the first repetition transmission resource being M times the time domain length of the second repetition transmission resource. However, the number of encoded bits in the first repetition transmission resource is S times the number of encoded bits in the second repetition transmission resource, where S < M. Therefore, the transmission code rate of NPUSCH on the first resource can be made less than the transmission code rate of NPUSCH on the second resource.

[0248] In some embodiments, when determining the third TBS, the network device may determine that the third TBS is equal to the second TBS. Optionally, the second TBS may be determined by the network device based on the available resources in all RUs of the second repeat transmission resource. Optionally, the "available resources in all RUs of the second repeat transmission resource" may include: information bits and / or data bits carried in all RUs of the second repeat transmission resource, but does not include the bits carried by the symbol spreading resources in all RUs of the second repeat transmission resource. In other words, when symbol spreading is performed in OCC multiplexing transmission, the "available resources in all RUs of the second repeat transmission resource" may include one of the time domain units (such as time slots or symbols) mapped by each sequence value of the OCC sequence.

[0249] In some embodiments, when determining the third TBS, the network device may determine that the third TBS is equal to the product of the first TBS and the first value. Optionally, the first TBS may be determined by the network device based on the number of RUs in the first repeatable transmission resource. For example, the network device may pre-set a correspondence between the number of RUs and TBSs, and determine the TBS corresponding to the number of RUs in the first repeatable transmission resource as the first TBS based on this correspondence. Alternatively, the network device may also use existing methods for determining the second TBS to determine the first TBS based on the number of RUs in the first repeatable transmission resource by looking up a table. A detailed description of the first value can be found in the above description.

[0250] Optionally, as described above, the network device can ensure that the time domain length occupied by a single repetition of NPUSCH in the first resource is M times the time domain length occupied by a single repetition of NPUSCH in the second resource. That is, the time domain length occupied by a single repetition of NPUSCH in the first resource is greater than the time domain length occupied by a single repetition of NPUSCH in the second resource. At the same time, the number of encoded bits in a single repetition of NPUSCH in the first resource is less than the number of encoded bits in a single repetition of NPUSCH in the second resource. This allows the transmission code rate of NPUSCH on the first resource to be less than the transmission code rate of NPUSCH on the second resource, achieving low code rate OCC multiplexing transmission of NPUSCH. While ensuring enhanced uplink capacity, this also improves the transmission efficiency of NPUSCH, reduces the communication resources required for NPUSCH, and improves the communication performance of NPUSCH.

[0251] Step 2102: The network device configures and / or indicates the first resource to the terminal.

[0252] Optionally, in some embodiments, the network device may configure and / or indicate to the terminal at least one of the following: a second TBS, a first value, a first calculation method, a second calculation method, a first TBS, a third TBS, the time domain length of the first RU, the first time domain length, the time domain length occupied by NPUSCH for one repeated transmission in the second resource, the first repeated transmission resource, the time domain length of the first repeated transmission resource, the time domain length of the second repeated transmission resource, the sequence length of the OCC sequence, the start position of the first resource, the end position of the first resource, the resource length of the first resource, the OCC multiplexing transmission method, the number of times NPUSCH is repeatedly transmitted in the second resource, the number of times NPUSCH is repeatedly transmitted in the first resource, the number of RUs occupied by NPUSCH for one repeated transmission in the second resource, and the number of RUs occupied by NPUSCH for one repeated transmission in the first resource.

[0253] Step 2103: The terminal determines the first resource.

[0254] Optionally, the terminal may determine the first resource based on a protocol agreement, or the terminal may receive the first resource configured by the network device, or the terminal may receive the first resource indicated by the network device.

[0255] For a detailed introduction to the first resource, please refer to the description in step 2101 above.

[0256] Optionally, in some embodiments, the terminal may determine that the first TBS is equal to the product of the second TBS and the first value. In other embodiments, the terminal may determine the first RU and the first time domain length, and determine that the first TBS is equal to the second TBS. In still other embodiments, the terminal may determine the first repeatable transmission resource and the third TBS. The methods used by the terminal to determine the first TBS, the first RU, the first time domain length, the first repeatable transmission resource, and the third TBS are similar to the methods used by the network device in step 2101 above, and will not be repeated here.

[0257] Step 2104: The terminal sends NPUSCH based on the first resource.

[0258] Optionally, the terminal may perform OCC multiplexing transmission on the NPUSCH on the first resource. In some embodiments, the terminal may first map the OCC sequence to the NPUSCH based on the OCC multiplexing transmission method, encode the OCC-mapped NPUSCH to obtain the encoded NPUSCH, and then transmit the encoded NPUSCH.

[0259] Optionally, different OCC multiplexing transmission methods can be used for different types of NPUSCH. In some embodiments, for single-tone 3.75kHz SCS NPUSCH format 1, the terminal can use symbol-level OCC multiplexing to transmit NPUSCH. For single-tone 15kHz SCS NPUSCH format 1, the terminal can use slot-level OCC multiplexing to transmit NPUSCH, such as using slot-level OCC multiplexing (slot) or slot-level OCC multiplexing (2slot) to transmit NPUSCH.

[0260] Optionally, the encoding methods corresponding to different OCC multiplexing transmission methods may also differ. In some embodiments, when an OCC sequence value is mapped to multiple consecutive time slots of the first resource, i.e., when the OCC multiplexing transmission method is slot-level OCC multiplexing (slot), the terminal can encode time slots that satisfy the second rule. Optionally, the terminal can use a second method to encode adjacent time slots that satisfy the second rule. This second method can be used to make the end bit of the encoded bit corresponding to the first time slot adjacent to the start bit of the encoded bit corresponding to the second time slot. Optionally, the first time slot and the second time slot can be adjacent time slots that satisfy the second rule, and the time domain position of the first time slot can be located before the time domain position of the second time slot. That is, the first time slot can be the time slot with an earlier time domain position among the adjacent time slots that satisfy the second rule, and the second time slot can be the time slot with a later time domain position among the adjacent time slots that satisfy the second rule. In some embodiments, the first method can be a back-to-back encoding method. Optionally, the second rule can include: mod(F, L) = k, where the mod function is a modulo function, F is the time slot index, L is the sequence length of the OCC sequence, and k = 0, 1, ..., or L-1.

[0261] Optionally, when two adjacent time slots satisfy the second rule, it indicates that the information carried by the two adjacent time slots is continuous. For example, referring to Figure 2C above, the bit values ​​carried by the 8 slots of NPUSCH in the first resource are as follows: 1, 1, 2, 2, 3, 3, 4, 4. Here, it is assumed that the time slot index of the first slot is 0, the time slot index of the second slot is 1, the time slot index of the third slot is 2, the time slot index of the fourth slot is 3, the time slot index of the fifth slot is 4, the time slot index of the sixth slot is 5, the time slot index of the seventh slot is 6, and the time slot index of the eighth slot is 7. Furthermore, if the sequence length L of the OCC sequence is 2, then the value of k can be either 0 or 1. When k = 0, the slot indices satisfying the second rule mentioned above are "slot index 0 for the first slot, slot index 2 for the third slot, slot index 4 for the fifth slot, and slot index 6 for the seventh slot". The bit values ​​carried by "slot 1, slot 3, slot 5, and slot 7" are 1, 2, 3, and 4 respectively. Therefore, the information carried by adjacent slots is continuous. In this case, "1, 2, 3, 4" can be encoded using a back-to-back encoding method to ensure the continuity of information. To avoid information garbled characters and ensure transmission quality, when k=1, the time slot index that satisfies the second rule above is "time slot index 1 for the second slot, time slot index 3 for the fourth slot, time slot index 5 for the sixth slot, and time slot index 7 for the eighth slot". The bit values ​​carried by "second slot, fourth slot, sixth slot, and eighth slot" are 1, 2, 3, and 4 respectively. The information carried by adjacent time slots is continuous. At this time, "1, 2, 3, 4" can be encoded in a back-to-back encoding manner, which can ensure the continuity of information, avoid information garbled characters, and ensure transmission quality.

[0262] In other embodiments, when an OCC sequence value is mapped to multiple non-contiguous time slots of a first resource, i.e., when the OCC multiplexing transmission method is slot-level OCC multiplexing (2 slots), the terminal can sequentially divide the time slots mapped by the OCC sequence into at least one time-domain window (or block), the time-domain length of which is L. Then, the terminal can sequentially index and number the at least one time-domain window and encode the time slots in the time-domain window that satisfy the third rule. Optionally, the terminal can use a third method to encode adjacent time-domain windows that satisfy the third rule. This third method can be used to make the end bit of the encoded bit corresponding to the first time-domain window adjacent to the start bit of the encoded bit corresponding to the second time-domain window. Optionally, the first time-domain window and the second time-domain window are adjacent time-domain windows that satisfy the third rule, and the time-domain position of the first time-domain window is before the time-domain position of the second time-domain window. That is, the first time-domain window can be the time-domain window that is earlier in the time-domain position among adjacent time-domain windows that satisfy the third rule, and the second time-domain window can be the time-domain window that is later in the time-domain position among adjacent time-domain windows that satisfy the third rule. In some embodiments, the second method can be a back-to-back encoding method, and the third rule can include: mod(G, L) = k, where G is the index of the time-domain window.

[0263] Optionally, when two adjacent time-domain windows satisfy the third rule, it indicates that the information carried by the two adjacent time-domain windows is continuous. For example, referring to Figure 2D above, the bit values ​​carried by the 8 slots of NPUSCH in the first resource are 1, 2, 1, 2, 3, 4, 3, 4 respectively. Then the terminal can divide the first time slot and the second time slot into the first time-domain window with a time-domain index of 0, divide the third time slot and the fourth time slot into the second time-domain window with a time-domain index of 1, divide the fifth time slot and the sixth time slot into the third time-domain window with a time-domain index of 2, and divide the seventh time slot and the eighth time slot into the fourth time-domain window with a time-domain index of 3. Furthermore, if the sequence length L of the OCC sequence is 2, then the value of k can be either 0 or 1. When k = 0, the time-domain window index satisfying the third rule mentioned above is "time-domain window index 0 for the first time-domain window and time-domain window index 2 for the third time-domain window". The bit values ​​carried by the "first time-domain window" and the "third time-domain window" are 1, 2, 3, and 4 respectively. Therefore, the information carried by adjacent time slots is continuous. In this case, "1, 2, 3, 4" can be encoded using a back-to-back encoding method to ensure the continuity of information. To avoid information garbled characters and ensure transmission quality, when k=1, the time-domain window index that satisfies the third rule above is "time-domain window index 1 of the second time-domain window and time-domain window index 3 of the fourth time-domain window". The bit values ​​carried by the "second time-domain window and the fourth time-domain window" are 1, 2, 3 and 4 respectively. Then the information carried by adjacent time slots is continuous. At this time, "1, 2, 3 and 4" can be encoded in a back-to-back encoding manner, which can ensure the continuity of information, avoid information garbled characters, and ensure transmission quality.

[0264] As can be seen from the above, when the terminal's OCC multiplexing transmission method is slot-level OCC multiplexing (slot) or slot-level OCC multiplexing (2slot), compared to the second repeated transmission resource mentioned above, the terminal's first repeated transmission resource will carry more redundant coded bits. For example, in Figure 2B, a single repeated transmission carries only 4 bits, while in Figures 2C and 2D, a single repeated transmission carries 8 bits. However, the encoding method described in this disclosure not only ensures that the terminal encodes complete information but also ensures that the terminal does not encode redundant bits. That is, the number of bits finally encoded by the terminal is still 4, not 8, and the consecutive complete bit values ​​"1, 2, 3, 4" are encoded. In other words, the bits actually encoded in this disclosure (or the third TBS) do not include the bits carried by the symbol spreading resource. In other words, when OCC multiplexing transmission performs symbol spreading, the terminal encodes the bits on one time-domain unit (such as a time slot or symbol) mapped to each sequence value of the OCC sequence.

[0265] In some embodiments, when an OCC sequence value is mapped to a symbol (e.g., multiple symbols) of a first resource, i.e., when the OCC multiplexing transmission method is symbol-level OCC multiplexing (e.g., symbol-based OCC multiplexing spreading), the terminal can encode symbols that satisfy a first rule. Optionally, the terminal can use a first method to encode adjacent symbols that satisfy the first rule. This first method can be used to make the end bit of the encoded bits corresponding to the first symbol adjacent to the start bit of the encoded bits corresponding to the second symbol. Optionally, the first symbol and the second symbol can be adjacent symbols that satisfy the first rule, and the time domain position of the first symbol can be before the time domain position of the second symbol. That is, the first symbol can be the symbol with the earlier time domain position among the adjacent symbols that satisfy the first rule, and the second symbol can be the symbol with the later time domain position among the adjacent symbols that satisfy the first rule. In some embodiments, the first method can be a back-to-back encoding method, and the first rule can include: mod(H, L) = k, where H is the symbol index.

[0266] In some embodiments, after the terminal sends the NPUSCH based on the first resource, the network device can receive the NPUSCH based on the first resource. Optionally, as mentioned above, if the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource, then the reception code rate of the NPUSCH on the first resource should also be less than the reception code rate of the NPUSCH on the second resource. Furthermore, similar to the encoding principle described above, the decoding methods corresponding to different OCC multiplexing transmission methods will also differ. In some embodiments, if a sequence value of an OCC sequence is mapped to a symbol of a first resource, the network device can decode adjacent symbols that satisfy a first rule. For example, the network device can decode adjacent symbols that satisfy the first rule using a fourth method, where the end bit of the decoded bit corresponding to the first symbol is adjacent to the start bit of the decoded bit corresponding to the second symbol. The first symbol and the second symbol are adjacent symbols that satisfy the first rule, and the time domain position of the first symbol is before the time domain position of the second symbol. If a sequence value of an OCC sequence is mapped to multiple consecutive time slots of the first resource, the network device can decode time slots that satisfy a second rule. For example, the network device can decode adjacent time slots that satisfy the second rule using a fifth method, where the end bit of the decoded bit corresponding to the first time slot is adjacent to the start bit of the decoded bit corresponding to the second time slot. The start bits of the code bits are adjacent. The first and second time slots are adjacent time slots that satisfy the second rule, and the time domain position of the first time slot is before the time domain position of the second time slot. If a sequence value of an OCC sequence is mapped to multiple non-contiguous time slots of the first resource, the network device can sequentially divide the time slots mapped by the OCC sequence into at least one time domain window, and sequentially index and number the at least one time domain window. It can also decode the time slots in the time domain windows that satisfy the third rule. For example, the network device can use a sixth method to decode the time slots in adjacent time domain windows that satisfy the third rule. The sixth method ensures that the end bit of the decoded bit corresponding to the first time domain window is adjacent to the start bit of the decoded bit corresponding to the second time domain window. The first and second time domain windows are adjacent time domain windows that satisfy the third rule, and the time domain position of the first time domain window is before the time domain position of the second time domain window. For a detailed description of this part, please refer to the above description.

[0267] In summary, in the above embodiments, the terminal determines a first resource for OCC multiplexing transmission of NPUSCH and transmits NPUSCH on this first resource. The transmission code rate of NPUSCH on the first resource is lower than the transmission code rate of NPUSCH on a second resource, which is used for non-OCC multiplexing transmission of NPUSCH. Therefore, when NPUSCH is OCC multiplexed using the resource determined by the method of this disclosure embodiment, the transmission code rate of NPUSCH can be reduced, thereby achieving low-code-rate OCC multiplexing transmission of NPUSCH. This ensures enhanced uplink capacity while also improving NPUSCH transmission efficiency, reducing the communication resources required for NPUSCH, and improving NPUSCH communication performance.

[0268] The resource determination method involved in the embodiments of this disclosure may include at least one of steps 2101 to 2104. For example, step 2101 may be implemented as an independent embodiment, step 2102 may be implemented as an independent embodiment, step 2103 may be implemented as an independent embodiment, and step 2101+S2102 may be implemented as an independent embodiment, but is not limited thereto.

[0269] In this implementation or embodiment, unless there is contradiction, each step can be independent, arbitrarily combined or exchanged in order, optional methods or optional examples can be arbitrarily combined, and can be arbitrarily combined with any steps of other implementations or other embodiments.

[0270] Figure 3 is an interactive schematic diagram of a resource determination method according to an embodiment of the present disclosure. As shown in Figure 3, the present disclosure relates to a resource determination method for a terminal, the method including:

[0271] Step 3101: Determine the first resource.

[0272] Step 3102: Send NPUSCH based on the first resource.

[0273] Optionally, the first resource is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH);

[0274] Optionally, the transmission rate of the NPUSCH on the first resource is less than the transmission rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0275] The first resource satisfies at least one of the following: the transport block size (TBS) occupied by a single repeat transmission in the first resource is less than the TBS occupied by a single repeat transmission in the second resource; or the resource length of a single repeat transmission in the first resource is greater than the resource length of a single repeat transmission in the second resource.

[0276] Optionally, the method further includes:

[0277] The first TBS is determined to be equal to the product of the second TBS and the first value, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource, and the first value is in the range of (0, 1).

[0278] Optionally, the method further includes:

[0279] A first resource unit (RU) is determined, wherein the time domain length of the first RU is greater than the time domain length of one RU in the second resource;

[0280] The first TBS and the second TBS are determined to be equal, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, and the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource.

[0281] A first time domain length is determined, which is the time domain length occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is equal to the product of the time domain length of the first RU and a second value, where the second value is the number of RUs occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is greater than the time domain length occupied by the NPUSCH in one repeated transmission in the second resource.

[0282] Optionally, the method further includes:

[0283] A first repeat transmission resource is determined, which is the resource occupied by the NPUSCH in one repeat transmission in the first resource. The time domain length of the first repeat transmission resource is M times the time domain length of the second repeat transmission resource. The second repeat transmission resource is the resource occupied by the NPUSCH in one repeat transmission in the second resource, where M > 1.

[0284] Optionally, the OCC multiplexing transmission of the NPUSCH includes at least one of the following:

[0285] One sequence value of an OCC sequence is mapped to one or more symbols;

[0286] One sequence value of an OCC sequence is mapped to one time slot or multiple consecutive time slots;

[0287] One sequence value of an OCC sequence is mapped to multiple non-contiguous time slots, with an interval of L-1 time slots between adjacent time slots mapped to the same sequence value, where L is the sequence length of the OCC sequence.

[0288] Optionally, the second time domain length is M times the third time domain length, wherein the second time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the first repeat transmission resource, the second resource is also used for OCC multiplexing transmission of the NPUSCH, and the third time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the second repeat transmission resource.

[0289] Optionally, the method further includes at least one of the following:

[0290] The OCC sequence is mapped to a symbol of the first resource, and symbols that satisfy the first rule are encoded. The first rule includes: mod(H, L) = k, where the mod function is the modulo function, H is the symbol index, L is the sequence length of the OCC sequence, and k = 0, 1, ..., or L-1.

[0291] The OCC sequence is mapped to multiple consecutive time slots of the first resource. Time slots that satisfy the second rule are encoded. The second rule includes: mod(F, L) = k, where F is the time slot index.

[0292] The OCC sequence is mapped to multiple non-contiguous time slots of the first resource. The time slots mapped by the OCC sequence are sequentially divided into at least one time-domain window. The time-domain length of the time-domain window is L. The at least one time-domain window is sequentially indexed and numbered. The time slots in the time-domain window that satisfy the third rule are encoded. The third rule includes: mod(G, L) = k, where G is the index of the time-domain window.

[0293] Optionally, encoding the symbols that satisfy the first rule includes:

[0294] Adjacent symbols that satisfy the first rule are encoded using a first method. The first method is used to make the end bit of the encoding bit corresponding to the first symbol adjacent to the start bit of the encoding bit corresponding to the second symbol. The first symbol and the second symbol are adjacent symbols that satisfy the first rule, and the time domain position of the first symbol is located before the time domain position of the second symbol.

[0295] The encoding of time slots that satisfy the second rule includes:

[0296] The adjacent time slots that satisfy the second rule are encoded using a second method. The second method is used to make the end bit of the encoded bit corresponding to the first time slot adjacent to the start bit of the encoded bit corresponding to the second time slot. The first time slot and the second time slot are adjacent time slots that satisfy the second rule. The time domain position of the first time slot is located before the time domain position of the second time slot.

[0297] The encoding of time slots within a time-domain window that satisfies the third rule includes:

[0298] The time slots in adjacent time-domain windows that satisfy the third rule are encoded using a third method. The third method is used to make the end bit of the encoded bit corresponding to the first time-domain window adjacent to the start bit of the encoded bit corresponding to the second time-domain window. The first time-domain window and the second time-domain window are adjacent time-domain windows that satisfy the third rule, and the time-domain position of the first time-domain window is located before the time-domain position of the second time-domain window.

[0299] Optionally, the method further includes:

[0300] A third TBS is determined, wherein the third TBS is the TBS corresponding to the encoded bits of the NPUSCH in one repeated transmission of the first resource, and the third TBS is less than the first TBS, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission of the first resource.

[0301] Optionally, determining the third TBS includes at least one of the following:

[0302] The third TBS is determined to be equal to the second TBS, where the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource;

[0303] The third TBS is determined to be equal to the product of the first TBS and the first value, where the first value ranges from (0, 1).

[0304] Optionally, the method further includes at least one of the following:

[0305] Receive the second TBS and / or the first value configured by the network device;

[0306] The first value is determined based on the first calculation method;

[0307] The second TBS is determined based on the second calculation method.

[0308] For a detailed description of steps 3101-3102, please refer to the above embodiment description.

[0309] The resource determination method involved in the embodiments of this disclosure may include at least one of steps 3101 to 3102. For example, step 3101 may be implemented as an independent embodiment, step 3102 may be implemented as an independent embodiment, and step 3101+S3102 may be implemented as an independent embodiment, but is not limited thereto.

[0310] In this implementation or embodiment, unless there is contradiction, each step can be independent, arbitrarily combined or exchanged in order, optional methods or optional examples can be arbitrarily combined, and can be arbitrarily combined with any steps of other implementations or other embodiments.

[0311] Figure 4 is an interactive schematic diagram of a resource determination method according to an embodiment of the present disclosure. As shown in Figure 4, this disclosure relates to a resource determination method for a network device, the method comprising:

[0312] Step 4101: Determine the first resource.

[0313] Step 4102: Receive NPUSCH based on the first resource.

[0314] Optionally, the first resource is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH);

[0315] Optionally, the NPUSCH receive code rate on the first resource is less than the NPUSCH receive code rate on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0316] Optionally, the first resource satisfies at least one of the following: the transport block size (TBS) occupied by a single repeat transmission in the first resource is smaller than the TBS occupied by a single repeat transmission in the second resource; or the resource length of a single repeat transmission in the first resource is greater than the resource length of a single repeat transmission in the second resource.

[0317] Optionally, the method further includes:

[0318] The first TBS is determined to be equal to the product of the second TBS and the first value, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource, and the first value is in the range of (0, 1).

[0319] Optionally, the method further includes:

[0320] A first resource unit (RU) is determined, wherein the time domain length of the first RU is greater than the time domain length of one RU in the second resource;

[0321] The first TBS and the second TBS are determined to be equal, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, and the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource.

[0322] A first time domain length is determined, which is the time domain length occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is equal to the product of the time domain length of the first RU and a second value, where the second value is the number of RUs occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is greater than the time domain length occupied by the NPUSCH in one repeated transmission in the second resource.

[0323] Optionally, the method further includes:

[0324] A first repeat transmission resource is determined, which is the resource occupied by the NPUSCH in one repeat transmission in the first resource. The time domain length of the first repeat transmission resource is M times the time domain length of the second repeat transmission resource. The second repeat transmission resource is the resource occupied by the NPUSCH in one repeat transmission in the second resource, where M > 1.

[0325] Optionally, the OCC multiplexing transmission of the NPUSCH includes at least one of the following:

[0326] One sequence value of an OCC sequence is mapped to one or more symbols;

[0327] One sequence value of an OCC sequence is mapped to one time slot or multiple consecutive time slots;

[0328] One sequence value of an OCC sequence is mapped to multiple non-contiguous time slots, with an interval of L-1 time slots between adjacent time slots mapped to the same sequence value, where L is the sequence length of the OCC sequence.

[0329] Optionally, the second time domain length is M times the third time domain length, wherein the second time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the first repeat transmission resource, the second resource is also used for OCC multiplexing transmission of the NPUSCH, and the third time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the second repeat transmission resource.

[0330] Optionally, the method further includes at least one of the following:

[0331] The OCC sequence is mapped to a symbol of the first resource. Symbols that satisfy the first rule are decoded. The first rule includes: mod(H, L) = k, where the mod function is the modulo function, H is the symbol index, L is the sequence length of the OCC sequence, and k = 0, 1, ..., or L-1.

[0332] The OCC sequence is mapped to multiple consecutive time slots of the first resource. Time slots that satisfy the second rule are decoded. The second rule includes: mod(F, L) = k, where F is the time slot index.

[0333] The OCC sequence is mapped to multiple non-contiguous time slots of the first resource. The time slots mapped by the OCC sequence are sequentially divided into at least one time-domain window, and the time-domain length of the time-domain window is L. The at least one time-domain window is sequentially indexed and numbered. The time slots in the time-domain window that satisfy the third rule are decoded. The third rule includes: mod(G, L) = k, where G is the index of the time-domain window.

[0334] Optionally, decoding the symbols that satisfy the first rule includes:

[0335] The adjacent symbols that satisfy the first rule are decoded using a fourth method. The fourth method is used to make the end bit of the decoded bit corresponding to the first symbol adjacent to the start bit of the decoded bit corresponding to the second symbol. The first symbol and the second symbol are adjacent symbols that satisfy the first rule, and the time domain position of the first symbol is located before the time domain position of the second symbol.

[0336] Decoding the time slots that satisfy the second rule includes:

[0337] The adjacent time slots that satisfy the second rule are decoded using a fifth method. The fifth method is used to make the end bit of the decoded bit corresponding to the first time slot adjacent to the start bit of the decoded bit corresponding to the second time slot. The first time slot and the second time slot are adjacent time slots that satisfy the second rule, and the time domain position of the first time slot is located before the time domain position of the second time slot.

[0338] Decoding the time slots in the time-domain window that satisfy the third rule includes:

[0339] The time slots in adjacent time-domain windows that satisfy the third rule are decoded using a sixth method. The sixth method is used to make the end bit of the decoded bit corresponding to the first time-domain window adjacent to the start bit of the decoded bit corresponding to the second time-domain window. The first time-domain window and the second time-domain window are adjacent time-domain windows that satisfy the third rule, and the time-domain position of the first time-domain window is located before the time-domain position of the second time-domain window.

[0340] Optionally, the method further includes:

[0341] A third TBS is determined, wherein the third TBS is the TBS corresponding to the encoded bits of the NPUSCH in one repeated transmission of the first resource, and the third TBS is less than the first TBS, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission of the first resource.

[0342] Optionally, determining the third TBS includes at least one of the following:

[0343] The third TBS is determined to be equal to the second TBS, where the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource;

[0344] The third TBS is determined to be equal to the product of the first TBS and the first value, where the first value ranges from (0, 1).

[0345] Optionally, the method further includes:

[0346] Configure the second TBS and / or the first value to the terminal.

[0347] For a detailed description of steps 4101-4102, please refer to the above embodiment description.

[0348] The resource determination method involved in the embodiments of this disclosure may include at least one of steps 4101 to 4102. For example, step 4101 may be implemented as a separate embodiment, step 4102 may be implemented as a separate embodiment, and step 4101+4102 may be implemented as a separate embodiment, but is not limited thereto.

[0349] In this implementation or embodiment, unless there is contradiction, each step can be independent, arbitrarily combined or exchanged in order, optional methods or optional examples can be arbitrarily combined, and can be arbitrarily combined with any steps of other implementations or other embodiments.

[0350] Figure 5 is an interactive schematic diagram of a resource determination method according to an embodiment of the present disclosure. As shown in Figure 5, this disclosure relates to a resource determination method for a communication system, which includes network devices and terminals. The method includes at least one of the following:

[0351] Step 5101: The terminal and / or network device determines the first resource.

[0352] Step 5102: The terminal sends NPUSCH based on the first resource.

[0353] Step 5103: The network device receives the NPUSCH based on the first resource.

[0354] The optional implementation methods of steps 5101-5103 can be found in the above embodiments.

[0355] In some embodiments, the above methods may include the methods described in the embodiments of the communication system side, terminal side, network device side, etc., which will not be repeated here.

[0356] The resource determination method involved in the embodiments of this disclosure may include at least one of steps 5101 to 5102. For example, step 5101 may be implemented as a separate embodiment, and step 5102 may be implemented as a separate embodiment, but is not limited thereto.

[0357] In this implementation or embodiment, unless there is contradiction, each step can be independent, arbitrarily combined or exchanged in order, optional methods or optional examples can be arbitrarily combined, and can be arbitrarily combined with any steps of other implementations or other embodiments.

[0358] The following is an exemplary description of the above method.

[0359] For symbol-level OCC multiplexing of single-tone 3.75kHz SCS NPUSCH format 1, or slot-level multiplexing of single-tone 15kHz SCS NPUSCH format 1, the actual transmission bit rate will be relatively high when performing OCC multiplexing. In order to effectively expand the system capacity and ensure a certain number of multiplexed users, an effective solution needs to be considered to reduce the actual transmission bit rate, thereby increasing the uplink system capacity while effectively ensuring the link performance of the data channel.

[0360] To address the issue of high actual transmission bit rate, at least one of the following design methods can be considered:

[0361] Method 1: For symbol-level / slot-level OCC multiplexing, perform TBS scaling based on the scaling factor.

[0362] Key Point 1: The scaling factor is determined based on eNB configuration / instructions or a protocol preset method. The scaling factor is used to determine the TBS of a repetition under OCC multiplexing (the TBS is the first TBS, i.e., the target TBS). For example, the scaling factor is 1 / OCC length, or equal to 1 / OCC multiplexing user number.

[0363] Key Point 2: The terminal performing OCC multiplexing determines the first TBS based on the parameters indicated by the eNB (the second TBS, which is the TBS of a single repetition in the legacy system) and the scaling factor. For example, the first TBS = the second TBS * the scaling factor.

[0364] Method 2: For symbol-level / slot-level OCC multiplexing, the number of slots occupied by the RU is expanded.

[0365] Key Point 1: Define a first RU, which differs from the second RU. The second RU is a resource unit definition for NPUSCH format 1 in the legacy system. The first and second RUs contain different numbers of slots. For example, the number of slots occupied by the first RU = the number of slots occupied by the second RU * N, where N can be determined by eNB configuration / instruction or protocol preset methods, for example, N is the OCC length / number of OCC multiplexing users. The number of slots occupied by the first RU is the total number of slots occupied within one RU after symbol spreading (which can be slot-based spreading or symbol-based (time-domain resource granularity) spreading) is completed when the terminal performs OCC multiplexing.

[0366] Key Point 2: The eNB allocates resources to the terminal based on the first RU defined in Key Point 1; simultaneously, the terminal / eNB performs TBS calculation based on the number of slots occupied by the second RU and the number of RUs. Alternatively, the eNB allocates resources to the terminal based on the number of slots of the second RU defined in Key Point 1; simultaneously, the terminal / eNB performs TBS calculation based on the number of slots occupied by the second RU and the number of RUs.

[0367] Key Point 3: Based on the first RU and the number of RUs indicated by the eNB as defined in Key Point 1, the terminal determines the total number of time-domain resources actually occupied in a single transmission (including time-domain resources used for symbol spreading).

[0368] Method 3: Utilize the time-domain resources of repetition under legacy NPUSCH format 1 transmission mode to carry more redundant coded bits to support symbol spreading.

[0369] Key Point 1: Define a first repetition, which is different from the second repetition. The second repetition is the definition of an NPUSCH format 1 repetition in the legacy system. The number of RUs contained in the first and second repetitions are different. For example, the number of RUs contained in the first repetition = the number of RUs contained in the second repetition * M, where M can be determined by eNB configuration / instruction or protocol preset, for example, M is the OCC length or the number of OCC multiplexed users.

[0370] Key Point 2: Perform M times of symbol spreading in the temporal resources of the first repetition defined in Key Point 1. The symbol spreading can be symbol spreading under slot-level OCC multiplexing (2 slots / slot) or symbol spreading under symbol-level OCC multiplexing.

[0371] Note: The value in the OCC sequence is covered by the corresponding symbol in the symbol spreading.

[0372] Example: Assume that in one NPUSCH transmission, one RU occupies 4 slots, there are 2 multiplexed users, the number of repetitions is 4, and two symbol spreadings are performed. Taking the symbol spreading under slot-level OCC multiplexing (2 slots / slot) as an example, please refer to Figures 2B-2D above.

[0373] Key Point 3: Based on Key Point 2, at least one of the following methods can be considered for rate-matching within a first repetition as defined in Key Point 1.

[0374] Method 1: For single-tone 3.75kHz SCS NPUSCH format 1 symbol-level OCC multiplexing, two adjacent symbols that satisfy the condition mod(symbol index, OCC length / number of multiplexed users) = k (k = 0, 1, ..., OCC length / number of multiplexed users - 1) are back-to-back encoded. That is, the starting bit of the next symbol is the ending bit of the previous symbol + 1.

[0375] Method 2: For slot-level multiplexing of single-tone 15kHz SCS NPUSCH format 1, symbol spreading is performed based on slots. Between two adjacent slots that satisfy the condition mod(slot index, OCC length / number of multiplexed users) = k (k = 0, 1, ..., OCC length / number of multiplexed users - 1), back-to-back encoding is used to select the bit value. That is, the starting bit of the next slot is the ending bit of the previous slot + 1.

[0376] Method 3: For slot-level multiplexing of single-tone 15kHz SCS NPUSCH format 1, symbol spreading is performed based on 2 slots. Two slots are defined as 1 block. Two adjacent blocks that satisfy the condition mod(Block index, OCC length / number of multiplexed users) = k (k = 0, 1, ..., OCC length / number of multiplexed users - 1) use back-to-back encoding bit values. That is, the starting bit of the next block is the ending bit of the previous block + 1.

[0377] Key Point 4: The calculation method for TBS includes at least one of the following:

[0378] Method 1: Determined according to the legacy method, that is, the total number of available resources on all RUs within a second repetition (the second repetition does not include resources spreading symbols).

[0379] Method 2: TBS determines the number of RUs within a single first repetition based on at least two of the following parameters: the total number of RUs within that repetition, and the scaling factor. The scaling factor can be configured / indicated by the eNB or determined by a protocol preset method. For example, the scaling factor can be 1 / OCC length, or equal to 1 / OCC multiplexed user number.

[0380] Example: The TBS is determined as follows: The first TBS is determined by looking up the total number of RUs in the first repetition. The second TBS is equal to the first TBS * scaling factor, and the second TBS is the target TBS.

[0381] The above solution proposes a method to increase the actual transmission code rate when the NB-IoT UE uses the OCC multiplexing mechanism to transmit NPUSCH format 1 in the IoT-NTN system for symbol-level OCC multiplexing of single-tone 3.75kHz SCS NPUSCH format 1 or slot-level multiplexing of single-tone 15kHz SCS NPUSCH format 1. This is to ensure link transmission performance, realize system expansion, and thus support more users to perform uplink transmission under the premise of limited time and frequency resources and limited terminal transmission power.

[0382] This disclosure also provides an apparatus for implementing any of the above methods. For example, an apparatus is provided that includes units or modules for implementing the steps performed by the terminal in any of the above methods. Alternatively, another apparatus is provided 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.

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

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

[0385] Figure 6A is a schematic diagram of the structure of a terminal according to an embodiment of this disclosure. As shown in Figure 6A, it includes:

[0386] The processing module is used to determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0387] The transceiver module is used to send the NPUSCH based on the first resource, wherein the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0388] Optionally, the transceiver module described above is used to perform the communication steps such as sending and / or receiving performed by the terminal in any of the above methods. The processing module described above is used to perform other steps performed by the terminal in any of the above methods.

[0389] Figure 6B is a schematic diagram of the structure of a network device according to an embodiment of this disclosure. As shown in Figure 6B, it includes:

[0390] The processing module is used to determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH).

[0391] The transceiver module is configured to receive the NPUSCH based on the first resource, wherein the receiving code rate of the NPUSCH on the first resource is less than the receiving code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

[0392] Optionally, the transceiver module described above can be used to perform the communication steps such as sending and / or receiving performed by the network device in any of the above methods. The processing module described above is used to perform other steps performed by the network device in any of the above methods.

[0393] Figure 7A is a schematic diagram of the structure of the communication device 7100 proposed in an embodiment of this disclosure. The communication device 7100 can be a network device (e.g., access network device, core network device, etc.), a terminal (e.g., user equipment or the aforementioned network device), 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 7100 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.

[0394] As shown in Figure 7A, the communication device 7100 includes one or more processors 7101. The processor 7101 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. The processor 7101 is used to invoke instructions to cause the communication device 7100 to execute any of the above methods.

[0395] In some embodiments, the communication device 7100 further includes one or more memories 7102 for storing instructions. Optionally, all or part of the memories 7102 may also be located outside the communication device 7100.

[0396] In some embodiments, the communication device 7100 further includes one or more transceivers 7103. When the communication device 7100 includes one or more transceivers 7103, the communication steps such as sending and receiving in the above method are performed by the transceivers 7103, and other steps are performed by the processor 7101.

[0397] In some embodiments, a transceiver may include a receiver and a transmitter, which may be separate or integrated. Optionally, the terms transceiver, transceiver unit, transceiver, transceiver circuit, etc., may be used interchangeably; the terms transmitter, transmitting unit, transmitter, transmitting circuit, etc., may be used interchangeably; and the terms receiver, receiving unit, sensing signal receiving end, receiving circuit, etc., may be used interchangeably.

[0398] Optionally, the communication device 7100 further includes one or more interface circuits 7104, which are connected to the memory 7102. The interface circuits 7104 can be used to receive signals from the memory 7102 or other devices, and can be used to send signals to the memory 7102 or other devices. For example, the interface circuits 7104 can read instructions stored in the memory 7102 and send the instructions to the processor 7101.

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

[0400] Figure 7B is a schematic diagram of the structure of the chip 7200 according to an embodiment of this disclosure. For cases where the communication device 7100 can be a chip or a chip system, the schematic diagram of the chip 7200 shown in Figure 7B can be referenced, but is not limited thereto.

[0401] Chip 7200 includes one or more processors 7201, which are used to invoke instructions to cause chip 7200 to perform any of the above methods.

[0402] In some embodiments, chip 7200 further includes one or more interface circuits 7202 connected to memory 7203. Interface circuits 7202 can be used to receive signals from memory 7203 or other devices, and can also be used to send signals to memory 7203 or other devices. For example, interface circuit 7202 can read instructions stored in memory 7203 and send those instructions to processor 7201. Optionally, terms such as interface circuit, interface, transceiver pin, and transceiver can be used interchangeably.

[0403] In some embodiments, chip 7200 further includes one or more memories 7203 for storing instructions. Optionally, all or part of the memories 7203 may be located outside of chip 7200.

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

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

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

[0407] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented in software, it can be implemented, in whole or in part, as a computer program product. The computer program product includes one or more computer programs. When the computer program is loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this disclosure are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer program can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program can be transferred from one website, computer, server, or data center to another via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium accessible to a computer or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., high-density digital video discs (DVDs)), or semiconductor media (e.g., solid-state disks (SSDs)).

[0408] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this disclosure.

[0409] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0410] The above description is merely a specific embodiment of this disclosure, but the scope of protection of this disclosure is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this disclosure should be included within the scope of protection of this disclosure. Therefore, the scope of protection of this disclosure should be determined by the scope of the claims.

Claims

1. A method for determining resources, characterized in that, The method, executed by a terminal, includes: A first resource is determined, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH). The NPUSCH is transmitted based on the first resource, wherein the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

2. The method as described in claim 1, characterized in that, The first resource satisfies at least one of the following: the transport block size (TBS) occupied by a single repeat transmission in the first resource is less than the TBS occupied by a single repeat transmission in the second resource; or the resource length of a single repeat transmission in the first resource is greater than the resource length of a single repeat transmission in the second resource.

3. The method as described in claim 1 or 2, characterized in that, The method further includes: The first TBS is determined to be equal to the product of the second TBS and the first value, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource, and the first value is in the range of (0, 1).

4. The method as described in claim 1 or 2, characterized in that, The method further includes: A first resource unit (RU) is determined, wherein the time domain length of the first RU is greater than the time domain length of one RU in the second resource; The first TBS and the second TBS are determined to be equal, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, and the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource. A first time domain length is determined, which is the time domain length occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is equal to the product of the time domain length of the first RU and a second value, where the second value is the number of RUs occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is greater than the time domain length occupied by the NPUSCH in one repeated transmission in the second resource.

5. The method as described in claim 1 or 2, characterized in that, The method further includes: A first repeat transmission resource is determined, which is the resource occupied by the NPUSCH in one repeat transmission in the first resource. The time domain length of the first repeat transmission resource is M times the time domain length of the second repeat transmission resource. The second repeat transmission resource is the resource occupied by the NPUSCH in one repeat transmission in the second resource, where M > 1.

6. The method according to any one of claims 1-5, characterized in that, The OCC multiplexing transmission of the NPUSCH includes at least one of the following: One sequence value of an OCC sequence is mapped to one or more symbols; One sequence value of an OCC sequence is mapped to one time slot or multiple consecutive time slots; One sequence value of an OCC sequence is mapped to multiple non-contiguous time slots, with an interval of L-1 time slots between adjacent time slots mapped to the same sequence value, where L is the sequence length of the OCC sequence.

7. The method as described in claim 5 or 6, characterized in that, The second time domain length is M times the third time domain length, wherein the second time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the first repeated transmission resource, and the second resource is also used for OCC multiplexing transmission of the NPUSCH, and the third time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the second repeated transmission resource.

8. The method as described in claim 6 or 7, characterized in that, The method further includes at least one of the following: The OCC sequence maps a sequence value to a symbol of the first resource, and encodes symbols that satisfy the first rule. The first rule includes: mod(H, L) = k, where the mod function is the modulo function, H is the symbol index, L is the sequence length of the OCC sequence, and k = 0, 1, ..., or L-1; The OCC sequence is mapped to multiple consecutive time slots of the first resource. Time slots that satisfy the second rule are encoded. The second rule includes: mod(F, L) = k, where F is the time slot index. The OCC sequence is mapped to multiple non-contiguous time slots of the first resource. The time slots mapped by the OCC sequence are sequentially divided into at least one time-domain window. The time-domain length of the time-domain window is L. The at least one time-domain window is sequentially indexed and numbered. The time slots in the time-domain window that satisfy the third rule are encoded. The third rule includes: mod(G, L) = k, where G is the index of the time-domain window.

9. The method as described in claim 8, characterized in that, The encoding of symbols that satisfy the first rule includes: Adjacent symbols that satisfy the first rule are encoded using a first method. The first method is used to make the end bit of the encoding bit corresponding to the first symbol adjacent to the start bit of the encoding bit corresponding to the second symbol. The first symbol and the second symbol are adjacent symbols that satisfy the first rule, and the time domain position of the first symbol is located before the time domain position of the second symbol. The encoding of time slots that satisfy the second rule includes: The adjacent time slots that satisfy the second rule are encoded using a second method. The second method is used to make the end bit of the encoded bit corresponding to the first time slot adjacent to the start bit of the encoded bit corresponding to the second time slot. The first time slot and the second time slot are adjacent time slots that satisfy the second rule. The time domain position of the first time slot is located before the time domain position of the second time slot. The encoding of time slots within a time-domain window that satisfies the third rule includes: The time slots in adjacent time-domain windows that satisfy the third rule are encoded using a third method. The third method is used to make the end bit of the encoded bit corresponding to the first time-domain window adjacent to the start bit of the encoded bit corresponding to the second time-domain window. The first time-domain window and the second time-domain window are adjacent time-domain windows that satisfy the third rule, and the time-domain position of the first time-domain window is located before the time-domain position of the second time-domain window.

10. The method according to any one of claims 5-9, characterized in that, The method further includes: A third TBS is determined, wherein the third TBS is the TBS corresponding to the encoded bits of the NPUSCH in one repeated transmission of the first resource, and the third TBS is less than the first TBS, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission of the first resource.

11. The method as described in claim 10, characterized in that, The determination of the third TBS includes at least one of the following: The third TBS is determined to be equal to the second TBS, where the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource; The third TBS is determined to be equal to the product of the first TBS and the first value, where the first value ranges from (0, 1).

12. The method as described in claim 3, 4, or 11, characterized in that, The method further includes at least one of the following: Receive the second TBS and / or the first value configured by the network device; The first value is determined based on the first calculation method; The second TBS is determined based on the second calculation method.

13. A method for determining resources, characterized in that, Performed by a network device, the method includes: A first resource is determined, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH). The NPUSCH is received based on the first resource, wherein the reception code rate of the NPUSCH on the first resource is less than the reception code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

14. The method as described in claim 13, characterized in that, The first resource satisfies at least one of the following: the transport block size (TBS) occupied by a single repeat transmission in the first resource is less than the TBS occupied by a single repeat transmission in the second resource; or the resource length of a single repeat transmission in the first resource is greater than the resource length of a single repeat transmission in the second resource.

15. The method as described in claim 13 or 14, characterized in that, The method further includes: The first TBS is determined to be equal to the product of the second TBS and the first value, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource, and the first value is in the range of (0, 1).

16. The method as described in claim 13 or 14, characterized in that, The method further includes: A first resource unit (RU) is determined, wherein the time domain length of the first RU is greater than the time domain length of one RU in the second resource; The first TBS and the second TBS are determined to be equal, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission in the first resource, and the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource. A first time domain length is determined, which is the time domain length occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is equal to the product of the time domain length of the first RU and a second value, where the second value is the number of RUs occupied by the NPUSCH in one repeated transmission in the first resource. The first time domain length is greater than the time domain length occupied by the NPUSCH in one repeated transmission in the second resource.

17. The method as described in claim 13 or 14, characterized in that, The method further includes: A first repeat transmission resource is determined, which is the resource occupied by the NPUSCH in one repeat transmission in the first resource. The time domain length of the first repeat transmission resource is M times the time domain length of the second repeat transmission resource. The second repeat transmission resource is the resource occupied by the NPUSCH in one repeat transmission in the second resource, where M > 1.

18. The method according to any one of claims 13-17, characterized in that, The OCC multiplexing transmission of the NPUSCH includes at least one of the following: One sequence value of an OCC sequence is mapped to one or more symbols; One sequence value of an OCC sequence is mapped to one time slot or multiple consecutive time slots; One sequence value of an OCC sequence is mapped to multiple non-contiguous time slots, with an interval of L-1 time slots between adjacent time slots mapped to the same sequence value, where L is the sequence length of the OCC sequence.

19. The method as described in claim 17 or 18, characterized in that, The second time domain length is M times the third time domain length, wherein the second time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the first repeated transmission resource, and the second resource is also used for OCC multiplexing transmission of the NPUSCH, and the third time domain length is: the time domain length of a sequence value of the OCC sequence mapped in the second repeated transmission resource.

20. The method as described in claim 18 or 19, characterized in that, The method further includes at least one of the following: The OCC sequence is mapped to a symbol of the first resource. Symbols that satisfy the first rule are decoded. The first rule includes: mod(H, L) = k, where the mod function is the modulo function, H is the symbol index, L is the sequence length of the OCC sequence, and k = 0, 1, ..., or L-1. The OCC sequence is mapped to multiple consecutive time slots of the first resource. Time slots that satisfy the second rule are decoded. The second rule includes: mod(F, L) = k, where F is the time slot index. The OCC sequence is mapped to multiple non-contiguous time slots of the first resource. The time slots mapped by the OCC sequence are sequentially divided into at least one time-domain window, and the time-domain length of the time-domain window is L. The at least one time-domain window is sequentially indexed and numbered. The time slots in the time-domain window that satisfy the third rule are decoded. The third rule includes: mod(G, L) = k, where G is the index of the time-domain window.

21. The method as described in claim 20, characterized in that, Decoding symbols that satisfy the first rule includes: The adjacent symbols that satisfy the first rule are decoded using a fourth method. The fourth method is used to make the end bit of the decoded bit corresponding to the first symbol adjacent to the start bit of the decoded bit corresponding to the second symbol. The first symbol and the second symbol are adjacent symbols that satisfy the first rule, and the time domain position of the first symbol is located before the time domain position of the second symbol. Decoding the time slots that satisfy the second rule includes: The adjacent time slots that satisfy the second rule are decoded using a fifth method. The fifth method is used to make the end bit of the decoded bit corresponding to the first time slot adjacent to the start bit of the decoded bit corresponding to the second time slot. The first time slot and the second time slot are adjacent time slots that satisfy the second rule, and the time domain position of the first time slot is located before the time domain position of the second time slot. Decoding the time slots in the time-domain window that satisfy the third rule includes: The time slots in adjacent time-domain windows that satisfy the third rule are decoded using a sixth method. The sixth method is used to make the end bit of the decoded bit corresponding to the first time-domain window adjacent to the start bit of the decoded bit corresponding to the second time-domain window. The first time-domain window and the second time-domain window are adjacent time-domain windows that satisfy the third rule, and the time-domain position of the first time-domain window is located before the time-domain position of the second time-domain window.

22. The method according to any one of claims 17-21, characterized in that, The method further includes: A third TBS is determined, wherein the third TBS is the TBS corresponding to the encoded bits of the NPUSCH in one repeated transmission of the first resource, and the third TBS is less than the first TBS, wherein the first TBS is the TBS occupied by the NPUSCH in one repeated transmission of the first resource.

23. The method as described in claim 22, characterized in that, The determination of the third TBS includes at least one of the following: The third TBS is determined to be equal to the second TBS, where the second TBS is the TBS occupied by the NPUSCH in one repeated transmission in the second resource; The third TBS is determined to be equal to the product of the first TBS and the first value, where the first value ranges from (0, 1).

24. The method as described in claim 15, 16, or 23, characterized in that, The method further includes: Configure the second TBS and / or the first value to the terminal.

25. A resource determination method for a communication system, the communication system including a terminal and network equipment, the method comprising: The terminal and / or the network device determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH). The terminal sends the NPUSCH based on the first resource, and the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource. The second resource is used for non-OCC multiplexing transmission of the NPUSCH. The network device receives the NPUSCH based on the first resource, wherein the reception code rate of the NPUSCH on the first resource is less than the reception code rate of the NPUSCH on the second resource.

26. A terminal, characterized in that, include: The processing module is used to determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH). The transceiver module is used to transmit the NPUSCH based on the first resource, wherein the transmission code rate of the NPUSCH on the first resource is less than the transmission code rate of the NPUSCH on the second resource, and the second resource is used for non-OCC multiplexing transmission of the NPUSCH.

27. A network device, characterized in that, include: The processing module is used to determine a first resource, which is used for orthogonal coverage code (OCC) multiplexing transmission of the narrowband physical uplink shared channel (NPUSCH). The transceiver module is configured to receive the NPUSCH based on the first resource, wherein the receive code rate of the NPUSCH on the first resource is less than the receive code rate of the NPUSCH on a second resource, and the second resource is used for non-OCC processing of the NPUSCH. Reuse transmission.

28. A communication device, characterized in that, The communication device is used to perform the method according to any one of claims 1-12, 13-24.

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

30. A storage medium storing instructions, characterized in that, When the instructions are executed on the communication device, the communication device performs the method as described in any one of claims 1-12, 13-24.

31. 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 method according to any one of claims 1-12 and 13-24.