Communication method and related apparatus

Abstract

A communication method and a related apparatus. In the method, a first communication apparatus determines a first signal, wherein the first signal is obtained on the basis of a first sequence and / or a second sequence, the first sequence is determined on the basis of cell information, the second sequence is determined on the basis of one row of elements among N rows of elements included in a first matrix, and N sequences corresponding to the N rows of elements are orthogonal, N being an integer greater than 1; and the first communication apparatus sends the first signal. In other words, the first signal sent by the first communication apparatus can be obtained on the basis of the first sequence and / or the second sequence. In this way, a first signal sent by a first communication apparatus can obtain a gain brought by a first sequence and / or a second sequence, thereby improving signal transmission performance.

Description

Communication method and related apparatus

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

[0002] The present application relates to the field of communication technology, and in particular, to a communication method and related apparatus. BACKGROUND

[0003] Wireless communication can be transmission communication between two or more communication devices without propagation through conductors or cables. Generally, the two or more communication devices include network devices and terminal devices, or the two or more communication devices include different terminal devices. In a communication system, different communication devices can obtain communication services through signal transmission.

[0004] However, how to improve the signal transmission performance is a technical problem to be solved. SUMMARY

[0005] The present application provides a communication method and related apparatus for improving the signal transmission performance.

[0006] The first aspect of the present application provides a communication method, which is applied to a first communication device. For example, the first communication device can be a communication device (such as a terminal device or a network device), or the first communication device can be a part of a communication device (such as a processor or a circuit or a chip responsible for communication functions (such as a Modem chip, also known as a baseband chip, or a system on chip (SoC) chip containing a modem core or a system in package (SIP) chip), etc.), or the first communication device can also be a logic module or software that can realize all or part of the functions of the communication device. The following takes the first communication device as an example to illustrate that, in the method, the first communication device determines a first signal, the first signal being obtained based on a first sequence and / or a second sequence; wherein the first sequence is determined based on cell information, and the second sequence is determined based on one of N rows of elements contained in a first matrix, N sequences corresponding to the N rows of elements being orthogonal, N being an integer greater than 1; and the first communication device transmits the first signal.

[0007] Based on the above scheme, the first signal sent by the first communication device can be obtained based on the first sequence and / or the second sequence. In this way, the first signal sent by the first communication device can obtain the gain brought by the first sequence and / or the second sequence, so as to improve the signal transmission performance.

[0008] For example, in the case where the first signal is obtained based on the first sequence, since the first sequence is determined based on the cell identification information, and the cell information of adjacent different cells is generally different, the communication signals of adjacent different cells can be obtained based on different first sequences. In this way, the interference between the communication signals of different cells can be reduced, so as to improve the signal transmission performance.

[0009] For another example, in the case where the first signal is obtained based on the second sequence, since the second sequence is determined based on one of the N rows of elements contained in the first matrix, and the N sequences corresponding to the N rows of elements are orthogonal, the first signals sent by different first communication devices can be obtained based on different sequences of the N sequences. In this way, the interference between the communication signals of different communication devices can be reduced, so as to improve the signal transmission performance. Optionally, the different first communication devices can be different communication devices in the same cell, and the mutual interference between the communication signals of different communication devices in the same cell can be reduced.

[0010] For another example, in the case where the first signal is obtained based on the first sequence and the second sequence, as described above, both the interference between the communication signals of different cells and the mutual interference between the communication signals of different communication devices in the same cell can be reduced, so as to improve the signal transmission performance.

[0011] Optionally, in the case where the first signal is obtained based on the first sequence and the second sequence, it can be understood that the first signal is obtained based on a third sequence, and the third sequence can be obtained based on the first sequence and the second sequence. For example, the third sequence can be the product of the first sequence and the second sequence. For another example, the elements contained in the third sequence can be obtained by multiplying the elements of the first sequence and the elements of the second sequence (for example, the nth element of the N elements contained in the third sequence can be the product of the nth element of the N elements contained in the first sequence and the nth element of the N elements contained in the second sequence, and n can be 1 to N or n can be 0 to N-1).

[0012] In addition, in the above process, since the communication signals of different cells or different communication devices in the same cell can multiplex the same transmission resource, in this case, using the first sequence and / or the second sequence can reduce the interference, improve the performance of multi-user multiplexing of different cells or the same cell, and improve the resource utilization.

[0013] Optionally, the first communication device can send the first signal in a wired transmission manner.

[0014] Optionally, the first communication device can send the first signal in a wireless transmission manner. Before the first communication device sends the first signal, the first communication device can determine the first resource for carrying the first signal in a pre-configuration or network device configuration manner, so that the first communication device can implement the transmission of the first signal based on the specified first resource, thereby improving the reception success rate of the first signal.

[0015] Optionally, the first signal can be obtained by processing data based on the first sequence and / or the second sequence. The processing can be spread spectrum processing, code division multiplexing processing, etc. For example, the data can be uplink data, downlink data, or sidelink data, etc.

[0016] It should be understood that the first signal can be obtained by processing data, and the data can have various implementation manners. For example, the data can be data after discrete Fourier transformation (DFT) processing and before inverse fast Fourier transformation (IFFT) processing, so that the above scheme can be applied to the scenario of Inter-slot orthogonal cover code (OCC) or Inter-symbol OCC. For another example, the data can be data after modulation processing and before DFT processing, so that the above scheme can be applied to the scenario of Intra-symbol OCC.

[0017] It should be understood that the N sequences corresponding to the N rows of elements in the first matrix are orthogonal. It can be understood that the inner product of any two sequences in the N sequences is 0 or does not exceed a threshold value; or, in the case that the frequency offset of signal transmission is small or no frequency offset occurs, the inner product of two signals obtained based on any two sequences in the N sequences is 0; or, in the case that the frequency offset of signal transmission is large (for example, non-terrestrial network (NTN) scenario), the inner product of two signals obtained based on any two sequences in the N sequences is less than or equal to a threshold value.

[0018] It should be understood that the cell information can indicate the identity or index of the cell, including but not limited to one or more of the following: cell ID, physical cell ID (PCI), scrambling ID.

[0019] Optionally, the second sequence is determined based on one of the N rows of elements included in the first matrix, and includes: the elements included in the second sequence are the same as the one of the N rows of elements included in the first matrix; and / or, the arrangement order of the elements included in the second sequence is the same as the arrangement order of the one of the N rows of elements included in the first matrix.

[0020] Similarly, the N rows of elements included in the first matrix correspond to N sequences, and the second sequence is one of the N sequences, and any sequence of the N sequences can be determined in the manner of the second sequence. For example, for the pth sequence of the N sequences, the pth sequence can be determined based on the pth row of elements of the N rows of elements included in the first matrix, and p is an integer from 1 to N. For example, the elements included in the pth sequence are the same as the pth row of elements of the N rows of elements; and / or, the arrangement order of the elements included in the pth sequence is the same as the arrangement order of the pth row of elements of the N rows of elements.

[0021] Optionally, the sequence involved in the present application can be replaced by other terms, such as vector, code, orthogonal code, orthogonal information, orthogonal matrix, orthogonal sequence, orthogonal spread spectrum code, orthogonal spread spectrum sequence or orthogonal cover code, etc.

[0022] Optionally, the matrix involved in the present application can be replaced by other terms, such as sequence set, vector set, code set, orthogonal code set, orthogonal information set, orthogonal matrix set, orthogonal sequence set, orthogonal spread spectrum code set, orthogonal spread spectrum sequence set or orthogonal cover code set, etc.

[0023] Optionally, exchanging any two rows of the matrix does not change the OCC sequence set. For example, any matrix corresponds to a group of sequences (or a group of OCC sequence sets), and after exchanging any two rows of the matrix to obtain another matrix, the other matrix can correspond to another group of sequences (or a group of OCC sequence sets), wherein the group of sequences and the other group of sequences can be understood as the same group of OCC sequences. In other words, any matrix provided by the present application can be replaced by other matrix, which can be obtained by one or more transformations of the any matrix, and each transformation can exchange any two rows of the matrix.

[0024] In a possible implementation of the first aspect, the method further includes: the first communication device receiving any of the following information:

[0025] first information used to indicate the first sequence;

[0026] second information used to indicate the second sequence; or

[0027] The third information is used for indicating a third sequence, and the third sequence is obtained based on the first sequence and the second sequence.

[0028] Based on the above scheme, the first communication device can also determine the first sequence and / or the second sequence based on any of the above information. In this way, the first signal sent by the first communication device can be a signal generated based on the specified sequence, which can improve the receiving success rate of the receiver of the first signal, thereby improving the communication efficiency.

