Communication method and communication apparatus

Abstract

Provided are a communication method and a communication apparatus. The communication method comprises: acquiring a target orthogonal cover code, the target orthogonal cover code being obtained on the basis of a disabled orthogonal cover code; and sending data on the basis of the target orthogonal cover code, wherein if all elements corresponding to the disabled orthogonal cover code are 1, the target orthogonal cover code is the same as the disabled orthogonal cover code and the target orthogonal cover code does not vary with the transmission time of the data; or if the elements corresponding to the disabled orthogonal cover code are not all 1, the target orthogonal cover code varies with the transmission time of the data and elements corresponding to the target orthogonal cover code are not all 1. The communication method can reduce interference between terminals.

Description

Communication methods and communication devices

[0001] This application claims priority to Chinese Patent Application No. 202411369539.4, filed on September 27, 2024, entitled "Communication Method and Communication Device", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communications, and more particularly to a communication method and a communication device. Background Technology

[0003] To ensure correct data demodulation, the terminal can repeat the Physical Uplink Shared Channel (PUSCH) a large number of times. However, when the terminal repeats the PUSCH, the increased number of repetitions leads to low resource utilization, which in turn reduces capacity.

[0004] To improve system capacity, one approach is to reuse the PUSCH of multiple terminals on the same resource based on orthogonal cover code (OCC).

[0005] However, increasing system capacity in the above way may cause interference to other terminals. Summary of the Invention

[0006] This application provides a communication method and a communication device to reduce interference with other terminals.

[0007] In a first aspect, this application provides a communication method, which can be executed by a terminal, or by a component configured in the terminal (such as a chip, chip system, etc.), or by a logic module or software capable of implementing all or part of the terminal functions, and this application does not limit it.

[0008] The communication method includes: obtaining a target orthogonal coverage code, which is obtained based on a disabled orthogonal coverage code; and sending data according to the target orthogonal coverage code. Specifically, if all elements corresponding to the disabled orthogonal coverage code are 1, the target orthogonal coverage code is the same as the disabled orthogonal coverage code and the target orthogonal coverage code does not change according to the time of data transmission; or, if the elements corresponding to the disabled orthogonal coverage code are not all 1, the target orthogonal coverage code changes according to the time of data transmission and the elements corresponding to the target orthogonal coverage code are not all 1.

[0009] Through the above technical solution, since the target orthogonal coverage code is the same as the deenabled orthogonal coverage code when all elements corresponding to the deenabled orthogonal coverage code are 1, and the target orthogonal coverage code does not change according to the time of data transmission; while when the elements corresponding to the deenabled orthogonal coverage code are not all 1, the target orthogonal coverage code changes according to the time of data transmission and the elements corresponding to the target orthogonal coverage code are not all 1, the number of terminals using the same orthogonal coverage code with all corresponding elements being 1 in the communication system can be reduced, thereby reducing interference between terminals.

[0010] For example, if the elements corresponding to the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0011] Where m0 represents the index of the deenabled orthogonal covering code. Indicates based on And the value determined by l, This represents the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represents the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, N is the length of the disabled orthogonal coverage code, and m represents the index of the target orthogonal coverage code. Associated with community identifiers or scrambling identifiers.

[0012] For example, the target orthogonal covering code and the disabled orthogonal covering code satisfy the following relationship:

[0013] in, Indicates based on And the value determined by l, This indicates the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, and l indicates the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code. This represents the number of positive integers less than N that are relatively prime to N. express The nth number that is coprime to N The number of orthogonal covering codes is given, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0014] For example, if the elements of the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0015] in, Indicates based on And the value determined by l, Let represent the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represent the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, and A represent the (N-1)! × (N-1) dimensional permutation matrix. Indicates the first in A The element in row m0, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0016] For example, when μ equals 1,

[0017] For example, The following relationship must be satisfied:

[0018] [Corrected according to Rule 91, 09.05.2026] c(·) represents the number of symbols contained in a time slot, c(·) represents the Gold sequence, c(·) is associated with the cell identifier or scrambling identifier, and i ranges from 0 to I-1, where I is a positive integer.

[0019] For example, It equals 14.

[0020] Optional, I can be 8.

[0021] The granularity of obtaining the target orthogonal covering code can be implemented in different ways.

[0022] For example, the type of the deenabled orthogonal coverage code is an inter-slot orthogonal coverage code; obtaining the target orthogonal coverage code includes: obtaining the target orthogonal coverage code with a granularity of K1·N time slots, where K1 is a positive integer greater than or equal to 1.

[0023] For example, the type of the deenabled orthogonal coverage code is an inter-symbol orthogonal coverage code; obtaining the target orthogonal coverage code includes: obtaining the target orthogonal coverage code with a granularity of K2·B·N symbols, where K2 is a positive integer greater than or equal to 1, and B is the number of symbols contained in the transport block.

[0024] For example, the type of the deenabled orthogonal covering code is the orthogonal covering code before the symbolic discrete Fourier transform extension; obtaining the target orthogonal covering code includes: obtaining the target orthogonal covering code with a granularity of K3 OFDM symbols, where K3 is a positive integer greater than or equal to 1.

[0025] [Corrected according to Rule 91, 09.05.2026] Optionally, the method further includes: receiving first information, the first information being used to indicate a deactivated orthogonal overlay code. For example, the first information includes an index of the deactivated orthogonal overlay code.

[0026] Secondly, this application provides a communication method, which can be executed by a network device, or by a component (such as a chip, chip system, etc.) configured in the network device, or by a logic module or software capable of realizing all or part of the terminal functions. This application does not limit the method in this regard.

[0027] The communication method includes: sending first information, the first information being used to indicate a de-enabled orthogonal coverage code; receiving data based on a target orthogonal coverage code, the target orthogonal coverage code being obtained based on the de-enabled orthogonal coverage code; wherein, if all elements corresponding to the de-enabled orthogonal coverage code are 1, the target orthogonal coverage code is the same as the de-enabled orthogonal coverage code and the target orthogonal coverage code does not change according to the time of data transmission; or, if the elements corresponding to the de-enabled orthogonal coverage code are not all 1, the target orthogonal coverage code changes according to the time of data transmission and the elements corresponding to the target orthogonal coverage code are not all 1.

[0028] Through the above technical solution, since the target orthogonal coverage code is the same as the deenabled orthogonal coverage code when all elements corresponding to the deenabled orthogonal coverage code are 1, and the target orthogonal coverage code does not change according to the time of data transmission; while when the elements corresponding to the deenabled orthogonal coverage code are not all 1, the target orthogonal coverage code changes according to the time of data transmission and the elements corresponding to the target orthogonal coverage code are not all 1, the number of terminals using the same orthogonal coverage code with all corresponding elements being 1 in the communication system can be reduced, thereby reducing interference between terminals.

[0029] In conjunction with the second aspect, in one possible implementation, if the elements corresponding to the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0030] Where m0 represents the index of the deenabled orthogonal covering code. Indicates based on And the value determined by l, This represents the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represents the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, N is the length of the disabled orthogonal coverage code, and m represents the index of the target orthogonal coverage code. Associated with community identifiers or scrambling identifiers.

[0031] In conjunction with the second aspect, in one possible implementation, the target orthogonal covering code and the disabled orthogonal covering code satisfy the following relationship:

[0032] in, Indicates based on And the value determined by l, This indicates the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, and l indicates the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code. This represents the number of positive integers less than N that are relatively prime to N. express The nth number that is coprime to N The number of orthogonal covering codes is given, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0033] In conjunction with the second aspect, in one possible implementation, if the elements included in the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0034] in, Indicates based on And the value determined by l, Let represent the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represent the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, and A represent the (N-1)! × (N-1) dimensional permutation matrix. Indicates the first in A The element in row m0, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0035] In conjunction with the second aspect, in one possible implementation, The following relationship must be satisfied:

[0036] [Corrected according to Rule 91, 09.05.2026] c(·) represents the number of symbols contained in a time slot, c(·) represents the Gold sequence, c(·) is associated with the cell identifier or scrambling identifier, and i ranges from 0 to I-1, where I is a positive integer.

[0037] In conjunction with the second aspect, in one possible implementation, I is set to 8.

[0038] [Corrected according to Rule 91 09.05.2026] In conjunction with the second aspect, in one possible implementation, the type of the deenabled orthogonal covering code is an inter-slot orthogonal covering code; the method further includes: sending a second message, the second message being used to indicate that the target orthogonal covering code varies in granularity of K1·N time slots, where K1 is a positive integer greater than or equal to 1.

[0039] [Corrected according to Rule 91 09.05.2026] In conjunction with the second aspect, in one possible implementation, the type of the deenabled orthogonal overlay code is an inter-symbol orthogonal overlay code; the method further includes: sending third information, the third information being used to indicate that the target orthogonal overlay code varies in granularity of K2·B·N symbols, where K2 is a positive integer greater than or equal to 1, and B is the number of symbols contained in the transport block.

[0040] [Corrected according to Rule 91 09.05.2026] In conjunction with the second aspect, in one possible implementation, the type of the deenabled orthogonal covering code is an intra-symbol discrete Fourier transform pre-expansion orthogonal covering code; the method further includes: sending a fourth message, the fourth message being used to indicate that the target orthogonal covering code is varied in granularity of K3 symbols, where K3 is a positive integer greater than or equal to 1.

