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 method and communication apparatus

[0001] This application claims priority from the Chinese patent application No. 202411369539.4 filed on September 27, 2024, and entitled "Communication method and communication apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] Embodiments of the present application relate to the field of communication, and in particular, to a communication method and a communication apparatus. BACKGROUND

[0003] In order to ensure correct demodulation of data, a terminal can perform a large number of repetitions on a physical uplink shared channel (PUSCH). However, when the terminal performs PUSCH repetition, an increase in the number of repetitions can result in low resource utilization, and thus result in reduced capacity.

[0004] In order to improve system capacity, one implementation is as follows: OCC (orthogonal cover code) is used to multiplex PUSCHs of multiple terminals on the same resource.

[0005] However, when the system capacity is improved in the above manner, interference to other terminals can be caused. SUMMARY

[0006] The present application provides a communication method and a communication apparatus to reduce interference to other terminals.

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

[0008] The communication method includes: obtaining a target OCC (orthogonal cover code), the target OCC being obtained based on a disabled OCC; and transmitting data according to the target OCC; wherein, 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 a time of transmitting the data; or, if the elements corresponding to the disabled OCC are not all 1, the target OCC changes according to the time of transmitting the data and elements corresponding to the target OCC 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] 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.

[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] Optionally, the method further includes: receiving first information, the first information being used to indicate the disabled OCC. For example, the first information includes an index of the disabled OCC.

[0026] In a second aspect, a communication method is provided. The method can be performed by a network device, or by a component (e.g., a chip, a chip system, etc.) configured in the network device, or by a logic module or software capable of implementing all or part of the functions of the terminal. The present application does not limit this.

[0027] The communication method includes: sending first information, the first information being used to indicate a disabled OCC; and receiving data based on a target OCC, the target OCC being obtained based on the disabled OCC. 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 sending data. If the elements corresponding to the disabled OCC are not all 1, the target OCC changes according to the time of sending data and the elements corresponding to the target OCC are not all 1.

[0028] According to the above technical solution, 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 sending data. If the elements corresponding to the disabled OCC are not all 1, the target OCC changes according to the time of sending data and the elements corresponding to the target OCC are not all 1. Therefore, the number of terminals using the same OCC with all elements being 1 in the communication system can be reduced, thereby reducing the interference between terminals.

[0029] In combination with the second aspect, in a possible implementation, if the elements corresponding to the disabled OCC are not all 1, the target OCC and the disabled OCC satisfy the following relationship:

[0030] wherein m0 represents an index of the disabled OCC, represents a value determined based on and l, represents a first slot number in a slot number corresponding to the target OCC when a subcarrier spacing configuration is μ, l represents a symbol index of a first symbol in a symbol corresponding to the target OCC in a slot, N is a length of the disabled OCC, and m represents an index of the target OCC. The OCC is associated with a cell identifier or a scrambling identifier.

[0031] With reference to the second aspect, in a possible implementation form, the target OCC satisfies the following relationship with the disabled OCC:

[0032] wherein, denotes a value determined based on and l, denotes a first slot number in a slot number corresponding to the target OCC when a subcarrier spacing configuration is μ, and l denotes a symbol index of a first symbol in a symbol corresponding to the target OCC in the slot, denotes a number of numbers less than N and coprime with N, denotes a number in the numbers coprime with N, m0 denotes an index of the disabled OCC, N is a length of the disabled OCC, and m denotes an index of the target OCC, is associated with the cell identity or the scrambling identity.

[0033] With reference to the second aspect, in a possible implementation form, if the disabled OCC includes non-all-1 elements, the target OCC satisfies the following relationship with the disabled OCC:

[0034] wherein, denotes a value determined based on and l, denotes a first slot number in a slot number corresponding to the target OCC when a subcarrier spacing configuration is μ, and l denotes a symbol index of a first symbol in a symbol corresponding to the target OCC in the slot, and A denotes a full permutation matrix of (N-1)! x (N-1) dimensions, denotes an element in the m0th column of the mth row in A, m0 denotes an index of the disabled OCC, N is a length of the disabled OCC, and m denotes an index of the target OCC, is associated with the cell identity or the scrambling identity.

[0035] With reference to the second aspect, in a possible implementation form, satisfies the following relationship:

[0036] denotes a number of symbols included in one slot, c(·) denotes a Gold sequence, c(·) is associated with the cell identity or the scrambling identity, i takes values from 0 to I-1, and I is a positive integer.

[0037] With reference to the second aspect, in a possible implementation form, I takes 8. ​​

[0038] In a possible implementation of the second aspect, the type of the disabled orthogonal cover code is an inter-slot orthogonal cover code; and the method further includes: sending second information, the second information being used to indicate that the target orthogonal cover code varies in granularity of K1*N slots, K1 being a positive integer greater than or equal to 1.

[0039] In a possible implementation of the second aspect, the type of the disabled orthogonal cover code is an inter-symbol orthogonal cover code; and the method further includes: sending third information, the third information being used to indicate that the target orthogonal cover code varies in granularity of K2*B*N symbols, K2 being a positive integer greater than or equal to 1, and B being a quantity of symbols contained in a transport block.

[0040] In a possible implementation of the second aspect, the type of the disabled orthogonal cover code is an intra-symbol discrete Fourier transform spread pre-orthogonal cover code; and the method further includes: sending fourth information, the fourth information being used to indicate that the target orthogonal cover code varies in granularity of K3 symbols, K3 being a positive integer greater than or equal to 1.

[0041] In a possible implementation of the third aspect, if the elements corresponding to the disabled orthogonal cover code are all 1, the target orthogonal cover code is the same as the disabled orthogonal cover code and does not change according to a time of sending data; or if the elements corresponding to the disabled orthogonal cover code are not all 1, the target orthogonal cover code changes according to the time of sending data and the elements corresponding to the target orthogonal cover code are not all 1.

[0042] In a possible implementation of the third aspect, if the elements corresponding to the disabled orthogonal cover code are not all 1, the target orthogonal cover code and the disabled orthogonal cover code satisfy the following relationship:

[0043] wherein m0 represents an index of the disabled orthogonal cover code, represents a value determined based on and l, represents a first slot number in slot numbers corresponding to the target orthogonal cover code when a subcarrier spacing configuration is μ, l represents a symbol index of a first symbol in symbols corresponding to the target orthogonal cover code in a slot, N is a length of the disabled orthogonal cover code, and m represents an index of the target orthogonal cover code, and a cell identifier or a scrambling identifier.

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

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

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

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

[0051] In a possible implementation of the third aspect, the type of the disabled orthogonal cover code is an inter-slot orthogonal cover code; and the processing module is further configured to obtain the target orthogonal cover code in a granularity of K1*N slots, K1 being a positive integer greater than or equal to 1.

[0052] In a possible implementation of the third aspect, the type of the disabled orthogonal cover code is an inter-symbol orthogonal cover code; and the processing module is further configured to obtain the target orthogonal cover code in a granularity of K2*B*N symbols, K2 being a positive integer greater than or equal to 1, and B being the number of symbols contained in a transport block.

[0053] In a possible implementation of the third aspect, the type of the disabled orthogonal cover code is an intra-symbol discrete Fourier transform spread pre-orthogonal cover code; and the processing module is further configured to obtain the target orthogonal cover code in a granularity of K3 symbols, K3 being a positive integer greater than or equal to 1.