[0029] The second aspect of the present application provides a communication method, which is applied to a second communication device. For example, the second communication device can be a communication device (e.g., a terminal device or a network device), or the second communication device can be a part of the communication device (e.g., a processor or a circuit or a chip responsible for communication functions (e.g., a Modem chip, also known as a baseband chip, or a SoC chip or a SIP chip containing a modem core, etc.), or the second communication device can also be a logic module or software that can realize all or part of the functions of the communication device. The following takes the second communication device as an example. In the method, the second communication device receives a first signal, and the first signal is obtained based on a first sequence and / or a second sequence. The first sequence is determined based on cell information, and the second sequence is obtained based on a second matrix. The second matrix is a DFT matrix or an IDFT matrix, and N is an integer greater than 1.

[0030] Based on the above scheme, the first signal received by the second communication device can be obtained based on the first sequence and / or the second sequence. In this way, the first signal received by the second communication device can obtain the gain brought by the first sequence and / or the second sequence, thereby improving the signal transmission performance.

[0031] For example, in the case where the first signal is obtained based on the first sequence, since the first sequence is determined based on the cell identification information, and the cell information of adjacent different cells is generally different, the communication signals of adjacent different cells can be obtained through different first sequences. In this way, the interference between the communication signals of different cells can be reduced, thereby improving the signal transmission performance.

[0032] For example, in a case that the first signal is obtained based on the second sequence, since the second sequence is determined based on one of the N rows of elements contained in the first matrix, the N sequences corresponding to the N rows of elements are orthogonal, and correspondingly, the first signals sent by different first communication devices can be obtained based on different sequences of the N sequences. In this way, the interference of the communication signals of different communication devices can be reduced, so as to improve the signal transmission performance. Optionally, the different first communication devices can be different communication devices in the same cell, and the mutual interference of the communication signals of the different communication devices in the same cell can be reduced.

[0033] For example, in a case that the first signal is obtained based on the first sequence and the second sequence, it can be known from the above description that the interference of the communication signals between different cells and the mutual interference of the communication signals of different communication devices in the same cell can be reduced, so as to improve the signal transmission performance.

[0034] Optionally, the second communication device can receive the first signal in a wired transmission manner.

[0035] Optionally, the second communication device can receive the first signal in a wireless transmission manner. Before receiving the first signal, the second communication device can determine the first resource in a pre-configuration or network device configuration manner, and the first resource is used to carry the first signal. In this way, the second communication device can realize the transmission of the first signal based on the specified first resource, so as to improve the reception success rate of the first signal.

[0036] In a possible implementation of the second aspect, the method further includes: the second communication device sending any of the following information:

[0037] first information used to indicate the first sequence;

[0038] second information used to indicate the second sequence; or

[0039] third information used to indicate a third sequence, and the third sequence is obtained based on the first sequence and the second sequence.

[0040] Based on the above scheme, the first communication device can also determine the first sequence and / or the second sequence based on any of the information sent by the second communication device, so that the first signal sent by the first communication device can be a signal generated based on the specified sequence, and the reception success rate of the second communication device can be improved, so as to improve the communication efficiency.

[0041] In a possible implementation of the first aspect or the second aspect, the first matrix S satisfies any of the following conditions:

[0042] Or,

[0043] It should be understood that, in the case that the first matrix S satisfies any of the above, the first matrix S is obtained based on a DFT matrix (for example, any of the above is a permutation matrix of a DFT matrix, that is, any of the above can be obtained by exchanging two rows of elements of the DFT matrix, and the DFT matrix is a matrix F4 described later). Alternatively, the first matrix S is obtained based on a DFT matrix by matrix permutation, matrix interleaving, matrix elementary transformation, etc.

[0044] Optionally, the first communication device can receive indication information for indicating the first matrix (for example, the indication information comes from the second communication device), so that the first communication device can implement signal transmission based on the sequence corresponding to the specified first matrix, to improve the signal transmission performance.

[0045] Based on the above scheme, in the case that the first matrix is an N-row and N-column matrix and N takes the value of 4, the first matrix can be one of the above matrices, so that the first communication device can determine the second sequence based on the one of the matrices.

[0046] In a possible implementation of the first aspect or the second aspect, the first matrix is obtained based on a second matrix, and the second matrix is a DFT matrix or an inverse discrete Fourier transformation (IDFT) matrix.

[0047] Based on the above scheme, the first matrix can be obtained by the DFT matrix or the IDFT matrix, and the orthogonality between different row elements of the DFT matrix or the IDFT matrix can be used to obtain the second sequence with the property.

[0048] For example, in the case that the second matrix is an IDFT matrix, the first matrix S can be obtained based on the IDFT matrix, for example, the first matrix S satisfies any of the following:

[0049] Or,

[0050] Similarly, any of the above first matrices S satisfies a permutation matrix of an IDFT matrix, that is, any of the above can be obtained based on the IDFT matrix by exchanging two rows of elements. Alternatively, the first matrix S is obtained based on the IDFT matrix by matrix permutation, matrix interleaving, matrix elementary transformation, etc.

[0051] Optionally, the second matrix can also be implemented in other ways, such as a matrix composed of Walsh-Hadamard sequences, a matrix composed of Zadoff-Chu sequences, etc.

[0052] In a possible implementation of the first aspect or the second aspect, the first matrix is obtained based on the second matrix, and the following conditions are met:

[0053] The i-th column element in the N column elements included in the first matrix is the same as the j-th column element in the N column elements included in the second matrix;

[0054] The j-th column element in the N column elements included in the first matrix is the same as the i-th column element in the N column elements included in the second matrix;

[0055] The k-th column element in the N column elements included in the first matrix is the same as the k-th column element in the N column elements included in the second matrix;

[0056] wherein i and j are any two unequal integers in 1 to N, k is an integer in 1 to N, and k is not equal to i and j.

[0057] Based on the above scheme, the first matrix can be obtained by exchanging the elements of any two columns (i.e., the i-th column and the j-th column) in the second matrix, and keeping the elements of other columns unchanged. Through this transformation process, the first matrix can obtain better performance compared with the second matrix. For example, in the case where the frequency offset of signal transmission is small or no frequency offset occurs, the inner product of two signals obtained based on any two sequences in the N sequences included in the first matrix is 0; or in the case where the frequency offset of signal transmission is large (such as in the NTN scenario), the inner product of two signals obtained based on any two sequences in the N sequences included in the first matrix is less than or equal to a threshold, which can improve the anti-frequency offset performance.

[0058] Optionally, N is 4, and i, j and k meet any of the following conditions:

[0059] i is 1, j is 2, k is 3 and 4;

[0060] i is 2, j is 3, k is 1 and 4;

[0061] i is 3, j is 4, k is 1 and 2; or

[0062] i is 4, j is 1, k is 2 and 3.

[0063] In a possible implementation of the first aspect or the second aspect, N = 4, and the first sequence B(n) meets at least one of the following conditions: B(n) = [1 1 1 1]; B(n) = [1 e-j2π / 5 e -j6π / 5 e -j2π / 5 ]; B(n)=[1 e -j4π / 5 e -j2π / 5 e -j4π / 5 ]; B(n)=[1 e -j6π / 5 e -j8π / 5 e -j6π / 5 ]; B(n)=[1 e -j8π / 5 e -j4π / 5 e -j8π / 5 ]; B(n)=[1 e -j2π / 5 e -j6π / 5 e -j4π / 5 ]; B(n)=[1 e -j8π / 5 1 e- j8π / 5 ]; B(n)=[1 e -j4π / 5 e -j4π / 5 e -j2π / 5 ]; B(n)=[1 1 e -j8π / 5 e -j6π / 5 ]; B(n)=[1 e -j6π / 5 e -j2π / 5 1]; B(n)=[1 e -j4π / 5 e -j2π / 5 e -j8π / 5 ]; B(n)=[1 e -j6π / 5 1 e -j6π / 5 ]; B(n)=[1 e -j8π / 5 e -j8π / 5 e -j4π / 5 ]; B(n)=[1 1 e -j6π / 5 e -j2π / 5 ]; B(n)=[1 e -j2π / 5 e -j4π / 5 1]; B(n)=[1 e -j6π / 5 e -j8π / 5 e -j2π / 5 ]; B(n)=[1 e -j4π / 5 1 e -j4π / 5 ]; B(n)=[1 e -j2π / 5 e -j2π / 5 e -j6π / 5 ]; B(n)=[1 1 e -j4π / 5 e -j8π / 5 ]; B(n)=[1 e -j8π / 5 e -j6π / 5 1]; B(n)=[1 e -j8π / 5 e -j4π / 5 e -j6π / 5 ]; B(n)=[1 e -j2π / 5 1 e-j2π / 5 ]; B(n)=[1 e -j6π / 5 e -j6π / 5 e -j8π / 5 ]; B(n)=[1 1 e -j2π / 5 e -j4π / 5 ]; or B(n) = [1 e -j4π / 5 e -j8π / 5 1).

[0064] Based on the above scheme, when N is 4, the first sequence can be implemented in various ways to improve the flexibility of the scheme implementation.

[0065] In one possible implementation of the first or second aspect, the first sequence B(n) satisfies:

[0066] Where e is the natural constant, N is the sequence length, P is the largest prime number not greater than the sequence length N or the smallest prime number not less than the sequence length N, and Δ T Indicates the maximum delay spread, Δ F Represents the maximum Doppler spread, with cubic coefficient index λ∈{1,2,…P-1} and quadratic coefficient index. Index of coefficients of the first term

[0067] Optionally, cell information can be used to determine the cubic coefficient index λ and / or the quadratic coefficient index k.

[0068] Based on the above scheme, the first sequence can be the aforementioned cubic polynomial exponent sequence, which is a sequence with a relatively good (or optimal) self-ambiguity function, and the inner product of any two cubic polynomial exponent sequences is small. Therefore, when different communication devices use different cubic polynomial exponent sequences for communication, mutual interference can be minimized as much as possible.

[0069] Optionally, at least one of the following conditions must be met: P is the smallest prime number not less than the sequence length N, and the maximum time delay spread Δ T =1, maximum Doppler spread Δ F =1, the values ​​of the cubic coefficient index λ and the quadratic coefficient index k are determined based on the cell information, or, the linear coefficient index l = 0.

[0070] In one possible implementation of the first or second aspect, the first sequence B(n) satisfies:

[0071] Where e is the natural constant, N is the sequence length, P is the largest prime number not greater than the sequence length N or the smallest prime number not less than the sequence length N, and Δ T Indicates the maximum delay spread, ΔF represents a maximum Doppler spread, a root sequence number u e {0, 1,..., P-1}, a linear term coefficient index

[0072] Optionally, the cell information can be used to determine the root sequence number u.

[0073] Based on the above scheme, the first sequence can be the above-mentioned quadratic polynomial exponential sequence, which is a self-correlation function optimal (or optimal) self-correlation sequence, and the inner product of any two quadratic polynomial exponential sequences is small. Therefore, in the case that different communication devices use different quadratic polynomial exponential sequences for communication, mutual interference x can be reduced as much as possible.

[0074] Optionally, at least one of the following is met: P is a minimum prime number not less than the sequence length N, the maximum Doppler spread Δ F = 1, the root sequence number u is determined based on cell information, or the linear term coefficient index l = 0.

[0075] The third aspect of the present application provides a communication device, which is a first communication device, the communication device comprising a transceiver unit and a processing unit; the processing unit is configured to determine a first signal, the first signal being obtained based on a first sequence and / or a second sequence; wherein the first sequence is determined based on cell information, and the second sequence is determined based on one of N row elements contained in a first matrix, N sequences corresponding to the N row elements being orthogonal, N being an integer greater than 1; the transceiver unit is configured to send the first signal.

[0076] The fourth aspect of the present application provides a communication device, which is a second communication device, the communication device comprising a transceiver unit, the transceiver unit being configured to receive a first signal, the first signal being obtained based on a first sequence and / or a second sequence; wherein the first sequence is determined based on cell information, and the second sequence is determined based on one of N row elements contained in a first matrix, N sequences corresponding to the N row elements being orthogonal, N being an integer greater than 1.

[0077] In a possible implementation of the third aspect or the fourth aspect, the first matrix S satisfies any of the following:

[0078] , or

[0079] In a possible implementation of the third aspect or the fourth aspect, the second sequence is determined based on one of N row elements contained in the first matrix, comprising:

[0080] the second sequence comprises a plurality of elements which are identical to one of the N rows of elements comprised in the first matrix; and / or,

[0081] the plurality of elements comprised in the second sequence are arranged in the same order as one of the N rows of elements comprised in the first matrix.

[0082] In a possible implementation of the third aspect or the fourth aspect, the first matrix is obtained based on a second matrix, and the second matrix is a DFT matrix or an IDFT matrix.

[0083] In a possible implementation of the third aspect or the fourth aspect, the first matrix is obtained based on a second matrix, and the following conditions are satisfied:

[0084] the i-th column of the N columns of elements comprised in the first matrix is identical to the j-th column of the N columns of elements comprised in the second matrix;

[0085] the j-th column of the N columns of elements comprised in the first matrix is identical to the i-th column of the N columns of elements comprised in the second matrix;

[0086] the k-th column of the N columns of elements comprised in the first matrix is identical to the k-th column of the N columns of elements comprised in the second matrix;

[0087] wherein i and j are any two unequal integers from 1 to N, k is an integer from 1 to N, and k is not equal to i and j.

[0088] In a possible implementation of the third aspect or the fourth aspect, N is 4, and i, j and k satisfy any one of the following conditions:

[0089] i is 1, j is 2, k is 3 and 4;

[0090] i is 2, j is 3, k is 1 and 4;

[0091] i is 3, j is 4, k is 1 and 2; or

[0092] i is 4, j is 1, k is 2 and 3.

[0093] In a possible implementation of the third aspect or the fourth aspect, N is 4, and the first sequence B(n) satisfies at least one of the following conditions: B(n) = [1 1 1 1]; B(n) = [1 e -j2π / 5 e -j6π / 5 e -j2π / 5 ]; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j4π / 5 ]; B(n) = [1 e-j6π / 5 e -j8π / 5 e -j6π / 5 ]; B(n)=[1 e -j8π / 5 e -j4π / 5 e -j8π / 5 ]; B(n)=[1 e -j2π / 5 e -j6π / 5 e -j4π / 5 ]; B(n)=[1 e -j8π / 5 1 e -j8π / 5 ]; B(n)=[1 e -j4π / 5 e -j4π / 5 e -j2π / 5 ]; B(n)=[1 1 e -j8π / 5 e -j6π / 5 ]; B(n)=[1 e -j6π / 5 e -j2π / 5 1]; B(n)=[1 e -j4π / 5 e -j2π / 5 e -j8π / 5 ]; B(n)=[1 e -j6π / 5 1 e -j6π / 5 ]; B(n)=[1 e -j8π / 5 e -j8π / 5 e -j4π / 5 ]; B(n)=[1 1 e -j6π / 5 e -j2π / 5 ]; B(n)=[1 e -j2π / 5 e -j4π / 5 1]; B(n)=[1 e -j6π / 5 e -j8π / 5 e -j2π / 5 ]; B(n)=[1 e -j4π / 5 1 e -j4π / 5 ]; B(n)=[1 e -j2π / 5 e -j2π / 5 e -j6π / 5 ]; B(n)=[1 1 e -j4π / 5 e -j8π / 5 ]; B(n)=[1 e -j8π / 5 e -j6π / 5 1]; B(n)=[1 e -j8π / 5 e -j4π / 5 e -j6π / 5 ]; B(n)=[1 e -j2π / 5 1 e -j2π / 5 ]; B(n)=[1 e -j6π / 5 e -j6π / 5 e -j8π / 5 ]; B(n)=[1 1 e -j2π / 5 e -j4π / 5] ; or B(n) = [1 e -j4π / 5 e -j8π / 5 1].

[0094] In a possible implementation form of the third aspect or the fourth aspect, the first sequence B(n) satisfies:

[0095] where e is a natural constant, N is a sequence length, P is a largest prime number not greater than the sequence length N or a smallest prime number not smaller than the sequence length N, Δ T denotes a maximum delay spread, Δ F denotes a maximum Doppler spread, a cubic term coefficient index λ ∈ {1, 2, …, P-1}, a quadratic term coefficient index k ∈ {0, 1, …, P-1}, and a linear term coefficient index l ∈ {0, 1, …, P-1}. a linear term coefficient index

[0096] In a possible implementation form of the third aspect or the fourth aspect, at least one of the following is satisfied: P is the smallest prime number not smaller than the sequence length N, the maximum delay spread Δ T = 1, the maximum Doppler spread Δ F = 1, the cubic term coefficient index λ and the quadratic term coefficient index k are determined based on cell information, or the linear term coefficient index l = 0.

[0097] In a possible implementation form of the third aspect or the fourth aspect, the first sequence B(n) satisfies:

[0098] where e is a natural constant, N is a sequence length, P is a largest prime number not greater than the sequence length N or a smallest prime number not smaller than the sequence length N, Δ T denotes a maximum delay spread, Δ F denotes a maximum Doppler spread, a root sequence number u ∈ {0, 1, …, P-1}, a linear term coefficient index

[0099] In a possible implementation form of the third aspect or the fourth aspect, at least one of the following is satisfied: P is the smallest prime number not smaller than the sequence length N, the maximum Doppler spread Δ F = 1, the root sequence number u is determined based on cell information, or the linear term coefficient index l = 0.

[0100] The fifth aspect of the present application provides a communication apparatus, comprising at least one processor, which is configured to execute a computer program or instructions to enable the communication apparatus to implement the method in any one of the possible implementation forms of the first aspect or the second aspect.

[0101] Optionally, the communication apparatus can comprise the memory, and / or the at least one processor is coupled with the memory; wherein the memory is configured to store programs or instructions.

[0102] The sixth aspect of the present application provides a communication apparatus, comprising at least one logic circuit; the logic circuit is configured to execute the method in any possible implementation manner of any one of the preceding first aspect to the second aspect.

[0103] The seventh aspect of the present application provides a communication system, comprising the first communication apparatus and a second communication apparatus.

[0104] The eighth aspect of the present application provides a computer readable storage medium, configured to store one or more computer-executable instructions, when the computer-executable instructions are executed by a processor, the processor executes the method in any possible implementation manner of any one of the preceding first aspect to the second aspect.

[0105] The ninth aspect of the present application provides a computer program product (or computer program), when the computer program in the computer program product is executed by the processor, the processor executes the method in any possible implementation manner of any one of the preceding first aspect to the second aspect.

[0106] The tenth aspect of the present application provides a chip system, comprising at least one processor, configured to support the communication apparatus to implement the method in any possible implementation manner of any one of the preceding first aspect to the second aspect.

[0107] In a possible design, the chip system can further comprise a memory, the memory is configured to store necessary programs and data of the communication apparatus. The chip system can be composed of a chip, or can comprise the chip and other discrete devices. Optionally, the chip system further comprises an interface circuit, the interface circuit is configured to provide programs and / or data for the at least one processor.

[0108] The technical effects brought by any one of the third aspect to the tenth aspect can refer to the technical effects brought by different design manners of the first aspect to the second aspect, which will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0109] FIG. 1 is a schematic diagram of a communication system provided by the present application;

[0110] FIG. 2a to FIG. 2b are some schematic diagrams of a network device provided by the present application;

[0111] FIG. 3a to FIG. 3e are some schematic diagrams of a satellite communication process provided by the present application;

[0112] Fig. 4a to Fig. 4c are some schematic diagrams of application of OCC provided by the present application;

[0113] Fig. 5 is a schematic diagram of a communication method provided by the present application;

[0114] Fig. 6a to Fig. 6d are some schematic diagrams of application of the communication method provided by the present application;

[0115] Fig. 7 to Fig. 11 are some schematic diagrams of communication devices provided by the present application. DETAILED DESCRIPTION

[0116] First, some terms in the embodiments of the present application are explained to facilitate understanding by those skilled in the art.

[0117] (1) Terminal device: can be a wireless terminal device capable of receiving network device scheduling and indication information, the wireless terminal device can be a device providing voice and / or data connectivity to a user, or a handheld device with wireless connection function, or other processing devices connected to a wireless modem.

[0118] The terminal device can be various communication kits (a kit can include, for example, an antenna, a power supply template, a cable, and a Wi-Fi module, etc.) with wireless communication functions, and can also be a communication module with satellite communication functions, a satellite phone or its components, a very small aperture terminal (VSAT), etc. The terminal device can be a mobile terminal device, such as a mobile phone (or called "cellular" phone, mobile phone), a computer, and a data card, for example, a portable, pocket-sized, handheld, computer-built-in, or vehicle-mounted mobile device that exchanges voice and / or data with a wireless access network. For example, a personal communication service (PCS) phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a tablet computer (Pad), a computer with wireless transceiver function, etc. The wireless terminal device can also be called a subscriber unit, a subscriber station, a mobile station, a mobile station (MS), a remote station, an access point (AP), a remote terminal, an access terminal, a user terminal, a user agent, a subscriber station (SS), customer premises equipment (CPE), a terminal, user equipment (UE), a mobile terminal (MT), a drone, etc. The terminal device can also be a wearable device and a next-generation communication system, for example, a terminal device in a future communication system or a terminal device in a future evolved public land mobile network (PLMN), etc. Of course, the terminal device in this application can also refer to a chip, a modem, a system on a chip (SoC) mainly responsible for the relevant communication function in the device, or a communication platform that can include a radio frequency (RF) part, etc.

[0119] (2) Network device: can be a device in a wireless network, for example, the network device can be a RAN node (or device) for accessing a terminal device to a wireless network, which can also be referred to as a base station. At present, some examples of RAN devices are: base station (base station), evolved NodeB (eNodeB), base station gNB (gNodeB) in 5G communication system, transmission reception point (transmission reception point, TRP), evolved Node B (eNB), radio network controller (radio network controller, RNC), Node B (Node B, NB), home base station (for example, home evolved Node B, or home Node B, HNB), baseband unit (baseband unit, BBU), or wireless fidelity (wireless fidelity, Wi-Fi) access point AP, etc. In addition, in a network structure, the network device can include a centralized unit (centralized unit, CU) node, or a distributed unit (distributed unit, DU) node, or a RAN device including a CU node and a DU node.

[0120] Optionally, the RAN node can also be a macro base station, a micro base station or an indoor station, a relay node or a donor node, or a wireless controller in a cloud radio access network (cloud radio access network, CRAN) scenario. 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 (vehicle to everything, V2X) technology can be a road side unit (road side unit, RSU).

[0121] In another possible scenario, multiple RAN nodes cooperate to assist a terminal 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 unit (AAU), or a remote radio head (RRH).

