Communication method, device and system

Abstract

The invention provides a communication method, device and system, which can be suitable for a communication scene of a transmission sequence, such as a transmission scene of a reference signal, such as application scenes of channel measurement, channel estimation and the like. According to the method, the GCP and the CPM are modulated and sampled based on the Gray complementary sequence to generate the sequence, and the sequence obtained through the method is good in self-correlation performance, for example, the value of the self-correlation value of the CPM sequence in the time domain at the zero point position is obviously larger than the value of the self-correlation value of the CPM sequence at other positions. GCP is modulated through CPM, so that the end position phase and the initial position phase of the sequence in a time domain are continuous, and the PAPR value of the sequence is reduced. Therefore, the coverage capability of the sequence is enhanced, and the accuracy of processing such as channel estimation and channel detection can be further improved.

Description

Technical Field

[0001] This application relates to the field of communications. In particular, it relates to a communication method, apparatus, and system. Background Art

[0002] In order to achieve uplink synchronization between a terminal and a base station and obtain corresponding resources for Message3, the terminal needs to send a physical random access channel (PRACH) signal to the base station. At the same time, in order for the receiving end to perform channel estimation or channel sounding, the transmitting end needs to add various reference signals to the transmitted data. The main functions of the reference signals include measurement of channel information, data demodulation, beam training, and time-frequency parameter tracking, etc. However, the coverage capabilities of current PRACH signals or reference signals, etc., need to be enhanced. Summary of the Invention

[0003] This application provides a communication method, apparatus, and system that can improve the coverage capabilities of signals.

[0004] In a first aspect, a communication method is provided. This method can be executed by a transmitting device, or, alternatively, by a module (such as a chip or circuit) in the transmitting device, or, further, by a logical node, logical module, or software that can implement all or part of the functions of the transmitting device. This application does not make any limitations in this regard.

[0005] The method includes: 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 sequence pair GCP and continuous phase modulation CPM; and transmitting the signal.

[0006] The sequence obtained in this method has good autocorrelation performance. For example, the autocorrelation value of the CPM sequence in the time domain at the zero point position is significantly greater than that at other positions. By modulating GCP with CPM, the phase at the end position and the phase at the start position of the sequence are continuous in the time domain, reducing the PAPR value of the sequence. Thereby, the coverage capabilities of the sequence are enhanced, and further, the accuracy of processing such as channel estimation and channel sounding can be improved.

[0007] In some implementations, the GCP is obtained; and the GCP is modulated and sampled by CPM to obtain the first sequence.

[0008] In some implementations, the GCP includes sequence {C e} and sequence {D e}, and modulating and sampling the GCP by CPM to obtain the first sequence includes: modulating and sampling a second sequence by CPM to obtain the first sequence, where the second sequence is based on sequence {C e} and sequence {De} obtained.

[0009] In some implementations, the second sequence is obtained by performing at least one of the following operations on the {C e} and the {D e}: truncation, extension, splicing, amplitude modulation.

[0010] In some implementations, a first subsequence is obtained based on the {C e}, and a second subsequence is obtained based on the {D e}, the length of the first subsequence is less than the length of the {C e}, the length of the second subsequence is less than the length of the {D e}; the 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.

[0011] In some implementations, a third subsequence is obtained based on the {C e}, and a fourth subsequence is obtained based on the {D e}, 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}, the length of the fourth subsequence is greater than the length of the {D e}; the 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.

[0012] In some implementations, 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 the C e and the D e satisfy the following relationship:

[0013]

[0014]

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

[0016] In some implementations, s n is an element in the CPM modulator output sequence {s n}, and the s n satisfies:

[0017]

[0018] where the b i is the i - th element in the sequence {b k} input to the CPM modulator, i ranges from 0 to K - 1, h is the modulation index, L is the impulse length, R is the sampling rate, T is the symbol period, K is the number of elements in {b k}, the values of h, L, R, T, and K are all real numbers, q(t) is the phase response function, and the

[0019] In some implementations, the {b k} satisfies the following relationship:

[0020]

[0021] where P is the denominator of the modulation index h, K is the length of the {b k}, and b i is the i - th element in the {b k}.

[0022] In some implementations, any element s n in the CPM modulator output sequence {s n} is determined by L + 1 consecutive b i , where the b i is the i - th element of the sequence {b k} input to the CPM modulator, L is a positive integer, and i ranges from 0 to K - 1.

[0023] In some implementations, the s n satisfies the following relationship:

[0024]

[0025] where the b iis the i-th element in the sequence {b k}, where i takes integer values from 0 to 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, K is the number of elements in {b k}, and the values of h, M, L, R, T, and K are all real numbers. q(t) is the phase response function, and

[0026] In some implementations, {b k} satisfies the following relationship:

[0027] b -1 = b K-1}, b -2 = b K-2},... b -L = b K-L

[0028] where K is the number of elements in {b k}, L is the impulse length, and the value of L is a real number.

[0029] In some implementations, the amplitude modulation of {s n} is M-order non-negative amplitude modulation, and the value of M is a real number.

[0030] In some implementations, the method further includes: obtaining a third sequence based on the sequence {s n} after CPM modulation sampling, where the odd-position elements of the third sequence are the same as the odd-position elements of {s n}, and the even-position elements of the third sequence are the opposite of the even-position elements of {s n}, or the odd-position elements of the third sequence are the opposite of the odd-position elements of {s n}, and the even-position elements of the third sequence are the same as the even-position elements of {s n}; performing discrete Fourier transform (DFT) processing on the third sequence to obtain a fifth sequence.

[0031] In some implementations, the method further includes: performing 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.

[0032] In some implementations, in the circular shift processing, the number of circular shift bits is half of the number of elements in the sequence {s n} after CPM modulation sampling.

[0033] In some implementations, the elements f in the first sequence {f n} satisfy: n where a is a cyclic shift value, the cyclic shift value is obtained according to configuration information, Q is the number of elements in the fifth sequence {x

[0034]

[0035] }, and x n is any element in the fifth sequence {x n}. n}

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

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

[0038]

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

[0040]

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

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