[0054] In a possible implementation of the third aspect, the transceiver module is further configured to receive first information, the first information being used to indicate the disabled orthogonal cover code.

[0055] In a possible implementation of the third aspect, the first information includes an index of the disabled orthogonal cover code.

[0056] In a possible implementation of the fourth aspect, the transceiver module is configured to send first information, the first information being used to indicate a disabled orthogonal cover code; and the transceiver module is further configured to receive data based on a target orthogonal cover code, the target orthogonal cover code being obtained based on the disabled 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 change according to a time of sending the data; or if the elements corresponding to the disabled orthogonal cover code are not all 1, the target orthogonal cover code changes according to the time of sending the data and the elements corresponding to the target orthogonal cover code are not all 1.

[0057] In a possible implementation of the fourth aspect, if the elements corresponding to the disabled orthogonal cover code are not all 1, the target orthogonal cover code and the disabled orthogonal cover code satisfy the following relationship:

[0058] wherein m0 represents an index of the disabled orthogonal cover code, represents a value determined based on m0 and 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] denotes a number of symbols contained in a slot, c(·) denotes a Gold sequence, c(·) is associated with the cell identity or scrambling identity, i takes values from 0 to I-1, I is a positive integer.

[0065] With reference to the fourth aspect, in a possible implementation manner, I takes 8.

[0066] With reference to the fourth aspect, in a possible implementation manner, the type of the disabled orthogonal cover code is an inter-slot orthogonal cover code; and the transceiver is further configured to send second information, the second information being used to indicate that the target orthogonal cover code varies in a granularity of K1·N slots, K1 being a positive integer greater than or equal to 1.

[0067] With reference to the fourth aspect, in a possible implementation manner, the type of the disabled orthogonal cover code is an inter-symbol orthogonal cover code; and the transceiver is further configured to send third information, the third information being used to indicate that the target orthogonal cover code varies in a granularity of K2·B·N symbols, K2 being a positive integer greater than or equal to 1, and B being a number of symbols contained in a transport block.

[0068] With reference to the fourth aspect, in a possible implementation manner, the type of the disabled orthogonal cover code is an orthogonal cover code before discrete Fourier transform spreading within a symbol; and the transceiver is further configured to send fourth information, the fourth information being used to indicate that the target orthogonal cover code varies in a granularity of K3 symbols, K3 being a positive integer greater than or equal to 1.

[0069] A fifth aspect provides an apparatus, including a processor and a storage medium, the storage medium storing instructions that, when executed by the processor, cause the method in the first aspect or any possible implementation manner of the first aspect to be implemented, or cause the method in the second aspect or any possible implementation manner of the second aspect to be implemented.

[0070] A sixth aspect provides an apparatus, including processing circuitry, the processing circuitry being configured to process data and / or information, so that the method in the first aspect or any possible implementation manner of the first aspect is implemented, or the method in the second aspect or any possible implementation manner of the second aspect is implemented.

[0071] The processing circuitry can include one or more processors, or all or part of circuitry for controlling or processing functions in the one or more processors.

[0072] Optionally, the apparatus can further include a memory for storing a program or instructions, and the processor is configured to execute the program or instructions to cause the method in the first aspect or any possible implementation of the first aspect to be implemented, or to cause the method in the second aspect or any possible implementation of the second aspect to be implemented.

[0073] Optionally, the apparatus can further include the transceiver circuit, or the input / output interface.

[0074] In a seventh aspect, a chip is provided, including a processing circuit configured to execute a program or instructions to cause the method in the first aspect or any possible implementation of the first aspect to be implemented, or to cause the method in the second aspect or any possible implementation of the second aspect to be implemented.

[0075] Optionally, the chip can further include a memory for storing the program or instructions.

[0076] Optionally, the chip can further include the transceiver circuit, or the input / output interface.

[0077] In an eighth aspect, a computer readable storage medium is provided, including instructions, when the instructions are executed by a processor, causing the method in the first aspect or any possible implementation of the first aspect to be implemented, or causing the method in the second aspect or any possible implementation of the second aspect to be implemented.

[0078] In a ninth aspect, a computer program product is provided, including computer program code or instructions, when the computer program code or instructions are executed, causing the method in the first aspect and any possible implementation of the first aspect to be implemented, or causing the method 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, including the apparatus in the first or second aspect and any possible implementation of the first or second aspect. BRIEF DESCRIPTION OF DRAWINGS

[0080] FIG. 1 is a schematic diagram of a scenario to which the technical solution of the present application can be applied;

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

[0082] FIG. 3 shows a schematic diagram of a processing procedure of inter-slot OCC;

[0083] FIG. 4 shows a schematic diagram of inter-slot OCC processing with OCC of length 2;

[0084] FIG. 5 shows a schematic diagram of a processing procedure of inter-symbol OCC;

[0085] FIG. 6 shows a schematic diagram of inter-symbol OCC processing with OCC of length 2;

[0086] FIG. 7 shows a schematic diagram of a processing procedure of intra-symbol OCC;

[0087] FIG. 8 is a flowchart of a communication method according to an embodiment of the present application;

[0088] FIG. 9, FIG. 10, FIG. 12 and FIG. 14 show schematic diagrams of several frequency hopping patterns;

[0089] FIG. 11, FIG. 13 and FIG. 15 show schematic diagrams of target OCCs used by a neighboring cell at different times;

[0090] FIG. 16 is a schematic diagram of a communication apparatus according to an embodiment of the present application;

[0091] FIG. 17 is a schematic diagram of a communication apparatus according to another embodiment of the present application. DETAILED DESCRIPTION

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

[0093] Before introducing the communication method and related apparatus provided by embodiments of the present application, the following points are explained first.

[0094] First, in the present application, the use of prefixes such as "first", "second" and the like is merely for the convenience of distinguishing and describing different things belonging to the same name category, and does not constrain the order, size or quantity of the things. For example, "first information" and "second information" are merely different information, and there is no time sequence, size relationship or priority relationship between them.

[0095] Second, in the present application, "sending" and "receiving" represent the direction of signal transmission. For example, "sending first information to a terminal" can be understood as that the destination of the first information is the terminal, which can include direct transmission through the air interface, or indirect transmission through the air interface by other units or modules. "Receiving first information from a network device" can be understood as that the source of the first information is the network device, which can include direct reception from the network device through the air interface, or indirect reception from the network device through the air interface from other units or modules. "Sending" can also be understood as "output" of a chip interface, and "receiving" can also be understood as "input" of a chip interface.

[0096] In other words, the sending and receiving can be between devices, such as between a network device and a terminal device, or can be within a device, such as between components, modules, chips, software modules or hardware modules within the device through a bus, a wire or an interface.

[0097] Thirdly, in the present application, "at least one" means one or more, and "multiple" means two or more. The "and / or" describes the association between the associated objects, which means that there can be three relationships, for example, A and / or B can represent the following cases: A exists alone, A and B exist together, and B exists alone, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects before and after it, but does not rule out the case that the associated objects before and after it represent an "and" relationship. The specific meaning can be understood in combination with the context. "At least one of the following" or similar expressions means any combination of these items, including any combination of single or multiple items. For example, at least one of a, b or c can represent: a, b, c; a and b; a and c; b and c; or a and b and c. Where a, b, and c can be single or multiple.