[0122] 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 open RAN (O-RAN or 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.

[0123] The communication between the access network device and the terminal device follows a certain protocol layer structure. The protocol layer can include a control plane protocol layer and a user plane protocol layer. The control plane protocol layer can include at least one of a radio resource control (RRC) layer, a packet data convergence protocol (PDCP) layer, a radio link control (RLC) layer, a media access control (MAC) layer, or a physical (PHY) layer, etc. The user plane protocol layer can include at least one of a service data adaptation protocol (SDAP) layer, a PDCP layer, an RLC layer, a MAC layer, or a physical layer, etc.

[0124] For the correspondence between the network elements in the ORAN system and the protocol layer functions that can be implemented by the network elements, refer to Table 1 below.

[0125] Table 1

[0126] The network device can be another device that provides a wireless communication function for the terminal device. The embodiments of the present application do not limit the specific technology and specific device form adopted by the network device. For the convenience of description, the embodiments of the present application do not limit.

[0127] The network device can also include a core network device, which can include, for example, a mobility management entity (MME), a home subscriber server (HSS), a serving gateway (S-GW), a policy and charging rules function (PCRF), a public data network gateway (P-GW) in a fourth generation (4G) network, an access and mobility management function (AMF), a user plane function (UPF), or a session management function (SMF) in a 5G network, and other network elements. In addition, the core network device can also include other core network devices in a 5G network and a next-generation network of the 5G network.

[0128] In the embodiments of the present application, the network device can also be a network node with artificial intelligence (AI) capability, which can provide AI services for terminals or other network devices, for example, AI nodes, computing power nodes, AI-capable RAN nodes, AI-capable core network elements, etc. on the network side (access network or core network).

[0129] In the embodiments of the present application, the device for implementing the function of the network device can be a network device or a device capable of supporting the network device to implement the function, such as a chip system, which can be installed in the network device. In the technical solutions provided in the embodiments of the present application, the device for implementing the function of the network device is taken as an example to describe the technical solutions provided in the embodiments of the present application.

[0130] (3) Configuration and pre-configuration: In the present application, configuration and pre-configuration will be used simultaneously. Configuration refers to that the network device sends some parameter configuration information or parameter values to the terminal device through messages or signaling, so that the terminal device determines the communication parameters or transmission resources according to the values or information. Pre-configuration is similar to configuration, which can be parameter information or parameter values agreed by the network device and the terminal device in advance, or parameter information or parameter values adopted by the network device or the terminal device according to the standard protocol, or parameter information or parameter values pre-stored in the network device or the terminal device. The present application does not make any limitation.

[0131] Further, these values and parameters can be changed or updated.

[0132] (4) The terms "system" and "network" in the embodiments of the present application can be used interchangeably. "At least one" means one or more, and "multiple" means two or more. "And / or" describes the association relationship of the associated objects, which means that there can be three relationships, for example, A and / or B, which means that A exists alone, A and B exist simultaneously, and B exists alone, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects. "At least one of the following" or similar expressions means any combination of these items, including any combination of single item or multiple items. For example, "at least one of A, B and C" includes A, B, C, AB, AC, BC or ABC. In addition, unless otherwise specified, the ordinal numbers "first", "second", etc. mentioned in the embodiments of the present application are used to distinguish multiple objects, and are not used to limit the order, time sequence, priority or importance of the multiple objects.

[0133] (5) In embodiments of the present application, "sending" and "receiving" represent the direction of signal transmission. For example, "sending information to XX" can be understood as that the destination of the information is XX, which can include direct sending through the air interface, or indirect sending through the air interface by other units or modules. "Receiving information from YY" can be understood as that the source of the information is YY, which can include direct receiving from YY through the air interface, or indirect receiving from YY through the air interface by 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.

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

[0135] It can be understood that the information may be processed as necessary between the source and the destination of the information transmission, such as encoding and modulation, but the destination can understand the valid information from the source. Similar expressions in the present application can be similarly understood and will not be repeated here.

[0136] (6) In embodiments of the present application, "indicating" can include direct indication and indirect indication, and can also include explicit indication and implicit indication. The information indicated by a certain information (indication information as described below) is referred to as to-be-indicated information. In the implementation process, there are many ways to indicate the to-be-indicated information, for example but not limited to, the to-be-indicated information can be directly indicated, such as the to-be-indicated information itself or an index of the to-be-indicated information. The to-be-indicated information can also be indirectly indicated by indicating other information, where the other information and the to-be-indicated information have an association relationship. The to-be-indicated information can also be indicated only by a part of the to-be-indicated information, and the other part of the to-be-indicated information is known or agreed in advance, for example, the arrangement order of each information can be used to indicate a specific information, thereby reducing the indication overhead to a certain extent. The present application does not limit the specific manner of indication. It can be understood that for the sender of the indication information, the indication information can be used to indicate the to-be-indicated information, and for the receiver of the indication information, the indication information can be used to determine the to-be-indicated information.

[0137] In the present application, the same or similar parts among various embodiments can be mutually referred to, unless otherwise specified. In the various embodiments of the present application, and the various methods / designs / implementation manners in the various embodiments, the terms and / or descriptions among different embodiments, and the various methods / designs / implementation manners in the various embodiments are consistent and can be mutually referred to, unless otherwise specified and in conflict with logic. The technical features in different embodiments, and the various methods / designs / implementation manners in the various embodiments can be combined to form new embodiments, methods, or implementation manners according to their inherent logical relationship. The implementation manners of the present application described below do not constitute a limitation on the protection scope of the present application.

[0138] (7) Commonly used orthogonal cover code (OCC) sequences include: Walsh-Hadamard sequences, DFT sequences, Zadoff-Chu sequences. Each row of the following matrix represents a sequence, and any two rows are orthogonal to each other (inner product is zero).

[0139] For example, the Walsh-Hadamard sequence can be determined by the following matrix, which is the matrix H2 of the sequence length 2, the matrix H4 of the sequence length 4, and the matrix H8 of the sequence length 8, respectively.

[0140] For another example, the DFT sequence can be determined by the following matrix (j is the imaginary unit), which is the matrix F2 of the sequence length 2, the matrix F4 of the sequence length 4, and the matrix F8 of the sequence length 8, respectively.

[0141] For another example, the Zadoff-Chu sequence can be determined by the following matrix, which is the matrix Z3 of the sequence length 3 and the matrix Z6 of the sequence length 6, respectively.

[0142] The present application can be applied to a long term evolution (LTE) system, a new radio (NR) system, or a new radio vehicle to everything (NR V2X) system; can also be applied to a system in which LTE and 5G are hybrid networked; or a device-to-device (D2D) communication system, a machine to machine (M2M) communication system, an Internet of Things (IoT), or a drone communication system; or a communication system supporting multiple wireless technologies, such as a communication system supporting LTE technology and NR technology; or a non-ground communication system, such as a satellite communication system, a high-altitude communication platform, etc. In addition, the communication system can also be applied to a narrow band-internet of things (NB-IoT) system or other communication systems, wherein the communication system includes a network device and a terminal device, the network device as a configuration information sending entity, and the terminal device as a configuration information receiving entity. Specifically, there are entities in the communication system that send configuration information to another entity, and send data to another entity or receive data sent by another entity; another entity receives configuration information and sends data to the configuration information sending entity or receives data sent by the configuration information sending entity according to the configuration information. Wherein, the present application can be applied to a terminal device in a connected state or an active state, and can also be applied to a terminal device in an inactive state or an idle state.

[0143] Referring to FIG. 1, there is shown a schematic diagram of an architecture of a communication system 1000 to which embodiments of the present application can be applied. As shown in FIG. 1, the communication system includes a radio access network (RAN) 100 and a core network 200. Optionally, the communication system 1000 can further include an Internet 300. The RAN 100 includes at least one RAN node (e.g., 110a and 110b in FIG. 1, collectively referred to as 110) and at least one terminal (e.g., 120a-120j in FIG. 1, collectively referred to as 120). The RAN 100 can further include other RAN nodes, such as a wireless relay device and / or a wireless backhaul device (not shown in FIG. 1). The terminals 120 are wirelessly connected to the RAN nodes 110, and the RAN nodes 110 are connected to the core network 200 wirelessly or wiredly. The core network devices in the core network 200 and the RAN nodes 110 in the RAN 100 can be independent and different physical devices, or can be the same physical device integrated with the logical functions of the core network devices and the logical functions of the RAN nodes. The terminals and the terminals, and the RAN nodes and the RAN nodes can be connected to each other by wire or wirelessly.

[0144] As an implementation example, as shown in FIG. 2a, the access network device can include at least one CU and at least one DU. This design can be referred to as CU and DU separation. One CU can be connected to one or more DUs. The CU and the DU can be divided according to the protocol layers of the wireless network: for example, the functions of the PDCP layer and above protocol layers (such as the RRC layer and the SDAP layer, etc.) are arranged in the CU, and the functions of the protocol layers below the PDCP layer (such as the RLC layer, the MAC layer, and the PHY layer, etc.) are arranged in the DU; for another example, the functions of the protocol layers above the PDCP layer are arranged in the CU, and the functions of the protocol layers at and below the PDCP layer are arranged in the DU, which is not limited. When the CU includes a CU-CP and a CU-UP, the CU-CP is used to implement the control plane function of the CU, and the CU-UP is used to implement the user plane function of the CU. For example, when the CU is configured to implement the functions of the PDCP layer, the RRC layer, and the SDAP layer, the CU-CP is used to implement the RRC layer function and the control plane function of the PDCP layer, and the CU-UP is used to implement the SDAP layer function and the user plane function of the PDCP layer. The name of the CU and the DU is not limited in the present application, for example, the CU can be referred to as a first access network element, and the DU can be referred to as a second access network element, etc.

[0145] The above-mentioned processing functions of the CU and the DU are merely examples according to the protocol layer division, and can be divided in other manners. For example, the CU or the DU can be divided into more protocol layers, or the CU or the DU can be divided into partial processing functions of the protocol layers. For example, partial functions of the RLC layer and functions of the protocol layers above the RLC layer are arranged in the CU, and the remaining functions of the RLC layer and functions of the protocol layers below the RLC layer are arranged in the DU. For another example, the functions of the CU or the DU can be divided according to service types or other system requirements, for example, according to time delay. Functions that require a shorter time delay can be arranged in the DU, and functions that do not require the time delay can be arranged in the CU.

[0146] The CU can be connected to a core network. Optionally, the CU can have partial functions of the core network.

[0147] Further, partial functions of the DU can be arranged separately. As shown in FIG. 2a, the partial functions can be implemented by a radio unit (RU). The RU can have a radio frequency function. The name of the RU is not limited in the present application, for example, the RU can be referred to as a third access network element, etc. The DU and the RU can be split or separated at the PHY layer. For example, the DU can implement high-layer functions in the PHY layer, and the RU can implement low-layer functions in the PHY layer or implement the low-layer functions and the radio frequency functions. The high-layer functions in the PHY layer include functions closer to the MAC layer, and the low-layer functions in the PHY layer include functions closer to the radio frequency. For example, the high-layer functions in the PHY layer include one or more of the following: forward error correction (FEC) encoding / decoding, scrambling, or modulation / demodulation. The low-layer functions in the PHY layer include one or more of the following: fast Fourier transform (FFT) transform / inverse fast Fourier transform (iFFT) transform, beamforming, or extraction and filtering of a physical random access channel (PRACH), etc. The RU can perform radio frequency signal communication with the terminal device through an air interface. The precoding function in the PHY layer can be located in the DU or in the RU. The split manner between the DU and the RU can be various possible manners, which are not limited.

[0148] There is an interface between the DU and the RU. For example, according to different splitting manners, the interface between the DU and the RU can be a common public radio interface (CPRI) interface or an enhanced common public radio interface (eCPRI) interface.

[0149] As shown in FIG. 2b, an architecture of an access network device is shown. The access network device includes one or more functional modules to implement processing of signals. As shown in FIG. 2b, taking a physical layer function as an example, 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), decoding, de-rate matching, descrambling, demodulation, inverse discrete Fourier transformation (IDFT), channel equalization (or channel estimation), de-RE mapping, digital BF, fast Fourier transform (FFT) / CP removal, digital to analog (DA) conversion, analog BF, analog to digital (AD) conversion, or analog BF.

[0150] The one or more functional modules can be implemented by software, hardware, or a combination of software and hardware. They can be discrete or integrated. It can be understood that the functional modules are only examples, and the access network device can include more other modules (such as a scheduling module, a power control module, a hybrid automatic repeat request (HARQ) module, a flow control module, a mobility management module, or an artificial intelligence (AI) module, etc.) or not include some functional modules (such as not including a digital BF module) according to design. The access network device further includes a fronthaul interface between the DU and the RU, for realizing communication between the DU and the RU. The fronthaul interface includes but is not limited to CPRI or eCPRI. In a possible implementation, the DU is located in a BBU, and the RU is located in a RRU / AAU / RRH. The interface between the BBU and the RRU / AAU / RRH can also be referred to as a fronthaul interface. To realize the fronthaul interface, the BBU and the RRU / AAU / RRH can be connected through a fronthaul network, or the DU and the RU can be connected through a fronthaul network. For example, the fronthaul network includes but is not limited to a fiber direct connection or a wavelength division network.

[0151] The access network device can support one or more types of fronthaul interfaces, and different fronthaul interfaces correspond to DUs and RUs with different functions. As shown in FIG. 2b, if the fronthaul interface between the DU and the RU is CPRI, the DU is configured to implement one or more of baseband functions, and the RU is configured to implement one or more of radio frequency functions. If the fronthaul interface between the DU and the RU is eCPRI, part of the baseband functions of the downlink and / or uplink are moved from the DU to the RU for implementation, compared with CPRI. The splitting manner between the DU and the RU is different, corresponding to different types (Cat) of eCPRI. FIG. 2b gives six examples of eCPRI, denoted as Cat A, B, C, D, E, and F (which can also be denoted as Option A to F, or Option 1 to 6, or other manners). It can be understood that there can be other splitting manners between the DU and the RU, that is, there can be other types of eCPRI.

[0152] For eCPRI Cat A, for downlink transmission, the DU is configured to implement layer mapping and one or more functions before layer mapping (i.e., one or more of encoding, rate matching, scrambling, modulation, layer mapping), while other functions after layer mapping (e.g., one or more of RE mapping, digital BF, or IFFT / add CP) are implemented in the RU. For uplink transmission, the DU is configured to implement de-mapping and one or more functions before de-mapping (i.e., one or more of decoding, de-rate matching, de-scrambling, de-modulation, IDFT, channel equalization, de-RE mapping), while other functions after de-mapping (e.g., one or more of digital BF or FFT / CP removal) are implemented in the RU.

[0153] Similarly, for eCPRI Cat B, Cat C, Cat D, Cat E, Cat F, different DUs and RUs are configured for different splitting manners. For the splitting point and the functions before the splitting point are implemented by the DU, while the functions after the splitting point are implemented by the RU. The splitting points of different types of eCPRI are shown in FIG. 2b, and will not be described one by one. For example, for eCPRI Cat B, RE mapping is used as the splitting point for downlink transmission, and de-RE mapping is used as the splitting point for uplink transmission. For uplink transmission, RE mapping and the functions before RE mapping are implemented by the DU, while the functions after RE mapping and the radio frequency functions are implemented by the RU. For downlink transmission, de-RE mapping and the functions before de-RE mapping are implemented by the DU, while the functions after de-RE mapping and the radio frequency functions are implemented by the RU.

[0154] The splitting manners of eCPRI can be symmetric for uplink and downlink, such as eCPRI Cat B and Cat C shown in FIG. 2b, or the splitting manners of eCPRI can be asymmetric for uplink and downlink, such as eCPRI Cat A, Cat D, Cat E and Cat F shown in FIG. 2b, without limitation. Optionally, for uplink and / or downlink, different splitting manners can be configured for different channels or different channel groups, i.e., different types of eCPRI are configured. One or more channels can be included in a channel group.

[0155] In a possible design, the DU is located in the BBU, and the RU is located in the RRU / AAU / RRH. The processing module in the BBU for implementing baseband functions is referred to as a base band high (BBH) unit, and the processing module in the RRU / AAU / RRH for implementing baseband functions is referred to as a base band low (BBL) unit.

[0156] It should be noted that the technical solutions of the embodiments of the present application are applicable to a ground communication system. Alternatively, the technical solutions of the embodiments of the present application are applicable to a communication system integrating ground communication and satellite communication, which can also be referred to as a non-terrestrial network (NTN) communication system. For example, the RAN 100 in FIG. 1 can include a ground base station, where the ground base station can include a TN cell (i.e., signals of the TN cell can be transmitted and received by the ground base station); and the RAN 100 in FIG. 1 can also include a non-ground base station, for example, a satellite, which can include an NTN cell (i.e., signals of the NTN cell can be transmitted and received by the satellite). The ground communication system can be, for example, a long term evolution (LTE) system, a universal mobile telecommunication system (UMTS), a 5G communication system, a new radio (NR) system, or a next-generation communication system of the 5G communication system, without limitation.