[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, 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, or,

[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, or,

[0046] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -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,

[0047] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 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,

[0048] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -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,

[0049] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -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,

[0050] -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 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,

[0051] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -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,

[0052] -1,-1,1,1,1,- ... 1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1 ,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1 , 1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-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,

[0053] -1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，1，-1，-1，-1，1，1，-1，-1，1，-1，-1，1，1，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。,

[0054] In a second aspect, a communication method is provided. This method can be executed by a receiving device, or by a module (such as a chip or a circuit) in the receiving device, or by a logic node, a logic module, or software that can implement all or part of the functions of the receiving device. This application does not make any limitations in this regard.

[0055] 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 modulating and sampling a Gray complementary sequence pair (GCP) and continuous phase modulation (CPM); and determining a first result based on the first sequence and the sixth sequence.

[0056] In some implementation manners, the method further includes: obtaining the GCP; and performing CPM modulation and sampling on the GCP to obtain the first sequence.

[0057] In some implementation manners, the GCP includes a sequence {C e} and a sequence {D e}, and performing CPM modulation and sampling on the GCP to obtain the first sequence includes: performing CPM modulation and sampling on a second sequence to obtain the first sequence, where the second sequence is obtained based on the sequence {C e} and the sequence {D e}.

[0058] In some implementation manners, the second sequence is obtained by performing at least one of the following processes on the {C e} and the {D e}: truncating, expanding, splicing, and amplitude modulation.

[0059] In some implementation manners, a first subsequence is obtained based on the {C e}, and a second subsequence is obtained based on the {D e} to obtain a second subsequence, the length of the first subsequence being less than that of the {C e}, the length of the second subsequence being less than that of the {D e}; 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 lengths of the first subsequence and the second subsequence.

[0060] In some implementations, a third subsequence is obtained based on the {C e}, a fourth subsequence is obtained based on the {D e}, the third subsequence having the same length as the fourth subsequence, the length of the first subsequence being greater than that of the {C e}, the length of the second subsequence being greater than that of the {D e}; 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 lengths of the first subsequence and the second subsequence.

[0061] In some implementations, the GCP includes two sequences {C e} and {D e}, C e being the e-th element of the sequence {C e}, D e being the e-th element of the sequence {D e}, where e is an integer between 0 and 2 v - 1, and the C e and the D e satisfy the following relationship:

[0062]

[0063]

[0064] wherein, the is an exclusive OR operation, C′ e and D′ e are elements in the GCP sequence before the exclusive OR operation, e is an integer between 0 and 2 v - 1, C′ -1 = 1, D′ -1 = 1.

[0065] In some implementations, s n is an element in the CPM modulator output sequence {s n}, the sn Satisfy:

[0066]

[0067] wherein, the b i is the i-th element in the sequence {b k}, 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, the

[0068] In some implementations, the {b k} satisfies the following relationship:

[0069]

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

[0071] In some implementations, any element s n in the CPM modulator output sequence {s n} is determined by L + 1 consecutive b i , the b i is the i-th element of the sequence {b k} input to the CPM modulator, the L is a positive integer, and the i is an integer between 0 and K - 1.

[0072] In some implementations, the s n satisfies the following relationship:

[0073]

[0074] wherein, the b i is the i-th element in the sequence {b k} input to the CPM modulator, 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}, the values of h, M, L, R, T, and K are all real numbers, the q(t) is the phase response function, the

[0075] In some implementations, the {bk} satisfies the following relationship:

[0076] b -1 = b K-1 b -2 = b K-2 …b -L = b K-L

[0077] wherein, K is the number of elements in {b k}, L is the impulse length, and the value of L is a real number.

[0078] In some implementations, the amplitude modulation of {s n} is M-order non-negative amplitude modulation, and the value of M is a real number.

[0079] In some implementations, the method further includes: obtaining a third sequence based on the sequence {s n} after CPM modulation sampling, where the odd-position elements of the third sequence are the same as the odd-position elements of {s n}, and the even-position elements of the third sequence are the opposite of the even-position elements of {s n}, or the odd-position elements of the third sequence are the opposite of the odd-position elements of {s n}, and the even-position elements of the third sequence are the same as the even-position elements of {s n}; performing discrete Fourier transform DFT processing on the third sequence to obtain a fifth sequence.

[0080] In some implementations, the method further includes: performing discrete Fourier transform DFT processing on the sequence {s n} after CPM modulation sampling to obtain a fourth sequence; performing cyclic shift processing on the fourth sequence to obtain the fifth sequence.

[0081] In some implementations, in the cyclic shift processing, the number of bits of cyclic shift is half of the number of elements in the sequence {s n} after CPM modulation sampling.

[0082] In some implementations, the elements f n in the first sequence {f n} satisfy:

[0083]

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

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

[0086] In some implementations, the GCP includes sequences {C e} and {D e}, and {C e} and {D e} satisfy:

[0087]

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

[0089]

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

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

[0092] -1, -1, 1, 1, -1, -1, -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,

[0093] -1, -1, 1, 1, -1, -1, -1, 1, -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,

[0094] -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 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,

[0095] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -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,

[0096] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -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,

[0097] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -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,

[0098] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, 1,1,-l,-1,-1,1,1,-l,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-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,

[0099] -1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1 -1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1 , 1,-1,-1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-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,

[0100] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -l, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -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,

[0101] -1,-1,1,1,1,- ... 1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1 ,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1 , 1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-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,

[0102] -1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，1，-1，-1，-1，1，1，-1，-1，1，-1，-1，1，1，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。,

[0103] It should be understood that the second aspect is the implementation on the terminal device side corresponding to the first aspect. Regarding the explanations, supplements, and descriptions of beneficial effects of the first aspect, the second aspect also applies and will not be elaborated here.

[0104] In a third aspect, a communication device is provided. The device can be a transmitting device, a module in the transmitting device (such as a chip or a circuit), or a logical node, logical module, or software that can implement all or part of the functions of the transmitting device. The device includes: a processing unit for 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 sequence pair GCP and continuous phase modulation CPM; a transceiver unit for transmitting the signal.

[0105] In some implementation manners, the processing unit is used to obtain the GCP; the processing unit is further used to perform CPM modulation sampling on the GCP to obtain the first sequence.

[0106] In some implementation manners, the GCP includes sequence {C e} and sequence {D e}, and the processing unit is used to perform CPM modulation sampling on a second sequence to obtain the first sequence, where the second sequence is obtained based on sequence {C e} and sequence {D e}.

[0107] In some implementation manners, 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.

[0108] In some implementation manners, the processing unit is used to obtain a first subsequence based on the {C e}, and obtain a second subsequence based on the {D e} to obtain a second subsequence, where the length of the first subsequence is less than the length of {C e}, and the length of the second subsequence is less than the length of {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.

[0109] In some implementations, the processing unit is configured to obtain a third subsequence based on {C e}, and obtain a fourth subsequence based on {D e}, where the third subsequence has the same length as the fourth subsequence, the length of the third subsequence is greater than the length of {C e}, and the length of the fourth 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 third subsequence and the fourth subsequence.

[0110] In some implementations, 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:

[0111]

[0112]

[0113] where, is an exclusive OR operation, C′ e and D′ e are elements in the GCP sequence before the exclusive OR operation, e is an integer between 0 and 2 v - 1, C′ -1 = 1, D′ -1 = 1.

[0114] In some implementations, s n is the output sequence of the CPM modulator {s n} elements, the s n Satisfy:

[0115]

[0116] Wherein, the b i Is the i-th element in the sequence {b k} input to the CPM modulator, 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, the

[0117] In some implementations, the {b k} satisfies the following relationship:

[0118]

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

[0120] In some implementations, any element s n of the CPM modulator output sequence {s n} is determined by L+1 consecutive b i , the b i is the i-th element of the sequence {b k} input to the CPM modulator, the L is a positive integer, and the i is an integer between 0 and K-1.

[0121] In some implementations, the s n satisfies the following relationship:

[0122]

[0123] Wherein, the b i is the i-th element in the sequence {b k} input to the CPM modulator, 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}, the values of h, M, L, R, T and K are all real numbers, the q(t) is the phase response function, the

[0124] In some implementations, the {b k} satisfies the following relationship:

[0125] b -1 = b K-1 b -2 = b K-2 …b -L = b K-L

[0126] where K is the number of elements in the {b k}, L is the impulse length, and the value of L is a real number.

[0127] In some implementations, the amplitude modulation of the {s n} is M-order non-negative amplitude modulation, and the value of M is a real number.

[0128] In some implementations, the processing unit is configured to obtain a third sequence based on the sequence {s n} after CPM modulation sampling. The odd-numbered elements of the third sequence are the same as the odd-numbered elements of the {s n}, and the even-numbered elements of the third sequence are the opposite of the even-numbered elements of the {s n}, or the odd-numbered elements of the third sequence are the opposite of the odd-numbered elements of the {s n}, and the even-numbered elements of the third sequence are the same as the even-numbered elements of the {s n}; perform discrete Fourier transform (DFT) processing on the third sequence to obtain a fifth sequence.

[0129] In some implementations, the method further includes: performing 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.

[0130] In some implementations, in the circular shift processing, the number of bits of circular shift is half of the number of elements in the sequence {s n} after CPM modulation sampling.

[0131] In some implementations, the elements f n in the first sequence {f n} satisfy:

[0132]

[0133] where a is the circular shift value, the circular shift value is obtained according to the configuration information, Q is the number of elements in the fifth sequence {x n}, xn For any element in the fifth sequence {x n}.

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

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

[0136]

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

[0138]

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

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

[0141] -1, -1, 1, 1, -1, -1, -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,

[0142] -1, -1, 1, 1, -1, -1, -1, 1, -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,

[0143] -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 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,

[0144] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -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,

[0145] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -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,

[0146] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -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,

[0147] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, 1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-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,

[0148] -1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1 -1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,1 , 1,-1,-1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-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,

[0149] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -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,

[0150] -1,-1,1,1,1,- ... 1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1 ,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1 , 1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-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,

[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，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，1，-1，-1，-1，1，1，-1，-1，1，-1，-1，1，1，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。,

[0152] In a fourth aspect, a communication device is provided. The device can be a receiving device, a module (such as a chip or a circuit) in a receiving device, or a logical node, logical module, or software that can implement 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, where the first sequence is a sequence obtained by modulating and sampling a Gray complementary sequence pair (GCP) and continuous phase modulation (CPM); the processing unit is further configured to determine a first result based on the first sequence and the sixth sequence.

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

[0154] In some implementations, the GCP includes a sequence {C e} and a sequence {D e}, and the processing unit is configured to perform CPM modulation and sampling on a second sequence to obtain the first sequence, where the second sequence is obtained based on the sequence {C e} and the sequence {D e}.

[0155] In some implementations, 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.

[0156] In some implementations, the processing unit is configured to obtain a first subsequence based on the {C e} and a second subsequence based on the {D e}, where the length of the first subsequence is less than that of the {C eThe length of}, the length of the second subsequence is less than the length of {D e}; obtaining the second sequence 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.

[0157] In some implementations, the processing unit is configured to obtain a third subsequence based on the {C e}, obtain a fourth subsequence based on the {D e}, the third subsequence has the same length as the fourth subsequence, the length of the third subsequence is greater than the length of {C e}, the length of the fourth subsequence is greater than the length of {D e}; obtaining the second sequence 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.

[0158] In some implementations, 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 the C e and the D e satisfy the following relationship:

[0159]

[0160]

[0161] where, the is an exclusive OR operation, C′ e and D′ e are elements in the GCP sequence before the exclusive OR operation, e is an integer between 0 and 2 v - 1, C′ -1 = 1, D′ -1 = 1.

[0162] In some implementations, s n is an element in the CPM modulator output sequence {s n}, and the s n satisfies:

[0163]

[0164] wherein, the b i is the i-th element in the sequence {b k} input to the CPM modulator, 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, the

[0165] In some implementations, {b k} satisfies the following relationship:

[0166]

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

[0168] In some implementations, any element s n of the CPM modulator output sequence {s n} takes a value determined by L+1 consecutive b i s, the b i is the i-th element of the sequence {b k} input to the CPM modulator, the L is a positive integer, and the i is an integer between 0 and K-1.

[0169] In some implementations, s n satisfies the following relationship:

[0170]

[0171] wherein, the b i is the i-th element in the sequence {b k} input to the CPM modulator, 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}, the values of h, M, L, R, T, and K are all real numbers, the q(t) is the phase response function, the

[0172] In some implementations, {b k} satisfies the following relationship:

[0173] b -1 = b K-1 , b -2 = b K-2 , … b -L = b K-L

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

[0175] In some implementations, the amplitude modulation of {s n} is M - order non - negative amplitude modulation, and the value of M is a real number.

[0176] In some implementations, the processing unit is used to obtain a third sequence based on the sequence {s n} after CPM modulation sampling. The odd - numbered elements of the third sequence are the same as the odd - numbered elements of {s n}, and the even - numbered elements of the third sequence are the opposite of the even - numbered elements of {s n}, or the odd - numbered elements of the third sequence are the opposite of the odd - numbered elements of {s n}, and the even - numbered elements of the third sequence are the same as the even - numbered elements of {s n}; perform discrete Fourier transform (DFT) processing on the third sequence to obtain a fifth sequence.

[0177] In some implementations, the method further includes: performing discrete Fourier transform (DFT) processing on the sequence {s n} after CPM modulation sampling to obtain a fourth sequence; performing cyclic shift processing on the fourth sequence to obtain the fifth sequence.

[0178] In some implementations, in the cyclic shift processing, the number of bits of cyclic shift is half of the number of elements in the sequence {s n} after CPM modulation sampling.

[0179] In some implementations, the elements f n in the first sequence {f n} satisfy:

[0180]

[0181] where a is the cyclic displacement value, the cyclic displacement value 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}.