[0098] Fourthly, in the present application, the indication includes direct indication (also known as explicit indication) and indirect indication (also known as implicit indication). Among them, the direct indication of information A means including the information A; the indirect indication of information A can mean indicating the information A by the corresponding relationship between the information A and the information B and directly indicating the information B; or indicating the information A by the preset rule that can be used to determine A according to B and directly indicating the information B. The corresponding relationship between the information A and the information B and the preset rule can be pre-defined, pre-stored, pre-burned or pre-configured.

[0099] Fifthly, in the embodiments of the present application, "when", "if" and "when" all mean that the device will make corresponding processing under certain objective circumstances, not limited to time, and does not require the device to have a judgment action when it is implemented. It also does not mean that there are other limitations.

[0100] Sixthly, in order to facilitate understanding, the method provided by the present application is described by a plurality of drawings in the present application, and these drawings are only examples and should not constitute any limitation on the present application. For example, the order of the steps shown in the drawings can be simply changed according to their functions and internal logic; for example, the steps in the drawings can be executed in whole or in part, as long as the same function as in the embodiments of the present application can be realized.

[0101] Seventh, in the present application, the word "example", "exemplary", "for example", or "such as" is used to represent an example, an example, or an illustration. Any embodiment or design scheme described as "example", "exemplary", "for example", or "such as" in the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the use of "example", "exemplary", "for example", or "such as" is intended to present the relevant concept in a specific way.

[0102] Figure 1 is a schematic diagram of the architecture of a communication system 10 according to an embodiment of the present application. It can be understood that the system architecture described in the embodiments of the present application is for more clearly illustrating the technical solutions of the embodiments of the present application, and does not constitute a limitation on the technical solutions provided by the embodiments of the present application.

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

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

[0105] The RAN node 110, which can also be referred to as an access network device, a RAN entity, or an access node, etc., forms part of the communication system, and is configured to facilitate the wireless access by the terminals. The RAN nodes 110 in the communication system 10 can be of the same type or can be of different types. In some scenarios, the roles of the RAN node 110 and the terminal 120 are relative, e.g., the network element 120i in Figure 1 can be a helicopter or a drone, which can be configured to move as a mobile base station, and for a terminal 120j accessing the RAN 100 via the network element 120i, the network element 120i is a base station; but for the base station 110a, the network element 120i is a terminal. The RAN nodes 110 and the terminals 120 are sometimes referred to as communication devices, e.g., the network elements 110a and 110b in Figure 1 can be understood as communication devices with base station functionalities, and the network elements 120a-120j can be understood as communication devices with terminal functionalities.

[0106] In a 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, etc. The RAN node can be a macro base station (e.g., 110a in Figure 1), a micro base station or an indoor station (e.g., 110b in Figure 1), a relay node or a donor node, or a wireless controller in a CRAN scenario. Optionally, the RAN node can also be a server, a wearable device, a vehicle or a vehicle-mounted device, etc. For example, the access network device in vehicle to everything (V2X) technology can be a road side unit (RSU). All or part of the functions of the RAN node in this application can also be implemented by software functions running on hardware, or by virtualized functions instantiated on a platform (e.g., a cloud platform). The RAN node can also be provided with a communication module, circuit or chip for performing corresponding communication functions, and program instructions for performing corresponding communication functions. The RAN node in this application can also be a logical node, a logical module or software that can implement all or part of the functions of the RAN node.

[0107] In another possible scenario, a terminal is assisted by multiple RAN nodes to implement wireless access, and different RAN nodes respectively implement part of functions of a base station. For example, a RAN node can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU can be separately arranged, or can also be included in the same network element, for example, in a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, for example, included in a remote radio unit (RRU), an active antenna processing unit (AAU), or a remote radio head (RRH).

[0108] In different systems, the CU (or CU-CP and CU-UP), DU or RU can also have different names, but those skilled in the art can understand their meanings. For example, in an ORAN system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, the CU-CP can also be referred to as an O-CU-CP, the CU-UP can also be referred to as an O-CU-UP, and the RU can also be referred to as an O-RU. For the convenience of description, the CU, CU-CP, CU-UP, DU and RU are taken as examples for description in this application. Any one of the CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0109] A terminal can be a device or module with corresponding communication functions and can access the above-mentioned communication system. The terminal can also be referred to as a terminal device, a user equipment (UE), a mobile station, a mobile terminal, etc. The terminal can be widely applied to various scenarios, such as device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-type communication (MTC), internet of things (IOT), virtual reality, augmented reality, industrial control, automatic driving, remote medical treatment, smart power grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. The terminal can be a mobile phone, a tablet computer, a computer with wireless transceiver function, a wearable device, a vehicle, a drone, a helicopter, an airplane, a ship, a robot, a mechanical arm, a smart home device, a transport vehicle with wireless communication function, a communication module, etc. Embodiments of the present application do not limit the device form of the terminal. The terminal is usually provided with a communication module, circuit or chip for executing corresponding communication functions. The terminal is also configured with program instructions for executing corresponding communication functions.

[0110] Exemplarily, FIG. 2 is a schematic diagram showing an architecture of an access network device. The access network device can be divided according to a protocol stack, for example, in one division manner, the protocol stack of the access network device can include a physical (PHY) layer and a media access control (MAC) layer. Optionally, the protocol stack of the access network device can further include a radio link control (RLC) layer, a packet data convergence protocol (PDCP) layer, a service data adaptation protocol (SDAP) layer, a radio resource control (RRC) layer, etc. Each protocol layer can include one or more functional modules for implementing signal processing.

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

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

[0113] Currently, in some communication scenarios, for example, non-terrestrial network (NTN) scenarios, the link budget of the terminal is poor. Therefore, in order to ensure correct demodulation of data, one implementation is to repeat the uplink data sent by the terminal device. However, the increase in the number of repetitions will lead to a decrease in the resource utilization of the system, and in turn, a decrease in the system capacity.

[0114] In order to improve the system capacity, an implementation is proposed to multiplex the data of multiple terminals on the same time-frequency resource based on OCC that is mutually orthogonal.

[0115] For example, the length of the OCC is L, the data to be sent by UE1 is s1, the data to be sent by UE2 is s2, the OCC1 used by UE1 is {a1,..., aL}, the OCC2 used by UE2 is {b1,..., bL}, OCC1 and OCC2 are orthogonal to each other, UE1 obtains {a1*s1,..., aL*s1} based on OCC1 and sends on time-frequency resource 1, UE2 obtains {b1*s2,..., bL*s2} based on OCC2 and sends on time-frequency resource 1, it can be understood that {a1*s1,..., aL*s1} can be understood as spreading s1, and 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-frequency resource 1 based on OCC1 and obtain the data sent by UE2 on time-frequency resource 1 based on OCC2.

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

[0117] For example, a 2-row 2-column Walsh-Hadamard matrix is denoted as H2,

[0118] For example, a 4-row 4-column Walsh-Hadamard matrix is denoted as H4,

[0119] For example, an 8-row 8-column Walsh-Hadamard matrix is denoted as H8,

[0120] For example, a 2-row 2-column DFT matrix is denoted as F2,

[0121] For example, a 4-row 4-column DFT matrix is denoted as F4,

[0122] For example, an 8-row 8-column DFT matrix is denoted as F8,