[0157] The satellite communication has a wider coverage range than the traditional mobile communication system, the communication cost is independent of the transmission distance, and can overcome natural geographical obstacles such as oceans, deserts, and mountains. In order to overcome the shortcomings of the traditional communication network, the satellite communication can be an effective supplement to the traditional network. It is generally considered that the non-terrestrial network communication has different channel characteristics compared with the ground network communication, such as large transmission delay and large Doppler frequency offset. For example, the round-trip delay of GEO satellite communication is 238-270 milliseconds (ms). The round-trip delay of LEO satellite communication is 8-20 ms. According to the orbital height, the satellite communication system can be divided into three types: a high-orbit (geostationary earth orbit, GEO) satellite communication system, also known as a synchronous orbit satellite system; a medium-orbit (medium earth orbit, MEO) satellite communication system; and a low-orbit (low earth orbit, LEO) satellite communication system.

[0158] Among them, GEO satellite is also commonly known as geostationary orbit satellite, and the orbit height can be 35786 kilometers (km). The main advantage is that it is relatively stationary on the ground and provides a large coverage area. However, the disadvantages of GEO satellite orbit satellite are also relatively prominent: such as the distance from the earth is too large, a larger diameter antenna is required; its transmission delay is larger, about 0.5 seconds, which cannot meet the demand of real-time service; at the same time, its orbit resource is relatively scarce, the launch cost is high and it cannot provide coverage for the two polar regions. MEO satellite, the orbit height is between 2000-35786km, has a relatively small number of satellites to achieve global coverage, but its transmission delay is higher than that of LEO satellite, and it is mainly used for positioning and navigation. In addition, the orbit height is between 300-2000km, which is called low earth orbit (LEO) satellite. LEO satellite has lower orbit height than MEO and GEO, smaller data propagation delay, less power loss, and relatively lower launch cost. Therefore, LEO satellite communication network has made great progress in recent years and has attracted attention.

[0159] In a possible implementation, the satellite device can be divided into transparent mode and regenerative mode according to the working mode.

[0160] The two modes will be exemplarily illustrated by the implementation modes shown in FIG. 3a, FIG. 3b, FIG. 3c and FIG. 3d.

[0161] As shown in the implementation mode of the transparent mode in FIG. 3a, the satellite and the gateway (i.e. NTN Gateway in FIG. 3a) act as a relay, that is, the radio remote unit (Remote Radio Unit) shown in FIG. 3a, and the terminal device and the gNB need to realize communication through the relay process. In other words, in the transparent mode, the satellite has the function of relay forwarding.

[0162] For example, in the implementation mode of the transparent mode shown in FIG. 3b, when the satellite (including GEO satellite, MEO satellite, LEO satellite, etc.) works in the transparent mode, the satellite has the function of relay forwarding. The gateway (or gateway station) has the function of the base station or part of the base station function, at this time, the gateway can be regarded as the base station. Alternatively, the base station can be deployed separately from the gateway, and then the time delay of the feeder link includes the time delay of the satellite to the gateway and the time delay of the gateway to the gNB.

[0163] Optionally, the transparent mode can be taken as an example that the gateway and the gNB are together or close to each other. For the case that the gateway is far away from the gNB, the time delay of the feeder link can be obtained by adding the time delay of the satellite to the gateway and the time delay of the gateway to the gNB.

[0164] As shown in the implementation mode of the regenerative mode in FIG. 3c, the satellite and the gateway (i.e., NTN Gateway in FIG. 3c) can communicate with the terminal device as a gNB. In other words, in the regenerative mode, the satellite has the function of a base station or part of the function of a base station, and at this time, the satellite can be regarded as a base station.

[0165] For example, in the implementation mode of the regenerative mode shown in FIG. 3d, the satellite (including GEO satellite, MEO satellite, LEO satellite, etc.) works in the regenerative mode, and compared with the implementation mode shown in FIG. 3b, the satellite has the function of a base station or part of the function of a base station, and at this time, the satellite can be regarded as a base station (i.e., an air base station).

[0166] Optionally, in FIG. 3b and / or FIG. 3d, the satellite can be implemented in other ways, such as a drone or a high-altitude platform in the figure.

[0167] It should be noted that the base stations of the NTN and the ground network can be interconnected through a common core network. Higher timeliness assistance and interconnection can also be achieved through interfaces defined between base stations. In NR, the interface between base stations is called Xn interface, and the interface between the base station and the core network is called NG interface. In the fusion network, the NTN node and the ground node can realize interworking and cooperation through the foregoing interfaces.

[0168] In addition, the satellite as a network device can send ephemeris information, so that the receiver of the ephemeris information (such as a terminal device or a base station thereof or other satellites, etc.) can determine the relevant information of the running track of the satellite based on the ephemeris information.

[0169] It should be noted that the present application can be applied to a long term evolution (LTE) system, a new radio (NR) system, or a future communication network / system.

[0170] Taking 5G as an example, a 5G satellite communication system architecture is shown in FIG. 3e. The ground terminal device accesses the network through the 5G new air interface, and the 5G base station is deployed on the satellite and connected to the ground core network through a wireless link. At the same time, there is a wireless link between the satellites to complete the signaling interaction and user data transmission between the base stations. The devices and interfaces in FIG. 3e are described as follows:

[0171] 5G core network: user access control, mobility management, session management, user security authentication, billing and other services. It is composed of multiple functional units and can be divided into control plane and data plane functional entities. The access and mobility management unit (AMF) is responsible for user access management, security authentication, and mobility management. The user plane unit (UPF) is responsible for managing user plane data transmission, traffic statistics, and other functions. The session management function (SMF) is mainly used for session management in mobile networks, such as session establishment, modification, and release.

[0172] Ground station: responsible for forwarding signaling and service data between satellite base station and 5G core network.

[0173] 5G new radio: wireless link between terminal and base station.

[0174] Xn interface: interface between 5G base stations, mainly used for signaling interaction such as handover.

[0175] NG interface: interface between 5G base station and 5G core network, mainly interacting with core network non-access layer (NAS) signaling, etc., and user service data.

[0176] In addition, the network devices in the ground network communication system and the satellites in the NTN communication system can be unified as network devices. The device for implementing the function of the network device can be a network device; it can also be a device capable of supporting the network device to implement the function, such as a chip system, which can be installed in the network device. When describing the technical solutions provided in the embodiments of the present application, the device for implementing the function of the network device is taken as an example, and the technical solutions provided in the embodiments of the present application are described. It can be understood that when the method provided in the embodiments of the present application is applied to the ground network communication system, the actions performed by the satellite can be applied to the base station or the network device to perform.

[0177] In the embodiments of the present application, the device for implementing the function of the terminal device can be a terminal device; it can also be a device capable of supporting the terminal device to implement the function, such as a chip system, which can be installed in the terminal device. In the embodiments of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices. In the technical solutions provided in the embodiments of the present application, the device for implementing the function of the terminal device is taken as an example, and the technical solutions provided in the embodiments of the present application are described.

[0178] In addition, the satellite described above can be a stationary satellite, a non-stationary satellite, an artificial satellite, a low-orbit satellite, a medium-orbit satellite, and a high-orbit satellite, etc., which are not specifically limited herein.

[0179] The above describes various scenarios of wireless communication involved in the present application. It should be understood that the above is only an exemplary description of the scenarios in which the present application can be applied, and the present application can also be applied to other application scenarios, which are not limited herein. The wireless communication process involved in the present application will be described below.

[0180] In a communication system (such as the communication system shown in FIG. 1 / FIG. 3a / FIG. 3b / FIG. 3c / FIG. 3d / FIG. 3e), different communication devices can obtain communication services through signal transmission. However, how to improve the signal transmission performance is a technical problem to be solved.

[0181] In a possible implementation, the signal transmission performance can be improved by using a sequence. The communication sequence is widely used in standard protocols (such as LTE / NR, etc.), and the correlation of the sequence can be used to realize downlink synchronization signals and uplink random access, and the orthogonality of the sequence can be used to realize pilot multiplexing. Common sequence evaluation indicators include autocorrelation, cross-correlation, sequence capacity, frequency offset resistance, peak-to-average power ratio, and two-domain constant modulus.

[0182] The application of an orthogonal cover code (OCC) in a physical uplink shared channel (PUSCH) will be taken as an example, and some implementation examples will be described exemplarily. It should be understood that the sequence used in the following scheme can be a Walsh-Hadamard sequence, a DFT sequence, or a Zadoff-Chu sequence.

[0183] As an implementation example, through a scheme of inter-slot OCC, uplink coverage enhancement can be realized. In this scheme, the inter-slot of PUSCH is spread through OCC. Specifically, the modulation symbol corresponding to each slot y(n) is spread through an orthogonal sequence w(n) after transform precoding. i (m) spread output signal z(n).

[0184] wherein, represents the number of RBs allocated for PUSCH, represents the number of subcarriers per RB, represents the number of DFT-s-OFDM symbols contained in each slot of PUSCH, represents the length of the orthogonal cover code.

[0185] Take FIG. 4a as an example, an Inter-slot OCC diagram with length 2 is shown. As shown in FIG. 4a, the signal processing of the signal sending end includes the following processes:

[0186] Data obtained after Block code processing and Scramble processing is denoted as d(0), d(1), …, which can be input to Modulation processing;

[0187] Data obtained after Modulation processing is denoted as x(0), x(1), …, which can be input to DFT processing;

[0188] Data obtained after DFT processing is denoted as y(0), y(1), …, which (for example, y(n) above) can be input to Block Spread processing;

[0189] In the Block Spread processing shown in FIG. 4a, two orthogonal OCC sequences can be used to process data in two slots, respectively. For example, w0 can be used to process data in the first slot, including data in 12 symbols (symbols occupied by a demodulation reference signal (DMRS) can be skipped) with symbol indexes 0 to 11 in the first slot; w1 can be used to process data in the first slot, including data in 12 symbols (symbols occupied by a DMRS can be skipped) with symbol indexes 0 to 11 in the second slot.

[0190] Data obtained after Block Spread processing is denoted as z(0), z(1), …, which (for example, z(n) above) can be input to IFFT processing. It should be understood that data after IFFT processing can be subjected to other radio frequency processing to obtain a communication signal transmitted over an air interface (or a wireless channel), which can be referred to FIG. 2b and related descriptions above.

[0191] It should be noted that the symbols in FIGS. 4a-4c can be orthogonal frequency division multiplexing (OFDM) symbols, discrete Fourier transform-spread-orthogonal frequency division multiplexing (DFT-s-OFDM) symbols, single carrier-quadrature amplitude modulation (SC-QAM) symbols, or other symbols, which are not limited herein.

[0192] As another implementation example, uplink coverage enhancement can be implemented through a scheme of inter-symbol OCC. In this scheme, the PUSCH is spread through OCC between symbols within a time slot. Specifically, after transform precoding, each symbol y(n) is spread through an orthogonal sequence w i (m) spread output signal z(n).

[0193] wherein, represents the number of RBs allocated for PUSCH, represents the number of subcarriers per RB, and K represents the number of DFT-s-OFDM symbols contained in each time slot, represents the OCC length.

[0194] Taking FIG. 4b as an example, an Inter-symbol OCC diagram with a length of 2 is shown. As shown in FIG. 4b, the signal processing at the signal sending end includes the following processes:

[0195] The data obtained by scrambling the block code can be used as the input of the modulation process;

[0196] The data obtained by the modulation process can be used as the input of the DFT process;

[0197] The data obtained by the DFT process (for example, y(n) above) can be used as the input of the block spread process;

[0198] In the block spread process shown in FIG. 4b, two orthogonal OCC sequences can be used to process the data on different symbols within the same time slot.

[0199] For example, for the first slot, w0 can be used to process data on the first occurrence of the symbols with indexes "0 / 1 / 2 / 3 / 4 / 5" (DMRS occupied symbols can be skipped) in the first slot; w1 can be used to process data on the second occurrence of the symbols with indexes "0 / 1 / 2 / 3 / 4 / 5" (DMRS occupied symbols can be skipped) in the first slot.

[0200] For example, for the first slot, w0 can be used to process data on the first occurrence of the symbols with indexes "0 / 1 / 2 / 3 / 4 / 5" (DMRS occupied symbols can be skipped) in the first slot; w1 can be used to process data on the second occurrence of the symbols with indexes "0 / 1 / 2 / 3 / 4 / 5" (DMRS occupied symbols can be skipped) in the first slot.

[0201] The data (e.g. z(n) above) obtained after the block spreading process can be input to the IFFT process. It should be understood that the data after the IFFT process can be subjected to other radio frequency processes to obtain a communication signal transmitted over the air (or wireless channel), which can be referred to Fig. 2b and related descriptions above.

[0202] As another implementation example, uplink coverage enhancement can be implemented by a scheme of intra-symbol orthogonal cover code (Intra-symbol OCC). In this scheme, the PUSCH corresponding slot is spread by OCC within the symbol. Specifically, each symbol d(n) is spread by an orthogonal sequence w i (m) spreading output signal x(n).

[0203] wherein, represents the number of subcarriers allocated for PUSCH, represents the number of RBs allocated for PUSCH, represents the number of subcarriers per RB, represents the length of the orthogonal cover code, M symb represents the number of modulation symbols.

[0204] As an example, Fig. 4c shows a diagram of Intra-symbol OCC with length 2. As shown in Fig. 4c, the signal processing at the signal transmitting end includes the following processes:

[0205] The data obtained after the scrambling of the block code can be input to the modulation process.

[0206] The data obtained through the modulation processing is denoted as d(0), d(1), …, which can be input to the block spread processing (for example, d(n) described above);

[0207] The data obtained through the block spread processing is denoted as x(0), x(1), …, which can be input to the DFT processing;

[0208] In the block spread processing shown in FIG. 4c, the data on different frequency domain resources in the same symbol can be processed by two orthogonal OCC sequences respectively.

[0209] For example, for a symbol, w0 can be used to process the data on the frequency domain units with indexes of “0 / 1 / 2 / 3 / 4 / 5” in the higher frequency domain position of the symbol; and w1 can be used to process the data on the frequency domain units with indexes of “0 / 1 / 2 / 3 / 4 / 5” in the lower frequency domain position of the symbol.

[0210] The data obtained through the DFT processing can be input to the IFFT processing. It should be understood that the data after the IFFT processing can be subjected to other radio frequency processing to obtain a communication signal transmitted on the air interface (or wireless channel), which can be referred to FIG. 2b and the related description above.

[0211] The scheme shown in FIGS. 4a-4c is designed based on a scenario with no frequency offset or small frequency offset (for example, a terrestrial network (TN)), and in this scenario, different signals obtained based on the different OCC sequences (for example, different Walsh-Hadamard sequences, different DFT sequences, or different Zadoff-Chu sequences) can remain orthogonal, and have better signal transmission performance.

[0212] However, in a communication system, there can be a scenario with large frequency offset, for example, a scenario with frequency offset caused by the Doppler effect (including but not limited to a high-speed mobile scenario of a satellite base station in an NTN network, a scenario of communication based on a high frequency band, etc.), in which case the above scheme can no longer be applicable. For example, different signals obtained based on the different OCC sequences (for example, different Walsh-Hadamard sequences, different DFT sequences, or different Zadoff-Chu sequences) can not remain orthogonal, which affects the signal transmission performance.

[0213] To solve the above problem, the present application provides a communication method and related device, which will be described in detail below with reference to the accompanying drawings.

[0214] Please refer to FIG. 5, which is an implementation schematic diagram of the communication method provided by the present application, and the method comprises the following steps.