[0041] Thirdly, this application provides a communication device, comprising: a processing module for acquiring a target orthogonal coverage code, the target orthogonal coverage code being obtained based on a disabled orthogonal coverage code; and a transceiver module for transmitting data according to the target orthogonal coverage code; wherein, if all elements corresponding to the disabled orthogonal coverage code are 1, the target orthogonal coverage code is the same as the disabled orthogonal coverage code and the target orthogonal coverage code does not change according to the time of data transmission; or, if the elements corresponding to the disabled orthogonal coverage code are not all 1, the target orthogonal coverage code changes according to the time of data transmission and the elements corresponding to the target orthogonal coverage code are not all 1.

[0042] In conjunction with the third aspect, in one possible implementation, if the elements corresponding to the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0043] Where m0 represents the index of the deenabled orthogonal covering code. Indicates based on And the value determined by l, This represents the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represents the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, N is the length of the disabled orthogonal coverage code, and m represents the index of the target orthogonal coverage code. Associated with community identifiers or scrambling identifiers.

[0044] In conjunction with the third aspect, in one possible implementation, the target orthogonal covering code and the disabled orthogonal covering code satisfy the following relationship:

[0045] in, Indicates based on And the value determined by l, This indicates the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, and l indicates the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code. This represents the number of positive integers less than N that are relatively prime to N. express The nth number that is coprime to N The number of orthogonal covering codes is given, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0046] In conjunction with the third aspect, in one possible implementation, if the elements of the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0047] [Corrected according to detailed rule 91, 09.05.2026] Among them, Indicates based on And the value determined by l, Let represent the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represent the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, and A represent the (N-1)! × (N-1) dimensional permutation matrix. Indicates the first in A The element in row m0, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0048] In conjunction with the third aspect, in one possible implementation, The following relationship must be satisfied:

[0049] [Corrected according to Rule 91, 09.05.2026] c(·) represents the number of symbols contained in a time slot, c(·) represents the Gold sequence, c(·) is associated with the cell identifier or scrambling identifier, and i ranges from 0 to I-1, where I is a positive integer.

[0050] In conjunction with the third aspect, in one possible implementation, I is set to 8.

[0051] In conjunction with the third aspect, in one possible implementation, the type of the deenabled orthogonal coverage code is an inter-slot orthogonal coverage code; the processing module is also used to: obtain the target orthogonal coverage code with a granularity of K1·N time slots, where K1 is a positive integer greater than or equal to 1.

[0052] In conjunction with the third aspect, in one possible implementation, the type of the deenabled orthogonal coverage code is an inter-symbol orthogonal coverage code; the processing module is also used to: obtain the target orthogonal coverage code with a granularity of K2·B·N symbols, where K2 is a positive integer greater than or equal to 1, and B is the number of symbols contained in the transport block.

[0053] In conjunction with the third aspect, in one possible implementation, the type of the deenabled orthogonal covering code is an intra-symbol discrete Fourier transform pre-expansion orthogonal covering code; the processing module is also used to: obtain the target orthogonal covering code with a granularity of K3 symbols, where K3 is a positive integer greater than or equal to 1.

[0054] In conjunction with the third aspect, in one possible implementation, the transceiver module is also used to: receive first information, which is used to indicate an orthogonal overlay code to be enabled.

[0055] In conjunction with the third aspect, in one possible implementation, the first information includes an index of the deenabled orthogonal covering code.

[0056] Fourthly, this application provides a communication device, comprising: a transceiver module configured to transmit first information, the first information being used to indicate a de-enabled orthogonal coverage code; the transceiver module further configured to: receive data based on a target orthogonal coverage code, the target orthogonal coverage code being obtained based on the de-enabled orthogonal coverage code; wherein, if all elements corresponding to the de-enabled orthogonal coverage code are 1, the target orthogonal coverage code is the same as the de-enabled orthogonal coverage code and the target orthogonal coverage code does not change according to the time of data transmission; or, if the elements corresponding to the de-enabled orthogonal coverage code are not all 1, the target orthogonal coverage code changes according to the time of data transmission and the elements corresponding to the target orthogonal coverage code are not all 1.

[0057] In conjunction with the fourth aspect, in one possible implementation, if the elements corresponding to the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0058] Where m0 represents the index of the deenabled orthogonal covering code. Indicates based on And the value determined by l, This represents the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represents the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, N is the length of the disabled orthogonal coverage code, and m represents the index of the target orthogonal coverage code. Associated with community identifiers or scrambling identifiers.

[0059] In conjunction with the fourth aspect, in one possible implementation, the target orthogonal covering code and the disabled orthogonal covering code satisfy the following relationship:

[0060] in, Indicates based on And the value determined by l, This indicates the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, and l indicates the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code. This represents the number of positive integers less than N that are relatively prime to N. express The nth number that is coprime to N The number of orthogonal covering codes is given, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0061] In conjunction with the fourth aspect, in one possible implementation, if the elements included in the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0062] in, Indicates based on And the value determined by l, Let represent the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represent the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, and A represent the (N-1)! × (N-1) dimensional permutation matrix. Indicates the first in A The element in row m0, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0063] In conjunction with the fourth aspect, in one possible implementation, The following relationship must be satisfied:

[0064] [Corrected according to Rule 91, 09.05.2026] c(·) represents the number of symbols contained in a time slot, c(·) represents the Gold sequence, c(·) is associated with the cell identifier or scrambling identifier, and i ranges from 0 to I-1, where I is a positive integer.

[0065] In conjunction with the fourth aspect, in one possible implementation, I is set to 8.

[0066] In conjunction with the fourth aspect, in one possible implementation, the type of the deenabled orthogonal coverage code is an inter-slot orthogonal coverage code; the transceiver module is also used to: send second information, which is used to indicate that the target orthogonal coverage code varies in granularity of K1·N time slots, where K1 is a positive integer greater than or equal to 1.

[0067] In conjunction with the fourth aspect, in one possible implementation, the type of the deenabled orthogonal overlay code is an inter-symbol orthogonal overlay code; the transceiver module is also used to: send third information, which is used to indicate that the target orthogonal overlay code varies in granularity of K2·B·N symbols, where K2 is a positive integer greater than or equal to 1 and B is the number of symbols contained in the transport block.

[0068] [Corrected according to Rule 91 09.05.2026] In conjunction with the fourth aspect, in one possible implementation, the type of the deenabled orthogonal covering code is an intra-symbol discrete Fourier transform pre-expansion orthogonal covering code; the transceiver module is also used to: send fourth information, which is used to indicate that the target orthogonal covering code is varied in granularity of K3 symbols, where K3 is a positive integer greater than or equal to 1.

[0069] Fifthly, an apparatus is provided, comprising a processor and a storage medium storing instructions that, when executed by the processor, cause a method as described in the first aspect or any possible implementation thereof to be implemented, or cause a method as described in the second aspect or any possible implementation thereof to be implemented.

[0070] [Correction 09.05.2026 according to Article 91] In a sixth aspect, an apparatus is provided, including a processing circuit for processing data and / or information such that a method as in the first aspect or any possible implementation thereof is implemented, or a method as in the second aspect or any possible implementation thereof is implemented.

[0071] The processing circuit may include one or more processors, or all or part of the circuitry in one or more processors used for control or processing functions.

[0072] [Correction 09.05.2026 according to Rule 91] Optionally, the apparatus may further include a memory for storing a program or instructions, and the processor for running the program or instructions to cause the method as in the first aspect or any possible implementation of the first aspect to be implemented, or to cause the method as in the second aspect or any possible implementation of the second aspect to be implemented.

[0073] [Correction 09.05.2026 according to Rule 91] Optionally, the device may also include the transceiver circuit, or an input / output interface.

[0074] [Correction 09.05.2026 based on Rule 91] In a seventh aspect, a chip is provided, including processing circuitry for running a program or instructions to cause the method as in the first aspect or any possible implementation thereof to be implemented, or to cause the method as in the second aspect or any possible implementation thereof to be implemented.

[0075] [Correction 09.05.2026 according to Rule 91] Optionally, the chip may also include a memory for storing programs or instructions.

[0076] [Correction 09.05.2026 according to Rule 91] Optionally, the chip may also include transceiver circuitry, or input / output interfaces.

[0077] [Correction 09.05.2026 based on Rule 91] In an eighth aspect, a computer-readable storage medium is provided, the computer-readable storage medium including instructions that, when executed by a processor, cause a method as in the first aspect or any possible implementation of the first aspect to be implemented, or cause a method as in the second aspect or any possible implementation of the second aspect to be implemented.

[0078] [Corrected according to Article 91 09.05.2026] Ninth aspect, a computer program product is provided, the computer program product including computer program code or instructions, which, when executed, cause the method as in the first aspect and any possible implementation of the first aspect to be implemented, or cause the method as in the second aspect or any possible implementation of the second aspect to be implemented.

[0079] In a tenth aspect, a communication system is provided, the communication system including means for performing the first or second aspect and any possible implementation thereof. Attached Figure Description

[0080] Figure 1 is a schematic diagram of the scenarios in which the technical solution of this application can be applied;

[0081] Figure 2 shows a schematic diagram of data transmission;