[0182] In some implementations, the processing unit is used to map Q elements in the first sequence to Q consecutive subcarriers; alternatively, map Q elements in the first sequence to Q non-consecutive and equally spaced subcarriers; alternatively, map Q' elements in the first sequence to Q' consecutive subcarriers; alternatively, 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.

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

[0184] -1, -1, 1, 1, -1, -1, -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,

[0185] -1, -1, 1, 1, -1, -1, -1, 1, -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,

[0186] -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 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,

[0187] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -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,

[0188] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -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,

[0189] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -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,

[0191] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -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,

[0192] -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 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,

[0193] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -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,

[0194] -1,-1,1,1,1,- ... 1,1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1,1 ,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1 ,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,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,

[0195] -1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,1,-1,1,1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,1,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。,

[0196] It should be understood that the third aspect and the fourth aspect are the implementation manners on the device side corresponding to the first aspect and the second aspect respectively. Regarding the explanations, supplements and descriptions of the beneficial effects of the first aspect and the second aspect, the third aspect and the fourth aspect are equally applicable and will not be elaborated here.

[0197] In a fifth aspect, a communication device is provided, including a processor, which is configured to cause the communication device to execute the method described in the first aspect and any possible implementation of the first aspect; or cause the communication device to execute the method described in the second aspect and any possible implementation of the second aspect, by executing a computer program or instruction or through a logic circuit.

[0198] In a possible implementation manner, the communication device further includes a memory, which is used to store the computer program or instruction.

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

[0200] In a sixth aspect, a communication device is provided, including a logic circuit and an input / output interface. The input / output interface is used to input and / or output signals, and the logic circuit is configured to execute the method described in the first aspect or any possible implementation of the first aspect; or the logic circuit is configured to execute the method described in the second aspect and any possible implementation of the second aspect.

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

[0202] 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 runs on a computer, the method described in the first aspect or any one of the possible implementations of the first aspect is executed; or, the method described in the second aspect and any one of the possible implementations of the second aspect is executed.

[0203] In a ninth aspect, a computer program product is provided, which includes instructions. When the instructions run on a computer, the method described in the first aspect or any one of the possible implementations of the first aspect is executed; or, the method described in the second aspect and any one of the possible implementations of the second aspect is executed. Description of the Drawings

[0204] Figure 1 is a schematic diagram of a wireless communication system applicable to the embodiments of the present application.

[0205] Figure 2 is a schematic diagram of a communication method provided by the embodiments of the present application.

[0206] Figure 3 is a schematic flow diagram of two sequence generations provided by the embodiments of the present application.

[0207] Figure 4 shows a schematic block diagram of a communication device provided by the embodiments of the present application.

[0208] Figure 5 shows a schematic structural diagram of another communication device provided by the embodiments of the present application. Detailed Embodiments