[0215] It should be understood that, in the following, the method is exemplified by taking the first communication device and the second communication device as the execution subject of the interaction in FIG. 5, but the application is not limited to the execution subject of the interaction. For example, the communication device can be a communication device, or a chip, a baseband chip, a modem chip, a system on chip (SoC) chip containing a modem core, a system in package (SIP) chip, a communication module, a chip system, a processor, a logic module or software in the communication device, etc. Optionally, the communication device can be a terminal device or a network device (for example, the network device can be an access network device, an access network element, etc.).

[0216] S501. The first communication device sends a first signal, and correspondingly, the second communication device receives the first signal. The first signal is obtained based on a first sequence and / or a second sequence. The first sequence is determined based on cell information, and the second sequence is determined based on one of N rows of elements contained in a first matrix, where N rows of elements correspond to N sequences that are orthogonal, and N is an integer greater than 1.

[0217] It should be noted that, in step S501, the first communication device can send the first signal in multiple ways.

[0218] Method one, the first communication device can send the first signal in a wired transmission manner.

[0219] Exemplarily, in method one, the first communication device and the second communication device can both be network devices. For example, the first communication device can be used for processing of baseband signals, and the second communication device can be used for processing of radio frequency signals, that is, the first communication device can be the DU / O-DU described above, and the second communication device can be the RU / O-RU described above. Correspondingly, the first communication device and the second communication device can communicate with each other through a CPRI interface, an eCPRI interface or other interfaces defined in future networks to realize transmission of the first signal.

[0220] In addition, the data processed by the first communication device based on the first sequence and / or the second sequence can be data processed by a certain module shown in FIG. 2b. For example, the data can be data after DFT processing and before IFFT processing shown in FIG. 4a or FIG. 4b, so that the above scheme can be applied to the scenario of inter-slot OCC or inter-symbol OCC. For another example, the data can be data after modulation processing and before DFT processing shown in FIG. 4c, so that the above scheme can be applied to the scenario of intra-symbol OCC.

[0221] Optionally, in the first mode, after receiving the first signal, the second communication device can perform other signal processing processes (such as one or more of the above-mentioned RE mapping, digital BF, or IFFT / add CP) on the first signal to obtain a second signal, and transmit the second signal to the terminal device through a wireless link (or air interface).

[0222] In the second mode, the first communication device can transmit the first signal through wireless transmission.

[0223] As an implementation example of the second mode, the transmission resource of the first signal can be pre-configured.

[0224] As another implementation example of the second mode, the transmission resource of the first signal can be configured. For example, in the method shown in FIG. 5, before step S501, the method further includes:

[0225] S500. Transmission of configuration information between the first communication device and the second communication device, the configuration information being used to configure the first resource carrying the first signal. For example, the first communication device transmits the configuration information to the second communication device, or the second communication device transmits the configuration information to the first communication device.

[0226] In other words, before the first communication device and the second communication device transmit the first signal in step S501, the first communication device can also determine the first resource through pre-configuration or network device configuration, so that the first communication device and the second communication device can realize the transmission of the first signal based on the specified first resource, to improve the success rate of receiving the first signal.

[0227] Optionally, in the second mode, the first communication device can be a terminal device, and the second communication device can be a network device, i.e., the first signal can be an uplink signal, so that the above scheme can be applied to the uplink transmission scenario and realize uplink capacity enhancement (such as uplink capacity enhancement in the NTN scenario).

[0228] Optionally, in the second mode, the first communication device and the second communication device can be terminal devices, i.e., the first signal can be a sidelink signal, so that the above scheme can be applied to a sidelink transmission scenario.

[0229] For example, the first signal can be obtained based on the first sequence and / or the second sequence, and the processing can be a spread spectrum processing, a code division multiplexing processing, or the like.

[0230] It should be understood that the N sequences corresponding to the N rows of elements in the first matrix are orthogonal, which can be understood as that the inner product of any two sequences in the N sequences is 0 or does not exceed a threshold value; or, in the case that there is no frequency offset or the frequency offset is small in signal transmission, the inner product of two signals obtained based on any two sequences in the N sequences is 0; or, in the case that there is a large frequency offset in signal transmission, the inner product of two signals obtained based on any two sequences in the N sequences is less than or equal to a threshold value.

[0231] It should be understood that the cell information can indicate an identity or index of the cell, including but not limited to one or more of a cell identity (cell ID), a physical cell identity (PCI), and a scrambling identity (Scrambling ID).

[0232] Optionally, the second sequence is determined based on one of the N rows of elements in the first matrix, including that the plurality of elements included in the second sequence are the same as one of the N rows of elements in the first matrix; and / or, the arrangement order of the plurality of elements included in the second sequence is the same as the arrangement order of one of the N rows of elements in the first matrix.

[0233] Similarly, the N rows of elements in the first matrix correspond to N sequences, and the second sequence is one of the N sequences, and any sequence in the N sequences can be determined in the manner of the second sequence. For example, for the pth sequence in the N sequences, the pth sequence can be determined based on the pth row of elements in the N rows of elements in the first matrix, and p is an integer from 1 to N. For example, the plurality of elements included in the pth sequence are the same as the pth row of elements in the N rows of elements; and / or, the arrangement order of the plurality of elements included in the pth sequence is the same as the arrangement order of the pth row of elements in the N rows of elements.

[0234] Optionally, the sequence involved in the present application can be replaced by other terms, such as vector, code, orthogonal code, orthogonal information, orthogonal matrix, orthogonal sequence, orthogonal spread spectrum code, orthogonal spread spectrum sequence, or orthogonal cover code, etc.

[0235] Optionally, the matrix can be replaced by other terms, such as a sequence set, a vector set, a code set, an orthogonal code set, an orthogonal information set, an orthogonal matrix set, an orthogonal sequence set, an orthogonal spreading code set, an orthogonal spreading sequence set, or an orthogonal cover code set, etc.

[0236] Optionally, in the case that the first signal is based on the first sequence and the second sequence, it can be understood that the first signal is based on a third sequence, which can be based on the first sequence and the second sequence. For example, the third sequence can be a product of the first sequence and the second sequence. For another example, an element in the third sequence can be obtained by multiplying an element in the first sequence and an element in the second sequence (for example, an nth element in N elements in the third sequence can be a product of an nth element in N elements in the first sequence and an nth element in N elements in the second sequence, where n is 1 to N or n is 0 to N-1).

[0237] For example, the first sequence is the base sequence B(n), the second sequence is the auxiliary sequence S(n), and the third sequence is W(n), which satisfies: W(n) = B(n) · S(n), n = 0, 1, …, N-1.

[0238] Based on the scheme shown in FIG. 5, the first signal sent by the first communication device in step S501 can be based on the first sequence and / or the second sequence. In this way, the first signal sent by the first communication device can obtain the gain brought by the first sequence and / or the second sequence to improve the signal transmission performance.

[0239] For example, in the case that the first signal is based on the first sequence, since the first sequence is determined based on the cell identification information, and the cell information of adjacent different cells is generally different, the communication signals of adjacent different cells can be obtained by different first sequences. In this way, the interference between the communication signals of different cells can be reduced to improve the signal transmission performance.

[0240] For another example, in the case that the first signal is based on the second sequence, since the second sequence is determined based on one of the N rows of elements in the first matrix, and the N sequences corresponding to the N rows of elements are orthogonal, the first signals sent by different first communication devices can be obtained based on different sequences in the N sequences. In this way, the interference between the communication signals of different communication devices can be reduced to improve the signal transmission performance. Optionally, the different first communication devices described above can be different communication devices in the same cell, which can reduce the mutual interference between the communication signals of different communication devices in the same cell.

[0241] For example, in the case that the first signal is based on the first sequence and the second sequence, it can be known from the above description that the interference between the communication signals of different cells can be reduced, and the mutual interference between the communication signals of different communication apparatuses in the same cell can be reduced, so as to improve the signal transmission performance.

[0242] In a possible implementation, the method shown in FIG. 5 further includes that the first communication apparatus receives any of the following information:

[0243] first information for indicating the first sequence;

[0244] second information for indicating the second sequence; or

[0245] third information for indicating a third sequence, the third sequence being based on the first sequence and the second sequence.

[0246] Therefore, the first communication apparatus can further determine the first sequence and / or the second sequence based on any of the above information. In this way, the first signal sent by the first communication apparatus can be a signal generated based on the specified sequence, so as to improve the reception success rate of the receiver of the first signal, and improve the communication efficiency.

[0247] Optionally, the first communication apparatus can receive indication information for indicating the first matrix (for example, the indication information comes from the second communication apparatus), so that the first communication apparatus can implement the signal transmission based on the sequence corresponding to the specified first matrix, so as to improve the signal transmission performance.

[0248] It can be known from the above implementation process that the first signal can be processed based on the first sequence and / or the second sequence. The following will exemplarily illustrate various implementation manners of the first sequence and the second sequence.

[0249] In a possible implementation, the first matrix S for determining the second sequence satisfies any of the following:

[0250] or

[0251] It should be understood that in the case that the first matrix S satisfies any of the above, the first matrix S is obtained based on a DFT matrix (for example, any of the above is a permutation matrix of the DFT matrix, that is, any of the above can be obtained by exchanging two rows of elements of the DFT matrix, and the DFT matrix is the matrix F4 described above). Alternatively, the first matrix S is obtained based on the DFT matrix by matrix permutation, matrix interleaving, matrix elementary transformation, etc.

[0252] Optionally, the first matrix (as well as the second matrix hereinafter) can be a quaternary matrix, for example, the quaternary matrix can be a matrix containing elements 1, -1, j, -j. Correspondingly, the first sequence (as well as the second sequence, the third sequence, etc.) can be a quaternary sequence, a quaternary OCC sequence, etc.

[0253] Optionally, the first matrix (as well as the second matrix hereinafter) can be a matrix supporting at least two different OCC sequences. For example, the first matrix (as well as the second matrix hereinafter) can be a matrix supporting N different OCC sequences, where N is equal to 2, 4, 8, 16 or other values.

[0254] Therefore, in the case that the first matrix is an N-row-by-N-column matrix and N is equal to 4, the first matrix can be one of the above-mentioned matrices, so that the first communication device can determine the second sequence based on the one of the matrices.

[0255] As described above, any matrix involved in the present application can correspond to one or more sequences, i.e., the any matrix can be understood as a sequence set containing one or more sequences. For example, any matrix involved in the present application can indicate one or more sequences thereof by means of a sequence index.

[0256] As an example, a matrix S satisfies the following manner:

[0257] In this case, the matrix S can correspond to the implementation of Table 2.

[0258] Table 2

[0259] As shown in Table 2, the four rows of elements in the matrix S can be represented as four sequences, which correspond to the four sequences in Table 2 respectively. For example, the first row of elements in the matrix S can represent a sequence with a sequence index of 0, i.e., [+1 +1 +1 +1], the second row of elements in the matrix S can represent a sequence with a sequence index of 1, i.e., [+1 -1 +j -j], the third row of elements in the matrix S can represent a sequence with a sequence index of 2, i.e., [+1 +1 -1 -1], and the fourth row of elements in the matrix S can represent a sequence with a sequence index of 3, i.e., [+1 -1 -j +j].

[0260] In other words, any communication device can indicate one or more sequences thereof by means of a sequence index. For example, in the above-mentioned process, the second information can contain sequence indexes 0, 1, 2 or 3 to achieve the indication of the second sequence.

[0261] It should be understood that, in addition to the implementation of the matrix S corresponding to Table 2 described above, the present application also relates to other matrices, the elements of each row of which can be indicated by reference to the implementation of Table 2 to indicate the sequence corresponding to the other matrix by one or more sequence indexes.

[0262] For example, the first matrix can be obtained based on a second matrix, the second matrix being a DFT matrix or an IDFT matrix, and the property that different row elements of the DFT matrix or the IDFT matrix have orthogonality can be utilized to obtain a second sequence having the property.

[0263] For example, in the case where the second matrix is an IDFT matrix, the first matrix S can be obtained based on the IDFT matrix, for example, the first matrix S satisfies any one of the following:

[0264] Or,

[0265] Similarly, any one of the first matrix S described above satisfies a permutation matrix of the IDFT matrix, that is, any one of the above can be obtained by exchanging two row elements of the IDFT matrix.

[0266] Optionally, the second matrix can also be implemented in other ways, for example, a matrix composed of Walsh-Hadamard sequences, a matrix composed of Zadoff-Chu sequences, etc.

[0267] In a possible implementation, the first matrix is obtained based on the second matrix, and satisfies:

[0268] The i-th column element of the N column elements included in the first matrix is the same as the j-th column element of the N column elements included in the second matrix;

[0269] The j-th column element of the N column elements included in the first matrix is the same as the i-th column element of the N column elements included in the second matrix;

[0270] The k-th column element of the N column elements included in the first matrix is the same as the k-th column element of the N column elements included in the second matrix;

[0271] Wherein, i and j are any two unequal integers in 1 to N, k is 1 to N, and k is not equal to i and j.

[0272] Specifically, the first matrix can be obtained by swapping the elements of any two columns (i.e., the i-th column and the j-th column) in the second matrix, and keeping the elements of other columns unchanged. Through this transformation process, the first matrix can achieve better performance compared with the second matrix. For example, in the case of no frequency offset or small frequency offset in signal transmission, the inner product of two signals obtained based on any two sequences in the N sequences included in the first matrix is 0; or in the case of large frequency offset in signal transmission, the inner product of two signals obtained based on any two sequences in the N sequences included in the first matrix is less than or equal to a threshold, which can improve the anti-frequency offset performance.

[0273] Optionally, N is 4, and i, j and k satisfy any one of the following conditions:

[0274] i is 1, j is 2, k is 3 and 4;

[0275] i is 2, j is 3, k is 1 and 4;

[0276] i is 3, j is 4, k is 1 and 2; or

[0277] i is 4, j is 1, k is 2 and 3.

[0278] The construction method of the auxiliary sequence S(n) will be described below by taking the second matrix as a DFT matrix and the second sequence as an auxiliary sequence. The first matrix can be a permutation DFT matrix of the second matrix, and each row of the permutation DFT matrix represents an auxiliary sequence (permutation DFT sequence). The permutation DFT matrix is obtained by swapping adjacent two columns of the DFT matrix. For an orthogonal cover code with a length of 4, swapping adjacent two columns of the DFT matrix includes four cases: swapping the 1st column and the 2nd column of the DFT matrix, swapping the 2nd column and the 3rd column of the DFT matrix, swapping the 3rd column and the 4th column of the DFT matrix, and swapping the 1st column and the 4th column of the DFT matrix, to obtain four permutation DFT matrices:

[0279] Figure 6a compares the anti-frequency offset performance of three orthogonal cover codes: DFT sequences, Walsh sequences and permutation DFT sequences (taking the 2nd column and the 3rd column of the DFT matrix as an example).

[0280] In Figure 6a, for the case of no frequency offset, the inner product of any two rows of the DFT sequences, the Walsh sequences and the permutation DFT sequences is zero, and the three sequences all satisfy the orthogonality.

[0281] In Fig. 6a, for the case of frequency offset, assuming that the first row of the orthogonal matrix is affected by the frequency offset corresponding elements multiplied by the linear phase [1 j -1 -j], the orthogonality of the first row of the three orthogonal matrices after the frequency offset is examined with respect to the second row, the third row and the fourth row respectively.

[0282] ①The inner product of the first row of the DFT matrix after the frequency offset with the second row is 4, the inner product of the first row after the frequency offset with the third row is 0, and the inner product of the first row after the frequency offset with the fourth row is 0. The maximum value of the inner product is 4.

[0283] ②The inner product of the first row of the Walsh matrix after the frequency offset with the second row is 0, the inner product of the first row after the frequency offset with the third row is 2+j2, and the inner product of the first row after the frequency offset with the fourth row is 2-j2. The maximum value of the inner product is (There are two cases to reach the maximum value).

[0284] ③The inner product of the first row of the permutation DFT matrix after the frequency offset with the second row is 2, the inner product of the first row after the frequency offset with the third row is 2+j2, and the inner product of the first row after the frequency offset with the fourth row is -j2. The maximum value of the inner product is (There is one case to reach the maximum value).

