Communication method, apparatus and system

Abstract

Provided in the present application are a communication method, an apparatus and a system, which are applicable to communication scenarios involving sequence transmission, such as transmission scenarios of reference signals, for example, application scenarios such as channel measurement and channel estimation. In the method, sequences are generated on the basis of Golay complementary pairs (GCP) and modulation sampling by continuous phase modulation (CPM). The sequences obtained by this method have good sequence autocorrelation properties, for instance, an autocorrelation value of a CPM sequence in a time domain at a zero position is significantly greater than values at other positions. The GCP is modulated by means of the CPM, such that the phase at the end position of the sequence in the time domain is made continuous with the phase at the starting position, and the PAPR value of the sequence is reduced, thereby enhancing the coverage capability of the sequence, and further improving the accuracy of processes such as channel estimation and channel probing.

Description

Communication method, device and system

[0001] This application claims priority to the Chinese patent application filed with the China Patent Office on January 2, 2024, with application number 202410006584.7 and invention name “Communication Method, Device and System”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of communications, and in particular to a communication method, device, and system. Background Art

[0003] To achieve uplink synchronization between the terminal and the base station and obtain resources for Message 3, the terminal needs to send a physical random access channel (PRACH) signal to the base station. Furthermore, to enable the receiver to perform channel estimation or channel sounding, the transmitter needs to add various reference signals to the transmitted data. Reference signals are primarily used for channel information measurement, data demodulation, beam training, and time-frequency parameter tracking. However, the current coverage capabilities of PRACH signals and reference signals need to be enhanced. Summary of the Invention

[0004] The present application provides a communication method, device and system that can improve signal coverage capabilities.

[0005] In the first aspect, a communication method is provided, which can be executed by a sending device, or by a module (such as a chip or circuit) in the sending device, or by a logical node, logical module or software that can implement all or part of the functions of the sending device. This application does not limit this.

[0006] The method comprises: generating a signal, wherein the signal is obtained according to a first sequence, wherein the first sequence is a sequence obtained by sampling GCP and continuous phase modulation CPM based on a Golay complementary sequence; and sending the signal.

[0007] This method produces sequences with excellent autocorrelation performance. For example, the autocorrelation value of a CPM sequence in the time domain is significantly greater at zero than at other locations. By modulating the GCP with CPM, the phase at the end and starting points of the sequence in the time domain are continuous, reducing the PAPR of the sequence. This enhances the sequence's coverage capability and further improves the accuracy of channel estimation and detection.

[0008] In certain implementations, the GCP is acquired; and CPM modulation sampling is performed on the GCP to obtain the first sequence.

[0009] In certain implementations, the GCP comprises the sequence {C e} and the sequence {D e}, performing CPM modulation sampling on the GCP to obtain the first sequence includes: performing CPM modulation sampling on the second sequence to obtain the first sequence, the second sequence being based on the sequence {C e} and the sequence {D e}got.

[0010] In some implementations, the second sequence is obtained by e} and the {D e}Obtained by performing at least one of the following processing: truncation, expansion, splicing, and amplitude modulation.

[0011] In some implementations, based on the {C e} obtain the first subsequence, based on the {D e} obtain a second subsequence, the length of the first subsequence is less than the {C e}, the length of the second subsequence is less than the length of {D e} length; obtaining the second sequence based on the first subsequence and the second subsequence, the second sequence including all elements of the first subsequence and the second subsequence, and the length of the second sequence being the sum of the length of the first subsequence and the length of the second subsequence.

[0012] In some implementations, based on the {C e} obtain the third subsequence, based on the {D e} obtain a fourth subsequence, the length of the third subsequence is the same as that of the fourth subsequence, and the length of the third subsequence is greater than that of the {C e}, the length of the fourth subsequence is greater than the length of {D e} length; obtaining the second sequence based on the third subsequence and the fourth subsequence, the second sequence including all elements of the third subsequence and the fourth subsequence, and the length of the second sequence being the sum of the length of the third subsequence and the length of the fourth subsequence.

[0013] In certain implementations, the GCP comprises two sequences {C e} and {D e}, C e For the sequence {C e}, the e-th element, D e For the sequence {D e}, where e is 0 to 2. v -1, the C e and the De The following relationship is satisfied:

[0014] Among them, the For the XOR operation, the C′ e and D′ e is the element in the GCP sequence before the XOR operation, and the e is 0 to 2 v Integer between -1, C′ -1 =1, D′ -1 =1.

[0015] In some implementations, s n The output sequence of the CPM modulator is {s n}, the elements in the n satisfy:

[0016] Among them, the b i is the sequence {b k}, i is an integer between 0 and K-1, h is the modulation index, L is the impulse length, R is the sampling rate, T is the symbol period, and K is {b k}, the values ​​of h, L, R, T and K are all real numbers, q(t) is the phase response function,

[0017] In some implementations, the {b k}Satisfies the following relationship:

[0018] Where P is the denominator of the modulation index h, K is the {b k} length, b i For the {b k} the i-th element in .

[0019] In some implementations, the CPM modulator outputs the sequence {s n Any element s of n , the value is taken from the continuous L+1 b i OK, the b i The sequence {b k}, where L is a positive integer and i is an integer between 0 and K-1.

[0020] In some implementations, the s n The following relationship is satisfied:

[0021] Among them, the b i is the sequence {b k}, i is an integer between 0 and K-1, h is the modulation index, M is the modulation order, L is the impulse length, R is the sampling rate, T is the symbol period, and K is {b k}, h, M, L, R, T and K are all real numbers, q(t) is the phase response function,

[0022] In some implementations, the {b k} satisfies the following relationship: b -1 =b K-1 ,b -2 =b K-2 ,…b -L =b K-L

[0023] Wherein, the K is the {b k}, where L is the impact length and the value of L is a real number.

[0024] In some implementations, the {s n} is an M-order non-negative amplitude modulation, where M is a real number.

[0025] In some implementations, the method further includes: modulating the sampled sequence {s n} obtain a third sequence, wherein the odd-numbered elements of the third sequence are the same as the odd-numbered elements of the {s n} are the same as the odd-numbered elements of the third sequence, and the even-numbered elements of the third sequence are the same as the even-numbered elements of the third sequence. n} are opposite to each other, or the odd-numbered elements of the third sequence are opposite to the odd-numbered elements of {s n} are opposite to each other, and the even-numbered elements of the third sequence are opposite to the even-numbered elements of {s n} have the same even-numbered elements; and performing discrete Fourier transform (DFT) processing on the third sequence to obtain a fifth sequence.

[0026] In some implementations, the method further includes: based on the CPM modulated sampled sequence {s n}Perform discrete Fourier transform DFT processing to obtain a fourth sequence; perform cyclic shift processing based on the fourth sequence to obtain the fifth sequence.

[0027] In some implementations, in the cyclic shift process, the number of bits of the cyclic shift is the sequence {s n} is half the number of elements in .

[0028] In some implementations, the elements f in the first sequence {f n} satisfy: f n = x n = x n e j2πan , 0 ≤ n ≤ Q - 1

[0029] where a is the cyclic shift value, which is obtained according to the configuration information, Q is the number of elements in the fifth sequence {x n}, and x n is any element in the fifth sequence {x n}.

[0030] In some implementations, the generated signal includes: mapping Q elements in the first sequence to Q consecutive subcarriers; or, mapping Q elements in the first sequence to Q non - consecutive and equally - spaced subcarriers; or, mapping Q' elements in the first sequence to Q' consecutive subcarriers; or, mapping Q' elements in the first sequence to Q' non - consecutive and equally - spaced subcarriers, where Q' < Q and is a positive integer, and Q is the number of elements in the first sequence.

[0031] In some implementations. The GCP includes the sequence {C e} and the sequence {D e}, and {C e} and {D e} satisfy:

[0032] where ρ γ (k) represents the aperiodic cross - correlation value of the sequence γ, which is defined as follows:

[0033] where N is the length of the sequence γ, represents taking the conjugate value of γ n .

[0034] In some implementations, the second sequence is any of the following:

[0035] -1, -1, 1,1, -1, -1, -1, 1, -1, -1, 1,1, 1, -1, -1, 1,1, -1, -1, 1,1, 1, -1, 1,1, -1, -1, -1, 1,1, or,

[0036] -1, -1, 1,1, -1, -1, -1, 1, -1, -1, 1,1, 1, -1, -1, 1,1, 1, -1, -1, 1,1, 1, -1, 1,1, -1, -1, -1, 1,1, -1, or,

[0037] -1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,1, or,

[0038] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1, or,

[0039] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1,-1,1 ,1,-1,-1,-1,1,1,- ...

[0040] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1, or,

[0041] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1, 1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1,-1, or,

[0042] -1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,1 ,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1 ,1,-1,-1,1,-1,-1,1,1,1,- ...

[0043] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1 1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1,- 1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1, or,

[0044] -1,-1,1,1,1,- ... 1,1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1 ,1,1,- ...

[0045] -1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,i,-1,-1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1 ,-1,1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1. ,

[0046] On the second aspect, a communication method is provided, which can be executed by a receiving device, or by a module (such as a chip or circuit) in the receiving device, or by a logical node, logical module or software that can realize all or part of the functions of the receiving device. This application does not limit this.

[0047] The method includes: receiving a signal, performing orthogonal frequency division multiplexing (OFDM) demodulation on the signal to obtain a sixth sequence; generating a first sequence, where the first sequence is a sequence obtained by sampling GCP and continuous phase modulation (CPM) based on a Gray complementary sequence; and determining a first result based on the first sequence and the sixth sequence.

[0048] In certain implementations, the method further includes: acquiring the GCP; and performing CPM modulation sampling on the GCP to obtain the first sequence.

[0049] In certain implementations, the GCP comprises the sequence {C e} and the sequence {D e}, performing CPM modulation sampling on the GCP to obtain the first sequence includes: performing CPM modulation sampling on the second sequence to obtain the first sequence, the second sequence being based on the sequence {C e} and the sequence {D e}got.

[0050] In some implementations, the second sequence is obtained by e} and the {D e}Obtained by performing at least one of the following processing: truncation, expansion, splicing, and amplitude modulation.

[0051] In some implementations, based on the {C e} obtain the first subsequence, based on the {D e} obtain a second subsequence, the length of the first subsequence is less than the {C e}, the length of the second subsequence is less than the length of {D e} length; obtaining the second sequence based on the first subsequence and the second subsequence, the second sequence including all elements of the first subsequence and the second subsequence, and the length of the second sequence being the sum of the length of the first subsequence and the length of the second subsequence.

[0052] In some implementations, based on the {C e} obtain the third subsequence, based on the {D e} obtain a fourth subsequence, the third subsequence is the same length as the fourth subsequence, and the length of the first subsequence is greater than the {C e}, the length of the second subsequence is greater than the length of {D e} length; obtaining the second sequence based on the third subsequence and the fourth subsequence, the second sequence including all elements of the third subsequence and the fourth subsequence, and the length of the second sequence being the sum of the length of the first subsequence and the length of the second subsequence.