[0123] For example, a 3-row 3-column DFT matrix is denoted as Z3,

[0124] For example, a 6-row 6-column Zadoff-Chu matrix is denoted as Z6,

[0125] It can be understood that each row in the matrix of the above example represents a sequence, and any two rows are orthogonal to each other (that is, the inner product of any two rows is 0).

[0126] In addition, it can be understood that the OCC can also be obtained from the matrix obtained after exchanging any two rows and / or two columns of the above matrix.

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

[0128] The above introduces several ways to obtain OCC. Next, three implementation manners based on OCC processing are introduced.

[0129] Implementation manner 1: inter-slot OCC

[0130] The data obtained by performing transform precoding on the modulation symbols corresponding to one time slot is processed based on OCC.

[0131] For example, the data obtained by performing transform precoding on the modulation symbols corresponding to one time slot is denoted as y(x), and the data processed by OCC is denoted as z(x). As shown in FIG. 3, the modulation symbols obtained after encoding, scrambling and modulation are {x0, x1, …}, and {x0, x1, …} is obtained after DFT. At this time, the data obtained by performing DFT on the modulation symbols corresponding to each time slot can be processed based on inter-slot OCC to obtain {z0, z1, …}.

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

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

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

[0135] For example, FIG. 4 shows a schematic diagram of data obtained after processing by inter-slot OCC. As shown in FIG. 4, the length of OCC is 2, and OCC includes w0 and w1. The terminal multiplies data obtained after transform precoding of modulation symbols corresponding to one slot by w0 and w1, respectively.

[0136] Implementation 2, Inter-symbol OCC

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

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

[0139] wherein, represents the number of RBs allocated for PUSCH, represents the number of subcarriers per RB, represents the length of OCC.

[0140] For example, FIG. 6 shows a schematic diagram of data obtained after processing by inter-slot OCC. As shown in FIG. 6, the length of OCC is 2, and OCC includes w0 and w1. The terminal multiplies data obtained after transform precoding of 6 modulation symbols as granularity by w0 and w1, respectively.

[0141] Implementation 3, Inter-symbol OCC

[0142] Each modulation symbol is processed based on OCC before transform precoding. For example, as shown in FIG. 7, modulation symbols obtained after encoding, scrambling, and modulation are {d0, d1, …}. At this time, M modulation symbols can be processed based on inter-symbol OCC to obtain {x0, x1, …}, and then {x0, x1, …} is processed by DFT or the like. symb

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

[0144] wherein, ​indicates the number of subcarriers of the PUSCH allocation, indicates the number of RBs of the PUSCH allocation, indicates the number of subcarriers of each RB, indicates the OCC length, M symb indicates the number of modulation symbols.

[0145] For example, assuming that the OCC length is 2 and the OCC includes w0 and w1, as shown in FIG. 7, the terminal multiplies 6 modulation symbols with w0 and w1 respectively.

[0146] The OCC hopping can reduce the probability that the terminals of two cells always use the same OCC, thereby reducing the inter-cell interference. The OCC hopping refers to that the OCC used by the terminal when transmitting data can change. The terminals of two cells using the same OCC is also referred to as the OCC used by the terminals of two cells colliding.

[0147] For example, taking cell 1 and cell 2 as an example, if terminal 1 in cell 1 always uses OCC1 to transmit data and terminal 2 in cell 2 also always uses OCC1 to transmit data, at this time, the OCCs used by terminal 1 and terminal 2 always collide, causing the cells 1 and 2 to interfere with each other. However, if the OCC used by terminal 1 changes to OCC2 at the next time and the OCC used by terminal 2 at the next time is still OCC1, at this time, the OCCs used by terminal 1 and terminal 2 are avoided from always colliding, thereby reducing the inter-cell interference.

[0148] However, it is found through analysis that even if the OCC hopping scheme is used, the following problem can still occur: for the terminals before REL-19, the protocol stipulates that the OCC based on all 1 is used for repeated transmission, and therefore, when the OCC hopping scheme is used, there is a problem that the repeated transmission of the terminals before REL-19 can be interfered.

[0149] Therefore, the present application provides a communication method and a communication device to reduce the interference to the repeated transmission of the terminals before REL-19.

[0150] The communication method provided by the embodiments of the present application is described below with reference to the drawings. It can be understood that the network device and the terminal are taken as examples of the execution subject of the interaction in the present application, but the present application is not limited to the execution subject of the interaction. For example, the method performed by the network device in the present application can also be implemented by a module (such as a circuit, a chip or a chip system, etc.) in the network device, or a logical node, a logical module or software capable of implementing all or part of the functions of the network device; the method performed by the terminal in the present application can also be implemented by a communication module in the terminal or a circuit or a chip (such as a modem chip (also known as a baseband chip), or a SoC chip containing a modem core, or a SIP chip) responsible for the communication function in the terminal.

[0151] FIG. 8 is a schematic flowchart of the communication method provided by the present application. As shown in FIG. 8, the method comprises:

[0152] In step 810, the terminal acquires a target OCC, which is obtained according to the disabled OCC.

[0153] In step 820, the terminal transmits data according to the target OCC; correspondingly, the network device receives data based on the target OCC.

[0154] In the present application, the OCC is also referred to as an orthogonal cover code. Correspondingly, the disabled OCC can be referred to as a disabled OCC, and the target OCC can be referred to as a target OCC. Hereinafter, for the convenience of description, the OCC is referred to as an OCC.

[0155] The above-mentioned disabled OCC can be replaced by a deactivated OCC, a first OCC, etc., and the present application does not limit this. The disabled OCC can also be understood as an OCC used when the terminal does not perform OCC hopping.

[0156] In an implementation manner, the network device can perform step 810-a: transmitting first information to the terminal, wherein the first information comprises an index of the disabled OCC. Correspondingly, the terminal acquires the disabled OCC from a target matrix based on the index of the OCC. The target matrix can be, for example, a Walsh-Hadamard matrix, a DFT matrix or a Zadoff-Chu matrix. Illustratively, the target matrix can be indicated to the terminal by the access network device or can also be predefined.

[0157] For example, taking the 2-row 2-column Walsh-Hadamard matrix in the foregoing as an example, if the first information indicates the index 0, it indicates that the disabled OCC is [1, 1]; if the first information indicates the index 1, it indicates that the disabled OCC is [1, -1].

[0158] For example, taking the 8-row 8-column Walsh-Hadamard matrix in the foregoing as an example, if the first information indicates index 0, the OCC to be disabled is [1, 1, 1, 1, 1, 1, 1, 1]; if the first information indicates index 7, the OCC to be disabled is [1, -1, -1, 1, -1, 1, 1, -1].

[0159] For example, taking the 3-row 3-column Walsh-Hadamard matrix in the foregoing as an example, if the first information indicates index 0, the OCC to be disabled is [1, e j4π / 3 , 1]; if the first information indicates index 2, the OCC to be disabled is [1, 1, e j4π / 3 ].

[0160] The target OCC can be replaced by an activated OCC, an enabled OCC, a second OCC, and the like, and the application does not make any limitation in this regard. In the application, the target OCC can be obtained based on the disabled OCC. Specifically, the implementation manner of obtaining the target OCC based on the disabled OCC is as follows: if all the 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 sending data; or, if the elements corresponding to the disabled OCC are not all 1, the target OCC changes according to the time of sending data and the elements corresponding to the target OCC are not all 1.