[0285] For the frequency offset of the second row, the third row and the fourth row of the orthogonal matrix, the conclusion is similar according to the rotational symmetry. The smaller the maximum value of the inner product is, the better the anti-frequency offset performance is. Therefore, for the case of frequency offset, the performance of the permutation DFT sequence is better than that of the Walsh sequence, and is obviously better than that of the DFT sequence.

[0286] Fig. 6b shows the anti-frequency offset performance of four permutation DFT matrices (exchange the first column and the second column of the DFT matrix, exchange the second column and the third column of the DFT matrix, exchange the third column and the fourth column of the DFT matrix, and exchange the first column and the fourth column of the DFT matrix).

[0287] As can be seen from Fig. 6b, for the case of frequency offset, assuming that the first row of the orthogonal matrix is affected by the frequency offset corresponding elements multiplied by the linear phase [1 j -1 -j], the inner product of the first row of the four permutation DFT matrices after the frequency offset with the second row is 2, the inner product of the first row after the frequency offset with the third row is The inner product of the first row after the frequency offset with the fourth row is 2.

[0288] For the frequency offset of the second, third and fourth rows of the orthogonal matrix, the conclusion is similar according to the rotation symmetry. Therefore, for the case of frequency offset, the performances of the four permutation DFT matrices are the same. It should be pointed out that for any orthogonal matrix, assuming that the corresponding elements of the first row of the orthogonal matrix are multiplied by a linear phase [1 j -1 -j] under the influence of the frequency offset, the lower bound of the maximum value of the inner product of the first row after the frequency offset with the second, third and fourth rows is

[0289] Figure 6c compares the block error rate (BLER) performance of different OCC schemes and OCC sequences in a single cell. The horizontal axis represents the signal-to-noise ratio (SNR), and the horizontal axis represents the BLER. Different curves represent the signal performance of different sequences. It can be seen that Intra-symbol OCC is better than Inter-symbol OCC, and significantly better than Inter-slot OCC; for Inter-slot OCC, the third sequence (denoted as W sequence) is better than Walsh sequence (for example, SNR gain 0.1 dB @ BLER = 0.1, SNR gain 0.4 dB @ BLER = 0.02, where SNR gain 0.1 dB is the gain of “Inter-slot OCC4, W sequence” compared with “Inter-slot OCC4, Walsh sequence” when BLER = 0.1, and SNR gain 0.4 dB is the gain of “Inter-slot OCC4, W sequence” compared with “Inter-slot OCC4, Walsh sequence” when BLER = 0.4), and significantly better than DFT sequence (SNR gain 1 dB @ BLER = 0.1, DFT sequence appears flat @ BLER = 0.02); for Inter-symbol OCC, W sequence, Walsh sequence and DFT sequence have similar performance.

[0290] In a possible implementation, N = 4, and the first sequence B(n) satisfies at least one of the following: B(n) = [1 1 1 1]; B(n) = [1 e -j2π / 5 e -j6π / 5 e -j2π / 5 ]; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j4π / 5 ]; B(n) = [1 e -j6π / 5 e -j8π / 5 e -j6π / 5 ]; B(n) = [1 e -j8π / 5 e -j4π / 5 e -j8π / 5 ]; B(n) = [1 e-j2π / 5 e -j6π / 5 e -j4π / 5 ] ; B(n) = [1 e -j8π / 5 1 e -j8π / 5 ] ; B(n) = [1 e -j4π / 5 e -j4π / 5 e -j2π / 5 ] ; B(n) = [1 1 e -j8π / 5 e -j6π / 5 ] ; B(n) = [1 e -j6π / 5 e -j2π / 5 1] ; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j8π / 5 ] ; B(n) = [1 e -j6π / 5 1 e -j6π / 5 ] ; B(n) = [1 e -j8π / 5 e -j8π / 5 e -j4π / 5 ] ; B(n) = [1 1 e -j6π / 5 e -j2π / 5 ] ; B(n) = [1 e -j2π / 5 e -j4π / 5 1] ; B(n) = [1 e -j6π / 5 e -j8π / 5 e -j2π / 5 ] ; B(n) = [1 e -j4π / 5 1 e -j4π / 5 ] ; B(n) = [1 e -j2π / 5 e -j2π / 5 e -j6π / 5 ] ; B(n) = [1 1 e -j4π / 5 e -j8π / 5 ] ; B(n) = [1 e -j8π / 5 e -j6π / 5 1] ; B(n) = [1 e -j8π / 5 e -j4π / 5 e -j6π / 5 ] ; B(n) = [1 e -j2π / 5 1 e -j2π / 5 ] ; B(n) = [1 e -j6π / 5 e -j6π / 5 e -j8π / 5 ] ; B(n) = [1 1 e -j2π / 5 e -j4π / 5 ] ; or, B(n) = [1 e -j4π / 5 e -j8π / 5 1].

[0291] Thus, in the case of N=4, the first sequence can be implemented in the above-mentioned various manners to improve the flexibility of the implementation of the scheme.

[0292] In a possible implementation, the first sequence B(n) satisfies:

[0293] where e is a natural constant, N is the sequence length, P is the largest prime number not greater than the sequence length N or the smallest prime number not less than the sequence length N, Δ T represents the maximum delay spread, Δ F represents the maximum Doppler spread, the cubic term coefficient index λ∈{1,2,…P-1}, and the quadratic term coefficient index k∈{0,1,…P-1}. the linear term coefficient index l∈{0,1,…P-1}

[0294] Optionally, the cell information can be used to determine the cubic term coefficient index λ and / or the quadratic term coefficient index k. For example, in the case that the cell information indicates a cell identification (cell ID) and the value of the cell identification is α, λ and k satisfy any one of the following:

[0295] or,

[0296] λ=αmod P, where the parameters α, P, Δ T have the same meanings as above, and mod represents a modulo operation.

[0297] Specifically, the first sequence can be the above-mentioned cubic polynomial exponential sequence, which is a sequence with relatively optimal (or optimal) ambiguity function, and the inner product of any two cubic polynomial exponential sequences is relatively small. Therefore, in the case that different communication devices use different cubic polynomial exponential sequences to communicate, mutual interference can be reduced as much as possible.

[0298] Optionally, at least one of the following is satisfied: P is the smallest prime number not less than the sequence length N, the maximum delay spread Δ T =1, the maximum Doppler spread Δ F =1, the value of the cubic term coefficient index λ and the quadratic term coefficient index k is determined based on the cell information, or the linear term coefficient index l=0.

[0299] In a possible implementation, the first sequence B(n) satisfies:

[0300] where e is a natural constant, N is the sequence length, P is the largest prime number not greater than the sequence length N or the smallest prime number not less than the sequence length N, Δ T represents the maximum delay spread, Δ Fdenotes the maximum Doppler spread, the root sequence number u e {0, 1,..., P-1}, and the first-order coefficient index

[0301] Optionally, the cell information can be used to determine the root sequence number u. For example, the cell information indicates a cell identity (cell ID), and the cell identity takes a value of a, and u satisfies: u = a mod P.

[0302] Specifically, the first sequence can be the above quadratic polynomial exponential sequence, which is a self-correlation function optimal (or optimal) self-correlation sequence, and the inner product of any two quadratic polynomial exponential sequences is small. Therefore, in the case that different communication devices use different quadratic polynomial exponential sequences for communication, mutual interference can be reduced as much as possible.

[0303] Optionally, at least one of the following is satisfied: P is the smallest prime number not less than the sequence length N, the maximum Doppler spread Δ F = 1, and the root sequence number u is determined based on cell information, or the first-order coefficient index l = 0.

[0304] For example, for a multi-cell scenario, the interference rejection performance of three kinds of orthogonal cover codes (DFT sequence, Walsh sequence, and W sequence) is compared.

[0305] For example, for the DFT sequence: the sequences used by the current cell and the neighboring cell are the same, and the inter-cell interference is large.

[0306] The DFT sequence of the current cell is: The DFT sequence of the neighboring cell is:

[0307] For example, for the Walsh sequence: the sequences used by the current cell and the neighboring cell are the same, and the inter-cell interference is large.

[0308] The Walsh sequence of the current cell is: The Walsh sequence of the neighboring cell is:

[0309] For example, for the W sequence: the sequences used by the current cell and the neighboring cell are the same, and the inter-cell interference is small.

[0310] For example, the base sequence of the current cell is: [1 e -j2π / 5 e -j6π / 5 e -j4π / 5 ], and the corresponding parameter configuration is: λ = 1, k = 0, l = 0; the base sequence of the neighboring cell is: [1 e -j8π / 5 1 e -j8π / 5 ], and the corresponding parameter configuration is: λ = 1, k = 1, l = 0. The auxiliary sequence is obtained by swapping the 2nd row and the 3rd row of the DFT matrix:

[0311] W sequence of the cell:

[0312] W sequence of the neighbor cell:

[0313] Figure 6d compares the BLER performance of multi-cell different OCC schemes and OCC sequences, and the parameters can be implemented as shown in Figure 6c. It can be seen that for Inter-slot OCC, the W sequence is superior to the Walsh sequence (the Walsh sequence appears error flat @ BLER = 0.1) and the DFT sequence (the DFT sequence appears error flat @ BLER = 0.1); for Inter-symbol OCC, the W sequence is superior to the Walsh sequence (SNR gain 3.2 dB @ BLER = 0.1) and the DFT sequence (the DFT sequence appears error flat); the W sequence is superior to Intra-symbol OCC (the DFT sequence appears error flat).

[0314] Referring to Figure 7, an embodiment of the present application provides a communication apparatus 700, which can implement the functions of the first communication apparatus (or the second communication apparatus or the third communication apparatus or the fourth communication apparatus) in the above-mentioned method embodiment, and thus can also implement the beneficial effects possessed by the above-mentioned method embodiment. In the embodiment of the present application, the communication apparatus 700 can be the first communication apparatus (or the second communication apparatus or the third communication apparatus or the fourth communication apparatus), or an integrated circuit or element etc. inside the first communication apparatus (or the second communication apparatus or the third communication apparatus or the fourth communication apparatus), such as a chip, a baseband chip, a modem chip, an SoC chip (such as an SoC chip containing a modem core), a SIP chip, a communication module, a chip system, a processor, etc.

[0315] It should be noted that the transceiver unit 702 can include a sending unit and a receiving unit, which are respectively used to perform sending and receiving.

[0316] In a possible implementation, when the apparatus 700 is used to perform the method performed by the first communication apparatus in the above-mentioned method embodiment shown in Figure 5, the apparatus 700 includes a processing unit 701 and a transceiver unit 702; the processing unit 701 is configured to determine a first signal, the first signal being obtained based on a first sequence and / or a second sequence; wherein the first sequence is determined based on cell information, and the second sequence is determined based on one of N rows of elements contained in a first matrix, N sequences corresponding to the N rows of elements being orthogonal, N being an integer greater than 1; and the transceiver unit 702 is configured to send the first signal.

[0317] In a possible implementation, when the apparatus 700 is configured to perform the method performed by the second communication apparatus in the embodiment of the method shown in FIG. 5, the apparatus 700 includes a transceiver 702. The transceiver 702 is configured to receive a first signal, the first signal being based on a first sequence and / or a second sequence. The first sequence is determined based on cell information, and the second sequence is determined based on one of N rows of elements included in a first matrix, N sequences corresponding to the N rows of elements being orthogonal, N being an integer greater than 1.

[0318] It should be noted that the information processing process and the like of the units of the communication apparatus 700 are described in the foregoing method embodiments of the present application, and will not be described here.

[0319] FIG. 8 is another schematic structural diagram of a communication apparatus 800 provided by the present application. The communication apparatus 800 includes a logic circuit 801 and an input / output interface 802. The communication apparatus 800 can be a chip or an integrated circuit.

[0320] The transceiver 702 shown in FIG. 7 can be a communication interface. Similarly, the input / output interface 802 in FIG. 8 can also be a communication interface, which can include an input interface and an output interface. Alternatively, the input / output interface 802 can also be a transceiver circuit, which can include an input interface circuit and an output interface circuit.

[0321] Optionally, the logic circuit 801 is configured to determine a first signal, the first signal being based on a first sequence and / or a second sequence. The first sequence is determined based on cell information, and the second sequence is determined based on one of N rows of elements included in a first matrix, N sequences corresponding to the N rows of elements being orthogonal, N being an integer greater than 1. The input / output interface 802 is configured to send the first signal.

[0322] Optionally, the input / output interface 802 is configured to receive a first signal, the first signal being based on a first sequence and / or a second sequence. The first sequence is determined based on cell information, and the second sequence is determined based on one of N rows of elements included in a first matrix, N sequences corresponding to the N rows of elements being orthogonal, N being an integer greater than 1.

[0323] The logic circuit 801 and the input / output interface 802 can also perform other steps performed by the first communication apparatus or the second communication apparatus in any of the embodiments and achieve the corresponding beneficial effects, which will not be described here.

[0324] In a possible implementation, the processing unit 701 shown in FIG. 7 can be the logic circuit 801 in FIG. 8.

[0325] Optionally, the logic circuit 801 can be a processing device, and the functions of the processing device can be partially or entirely implemented by software.

[0326] Optionally, the processing device can include a memory and a processor, wherein the memory is configured to store a computer program, and the processor is configured to read and execute the computer program stored in the memory to perform the corresponding processing and / or steps in any one of the method embodiments.

[0327] Optionally, the processing device can only include the processor. The memory for storing the computer program is located outside the processing device, and the processor is connected with the memory through a circuit / wire to read and execute the computer program stored in the memory. The memory and the processor can be integrated together, or can be physically independent of each other.

[0328] Optionally, the processing device can be one or more chips or one or more integrated circuits. For example, the processing device can be one or more field-programmable gate arrays (FPGA), application specific integrated circuits (ASIC), system on chips (SoC), central processor units (CPU), network processors (NP), digital signal processors (DSP), micro controller units (MCU), programmable logic devices (PLD) or other integrated chips, or any combination of the above chips or processors, etc.

[0329] Please refer to FIG. 9, the communication device 900 involved in the above embodiments provided by the embodiments of the present application, the communication device 900 can be specifically the communication device as the terminal device in the above embodiments, and the communication device in the example shown in FIG. 9 is implemented by the terminal device (or components in the terminal device).

[0330] Optionally, the communication device 900 can include but is not limited to at least one processor 901 and a communication port 902.

[0331] The transceiving unit 702 shown in FIG. 7 can be a communication interface, which can be a communication port 902 in FIG. 9, and the communication port 902 can include an input interface and an output interface. Alternatively, the communication port 902 can also be a transceiving circuit, which can include an input interface circuit and an output interface circuit.

[0332] Further, the apparatus can further include at least one of a memory 903, a bus 904, and in the embodiments of the present application, the at least one processor 901 is configured to control and process the actions of the communication apparatus 900.

[0333] In addition, the processor 901 can be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array, or other programmable logic device, transistor logic device, hardware component, or any combination thereof. It can implement or execute the various exemplary logical blocks, modules, and circuits described in connection with the disclosure. The processor can also be a combination of computing functions, such as a combination of one or more microprocessors, a combination of a digital signal processor and a microprocessor, and the like. Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described system, apparatus, and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be described here.

[0334] It should be noted that the communication apparatus 900 shown in FIG. 9 can be specifically used to implement the steps implemented by the terminal device in the foregoing method embodiments, and achieve the corresponding technical effects of the terminal device. The specific implementation of the communication apparatus shown in FIG. 9 can refer to the description in the foregoing method embodiments, which will not be described here.

[0335] Please refer to FIG. 10, which is a structural schematic diagram of a communication apparatus 1000 provided by the embodiments of the present application and involved in the foregoing embodiments. The communication apparatus 1000 can be specifically the communication apparatus as the network device in the foregoing embodiments, and the communication apparatus in the example shown in FIG. 10 is implemented by a network device (or a component in the network device), wherein the structure of the communication apparatus can refer to the structure shown in FIG. 10.