[0082] Figure 3 shows a schematic diagram of the OCC processing procedure between time slots;

[0083] Figure 4 shows a schematic diagram of inter-slot OCC processing when an OCC of length 2 is used.

[0084] Figure 5 shows a schematic diagram of the OCC processing procedure between symbols;

[0085] Figure 6 shows a schematic diagram of inter-symbol OCC processing when an OCC of length 2 is used.

[0086] Figure 7 shows a schematic diagram of the OCC processing procedure within the symbol;

[0087] Figure 8 is a flowchart illustrating a communication method provided in one embodiment of this application;

[0088] Figures 9, 10, 12, and 14 provide illustrative schematic diagrams of several frequency hopping patterns.

[0089] Figures 11, 13, and 15 provide exemplary schematic diagrams of the target OCC used by adjacent cells at different times.

[0090] Figure 16 is a schematic diagram of a communication device provided in an embodiment of this application;

[0091] Figure 17 is a schematic diagram of a communication device provided in another embodiment of this application. Detailed Implementation

[0092] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the embodiments of this application will be further described in detail below with reference to the accompanying drawings.

[0093] Before introducing the communication method and related apparatus provided in the embodiments of this application, the following points should be noted:

[0094] First, the use of prefixes such as "first" and "second" in this application is solely for the purpose of distinguishing and describing different things belonging to the same category, and does not constrain the order, size, or quantity of things. For example, "first information" and "second information" are simply different pieces of information, and there is no temporal sequence, size, or priority relationship between them.

[0095] Second, in this application, "send" and "receive" indicate the direction of signal transmission. For example, "send first information to the terminal" can be understood as the destination of the first information being the terminal, which may include direct transmission via the air interface or indirect transmission via the air interface by other units or modules. "Receive first information from the network device" can be understood as the source of the first information being the network device, which may include direct reception from the network device via the air interface or indirect reception from the network device via the air interface by other units or modules. "Send" can also be understood as the "output" of the chip interface, and "receive" can also be understood as the "input" of the chip interface.

[0096] In other words, sending and receiving can occur between devices, such as between network devices and terminal devices; or they can occur within a device, such as between components, modules, chips, software modules, or hardware modules within a device via a bus, wiring, or interface.

[0097] Third, in this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates an "or" relationship between the preceding and following related objects, but it does not exclude the possibility of indicating an "and" relationship; the specific meaning can be understood in context. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can mean: a, b, c; a and b; a and c; b and c; or a and b and c. Here, a, b, and c can be single or multiple.

[0098] Fourth, in this application, the indication includes direct indication (also known as explicit indication) and indirect indication (also known as implicit indication). Direct indication information A refers to information A; indirect indication information A can refer to indicating information A through the correspondence between information A and information B and direct indication information B; or it can refer to indicating information A through a preset rule that can be used to determine A based on B and direct indication information B. The correspondence between information A and information B, and the preset rule, can be predefined, pre-stored, pre-burned, or pre-configured.

[0099] Fifth, in the embodiments of this application, "when," "if," and "if" all refer to the device making corresponding processing under certain objective circumstances, and are not limited to a time, nor do they require the device to make a judgment action when it is implemented, nor do they mean that there are other limitations.

[0100] Sixth, for ease of understanding, the method provided in this application is described in terms of multiple accompanying drawings. These drawings are merely examples and should not be construed as limiting the application in any way. For example, the order of steps shown in the drawings may be modified according to their functions and internal logic; or, for example, all steps in the drawings may be performed, or only a portion of them may be performed, as long as the same function as in the embodiments of this application can be achieved.

[0101] Seventh, in this application, the words "example," "exemplarily," "for example," or "such as" are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "example," "exemplarily," "for example," or "such as" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of the words "example," "exemplarily," "for example," or "such as" is intended to present the relevant concepts in a specific manner.

[0102] Figure 1 is a schematic diagram of the architecture of a communication system 10 provided in an embodiment of this application. It is understood that the system architecture described in this application embodiment is for the purpose of more clearly illustrating the technical solutions of this application embodiment and does not constitute a limitation on the technical solutions provided in this application embodiment.

[0103] As shown in Figure 1, the communication system 10 includes a radio access network (RAN) 100 and a core network (CN) 200. RAN 100 includes at least one RAN node (110a and 110b in Figure 1, collectively referred to as 110) and at least one terminal (120a-120j in Figure 1, collectively referred to as 120). RAN 100 may also include other RAN nodes, such as wireless relay equipment and / or wireless backhaul equipment (not shown in Figure 1). Terminal 120 is wirelessly connected to RAN node 110. RAN node 110 is wirelessly or wired connected to core network 200. The core network equipment in core network 200 and RAN node 110 in RAN 100 can be different physical devices, or they can be the same physical device integrating core network logical functions and radio access network logical functions.

[0104] RAN 100 can be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as 4G, 5G mobile communication systems, or future-oriented evolution systems. RAN 100 can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. RAN 100 can also be a communication system that integrates two or more of the above systems.

[0105] RAN node 110, sometimes also referred to as access network equipment, RAN entity, or access node, constitutes part of the communication system and is used to help terminals achieve wireless access. Multiple RAN nodes 110 in communication system 10 can be of the same type or different types. In some scenarios, the roles of RAN node 110 and terminal 120 are relative. For example, network element 120i in Figure 1 can be a helicopter or drone, which can be configured as a mobile base station. For terminals 120j accessing RAN 100 through network element 120i, network element 120i is a base station; but for base station 110a, network element 120i is a terminal. RAN node 110 and terminal 120 are sometimes both referred to as communication devices. For example, network elements 110a and 110b in Figure 1 can be understood as communication devices with base station functions, and network elements 120a-120j can be understood as communication devices with terminal functions.

[0106] In one possible scenario, the RAN node can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next-generation NodeB (gNB), a base station in a future mobile communication system, or an access node in a WiFi system. The RAN node can be a macro base station (as shown in Figure 1, 110a), a micro base station or indoor station (as shown in Figure 1, 110b), a relay node or donor node, or a radio controller in a CRAN scenario. Optionally, the RAN node can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, the access network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). All or part of the functions of the RAN node in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (e.g., a cloud platform). The RAN node can also be equipped with communication modules, circuits, or chips that perform corresponding communication functions. The RAN node can also be configured with program instructions for performing corresponding communication functions, as well as corresponding program instructions. The RAN node in this application can also be a logical node, logical module, or software capable of implementing all or part of the RAN node's functions.

[0107] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, with each RAN node performing a portion of the base station's functions. For example, RAN nodes can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs), etc. CUs and DUs can be separate entities or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio frequency equipment or radio frequency units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0108] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.

[0109] A terminal can be a device or module that accesses the aforementioned communication system and has corresponding communication functions. A terminal can also be called a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, etc. Terminals can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, transportation vehicles with wireless communication capabilities, communication modules, etc. The embodiments of this application do not limit the device form of the terminal. A terminal typically contains a communication module, circuit, or chip that performs the corresponding communication function. The terminal can also be configured with program instructions for performing the corresponding communication function.

[0110] For example, Figure 2 illustrates the architecture of an access network device. The access network device can be segmented according to a protocol stack. For instance, in one segmentation method, the protocol stack of the access network device may include a physical (PHY) layer and a media access control (MAC) layer. Optionally, the protocol stack of the access network device may also include a radio link control (RLC) layer, a packet data convergence protocol (PDCP) layer, a service data adaptation protocol (SDAP) layer, and a radio resource control (RRC) layer, etc. Each protocol layer may further include one or more functional modules for signal processing.

[0111] Taking the PHY layer function as an example, as shown in Figure 2, during downlink transmission, the access network device includes one or more of the following functions: coding, rate matching, scrambling, modulation, layer mapping, precoding, resource element (RE) mapping, digital beamforming (BF), and inverse fast Fourier transformation (IFFT) / adding a cyclic prefix (CP). During uplink transmission, the access network device includes one or more of the following functions: decoding, rate matching dematching, descrambling, demodulation, inverse discrete Fourier transformation (IDFT), channel equalization (or channel estimation), RE demapping, digital BF, and fast Fourier transform (FFT) / CP removal.

[0112] As shown in Figure 2, the access network equipment also includes a radio frequency module. When performing downlink transmission, the access network equipment includes one or more of the following functions: digital to analog (DA) conversion and analog BF; when performing uplink transmission, analog to digital (AD) conversion or analog BF.

[0113] Currently, in some communication scenarios, such as non-terrestrial networks (NTNs), the link budget of terminals is poor. Therefore, to ensure correct data demodulation, one approach is to repeat the uplink data sent by the terminal device. However, increasing the number of repetitions leads to a decrease in system resource utilization, which in turn reduces system capacity.

[0114] To improve system capacity, an implementation method based on mutually orthogonal OCC is proposed to multiplex data from multiple terminals onto the same time-frequency resources.