[0161] The target OCC changing according to the time of sending data can also be replaced by the target OCC jumping according to the time of sending data, or the target OCC jumping with the time of sending data.

[0162] That is to say, in the application, when the elements included in the disabled OCC are all 1, the terminal always uses the disabled OCC to send data. When the elements included in the disabled OCC are not all 1, the target OCC used by the terminal to send data will jump but not jump to all 1, that is, when the elements included in the disabled OCC are not all 1, the target OCC used by the terminal to send data will jump but will avoid the OCC of all 1 when jumping.

[0163] For example, taking the 4-row 4-column Walsh-Hadamard matrix in the foregoing as an example, if the disabled OCC is [1, 1, 1, 1], the terminal always sends data based on [1, 1, 1, 1]. If the disabled OCC is [1, -1, 1, -1], the target OCC used by the terminal to send data is obtained based on [1, -1, 1, -1] and will jump over time, for example, the target OCC used at the current time is [1, -1, 1, -1] and the target OCC used at another time is [1, 1, -1, -1].

[0164] It can be understood that the terminal transmitting data according to the target OCC includes that the terminal transmits data between interfaces in the terminal according to the target OCC.

[0165] It is explained herein that the target OCC is based on time hopping of transmitting data, and the embodiments of the present application do not limit the hopping granularity.

[0166] For example, in an implementation, the type of the disabled OCC is inter-slot OCC, and the OCC can be hopped with K1*N slots as a granularity, K1 being a positive integer greater than or equal to 1. Correspondingly, in this implementation, the terminal obtaining the target OCC includes obtaining the target OCC with K1*N slots as a granularity. Optionally, the network device sends second information to the terminal, and the second information is used to indicate that the target OCC changes with K1*N slots as a granularity.

[0167] For example, in an implementation, the type of the disabled OCC is inter-symbol OCC, and the OCC can be hopped with K2*B*N symbols as a granularity, K2 being a positive integer greater than or equal to 1, and B being the number of symbols contained in a transport block. Correspondingly, in this implementation, the terminal obtaining the target OCC includes obtaining the target OCC with K2*B*N symbols as a granularity. Optionally, the network device sends third information to the terminal, and the third information is used to indicate that the target OCC changes with K2*B*N symbols as a granularity.

[0168] For example, in an implementation, the type of the disabled OCC is pre-DFT OCC in a symbol, and the OCC can be hopped with K3 symbols as a granularity, K3 being a positive integer greater than or equal to 1. Correspondingly, in this implementation, the terminal obtaining the target OCC includes obtaining the target OCC with K3 symbols as a granularity. Optionally, the network device sends fourth information to the terminal, and the fourth information is used to indicate that the target OCC changes with K3 symbols as a granularity.

[0169] Next, three implementation schemes of obtaining the target OCC according to the disabled OCC are described.

[0170] Before introducing the three implementation schemes, the following is described first: the index of the disabled OCC is denoted as m0, the length of the disabled OCC is denoted as N, and the index of the target OCC is denoted as m, so that:

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

[0172] In the first implementation scheme, when the index of the disabled OCC is 0, that is, m0=0, the corresponding elements of the disabled OCC are all 1. When the index of the disabled OCC is not 0, that is, m0≠0, the corresponding elements of the disabled OCC are not all 1.

[0173] For example, for a Walsh-Hadamard matrix, a DFT matrix, when m0=0, the corresponding disabled OCC includes elements all of which are 1. When m0≠0, it can be considered that the corresponding disabled OCC includes elements not all of which are 1.

[0174] In the first implementation, if the corresponding elements of the disabled OCC are not all 1, the target OCC is obtained based on the disabled OCC and . denotes a value determined based on and l, l denotes a first symbol in a slot, and denotes a first slot number in the slot numbers corresponding to the target OCC when the subcarrier spacing configuration is μ, and l denotes a symbol index of a first symbol in the symbols corresponding to the target OCC in the slot. For example, the first slot number is a starting slot number in the slot numbers corresponding to the target OCC.

[0175] For example, the first symbol is a starting symbol in the symbols corresponding to the target OCC.

[0176] In an implementation, the target OCC satisfies the following formula:

[0177] wherein i takes 0 to I-1, and I is a positive integer. denotes a number of symbols contained in a slot, c(·) denotes a Gold sequence, c(·) is associated with a cell identifier or a scrambling identifier, and I is a positive integer.

[0178] Optionally, I takes 8. That is, satisfies the following formula:

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

[0180] For example, the cell identifier is denoted as the scrambling identifier is denoted as a sequence initialized based on the cell identifier or the scrambling identifier is denoted as c init . 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.

[0182] Exemplarily, FIG. 9 shows a kind of hopping pattern schematic diagram when the OCC of length 4 carries out the first kind of implementation hopping. As shown in (a) of FIG. 9, 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 hop to the target OCC with index 3 to send data; the terminal corresponding to the disabled OCC with index 2 can hop to the target OCC with index 1 to send data; and the terminal corresponding to the disabled OCC with index 3 can hop to the target OCC with index 2 to send data.

[0183] Exemplarily, FIG. 10 shows a kind of hopping pattern schematic diagram when the OCC of length 8 carries out the first kind of implementation hopping. As shown in FIG. 10, 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 hop to the target OCC with index 3 to send data; the terminal corresponding to the disabled OCC with index 2 can hop to the target OCC with index 4 to send data; the terminal corresponding to the disabled OCC with index 3 can hop to the target OCC with index 5 to send data; the terminal corresponding to the disabled OCC with index 4 can hop to the target OCC with index 6 to send data; the terminal corresponding to the disabled OCC with index 5 can hop to the target OCC with index 7 to send data; the terminal corresponding to the disabled OCC with index 6 can hop to the target OCC with index 1 to send data; and the terminal corresponding to the disabled OCC with index 7 can hop to the target OCC with index 2 to send data.

[0184] It can be understood that FIG. 9 only shows one hopping pattern of OCC with length 4, and FIG. 10 only shows one hopping pattern of OCC with length 8. It can be understood that when the above formula (1) is used, there are N-1 hopping patterns in total. For example, when N is equal to 4, there are 3 hopping patterns in total. When N is equal to 8, there are 7 in total.

[0185] For example, when N is equal to 4, another possible hopping pattern is shown in (b) of FIG. 9. As shown in (b) of FIG. 9, the terminal corresponding to the disabled OCC with index 0 always uses the OCC with index 0 to transmit data; the terminal corresponding to the disabled OCC with index 1 can hop to the target OCC with index 2 to transmit data; the terminal corresponding to the disabled OCC with index 2 can hop to the target OCC with index 3 to transmit data; and the terminal corresponding to the disabled OCC with index 3 can hop to the target OCC with index 1 to transmit data.

[0186] It can be understood that in the embodiments of the present application, if c(·) is associated with the cell identifier, then the interference between cells can also be reduced. For example, taking a sequence with length 4 as an example, the hopping process of the OCC of the terminal in two adjacent cells is described.

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