[0209] Next, the technical solutions in the present application will be described in conjunction with the accompanying drawings.

[0210] Figure 1 is a schematic architecture diagram of a communication system 1000 to which the embodiments of the present application are applied. As Figure 1 shown, the communication system includes a radio access network 100 and a core network 200. Optionally, the communication system 1000 may further include the Internet 300. Among them, the radio access network 100 may include at least one radio access network device (such as Figure 1 110a and 110b in Figure 1among 120a - 120j). The terminal is connected to the radio access network device wirelessly, and the radio access network device is connected to the core network by wireless or wired means. The core network device and the radio access network device can be independent different physical devices, or the functions of the core network device and the logical functions of the radio access network device can be integrated on the same physical device, or the functions of part of the core network device and part of the radio access network device can be integrated on a physical device. Terminals can be connected to each other and radio access network devices can be connected to each other by wired or wireless means. Figure 1 It is only a schematic diagram, and other network devices may also be included in this communication system, such as wireless relay devices and wireless backhaul devices, which are not drawn in Figure 1 it.

[0211] The network device can be a radio access network device. For example, it can be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next generation NodeB (gNB) in a 5th generation (5G) mobile communication system, a next generation NodeB in a 6th generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system, etc.; it can also be a module or unit that completes part of the base station functions. For example, the radio access network device can include at least one of a centralized unit (CU), a distributed unit (DU), and a radio unit (RU). Among them, the centralized unit can also be called 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 function 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 part of the physical layer (for example, the higher layer of the physical layer) or all of the physical layer; the RU completes the radio frequency function and can also complete part of the physical layer (for example, the lower layer of the physical layer). For the specific descriptions of the above various protocol layers, reference can be made to the relevant technical specifications of the 3rd generation partnership project (3GPP). The radio access network device can be a macro base station (such as Figure 1 110a in Figure 1 ), or a micro base station or an indoor station (such as 110b in Figure 1 ), or a relay node or a donor node, etc. The embodiments of the present application do not limit the specific technologies and specific device forms adopted by the radio access network device. For the convenience of description, the base station is used as an example of the network device in the following description.

[0212] A terminal device can also be referred to as a terminal, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely applied 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 wearables, smart transportation, smart city, etc. A 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. Embodiments of the present application do not limit the specific technologies and specific device forms adopted by the terminal.

[0213] Base stations and terminals can be fixed in position or movable. Base stations and terminals can be deployed on land, including indoor or outdoor, handheld or vehicle-mounted; they can also be deployed on water; they can also be deployed on airplanes, balloons, and artificial satellites. Embodiments of the present application do not limit the application scenarios of base stations and terminals.

[0214] The roles of base stations and terminals can be relative. For example, Figure 1 the helicopter or drone 120i in [figure] can be configured as a mobile base station. For the terminals 120j that access the radio access network 100 through 120i, the terminal 120i is a base station; but for the base station 110a, 120i is a terminal, that is, the communication between 110a and 120i is through the radio air interface protocol. Of course, the communication between 110a and 120i can also be through the interface protocol between base stations. At this time, relative to 110a, 120i is also a base station. Therefore, base stations and terminals can both be uniformly referred to as communication devices. Figure 1 110a and 110b in [figure] can be referred to as communication devices with base station functions. Figure 1 120a - 120j in [figure] can be referred to as communication devices with terminal functions.

[0215] Communication can be carried out between base stations and terminals, between base stations and base stations, and between terminals and terminals through licensed spectrum, or through unlicensed spectrum, or through both licensed spectrum and unlicensed spectrum at the same time; communication can be carried out through spectrum below 6 gigahertz (GHz), or through spectrum above 6 GHz, or through both spectrum below 6 GHz and spectrum above 6 GHz at the same time. Embodiments of the present application do not limit the spectrum resources used for wireless communication.

[0216] In the embodiments of the present application, the functions of the base station can also be performed by modules (such as chips) in the base station, or can be performed by a control subsystem including the functions of the base station. The control subsystem including the functions of the base station here can be a control center in the above application scenarios such as smart grid, industrial control, intelligent transportation, and smart city. The functions of the terminal can also be performed by modules (such as chips or modems) in the terminal, or can be performed by a device including the functions of the terminal.

[0217] The technical solutions provided in the embodiments of the present application can be applied to wireless communication between communication devices. The wireless communication between communication devices can include: wireless communication between a network device and a terminal, wireless communication between network devices, and wireless communication between terminals. Among them, in the embodiments of the present application, the term "wireless communication" can also be abbreviated as "communication", and the term "communication" can also be described as "data transmission", "information transmission" or "transmission".

[0218] 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 only taken as examples of the downlink data channel, the downlink control channel, and the uplink data channel respectively. In different systems and different scenarios, the data channel and the control channel may have different names, and the embodiments of the present application do not limit this.

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

[0220] Exemplarily, the current generation methods of the ZC sequence are mainly divided into two categories, namely Type 1 and Type 2.

[0221] The generation method of Type1 is as follows:

[0222]

[0223] Among them, α is the cyclic shift value, and different signals obtain different cyclic shift values according to different calculation methods. u is the group number, v is the sequence number, and they are obtained according to the high-level parameter configuration. M ZC is the length of the sequence.

[0224] When M ZC ≥ 36, the generation method of r u，v (n) is as follows:

[0225] r u，v (n) = x q (n mod N ZC )

[0226]

[0227]

[0228]

[0229] Among them, N ZC is the largest prime number less than M ZC .

[0230] When M ZC < 36 (M ZC ∈ {6, 12, 18, 24}), the generation method of r u，v (n) is as follows:

[0231]

[0232] Among them is obtained by reading from the table with the corresponding length through the group number u:

[0233] M ZC = 6

[0234]

[0235] M ZC = 12

[0236]

[0237]

[0238] M ZC = 18

[0239]

[0240] MZC = 24

[0241]

[0242]

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

[0244]

[0245] The generation method of Type2 is as follows:

[0246]

[0247]

[0248] where u is the group number, v is the serial number, obtained according to the high-level parameter configuration. M is the length of the sequence.

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

[0250]

[0251] where c(i) is a pseudo-random sequence.

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

[0253]

[0254] M = 12

[0255]

[0256]

[0257] M = 18

[0258]

[0259] M = 24

[0260]

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

[0262]

[0263] Among them Obtained by reading from a table of corresponding length through the group number u:

[0264]

[0265]

[0266] The above ZC sequence has a constant modulus in the frequency domain, but after being modulated by orthogonal frequency division multiplexing (OFDM), it will become a non-constant modulus sequence, and its peak to average power ratio (PAPR) value is about 6 dB. In order to enhance coverage, the PAPR values of the sequences used for the PRACH signal, demodulation reference signal (DMRS), and sounding reference signal (SRS) need to be further reduced.

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

[0268] Such as Figure 2 As shown, the method includes the following steps:

[0269] S210, the transmitting device generates a signal.

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

[0271] Exemplarily, the transmitting device obtains the GCP, performs CPM modulation sampling on the GCP, and obtains the first sequence.

[0272] Further, in addition to the above processing, various processes 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, etc. can be performed based on the GCP sequence to obtain the first sequence. Among them, whether to perform differential processing is related to the CPM modulation sampling method. For example, recursive CPM modulation sampling can be used after performing differential processing, and differential processing does not need to be performed if non-recursive CPM modulation sampling is used. Specifically, the schematic generation process of the first sequence using recursive CPM modulation sampling can be referred to Figure 3 in (a) of Figure 3 , and the schematic generation process of the first sequence using non-recursive CPM modulation sampling can be referred to