[0115] For example, let the length of the OCC be L. Assume that the data to be transmitted by UE1 is s1 and the data to be transmitted by UE2 is s2. UE1 uses OCC1 as {a1,…,aL} and UE2 uses OCC2 as {b1,…,bL}. OCC1 and OCC2 are orthogonal to each other. UE1 obtains {a1*s1,…,aL*s1} based on OCC1 and transmits it on time-frequency resource 1. UE2 obtains {b1*s2,…,bL*s2} based on OCC2 and transmits it on time-frequency resource 1. It can be understood that {a1*s1,…,aL*s1} can be understood as spreading s1. Similarly, {b1*s2,…,bL*s2} can be understood as spreading s2. Correspondingly, for the receiving end, since OCC1 and OCC2 are orthogonal to each other, the receiving end can obtain the data sent by UE1 on time and frequency resource 1 based on OCC1, and obtain the data sent by UE2 on time and frequency resource 1 based on OCC2.

[0116] As an example, OCC can be obtained based on the Walsh-Hadamard transform matrix, or it can be obtained based on the discrete Fourier transformation (DFT) matrix, or it can be obtained based on the Zadoff-Chu matrix.

[0117] For example, a 2x2 Walsh-Hadamard matrix is ​​denoted as H2.

[0118] For example, a 4x4 Walsh-Hadamard matrix is ​​denoted as H4.

[0119] For example, an 8x8 Walsh-Hadamard matrix is ​​denoted as H8.

[0120] For example, a 2x2 DFT matrix is ​​denoted as F2.

[0121] For example, a 4x4 DFT matrix is ​​denoted as F4.

[0122] For example, an 8x8 DFT matrix is ​​denoted as F8.

[0123] For example, a 3x3 DFT matrix is ​​denoted as Z3.

[0124] For example, a 6x6 Zadoff-Chu matrix is ​​denoted as Z6.

[0125] Understandably, in the matrix of the example above, each row represents a sequence, and any two rows are orthogonal to each other (i.e., the inner product of any two rows is 0).

[0126] Additionally, it is understandable that OCC can also be obtained from the matrix obtained by swapping any two rows and / or two columns in the matrix above.

[0127] In this application, OCC can also be referred to as an orthogonal sequence.

[0128] The above describes several ways to obtain OCC. Below, we will introduce three implementation methods for processing based on OCC.

[0129] Implementation Method 1: Inter-slot OCC

[0130] Using time slots as the granularity, the data obtained after transform precoding of the modulation symbol corresponding to a time slot is processed based on OCC.

[0131] For example, the data obtained after transform precoding of the modulation symbol corresponding to a time slot is denoted as y(x), and the data after OCC processing is denoted as z(x), as shown in Figure 3. The modulation symbols obtained after encoding, scrambling, and modulation are {x0, x1, ...}. After DFT, {x0, x1, ...} is obtained as {y0, y1, ...}. At this time, the data obtained after DFT of the modulation symbol corresponding to each time slot can be processed based on inter-time slot OCC to obtain {z0, z1, ...}, with the modulation symbol corresponding to each time slot as the granularity.

[0132] For example, z(x) and y(x) satisfy the following formula (I):

[0133] in, This represents the number of resource blocks (RBs) allocated for the physical uplink shared channel (PUSCH). This indicates the number of subcarriers in each RB. w represents the number of symbols contained in each slot of a PUSCH. i Indicates OCC, This represents the length of the OCC, which can be understood as the number of elements included in the OCC.

[0134] The symbols contained in each of the above time slots are, for example, discrete fourier transform-spread-OFDM (DFT-s-OFDM) symbols.

[0135] For example, Figure 4 shows a schematic diagram of the data obtained after processing by the OCC between time slots. As shown in Figure 4, the length of the OCC is 2, and the OCC includes w0 and w1. The terminal multiplies the data obtained after transforming and precoding the modulation symbol corresponding to a time slot with w0 and w1 respectively.

[0136] Implementation Method 2: Inter-symbol OCC

[0137] Using K modulation symbols as the granularity, the data obtained after transform precoding of K modulation symbols is processed based on OCC. For example, as shown in Figure 5, the modulation symbols obtained after encoding, scrambling, and modulation are {x0, x1, ...}. After DFT, {x0, x1, ...} is obtained as {y0, y1, ...}. At this time, the data obtained after DFT of K modulation symbols can be processed based on inter-slot OCC to obtain {z0, z1, ...}.

[0138] For example, z(x), y(x), and K satisfy the following formula (II):

[0139] in, This represents the number of RBs allocated to PUSCH. This indicates the number of subcarriers in each RB. Indicates the length of OCC.

[0140] For example, Figure 6 shows a schematic diagram of the data obtained after processing by OCC between time slots. As shown in Figure 6, the length of OCC is 2, and OCC includes w0 and w1. The terminal multiplies w0 and w1 respectively with the data obtained after transformation precoding of 6 modulation symbols.

[0141] Implementation method 3: Inter-symbol OCC

[0142] Each modulation symbol is processed based on OCC before transform precoding. For example, as shown in Figure 7, the modulation symbols obtained after encoding, scrambling, and modulation are {d0, d1, ...}. Then, M can be... symb Each modulation symbol is processed based on the intra-symbol OCC to obtain {x0, x1, ...}, and then {x0, x1, ...} undergoes DFT and other processing.

[0143] For example, z(n) and y(n) satisfy the following formula (III):

[0144] in, Indicates the number of subcarriers allocated to PUSCH. This indicates the number of RBs allocated to PUSCH. This indicates the number of subcarriers in each RB. M represents the length of the OCC. symb Indicates the number of modulation symbols.

[0145] For example, assuming the length of the OCC is 2, the OCC includes w0 and w1, as shown in Figure 7. The terminal multiplies the 6 modulation symbols by w0 and w1 respectively.

[0146] OCC transitions can reduce the probability that terminals in two cells will always use the same OCC, thereby reducing inter-cell interference. An OCC transition refers to a change in the OCC used by a terminal when transmitting data. Terminals in two cells using the same OCC are also referred to as OCC collisions between terminals in two cells.

[0147] For example, taking cells 1 and 2 as examples, if terminal 1 in cell 1 continuously uses OCC1 to send data, and terminal 2 in cell 2 also continuously uses OCC1 to send data, the OCCs used by terminal 1 and terminal 2 will constantly collide, potentially causing mutual interference between cells 1 and 2. However, if the OCC used by terminal 1 changes to OCC2 in the next moment, while the OCC used by terminal 2 remains OCC1 in the next moment, then the constant collision between the OCCs used by terminal 1 and terminal 2 is avoided, thereby reducing inter-cell interference.

[0148] However, analysis revealed that even with the aforementioned OCC hopping scheme, the following problem may occur: For terminals prior to REL-19, the protocol specifies repeated transmission based on an all-1 OCC. Therefore, using the aforementioned OCC hopping scheme may interfere with the repeated transmission of terminals prior to REL-19.

[0149] In view of this, this application provides a communication method and a communication device to reduce interference caused by repeated transmissions to terminals prior to REL-19.

[0150] The communication method provided in the embodiments of this application will now be described with reference to the accompanying drawings. It is understood that this application uses network devices and terminals as examples of the execution subjects in the interaction illustration, but this application does not limit the execution subjects of the interaction illustration. For example, the method executed by the network device in this application can also be implemented by modules (e.g., circuits, chips, or chip systems) in the network device, or by logical nodes, logical modules, or software that can implement all or part of the functions of the network device; the method executed by the terminal in this application can also be implemented by a communication module in the terminal or by circuits or chips (such as modem chips (also known as baseband chips), or SoC chips containing modem cores, or SIP chips) in the terminal responsible for communication functions.

[0151] Figure 8 is a schematic flowchart of the communication method provided in this application. As shown in Figure 8, the method includes:

[0152] Step 810: The terminal obtains the target orthogonal coverage code, which is obtained based on the deenabled orthogonal coverage code.

[0153] Step 820: The terminal sends data based on the target orthogonal coverage code; correspondingly, the network device receives data based on the target orthogonal coverage code.

[0154] In this application, the orthogonal covering code is also referred to as OCC. Correspondingly, the disabled orthogonal covering code can be called the disabled OCC, and the target orthogonal covering code can be called the target OCC. In the following description, for ease of description, the orthogonal covering code will be referred to as OCC.

[0155] The aforementioned disabled OCC can be replaced by a deactivated OCC, a first OCC, etc., and this application does not impose any restrictions on this. The disabled OCC can also be understood as the OCC used when the terminal does not perform an OCC transition.

[0156] In one implementation, the network device may perform step 810-a: sending first information to the terminal, the first information including an index of the disabled OCC. Correspondingly, the terminal retrieves the disabled OCC from a target matrix based on the index of the OCC. The target matrix may be, for example, a Walsh-Hadamard matrix, a DFT matrix, or a Zadoff-Chu matrix. Exemplarily, the target matrix may be indicated to the terminal by the access network device or it may be predefined.

[0157] For example, taking the 2x2 Walsh-Hadamard matrix mentioned earlier as an example, if the first information indicates index 0, then the OCC indicating de-enabled is [1, 1]; if the first information indicates index 1, then the OCC indicating de-enabled is [1, -1].

[0158] For example, taking the 8x8 Walsh-Hadamard matrix mentioned earlier as an example, if the first information indicates index 0, then the OCC indicating de-enabled is [1, 1, 1, 1, 1, 1, 1, 1]; if the first information indicates index 7, then the OCC indicating de-enabled is [1, -1, -1, 1, -1, 1, 1, -1].