[0053] In certain implementations, the GCP comprises two sequences {C e} and {D e}, C e For the sequence {C e}, the e-th element, D e For the sequence {D e}, where e is 0 to 2. v -1, the C e and the D e The following relationship is satisfied:

[0054] Among them, the For the XOR operation, the C′ e and D′ e is the element in the GCP sequence before the XOR operation, and the e is 0 to 2 v Integer between -1, C′ -1 =1, D′ -1 =1.

[0055] In some implementations, s n The output sequence of the CPM modulator is {s n}, the elements in the n satisfy:

[0056] Among them, the b i is the sequence {b k}, i is an integer between 0 and K-1, h is the modulation index, L is the impulse length, R is the sampling rate, T is the symbol period, and K is {b k}, the values ​​of h, L, R, T and K are all real numbers, q(t) is the phase response function,

[0057] In some implementations, the {b k}Satisfies the following relationship:

[0058] Where P is the denominator of the modulation index h, K is the {b k} length, b i For the {b k} the i-th element in .

[0059] In some implementations, the CPM modulator outputs the sequence {s n Any element s of n , the value is taken from the continuous L+1 b i OK, the b i The sequence {b k}, where L is a positive integer and i is an integer between 0 and K-1.

[0060] In some implementations, the s n The following relationship is satisfied:

[0061] Among them, the b i is the sequence {b k}, i is an integer between 0 and K-1, h is the modulation index, M is the modulation order, L is the impulse length, R is the sampling rate, T is the symbol period, and K is {b k}, h, M, L, R, T and K are all real numbers, q(t) is the phase response function,

[0062] In some implementations, the {b k} satisfies the following relationship: b -1 =b K-1 ,b -2 =b K-2 ,…b -L =b K-L

[0063] Wherein, the K is the {b k}, where L is the impact length and the value of L is a real number.

[0064] In some implementations, the {s n} is an M-order non-negative amplitude modulation, where M is a real number.

[0065] In some implementations, the method further includes: modulating the sampled sequence {s n} obtain a third sequence, wherein the odd-numbered elements of the third sequence are the same as the odd-numbered elements of the {s n} are the same as the odd-numbered elements of the third sequence, and the even-numbered elements of the third sequence are the same as the even-numbered elements of the third sequence. n} are opposite to each other, or the odd-numbered elements of the third sequence are opposite to the odd-numbered elements of {s n} are opposite to each other, and the even-numbered elements of the third sequence are opposite to the even-numbered elements of {s n} have the same even-numbered elements; and performing discrete Fourier transform (DFT) processing on the third sequence to obtain a fifth sequence.

[0066] In some implementations, the method further includes: based on the CPM modulated sampled sequence {s n}Perform discrete Fourier transform DFT processing to obtain a fourth sequence; perform cyclic shift processing based on the fourth sequence to obtain the fifth sequence.

[0067] In some implementations, in the cyclic shift process, the number of bits of the cyclic shift is the sequence {s n} is half the number of elements in .

[0068] In some implementations, the first sequence {f n}Element f in n Satisfies: f n =x n e j2πan ,0≤n≤Q-1

[0069] Wherein a is a cyclic shift value, which is obtained according to configuration information, and Q is the fifth sequence {x n}, x n For the fifth sequence {x n}.

[0070] In some implementations, Q elements in the first sequence are mapped to Q consecutive subcarriers; or, Q elements in the first sequence are mapped to Q non-consecutive and equally spaced subcarriers; or, Q' elements in the first sequence are mapped to Q' consecutive subcarriers; or, Q' elements in the first sequence are mapped to Q' non-consecutive and equally spaced subcarriers, where Q' < Q and is a positive integer, and Q is the number of elements in the first sequence.

[0071] In some implementations. The GCP includes sequence {C e} and sequence {D e}, {C e} and {D e} satisfy:

[0072] where ρ γ (k) represents the aperiodic cross-correlation value of sequence γ, defined as follows:

[0073] where N is the length of sequence γ, represents taking the conjugate value of γ n .

[0074] In some implementations, the second sequence is any of the following:

[0075] -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, or,

[0076] -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, or,

[0077] -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, or,

[0078] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1, or,

[0079] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1,-1,1 ,1,-1,-1,-1,1,1,- ...

[0080] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1, or,

[0081] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1, 1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1,-1, or,

[0082] -1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,1 ,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1 ,1,-1,-1,1,-1,-1,1,1,1,- ...

[0083] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1 1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1,- 1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1, or,

[0084] -1,-1,1,1,1,- ... 1,1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1 ,1,1,- ...

[0085] -1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,i,-1,-1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1 ,-1,1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1. ,

[0086] It should be understood that the second aspect is an implementation method on the terminal device side corresponding to the first aspect. The explanations, supplements and descriptions of the beneficial effects of the first aspect are also applicable to the second aspect and will not be repeated here.

[0087] In a third aspect, a communication device is provided. The device may be a transmitting device, a module (e.g., a chip or circuit) within the transmitting device, or a logical node, logic module, or software capable of implementing all or part of the functions of the transmitting device. The device includes: a processing unit configured to generate a signal, the signal being obtained based on a first sequence, the first sequence being a sequence obtained by sampling GCP and continuous phase modulation (CPM) based on a Gray complementary sequence; and a transceiver unit configured to transmit the signal.

[0088] In some implementations, the processing unit is configured to obtain the GCP; and the processing unit is further configured to perform CPM modulation sampling on the GCP to obtain the first sequence.

[0089] In certain implementations, the GCP comprises the sequence {C e} and the sequence {D e}, the processing unit is configured to perform CPM modulation sampling on the second sequence to obtain the first sequence, wherein the second sequence is based on the sequence {C e} and the sequence {D e}got.

[0090] In some implementations, the second sequence is obtained by e} and the {D e}Obtained by performing at least one of the following processing: truncation, expansion, splicing, and amplitude modulation.

[0091] In some implementations, the processing unit is configured to: e} obtain the first subsequence, based on the {D e} obtain a second subsequence, the length of the first subsequence is less than the {C e}, the length of the second subsequence is less than the length of {D e} length; obtaining the second sequence based on the first subsequence and the second subsequence, the second sequence including all elements of the first subsequence and the second subsequence, and the length of the second sequence being the sum of the length of the first subsequence and the length of the second subsequence.

[0092] In some implementations, the processing unit is configured to: e} obtain the third subsequence, based on the {D e} obtain a fourth subsequence, the length of the third subsequence is the same as that of the fourth subsequence, and the length of the third subsequence is greater than that of the {C e}, the length of the fourth subsequence is greater than the length of {D e} length; obtaining the second sequence based on the third subsequence and the fourth subsequence, the second sequence including all elements of the third subsequence and the fourth subsequence, and the length of the second sequence being the sum of the length of the third subsequence and the length of the fourth subsequence.

[0093] In certain implementations, the GCP comprises two sequences {C e} and {D e}, C e For the sequence {C e}, the e-th element, D e For the sequence {D e}, where e is 0 to 2. v -1, the C e and the D e The following relationship is satisfied:

[0094] Among them, the For the XOR operation, the C′ e and D′ e is the element in the GCP sequence before the XOR operation, and the e is 0 to 2 v Integer between -1, C′ -1 =1, D′ -1 =1.

[0095] In some implementations, s n The output sequence of the CPM modulator is {s n}, the elements in the n satisfy:

[0096] Among them, the b i is the sequence {b k}, i is an integer between 0 and K-1, h is the modulation index, L is the impulse length, R is the sampling rate, T is the symbol period, and K is {b k}, the values ​​of h, L, R, T and K are all real numbers, q(t) is the phase response function,

[0097] In some implementations, the {b k}Satisfies the following relationship:

[0098] Where P is the denominator of the modulation index h, K is the {b k} length, b i For the {b k} the i-th element in .

[0099] In some implementations, the CPM modulator outputs the sequence {s n Any element s of n , the value is taken from the continuous L+1 b i OK, the b i The sequence {b k}, where L is a positive integer and i is an integer between 0 and K-1.

[0100] In some implementations, the s n The following relationship is satisfied:

[0101] Among them, the b i is the sequence {b k}, i is an integer between 0 and K-1, h is the modulation index, M is the modulation order, L is the impulse length, R is the sampling rate, T is the symbol period, and K is {b k}, h, M, L, R, T and K are all real numbers, q(t) is the phase response function,

[0102] In some implementations, the {b k} satisfies the following relationship: b -1 =b K-1 ,b -2 =b K-2 ,…b -L =b K-L

[0103] Wherein, the K is the {b k}, where L is the impact length and the value of L is a real number.

[0104] In some implementations, the {s n} is an M-order non-negative amplitude modulation, where M is a real number.

[0105] In some implementations, the processing unit is configured to modulate the sampled sequence {s n} obtain a third sequence, wherein the odd-numbered elements of the third sequence are the same as the odd-numbered elements of the {s n} are the same as the odd-numbered elements of the third sequence, and the even-numbered elements of the third sequence are the same as the even-numbered elements of the third sequence. n} are opposite to each other, or the odd-numbered elements of the third sequence are opposite to the odd-numbered elements of {s n} are opposite to each other, and the even-numbered elements of the third sequence are opposite to the even-numbered elements of {s n} have the same even-numbered elements; and performing discrete Fourier transform (DFT) processing on the third sequence to obtain a fifth sequence.

[0106] In some implementations, the method further includes: based on the CPM modulated sampled sequence {s n}Perform discrete Fourier transform DFT processing to obtain a fourth sequence; perform cyclic shift processing based on the fourth sequence to obtain the fifth sequence.

[0107] In some implementations, in the cyclic shift process, the number of bits of the cyclic shift is the sequence {s n} is half the number of elements in .

[0108] In some implementations, the first sequence {f n}Element f in n Satisfies: f n =x n e j2πan ,0≤n≤Q-1

[0109] Wherein a is a cyclic shift value, which is obtained according to configuration information, and Q is the fifth sequence {x n}, x n For the fifth sequence {x n}.

[0110] In some implementations, the processing unit is used to map Q elements in the first sequence to Q consecutive subcarriers; or, map Q elements in the first sequence to Q non - consecutive and equally - spaced subcarriers; or, map Q' elements in the first sequence to Q' consecutive subcarriers; or, map Q' elements in the first sequence to Q' non - consecutive and equally - spaced subcarriers, where Q' < Q and is a positive integer, and Q is the number of elements in the first sequence.

[0111] In some implementations. The GCP includes sequence {C e} and sequence {D e}, {C e} and {D e} satisfy:

[0112] where ρ γ (k) represents the aperiodic cross - correlation value of sequence γ, which is defined as follows:

[0113] where N is the length of sequence γ, represents taking the conjugate value of γ n .

[0114] In some implementations, the second sequence is any one of the following:

[0115] - 1, - 1, 1, 1, - 1, - 1, - 1, 1, - 1, - 1, 1, 1, 1, - 1, - 1, 1, 1, - 1, - 1, 1, 1, 1, - 1, 1, 1, - 1, - 1, - 1, 1, 1, or,

[0116] - 1, - 1, 1, 1, - 1, - 1, - 1, 1, - 1, - 1, 1, 1, 1, - 1, - 1, 1, 1, 1, - 1, - 1, 1, 1, 1, - 1, 1, 1, - 1, - 1, - 1, 1, 1, - 1, or,

[0117] - 1, - 1, 1, 1, 1, - 1, - 1, 1, - 1, - 1, 1, 1, - 1, - 1, - 1, 1, - 1, - 1, 1, 1, , - 1, - 1, 1, 1, - 1, 1, 1, - 1, - 1, 1, 1, - 1, - 1, - 1, 1, 1, - 1, 1, 1, - 1, - 1, 1, 1, 1, - 1, 1, 1, - 1, - 1, - 1, 1, 1, - 1, - 1, 1, - 1, - 1, 1, 1, or,

[0118] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1, or,

[0119] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1,-1,1 ,1,-1,-1,-1,1,1,- ...

[0120] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1, or,

[0121] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1, 1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1,-1, or,

[0122] -1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,1 ,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1 ,1,-1,-1,1,-1,-1,1,1,1,- ...

[0123] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1 1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1,- 1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1, or,

[0124] -1,-1,1,1,1,- ... 1,1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1 ,1,1,- ...

[0125] -1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,i,-1,-1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1 ,-1,1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1. ,

[0126] In a fourth aspect, a communication device is provided. The device may be a receiving device, a module (such as a chip or circuit) in a receiving device, or a logical node, logic module, or software that implements all or part of the functions of a transmitting device. The device includes: a transceiver unit for receiving a signal; a processing unit for performing orthogonal frequency division multiplexing (OFDM) demodulation on the signal to obtain a sixth sequence; the processing unit is further configured to generate a first sequence, the first sequence being a sequence obtained by sampling GCP and continuous phase modulation (CPM) modulation based on a Gray complementary sequence; and the processing unit is further configured to determine a first result based on the first sequence and the sixth sequence.

[0127] In some implementations, the processing unit is configured to obtain the GCP; and the processing unit is further configured to perform CPM modulation sampling on the GCP to obtain the first sequence.

[0128] In certain implementations, the GCP comprises the sequence {C e} and the sequence {D e}, the processing unit is configured to perform CPM modulation sampling on the second sequence to obtain the first sequence, wherein the second sequence is based on the sequence {C e} and the sequence {D e}got.

[0129] In some implementations, the second sequence is obtained by e} and the {D e}Obtained by performing at least one of the following processing: truncation, expansion, splicing, and amplitude modulation.

[0130] In some implementations, the processing unit is configured to: e} obtain the first subsequence, based on the {D e} obtain a second subsequence, the length of the first subsequence is less than the {C e}, the length of the second subsequence is less than the length of {D e} length; obtaining the second sequence based on the first subsequence and the second subsequence, the second sequence including all elements of the first subsequence and the second subsequence, and the length of the second sequence being the sum of the length of the first subsequence and the length of the second subsequence.

[0131] In some implementations, the processing unit is configured to: e} obtain the third subsequence, based on the {D e} obtain a fourth subsequence, the length of the third subsequence is the same as that of the fourth subsequence, and the length of the third subsequence is greater than that of the {C e}, the length of the fourth subsequence is greater than the length of {D e} length; obtaining the second sequence based on the third subsequence and the fourth subsequence, the second sequence including all elements of the third subsequence and the fourth subsequence, and the length of the second sequence being the sum of the length of the third subsequence and the length of the fourth subsequence.

[0132] In certain implementations, the GCP comprises two sequences {C e} and {D e}, C e For the sequence {C e}, the e-th element, D e For the sequence {D e}, where e is 0 to 2. v -1, the C e and the D e The following relationship is satisfied:

[0133] Among them, the For the XOR operation, the C′ e and D′ e is the element in the GCP sequence before the XOR operation, and the e is 0 to 2 v Integer between -1, C′ -1 =1, D′ -1 =1.

[0134] In some implementations, s n The output sequence of the CPM modulator is {s n}, the elements in the n satisfy:

[0135] Among them, the b iis the sequence {b k}, i is an integer between 0 and K-1, h is the modulation index, L is the impulse length, R is the sampling rate, T is the symbol period, and K is {b k}, the values ​​of h, L, R, T and K are all real numbers, q(t) is the phase response function,

[0136] In some implementations, the {b k}Satisfies the following relationship:

[0137] Where P is the denominator of the modulation index h, K is the {b k} length, b i For the {b k} the i-th element in .

[0138] In some implementations, the CPM modulator outputs the sequence {s n Any element s of n , the value is taken from the continuous L+1 b i OK, the b i The sequence {b k}, where L is a positive integer and i is an integer between 0 and K-1.

[0139] In some implementations, the s n The following relationship is satisfied:

[0140] Among them, the b i is the sequence {b k}, i is an integer between 0 and K-1, h is the modulation index, M is the modulation order, L is the impulse length, R is the sampling rate, T is the symbol period, and K is {b k}, h, M, L, R, T and K are all real numbers, q(t) is the phase response function,

[0141] In some implementations, the {b k} satisfies the following relationship: b -1 =b K-1 ,b -2 =b K-2 ,…b -L =b K-L

[0142] Wherein, the K is the {bk}, where L is the impact length and the value of L is a real number.

[0143] In some implementations, the {s n} is an M-order non-negative amplitude modulation, where M is a real number.

[0144] In some implementations, the processing unit is configured to modulate the sampled sequence {s n} obtain a third sequence, wherein the odd-numbered elements of the third sequence are the same as the odd-numbered elements of the {s n} are the same as the odd-numbered elements of the third sequence, and the even-numbered elements of the third sequence are the same as the even-numbered elements of the third sequence. n} are opposite to each other, or the odd-numbered elements of the third sequence are opposite to the odd-numbered elements of {s n} are opposite to each other, and the even-numbered elements of the third sequence are opposite to the even-numbered elements of {s n} have the same even-numbered elements; and performing discrete Fourier transform (DFT) processing on the third sequence to obtain a fifth sequence.

[0145] In some implementations, the method further includes: based on the CPM modulated sampled sequence {s n}Perform discrete Fourier transform DFT processing to obtain a fourth sequence; perform cyclic shift processing based on the fourth sequence to obtain the fifth sequence.

[0146] In some implementations, in the cyclic shift process, the number of bits of the cyclic shift is the sequence {s n} is half the number of elements in .

[0147] In some implementations, the first sequence {f n}Element f in n Satisfies: f n =x n e j2πan ,0≤n≤Q-1

[0148] Wherein a is a cyclic shift value, which is obtained according to configuration information, and Q is the fifth sequence {x n}, x n For the fifth sequence {x n}.

[0149] In some implementations, the processing unit is used to map Q elements in the first sequence to Q consecutive subcarriers; or, map Q elements in the first sequence to Q non - consecutive and equally - spaced subcarriers; or, map Q' elements in the first sequence to Q' consecutive subcarriers; or, map Q' elements in the first sequence to Q' non - consecutive and equally - spaced subcarriers, where Q' < Q and is a positive integer, and Q is the number of elements in the first sequence.

[0150] In some implementations, the second sequence is any one of the following:

[0151] -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, or,

[0152] -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, or,

[0153] -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, or,

[0154] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, or, <000092-1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1,-1,1 ,1,-1,-1,-1,1,1,- ...

[0156] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1, or,

[0157] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1, 1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1,-1, or,

[0158] -1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,1 ,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1 ,1,-1,-1,1,-1,-1,1,1,1,- ...

[0159] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1 1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1,- 1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1, or,

[0160] -1,-1,1,1,1,- ... 1,1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1 ,1,1,- ...

[0161] -1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,i,-1,-1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1 ,-1,1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1. ,

[0162] It should be understood that the third aspect and the fourth aspect are implementation methods on the device side corresponding to the first aspect and the second aspect respectively. The explanations, supplements and descriptions of the beneficial effects of the first aspect and the second aspect are also applicable to the third aspect and the fourth aspect and will not be repeated here.

[0163] In a fifth aspect, a communication device is provided, comprising a processor, wherein the processor is configured to enable the communication device to execute the first aspect and any possible method described in the first aspect by executing a computer program or instruction or through a logic circuit; or to enable the communication device to execute the second aspect and any possible method described in the second aspect.

[0164] In a possible implementation, the communication device further includes a memory for storing the computer program or instruction.

[0165] In a possible implementation, the communication device further includes a communication interface, which is used to input and / or output signals.

[0166] In a sixth aspect, a communication device is provided, comprising a logic circuit and an input / output interface, the input / output interface being used to input and / or output signals, the logic circuit being used to execute the method described in the first aspect or any possible embodiment of the first aspect; or, the logic circuit being used to execute the method described in the second aspect and any possible embodiment of the second aspect.

[0167] In a seventh aspect, a communication system is provided, which includes the communication device described in any possible embodiment of the third aspect, and / or the communication device described in the fourth aspect or any possible embodiment of the fourth aspect.

[0168] In an eighth aspect, a computer-readable storage medium is provided, on which a computer program or instruction is stored. When the computer program or the instruction is run on a computer, the method described in the first aspect or any possible embodiment of the first aspect is executed; or, the method described in the second aspect or any possible embodiment of the second aspect is executed.

[0169] In the ninth aspect, a computer program product is provided, comprising instructions, which, when executed on a computer, cause the method described in the first aspect or any possible embodiment of the first aspect to be executed; or cause the method described in the second aspect or any possible embodiment of the second aspect to be executed. BRIEF DESCRIPTION OF THE DRAWINGS

[0170] FIG1 is a schematic diagram of a wireless communication system applicable to an embodiment of the present application.

[0171] FIG2 is a schematic diagram of a communication method provided in an embodiment of the present application.

[0172] FIG3 is a schematic diagram of a process for generating two sequences according to an embodiment of the present application.

[0173] FIG4 shows a schematic block diagram of a communication device provided in an embodiment of the present application.

[0174] FIG5 shows a schematic structural diagram of another communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0175] The technical solution in this application will be described below with reference to the accompanying drawings.