[0188] In cell 1, the target OCC used by the terminal corresponding to the disabled OCC with index 0 is [1, 1, 1, 1], the target OCC used by the terminal corresponding to the disabled OCC with index 1 is [1, j, -1, -j], the target OCC used by the terminal corresponding to the disabled OCC with index 2 is [1, -1, 1, -1], and the target OCC used by the terminal corresponding to the disabled OCC with index 3 is [1, -j, -1, j]. Similarly, in cell 2, the target OCC used by the terminal corresponding to the disabled OCC with index 0 is [1, 1, 1, 1], the target OCC used by the terminal corresponding to the disabled OCC with index 1 is [1, j, -1, -j], the target OCC used by the terminal corresponding to the disabled OCC with index 2 is [1, -1, 1, -1], and the target OCC used by the terminal corresponding to the disabled OCC with 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 (a) of FIG. 12, a diagram of a hopping pattern is shown when OCCs of length 4 hop. As shown in (a) of FIG. 12, a terminal corresponding to a disabled OCC of index 1 can hop to a target OCC of index 3 when transmitting data; a terminal corresponding to a disabled OCC of index 3 can hop to a target OCC of index 1 when transmitting data.

[0198] Referring to (b) of FIG. 12, a diagram of a hopping pattern is shown when OCCs of length 8 hop. As shown in (b) of FIG. 12, a terminal corresponding to a disabled OCC of index 1 can hop to a target OCC of index 3 when transmitting data; a terminal corresponding to a disabled OCC of index 2 can hop to a target OCC of index 6 when transmitting data; a terminal corresponding to a disabled OCC of index 3 can hop to a target OCC of index 1 when transmitting data; a terminal corresponding to a disabled OCC of index 5 can hop to a target OCC of index 7 when transmitting data; a terminal corresponding to a disabled OCC of index 6 can hop to a target OCC of index 2 when transmitting data; a terminal corresponding to a disabled OCC of index 7 can hop to a target OCC of index 5 when transmitting data.

[0199] As can be seen, in the example of FIG. 12, for OCCs of length 4, a terminal corresponding to a disabled OCC of index 2 does not hop. For OCCs of length 8, a terminal corresponding to a disabled OCC of index 4 does not hop. In general, if the length N of the OCC is even, a terminal corresponding to a disabled OCC of index N / 2 does not hop over time.

[0200] It can be understood that FIG. 12 only shows one hopping pattern for OCCs of length 4 and 8. It can be understood that when the above formula (two) is used, there are a total of kinds of frequency hopping patterns. For example, when N is equal to 4, there are a total of 2 frequency hopping patterns. When N is equal to 8, there are a total of 4.

[0201] Next, taking a sequence of length 4 associated with a cell identifier c(·) as an example, the hopping process of the OCCs of terminals in two adjacent cells is described.

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

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

[0204] At time 2:

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

[0206] It can be seen that, by the above manner, the probability that the four terminals in cell 1 and the four terminals in cell 2 always collide is avoided, and thus the interference between cell 1 and cell 2 is reduced.

[0207] In a third implementation: the target OCC and the disabled OCC satisfy the following formula (three):

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

[0209] wherein, The meaning and implementation manner of A can refer to the description in Embodiment 1, which will not be described herein again. In this third embodiment, A represents a full permutation matrix of (N-1)! x (N-1) dimensions, represents an element in the m0th column of the mth row in A. represents an element in the m0th column of the mth row in A.

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

[0211] For example, the OCC with a length of 4 corresponds to a full permutation matrix of 6 x 3 dimensions

[0212] Referring to (a) in FIG. 14, a diagram of a hopping pattern when the OCC with a length of 4 hops is shown. As shown in (a) in FIG. 14, the terminal corresponding to the disabled OCC with an index of 1 can hop to the target OCC with an index of 2 to transmit data; the terminal corresponding to the disabled OCC with an index of 2 can hop to the target OCC with an index of 3 to transmit data; and the terminal corresponding to the disabled OCC with an index of 3 can hop to the target OCC with an index of 1 to transmit data.

[0213] Referring to (b) in FIG. 14, a diagram of a hopping pattern when the OCC with a length of 8 hops is shown. As shown in (b) in FIG. 14, the terminal corresponding to the disabled OCC with an index of 0 always uses the disabled OCC with an index of 0 to transmit data; the terminal corresponding to the disabled OCC with an index of 1 can hop to the target OCC with an index of 4 to transmit data; the terminal corresponding to the disabled OCC with an index of 2 can hop to the target OCC with an index of 6 to transmit data; the terminal corresponding to the disabled OCC with an index of 3 can hop to the target OCC with an index of 2 to transmit data; the terminal corresponding to the disabled OCC with an index of 4 can hop to the target OCC with an index of 7 to transmit data; the terminal corresponding to the disabled OCC with an index of 5 can hop to the target OCC with an index of 1 to transmit data; the terminal corresponding to the disabled OCC with an index of 6 can hop to the target OCC with an index of 5 to transmit data; and the terminal corresponding to the disabled OCC with an index of 7 can hop to the target OCC with an index of 3 to transmit data.

[0214] It can be understood that Figure 14 only shows one hopping pattern of OCC with length of 4 and 8. It can be understood that when the above formula (three) is used, there are (N-1)! hopping patterns in total. For example, when N equals 4, there are 6 hopping patterns in total.

[0215] Next, taking a sequence with length of 4 and associated with cell identification c(·) as an example, the hopping process of OCC of terminals in two adjacent cells is described.

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

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

[0218] At time 2:

[0219] In cell 1, the target OCC used by the terminal corresponding to the disabled OCC with index 0 is still [1, 1, 1, 1], the target OCC used by the terminal corresponding to the disabled OCC with index 1 is hopped to [1, -1, 1, -1], the target OCC used by the terminal corresponding to the disabled OCC with index 2 is hopped to [1, -j, -1, j], and the target OCC used by the terminal corresponding to the disabled OCC with index 3 is hopped to [1, j, -1, -j]. As for the terminals in another cell 2, the target OCC used by the terminal corresponding to the disabled OCC with index 0 is still [1, 1, 1, 1], the target OCC used by the terminal corresponding to the disabled OCC with index 1 is hopped to [1, j, -1, -j], the target OCC used by the terminal corresponding to the disabled OCC with index 2 is hopped to [1, -j, -1, j], and the target OCC used by the terminal corresponding to the disabled OCC with index 3 is hopped to [1, -1, 1, -1].

[0220] It can be seen that, by the above manner, the probability that the four terminals in the cell 1 and the four terminals in the cell 2 always collide is avoided, and thus the interference between the cell 1 and the cell 2 is reduced.

[0221] The above describes three implementation solutions of obtaining the target OCC based on the disabled OCC. It can be understood that, in the three implementation solutions, the third implementation solution can provide more frequency hopping patterns compared with the first implementation solution and the second implementation solution.

[0222] The communication method of the embodiments of the present application is described in detail above. The communication apparatus provided by the embodiments of the present application will be described in detail below with reference to FIG. 16 and FIG. 17.

[0223] FIG. 16 is a structural schematic diagram of the communication apparatus provided by the embodiments of the present application. Specifically, as shown in FIG. 16, the apparatus 1600 includes a processing module 1601 and a transceiver module 1602.

[0224] For example, the apparatus 1600 can be a terminal device. Alternatively, the apparatus 1600 can be a component in a terminal device, for example, the apparatus 1600 is a chip in a terminal device.