[0159] For example, in the 3x3 Walsh-Hadamard matrix mentioned earlier, if the first information indicates index 0, then the OCC indicating de-enabling is [1, e]. j4π / 3 [1, 1]; If the first information indicates index 2, then the OCC indicating de-enable is [1, 1, e]. j4π / 3 ].

[0160] The aforementioned target OCC can be replaced by an activated OCC, an enabled OCC, a second OCC, etc., and this application does not impose any restrictions on this. In this application, the target OCC can be obtained based on a disabled OCC. Specifically, the implementation of obtaining the target OCC based on a disabled OCC is as follows: if all elements corresponding to the disabled OCC are 1, the target OCC is the same as the disabled OCC and the target OCC does not change according to the time of data transmission; or, if the elements corresponding to the disabled OCC are not all 1, the target OCC changes according to the time of data transmission and the elements corresponding to the target OCC are not all 1.

[0161] The target OCC can also be replaced with: the target OCC jumps according to the time of data transmission, or the target OCC jumps with the time of data transmission.

[0162] In other words, in this application, when all elements of the disabled OCC are 1, the terminal always uses the disabled OCC to send data. However, when the elements of the disabled OCC are not all 1, the target OCC used by the terminal when sending data will change but will not change to all 1. That is, when the elements of the disabled OCC are not all 1, the target OCC used by the terminal when sending data will change but will avoid the all 1 OCC during the change.

[0163] For example, taking the 4x4 Walsh-Hadamard matrix mentioned earlier as an example, if the disabled OCC is [1, 1, 1, 1], then the terminal will always send data based on [1, 1, 1, 1]. However, if the disabled OCC is [1, -1, 1, -1], then the target OCC used by the terminal when sending data is obtained based on [1, -1, 1, -1] and will change over time. For example, the target OCC used at the current moment is [1, -1, 1, -1], and the target OCC used at another moment is [1, 1, -1, -1].

[0164] Understandably, the terminal sending data according to the target OCC includes: the terminal sending data between interfaces within the terminal according to the target OCC.

[0165] It should be noted that when the target OCC changes based on the time jump of data transmission, the embodiments of this application do not limit the granularity of the jump.

[0166] For example, in one implementation, the disabled OCC type is an inter-slot OCC, which can change at a granularity of K1·N time slots, where K1 is a positive integer greater than or equal to 1. Correspondingly, in this implementation, the terminal obtains the target OCC by: obtaining the target OCC at a granularity of K1·N time slots. Optionally, the network device sends second information to the terminal, which is used to indicate that the target OCC changes at a granularity of K1·N time slots.

[0167] For example, in one implementation, the disabled OCC type is inter-symbol OCC, which can be a granular transition of K2·B·N symbols, where K2 is a positive integer greater than or equal to 1, and B is the number of symbols contained in the transport block. Correspondingly, in this implementation, the terminal obtains the target OCC by: obtaining the target orthogonal overlay code at a granular level of K2·B·N symbols. Optionally, the network device sends third information to the terminal, which is used to indicate the change at a granular level of K2·B·N symbols.

[0168] [Corrected according to Rule 91, 09.05.2026] For example, in one implementation, the type of the disabled OCC is the intra-symbol Discrete Fourier Transform pre-expansion OCC, which can jump at a granularity of K3 symbols, where K3 is a positive integer greater than or equal to 1. Correspondingly, in this implementation, the terminal acquires the target OCC by acquiring the target OCC at a granularity of K3 symbols. Optionally, the network device sends a fourth piece of information to the terminal, which is used to indicate that the target OCC changes at a granularity of K3 symbols.

[0169] Below, we will explain three implementation schemes for obtaining the target OCC based on the deenabled OCC.

[0170] Before introducing the three implementation schemes, the following explanation is provided: Let m0 be the index of the disabled OCC, N be the length of the disabled OCC, and m be the index of the target OCC. Then:

[0171] In the first implementation scheme: the target OCC and the deenabled OCC satisfy the following formula (I):

[0172] In this first implementation scheme, when the index of the disabled OCC is 0, i.e., m0 = 0, all elements corresponding to the disabled orthogonal covering code are 1. When the index of the disabled OCC is not 0, i.e., m0 ≠ 0, the elements corresponding to the disabled orthogonal covering code are not all 1.

[0173] For example, for Walsh-Hadamard matrices and DFT matrices, when m0 = 0, the corresponding deenabled OCC consists of all 1s. When m0 ≠ 0, the corresponding deenabled OCC can be considered to consist of non-all 1s.

[0174] In this first implementation scheme, if the element corresponding to the disabled OCC is not all 1s, the target OCC is based on the disabled OCC and... The value is obtained. Indicates based on And the value determined by l, This indicates the first time slot number in the time slot number corresponding to the target OCC when the subcarrier spacing is configured as μ, and l indicates the symbol index of the first symbol in the time slot corresponding to the target OCC. For example, the first time slot number is the starting slot number in the time slot number corresponding to the target orthogonal coverage code.

[0175] For example, the first symbol is the starting symbol in the symbols corresponding to the target orthogonal covering code.

[0176] In one implementation, Satisfy the following formula:

[0177] Where i ranges from 0 to I-1, and I is a positive integer. This indicates the number of symbols contained in a time slot, c(·) represents the Gold sequence, c(·) is associated with the cell identifier or scrambling identifier, and I is a positive integer.

[0178] Optionally, I can be set to 8. That is, Satisfy the following formula:

[0179] For example, in one implementation where c(·) is associated with a cell identifier or a scrambling identifier, an initialized Gold sequence is obtained based on the cell identifier or the scrambling identifier, and then c(·) is obtained based on this initialized Gold sequence. Optionally, the network device can indicate the cell identifier or the scrambling identifier to the terminal. Optionally, when c(·) is associated with a scrambling identifier, in one implementation, the network device can configure the same scrambling identifier for different cells to suit multi-point cooperation scenarios.

[0180] For example, the community sign is recorded as Record the scrambling identifier as The sequence obtained by initialization based on the cell identifier or scrambling identifier is denoted as c. init ,but or

[0181] For example, the Gold sequence is denoted as c(o), c(o) = [x1(o+N]). C )+x2(o+N C )]mod 2, x1(o+31)=[x1(o+3)+x2(o)]mod 2, x2(o+31)=[x2(o+3)+x2(o+2)+x2(o+1)+x2(o)]mod 2, where, N C =1600, the first sequence x1(n) is initialized as x1(0)=1, x1(1)=x1(2)=…=x1(30)=0, and the second sequence x2(n) is initialized as n represents the index of the element in the Gold sequence above.

[0182] For example, Figure 9 shows a schematic diagram of a transition pattern when an OCC of length 4 performs the first type of transition. As shown in Figure 9(a), the terminal corresponding to the disabled OCC with index 0 always uses the OCC with index 0 to send data; the terminal corresponding to the disabled OCC with index 1 can transition to the target OCC with index 3 to send data when sending data; the terminal corresponding to the disabled OCC with index 2 can transition to the target OCC with index 1 to send data when sending data; and the terminal corresponding to the disabled OCC with index 3 can transition to the target OCC with index 2 to send data when sending data.

[0183] For example, Figure 10 shows a schematic diagram of a transition pattern when an OCC of length 8 performs the first type of transition. As shown in Figure 10, the terminal with the disabled OCC index of 0 always uses the OCC with index 0 to send data; the terminal with the disabled OCC index of 1 can switch to the target OCC with index 3 to send data; the terminal with the disabled OCC index of 2 can switch to the target OCC with index 4 to send data; the terminal with the disabled OCC index of 3 can switch to the target OCC with index 5 to send data; the terminal with the disabled OCC index of 4 can switch to the target OCC with index 6 to send data; the terminal with the disabled OCC index of 5 can switch to the target OCC with index 7 to send data; the terminal with the disabled OCC index of 6 can switch to the target OCC with index 1 to send data; and the terminal with the disabled OCC index of 7 can switch to the target OCC with index 2 to send data.

[0184] Understandably, Figure 9 only shows one hopping pattern for an OCC with a length of 4, and Figure 10 only shows one frequency hopping pattern for an OCC with a length of 8. Understandably, when using the above formula (I), there are a total of N-1 frequency hopping patterns. For example, when N equals 4, there are a total of 3 frequency hopping patterns. When N equals 8, there are a total of 7 patterns.

[0185] For example, when N equals 4, another possible transition pattern is shown in Figure 9(b). As shown in Figure 9(b), the terminal with the disabled OCC at index 0 always uses the OCC at index 0 to send data; the terminal with the disabled OCC at index 1 can switch to the target OCC at index 2 to send data; the terminal with the disabled OCC at index 2 can switch to the target OCC at index 3 to send data; and the terminal with the disabled OCC at index 3 can switch to the target OCC at index 1 to send data.

[0186] Understandably, in the embodiments of this application, if c(·) is associated with the cell identifier, then interference between cells can also be reduced. For example, taking a sequence of length 4 as an example, the OCC transition process of terminals in two adjacent cells is explained.

[0187] As shown in Figure 11, at time 1:

[0188] In cell 1, the target OCC used by the terminal with the disabled OCC corresponding to index 0 is [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC corresponding to index 1 is [1, j, -1, -j], the target OCC used by the terminal with the disabled OCC corresponding to index 2 is [1, -1, 1, -1], and the target OCC used by the terminal with the disabled OCC corresponding to index 3 is [1, -j, -1, j]. Similarly, in cell 2, the target OCC used by the terminal with the disabled OCC at index 0 is [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC at index 1 is [1, j, -1, -j], the target OCC used by the terminal with the disabled OCC at index 2 is [1, -1, 1, -1], and the target OCC used by the terminal with the disabled OCC at index 3 is [1, -j, -1, j].

[0189] At time 2:

[0190] In cell 1, the target OCC used by the terminal with the disabled OCC corresponding to index 0 is still [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC corresponding to index 1 jumps to [1, -j, -1, j], the target OCC used by the terminal with the disabled OCC corresponding to index 2 jumps to [1, j, -1, -j], and the target OCC used by the terminal with the disabled OCC corresponding to index 3 jumps to [1, -1, 1, -1]. For the terminal in another cell 2, the target OCC used by the terminal with the disabled OCC at index 0 is still [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC at index 1 jumps to [1, -1, 1, -1], the target OCC used by the terminal with the disabled OCC at index 2 jumps to [1, -j, -1, j], and the target OCC used by the terminal with the disabled OCC at index 3 jumps to [1, j, -1, -j].

[0191] As can be seen, the above method avoids the probability of the four terminals in cell 1 colliding with the four terminals in cell 2, thus reducing the interference between cell 1 and cell 2.

[0192] It should be noted that the above formula (i) is merely an example and does not constitute a limitation of this application. For example, as described above... A variation, Alternatively, it can be replaced with:

[0193] Where G is a positive integer.

[0194] In the second implementation scheme: the target OCC and the deenabled OCC satisfy the following formula (II):

[0195] In this second implementation, when the index of the disabled OCC is 0, i.e., m0 = 0, all elements corresponding to the disabled orthogonal covering code are 1. When the index of the disabled OCC is not 0, i.e., m0 ≠ 0, the elements corresponding to the disabled orthogonal covering code are not all 1.

[0196] in, The meaning and implementation method can be found in the description of Implementation Scheme 1, and will not be repeated here. In this second implementation scheme, express The nth number that is coprime to N Number. The numbers that are relatively prime to N are represented as follows: Arranged in ascending order

[0197] Referring to Figure 12(a), a schematic diagram of a transition pattern is shown when an OCC of length 4 transitions. As shown in Figure 12(a), a terminal corresponding to the disabled OCC with index 1 can transition to the target OCC with index 3 to send data when transmitting data; a terminal corresponding to the disabled OCC with index 3 can transition to the target OCC with index 1 to send data when transmitting data.

[0198] Referring to Figure 12(b), a schematic diagram of a transition pattern when an OCC of length 8 is transitioning is shown. As shown in Figure 13(b): a terminal corresponding to the disabled OCC with index 1 can transition to the target OCC with index 3 to send data when transmitting data; a terminal corresponding to the disabled OCC with index 2 can transition to the target OCC with index 6 to send data when transmitting data; a terminal corresponding to the disabled OCC with index 3 can transition to the target OCC with index 1 to send data when transmitting data; a terminal corresponding to the disabled OCC with index 5 can transition to the target OCC with index 7 to send data when transmitting data; a terminal corresponding to the disabled OCC with index 6 can transition to the target OCC with index 2 to send data when transmitting data; and a terminal corresponding to the disabled OCC with index 7 can transition to the target OCC with index 5 to send data when transmitting data.

[0199] As can be seen in the example in Figure 12 above, for an OCC of length 4, the disabled OCC at index 2 does not change. For an OCC of length 8, the disabled OCC at index 4 does not change. Generally, if the length N of the OCC is even, the target OCC used by the terminal corresponding to the disabled OCC at index N / 2 does not change over time.

[0200] Understandably, Figure 12 only shows one transition pattern for OCCs of lengths 4 and 8. Understandably, when using formula (ii) above, there are a total of There are 2 frequency hopping patterns. For example, when N equals 4, there are a total of 2 frequency hopping patterns. When N equals 8, there are a total of 4 patterns.

[0201] The following example illustrates the OCC transition process of terminals in two adjacent cells, using a sequence of length 4 associated with c(·) and cell identifier.

[0202] As shown in Figure 13, at time 1:

[0203] In cell 1, the target OCC used by the terminal with the disabled OCC at index 0 is [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC at index 1 is [1, j, -1, -j], the target OCC used by the terminal with the disabled OCC at index 2 is [1, -1, 1, -1], and the target OCC used by the terminal with the disabled OCC at index 3 is [1, -j, -1, j]. Similarly, in cell 2, the target OCC used by the terminal with the disabled OCC at index 0 is [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC at index 1 is [1, j, -1, -j], the target OCC used by the terminal with the disabled OCC at index 2 is [1, -1, 1, -1], and the target OCC used by the terminal with the disabled OCC at index 3 is [1, -j, -1, j].

[0204] At time 2:

[0205] In cell 1, the target OCC used by the terminal with the disabled OCC at index 0 remains [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC at index 1 jumps to [1, j, -1, -j], the target OCC used by the terminal with the disabled OCC at index 2 jumps to [1, -1, 1, -1], and the target OCC used by the terminal with the disabled OCC at index 3 jumps to [1, -j, -1, j]. For the terminal in another cell 2, the target OCC used by the terminal with the disabled OCC at index 0 is still [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC at index 1 jumps to [1, -j, -1, j], the target OCC used by the terminal with the disabled OCC at index 2 jumps to [1, -1, 1, -1], and the target OCC used by the terminal with the disabled OCC at index 3 jumps to [1, j, -1, -j].

[0206] As can be seen, the above method avoids the probability of the four terminals in cell 1 colliding with the four terminals in cell 2, thus reducing the interference between cell 1 and cell 2.

[0207] In the third implementation scheme: the target OCC and the deenabled OCC satisfy the following formula (III):

[0208] In this third implementation, when the index of the disabled OCC is 0, i.e., m0 = 0, all elements corresponding to the disabled orthogonal covering code are 1. When the index of the disabled OCC is not 0, i.e., m0 ≠ 0, the elements corresponding to the disabled orthogonal covering code are not all 1.

[0209] in, The meaning and implementation method can be found in the description of Implementation Scheme 1, and will not be repeated here. In this third implementation scheme, A represents a (N-1)! × (N-1) dimensional permutation matrix. Indicates the first in A The element in row m0.

[0210] It should be noted that in this third embodiment, for a permutation matrix, the larger the row number in the matrix, the larger the value of the elements in the row arranged from left to right.

[0211] For example, the 6×3-dimensional permutation matrix corresponding to an OCC of length 4.

[0212] Referring to Figure 14(a), a schematic diagram of a transition pattern is shown when an OCC of length 4 transitions. As shown in Figure 14(a), a terminal corresponding to the disabled OCC with index 1 can transition to the target OCC with index 2 to send data when transmitting data; a terminal corresponding to the disabled OCC with index 2 can transition to the target OCC with index 3 to send data when transmitting data; and a terminal corresponding to the disabled OCC with index 3 can transition to the target OCC with index 1 to send data when transmitting data.

[0213] Referring to Figure 14(b), a schematic diagram of a transition pattern is shown when an OCC of length 8 undergoes a transition. As shown in Figure 14(b): the terminal corresponding to the disabled OCC index 0 always uses the disabled OCC index 0 to send data; the terminal corresponding to the disabled OCC index 1 can switch to the target OCC index 4 to send data; the terminal corresponding to the disabled OCC index 2 can switch to the target OCC index 6 to send data; the terminal corresponding to the disabled OCC index 3 can switch to the target OCC index 2 to send data; the terminal corresponding to the disabled OCC index 4 can switch to the target OCC index 7 to send data; the terminal corresponding to the disabled OCC index 5 can switch to the target OCC index 1 to send data; the terminal corresponding to the disabled OCC index 6 can switch to the target OCC index 5 to send data; and the terminal corresponding to the disabled OCC index 7 can switch to the target OCC index 3 to send data.

[0214] Understandably, Figure 14 only shows one hopping pattern for OCCs with lengths of 4 and 8. Understandably, when using Formula (III) above, there are a total of (N-1)! frequency hopping patterns. For example, when N equals 4, there are a total of 6 frequency hopping patterns.

[0215] The following example illustrates the OCC transition process of terminals in two adjacent cells, using a sequence of length 4 associated with c(·) and cell identifier.

[0216] As shown in Figure 15, at time 1:

[0217] In cell 1, the target OCC used by the terminal with the disabled OCC at index 0 is [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC at index 1 is [1, j, -1, -j], the target OCC used by the terminal with the disabled OCC at index 2 is [1, -1, 1, -1], and the target OCC used by the terminal with the disabled OCC at index 3 is [1, -j, -1, j]. Similarly, in cell 2, the target OCC used by the terminal with the disabled OCC at index 0 is [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC at index 1 is [1, j, -1, -j], the target OCC used by the terminal with the disabled OCC at index 2 is [1, -1, 1, -1], and the target OCC used by the terminal with the disabled OCC at index 3 is [1, -j, -1, j].

[0218] At time 2:

[0219] In cell 1, the target OCC used by the terminal with the disabled OCC at index 0 remains [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC at index 1 jumps to [1, -1, 1, -1], the target OCC used by the terminal with the disabled OCC at index 2 jumps to [1, -j, -1, j], and the target OCC used by the terminal with the disabled OCC at index 3 jumps to [1, j, -1, -j]. For the terminal in another cell 2, the target OCC used by the terminal with the disabled OCC at index 0 is still [1, 1, 1, 1], the target OCC used by the terminal with the disabled OCC at index 1 jumps to [1, j, -1, -j], the target OCC used by the terminal with the disabled OCC at index 2 jumps to [1, -j, -1, j], and the target OCC used by the terminal with the disabled OCC at index 3 jumps to [1, -1, 1, -1].

[0220] As can be seen, the above method avoids the probability of the four terminals in cell 1 colliding with the four terminals in cell 2, thus reducing the interference between cell 1 and cell 2.

[0221] The above describes three implementation schemes for obtaining the target OCC based on the disabled OCC. Understandably, of the three implementation schemes described above, the third scheme can provide more frequency hopping patterns compared to the first and second schemes.

[0222] The communication method of the embodiments of this application has been described in detail above. The communication device provided by the embodiments of this application will be described in detail below with reference to FIG16 and FIG17.

[0223] Figure 16 is a structural schematic diagram of a communication device provided in an embodiment of this application. Specifically, as shown in Figure 16, the device 1600 includes a processing module 1601 and a transceiver module 1602.

[0224] For example, in an embodiment of the first device, device 1600 is applied in a terminal device. For instance, device 1600 may be the terminal device itself. Alternatively, device 1600 may be a component within the terminal device, such as a chip within the terminal device.

[0225] Specifically, the processing module 1601 is used to obtain the target orthogonal coverage code, which is obtained based on the disabled orthogonal coverage code; the transceiver module 1602 is used to send data according to the target orthogonal coverage code; wherein, if all elements corresponding to the disabled orthogonal coverage code are 1, the target orthogonal coverage code is the same as the disabled orthogonal coverage code and the target orthogonal coverage code does not change according to the time of data transmission; or, if the elements corresponding to the disabled orthogonal coverage code are not all 1, the target orthogonal coverage code changes according to the time of data transmission and the elements corresponding to the target orthogonal coverage code are not all 1.

[0226] Optionally, if the elements corresponding to the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0227] Where m0 represents the index of the deenabled orthogonal covering code. Indicates based on And the value determined by l, This represents the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represents the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, N is the length of the disabled orthogonal coverage code, and m represents the index of the target orthogonal coverage code. Associated with community identifiers or scrambling identifiers.

[0228] Optionally, the target orthogonal covering code and the disabled orthogonal covering code satisfy the following relationship:

[0229] [Corrected according to detailed rule 91, 09.05.2026] Among them, Indicates based on And the value determined by l, This indicates the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, and l indicates the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code. This represents the number of positive integers less than N that are relatively prime to N. express The nth number that is coprime to N The number of orthogonal covering codes is given, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0230] Optionally, if the elements of the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0231] in, Indicates based on And the value determined by l, Let represent the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represent the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, and A represent the (N-1)! × (N-1) dimensional permutation matrix. Indicates the first in A The element in row m0, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0232] Optional, Satisfy the following relationship

[0233] [Corrected according to Rule 91, 09.05.2026] c(·) represents the number of symbols contained in a time slot, c(·) represents the Gold sequence, c(·) is associated with the cell identifier or scrambling identifier, and i ranges from 0 to I-1, where I is a positive integer.

[0234] Optional, I can be 8.

[0235] Optionally, the type of the deenabled orthogonal coverage code is an inter-slot orthogonal coverage code; the processing module 1601 is also used to: obtain the target orthogonal coverage code with a granularity of K1·N time slots, where K1 is a positive integer greater than or equal to 1.

[0236] Optionally, the type of the deactivated orthogonal coverage code is an inter-symbol orthogonal coverage code; the processing module 1601 is also used to: obtain the target orthogonal coverage code with a granularity of K2·B·N symbols, where K2 is a positive integer greater than or equal to 1 and B is the number of symbols contained in the transport block.

[0237] Optionally, the type of the deenabled orthogonal covering code is an intra-symbol discrete Fourier transform pre-expansion orthogonal covering code; the processing module 1601 is also used to: obtain the target orthogonal covering code with a granularity of K3 symbols, where K3 is a positive integer greater than or equal to 1.

[0238] Optionally, the transceiver module 1602 is also configured to: receive first information, the first information being used to indicate an orthogonal overlay code to be enabled.

[0239] Optionally, the first information includes the index of the deenabled orthogonal covering code.

[0240] For example, in an embodiment of the second device, device 1600 is applied in a network device. For instance, device 1600 may be a network device itself. Alternatively, device 1600 may be a component within the network device, such as a chip within the network device.

[0241] Specifically, the transceiver module 1602 is used to send first information, which is used to indicate the de-enabled orthogonal coverage code; the transceiver module 1602 is also used to: receive data based on the target orthogonal coverage code, which is obtained based on the de-enabled orthogonal coverage code; wherein, if all elements corresponding to the de-enabled orthogonal coverage code are 1, the target orthogonal coverage code is the same as the de-enabled orthogonal coverage code and the target orthogonal coverage code does not change according to the time of data transmission; or, if the elements corresponding to the de-enabled orthogonal coverage code are not all 1, the target orthogonal coverage code changes according to the time of data transmission and the elements corresponding to the target orthogonal coverage code are not all 1.

[0242] Optionally, if the elements corresponding to the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0243] [Corrected according to Rule 91, 09.05.2026] Where m0 represents the index of the deenabled orthogonal covering code, Indicates based on And the value determined by l, This represents the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represents the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, N is the length of the disabled orthogonal coverage code, and m represents the index of the target orthogonal coverage code. Associated with community identifiers or scrambling identifiers.

[0244] Optionally, the target orthogonal covering code and the disabled orthogonal covering code satisfy the following relationship:

[0245] in, Indicates based on And the value determined by l, This indicates the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, and l indicates the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code. This represents the number of positive integers less than N that are relatively prime to N. express The nth number that is coprime to N The number of orthogonal covering codes is given, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0246] Optionally, if the elements of the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship:

[0247] in, Indicates based on And the value determined by l, Let represent the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represent the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, and A represent the (N-1)! × (N-1) dimensional permutation matrix. Indicates the first in A The element in row m0, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers.

[0248] Optional, Satisfy the following relationship

[0249] c(·) represents the number of symbols contained in a time slot, c(·) represents the Gold sequence, c(·) is associated with the cell identifier or scrambling identifier, and i ranges from 0 to I-1, where I is a positive integer.

[0250] Optional, I can be 8.

[0251] Optionally, the type of the deactivated orthogonal coverage code is an inter-slot orthogonal coverage code; the transceiver module 1602 is also used to: send a second message, the second message being used to indicate that the target orthogonal coverage code varies in granularity of K1·N time slots, where K1 is a positive integer greater than or equal to 1.

[0252] Optionally, the type of the deactivated orthogonal coverage code is an inter-symbol orthogonal coverage code; the transceiver module 1602 is also used to: send third information, which is used to indicate that the target orthogonal coverage code varies in granularity of K2·B·N symbols, where K2 is a positive integer greater than or equal to 1 and B is the number of symbols contained in the transport block.

[0253] [Corrected according to Rule 91 09.05.2026] Optionally, the type of the deenabled orthogonal covering code is an intra-symbol discrete Fourier transform pre-expansion orthogonal covering code; the transceiver module 1602 is further configured to: send a fourth message, which is used to indicate that the target orthogonal covering code is varied in granularity of K3 symbols, where K3 is a positive integer greater than or equal to 1.

[0254] [Corrected according to Rule 91 09.05.2026] Figure 17 is a structural schematic diagram of another communication device provided in an embodiment of this application. The device shown in Figure 17 can be used to perform the method in any of the foregoing embodiments.

[0255] As shown in Figure 17, the device 1700 of this embodiment includes a memory 1701 and a processor 1702. In one implementation, the device 1700 further includes a communication interface 1703 and a bus 1704. The memory 1701, processor 1702, and communication interface 1703 are interconnected via the bus 1704.

[0256] The memory 1701 can be a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 1701 can store programs, and when the program stored in the memory 1701 is executed by the processor 1702, the processor 1702 is used to execute the various steps of the method shown in FIG8.

[0257] The processor 1702 may be a general-purpose central processing unit (CPU), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, used to execute relevant programs to implement the method shown in FIG8 of the embodiment of this application.

[0258] The processor 1702 can also be an integrated circuit chip with signal processing capabilities. In implementation, each step of the method in FIG8 of this application embodiment can be completed by the integrated logic circuitry in the processor 1702 or by software instructions.

[0259] The processor 1702 described above can also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or a conventional processor, etc.

[0260] The steps of the method disclosed in the embodiments of this application can be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory 1701. The processor 1702 reads the information in memory 1701 and, in conjunction with its hardware, completes the functions required by the units included in the device of this application. For example, it can execute the various steps / functions of the embodiment shown in FIG8.

[0261] The communication interface 1703 can use, but is not limited to, transceivers to enable communication between the device 1700 and other devices or communication networks.

[0262] Bus 1704 may include a pathway for transmitting information between various components of device 1700 (e.g., memory 1701, processor 1702, communication interface 1703).

[0263] It should be understood that the device 1700 shown in the embodiments of this application can be an electronic device, or it can be a chip configured in an electronic device. The device 1700 can be deployed in a terminal device, or it can be deployed in a network device.

[0264] [Corrected according to Rule 91, 09.05.2026] The above embodiments can be implemented in whole or in part by software, hardware, firmware, or any other combination. When implemented using software, the above embodiments can be implemented in whole or in part as a computer program product. This computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer program are loaded or executed on a computer, all or part of the flow or function according to the embodiments of this application is generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be a usable medium accessible to a computer or a data storage device such as a server or data center containing one or more sets of usable media. The usable medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. A semiconductor medium can be a solid-state drive.

[0265] It should be understood that the term "and / or" in this article is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. A and B can be singular or plural. Additionally, the character " / " in this article generally indicates an "or" relationship between the preceding and following related objects, but it can also represent an "and / or" relationship. Please refer to the context for a more accurate understanding.

[0266] In this application, "at least one" means one or more, and "more than one" means two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or multiple items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple.

[0267] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not limit the implementation process of the embodiments of this application.

[0268] 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 application.

[0269] Those skilled in the art will 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.

[0270] [Corrected according to Rule 91, 09.05.2026] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of units is merely a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection of apparatuses or units may be electrical, mechanical, or other forms.

[0271] [Corrected according to Rule 91, 09.05.2026] The unit described as a separate component may or may not be physically separate. The component shown as a unit may or may not be a physical unit, that is, it may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0272] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0273] [Corrected according to Rule 91, 09.05.2026] If this function is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory, random access memory, magnetic disks, or optical disks.

Claims

A communication method, characterized in that, include: Obtain the target orthogonal coverage code, which is obtained based on the disabled orthogonal coverage code; Data is sent according to the target orthogonal coverage code; Wherein, if all elements corresponding to the de-enabled orthogonal coverage code are 1, the target orthogonal coverage code is the same as the de-enabled orthogonal coverage code and the target orthogonal coverage code does not change according to the time of sending the data; or, If the elements corresponding to the deenabled orthogonal coverage code are not all 1s, the target orthogonal coverage code changes according to the time of sending the data and the elements corresponding to the target orthogonal coverage code are not all 1s. The method according to claim 1, characterized in that, If the elements corresponding to the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship: Where m0 represents the index of the deenabled orthogonal covering code. Indicates based on And the value determined by l, The first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represents the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, N is the length of the disabled orthogonal coverage code, and m represents the index of the target orthogonal coverage code. Associated with community identifiers or scrambling identifiers. The method according to claim 2, characterized in that, The target orthogonal covering code and the disabled orthogonal covering code satisfy the following relationship: in, Indicates based on And the value determined by l, This indicates the first time slot number among the time slot numbers corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, and l indicates the symbol index of the first symbol among the symbols corresponding to the target orthogonal coverage code in the time slot. This represents the number of positive integers less than N that are relatively prime to N. express The nth number that is coprime to N The number of orthogonal covering codes is given, m0 represents the index of the disabled orthogonal covering code, N is the length of the disabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers. The method according to claim 2, characterized in that, If the elements of the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship: in, Indicates based on And the value determined by l, Let represent the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represent the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, and A represent a (N-1)! × (N-1) dimensional permutation matrix. Indicates the first in A The element in row m0, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers. The method according to any one of claims 2 to 4, characterized in that, The following relationship must be satisfied: The number of symbols contained in a time slot is represented by c(·), which represents the Gold sequence. c(·) is associated with the cell identifier or scrambling identifier. i ranges from 0 to I-1, where I is a positive integer. The method according to claim 5, characterized in that, I take 8. The method according to any one of claims 2 to 6, characterized in that, The type of the disabled orthogonal covering code is an inter-slot orthogonal covering code; The process of obtaining the target orthogonal coverage code includes: The target orthogonal coverage code is obtained with K1·N time slots as the granularity, where K1 is a positive integer greater than or equal to 1. The method according to any one of claims 2 to 6, characterized in that, The type of the deenabled orthogonal covering code is an inter-symbol orthogonal covering code; The process of obtaining the target orthogonal coverage code includes: The target orthogonal overlay code is obtained with a granularity of K2·B·N symbols, where K2 is a positive integer greater than or equal to 1, and B is the number of symbols contained in the transport block. The method according to any one of claims 2 to 6, characterized in that, The type of the deenabled orthogonal covering code is an intra-symbol discrete Fourier transform extended pre-orthogonal covering code; The process of obtaining the target orthogonal coverage code includes: The target orthogonal covering code is obtained with a granularity of K3 symbols, where K3 is a positive integer greater than or equal to 1. The method according to any one of claims 1 to 9, characterized in that, The method further includes: Receive first information, which is used to indicate the deenabled orthogonal cover code. The method according to claim 10, characterized in that, The first information includes the index of the deenabled orthogonal cover code. A communication method, characterized in that, include: Send a first message, which is used to indicate the orthogonal cover code to be disabled; Data is received based on the target orthogonal coverage code, which is obtained based on the disabled orthogonal coverage code; Wherein, if all elements corresponding to the de-enabled orthogonal coverage code are 1, the target orthogonal coverage code is the same as the de-enabled orthogonal coverage code and the target orthogonal coverage code does not change according to the time of sending the data; or, If the elements corresponding to the deenabled orthogonal coverage code are not all 1s, the target orthogonal coverage code changes according to the time of sending the data and the elements corresponding to the target orthogonal coverage code are not all 1s. The method according to claim 12, characterized in that, If the elements corresponding to the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship: Where m0 represents the index of the deenabled orthogonal covering code. Indicates based on And the value determined by l, The first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represents the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, N is the length of the disabled orthogonal coverage code, and m represents the index of the target orthogonal coverage code. Associated with community identifiers or scrambling identifiers. The method according to claim 12, characterized in that, The target orthogonal covering code and the disabled orthogonal covering code satisfy the following relationship: in, Indicates based on And the value determined by l, This indicates the first time slot number among the time slot numbers corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, and l indicates the symbol index of the first symbol among the symbols corresponding to the target orthogonal coverage code in the time slot. This represents the number of positive integers less than N that are relatively prime to N. express The nth number that is coprime to N The number of orthogonal covering codes is given, m0 represents the index of the disabled orthogonal covering code, N is the length of the disabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers. The method according to claim 12, characterized in that, If the elements of the deenabled orthogonal covering code are not all 1s, the target orthogonal covering code and the deenabled orthogonal covering code satisfy the following relationship: in, Indicates based on And the value determined by l, Let represent the first time slot number in the time slot number corresponding to the target orthogonal coverage code when the subcarrier spacing is configured as μ, l represent the symbol index of the first symbol in the time slot corresponding to the target orthogonal coverage code, and A represent a (N-1)! × (N-1) dimensional permutation matrix. Indicates the first in A The element in row m0, where m0 represents the index of the deenabled orthogonal covering code, N is the length of the deenabled orthogonal covering code, and m represents the index of the target orthogonal covering code. Associated with community identifiers or scrambling identifiers. The method according to any one of claims 12 to 15, characterized in that, The following relationship must be satisfied: The number of symbols contained in a time slot is represented by c(·), which represents the Gold sequence. c(·) is associated with the cell identifier or scrambling identifier. i ranges from 0 to I-1, where I is a positive integer. The method according to claim 16, characterized in that, I take 8. The method according to any one of claims 12 to 17, characterized in that, The type of the disabled orthogonal covering code is an inter-slot orthogonal covering code; The method further includes: Send a second message, which is used to indicate that the target orthogonal coverage code varies in granularity of K1·N time slots, where K1 is a positive integer greater than or equal to 1. The method according to any one of claims 12 to 17, characterized in that, The type of the deenabled orthogonal covering code is an inter-symbol orthogonal covering code; The method further includes: Send a third message, which is used to indicate that the target orthogonal coverage code varies in granularity of K2·B·N symbols, where K2 is a positive integer greater than or equal to 1 and B is the number of symbols contained in the transport block. The method according to any one of claims 12 to 17, characterized in that, The type of the deenabled orthogonal covering code is an intra-symbol discrete Fourier transform extended pre-orthogonal covering code; The method further includes: Send a fourth message, which is used to indicate that the target orthogonal covering code changes at a granularity of K3 symbols, where K3 is a positive integer greater than or equal to 1. A communication device, characterized in that, Includes a module for performing the method as described in any one of claims 1 to 11. [Corrected according to Rule 91, 09.05.2026] A communication device, characterized in that, Includes a module for performing the method as described in any one of claims 12 to 20. [Corrected according to Rule 91, 09.05.2026] A communication device, characterized in that, include: processor, The processor is configured to cause the communication device to implement the method as described in any one of claims 1 to 11, or to cause the communication device to implement the method as described in any one of claims 12 to 20, by executing a computer program and / or by logic circuitry. [Corrected according to Rule 91, 09.05.2026] A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a program or instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 11, or cause the computer to perform the method as described in any one of claims 12 to 20. [Corrected according to Rule 91, 09.05.2026] A computer program product, characterized in that, The computer program product includes computer program code that, when run on a computer, causes the computer to implement the method as described in any one of claims 1 to 11, or causes the computer to implement the method as described in any one of claims 12 to 20.

Images