[0176] Figure 1 is a schematic diagram of the architecture of a communication system 1000 used in an embodiment of the present application. As shown in Figure 1 , the communication system includes a radio access network 100 and a core network 200. Optionally, the communication system 1000 may also include the Internet 300. The radio access network 100 may include at least one radio access network device (such as 110a and 110b in Figure 1 ) and at least one terminal (such as 120a-120j in Figure 1 ). The terminal is wirelessly connected to the radio access network device, and the radio access network device is wirelessly or wiredly connected to the core network. The core network device and the radio access network device may be independent, distinct physical devices, or the core network device's functions and the radio access network device's logical functions may be integrated into the same physical device, or a single physical device may integrate some of the core network device's functions and some of the radio access network device's functions. Terminals and radio access network devices may be interconnected via wired or wireless connections. Figure 1 is merely a schematic diagram. The communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in Figure 1 .

[0177] The network device may be a wireless access network device, such as a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next generation base station (next generation NodeB, gNB) in a fifth generation (5G) mobile communication system, a next generation base station in a sixth generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system; it may also be a module or unit that performs part of the functions of a base station, for example, the wireless access network device may include at least one of a centralized unit (CU), a distributed unit (DU), and a radio unit (RU), wherein the centralized unit may also be referred to as a central unit (CU) or a control unit (CU). Here, the CU completes the functions of the radio resource control (RRC) layer and the packet data convergence protocol (PDCP) layer of the base station, and can also complete the functions of the service data adaptation protocol (SDAP) layer; the DU completes the functions of the radio link control (RLC) layer and the medium access control (MAC) layer of the base station, and can also complete the functions of part of the physical layer (for example, the upper layer of the physical layer) or the entire physical layer; the RU completes the radio frequency function and can also complete the functions of part of the physical layer (for example, the lower layer of the physical layer); for the specific description of each of the above protocol layers, please refer to the relevant technical specifications of the 3rd Generation Partnership Project (3GPP). The wireless access network device can be a macro base station (such as 110a in Figure 1), a micro base station or an indoor station (such as 110b in Figure 1), or a relay node or a donor node. The embodiments of the present application do not limit the specific technology and specific device form adopted by the wireless access network device. For the convenience of description, the following description takes the base station as an example of the network device.

[0178] Terminal devices may also be referred to as terminals, user equipment (UE), mobile stations, mobile terminals, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IOT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, etc. The terminal can be a mobile phone, tablet computer, computer with wireless transceiver function, wearable device, vehicle, drone, helicopter, airplane, ship, robot, robotic arm, smart home device, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal.

[0179] Base stations and terminals can be fixed or mobile. They can be deployed on land, indoors or outdoors, handheld or vehicle-mounted; on water; or on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of base stations and terminals.

[0180] The roles of base stations and terminals can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile base station. To terminals 120j accessing the wireless access network 100 via 120i, terminal 120i is a base station. However, to base station 110a, 120i is a terminal, meaning that communication between 110a and 120i occurs via a wireless air interface protocol. Of course, communication between 110a and 120i can also occur via a base station-to-base station interface protocol. In this case, 120i is also a base station relative to 110a. Therefore, base stations and terminals can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be referred to as communication devices with base station functionality, while 120a-120j in Figure 1 can be referred to as communication devices with terminal functionality.

[0181] Communication between base stations and terminals, between base stations, and between terminals can be carried out through authorized spectrum, unauthorized spectrum, or both; communication can be carried out through spectrum below 6 gigahertz (GHz), spectrum above 6 GHz, or spectrum below 6 GHz and spectrum above 6 GHz. The embodiments of the present application do not limit the spectrum resources used for wireless communication.

[0182] In the embodiments of the present application, the functions of the base station may also be performed by a module (such as a chip) in the base station, or by a control subsystem that includes the base station functions. The control subsystem that includes the base station functions here may be a control center in the above-mentioned application scenarios such as smart grid, industrial control, smart transportation, and smart city. The functions of the terminal may also be performed by a module (such as a chip or modem) in the terminal, or by a device that includes the terminal functions.

[0183] The technical solutions provided in the embodiments of this application can be applied to wireless communications between communication devices. Wireless communications between communication devices may include: wireless communications between network devices and terminals, wireless communications between network devices, and wireless communications between terminals. In the embodiments of this application, the term "wireless communications" may also be referred to as "communication," which may also be described as "data transmission," "information transmission," or "transmission."

[0184] It can be understood that in the embodiments of the present application, the physical downlink share channel (PDSCH), the physical downlink control channel PDCCH and the physical uplink share channel (PUSCH) are merely examples of downlink data channels, downlink control channels and uplink data channels, respectively. In different systems and different scenarios, data channels and control channels may have different names, and the embodiments of the present application do not limit this.

[0185] To achieve uplink synchronization between the terminal device and the network device and obtain the corresponding resources for Message 3, the terminal device needs to send a PRACH signal to the network device. At the same time, to enable the receiving end to perform channel estimation or channel detection, the transmitting end needs to add various reference signals to the transmitted data. The main functions of the downlink reference signal include channel information measurement, data demodulation, beam training, and time-frequency parameter tracking. For the uplink, the main functions of the reference signal include uplink and downlink channel measurement or data demodulation. In the current protocol, PRACH signals, DMRS, and SRS are all generated using ZC sequences, using different group numbers, sequence numbers, lengths, and cyclic shifts to generate the corresponding signals. The receiving end of these signals uses the sequences generated with the same group number, sequence number, length, and cyclic shift, and the received signals to perform operations such as channel characteristic estimation.

[0186] For example, currently there are two main types of ZC sequence generation methods: Type 1 and Type 2.

[0187] Type1 generation is as follows:

[0188] Where α is the cyclic shift value. Different signals get different cyclic shift values ​​according to different calculation methods. u is the group number and v is the sequence number, which are obtained according to the high-level parameter configuration. ZC is the length of the sequence.

[0189] When M ZC ≥36, r u,v (n) is generated as follows: u,v (n) = x q (n mod N ZC )

[0190] where N ZC is less than M ZC The largest prime number.

[0191] When M ZC <36 hours (M ZC ∈{6,12,18,24}), r u,v (n) is generated as follows:

[0192] in Read the corresponding length table through group number u to get: M ZC =6 M ZC =12 M ZC =18 M ZC =24

[0193] When M ZC =30, r u,v (n) is generated as follows:

[0194] Type2 generation is as follows:

[0195] Where u is the group number, v is the sequence number, which is obtained according to the high-level parameter configuration, and M is the length of the sequence.

[0196] When M≥30, r u,v (n) is generated as follows:

[0197] Where c(i) is a pseudo-random sequence.

[0198] When M∈{12,18,24}, r u,v (n) is generated by reading the symbol sequence in the corresponding length table according to group number u and performing pi / 2 BPSK to obtain: M=12 M=18 M=24

[0199] When M=6, r u,v (n) is generated as follows:

[0200] in The group number u is read from the table of corresponding length:

[0201] The aforementioned ZC sequence is constant modulus in the frequency domain, but after orthogonal frequency division multiplexing (OFDM) modulation, it becomes a non-constant modulus sequence, with a peak to average power ratio (PAPR) of approximately 6dB. To enhance coverage, the PAPR of the sequences used for PRACH signals, demodulation reference signals (DMRS), and sounding reference signals (SRS) needs to be further reduced.

[0202] Based on this, an embodiment of the present application proposes a communication method, which provides a sequence generation method to further reduce the PAPR value of the sequence.

[0203] As shown in FIG2 , the method includes the following steps:

[0204] S210, the sending device generates a signal.

[0205] The signal is obtained according to a first sequence, which is a sequence obtained by sampling based on Golay Complementary Pair (GCP) and continuous phase modulation (CPM).

[0206] For example, the sending device obtains a GCP, performs CPM modulation sampling on the GCP, and obtains a first sequence.

[0207] Furthermore, in addition to the above-mentioned processing, a variety of processing can be performed based on the GCP sequence to obtain the first sequence. For example, amplitude modulation, differential processing, CPM modulation sampling, discrete Fourier transform (DFT), cyclic shift, subcarrier mapping and other processing can be performed based on the GCP sequence to obtain the first sequence. Among them, whether differential processing is performed is related to the CPM modulation sampling method. For example, recursive CPM modulation sampling can be used after performing differential processing, and if non-recursive CPM modulation sampling is used, differential processing does not need to be performed. Specifically, the generation process of the first sequence using recursive CPM modulation sampling can be shown in Figure 3 (a), and the generation process of the first sequence using non-recursive CPM modulation sampling can be shown in Figure 3 (b). These processes will be described in detail below.

[0208] Assume that the sequence {x n} can be based on the sequence {s n}Execute discrete Fourier transform DFT to obtain the sequence. n} is the sequence {b k}Execute continuous phase modulation CPM modulation sampling sequence, sequence {b k} is a sequence obtained by performing amplitude modulation on GCP based on the Gray complementary sequence.

[0209] It should be understood that before the above processing, GCP needs to be obtained.

[0210] GCP consists of two sequences {C e} and {D e}, C e For the sequence {C e}, the e-th element, D e For the sequence {D e}, where e is between 0 and 2. v An integer between -1. GCP satisfies the following characteristics:

[0211] Among them, ρ γ (k) represents the non-periodic cross-correlation value of the sequence γ, which is defined as follows:

[0212] Where N is the length of the sequence γ, Represents γ n The conjugate value of .

[0213] A possible implementation, C e and D e The following relations are satisfied respectively: C e =f(x 1,e ,x 2,e,…,x v,e )+c D e =f(x 1,e ,x 2,e ,…,x v,e )+M / 2x π(1),e +c′

[0214] Among them, f(x 1,e ,x 2,e ,…,x v,e ) is a Boolean function, c and c' are integers between 0 and M-1, and v is the basis sequence x k The number of base sequences x k The length is 2 v , x k,e is the base sequence x k The e+1th element of k,e is the (v+1-k)th element in the v-dimensional binary representation of e, M is the modulation order, and π is the transposed array of length v.

[0215] Boolean function f(x 1,e ,x 2,e ,…,x v,e ) can be a linear combination of all the monomials it contains, such as the monomials include: 1,x 1,e ,x 2,e ,…,x v,e ,x 1,e x 2,e ,x 1,e x 3,e ,…,x v-1,e x v,e ,…,x 1,e x 2,e x 3,e …x v,e .

[0216] For example, the sequence {f} is defined as: Assume (i1,i2,…,i v ) is the binary representation of the integer i Then the i-th element of the sequence {f} is f(i1,i2,…,i v ).

[0217] Specifically, when v = 3, {f} = (f(0,0,0),f(1,0,0),f(0,1,0),f(1,1,0),f(0,0,1),f(1,0,1),f(0,1,1),f(1,1,1)). In this case, the base sequence is x1 = (01010101), x2 = (00110011), and x3 = (00001111).

[0218] In one possible implementation, the above Boolean function can be:

[0219] Among them, c k It is an integer between 0 and M-1, where M is the modulation order.