[0336] The communication device 1000 comprises at least one processor 1011 and at least one network interface 1014. Further optionally, the communication device further comprises at least one memory 1012, at least one transceiver 1013 and one or more antennas 1015. The processor 1011, the memory 1012, the transceiver 1013 and the network interface 1014 are connected, for example, through a bus, which may, in embodiments of the present application, comprise various types of interfaces, transmission lines or buses, etc., and the present embodiments do not limit the same. The antenna 1015 is connected to the transceiver 1013. The network interface 1014 is configured to enable the communication device to communicate with other communication devices through a communication link. For example, the network interface 1014 can comprise a network interface between the communication device and a core network device, for example, an S1 interface, and the network interface can comprise a network interface between the communication device and other communication devices (for example, other network devices or core network devices), for example, an X2 or Xn interface.

[0337] The transceiver unit 702 shown in FIG. 7 can be a communication interface, which can be the network interface 1014 in FIG. 10, and the network interface 1014 can comprise an input interface and an output interface. Alternatively, the network interface 1014 can also be a transceiver circuit, which can comprise an input interface circuit and an output interface circuit.

[0338] The processor 1011 is mainly configured to process communication protocols and communication data, and control the whole communication device, execute software programs, process data of the software programs, for example, to support the communication device to perform the actions described in the embodiments. The communication device can comprise a baseband processor and a central processor, the baseband processor is mainly configured to process communication protocols and communication data, and the central processor is mainly configured to control the whole terminal device, execute software programs, and process data of the software programs. The processor 1011 in FIG. 10 can integrate the functions of the baseband processor and the central processor, and those skilled in the art can understand that the baseband processor and the central processor can also be independent processors interconnected through a bus. Those skilled in the art can understand that the terminal device can comprise a plurality of baseband processors to adapt to different network modes, and the terminal device can comprise a plurality of central processors to enhance the processing capability, and various components of the terminal device can be connected through various buses. The baseband processor can also be referred to as a baseband processing circuit or a baseband processing chip. The central processor can also be referred to as a central processing circuit or a central processing chip. The function of processing communication protocols and communication data can be built in the processor, or stored in the memory in the form of software programs, and the processor executes the software programs to realize the baseband processing function.

[0339] The memory is mainly used for storing software programs and data. The memory 1012 can exist independently and be connected to the processor 1011. Alternatively, the memory 1012 can be integrated with the processor 1011, for example, integrated in a chip. The memory 1012 can store program codes for implementing the technical solutions of the embodiments of the present application and be controlled to execute by the processor 1011. Various computer programs executed can also be regarded as a driver of the processor 1011.

[0340] FIG. 10 only shows one memory and one processor. In actual terminal devices, there can be multiple processors and multiple memories. The memory can also be referred to as a storage medium or a storage device, etc. The memory can be a storage element on the same chip as the processor, i.e., an on-chip storage element, or an independent storage element, and the embodiments of the present application do not limit this.

[0341] The transceiver 1013 can be used to support the reception or transmission of radio frequency signals between the communication device and the terminal. The transceiver 1013 can be connected to the antenna 1015. The transceiver 1013 includes a transmitter Tx and a receiver Rx. Specifically, one or more antennas 1015 can receive radio frequency signals, the receiver Rx of the transceiver 1013 is used to receive the radio frequency signals from the antenna and convert the radio frequency signals into digital baseband signals or digital intermediate frequency signals, and provide the digital baseband signals or digital intermediate frequency signals to the processor 1011 for further processing of the digital baseband signals or digital intermediate frequency signals by the processor 1011, such as demodulation processing and decoding processing. In addition, the transmitter Tx in the transceiver 1013 is also used to receive modulated digital baseband signals or digital intermediate frequency signals from the processor 1011, and convert the modulated digital baseband signals or digital intermediate frequency signals into radio frequency signals, and transmit the radio frequency signals through one or more antennas 1015. Specifically, the receiver Rx can selectively perform one or more levels of down-mixing and analog-to-digital conversion to obtain digital baseband signals or digital intermediate frequency signals, and the order of the down-mixing and analog-to-digital conversion can be adjustable. The transmitter Tx can selectively perform one or more levels of up-mixing and digital-to-analog conversion on the modulated digital baseband signals or digital intermediate frequency signals to obtain radio frequency signals, and the order of the up-mixing and digital-to-analog conversion can be adjustable. The digital baseband signals and the digital intermediate frequency signals can be collectively referred to as digital signals.

[0342] The transceiver 1013 can also be referred to as a transceiving unit, a transceiver, a transceiving device, etc. Optionally, a device in the transceiving unit for implementing a receiving function can be regarded as a receiving unit, and a device in the transceiving unit for implementing a sending function can be regarded as a sending unit, i.e., the transceiving unit includes the receiving unit and the sending unit, the receiving unit can also be referred to as a receiver, an input port, a receiving circuit, etc., and the sending unit can be referred to as a transmitter, a transmitter, or a transmitting circuit, etc.

[0343] It should be noted that the communication apparatus 1000 shown in FIG. 10 can be specifically used to implement the steps implemented by the network device in the foregoing method embodiments, and achieve the corresponding technical effects of the network device. The specific implementation of the communication apparatus 1000 shown in FIG. 10 can be referred to the description in the foregoing method embodiments, which will not be repeated here.

[0344] Please refer to FIG. 11, which is a structural schematic diagram of a communication apparatus involved in the foregoing embodiments provided by the embodiments of the present application.

[0345] It can be understood that the communication apparatus 110 includes, for example, modules, units, elements, circuits, or interfaces, etc., which are properly configured together to execute the technical solutions provided by the present application. The communication apparatus 110 can be the terminal device or the network device described above, or can be a component (such as a chip) of these devices, to implement the methods described in the following method embodiments. The communication apparatus 110 includes one or more processors 111. The processor 111 can be a general-purpose processor or a special-purpose processor, etc. For example, it can be a baseband processor or a central processing unit. The baseband processor can be used to process communication protocols and communication data, and the central processing unit can be used to control the communication apparatus (such as a RAN node, a terminal, or a chip, etc.), execute software programs, and process data of the software programs.

[0346] Optionally, in one design, the processor 111 can include a program 113 (which can also be referred to as code or instructions sometimes), which can be run on the processor 111, so that the communication apparatus 110 executes the methods described in the following embodiments. In another possible design, the communication apparatus 110 includes a circuit (not shown in FIG. 11).

[0347] Optionally, the communication apparatus 110 can include one or more memories 112, which have a program 114 (which can also be referred to as code or instructions sometimes) stored thereon, and the program 114 can be run on the processor 111, so that the communication apparatus 110 executes the methods described in the foregoing method embodiments.

[0348] Optionally, the processor 111 and / or the memory 112 can include an AI module 117, 118 for implementing AI-related functions. The AI module can be implemented by software, hardware, or a combination of software and hardware. For example, the AI module can include a radio intelligence control (RIC) module. For example, the AI module can be a near-real-time RIC or a non-real-time RIC.

[0349] Optionally, the processor 111 and / or the memory 112 can also store data. The processor and the memory can be separately arranged or integrated together.

[0350] Optionally, the communication apparatus 110 can also include a transceiver 115 and / or an antenna 116. The processor 111 can also be referred to as a processing unit, which controls the communication apparatus (e.g., a RAN node or a terminal). The transceiver 115 can also be referred to as a transceiving unit, a transceiver, a transceiving circuit, or a transceiver, which is used to realize the transceiving function of the communication apparatus through the antenna 116.

[0351] In the figure, the processing unit 701 can be the processor 111, and the transceiving unit 702 can be a communication interface, which can be the transceiver 115 in the figure 11. The transceiver 115 can include an input interface and an output interface. Alternatively, the transceiver 115 can be a transceiving circuit, which can include an input interface circuit and an output interface circuit.

[0352] The embodiments of the present application also provide a computer readable storage medium for storing one or more computer execution instructions, when the computer execution instructions are executed by a processor, the processor executes the method described in the possible implementation manners of the first communication apparatus or the second communication apparatus.

[0353] The embodiments of the present application also provide a computer program product (or a computer program), when the computer program product is executed by the processor, the processor executes the method described in the possible implementation manners of the first communication apparatus or the second communication apparatus or the third communication apparatus or the fourth communication apparatus.

[0354] The embodiments of the present application further provide a chip system, which comprises at least one processor for supporting the communication device to implement the functions involved in the possible implementation manners of the communication device. Optionally, the chip system further comprises an interface circuit for providing the at least one processor with program instructions and / or data. In a possible design, the chip system can further comprise a memory for storing the necessary program instructions and data of the communication device. The chip system can be composed of a chip, or can include the chip and other discrete components, and the communication device can be the first communication device, the second communication device, the third communication device or the fourth communication device in the foregoing method embodiments.

[0355] The embodiments of the present application further provide a communication system, which comprises the first communication device and the second communication device in any of the foregoing embodiments. Alternatively, the communication system comprises the third communication device and / or the fourth communication device in any of the foregoing embodiments.

[0356] In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented in other manners. For example, the device embodiments described above are only schematic; the division of the units is only a logical function division; there can be another division manner for the actual implementation, for example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections between the units can be indirect couplings or communication connections through some interfaces, devices or units, and can be electrical, mechanical or in other forms.

[0357] The units described as separated components can or can not be physically separated, and the components displayed as units can or can not be physical units, i.e., can be located in one place, or can be distributed on a plurality of network units. According to actual needs, some or all of the units can be selected to implement the purposes of the embodiments of the present application.

[0358] In addition, each function unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software function unit. When the integrated unit is realized in the form of a software function unit and sold or used as an independent product, it can be stored in a computer readable storage medium. Based on such an understanding, the technical solutions of the present application, essentially or in the form of a contribution, or all or part 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 several 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 each embodiment of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, and various media that can store program codes.

Claims

1. A communication method characterized by comprising: The method comprises: determining a first signal, the first signal being determined based on a first sequence and / or a second sequence; wherein the first sequence is determined based on cell information, and the second sequence is determined based on one of N rows of elements contained in a first matrix, N sequences corresponding to the N rows of elements being orthogonal, N being an integer greater than 1; sending the first signal.

2. The method of claim 1, wherein, The first matrix S satisfies any one of the following: or 3. The method according to claim 1 or 2, characterized in that, The second sequence is determined based on one of N rows of elements contained in the first matrix, comprising: a plurality of elements contained in the second sequence are identical to one of the N rows of elements contained in the first matrix; and / or an arrangement order of the plurality of elements contained in the second sequence is identical to an arrangement order of one of the N rows of elements contained in the first matrix.

4. The method according to any one of claims 1 to 3, characterized in that, The first matrix is determined based on a second matrix, the second matrix being a Discrete Fourier Transform (DFT) matrix or an Inverse Discrete Fourier Transform (IDFT) matrix.

5. The method of claim 4, wherein, The first matrix is determined based on the second matrix, satisfying: an ith column of elements contained in the first matrix is identical to a jth column of elements contained in the second matrix; the jth column of elements contained in the first matrix is identical to the ith column of elements contained in the second matrix; a kth column of elements contained in the first matrix is identical to the kth column of elements contained in the second matrix; wherein i and j are any two unequal integers from 1 to N, k is an integer from 1 to N, and k is not equal to i and j.

6. The method of claim 5, wherein, N is 4, i, j and k satisfy any one of the following: i is 1, j is 2, k is 3 and 4; i is 2, j is 3, k is 1 and 4; i is 3, j is 4, k is 1 and 2; or i is 4, j is 1, k is 2 and 3.

7. The method according to any one of claims 1 to 6, characterized in that, N = 4, the first sequence B(n) satisfies at least one of the following: B(n) = [1 1 1 1]; B(n) = [1 e -j2π / 5 e -j6π / 5 e -j2π / 5 ]; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j4π / 5 ]; B(n) = [1 e -j6π / 5 e -j8π / 5 e -j6π / 5 ]; B(n) = [1 e -j8π / 5 e -j4π / 5 e -j8π / 5 ]; B(n) = [1 e -j2π / 5 e -j6π / 5 e -j4π / 5 ]; B(n) = [1 e -j8π / 5 1 e -j8π / 5 ]; B(n) = [1 e -j4π / 5 e -j4π / 5 e -j2π / 5 ]; B(n) = [1 1 e -j8π / 5 e -j6π / 5 ]; B(n) = [1 e -j6π / 5 e -j2π / 5 1]; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j8π / 5 ]; B(n) = [1 e -j6π / 5 1 e -j6π / 5 ]; B(n) = [1 e -j8π / 5 e -j8π / 5 e -j4π / 5 ]; B(n) = [1 1 e -j6π / 5 e -j2π / 5 ]; B(n) = [1 e -j2π / 5 e -j4π / 5 1]; B(n) = [1 e -j6π / 5 e -j8π / 5 e -j2π / 5 ]; B(n) = [1 e -j4π / 5 1 e -j4π / 5 ]; B(n) = [1 e -j2π / 5 e -j2π / 5 e -j6π / 5 ]; B(n) = [1 1 e -j4π / 5 e -j8π / 5 ]; B(n) = [1 e -j8π / 5 e -j6π / 5 1]; B(n) = [1 e -j8π / 5 e -j4π / 5 e -j6π / 5 ] ; B(n) = [1 e -j2π / 5 1 e -j2π / 5 ] ; B(n) = [1 e -j6π / 5 e -j6π / 5 e -j8π / 5 ] ; B(n) = [1 1 e -j2π / 5 e -j4π / 5 ] ; or, B(n) = [1 e -j4π / 5 e -j8π / 5 1].

8. The method according to any one of claims 1 to 7, characterized in that, The first sequence B(n) satisfies: where e is a natural constant, N is a sequence length, P is a maximum prime number not greater than the sequence length N or a minimum prime number not smaller than the sequence length N, Δ T denotes a maximum delay spread, Δ F denotes a maximum Doppler spread, a cubic term coefficient index λ ∈ {1, 2, …, P-1}, a quadratic term coefficient index coefficient index of the first order term 9. The method of claim 8, wherein, satisfying at least one of the following: P is a minimum prime number not less than the sequence length N, the maximum delay spread Δ T = 1, the maximum Doppler spread Δ F = 1, the values of the cubic term coefficient index λ and the quadratic term coefficient index k are determined based on the cell information, or the linear term coefficient index l = 0.

10. The method according to any one of claims 1 to 7, characterized in that, The first sequence B(n) satisfies: where e is a natural constant, N is a sequence length, P is a largest prime number not greater than the sequence length N or a smallest prime number not smaller than the sequence length N, Δ T denotes a maximum delay spread, Δ F denotes a maximum Doppler spread, a root sequence number u e {0, 1,..., P-1}, a first term coefficient index 11. The method of claim 10, wherein, satisfying at least one of the following: P is a minimum prime number not less than the sequence length N, the maximum Doppler spread Δ F = 1, the root sequence number u is determined based on the cell information, or, the first-order term coefficient index l = 0.

12. The method according to any one of claims 1 to 11, characterized in that, The method further comprises: receiving any one of the following information: first information used for indicating the first sequence; second information used for indicating the second sequence; or third information used for indicating a third sequence, the third sequence being determined based on the first sequence and the second sequence.

13. A method of communication, comprising: The method comprises: determining a first resource; receiving a first signal based on the first resource, the first signal being determined based on a first sequence and / or a second sequence; wherein the first sequence is determined based on cell information, and the second sequence is determined based on a second matrix, the second matrix being a DFT matrix or an IDFT matrix, N being an integer greater than 1.

14. The method of claim 13, wherein, The first matrix S satisfies any one of the following: or 15. The method according to claim 13 or 14, characterized in that, The second sequence is determined based on one of N rows of elements contained in the first matrix, comprising: a plurality of elements contained in the second sequence are identical to one of the N rows of elements contained in the first matrix; and / or an arrangement order of the plurality of elements contained in the second sequence is identical to an arrangement order of one of the N rows of elements contained in the first matrix.

16. The method according to any one of claims 13 to 15, characterized in that, The first matrix is obtained based on the second matrix, and the second matrix is a discrete Fourier transform (DFT) matrix or a discrete inverse Fourier transform (IDFT) matrix.