[0225] Specifically, the processing module 1601 is configured to obtain a target OCC, the target OCC being obtained based on a disabled OCC; and the transceiver module 1602 is configured to transmit data according to the target OCC. If all the 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 transmitting data. Alternatively, if the elements corresponding to the disabled OCC are not all 1, the target OCC changes according to the time of transmitting data and the elements corresponding to the target OCC are not all 1.

[0226] Optionally, if the elements corresponding to the disabled OCC are not all 1, the target OCC and the disabled OCC satisfy the following relationship:

[0227] wherein m0 represents the index of the disabled OCC, m represents the index of the target OCC, N represents the length of the disabled OCC, and l represents the first symbol index of the first symbol in the target OCC corresponding to the symbol. represents a value determined based on and l, and represents the first slot number in the slot number corresponding to the target OCC when the subcarrier spacing configuration is μ, l represents the symbol index of the first symbol in the slot, N is the length of the disabled OCC, and m represents the index of the target OCC. and the cell identifier or the scrambling identifier.

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

[0229] 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, 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] 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 disabled orthogonal cover code is an inter-slot orthogonal cover code; the processing module 1601 is further configured to obtain the target orthogonal cover code in a granularity of K1*N slots, where K1 is a positive integer greater than or equal to 1.

[0236] Optionally, the type of the disabled orthogonal cover code is an inter-symbol orthogonal cover code; the processing module 1601 is further configured to obtain the target orthogonal cover code in 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 included in a transport block.

[0237] Optionally, the type of the disabled orthogonal cover code is an intra-symbol discrete Fourier transform spread pre-orthogonal cover code; the processing module 1601 is further configured to obtain the target orthogonal cover code in a granularity of K3 symbols, where K3 is a positive integer greater than or equal to 1.

[0238] Optionally, the transceiver module 1602 is further configured to receive first information, where the first information is used to indicate the disabled orthogonal cover code.

[0239] Optionally, the first information includes an index of the disabled orthogonal cover code.

[0240] Optionally, in the second apparatus embodiment, the apparatus 1600 is applied to a network device. For example, the apparatus 1600 can be a network device. Alternatively, the apparatus 1600 can be a component in a network device, for example, the apparatus 1600 is a chip in a network device.

[0241] Specifically, the transceiver module 1602 is configured to send first information, where the first information is used to indicate the disabled orthogonal cover code; the transceiver module 1602 is further configured to receive data based on a target orthogonal cover code, where the target orthogonal cover code is obtained based on the disabled orthogonal cover code; and 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 change according to a time of sending the data; or if the elements corresponding to the disabled orthogonal cover code are not all 1, the target orthogonal cover code changes according to the time of sending the data and the elements corresponding to the target orthogonal cover code are not all 1.

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

[0243] where m0 represents an index of the disabled orthogonal cover code, represents a value determined based on m0 and l, and 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] denotes a number of symbols contained in a slot, c(·) denotes a Gold sequence, c(·) is associated with a cell identity or a scrambling identity, i takes values from 0 to I-1, I is a positive integer.

[0250] Optionally, I takes 8.

[0251] Optionally, the type of the disabled orthogonal cover code is an inter-slot orthogonal cover code; the transceiver 1602 is further configured to send second information, the second information being used to indicate that the target orthogonal cover code varies in a granularity of K1*N slots, K1 being a positive integer greater than or equal to 1.

[0252] Optionally, the type of the disabled orthogonal cover code is an inter-symbol orthogonal cover code; the transceiver 1602 is further configured to send third information, the third information being used to indicate that the target orthogonal cover code varies in a granularity of K2*B*N symbols, K2 being a positive integer greater than or equal to 1, and B being a number of symbols contained in a transport block.

[0253] Optionally, the type of the disabled orthogonal cover code is an intra-symbol discrete Fourier transform spread pre-orthogonal cover code; the transceiver 1602 is further configured to send fourth information, the fourth information being used to indicate that the target orthogonal cover code varies in a granularity of K3 symbols, K3 being a positive integer greater than or equal to 1.

[0254] FIG. 17 is a structural schematic diagram of another communication device provided by an embodiment of the present application. The device shown in FIG. 17 can be used to execute the method described in any one of the preceding embodiments.

[0255] As shown in FIG. 17, the device 1700 of the present embodiment includes a memory 1701 and a processor 1702. In an implementation manner, the device 1700 further includes a communication interface 1703 and a bus 1704. The memory 1701, the processor 1702, and the communication interface 1703 are communicatively connected with each other through 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 a program, and when the program stored in the memory 1701 is executed by the processor 1702, the processor 1702 is configured to execute each step of the method shown in FIG. 8.

[0257] The processor 1702 can be a general purpose central processing unit (CPU), a microprocessor, an application specific integrated circuit (ASIC), or one or more integrated circuits configured to perform the methods described in this application, and to implement the functions described in this application.

[0258] The processor 1702 can also be an integrated circuit chip on which one or more sets of logic circuits and / or memory for handling signals are fabricated. In implementation, the steps of the method described in this application can be completed by hardware integrated logic circuits or software in the form of instructions in the processor 1702.