[0220] The above-mentioned CPM modulation sampling of GCP to obtain the first sequence may be CPM modulation sampling of the second sequence to obtain the first sequence, and the second sequence is based on the sequence {C e} and the sequence {D e}got.

[0221] One possible implementation is that the second sequence is based on the sequence {C e} and the sequence {D e}Obtained by performing truncation and splicing.

[0222] For example, for {C e} and {D e} respectively perform truncation processing to obtain a first subsequence and a second subsequence, and concatenate the first subsequence and the second subsequence to obtain a second sequence. Then perform amplitude modulation processing based on the second sequence. That is, based on {C e}Get the first subsequence, based on {D e}Get the second subsequence, the length of the first subsequence is less than {C e}, the length of the second subsequence is less than {D e}, a second sequence is obtained based on the first subsequence and the second subsequence, the second sequence includes all elements of the first subsequence and the second subsequence, and the length of the second sequence is the sum of the length of the first subsequence and the length of the second subsequence.

[0223] For example, the second sequence is represented as {β k}, β k is the kth element in the second sequence, k is an integer between 0 and K-1, and {C e} consists of K / 2 elements in the first subsequence {C l ,C l+1 ,…,C l+K / 2-1}, take {D e}, the K / 2 elements at the corresponding positions in the second subsequence {D l ,D l+1 ,…,D l+K / 2-1}, after splicing, the second sequence {β k} is {C l ,C l+1 ,…,C l+K / 2-1 ,D l ,D l+1 ,…,D l+K / 2-1}.

[0224] Another possible implementation is that the second sequence is based on the sequence {C e} and the sequence {D e}Achieved by performing expansion and splicing processing.

[0225] For example, for {C e} and {D e} respectively perform expansion processing to obtain the third subsequence and the fourth subsequence, splice the third subsequence and the fourth subsequence to obtain the second sequence. Then perform amplitude modulation processing based on the second sequence to obtain the fourth sequence. That is, based on {C e}Get the third subsequence, based on {D e}get the fourth subsequence, the length of the third subsequence is the same as that of the fourth subsequence, and the length of the first subsequence is greater than {C e}, the length of the second subsequence is greater than {D e}; a second sequence is obtained based on the third subsequence and the fourth subsequence, the second sequence includes all elements of the third subsequence and the fourth subsequence, and the length of the second sequence is the sum of the length of the third subsequence and the length of the fourth subsequence.

[0226] For example, the second sequence is represented as {β k}, β k is the kth element in the second sequence, k is an integer between 0 and K-1, and {C e} is expanded to K / 2 elements to form the third subsequence {C0, C1, ..., C E-1 ,C l ,C l+1 ,…C l+K / 2-E-1}, {D e} is expanded to K / 2 elements to form the fourth subsequence {D0, D1, ..., D E-1 ,D l ,D l+1 ,…,D l+K / 2-E-1}, after splicing, the second sequence {β k} is {C0,C1,…,C E-1 ,C l ,C l+1 ,…C l+K / 2-E-1 ,D0,D1,…,D E-1 ,D l ,D l+1 ,…,D l+K / 2-E-1}.

[0227] Optionally, differential processing is performed on the GCPs. For example, C e and D e The following relationship is satisfied:

[0228] Among them, the is the XOR operation, C′ e and D′ e is the element in the GCP sequence before the XOR operation, and e is 0 to 2 v Integer between -1, C′ -1 =1, D′ -1 =1.

[0229] For example, suppose {C′ e} is {01101010111}, then after differential processing {C e} is {11011111100}.

[0230] It should be understood that differential processing is an optional step. Some CPM modulations do not require differential processing before modulation. For example, non-recursive CPM modulation does not require differential processing. This application does not limit this.

[0231] The amplitude modulation is used to modulate the amplitude of the GCP sequence to an amplitude that meets the requirements of the subsequent CPM modulation.

[0232] In one possible manner, the transmitting device first performs M-order amplitude modulation on the sequence A to generate the sequence {γ k}, then for the sequence {γ k} is transformed to generate the sequence {b k}, to achieve non-negative amplitude modulation of sequence A. Optionally, the sequence {b k}Element b in k and the sequence {γ k} in the element γ k Satisfies the following relationship: b k =(γ k +M-1) / 2

[0233] Where M is the order of preset amplitude modulation, k is 0, 1, ..., K-1 in sequence, and K is the sequence {γ k}. It is understandable that the sequence {γ k}, the values ​​of the elements in the sequence are {±1,±3,…,±(M-1)}, and the sequence {b k The values ​​of the elements in} are integers between 0 and M-1.

[0234] The above formula is explained using the example of “sequence A is {1,0,0,1,1,0,1,1,1,0,…}, and M is equal to 4”.

[0235] Since there are four element combinations in the sequence, namely "10", "01", "11" and "00", when the transmitting device performs 4-order amplitude modulation on sequence A, the four element combinations are respectively mapped to four elements. For example, "10" is modulated to "-1", "00" is modulated to "1", "01" is modulated to "3", and "11" is modulated to "-3", then the sequence {γ k} is {-1,3,-1,-1,-3,-1,…}.

[0236] Furthermore, the sending device sends the sequence {γ k} is transformed. From the above formula, we can see that the sequence {γ k}After the transformation, the element "1" is transformed into "2", the element "-1" is transformed into "1", the element "3" is still "3", and the element "-3" is transformed into "0", so the sequence {b k} is {1,3,1,1,0,1,…}. It can be seen that the sequence {b k The value range of the elements in} is an integer from 0 to 3.

[0237] It should be understood that the non-negative amplitude modulation scheme can be used in combination with the non-recursive CPM modulation.

[0238] In one possible manner, the transmitting device performs M-order amplitude modulation on the sequence A to generate the sequence {b k}. It is understandable that the sequence {b k The values ​​of the elements in} are {±1,±3,…,±(M-1)}.

[0239] Take "sequence A is {0,1,1,0,1,0,0,1,0,0,0,1,1,1,...}, and M is 4" as an example. There are four element combinations in sequence A, namely "10", "01", "11", and "00". When the transmitting device performs 4th-order amplitude modulation on sequence A, the four element combinations are mapped to four elements respectively. For example, "10" is modulated to "3", "00" is modulated to "-3", "01" is modulated to "-1", and "11" is modulated to "1". Then the sequence {b k} is {-1,3,3,-1,-3,-1,1,…}. It can be seen that the sequence {b k The values ​​of the elements in} are {±1,±3}.

[0240] It should be understood that this amplitude modulation method can be used in combination with CPM recursive modulation.

[0241] Furthermore, the sending device sends a sequence {b k}Perform CPM modulation and sampling to obtain a first sequence.

[0242] As mentioned above, CPM modulation includes recursive modulation and non-recursive modulation, which are described below.

[0243] Method 1: CPM modulation uses recursive modulation.

[0244] In an optional embodiment, the sending device sends a sequence {b k}When performing CPM and sampling, CPM and sampling can be performed in one step.

[0245] Among them, the modulator output sequence {s n} and the sequence {b k}Satisfies the following relationship:

[0246] Among them, s n The output sequence of the CPM modulator is {s n}, Indicates rounding down n / R, b k is the sequence {b k}, k is 0, 1, ..., K-1, K is the sequence {b k}, which is a positive integer, such as 12, 24, etc.; h is the modulation index, which is a fraction, such as 1 / 2, 1 / 4, etc.; L is the impulse length, which is a positive integer, such as 2, 3, 4, etc.; R is the sampling rate, which can be a positive real number, such as 1.5, 2, etc., and the product of K and R can be equal to N; T is the preset period, which is a positive integer, such as 1, 2, etc.

[0247] q(t) is the phase response function, which can be expressed as follows:

[0248] Wherein, F(t) can be a rectangular pulse function, a raised cosine pulse function, or a Gaussian pulse function, which is not limited here. The embodiment of the present application takes the Gaussian pulse function as an example for explanation, which can be expressed as:

[0249] Where B is the bandwidth, which can be a positive real number, such as 0.3, 0.15, etc.

[0250] A possible implementation, in recursive modulation, {b k}Satisfies the following relationship:

[0251] Where P is the denominator of the modulation index h. When h is 1 / 2, P is 2. K is the sequence {b k This process is also called CPM initialization.

[0252] In another optional embodiment, the sending device first sends the sequence {b k} performs recursive CPM to generate a continuous signal s(t). k} and the continuous signal s(t) satisfy the following relationship:

[0253] Where t is a time variable and 0≤t≤KT, K is a sequence {b k}, L is the preset impact length. h is the preset modulation index, T is the preset period, j is q(t-iT) is the function value of the phase response function q(t) when t equals (t-iT).

[0254] A possible implementation, {b k}Satisfies the above initialization method. For details, please refer to the previous description and will not be repeated here.

[0255] As can be seen from the above, the phase of the continuous signal s(t) at the initial time and the phase at the end time are continuous, which is more conducive to the subsequent generation of a time-domain signal with a lower PAPR value. The initial time can be understood as the time when t is 0, and the end time can be understood as the time when t is KT.

[0256] Then, the continuous signal s(t) is sampled to generate the sequence {s n}. Optional, sequence {s n}Satisfies the following formula:

[0257] Among them, R is the preset sampling rate, K is the sequence {b k}, T is the preset period.

[0258] Mode 2: CPM modulation uses non-recursive modulation.