17. The method of claim 16, wherein, The first matrix is obtained based on the second matrix, and the following conditions are met: An i-th column element in N column elements included in the first matrix is the same as a j-th column element in the N column elements included in the second matrix; A j-th column element in the N column elements included in the first matrix is the same as the i-th column element in the N column elements included in the second matrix; A k-th column element in the N column elements included in the first matrix is the same as a k-th column element in the N column elements included in the second matrix; wherein i and j are any two unequal integers from 1 to N, k is an integer from 1 to N, and k is not equal to i and j.

18. The method of claim 17, wherein, N is 4, and i, j and k meet any of the following conditions: i is 1, j is 2, k is 3 and 4; i is 2, j is 3, k is 1 and 4; i is 3, j is 4, k is 1 and 2; or i is 4, j is 1, k is 2 and 3.

19. The method according to any one of claims 13 to 18, characterized in that, N = 4, the first sequence B(n) satisfies at least one of the following: B(n) = [1 1 1 1]; B(n) = [1 e -j2π / 5 e -j6π / 5 e -j2π / 5 ] ; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j4π / 5 ] ; B(n) = [1 e -j6π / 5 e -j8π / 5 e -j6π / 5 ] ; B(n) = [1 e -j8π / 5 e -j4π / 5 e -j8π / 5 ] ; B(n) = [1 e -j2π / 5 e -j6π / 5 e -j4π / 5 ] ; B(n) = [1 e -j8π / 5 1 e -j8π / 5 ] ; B(n) = [1 e -j4π / 5 e -j4π / 5 e -j2π / 5 ] ; B(n) = [1 1 e -j8π / 5 e -j6π / 5 ] ; B(n) = [1 e -j6π / 5 e -j2π / 5 1] ; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j8π / 5 ] ; B(n) = [1 e -j6π / 5 1 e -j6π / 5 ] ; B(n) = [1 e -j8π / 5 e -j8π / 5 e -j4π / 5 ] ; B(n) = [1 1 e -j6π / 5 e -j2π / 5 ] ; B(n) = [1 e -j2π / 5 e -j4π / 5 1] ; B(n) = [1 e -j6π / 5 e -j8π / 5 e -j2π / 5 ] ; B(n) = [1 e -j4π / 5 1 e -j4π / 5 ] ; B(n) = [1 e -j2π / 5 e -j2π / 5 e -j6π / 5 ] ; B(n) = [1 1 e -j4π / 5 e -j8π / 5 ] ; B(n) = [1 e -j8π / 5 e -j6π / 5 1] ; B(n) = [1 e -j8π / 5 e -j4π / 5 e -j6π / 5 ]; B(n)=[1 e -j2π / 5 1 e -j2π / 5 ]; B(n)=[1 e -j6π / 5 e -j6π / 5 e -j8π / 5 ]; B(n)=[1 1 e -j2π / 5 e -j4π / 5 ]; or, B(n)=[1 e -j4π / 5 e -j8π / 5 1].

20. The method according to any one of claims 13 to 19, characterized in that, The first sequence B(n) satisfies: where e is a natural constant, N is a sequence length, P is a maximum prime number not greater than the sequence length N or a minimum prime number not smaller than the sequence length N, Δ T denotes a maximum delay spread, Δ F denotes a maximum Doppler spread, a cubic term coefficient index λ ∈ {1, 2, …, P-1}, a quadratic term coefficient index coefficient index of the first order term 21. The method of claim 20, wherein, At least one of the following conditions is met: P is a minimum prime number not less than the sequence length N, the maximum delay spread Δ T = 1, the maximum Doppler spread Δ F = 1, the values of the cubic term coefficient index λ and the quadratic term coefficient index k are determined based on the cell information, or the linear term coefficient index l = 0.

22. The method according to any one of claims 13 to 21, characterized in that, The first sequence B(n) satisfies: where e is a natural constant, N is a sequence length, P is a largest prime number not greater than the sequence length N or a smallest prime number not smaller than the sequence length N, Δ T denotes a maximum delay spread, Δ F denotes a maximum Doppler spread, a root sequence number u e {0, 1,..., P-1}, a one-term coefficient index 23. The method of claim 22, wherein, At least one of the following conditions is met: P is a minimum prime number not less than the sequence length N, the maximum Doppler spread Δ F = 1, the root sequence number u is determined based on the cell information, or, the first-order term coefficient index l = 0.

24. The method according to any one of claims 13 to 23, characterized in that, The method further includes: sending any of the following information: first information used to indicate the first sequence; second information used to indicate the second sequence; or third information used to indicate a third sequence, the third sequence being obtained based on the first sequence and the second sequence.

25. A communications device, characterized by including: a processing unit configured to determine a first signal, the first signal being obtained based on a first sequence and / or a second sequence; wherein the first sequence is determined based on cell information, and the second sequence is determined based on a row element in N row elements included in a first matrix, N sequences corresponding to the N row elements being orthogonal, N being an integer greater than 1; a transceiver unit configured to send the first signal.

26. The apparatus of claim 25, wherein, The first matrix S satisfies any one of the following: or 27. The apparatus of claim 25 or 26, wherein, The second sequence is determined based on a row element in N row elements included in the first matrix, and the second sequence includes: a plurality of elements included in the second sequence are the same as the row element in the N row elements included in the first matrix; and / or an arrangement order of the plurality of elements included in the second sequence is the same as an arrangement order of the row element in the N row elements included in the first matrix.

28. The apparatus of any one of claims 25 to 27, wherein, The first matrix is obtained based on the second matrix, and the second matrix is a discrete Fourier transform (DFT) matrix or a discrete inverse Fourier transform (IDFT) matrix.

29. The apparatus of claim 28, wherein, The first matrix is obtained based on the second matrix, and the following conditions are met: An i-th column element in N column elements included in the first matrix is the same as a j-th column element in the N column elements included in the second matrix; A j-th column element in the N column elements included in the first matrix is the same as the i-th column element in the N column elements included in the second matrix; A k-th column element in the N column elements included in the first matrix is the same as a k-th column element in the N column elements included in the second matrix; wherein i and j are any two unequal integers from 1 to N, k is an integer from 1 to N, and k is not equal to i and j.

30. The apparatus of claim 29, wherein, N is 4, i, j and k satisfy any one of the following: i is 1, j is 2, k is 3 and 4; i is 2, j is 3, k is 1 and 4; i is 3, j is 4, k is 1 and 2; or i is 4, j is 1, k is 2 and 3.

31. The apparatus of any one of claims 25 to 30, wherein, N = 4, the first sequence B(n) satisfies at least one of the following: B(n) = [1 1 1 1]; B(n) = [1 e -j2π / 5 e -j6π / 5 e -j2π / 5 ]; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j4π / 5 ]; B(n) = [1 e -j6π / 5 e -j8π / 5 e -j6π / 5 ]; B(n) = [1 e -j8π / 5 e -j4π / 5 e -j8π / 5 ]; B(n) = [1 e -j2π / 5 e -j6π / 5 e -j4π / 5 ]; B(n) = [1 e -j8π / 5 1 e -j8π / 5 ]; B(n) = [1 e -j4π / 5 e -j4π / 5 e -j2π / 5 ]; B(n) = [1 1 e -j8π / 5 e -j6π / 5 ]; B(n) = [1 e -j6π / 5 e -j2π / 5 1]; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j8π / 5 ]; B(n) = [1 e -j6π / 5 1 e -j6π / 5 ]; B(n) = [1 e -j8π / 5 e -j8π / 5 e -j4π / 5 ]; B(n) = [1 1 e -j6π / 5 e -j2π / 5 ]; B(n) = [1 e -j2π / 5 e -j4π / 5 1]; B(n) = [1 e -j6π / 5 e -j8π / 5 e -j2π / 5 ]; B(n) = [1 e -j4π / 5 1 e -j4π / 5 ]; B(n) = [1 e -j2π / 5 e -j2π / 5 e -j6π / 5 ]; B(n) = [1 1 e -j4π / 5 e -j8π / 5 ]; B(n) = [1 e -j8π / 5 e -j6π / 5 1]; B(n) = [1 e -j8π / 5 e -j4π / 5 e -j6π / 5 ] ; B(n) = [1 e -j2π / 5 1 e -j2π / 5 ] ; B(n) = [1 e -j6π / 5 e -j6π / 5 e -j8π / 5 ] ; B(n) = [1 1 e -j2π / 5 e -j4π / 5 ] ; or, B(n) = [1 e -j4π / 5 e -j8π / 5 1].

32. The apparatus of any one of claims 25 to 31, wherein, The first sequence B(n) satisfies: where e is a natural constant, N is a sequence length, P is a maximum prime number not greater than the sequence length N or a minimum prime number not smaller than the sequence length N, Δ T denotes a maximum delay spread, Δ F denotes a maximum Doppler spread, a cubic term coefficient index λ ∈ {1, 2, …, P-1}, a quadratic term coefficient index coefficient index of the first order term 33. The apparatus of claim 32, wherein, At least one of the following is satisfied: P is a minimum prime number not less than the sequence length N, the maximum delay spread Δ T = 1, the maximum Doppler spread Δ F = 1, the value of the cubic term coefficient index λ and the quadratic term coefficient index k is determined based on the cell information, or the linear term coefficient index l = 0.

34. The apparatus of any one of claims 25 to 31, wherein, The first sequence B(n) satisfies: where e is a natural constant, N is a sequence length, P is a largest prime number not greater than the sequence length N or a smallest prime number not smaller than the sequence length N, Δ T denotes a maximum delay spread, Δ F denotes a maximum Doppler spread, a root sequence number u e {0, 1,..., P-1}, a first term coefficient index 35. The apparatus of claim 34, wherein, At least one of the following is satisfied: P is a minimum prime number not less than the sequence length N, the maximum Doppler spread Δ F = 1, the root sequence number u is determined based on the cell information, or, the first-order term coefficient index l = 0.

36. The apparatus of any one of claims 25-35, wherein, the transceiver is further configured to receive any one of the following: first information indicating the first sequence; second information indicating the second sequence; or third information indicating a third sequence, the third sequence being derived based on the first sequence and the second sequence.

37. A communications device, characterized by comprising: a processing unit configured to determine a first resource; a transceiver configured to receive a first signal based on the first resource, the first signal being derived based on a first sequence and / or a second sequence; wherein the first sequence is determined based on cell information, and the second sequence is derived based on a second matrix, the second matrix being a DFT matrix or an IDFT matrix, and N being an integer greater than 1.

38. The device of claim 37, wherein, The first matrix S satisfies any one of the following: or 39. The device of claim 37 or 38, wherein, the second sequence is determined based on one of N row elements included in the first matrix, comprising: a plurality of elements included in the second sequence are identical to one of the N row elements included in the first matrix; and / or an arrangement order of the plurality of elements included in the second sequence is identical to an arrangement order of one of the N row elements included in the first matrix.

40. The apparatus of any one of claims 37-39, wherein, the first matrix is derived based on a second matrix, the second matrix being a Discrete Fourier Transform, DFT, matrix or an Inverse Discrete Fourier Transform, IDFT, matrix.

41. The device of claim 40, wherein, the first matrix is derived based on the second matrix, satisfying: an ith column element of N column elements included in the first matrix is identical to a jth column element of N column elements included in the second matrix; the jth column element of the N column elements included in the first matrix is identical to the ith column element of the N column elements included in the second matrix; a kth column element of the N column elements included in the first matrix is identical to the kth column element of the N column elements included in the second matrix; wherein i and j are any two unequal integers from 1 to N, and k is an integer from 1 to N, and k is not equal to i and j.

42. The device of claim 41, wherein, N is 4, i, j and k satisfy any one of the following: i is 1, j is 2, k is 3 and 4; i is 2, j is 3, k is 1 and 4; i is 3, j is 4, k is 1 and 2; or i is 4, j is 1, k is 2 and 3.

43. The device of any one of claims 37 to 42, wherein, N = 4, the first sequence B(n) satisfies at least one of the following: B(n) = [1 1 1 1]; B(n) = [1 e -j2π / 5 e -j6π / 5 e -j2π / 5 ] ; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j4π / 5 ] ; B(n) = [1 e -j6π / 5 e -j8π / 5 e -j6π / 5 ] ; B(n) = [1 e -j8π / 5 e -j4π / 5 e -j8π / 5 ] ; B(n) = [1 e -j2π / 5 e -j6π / 5 e -j4π / 5 ] ; B(n) = [1 e -j8π / 5 1 e -j8π / 5 ] ; B(n) = [1 e -j4π / 5 e -j4π / 5 e -j2π / 5 ] ; B(n) = [1 1 e -j8π / 5 e -j6π / 5 ] ; B(n) = [1 e -j6π / 5 e -j2π / 5 1] ; B(n) = [1 e -j4π / 5 e -j2π / 5 e -j8π / 5 ] ; B(n) = [1 e -j6π / 5 1 e -j6π / 5 ] ; B(n) = [1 e -j8π / 5 e -j8π / 5 e -j4π / 5 ] ; B(n) = [1 1 e -j6π / 5 e -j2π / 5 ] ; B(n) = [1 e -j2π / 5 e -j4π / 5 1] ; B(n) = [1 e -j6π / 5 e -j8π / 5 e -j2π / 5 ] ; B(n) = [1 e -j4π / 5 1 e -j4π / 5 ] ; B(n) = [1 e -j2π / 5 e -j2π / 5 e -j6π / 5 ] ; B(n) = [1 1 e -j4π / 5 e -j8π / 5 ] ; B(n) = [1 e -j8π / 5 e -j6π / 5 1] ; B(n) = [1 e -j8π / 5 e -j4π / 5 e -j6π / 5 ]; B(n)=[1 e -j2π / 5 1 e -j2π / 5 ]; B(n)=[1 e -j6π / 5 e -j6π / 5 e -j8π / 5 ]; B(n)=[1 1 e -j2π / 5 e -j4π / 5 ]; or, B(n)=[1 e -j4π / 5 e -j8π / 5 1].

44. The device of any one of claims 37 to 43, wherein, The first sequence B(n) satisfies: where e is a natural constant, N is a sequence length, P is a maximum prime number not greater than the sequence length N or a minimum prime number not smaller than the sequence length N, Δ T denotes a maximum delay spread, Δ F denotes a maximum Doppler spread, a cubic term coefficient index λ ∈ {1, 2, …, P-1}, a quadratic term coefficient index coefficient index of the first order term 45. The device of claim 44, wherein, At least one of the following is satisfied: P is a minimum prime number not less than the sequence length N, the maximum delay spread Δ T = 1, the maximum Doppler spread Δ F = 1, the values of the cubic term coefficient index λ and the quadratic term coefficient index k are determined based on the cell information, or the linear term coefficient index l = 0.

46. The device of any one of claims 37 to 45, wherein, The first sequence B(n) satisfies: where e is a natural constant, N is a sequence length, P is a largest prime number not greater than the sequence length N or a smallest prime number not smaller than the sequence length N, Δ T denotes a maximum delay spread, Δ F denotes a maximum Doppler spread, a root sequence number u e {0, 1,..., P-1}, a one-term coefficient index 47. The device of claim 46, wherein, At least one of the following is satisfied: P is a minimum prime number not less than the sequence length N, the maximum Doppler spread Δ F = 1, the root sequence number u is determined based on the cell information, or, the first-order term coefficient index l = 0.

48. The apparatus of any one of claims 37-47, wherein, the transceiver is further configured to transmit any one of the following: first information indicating the first sequence; second information indicating the second sequence; or third information indicating a third sequence, the third sequence being derived based on the first sequence and the second sequence. A third information is used to indicate a third sequence, which is obtained based on the first sequence and the second sequence.

49. A communications device, characterized by The communication device is a chip or a chip system.

50. The communication apparatus of claim 49, wherein The communication device is a chip or a chip system.

51. A computer-readable storage medium, comprising: The computer readable storage medium stores a computer program or instructions, which, when executed by a communication device, implement the method of any one of claims 1-24.

52. A computer program product, characterized in that, The computer readable storage medium stores a computer program or instructions, which, when executed by a communication device, implement the method of any one of claims 1-24.

Images