[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 device, discrete gate or transistor logic, discrete hardware components. The methods, steps and logic block diagrams disclosed in this application can be implemented or executed by the processor. The general purpose processor can be a microprocessor or the processor can also be a conventional processor.

[0260] The steps of the method disclosed in this application can be directly embodied as hardware code processing executed by a code processor, or executed by a combination of hardware and software modules in the code processor. The software module can be located in a random access memory, a flash memory, a read only memory, a programmable read only memory or an electrically erasable programmable memory, a register, or other mature storage medium in the art. The storage medium is located in the storage 1701, and the processor 1702 reads the information in the storage 1701, and combines the hardware to complete the functions required by the units included in the device of this application, for example, the steps / functions of the embodiment shown in FIG. 8 can be executed.

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

[0262] The bus 1704 can include a path for transmitting information between the various components (for example, the storage 1701, the processor 1702, the communication interface 1703) of the device 1700.

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

[0264] The above-described embodiments can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, the above-described embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, the processes or functions described in the embodiments of the present application are wholly or partially generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another, for example, the computer instructions can be transferred from one website, computer, server, or data center to another via wired (for example, infrared, wireless, microwave, etc.) or wireless means. The computer-readable storage medium can be a computer-accessible medium or a data storage device such as a server, data center, etc. that includes one or more sets of available media. The available media can be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium. The semiconductor medium can be a solid-state disk.

[0265] It should be understood that the term "and / or" herein merely describes the association relationship of the associated objects, which means that there can be three relationships, for example, A and / or B can represent the following three cases: A exists alone, A and B exist together, and B exists alone, where A and B can be singular or plural. In addition, the character " / " herein generally represents that the associated objects before and after it are in an "or" relationship, but it can also represent an "and / or" relationship, which can be understood according to the context before and after it.

[0266] In this application, "at least one" means one or more, and "multiple" means two or more. "At least one of the following" or similar expressions means any combination of these items, including any combination of single or multiple items. For example, at least one of a, b, or c can represent a, b, c, a-b, a-c, b-c, or a-b-c, where a, b, and c can be single or multiple.

[0267] It should be understood that in various embodiments of the present application, the size of the sequence number of the above-described processes does not mean the order of execution, and the execution order of the processes should be determined according to their functions and inherent logic, and should not constitute a limitation on the implementation process of the embodiments of the present application.

[0268] Those skilled in the art can clearly understand that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be realized by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are performed 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 the present application.

[0269] Those skilled in the art can clearly understand that, for the convenience and brevity of the description, the specific working processes of the above-described system, device and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

[0270] In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented in other ways. For example, the above-described device embodiments are only schematic, for example, the division of the units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interface, device or unit, and can be electrical, mechanical or other forms.

[0271] The units described as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, that is, they can be located in one place, or can be distributed on a plurality of network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.

[0272] In addition, each functional unit in each embodiment of the present application can be integrated into a processing unit, or each unit can exist physically, or two or more units can be integrated into one unit.

[0273] If the functions are implemented in the form of software function units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application essentially or the parts that contribute to the prior art or parts of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a plurality of instructions for causing a computer device (which can 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 the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory, a random access memory, a magnetic disk or an optical disk, and various media that can store program codes.

Claims

A communication method characterized by comprising: comprises: obtaining a target OCC based on the disabled OCC; sending data according to the target OCC; wherein, if all elements of 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 sending the data; or, if the elements of the disabled OCC are not all 1, the target OCC changes according to the time of sending the data and the elements of the target OCC are not all 1. The method of claim 1, wherein If the corresponding elements of the disabled orthogonal cover code are not all 1, the target orthogonal cover code and the disabled orthogonal cover code satisfy the following relationship: wherein m0 represents an index of the de- enabled orthogonal cover code, denotes based on and the determined value of I, denotes a first symbol index of a first symbol in a slot, N is a length of the disabled OCC, and m denotes an index of the target OCC, associated with a cell identity or a scrambling identity. The method according to claim 2, characterized in that The target orthogonal cover code and the disabled orthogonal cover code satisfy the following relationship: wherein denotes based on and the determined value of I, denotes a first symbol index of a first symbol in a slot of a time slot number corresponding to the target OCC when a subcarrier spacing configuration is μ, and l denotes a symbol index of a first symbol in a time slot number corresponding to the target OCC, denotes the number of numbers less than N that are coprime to N, denotes the first of the numbers prime to N number, m0denotes an index of the disabled orthogonal cover code, N is a length of the disabled orthogonal cover code, and m denotes an index of the target orthogonal cover code, associated with a cell identity or a scrambling identity. The method according to claim 2, characterized in that If the disabled OCC includes elements that are not all ones, the following relationship is satisfied between the target OCC and the disabled OCC: wherein denotes based on and the determined value of I, denotes a first symbol index of a first symbol in a slot, A denotes a full permutation matrix of (N-1)! x (N-1) dimension, represents the 1st an element of a row m0 and a column m0, m0 denoting an index of the disabled orthogonal cover code, N being a length of the disabled orthogonal cover code, m denoting an index of the target orthogonal cover code, associated with a cell identity or a scrambling identity. The method according to any one of claims 2 to 4, characterized in that satisfies the following relationship: denotes the number of symbols contained in one slot, c(·) denotes a Gold sequence, c(·) is associated with the cell identity or the scrambling identity, i takes values from 0 to I-1, and I is a positive integer. The method according to claim 5, characterized in that I takes 8. The method according to any one of claims 2 to 6, characterized in that The type of the disabled OCC is an inter-slot OCC. The obtaining of the target OCC comprises: obtaining the target OCC with K1·N slots as granularity, K1 being 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 disabled OCC is an inter-symbol OCC. The obtaining of the target OCC comprises: obtaining the target OCC with K2·B·N symbols as granularity, K2 being a positive integer greater than or equal to 1, and B being the number of symbols contained in a transport block. The method according to any one of claims 2 to 6, characterized in that The type of the disabled OCC is a pre-DFT spreading OCC. The obtaining of the target OCC comprises: obtaining the target OCC with K3 symbols as granularity, K3 being 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 comprises: receiving first information, the first information being used to indicate the disabled OCC. The method of claim 10, wherein The first information comprises an index of the disabled OCC. A communication method characterized by comprising: comprises: sending first information, the first information being used to indicate a disabled OCC; receiving data based on a target OCC, the target OCC being obtained based on the disabled OCC; wherein, if all elements of 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 sending the data; or, if the elements of the disabled OCC are not all 1, the target OCC changes according to the time of sending the data and the elements of the target OCC are not all 1. The method of claim 12, wherein If the corresponding elements of the disabled orthogonal cover code are not all 1, the target orthogonal cover code and the disabled orthogonal cover code satisfy the following relationship: wherein m0 represents an index of the de- enabled orthogonal cover code, denotes based on and the determined value of I, denotes a first symbol index of a first symbol in a slot, N is a length of the disabled OCC, and m denotes an index of the target OCC, associated with a cell identity or a scrambling identity. The method of claim 12, wherein The target orthogonal cover code and the disabled orthogonal cover code satisfy the following relationship: wherein denotes based on and the determined value of I, denotes a first symbol index of a first symbol in a slot to which the target OCC corresponds when a subcarrier spacing configuration is μ, and l denotes a symbol index of a first symbol in a slot number to which the target OCC corresponds, denotes the number of numbers less than N that are coprime to N, denotes the first of the numbers prime to N number, m0denotes an index of the disabled orthogonal cover code, N is a length of the disabled orthogonal cover code, and m denotes an index of the target orthogonal cover code, associated with a cell identity or a scrambling identity. The method of claim 12, wherein If the disabled OCC includes elements that are not all ones, the following relationship is satisfied between the target OCC and the disabled OCC: wherein denotes based on and the determined value of I, denotes a first symbol index of a first symbol in a slot, A denotes a full permutation matrix of (N-1)! x (N-1) dimension, represents the 1st an element of a row m0, column m0, m0 denoting an index of the de- enabled orthogonal cover code, N being a length of the de-enabled orthogonal cover code, m denoting an index of the target orthogonal cover code, associated with a cell identity or a scrambling identity. The method according to any one of claims 12 to 15, characterized in that satisfies the following relationship: denotes the number of symbols contained in one slot, c(·) denotes a Gold sequence, c(·) is associated with the cell identity or the scrambling identity, i takes values from 0 to I-1, and I is a positive integer. The method of claim 16, wherein I takes 8. The method according to any one of claims 12 to 17, characterized in that The type of the disabled OCC is an inter-slot OCC. The method further comprises: The second information is used to indicate that the target OCC varies in granularity of K1*N slots, K1 being a positive integer greater than or equal to 1. The method according to any one of claims 12 to 17, characterized in that The disabled OCC is an inter-symbol OCC. The method further comprises: The third information is used to indicate that the target OCC varies in granularity of K2*B*N symbols, K2 being a positive integer greater than or equal to 1, and B being the number of symbols contained in a transport block. The method according to any one of claims 12 to 17, characterized in that The disabled OCC is an intra-symbol DFT-spread OCC. The method further comprises: The fourth information is used to indicate that the target OCC varies in granularity of K3 symbols, K3 being a positive integer greater than or equal to 1. A communication device characterized by comprising: The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. A communication device characterized by comprising: The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. A communication device characterized by comprising: The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. A computer-readable storage medium, characterized by The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. A computer program product, characterized by The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 8. The computer program product comprises computer program code which, when executed on a computer, causes the computer to

Images