[0259] In non-recursive modulation, the sequence {s n Any element s of n , the value is taken from the continuous L+1 b k OK, b k For the sequence {b k}, L is a positive integer.

[0260] In an optional embodiment, sending this pair sequence {b k}When performing CPM and sampling, CPM and sampling can be performed in one step. n} and the sequence {b k The following relationship can be satisfied:

[0261] Among them, n%R means n modulo R, and The sequences {b k} in Elements, elements and elements, k is 0, 1, ..., K-1, K is the sequence {b k}, which is a positive integer, such as 12, 24, etc.; h is the preset modulation index, which is a fraction, such as 1 / 2, 1 / 4, etc.; M is the modulation order, which is a positive integer, such as 2, 4, etc.; L is the preset impulse length, which is a positive integer, such as 2, 3, 4; R is the preset sampling rate, which can be a positive real number, such as 1.5, 2, etc., and the product of K and R can be equal to N; T is the preset period, which is a positive real number, such as 1, 2, etc.; q(t) is the phase response function,

[0262] Furthermore, considering that in the above formula, when the value of n is small, it is possible that in the sequence {b k} does not exist or For example, when n is 0, i is 0 and L is 3, the sequence {b k There is no b in} -1 , b -2 and b -3 Therefore, it is necessary to initialize the non-recursive CPM modulation, that is, it is necessary to determine b -1 , b -2 and b -3 The value of , which can be initialized to 0 here.

[0263] In a possible implementation, in non-recursive modulation, the initialization method of CPM can be tail biting initialization. For example, the initialization method of CPM is: let {b k The elements in} satisfy the following formula: -1 =b K-1 ,b -2 =b K-2 ,…b -L =b K-L

[0264] Among them, K is the sequence {b k}, L is the impact length. For example, when n is 0, i is 0, L is 3 and K is 6, b -1 , b -2 and b -3 The corresponding element is {b k} elements b5, b4 and b3.

[0265] In an optional embodiment, the sending device first sends the sequence {b k}Perform non-recursive CPM to generate a continuous signal s(t). The sequence {b k} and the continuous signal s(t) satisfy the relationship:

[0266] Where t is a time variable and 0≤t≤KT, and The sequences {b k} in Elements, elements and elements, k is 0, 1, ..., K-1, K is the sequence {b k}, L can be the preset impulse length, R can be the preset sampling rate, and the product of K and R can be equal to N. h is the preset modulation index, M is the preset amplitude modulation order, T is the preset period, and j is is the phase response function q(t) where t is equal to The function value when .

[0267] When the value of t is relatively small, it may be in the sequence {b k} does not exist or The corresponding elements, for example, when t is 0, i is 1 and L is 3, the fourth sequence {b k There is no b in} -1 、b -2 and b -3 Therefore, in this embodiment, the initialization method of CPM can be tail biting initialization. Exemplarily, the initialization method of CPM can adopt the above tail biting initialization method, and the details can be found in the above description, which will not be repeated here.

[0268] As can be seen from the above, the phase of the continuous signal s(t) at the initial time and the phase at the end time are continuous, which is more conducive to the subsequent generation of a time-domain signal with a lower PAPR value. The initial time can be understood as the time when t is 0, and the end time can be understood as the time when t is KT.

[0269] Afterwards, the continuous signal s(t) is sampled to obtain the sequence {s n}, optional, sequence {s n}Satisfies the following formula: {s n}={s0,s1,……,s N-1}={s(t=0*T / R),s(t=1*T / R),...,s(t=(KR-1)*T / R)}

[0270] Among them, the sequence {s n}N elements s0, s1, ..., s N-1 They are equal to the values ​​of the continuous signal s(t) when t is 0*T / R, 1*T / R, ..., (KR-1)*T / R, R is the preset sampling rate, K is the sequence {b k}, T is the preset period.

[0271] It should be understood that the above CPM initialization method is only an example, and other CPM initialization methods can also be applied to this application and are within the scope of protection of this application.

[0272] It should also be understood that in a non-recursive modulation method, amplitude modulation can be non-negative amplitude modulation. That is, the sequence is modulated into integers between 0 and M-1. The specific modulation method can be found in the previous description and will not be repeated here.

[0273] It should also be understood that the above parameters can be configured or preset. For example, the values ​​of parameters such as h, L, R, T, and K can be configured or preset. This application does not limit this.

[0274] The discrete Fourier transform mentioned above includes the following two cases:

[0275] Case 1: The sequence {s n} is multiplied bit by bit with the mask sequence to generate a third sequence, and a discrete Fourier transform is performed based on the third sequence to obtain the first sequence. For example, the mask sequence can be {1,-1,1,-1,…} or {-1,1,-1,1,..}. That is, the odd-numbered elements of the third sequence are multiplied by {s n} have the same odd-numbered elements, and the even-numbered elements of the third sequence are the same as {s n} are opposite to each other, or the odd-numbered elements of the third sequence are opposite to {s n} are opposite to each other, and the even elements of the third sequence are opposite to {s n} have the same even-numbered elements.

[0276] Afterwards, the transmitting device performs DFT on the third sequence to generate a fifth sequence. It is easy to understand that the fifth sequence is a discrete frequency domain sequence. For example, assuming that the sequence {s n} is {s0,s1,…,s N-1}, the mask sequence is {1,-1,1,-1,…}, when N is an even number, the third sequence is {s0*1,s1*-1,…,s N-1*-1}; when N is an odd number, the third sequence is {s0*1,s1*-1,…,s N-1 *1}. Further, the third sequence is subjected to N-point DFT to obtain the fifth sequence {x n} is {x0,x1,…,x N-1}.

[0277] Case 2: For the sequence {s n} performs discrete Fourier transform to generate a fourth sequence, and then performs cyclic shift to generate a fifth sequence. Optionally, the number of bits of the cyclic shift can be the sequence {s n}. For example, when the sequence {s n} is {s0,s1,…,s N-1}, and perform N-point DFT on it to obtain the fourth sequence For {x0,x1,…,x N-1}, the sequence is cyclically shifted, and the number of cyclic shift bits is the sequence {s n}, the result of the cyclic shift is the fifth sequence: {x n}={x N / 2 ,x N / 2+1 ,…,x N-1 ,x0,x1,…,x N / 2-1}.

[0278] The transmitting apparatus generates the first sequence by performing a cyclic shift on the fifth sequence according to the cyclic shift value a to obtain the first sequence. Alternatively, the frequency domain sequence after performing the DFT is subjected to a phase rotation operation to obtain the first sequence. In one possible embodiment, the cyclic shift value a is configured, for example, by a network device configured to the transmitting apparatus. The cyclic shift value a may also be predefined, which is not limited thereto.

[0279] In one possible implementation, the first sequence can be expressed as {f m}, the first sequence {f n} includes Q elements, Q is an integer greater than 0, x n For the fifth sequence {x n}, f n Satisfies: f n =x n *exp(2πjan)

[0280] Where n is an integer between 0 and Q-1, Q is an integer greater than 0, and exp represents an exponential function with e as the base. a represents the cyclic shift value, and a is a real number.

[0281] The foregoing method of mapping subcarriers and generating a signal may be as follows:

[0282] After the transmitting device generates the first sequence, it maps the first sequence onto subcarriers to generate a first signal. Specifically, the transmitting device maps all elements in the first sequence onto multiple consecutive subcarriers respectively to obtain the first signal. Exemplarily, the transmitting device may map Q elements in the first sequence {f n} onto Q consecutive subcarriers respectively, where Q is the number of all elements in the first sequence {f n}.

[0283] Optionally, the transmitting device may map Q elements in the first sequence {f n} onto Q equally spaced subcarriers respectively. The interval may be greater than or equal to one subcarrier. For example, the transmitting device may map the Q elements in the first sequence {f n} onto Q equally spaced subcarriers in ascending (or descending) order of subcarriers. One element is mapped onto one subcarrier.

[0284] Optionally, the transmitting device may map some elements in the first sequence onto multiple consecutive subcarriers respectively to obtain the first signal. Exemplarily, the transmitting device may also map Q' elements of the first sequence {f n} onto Q' consecutive subcarriers, where Q'<Q and Q and Q' are positive integers.

[0285] Exemplarily, remove the first l elements and the last l elements of the first sequence {f n}, that is, intercept the middle part of the first sequence. For example, intercept the first sequence {f n}={x0,x1,…,x n}, and map {x Q-1 ,x l ,…,x l+1} onto multiple subcarriers, that is, map Q - 2l elements in the first sequence onto N - 2l subcarriers to obtain a frequency-domain signal of Q - 2l points.

[0286] Optionally, the terminal device may map Q - 2l elements in the first sequence {f n} onto N - 2l consecutive subcarriers respectively; or the terminal device may map Q - 2l elements in the first sequence onto Q - 2l equally spaced subcarriers respectively. The specific process is as described above and will not be elaborated here. Convert the frequency-domain signal into a time-domain signal, and add a cyclic prefix (CP) to the time-domain signal to generate a signal.

[0287] ​​In other words, during mapping, the elements may be mapped onto continuous subcarriers, or onto non-continuous and equally spaced subcarriers, or some elements may be selected for mapping.

[0288] Optionally, the transmitting device performs an inverse fast Fourier transform (IFFT) on the frequency domain signal to obtain a corresponding time domain signal, and then adds a cyclic prefix to the time domain signal.

[0289] Optionally, the frequency domain signal may be multiplied by a precoding matrix before subcarrier mapping. The frequency domain signal is then converted into a time domain signal and a CP is added to generate a signal.

[0290] Several examples of second sequences (i.e., spliced ​​GCP sequences) are given below. It should be understood that there may be multiple second sequences in the embodiments of the present application. The following are only examples and not limitations.

[0291] The PAPR of the time-domain sequence is less than 0.5. The GCP parameters are: v = 4, π = {1, 2, 3, 4}, c = {1, 1, 0, 1}, c = 0, c′ = 1. C and D both truncate the first 15 bits of the original sequence. The CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 2, J = 30, T = 1, and B = 0.3. The middle 36 bits of the frequency-domain sequence after the DFT transform of the CPM sequence are truncated to obtain a sequence of length 36.

[0292] -1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1.

[0293] The time domain sequence PAPR is less than 0.5. The GCP parameter configuration at this time is: v = 4, π = {1, 2, 3, 4}, c = {1, 1, 0, 1}, c = 0, c′ = 1, C and D both truncate the first 16 bits of the original sequence, and the CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 60 / 32, J = 32, T = 1, B = 0.3.

[0294] -1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1.

[0295] The time domain sequence PAPR is less than 0.5. The GCP parameter configuration at this time is: v = 5, π = {1, 2, 3, 4, 5}, c = {1, 1, 1, 0, 1}, c = 0, c′ = 1, C and D both truncate the first 30 bits of the original sequence, and the CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 84 / 60, J = 60, T = 1, B = 0.3.

[0296] -1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1.

[0297] The time domain sequence PAPR is less than 0.5. The GCP parameter configuration at this time is: v = 5, π = {1, 2, 3, 4, 5}, c = {1, 1, 1, 1, 1}, c = 0, c′ = 1, the lengths of sequences C and D are both 32, and the CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 120 / 64, J = 64, T = 1, B = 0.3.

[0298] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1.

[0299] The time domain sequence PAPR is less than 0.5. The GCP parameter configuration at this time is: v = 6, π = {1, 2, 3, 4, 5, 6}, c = {1, 1, 1, 1, 0, 1}, c = 0, c′ = 1, C and D both truncate the first 55 bits of the original sequence, and the CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 144 / 110, J = 110, T = 1, B = 0.3.

[0300] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1 ,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1

[0301] The PAPR of the time-domain sequence is less than 0.5. The GCP parameters are: v = 6, π = {1, 2, 3, 4, 5, 6}, c = {1, 1, 1, 1, 0, 1}, c = 0, c′ = 1. C and D both truncate the first 60 bits of the original sequence. The CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 2, J = 120, T = 1, and B = 0.3. The middle 150 bits of the frequency-domain sequence after the DFT transform of the CPM sequence are truncated to obtain a sequence of length 150.

[0302] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1, 1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1.

[0303] The time-domain sequence PAPR is less than 0.5. The GCP parameters are: v = 6, π = {1, 2, 3, 4, 5, 6}, c = {1, 1, 1, 1, 0, 1}, c = 0, c′ = 1. The lengths of C and D are both 64 bits. The CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 2, J = 128, T = 1, and B = 0.3. The middle 180 bits of the frequency-domain sequence after the DFT transform of the CPM sequence are truncated to obtain a sequence of length 180.

[0304] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,1 ,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1.

[0305] The PAPR of the time-domain sequence is less than 0.5. The GCP parameters are: v = 7, π = {1, 2, 3, 4, 5, 6, 7}, c = {1, 1, 1, 0, 0, 0, 1}, c = 0, c′ = 1. C and D both truncate the first 105 bits of the original sequence. The CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 2, J = 210, T = 1, and B = 0.3. The middle 240 bits of the frequency-domain sequence after the DFT transform of the CPM sequence are truncated to obtain a sequence of length 240.

[0306] -1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,1, 1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1,-1 ,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,- 1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,1,-1,1,1.

[0307] The PAPR of the time-domain sequence is less than 0.5. The GCP parameters are: v = 7, π = {1, 2, 3, 4, 5, 6, 7}, c = {1, 1, 1, 1, 0, 1, 1}, c = 0, c′ = 1. C and D both truncate the first 115 bits of the original sequence. The CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 2, J = 230, T = 1, and B = 0.3. The middle 270 bits of the frequency-domain sequence after the DFT transform of the CPM sequence are truncated to obtain a sequence of length 270.

[0308] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1, -1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,1,1,1 ,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1 ,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1.

[0309] The PAPR of the time-domain sequence is less than 0.5. The GCP parameters are: v = 7, π = {1, 2, 3, 4, 5, 6, 7}, c = {1, 1, 1, 1, 0, 1, 1}, c = 0, c′ = 1. C and D both truncate the first 125 bits of the original sequence. The CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 2, J = 250, T = 1, and B = 0.3. The middle 300 bits of the frequency-domain sequence after the DFT transform of the CPM sequence are truncated to obtain a sequence of length 300.

[0310] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1, -1,1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1 ,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1 ,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,-1,1,1.

[0311] The PAPR of the time-domain sequence is less than 0.5. The GCP parameters are: v = 8, π = {1, 2, 3, 4, 5, 6, 7, 8}, c = {1, 1, 1, 1, 1, 0, 1, 1}, c = 0, c′ = 1. C and D both truncate the first 256 bits of the original sequence. The CPM modulator settings are: M = 2, L = 3, h = 1 / 2, N = 2, J = 512, T = 1, and B = 0.3. The middle 600 bits of the frequency-domain sequence after the DFT transform of the CPM sequence are truncated to obtain a sequence of length 600.

[0312] -1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,i,-1,-1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1 ,-1,1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1. ,

[0313] S220, the sending device sends a signal to the receiving device, and correspondingly, the receiving device receives the signal.

[0314] Optionally, the method further includes the following steps:

[0315] S230: The receiving device performs orthogonal frequency division multiplexing (OFDM) demodulation on the signal to obtain a sixth sequence.

[0316] The configuration used by the receiving device to demodulate the signal is the same as the configuration used by the transmitting device to send the signal.

[0317] S240: The receiving device generates a first sequence.

[0318] Specifically, the way in which the receiving device generates the first sequence is the same as the way in which the sending device generates the first sequence in S210, and will not be repeated here.

[0319] S250: The receiving device determines a first result according to the first sequence and the sixth sequence.

[0320] For example, the result may be a channel estimation or channel detection result, or may be an acquired resource configuration, etc.

[0321] It should be understood that the signal in the embodiment of the present application may be a PRACH signal or a reference signal, such as a DMRS, SRS, etc. This is not limited.

[0322] This method provides a sequence generation method with good autocorrelation performance. For example, the autocorrelation value of a CPM sequence in the time domain is significantly greater at zero than at other locations. By modulating the GCP with CPM, the phase at the end and starting positions of the sequence in the time domain are continuous, reducing the PAPR value of the sequence and enhancing its coverage capability, further improving the accuracy of channel estimation and detection.

[0323] It is understood that, in order to implement the functions in the above embodiments, the base station and the terminal include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily appreciate that, in conjunction with the units and method steps of the various examples described in the embodiments disclosed in this application, this application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in hardware or in a computer software-driven hardware manner depends on the specific application scenario and design constraints of the technical solution.

[0324] Figures 4 and 5 are schematic diagrams of the structures of possible communication devices provided in embodiments of the present application. These communication devices can be used to implement the functions of the terminal or base station in the above-mentioned method embodiments, thereby also achieving the beneficial effects of the above-mentioned method embodiments. In the embodiments of the present application, the communication device can be one of the terminals 120a-120j shown in Figure 1, or it can be the base station 110a or 110b shown in Figure 1, or it can be a module (such as a chip) applied to the terminal or base station.

[0325] As shown in Figure 4, the communication device 400 includes a processing unit 410 and a transceiver unit 420. The communication device 400 is used to implement the functions of the terminal device or network device in the method embodiment shown in Figure 2 above.

[0326] When the communication device 400 is used to implement the function of the sending device in the method embodiment shown in FIG. 2 , the transceiver unit 420 may be used to send a signal; the processing unit 410 is used to generate a first sequence, etc.

[0327] When the communication device 400 is used to implement the function of the receiving device in the method embodiment shown in FIG2 : the transceiver unit 420 is used to receive signals;

[0328] The processing unit 410 is configured to demodulate, generate a first sequence, and so on.

[0329] A more detailed description of the processing unit 410 and the transceiver unit 420 can be directly obtained by referring to the relevant description in the method embodiment shown in FIG2 , and is not repeated here.

[0330] As shown in Figure 5, communication device 500 includes a processor 510 and an interface circuit 520. Processor 510 and interface circuit 520 are coupled to each other. It is understood that interface circuit 520 can be a transceiver or an input / output interface. Optionally, communication device 500 may also include a memory 530 for storing instructions executed by processor 510, input data required by processor 510 to execute instructions, or data generated after processor 510 executes instructions.

[0331] When the communication device 500 is used to implement the method shown in FIG. 2 , the processor 510 is used to implement the functions of the processing unit 410 , and the interface circuit 520 is used to implement the functions of the transceiver unit 420 .

[0332] When the communication device is a chip used in a terminal, the terminal chip implements the functions of the terminal in the above method embodiments. The terminal chip receives information from other modules in the terminal (such as a radio frequency module or antenna), and the information is sent by the base station to the terminal; or the terminal chip sends information to other modules in the terminal (such as a radio frequency module or antenna), and the information is sent by the terminal to the base station.

[0333] When the above-mentioned communication device is a module applied to a base station, the base station module implements the functions of the base station in the above-mentioned method embodiment. The base station module receives information from other modules in the base station (such as a radio frequency module or an antenna), and the information is sent by the terminal to the base station; or the base station module sends information to other modules in the base station (such as a radio frequency module or an antenna), and the information is sent by the base station to the terminal. The base station module here can be the baseband chip of the base station, or it can be a DU or other module. The DU here can be a DU under the open radio access network (O-RAN) architecture.

[0334] It is understood that the processor in the embodiments of the present application may be a central processing unit (CPU), or may be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0335] The method steps in the embodiments of the present application can be implemented in hardware or in software instructions that can be executed by a processor. The software instructions can be composed of corresponding software modules, and the software modules can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disk, mobile hard disk, CD-ROM or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. The storage medium can also be an integral part of the processor. The processor and storage medium can be located in an ASIC. In addition, the ASIC can be located in a base station or a terminal. The processor and storage medium can also exist in a base station or a terminal as discrete components.