[0273] Assume that the sequence {x n} can be the sequence obtained by performing discrete Fourier transform DFT on the sequence {s n}. The sequence {s n} is the sequence after performing continuous phase modulation CPM modulation sampling on the sequence {b k}, and the sequence {b k} is the sequence obtained by performing amplitude modulation on the Gray complementary sequence pair GCP.

[0274] It should be understood that before the above processing, it is necessary to obtain GCP.

[0275] 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}, and e is an integer between 0 and 2 v - 1. GCP satisfies the following characteristics:

[0276]

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

[0278]

[0279] Among them, N is the length of the sequence γ, represents taking the conjugate value of γ n .

[0280] In a possible implementation, C e and De respectively satisfy the following relationships:

[0281] C e = f(x 1，e , x 2，e ,..., x v，e ) + c

[0282] D e = f(x 1，e , x 2，e ,..., x v，e ) + M / 2x π(1)，e + c′

[0283] where f(x 1，e , x 2，e ,..., x v，e ) is a Boolean function, c and c’ are integers between 0 and M - 1, v is the number of base sequences x k , the length of the base sequence x k is 2 v , x k，e is the (e + 1)-th element of the base sequence x k , x k，e is the (v + 1 - k)-th bit element in the v-dimensional binary representation of e, M is the modulation order, and π is a transposed array of length v.

[0284] The Boolean function f(x 1，e , x 2，e ,..., x v，e ) can be a linear combination of all the monomials it contains. For example, 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 .

[0285] For example, the sequence {f} is defined as: Assume that (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 ).

[0286] 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)). At this time, the base sequences are x1 = (01010101), x2 = (00110011), and x3 = (00001111).

[0287] A possible implementation is that the above Boolean function can be:

[0288] where c k is an integer between 0 and M - 1, and M is the modulation order.

[0289] The above CPM modulation sampling of GCP to obtain the first sequence can be CPM modulation sampling of a second sequence to obtain the first sequence, and the second sequence is obtained based on the sequences {C e} and {D e}

[0290] A possible implementation is that the second sequence is obtained by performing truncation and splicing processing on the sequences {C e} and {D e}

[0291] Exemplarily, truncation processing is respectively performed on {C e} and {D e} to obtain a first subsequence and a second subsequence, and the first subsequence and the second subsequence are spliced to obtain the second sequence. Then, amplitude modulation processing is performed based on the second sequence. That is, a first subsequence is obtained based on {C e}, a second subsequence is obtained based on {D e}, the length of the first subsequence is less than the length of {C e}, the length of the second subsequence is less than the length of {D e}, the 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.

[0292] For example, the second sequence is represented as {β k}, β k is the k-th element in the second sequence, k is an integer between 0 and K - 1, take K / 2 elements in {C e} to form the first subsequence {C l , C l+1 ,..., C l+K / 2-1}, take the corresponding K / 2 elements in {D e} to form the second subsequence {Dl , 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}.

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

[0294] Exemplarily, expansion processing is performed on {C e} and {D e} respectively to obtain a third subsequence and a fourth subsequence. The third subsequence and the fourth subsequence are spliced to obtain the second sequence. Then, amplitude modulation processing is performed based on the second sequence to obtain a fourth sequence. That is, a third subsequence is obtained based on {C e}, a fourth subsequence is obtained based on {D e}. The lengths of the third subsequence and the fourth subsequence are the same. 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}. The 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. The length of the second sequence is the sum of the lengths of the third subsequence and the fourth subsequence.

[0295] For example, the second sequence is represented as {β k}, β k is the k-th element in the second sequence, where k is an integer between 0 and K - 1. {C e} is expanded to K / 2 elements to form a third subsequence {C0, C1,..., C E-1 , C l , C l+1 ,... C l+K / 2-E-1}, and {D e} is expanded to K / 2 elements to form a 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 , …Cl+K / 2-E-1 , D0, D1, …, D E-1 , D l , D l+1 , …, D l+K / 2-E-1}。

[0296] Optionally, perform differential processing on the GCP. For example, C e and D e satisfy the following relationship:

[0297]

[0298]

[0299] wherein, the is an exclusive OR operation, C′ e and D′ e are elements in the GCP sequence before the exclusive OR operation, e is an integer between 0 and 2 v -1, C′ -1 = 1, D′ -1 = 1.

[0300] For example, assume that {C′ e} is {01101010111}, then after differential processing, {C e} is {11011111100}.

[0301] It should be understood that differential processing is an optional step. Differential processing is not required before some CPM modulations. For example, non-recursive modulation CPM does not require differential operation. This application does not make a limitation on this.

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

[0303] In a possible manner, the transmitting device first performs M-order amplitude modulation on the sequence A to generate the sequence {γ k}, and then performs a transformation on the sequence {γ k} to generate the sequence {b k} to achieve non-negative amplitude modulation of the sequence A. Optionally, the element b k in the sequence {b k} and the element γ k in the sequence {γ k} satisfy the following relational formula:

[0304] b k = (γ k + M - 1) / 2

[0305] Where M is the order of the preset amplitude modulation, k takes 0, 1, …, K−1 in sequence, and K is the number of elements in the sequence {γ k}. It can be understood that the values of the elements in the sequence {γ k} are {±1, ±3, …, ±(M−1)}, and the values of the elements in the sequence {b k} are integers between 0 and M−1.

[0306] Taking the example of "the sequence A is {1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, …} and M equals 4" to explain the above formula.

[0307] 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 the sequence A, the four element combinations are respectively corresponding 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, …}.

[0308] Further, the transmitting device performs a transformation on the sequence {γ k}. As can be seen from the above formula, after the sequence {γ k} is transformed, the element "1" is transformed into "2", the element "-1" is transformed into "1", the element "3" remains "3", and the element "-3" is transformed into "0". Then the sequence {b k} is {1, 3, 1, 1, 0, 1, …}. It can be seen that the values of the elements in the sequence {b k} are integers between 0 and 3.

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

[0310] In a possible way, the transmitting device performs M - order amplitude modulation on the sequence A to generate the sequence {b k}. It can be understood that the values of the elements in the sequence {b k} are {±1, ±3, …, ±(M−1)}.

[0311] Taking the example of "sequence A is {0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1,...} and M equals 4", there are four element combinations in sequence A, 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 "3", "00" is modulated to "-3", "01" is modulated to "-1", and "11" is modulated to "1", then the obtained sequence {b k} is {-1, 3, 3, -1, -3, -1, 1,...}. It can be seen that the values of the elements in sequence {b k} are {±1, ±3}.

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

[0313] Furthermore, the transmitting device performs CPM modulation and sampling on sequence {b k} to obtain a first sequence.

[0314] As mentioned above, CPM modulation includes recursive modulation and non - recursive modulation. They will be described separately below.

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

[0316] In an alternative embodiment, when the transmitting device performs CPM and sampling on sequence {b k}, CPM and sampling can be performed in one step. Among them, the output sequence {s n} of the modulator and sequence {b k} satisfy the following relationship:

[0317]

[0318] where s n is an element in the output sequence {s n} of the CPM modulator, represents the floor of n / R, b k is an element in sequence {b k}, k takes 0, 1,..., K - 1 in turn, K is the number of elements in 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 a preset period, which is a positive integer, such as 1, 2, etc.;

[0319] q(t) is the phase response function, which can be expressed by the following formula:

[0320]

[0321] Among them, F(t) can be a rectangular pulse function, a raised cosine pulse function, a Gaussian pulse function, which is not limited here. In the embodiments of the present application, the Gaussian pulse function is taken as an example for illustration, and it can be expressed as:

[0322]

[0323]

[0324]

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

[0326] A possible implementation is that in recursive modulation, {b k} satisfies the following relationship:

[0327]

[0328] Among them, P is the denominator of the modulation index h. When the value of h is 1 / 2, the value of P is 2, and K is the length of the sequence {b k}. This processing can also be called CPM initialization.

[0329] In another alternative embodiment, the transmitting device first performs recursive CPM on the sequence {b k} to generate a continuous signal s(t). The sequence {b k} and the continuous signal s(t) satisfy the following relational formula:

[0330]

[0331]

[0332] Among them, t is the time variable and 0 ≤ t ≤ KT, K is the number of elements of the sequence {b k}, L is the preset impulse length. h is the preset modulation index, T is the preset period, and j is q(t - iT) is the function value of the phase response function q(t) when t is equal to (t - iT).

[0333] A possible implementation is that {b k} satisfies the above initialization method. For specific details, please refer to the previous description and will not be elaborated here.

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

[0335] Then, sample the continuous signal s(t) to generate a sequence {s n}. Optionally, the sequence {s n} satisfies the following formula:

[0336]

[0337] where R is the preset sampling rate, K is the number of elements of the sequence {b k}, and T is the preset period.

[0338] Method 2: The CPM modulation uses non-recursive modulation.

[0339] In non-recursive modulation, any element s n of the sequence {s n} is determined by L + 1 consecutive b k s. b k is an element in the sequence {b k}, and L is a positive integer.

[0340] In an optional implementation manner, when performing CPM and sampling on the sequence {b k}, CPM and sampling can be performed in one step. The sequence {s n} and the sequence {b k} can satisfy the following relationship:

[0341]

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

[0343] Furthermore, considering the above formula, when the value of n is relatively small, there may be no k corresponding elements in the sequence {b or }. For example, when n is 0, i is 0, and L is 3, there is no b k in the sequence {b -1}, b -2 and the corresponding elements of b -3 . Therefore, it is necessary to initialize the non-recursive CPM modulation, that is, it is necessary to determine the values of b -1 , b -2 and b -3 , and here they can be initialized to 0.

[0344] A possible implementation is that in non-recursive modulation, the initialization method of CPM can be tail-biting initialization. Exemplarily, the initialization method of CPM is: make the elements in {b k} satisfy the following formula:

[0345] b -1 =b K-1 , b -2 =b K-2 ,... b -L =b K-L

[0346] where K is the number of elements in the sequence {b k}, and L is the impulse length. Exemplarily, when n is 0, i is 0, L is 3, and K is 6, the corresponding elements of b -1 , b -2 and b -3 are the elements b5, b4, and b3 in {b k}.

[0347] In an alternative embodiment, the transmitting device first performs non-recursive CPM on the sequence {b k} to generate a continuous signal s(t). The sequence {b k} and the continuous signal s(t) satisfy the relational formula:

[0348]

[0349]