[0336] In the above embodiments, all or part of the embodiments may be implemented using software, hardware, firmware, or any combination thereof. When implemented using software, all or part of the embodiments may be implemented in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are performed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device, or other programmable device. The computer program or instructions may be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions may be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium may be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; an optical medium, such as a digital video disk; or a semiconductor medium, such as a solid-state drive. The computer-readable storage medium may be a volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.

[0337] In the various embodiments of the present application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0338] Depending on whether the specification uses optional: In this application, "at least one" means one or more, and "more" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent the following situations: A exists alone, B exists alone, and A and B exist at the same time, where A and B can be singular or plural. In the text description of this application, the character " / " generally indicates that the previous and next associated objects are in an "or" relationship; in the formula of this application, the character " / " indicates that the previous and next associated objects are in a "division" relationship. "At least one of the following" or similar expressions is used to represent any combination of the listed items; for example, at least one of A, B and (or) C can represent the following situations: A exists alone, B exists alone, C exists alone, A and B exist at the same time, B and C exist at the same time, A and C exist at the same time, and A, B and C exist at the same time, where A, B, and C can be singular or plural.

[0339] It is understood that the various numbers used in the embodiments of this application are merely for ease of description and are not intended to limit the scope of the embodiments of this application. The order of the sequence numbers of the above-mentioned processes does not necessarily imply a specific order of execution; the order of execution of the processes should be determined by their functions and inherent logic.

Claims

1. A communication method, characterized in that, Including: Generating a signal, where the signal is obtained according to a first sequence, and the first sequence is a sequence obtained by modulating and sampling a Gray complementary pair (GCP) and continuous phase modulation (CPM). Transmitting the signal.

2. The method according to claim 1, wherein The method further includes: Obtaining the GCP. Performing CPM modulation and sampling on the GCP to obtain the first sequence.

3. The method according to claim 1 or 2, characterized in that, The GCP includes sequences {C e} and sequence {D e}, and performing CPM modulation sampling on the GCP to obtain the first sequence includes: CPM modulation sampling is performed on the second sequence to obtain the first sequence, and the second sequence is based on the sequences {C e} and {D e}.

4. The method according to claim 3, wherein The second sequence is obtained by performing at least one of the following processes on the {C e} and the {D e}: truncation, extension, splicing, amplitude modulation.

5. The method according to claim 4, wherein The method includes: Based on the said {C e}, a first subsequence is obtained, and based on the said {D e}, a second subsequence is obtained. The length of the first subsequence is less than the length of the {C e}, and the length of the second subsequence is less than the length of the {D e}; Obtaining the second sequence based on the first subsequence and the second subsequence, where the second sequence includes all elements of the first subsequence and the second subsequence, and the length of the second sequence is the sum of the lengths of the first subsequence and the second subsequence.

6. The method according to claim 4, wherein The method includes: Based on the said {C e}, a third subsequence is obtained. Based on the said {D e}, a fourth subsequence is obtained. The third subsequence and the fourth subsequence have the same length. The length of the third subsequence is greater than the length of the {C e}, and the length of the fourth subsequence is greater than the length of the {D e}; Obtaining the second sequence based on the third subsequence and the fourth subsequence, where the second sequence includes all elements of the third subsequence and the fourth subsequence, and the length of the second sequence is the sum of the lengths of the third subsequence and the fourth subsequence.