[0350] where t is a time variable and 0 ≤ t ≤ KT, and are respectively the k th element, the th element, and the th element in the sequence {b elements, k takes 0, 1, ……, K-1 in turn, where K is the number of elements in the sequence {b k}, L can be a preset impact length, R can be a preset sampling rate, and the product of K and R can be equal to N. h is a preset modulation index, M is a preset amplitude modulation order, T is a preset period, and j is the function value when t is equal to in the phase response function q(t).

[0351] When the value of t is relatively small, there may be no k or corresponding elements in the sequence {b }. For example, when t is 0, i is 1, and L is 3, there are no elements corresponding to b k in the fourth sequence {b -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-mentioned tail-biting initialization method, for details, please refer to the previous description, which will not be elaborated here.

[0352] As can be seen from the above, the phase of the continuous signal s(t) at the initial moment is continuous with the phase at the end moment, which is more conducive to generating a time-domain signal with a lower PAPR value subsequently. Among them, the initial moment can be understood as the moment when t is 0, and the end moment can be understood as the moment when t is KT.

[0353] After that, the continuous signal s(t) is sampled to obtain the sequence {s n}, optionally, the sequence {s n} satisfies the following formula:

[0354] {s n} = {s0, s1, ……, s N-1} = {s(t = 0*T / R), s(t = 1*T / R), ……, s(t = (KR - 1)*T / R)}

[0355] where, the N elements s0, s1, ……, s n in the sequence {s N-1} are respectively 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 a preset sampling rate, K is the number of elements in the sequence {b k}, and T is a preset period.

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

[0357] It should also be understood that in the non-recursive modulation method, amplitude modulation can adopt non-negative amplitude modulation. That is, the sequence is modulated into an integer between 0 and M-1. The specific modulation method can be seen in the previous description and will not be elaborated here.

[0358] 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 make any limitations in this regard.

[0359] The execution of the discrete Fourier transform described above includes the following two cases:

[0360] Case 1: Multiply the sequence {s n} bit by bit with the mask sequence to generate a third sequence, and perform a discrete Fourier transform 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 the same as the odd-numbered elements of {s n}, and the even-numbered elements of the third sequence are the opposite of the even-numbered elements of {s n}, or the odd-numbered elements of the third sequence are the opposite of the odd-numbered elements of {s n}, and the even-numbered elements of the third sequence are the same as the even-numbered elements of {s n}.

[0361] After that, the transmitting device performs a DFT on the third sequence to generate a fifth sequence. It is not difficult to understand that the fifth sequence is a discrete frequency-domain sequence. Exemplarily, assuming the sequence {s n} is {s0, s1,..., s N-1}, and the mask sequence is {1, -1, 1, -1,...}, when N is even, the third sequence is {s0*1, s1*-1,..., s N-1 *-1}; when N is odd, the third sequence is {s0*1, s1*-1,..., s N-1 *1}. Further, perform an N-point DFT on the above third sequence to obtain the fifth sequence {x n} as {x0, x1,..., x N-1}.

[0362] Case 2: Perform a discrete Fourier transform on the sequence {s n} to generate a fourth sequence, and then perform a cyclic shift to generate a fifth sequence. Optionally, the number of bits of the cyclic shift can be half of the number of elements in the sequence {s n}. Exemplarily, when the sequence {s n} is {s0, s1,..., sN-1}, after performing an N-point DFT on it, the fourth sequence is obtained is {x0, x1,..., x N-1}, the sequence is circularly shifted, and the number of bits of circular shift is half of the number of elements in the sequence {s n}, and the result of circular shift is the fifth sequence: {x n} = {x N / 2 , x N / 2+1 , …, x N-1 , x0, x1,..., x N / 2-1}.

[0363] The above-mentioned transmitting device generates the first sequence, which can be obtained by performing a circular shift process on the fifth sequence according to the circular shift value a. Or, after the frequency domain sequence after DFT, a phase rotation operation is performed to obtain the first sequence. In one possible way, the circular shift value a is configured, for example, configured by a network device to the transmitting device. The circular shift value a can also be predefined, and this is not limited.

[0364] In one possible implementation, the first sequence can be expressed as {f n}, the first sequence {f n} includes Q elements, Q is an integer greater than 0, x n is an element in the fifth sequence {x n}, f n satisfies:

[0365] f n = x n * exp(2πjan)

[0366] where n is an integer between 0 and Q - 1, Q is an integer greater than 0, exp represents the exponential function with e as the base, a represents the circular displacement value, and a is a real number.

[0367] The foregoing method of mapping subcarriers and generating signals can be as follows:

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

[0369] Optionally, the transmitting device can map the first sequence {f n} The Q elements in are respectively mapped to Q equally-spaced subcarriers, and this interval can be greater than or equal to one subcarrier. For example, the transmitting device can sequentially map the first sequence {f n} The Q terms in are mapped to Q subcarriers with equally-spaced distribution. One term is mapped to one subcarrier.

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

[0371] Exemplarily, the first l elements of the first sequence {f n} and the last l elements of the first sequence {f n} are removed, that is, the elements in the middle part of the first sequence are intercepted. For example, the first sequence {f n} = {x0, x1,..., x Q-1} The {x l , x l+1 ,..., x Q-l-1} in is intercepted and mapped to multiple subcarriers, that is, the Q - 2l terms in the first sequence are mapped to N - 2l subcarriers to obtain a frequency-domain signal with Q - 2l points.

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

[0373] In other words, during mapping, it can be mapped to consecutive subcarriers, or to non-consecutive and equally-spaced subcarriers, or some elements can be selected for mapping.

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

[0375] Optionally, the frequency-domain signal can also be multiplied by a precoding matrix and then subcarrier mapping is performed. Then the frequency-domain signal is converted into a time-domain signal and CP is added to generate a signal.

[0376] The following are several examples of the second sequence (i.e., the spliced GCP sequence). It should be understood that there can be multiple second sequences in the embodiments of the present application, and the following are only examples rather than limitations.

[0377] The PAPR of the time-domain sequence is less than 0.5. At this time, the GCP parameter configuration is: v = 4, π = {1, 2, 3, 4}, c = {1, 1, 0, 1}, c = 0, c' = 1, both C and D intercept the first 15 bits of the original sequence, and the settings of the CPM modulator are: M = 2, L = 3, h = 1 / 2, N = 2, J = 30, T = 1, B = 0.3. Intercept the middle 36 sequences of the frequency-domain sequence after the DFT transformation of the CPM sequence, so as to obtain a sequence with a length of 36.

[0378] -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1.

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

[0380] -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1.

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

[0382] -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1.

[0383] The PAPR of the time-domain sequence is less than 0.5. At this time, the GCP parameter configuration is as follows: 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. The settings of the CPM modulator are: M = 2, L = 3, h = 1 / 2, N = 120 / 64, J = 64, T = 1, B = 0.3.

[0384] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1.

[0385] The PAPR of the time-domain sequence is less than 0.5. At this time, the GCP parameter configuration is as follows: v = 6, π = {1, 2, 3, 4, 5, 6}, c = {1, 1, 1, 1, 0, 1}, c = 0, c' = 1. Both C and D are truncated to the first 55 bits of the original sequence. The settings of the CPM modulator are: M = 2, L = 3, h = 1 / 2, N = 144 / 110, J = 110, T = 1, B = 0.3.

[0386] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1

[0387] The PAPR of the time-domain sequence is less than 0.5. At this time, the GCP parameter configuration is as follows: v = 6, π = {1, 2, 3, 4, 5, 6}, c = {1, 1, 1, 1, 0, 1}, c = 0, c' = 1. Both C and D are truncated to the first 60 bits of the original sequence. The settings of the CPM modulator are: M = 2, L = 3, h = 1 / 2, N = 2, J = 120, T = 1, B = 0.3. The middle 150 sequences of the frequency-domain sequence after the DFT transformation of the truncated CPM sequence are intercepted, so as to obtain a sequence with a length of 150.

[0388] -1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1, 1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1.

[0389] The PAPR of the time domain sequence is less than 0.5. The GCP parameter configuration is: 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, and the CPM modulator is set as: M = 2, L = 3, h = 1 / 2, N = 2, J = 128, T = 1, B = 0.3. The middle 180 sequences of the frequency domain sequence after the CPM sequence is transformed by DFT are intercepted to obtain a sequence of length 180.

[0390] -1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, , 1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1.

[0391] The PAPR of the time-domain sequence is less than 0.5. At this time, the GCP parameter configuration is as follows: v = 7, π = {1, 2, 3, 4, 5, 6, 7}, c = {1, 1, 1, 0, 0, 0, 1}, c = 0, c' = 1. Both C and D intercept the first 105 bits of the original sequence. The settings of the CPM modulator are: M = 2, L = 3, h = 1 / 2, N = 2, J = 210, T = 1, B = 0.3. Intercept the middle 240 sequences of the frequency-domain sequence after the DFT transformation of the CPM sequence, so as to obtain a sequence with a length of 240.

[0392] -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1.

[0393] The PAPR of the time-domain sequence is less than 0.5. At this time, the GCP parameter configuration is as follows: v = 7, π = {1, 2, 3, 4, 5, 6, 7}, c = {1, 1, 1, 1, 0, 1, 1}, c = 0, c' = 1. Both C and D intercept the first 115 bits of the original sequence. The settings of the CPM modulator are: M = 2, L = 3, h = 1 / 2, N = 2, J = 230, T = 1, B = 0.3. Intercept the middle 270 sequences of the frequency-domain sequence after the DFT transformation of the CPM sequence, so as to obtain a sequence with a length of 270.

[0394] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1。

[0395] The PAPR of the time-domain sequence is less than 0.5. The GCP parameter configuration at this time is: v = 7, π = {1, 2, 3, 4, 5, 6, 7}, c = {1, 1, 1, 1, 0, 1, 1}, c = 0, c' = 1. Both C and D intercept the first 125 bits of the original sequence. The settings of the CPM modulator are: M = 2, L = 3, h = 1 / 2, N = 2, J = 250, T = 1, B = 0.3. Intercept the middle 300 sequences of the frequency-domain sequence after the DFT transformation of the CPM sequence, so as to obtain a sequence with a length of 300.

[0396] -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1。

[0397] The PAPR of the time-domain sequence is less than 0.5. The GCP parameter configuration at this time is: v = 8, π = {1, 2, 3, 4, 5, 6, 7, 8}, c = {1, 1, 1, 1, 1, 0, 1, 1}, c = 0, c' = 1. Both C and D intercept the first 256 bits of the original sequence. The settings of the CPM modulator are: M = 2, L = 3, h = 1 / 2, N = 2, J = 512, T = 1, B = 0.3. Intercept the middle 600 sequences of the frequency-domain sequence after the DFT transformation of the CPM sequence, so as to obtain a sequence with a length of 600.

[0398] -1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，1，-1，1，1，1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，1，-1，1，1，1，-1，-1，1，1，-1，1，1，-1，-1，-1，1，-1，-1，1，1，1，-1，-1，1，-1，-1，1，1，-1，-1，-1，1，1，1，-1，-1，-1，1，1，-1，-1，1，-1，-1，1，1，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。,

[0399] S220, The transmitting device sends a signal to the receiving device. Correspondingly, the receiving device receives the signal.

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

[0401] S230, The receiving device demodulates the signal by orthogonal frequency division multiplexing (OFDM) to obtain a sixth sequence.

[0402] Wherein, the configuration adopted by the receiving device for demodulating the signal is the same as the configuration adopted by the transmitting device for sending the signal.

[0403] S240, The receiving device generates a first sequence.

[0404] Specifically, the manner in which the receiving device generates the first sequence is the same as the manner in which the transmitting device generates the first sequence in S210, which will not be elaborated here.

[0405] S250, The receiving device determines a first result based on the first sequence and the sixth sequence.

[0406] Exemplarily, the result can be a channel estimation or a channel sounding result, or it can be a obtained resource configuration, etc.

[0407] It should be understood that the signal in the embodiments of the present application can be a PRACH signal or a reference signal, such as DMRS, SRS, etc. There is no limitation on this.

[0408] In this method, a manner of generating a sequence is provided, and the obtained sequence has good autocorrelation performance. For example, the autocorrelation value of the CPM sequence at the zero point position in the time domain is significantly greater than the values at other positions. By modulating GCP with CPM, the phase at the end position and the phase at the start position of the sequence in the time domain are continuous, reducing the PAPR value of the sequence and enhancing the coverage ability of the sequence, and further improving the accuracy of processing such as channel estimation and channel sounding.

[0409] It is understandable that, in order to implement the functions in the above embodiments, the base station and the terminal include the corresponding hardware structures and / or software modules for executing each function. Those skilled in the art should easily realize that, in combination with the units and method steps of each example described in the embodiments disclosed in the present application, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in the manner of hardware or computer software driving hardware depends on the specific application scenarios and design constraints of the technical solution.

[0410] Figure 4 and Figure 5 FIG. shows a schematic structural diagram of a possible communication device provided by an embodiment of the present application. These communication devices can be used to implement the functions of the terminal or the base station in the above method embodiments, and thus can also achieve the beneficial effects possessed by the above 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 can be the base station 110a or 110b shown in Figure 1 , or can also be a module (such as a chip) applied to the terminal or the base station.

[0411] As Figure 4 shown, 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 the network device in the method embodiment shown in the above Figure 2 .

[0412] When the communication device 400 is used to implement the function of the sending device in the method embodiment shown in Figure 2 : The transceiver unit 420 can be used to send signals; the processing unit 410 is used to generate a first sequence, etc.

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

[0414] The processing unit 410 is used for demodulation, generating a first sequence, etc.

[0415] For a more detailed description of the above processing unit 410 and transceiver unit 420, it can be directly obtained by referring to the relevant description in the method embodiment shown in Figure 2 , and will not be elaborated here.

[0416] As Figure 5As shown, the communication device 500 includes a processor 510 and an interface circuit 520. The processor 510 and the interface circuit 520 are coupled to each other. It can be understood that the interface circuit 520 can be a transceiver or an input / output interface. Optionally, the communication device 500 may further include a memory 530 for storing instructions executed by the processor 510, or input data required for the processor 510 to run the instructions, or data generated after the processor 510 runs the instructions.

[0417] When the communication device 500 is used to implement Figure 2 the method shown, the processor 510 is used to implement the functions of the above-mentioned processing unit 410, and the interface circuit 520 is used to implement the functions of the above-mentioned transceiver unit 420.

[0418] When the above communication device is a chip applied to a terminal, the terminal chip implements the functions of the terminal in the above method embodiment. The terminal chip receives information from other modules in the terminal (such as a radio frequency module or an antenna), and this 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 an antenna), and this information is sent by the terminal to the base station.

[0419] When the above communication device is a module applied to a base station, the base station module implements the functions of the base station in the above 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 this 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 this information is sent by the base station to the terminal. Here, the base station module can be the baseband chip of the base station, or a DU or other modules, and here the DU can be a DU under the open radio access network (O-RAN) architecture.

[0420] It can be understood that the processor in the embodiments of the present application can be a Central Processing Unit (CPU), or other general-purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor can be a microprocessor or any conventional processor.

[0421] The method steps in the embodiments of the present application can be implemented in hardware or in software instructions executable by a processor. The software instructions can be composed of corresponding software modules, and the software modules can be stored in a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an erasable programmable read-only memory, an electrically erasable programmable read-only memory, a register, a hard disk, a removable hard disk, a 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 a component of the processor. The processor and the storage medium can be located in an ASIC. Additionally, the ASIC can be located in a base station or a terminal. The processor and the storage medium can also exist as discrete components in a base station or a terminal.

[0422] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part 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 executed in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device, or other programmable devices. The computer program or instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer program or instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center in a wired or wireless manner. The computer-readable storage medium can be any available medium accessible by a computer or a data storage device such as a server or a data center integrating one or more available media. The available medium can be a magnetic medium, such as a floppy disk, a hard disk, or a magnetic tape; it can also be an optical medium, such as a digital video disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium can be a volatile or non-volatile storage medium, or can include both volatile and non-volatile types of storage media.

[0423] In various embodiments of the present application, if there is no special explanation and logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0424] According to whether the specification uses options: In this application, "at least one" means one or more, and "a plurality" means two or more. "And / or" describes the association relationship of associated objects and indicates that three relationships can exist. For example, A and / or B can represent the following situations: A exists alone, B exists alone, and A and B exist simultaneously, where A and B can be singular or plural. In the text description of this application, the character " / " generally represents an "or" relationship between the front and rear associated objects; in the formulas of this application, the character " / " represents a "division" relationship between the front and rear associated objects. "At least one of the following" or its similar expressions are 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 simultaneously, B and C exist simultaneously, A and C exist simultaneously, and A, B, and C exist simultaneously, where A, B, and C can be singular or plural.

[0425] It can be understood that the various numerical numbers involved in the embodiments of this application are only for the convenience of description and are not used to limit the scope of the embodiments of this application. The magnitudes of the sequence numbers of the above processes do not mean the sequence of execution, and the execution sequence of each process should be determined by its function and internal logic.

Claims

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

2. The method according to claim 1, characterized in that, The method further includes: Obtaining the GCP; Performing CPM modulation 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. 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, the second sequence including all elements of the first subsequence and the second subsequence, the length of the second sequence being the sum of the lengths of the first subsequence and the second subsequence.

6. The method according to claim 4, characterized in that 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, the second sequence including all elements of the third subsequence and the fourth subsequence, the length of the second sequence being 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}, 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 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. The 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} input to the CPM modulator, 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, the 9. The method according to claim 8, wherein The described {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 b i is the i-th element in the sequence {b k} input to the CPM modulator, where i takes integer values 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, K is the number of elements in {b k}, and the values of h, M, L, R, T, and K are all real numbers. 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 {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 takes real values.

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 - numbered elements of the third sequence are the same as the odd - numbered elements of the {s n}, and the even - numbered elements of the third sequence are the opposite numbers of the even - numbered elements of the {s n}, or the odd - numbered elements of the third sequence are the opposite numbers of the odd - numbered elements of the {s n}, and the even - numbered elements of the third sequence are the same as the even - numbered 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 cyclic shift processing on the fourth sequence to obtain the fifth sequence.

16. The method according to claim 15, characterized in that, 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 in the first sequence {f n} 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, the first sequence being a sequence obtained by modulating and sampling a Gray complementary sequence 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 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, wherein 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, the second sequence including all elements of the first subsequence and the second subsequence, the length of the second sequence being 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 {C e}, a third subsequence is obtained. Based on the {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 the {C e}, and the length of the second subsequence is greater than the length of the {D e}; 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, the length of the second sequence being 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 C′ e and D′ e are elements in the GCP sequence before the exclusive OR operation. The e is an integer between 0 and 2 v -1. C′ -1 = 1, D′ -1 = 1.

26. The method according to claim 25, wherein 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 i takes integer values 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, the 27. The method according to claim 26, wherein The described {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: wherein, the b i is the i-th element in the sequence {b k} input to the CPM modulator, 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}, the values of h, M, L, R, T, and K are all real numbers, the q(t) is the phase response function, the 30. The method according to claim 29, wherein The described {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 {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 cyclic shift processing on the fourth sequence to obtain the fifth sequence.

34. The method according to claim 33, wherein In the cyclic shift processing, 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 in the first sequence {f n} n satisfy: f n = x n e j2πan , 0 ≤ n ≤ Q - 1 where a is a cyclic shift value, the cyclic shift value is obtained according to 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. When the computer instructions are 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. When the computer program code is 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.

Images