7. The method according to any one of claims 1 to 6, characterized in that, The GCP includes two sequences {C e} and {D e}, C e is the e-th element of the sequence {C e}, D e is the e-th element of the sequence {D e}, where e is an integer between 0 and 2 v - 1, and C e and D e satisfy the following relationship: Among them, the is an exclusive OR operation, and the C′ e and D′ e are elements in the GCP sequence before the exclusive OR operation, where e is an integer between 0 and 2 v -1, C′ -1 = 1, D′ -1 = 1.

8. The method according to claim 7, characterized in that, s n is an element in the output sequence {s n} of the CPM modulator, and the s n satisfies: wherein, the b i is the i-th element in the sequence {b k}, where the value of i is an integer between 0 and K - 1, the h is the modulation index, the L is the impulse length, the R is the sampling rate, the T is the symbol period, the K is the number of elements in {b k}, and the values of h, L, R, T, and K are all real numbers, the q(t) is the phase response function, the 9. The method according to claim 8, characterized in that, The said {b k} satisfies the following relationship: where P is the denominator of the modulation index h, and K is the length of the {b k}, and b i is the i-th element of the {b k}.

10. The method according to any one of claims 1 to 6, characterized in that, The CPM modulator output sequence {s n Any element s of n , the value is taken from L+1 consecutive b i OK, the b i is the sequence {b k }, L is a positive integer, and i is an integer between 0 and K-1.

11. The method according to claim 10, wherein The said s n satisfies the following relationship: Among them, the said b i is the i-th element in the sequence {b k}, where the value of i is an integer between 0 and K - 1, the said h is the modulation index, the said M is the modulation order, the said L is the impulse length, the said R is the sampling rate, the said T is the symbol period, the said K is the number of elements in {b k}, and the values of h, M, L, R, T, and K are all real numbers. The said q(t) is the phase response function, and the 12. The method according to claim 11, wherein The said {b k} satisfies the following relationship: b -1 = b K-1 , b -2 = b K-2 , … b -L = b K-L wherein, K is the number of elements in the {b k}, L is the impact length, and the value of L is a real number.

13. The method according to any one of claims 10 to 12, characterized in that, The amplitude modulation of the {s n} is an M-order non-negative amplitude modulation, where M is a real number.

14. The method according to any one of claims 1 to 13, characterized in that, The method further includes: Based on the sequence {s n} after CPM modulation sampling, a third sequence is obtained. The odd-position elements of the third sequence are the same as the odd-position elements of the {s n}, and the even-position elements of the third sequence are the opposite numbers of the even-position elements of the {s n}, or the odd-position elements of the third sequence are the opposite numbers of the odd-position elements of the {s n}, and the even-position elements of the third sequence are the same as the even-position elements of the {s n}; Performing discrete Fourier transform (DFT) processing on the third sequence to obtain a fifth sequence.

15. The method according to any one of claims 1 to 13, characterized in that The method further includes: Perform discrete Fourier transform (DFT) processing on the sequence {s n} after CPM modulation sampling to obtain a fourth sequence; Performing circular shift processing on the fourth sequence to obtain the fifth sequence.

16. The method according to claim 15, wherein In the cyclic shift processing, the number of bits of the cyclic shift is half of the number of elements in the sequence {s n} after CPM modulation sampling.

17. The method according to any one of claims 1 to 16, characterized in that, The elements f n in the first sequence {f n} satisfy: f n = x n e j2πan , 0 ≤ n ≤ Q - 1 Where a is the cyclic shift value, and the cyclic shift value is obtained according to the configuration information. Q is the number of elements of the fifth sequence {x n}, and x n is any element in the fifth sequence {x n}.

18. The method according to any one of claims 1 to 17, characterized in that, The method further includes: Mapping Q elements in the first sequence to Q consecutive subcarriers; or, Mapping Q elements in the first sequence to Q non - consecutive and equally - spaced subcarriers; or, Mapping Q' elements in the first sequence to Q' consecutive subcarriers; or, Mapping Q' elements in the first sequence to Q' non - consecutive and equally - spaced subcarriers, where Q' < Q and is a positive integer, and Q is the number of elements in the first sequence.

19. A communication method, characterized in that, Including: Receiving a signal, performing orthogonal frequency - division multiplexing (OFDM) demodulation on the signal to obtain a sixth sequence; Generating a first sequence, where the first sequence is a sequence obtained by modulating and sampling a Gray complementary pair (GCP) and continuous phase modulation (CPM). Determining a first result according to the first sequence and the sixth sequence.

20. The method according to claim 19, wherein, The method further includes: Obtaining the GCP. Performing CPM modulation and sampling on the GCP to obtain the first sequence.

21. The method according to claim 19 or 20, characterized in that The GCP includes sequences {C e} and sequence {D e}, and performing CPM modulation sampling on the GCP to obtain the first sequence includes: CPM modulation sampling is performed on the second sequence to obtain the first sequence, and the second sequence is based on the sequences {C e} and {D e}.

22. The method according to claim 21, wherein The second sequence is obtained by performing at least one of the following processes on the {C e} and the {D e}: truncation, extension, splicing, amplitude modulation.

23. The method according to claim 22, characterized in that, The method includes: Based on the said {C e}, a first subsequence is obtained. Based on the said {D e}, a second subsequence is obtained. The length of the first subsequence is less than the length of the {C e}, and the length of the second subsequence is less than the length of the {D e}; Obtaining the second sequence based on the first subsequence and the second subsequence, where the second sequence includes all elements of the first subsequence and the second subsequence, and the length of the second sequence is the sum of the lengths of the first subsequence and the second subsequence.

24. The method according to claim 22, wherein The method includes: Based on the said {C e}, a third subsequence is obtained. Based on the said {D e}, a fourth subsequence is obtained. The third subsequence has the same length as the fourth subsequence. The length of the first subsequence is greater than the length of {C e}, and the length of the second subsequence is greater than the length of {D e}; Obtaining the second sequence based on the third subsequence and the fourth subsequence, where the second sequence includes all elements of the third subsequence and the fourth subsequence, and the length of the second sequence is the sum of the lengths of the first subsequence and the second subsequence.

25. The method according to any one of claims 19 to 24, characterized in that, The GCP includes two sequences {C e} and {D e}, where C e is the e-th element of the sequence {C e}, D e is the e-th element of the sequence {D e}, e is an integer between 0 and 2 v - 1, and the C e and the D e satisfy the following relationship: Among them, the is an exclusive OR operation, and the C′ e and D′ e are elements in the GCP sequence before the exclusive OR operation, where e is an integer between 0 and 2 v -1, C′ -1 = 1, D′ -1 = 1.

26. The method according to claim 25, characterized in that, s n is an element in the output sequence {s n} of the CPM modulator, and the s n satisfies: wherein, the b i is the i-th element in the sequence {b k}, where the value of i is an integer between 0 and K - 1, the h is the modulation index, the L is the impulse length, the R is the sampling rate, the T is the symbol period, the K is the number of elements in {b k}, the values of h, L, R, T, and K are all real numbers, the q(t) is the phase response function, and the 27. The method according to claim 26, wherein The {b k} satisfies the following relationship: Where P is the denominator of the modulation index h, and K is the length of the {b k}, and b i is the i-th element of the {b k}.

28. The method according to any one of claims 19 to 24, characterized in that The CPM modulator output sequence {s n Any element s of n , the value is taken from L+1 consecutive b i OK, the b i is the sequence {b k }, L is a positive integer, and i is an integer between 0 and K-1.

29. The method according to claim 28, wherein The said s n satisfies the following relationship: Among them, the b i is the i-th element in the sequence {b k}, where the value of i is an integer between 0 and K - 1. The h is the modulation index, the M is the modulation order, the L is the impulse length, the R is the sampling rate, the T is the symbol period, the K is the number of elements in {b k}, and the values of h, M, L, R, T, and K are all real numbers. The q(t) is the phase response function, and the 30. The method according to claim 29, wherein The said {b k} satisfies the following relationship: b -1 = b K-1 , b -2 = b K-2 , … b -L = b K-L where K is the number of elements in {b k}, L is the impact length, and the value of L is a real number.

31. The method according to any one of claims 28 to 30, characterized in that, The amplitude modulation of the {s n} is an M-order non-negative amplitude modulation, where M takes real values.

32. The method according to any one of claims 19 to 31, characterized in that, The method further includes: Based on the sequence {s n} after CPM modulation sampling, a third sequence is obtained. The odd-position elements of the third sequence are the same as the odd-position elements of the {s n}, and the even-position elements of the third sequence are the opposite numbers of the even-position elements of the {s n}, or the odd-position elements of the third sequence are the opposite numbers of the odd-position elements of the {s n}, and the even-position elements of the third sequence are the same as the even-position elements of the {s n}; Performing discrete Fourier transform (DFT) processing on the third sequence to obtain a fifth sequence.

33. The method according to any one of claims 19 to 31, characterized in that The method further includes: Perform discrete Fourier transform (DFT) processing on the sequence {s n} after CPM modulation sampling to obtain a fourth sequence; Performing circular shift processing on the fourth sequence to obtain the fifth sequence.

34. The method according to claim 33, characterized in that, In the cyclic shift process, the number of bits of cyclic shift is half of the number of elements in the sequence {s n} after CPM modulation sampling.

35. The method according to any one of claims 19 to 34, characterized in that, The elements f n in the first sequence {f n} satisfy: f n = x n e j2πan , 0 ≤ n ≤ Q - 1 where a is the cyclic shift value, and the cyclic shift value is obtained according to the configuration information, Q is the number of elements of the fifth sequence {x n}, and x n is any element in the fifth sequence {x n}.

36. The method according to any one of claims 19 to 35, characterized in that The generating the signal includes: Mapping Q elements in the first sequence to Q consecutive subcarriers; or, Map Q elements in the first sequence to Q non - consecutive and equally - spaced sub - carriers; or, Map Q' elements in the first sequence to Q' consecutive sub - carriers; or, Map Q' elements in the first sequence to Q' non - consecutive and equally - spaced sub - carriers, where Q' < Q and is a positive integer, and Q is the number of elements in the first sequence.

37. A communication device, characterized in that, Comprises a module for performing the method according to any one of claims 1 to 18.

38. A communication device, characterized in that, Comprises a module for performing the method according to any one of claims 19 to 36.

39. A communication system, characterized in that, Comprises the communication device according to claim 37 and claim 38.

40. A computer-readable storage medium, characterized in that, The computer - readable storage medium stores computer instructions, and when the computer instructions run on a computer, the method according to any one of claims 1 to 18 is executed, or the method according to any one of claims 19 to 36 is executed.

41. A computer program product, characterized in that, The computer program product includes computer program code, and when the computer program code runs on a computer, the method according to any one of claims 1 to 18 is executed, or the method according to any one of claims 19 to 36 is executed.

Images