Signal processing method, communication apparatus, communication system, and storage medium

Abstract

The present application relates to the field of communications, and discloses a signal processing method, a communication apparatus, a communication system, and a storage medium. The method comprises: a terminal device generates a first sequence comprising a preamble sequence, then modulates the first sequence to obtain a first signal, and sends the first signal. Thus, when a network device receives the first signal, the network device synchronizes the first signal on the basis of the preamble sequence to determine the position of the preamble sequence in the first signal, thereby demodulating the synchronized first signal to obtain the first sequence. The preamble sequence is a second sequence or a sequence equivalent to the second sequence. In addition, the second sequence is determined on the basis of an m sequence, and the m sequence is a preset m sequence having a small correlation value secondary peak during sliding correlation. According to the method, when a terminal device sends an uplink signal, a preamble sequence can be generated on the basis of a preset m sequence having a low correlation value secondary peak, so that uplink synchronization performance is improved.

Description

Signal processing methods, communication devices, communication systems and storage media

[0001] This application claims priority to Chinese Patent Application No. 202311455995.6, filed on November 3, 2023, entitled "Signal Processing Method, Communication Device, Communication System and Storage Medium", the entire contents of which are incorporated herein by reference. Technical Field

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

[0003] Active or semi-passive Internet of Things (IoT) is a low-cost, low-power IoT solution with power consumption not exceeding 500μW. It can achieve longer coverage than passive IoT, and active or semi-passive IoT supports coherent reception for uplink. The optional modulation method is binary phase shift keying (BPSK). When transmitting uplink data, the device adds a preamble to the data signal for uplink synchronization. The base station uses preamble detection for timing to determine the data position. The detection method involves the base station receiving the signal within the time window where the preamble is likely to arrive and generating a local preamble signal. This preamble signal is then correlated with the received signal; the position with the highest correlation value is determined as the timing position of the preamble. Since uplink data is scheduled by the base station, the base station knows the data length and can determine the start and end positions of the received signal's data window based on the preamble's timing position and the data length.

[0004] However, uplink reception typically involves a certain carrier frequency offset (CFO). CFO causes the main peak of the correlation value to shift in the time-frequency two dimensions when the local preamble signal and the received signal are slide correlated, thus affecting uplink synchronization performance and consequently the demodulation performance of the physical uplink shared channel (PUSCH).

[0005] Summary of the Invention

[0006] This application provides a signal processing method, communication device, communication system, and storage medium, which enables a terminal device to generate a preamble sequence based on a preset m-sequence with a lower secondary peak in the correlation value when sending uplink signals, thereby improving uplink synchronization performance.

[0007] In a first aspect, embodiments of this application provide a signal processing method, the method comprising: generating a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[0008] Wherein, the second sequence is an m-sequence, which is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set;

[0009] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0010] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[0011] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[0012] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[0013] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[0014] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[0015] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[0016] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[0017] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0018] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[0019] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[0020] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[0021] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[0022] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[0023] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[0024] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0025] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0026] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[0027] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[0028] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0029] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[0030] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[0031] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[0032] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[0033] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 1];

[0034] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0035] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 1];

[0036] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0037] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[0038] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[0039] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0040] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1];

[0041] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 0, 1, 0];

[0042] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[0043] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[0044] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 1, 0];

[0045] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[0046] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 1, 0];

[0047] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 0, 1];

[0048] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[0049] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 1, 1];

[0050] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0051] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 1, 0];

[0052] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[0053] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[0054] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 1, 1];

[0055] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1];

[0056] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 1, 1, 1];

[0057] Primitive polynomial x 7+x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0];

[0058] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 0, 1];

[0059] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 1, 0];

[0060] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[0061] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0062] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[0063] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0];

[0064] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0065] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[0066] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 0, 0, 0, 1];

[0067] Primitive polynomial x 8 +x 4 +x 3 +x2 +1, initial value [0, 1, 0, 0, 0, 1, 0, 0];

[0068] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0, 0, 1, 1];

[0069] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0070] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 0, 1];

[0071] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

[0072] Based on this method, when the terminal sends the first signal, it can determine the preamble sequence according to the m-sequence. Since the m-sequence is a pre-set primitive polynomial with the minimum number of taps and has good time-frequency two-dimensional correlation detection performance, the complexity of generating the m-sequence at the transceiver end can be reduced, and the uplink synchronization performance can be improved, thereby improving the uplink data demodulation performance.

[0073] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[0074] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[0075] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[0076] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[0077] Primitive polynomial x 3 +x 2+1, initial value [0, 0, 1].

[0078] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0079] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0080] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[0081] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 1];

[0082] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[0083] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[0084] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 1].

[0085] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0086] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0087] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 1, 1];

[0088] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0089] Primitive polynomial x 5 +x 4 +x3 +x 2 +1, initial value [0, 1, 1, 0, 1];

[0090] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0];

[0091] Primitive polynomial x 5 +x 3 +1, initial value [1, 1, 1, 1, 0];

[0092] Primitive polynomial x 5 +x 3 +1, initial value [1, 0, 1, 1, 0];

[0093] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0];

[0094] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1].

[0095] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0096] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0097] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[0098] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1];

[0099] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 0];

[0100] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[0101] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [1, 1, 0, 0, 0, 1];

[0102] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 1];

[0103] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 0, 0, 0, 1].

[0104] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0105] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0106] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 0, 1];

[0107] Primitive polynomial x 7 +x 5 +x 4 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[0108] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1, 1, 1];

[0109] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 1, 0];

[0110] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 0];

[0111] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[0112] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 1];

[0113] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 1, 1, 1, 0, 1].

[0114] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0115] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0116] Primitive polynomial x 8 +x 6 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0117] Primitive polynomial x 8 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1, 1, 0];

[0118] Primitive polynomial x 8 +x 6 +x 4 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 0, 0, 0, 0];

[0119] Primitive polynomial x 8+x 7 +x 6 +x 5 +x 4 +x 2 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[0120] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 1, 1, 1, 0];

[0121] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0, 0];

[0122] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0123] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[0124] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

[0125] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0126] Secondly, embodiments of this application provide a communication device that performs the functions of the method described in the first aspect. The functions can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functions of the method described in the first aspect, such as a processing unit, a transmitting unit, etc.

[0127] The processing unit is configured to generate a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; and to modulate the first sequence to obtain a first signal.

[0128] The transmitting unit is used to transmit the first signal;

[0129] Wherein, the second sequence is an m-sequence, which is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set;

[0130] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0131] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[0132] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[0133] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[0134] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[0135] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[0136] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[0137] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[0138] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0139] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[0140] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[0141] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[0142] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[0143] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[0144] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[0145] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0146] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0147] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[0148] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[0149] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0150] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[0151] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[0152] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[0153] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[0154] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 1];

[0155] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0156] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 1];

[0157] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0158] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[0159] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[0160] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0161] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1];

[0162] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 0, 1, 0];

[0163] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[0164] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[0165] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 1, 0];

[0166] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[0167] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 1, 0];

[0168] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 0, 1];

[0169] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[0170] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 1, 1];

[0171] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0172] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 1, 0];

[0173] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[0174] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[0175] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 1, 1];

[0176] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1];

[0177] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 1, 1, 1];

[0178] Primitive polynomial x 7 +x1 +1, initial value [0, 1, 0, 1, 1, 0, 0];

[0179] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 0, 1];

[0180] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 1, 0];

[0181] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[0182] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0183] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[0184] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0];

[0185] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0186] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[0187] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 0, 0, 0, 1];

[0188] Primitive polynomial x 8 +x 4 +x 3 +x2 +1, initial value [0, 1, 0, 0, 0, 1, 0, 0];

[0189] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0, 0, 1, 1];

[0190] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0191] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 0, 1];

[0192] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

[0193] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[0194] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[0195] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[0196] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[0197] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1].

[0198] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0199] Primitive polynomial x 4 +x 3+1, initial value [1, 1, 1, 1];

[0200] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 1];

[0201] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[0202] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[0203] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 1].

[0204] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0205] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 1, 1];

[0206] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0207] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 1];

[0208] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0];

[0209] Primitive polynomial x 5 +x 3 +1, initial value [1, 1, 1, 1, 0];

[0210] Primitive polynomial x 5 +x 3 +1, initial value [1, 0, 1, 1, 0];

[0211] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0];

[0212] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1].

[0213] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0214] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[0215] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1];

[0216] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 0];

[0217] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[0218] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [1, 1, 0, 0, 0, 1];

[0219] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 1];

[0220] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 0, 0, 0, 1].

[0221] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0222] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 0, 1];

[0223] Primitive polynomial x 7 +x 5 +x 4 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[0224] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1, 1, 1];

[0225] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 1, 0];

[0226] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 0];

[0227] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[0228] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 1];

[0229] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 1, 1, 1, 0, 1].

[0230] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0231] Primitive polynomial x 8 +x 6 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0232] Primitive polynomial x 8 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1, 1, 0];

[0233] Primitive polynomial x 8 +x 6 +x 4 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 0, 0, 0, 0];

[0234] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 4 +x 2 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[0235] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 1, 1, 1, 0];

[0236] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0, 0];

[0237] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0238] Primitive polynomial x 8 +x 7 +x 2 +x 1+1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[0239] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

[0240] Thirdly, embodiments of this application also provide a communication device, including: a memory and a processor, the processor being configured to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device causes the device to perform the method described in the first aspect or any possible design of the first aspect.

[0241] Fourthly, embodiments of this application also provide a communication device, including: a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and execute the methods described in the first aspect or any possible design of the first aspect.

[0242] The communication devices described in the second to fourth aspects above can be applied to terminal equipment.

[0243] Fifthly, embodiments of this application also provide a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a terminal device or in a chip embedded in the terminal device, the terminal device performs the method described in the first aspect.

[0244] In a sixth aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, enable the computer to perform the methods described in the first aspect or any possible design of the first aspect.

[0245] Understandably, the beneficial effects that can be achieved by the second to sixth aspects provided above can be referred to the beneficial effects of the first aspect and any of its possible designs, which will not be repeated here.

[0246] In a seventh aspect, embodiments of this application provide a signal processing method, the method comprising: receiving a first signal, the first signal being modulated by a terminal device according to a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; determining the position of the preamble sequence in the first signal; acquiring a data window according to the position of the preamble in the first signal; and demodulating the data signal within the data window;

[0247] Wherein, the second sequence is an m-sequence, which is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set;

[0248] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0249] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[0250] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[0251] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[0252] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[0253] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[0254] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[0255] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[0256] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0257] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[0258] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[0259] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[0260] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[0261] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[0262] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[0263] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0264] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0265] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[0266] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[0267] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0268] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[0269] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[0270] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[0271] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[0272] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 1];

[0273] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0274] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 1];

[0275] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0276] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[0277] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[0278] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0279] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1];

[0280] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 0, 1, 0];

[0281] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[0282] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[0283] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 1, 0];

[0284] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[0285] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 1, 0];

[0286] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 0, 1];

[0287] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[0288] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 1, 1];

[0289] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0290] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 1, 0];

[0291] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[0292] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[0293] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 1, 1];

[0294] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1];

[0295] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 1, 1, 1];

[0296] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0];

[0297] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 0, 1];

[0298] Primitive polynomial x7 +x 1 +1, initial value [1, 1, 1, 1, 0, 1, 0];

[0299] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[0300] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0301] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[0302] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0];

[0303] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0304] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[0305] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 0, 0, 0, 1];

[0306] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 0, 1, 0, 0];

[0307] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0, 0, 1, 1];

[0308] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0309] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 0, 1];

[0310] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

[0311] Based on this method, when the terminal sends the first signal, it can determine the preamble sequence according to the m-sequence. Since the m-sequence is a pre-set primitive polynomial with the minimum number of taps and has good time-frequency two-dimensional correlation detection performance, the complexity of generating the m-sequence at the transceiver end can be reduced, and the uplink synchronization performance can be improved, thereby improving the uplink data demodulation performance.

[0312] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[0313] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[0314] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[0315] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[0316] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[0317] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0318] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0319] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[0320] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 1];

[0321] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[0322] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[0323] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 1];

[0324] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0325] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0326] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 1, 1];

[0327] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0328] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 1];

[0329] Primitive polynomial x 5 +x 3 +x 2 +x1 +1, initial value [1, 0, 0, 0, 0];

[0330] Primitive polynomial x 5 +x 3 +1, initial value [1, 1, 1, 1, 0];

[0331] Primitive polynomial x 5 +x 3 +1, initial value [1, 0, 1, 1, 0];

[0332] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0];

[0333] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1];

[0334] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0335] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0336] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[0337] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1];

[0338] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 0];

[0339] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[0340] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [1, 1, 0, 0, 0, 1];

[0341] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 1];

[0342] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 0, 0, 0, 1];

[0343] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0344] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0345] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 0, 1];

[0346] Primitive polynomial x 7 +x 5 +x 4 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[0347] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1, 1, 1];

[0348] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 1, 0];

[0349] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 0];

[0350] Primitive polynomial x7 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[0351] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 1];

[0352] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 1, 1, 1, 0, 1];

[0353] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0354] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0355] Primitive polynomial x 8 +x 6 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0356] Primitive polynomial x 8 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1, 1, 0];

[0357] Primitive polynomial x 8 +x 6 +x 4 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 0, 0, 0, 0];

[0358] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 4 +x 2 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[0359] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 1, 1, 1, 0];

[0360] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0, 0];

[0361] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0362] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[0363] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

[0364] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[0365] Eighthly, embodiments of this application provide a communication device that performs the functions of the method described in the seventh aspect. The functions can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functions of the method described in the seventh aspect, such as a receiving unit, a processing unit, etc.

[0366] The receiving unit is used to receive a first signal, which is obtained by the terminal device based on a first sequence. The first sequence includes a preamble sequence, which is a second sequence or an equivalent sequence of the second sequence. The equivalent sequence is obtained by bitwise inversion and / or reversal of the sequence.

[0367] The processing unit is used to determine the position of the preamble sequence in the first signal; obtain a data window based on the position of the preamble in the first signal; and demodulate the data signal within the data window.

[0368] Wherein, the second sequence is an m-sequence, which is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set;

[0369] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0370] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[0371] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[0372] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[0373] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[0374] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[0375] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[0376] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[0377] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0378] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[0379] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[0380] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[0381] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[0382] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[0383] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[0384] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0385] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0386] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[0387] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[0388] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0389] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[0390] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[0391] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[0392] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[0393] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 1];

[0394] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0395] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 1];

[0396] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0397] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[0398] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[0399] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0400] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1];

[0401] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 0, 1, 0];

[0402] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[0403] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[0404] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 1, 0];

[0405] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[0406] Primitive polynomial x 6 +x 1+1, initial value [1, 1, 0, 0, 1, 0];

[0407] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 0, 1];

[0408] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[0409] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 1, 1];

[0410] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0411] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 1, 0];

[0412] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[0413] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[0414] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 1, 1];

[0415] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1];

[0416] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 1, 1, 1];

[0417] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0];

[0418] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 0, 1];

[0419] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 1, 0];

[0420] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[0421] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0422] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[0423] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0];

[0424] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0425] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[0426] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 0, 0, 0, 1];

[0427] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 0, 1, 0, 0];

[0428] Primitive polynomial x 8 +x 4 +x 3 +x 2+1, initial value [1, 0, 1, 0, 0, 0, 1, 1];

[0429] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0430] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 0, 1];

[0431] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

[0432] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[0433] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[0434] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[0435] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[0436] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[0437] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0438] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[0439] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 1];

[0440] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[0441] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[0442] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 1];

[0443] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0444] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 1, 1];

[0445] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0446] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 1];

[0447] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0];

[0448] Primitive polynomial x 5 +x 3 +1, initial value [1, 1, 1, 1, 0];

[0449] Primitive polynomial x 5 +x 3 +1, initial value [1, 0, 1, 1, 0];

[0450] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0];

[0451] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1];

[0452] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0453] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[0454] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1];

[0455] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 0];

[0456] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[0457] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [1, 1, 0, 0, 0, 1];

[0458] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 1];

[0459] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 0, 0, 0, 1];

[0460] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0461] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 0, 1];

[0462] Primitive polynomial x 7 +x 5 +x 4 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[0463] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1, 1, 1];

[0464] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 1, 0];

[0465] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 0];

[0466] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[0467] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 1];

[0468] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 1, 1, 1, 0, 1];

[0469] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0470] Primitive polynomial x 8 +x 6 +x 5 +x 3+1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0471] Primitive polynomial x 8 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1, 1, 0];

[0472] Primitive polynomial x 8 +x 6 +x 4 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 0, 0, 0, 0];

[0473] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 4 +x 2 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[0474] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 1, 1, 1, 0];

[0475] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0, 0];

[0476] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0477] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[0478] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

[0479] In a ninth aspect, embodiments of this application also provide a communication device, including: a memory and a processor, the processor being configured to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device causes the device to perform the method described in the seventh aspect or any possible design of the seventh aspect.

[0480] In a tenth aspect, embodiments of this application also provide a communication device, including: a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and to execute the methods described in the seventh aspect or any possible design of the seventh aspect.

[0481] The communication devices described in aspects eight through ten above can be applied to network equipment.

[0482] Eleventhly, embodiments of this application also provide a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a network device or in a chip embedded in the network device, the network device performs the method described in the seventh aspect.

[0483] In a twelfth aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, enable the computer to perform the methods described in the seventh aspect or any possible design of the seventh aspect.

[0484] Understandably, the beneficial effects that can be achieved by aspects eight through twelfth provided above can be referenced to the beneficial effects in aspect seven and any of its possible designs, which will not be repeated here.

[0485] In a thirteenth aspect, embodiments of this application also provide a signal processing method applied to a communication system including network devices and terminal devices, wherein the terminal devices perform the method described in the first aspect and any possible design thereof; and the network devices perform the method described in the seventh aspect and any possible design thereof.

[0486] In a fourteenth aspect, embodiments of this application also provide a communication system, including: a network device and a terminal device; the terminal device performs the method as described in the first aspect and any possible design thereof; the network device performs the method as described in the seventh aspect and any possible design thereof.

[0487] Understandably, the beneficial effects that can be achieved by the thirteenth and fourteenth aspects provided above can be referred to the beneficial effects described in the first and seventh aspects, etc., and will not be repeated here.

[0488] In a fifteenth aspect, embodiments of this application provide a signal processing method, the method comprising: generating a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[0489] Wherein, the second sequence is an m-sequence, which is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set;

[0490] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0491] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[0492] Primitive polynomial x 4 +x 2 +1, initial value [1, 1, 1];

[0493] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[0494] Primitive polynomial x 4 +x 2 +1, initial value [0, 1, 0];

[0495] Primitive polynomial x 4 +x 2 +1, initial value [1, 0, 0];

[0496] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0];

[0497] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1];

[0498] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[0499] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1];

[0500] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[0501] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0502] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[0503] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[0504] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[0505] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 1];

[0506] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[0507] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[0508] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[0509] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[0510] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[0511] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 1];

[0512] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0513] Primitive polynomial x 5 +x3 +x 2 +x 1 +1, initial value [1, 0, 0, 1, 1];

[0514] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0515] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 1];

[0516] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0];

[0517] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[0518] Primitive polynomial x 5 +x 3 +1, initial value [1, 1, 1, 1, 0];

[0519] Primitive polynomial x 5 +x 3 +1, initial value [1, 0, 1, 1, 0];

[0520] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[0521] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0];

[0522] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1];

[0523] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0524] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[0525] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1];

[0526] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1];

[0527] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 0];

[0528] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[0529] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [1, 1, 0, 0, 0, 1];

[0530] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 0, 1, 0];

[0531] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 1];

[0532] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[0533] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 0, 0, 0, 1];

[0534] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0535] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 1, 0];

[0536] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 0, 1];

[0537] Primitive polynomial x 7 +x 5 +x 4 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[0538] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1, 1, 1];

[0539] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[0540] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 1, 0];

[0541] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 0];

[0542] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[0543] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 1];

[0544] Primitive polynomial x 7 +x 6 +x 5 +x4 +1, initial value [0, 1, 1, 1, 1, 0, 1];

[0545] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0546] Primitive polynomial x 8 +x 6 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0547] Primitive polynomial x 8 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1, 1, 0];

[0548] Primitive polynomial x 8 +x 6 +x 4 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 0, 0, 0, 0];

[0549] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 4 +x 2 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[0550] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 1, 1, 1, 0];

[0551] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0, 0];

[0552] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[0553] Primitive polynomial x 8+x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0554] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[0555] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

[0556] Based on this method, when the terminal sends the first signal, it can determine the preamble sequence according to the m-sequence. Since the m-sequence is a pre-set m-sequence with good time-frequency two-dimensional correlation detection performance, it can improve uplink synchronization performance, thereby improving uplink data demodulation performance.

[0557] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[0558] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1].

[0559] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0560] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0561] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[0562] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0563] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0564] Primitive polynomial x 4 +x1 +1, initial value [0, 0, 1, 0];

[0565] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1].

[0566] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0567] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0568] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[0569] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[0570] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 1];

[0571] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0572] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 1];

[0573] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0574] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[0575] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1].

[0576] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0577] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0578] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[0579] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 1, 0];

[0580] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[0581] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 1, 0];

[0582] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 0, 1];

[0583] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[0584] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 1, 1].

[0585] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0586] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0587] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[0588] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 1, 1];

[0589] Primitive polynomial x 7 +x 1+1, initial value [0, 0, 1, 1, 1, 0, 1];

[0590] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 1, 1, 1];

[0591] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0];

[0592] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 0, 1];

[0593] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 1, 0];

[0594] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 0].

[0595] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0596] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0597] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0];

[0598] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0599] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[0600] Primitive polynomial x 8 +x 4 +x 3+x 2 +1, initial value [0, 1, 1, 0, 0, 0, 0, 1];

[0601] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 0, 1, 0, 0];

[0602] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0, 0, 1, 1];

[0603] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0604] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 0, 1];

[0605] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

[0606] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0607] In a sixteenth aspect, embodiments of this application provide a communication device that performs the functions of the method described in aspect fifteen. The functions can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functions of the method described in aspect fifteen, such as a transmitting unit, a processing unit, etc.

[0608] The processing unit is configured to generate a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; and to modulate the first sequence to obtain a first signal.

[0609] The transmitting unit is used to transmit the first signal;

[0610] Wherein, the second sequence is an m-sequence, which is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set;

[0611] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0612] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[0613] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[0614] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1];

[0615] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[0616] Primitive polynomial x 4 +x 2 +1, initial value [1, 0, 0];

[0617] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[0618] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1];

[0619] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0];

[0620] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1];

[0621] Primitive polynomial x 4 +x 2 +1, initial value [0, 0, 1];

[0622] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0623] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[0624] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[0625] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[0626] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 1];

[0627] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[0628] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[0629] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[0630] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[0631] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[0632] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 1];

[0633] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0634] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 1, 1];

[0635] Primitive polynomial x 5 +x 4 +x 3 +x2 +1, initial value [0, 0, 1, 1, 0];

[0636] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 1];

[0637] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0];

[0638] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[0639] Primitive polynomial x 5 +x 3 +1, initial value [1, 1, 1, 1, 0];

[0640] Primitive polynomial x 5 +x 3 +1, initial value [1, 0, 1, 1, 0];

[0641] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[0642] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0];

[0643] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1];

[0644] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0645] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[0646] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1];

[0647] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1];

[0648] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 0];

[0649] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[0650] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [1, 1, 0, 0, 0, 1];

[0651] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 0, 1, 0];

[0652] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 1];

[0653] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[0654] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 0, 0, 0, 1];

[0655] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0656] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 1, 0];

[0657] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 0, 1];

[0658] Primitive polynomial x 7 +x 5 +x 4 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[0659] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1, 1, 1];

[0660] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[0661] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 1, 0];

[0662] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 0];

[0663] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[0664] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 1];

[0665] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 1, 1, 1, 0, 1];

[0666] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0667] Primitive polynomial x 8 +x6 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0668] Primitive polynomial x 8 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1, 1, 0];

[0669] Primitive polynomial x 8 +x 6 +x 4 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 0, 0, 0, 0];

[0670] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 4 +x 2 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[0671] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 1, 1, 1, 0];

[0672] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0, 0];

[0673] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[0674] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0675] Primitive polynomial x 8 +x 7 +x 2 +x1 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[0676] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

[0677] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[0678] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1].

[0679] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0680] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[0681] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0682] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0683] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[0684] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1].

[0685] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0686] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[0687] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[0688] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 1];

[0689] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0690] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 1];

[0691] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0692] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[0693] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1].

[0694] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0695] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[0696] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 1, 0];

[0697] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[0698] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 1, 0];

[0699] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 0, 1];

[0700] Primitive polynomial x 6 +x1 +1, initial value [0, 0, 0, 1, 0, 1];

[0701] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 1, 1].

[0702] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0703] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[0704] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 1, 1];

[0705] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1];

[0706] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 1, 1, 1];

[0707] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0];

[0708] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 0, 1];

[0709] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 1, 0];

[0710] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 0].

[0711] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0712] Primitive polynomial x 8 +x 4 +x 3 +x2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0];

[0713] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0714] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[0715] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 0, 0, 0, 1];

[0716] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 0, 1, 0, 0];

[0717] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0, 0, 1, 1];

[0718] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0719] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 0, 1];

[0720] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

[0721] In a seventeenth aspect, embodiments of this application also provide a communication device, including: a memory and a processor, the processor being configured to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device causes the device to perform the method described in the fifteenth aspect or any possible design of the fifteenth aspect.

[0722] In an eighteenth aspect, embodiments of this application also provide a communication device, including: a processor and an interface circuit, the processor being configured to communicate with other devices via the interface circuit and to perform the method described in the fifteenth aspect or any possible design of the fifteenth aspect.

[0723] The communication devices described in aspects sixteen through eighteen above can be applied to terminal equipment.

[0724] In a nineteenth aspect, embodiments of this application also provide a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a terminal device or in a chip embedded in the terminal device, the terminal device performs the method described in the fifteenth aspect.

[0725] In a twentieth aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, enable the computer to perform the methods described in the fifteenth aspect or any possible design of the fifteenth aspect.

[0726] Understandably, the beneficial effects that can be achieved by aspects sixteen through twentieth provided above can be referenced to the beneficial effects in aspect fifteen and any of its possible designs, which will not be repeated here.

[0727] In a twentieth aspect, embodiments of this application provide a signal processing method, the method comprising: receiving a first signal, the first signal being modulated by a terminal device according to a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; determining the position of the preamble sequence in the first signal; acquiring a data window according to the position of the preamble in the first signal; and demodulating the data signal within the data window;

[0728] Wherein, the second sequence is an m-sequence, which is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set;

[0729] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0730] Primitive polynomial x4 +x 1 +1, initial value [0, 1, 0];

[0731] Primitive polynomial x 4 +x 2 +1, initial value [1, 1, 1];

[0732] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[0733] Primitive polynomial x 4 +x 2 +1, initial value [0, 1, 0];

[0734] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[0735] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0];

[0736] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[0737] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[0738] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[0739] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[0740] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0741] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[0742] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[0743] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[0744] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 1];

[0745] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[0746] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[0747] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[0748] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[0749] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[0750] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 1];

[0751] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0752] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 1, 1];

[0753] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0754] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 1];

[0755] Primitive polynomial x 5 +x 3 +x 2 +x1 +1, initial value [1, 0, 0, 0, 0];

[0756] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[0757] Primitive polynomial x 5 +x 3 +1, initial value [1, 1, 1, 1, 0];

[0758] Primitive polynomial x 5 +x 3 +1, initial value [1, 0, 1, 1, 0];

[0759] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[0760] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0];

[0761] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1];

[0762] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0763] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[0764] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1];

[0765] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1];

[0766] Primitive polynomial x 6 +x 4 +x 3 +x 1+1, initial value [1, 0, 0, 1, 0, 0];

[0767] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[0768] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [1, 1, 0, 0, 0, 1];

[0769] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 0, 1, 0];

[0770] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 1];

[0771] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[0772] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 0, 0, 0, 1];

[0773] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0774] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 1, 0];

[0775] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 0, 1];

[0776] Primitive polynomial x 7 +x 5 +x 4 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[0777] Primitive polynomial x 7 +x 6 +x5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1, 1, 1];

[0778] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[0779] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 1, 0];

[0780] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 0];

[0781] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[0782] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 1];

[0783] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 1, 1, 1, 0, 1];

[0784] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0785] Primitive polynomial x 8 +x 6 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0786] Primitive polynomial x 8 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1, 1, 0];

[0787] Primitive polynomial x 8 +x 6 +x 4 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 0, 0, 0, 0];

[0788] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 4 +x 2 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[0789] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 1, 1, 1, 0];

[0790] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0, 0];

[0791] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[0792] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0793] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[0794] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

[0795] Based on this method, when the terminal sends the first signal, it can determine the preamble sequence according to the m-sequence. Since the m-sequence is a pre-set m-sequence with good time-frequency two-dimensional correlation detection performance, it can improve uplink synchronization performance, thereby improving uplink data demodulation performance.

[0796] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[0797] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1].

[0798] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0799] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0800] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[0801] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0802] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0803] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[0804] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1].

[0805] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0806] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0807] Primitive polynomial x 5 +x 2+1, initial value [1, 0, 1, 0, 0];

[0808] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[0809] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 1];

[0810] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0811] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 1];

[0812] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0813] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[0814] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1].

[0815] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0816] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0817] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[0818] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 1, 0];

[0819] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[0820] Primitive polynomial x 6+x 1 +1, initial value [1, 1, 0, 0, 1, 0];

[0821] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 0, 1];

[0822] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[0823] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 1, 1].

[0824] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0825] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0826] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[0827] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 1, 1];

[0828] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1];

[0829] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 1, 1, 1];

[0830] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0];

[0831] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 0, 1];

[0832] Primitive polynomial x 7 +x 1+1, initial value [1, 1, 1, 1, 0, 1, 0];

[0833] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 0].

[0834] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0835] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0836] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0];

[0837] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0838] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[0839] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 0, 0, 0, 1];

[0840] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 0, 1, 0, 0];

[0841] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0, 0, 1, 1];

[0842] Primitive polynomial x 8 +x 4+x 3 +x 2 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0843] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 0, 1];

[0844] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

[0845] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0846] In a twentieth aspect, embodiments of this application provide a communication device that performs the functions of the method described in aspect twenty-one. The functions can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functions of the method described in aspect twenty, such as a receiving unit, a processing unit, etc.

[0847] The receiving unit is used to receive a first signal, which is obtained by the terminal device based on a first sequence. The first sequence includes a preamble sequence, which is a second sequence or an equivalent sequence of the second sequence. The equivalent sequence is obtained by bitwise inversion and / or reversal of the sequence.

[0848] The processing unit is used to determine the position of the preamble sequence in the first signal; obtain a data window based on the position of the preamble in the first signal; and demodulate the data signal within the data window.

[0849] Wherein, the second sequence is an m-sequence, which is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set;

[0850] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0851] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0];

[0852] Primitive polynomial x 4 +x 2 +1, initial value [1, 1, 1];

[0853] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1];

[0854] Primitive polynomial x 4 +x 2 +1, initial value [0, 1, 0];

[0855] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[0856] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0];

[0857] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[0858] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0];

[0859] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[0860] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[0861] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0862] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[0863] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[0864] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[0865] Primitive polynomial x 4 +x3 +1, initial value [0, 1, 1, 1];

[0866] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[0867] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[0868] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[0869] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[0870] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[0871] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 1];

[0872] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0873] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 1, 1];

[0874] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0875] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 1];

[0876] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0];

[0877] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[0878] Primitive polynomial x 5 +x 3 +1, initial value [1, 1, 1, 1, 0];

[0879] Primitive polynomial x 5 +x 3 +1, initial value [1, 0, 1, 1, 0];

[0880] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[0881] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0];

[0882] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1];

[0883] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0884] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[0885] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1];

[0886] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1];

[0887] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 0];

[0888] Primitive polynomial x6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[0889] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [1, 1, 0, 0, 0, 1];

[0890] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 0, 1, 0];

[0891] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 1];

[0892] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[0893] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 0, 0, 0, 1];

[0894] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0895] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 1, 0];

[0896] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 0, 1];

[0897] Primitive polynomial x 7 +x 5 +x 4 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[0898] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 3 +x 2+1, initial value [1, 1, 1, 0, 1, 1, 1];

[0899] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[0900] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 1, 0];

[0901] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 0];

[0902] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[0903] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 1];

[0904] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 1, 1, 1, 0, 1];

[0905] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0906] Primitive polynomial x 8 +x 6 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0907] Primitive polynomial x 8 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1, 1, 0];

[0908] Primitive polynomial x 8 +x 6 +x4 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 0, 0, 0, 0];

[0909] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 4 +x 2 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[0910] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 1, 1, 1, 0];

[0911] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0, 0];

[0912] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[0913] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0914] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[0915] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

[0916] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[0917] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1].

[0918] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0919] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[0920] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0921] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0922] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[0923] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1].

[0924] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0925] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[0926] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[0927] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 1];

[0928] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0929] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 1];

[0930] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0931] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[0932] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1].

[0933] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0934] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[0935] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 1, 0];

[0936] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[0937] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 1, 0];

[0938] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 0, 1];

[0939] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[0940] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 1, 1].

[0941] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0942] Primitive polynomial x 7 +x 1+1, initial value [1, 1, 1, 1, 0, 0, 0];

[0943] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 1, 1];

[0944] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1];

[0945] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 1, 1, 1];

[0946] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0];

[0947] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 0, 1];

[0948] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 1, 0];

[0949] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 0].

[0950] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0951] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0];

[0952] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0953] Primitive polynomial x 8 +x 4 +x 3 +x 2+1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[0954] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 0, 0, 0, 1];

[0955] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 0, 1, 0, 0];

[0956] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0, 0, 1, 1];

[0957] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0958] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 0, 1];

[0959] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

[0960] In a twentieth aspect, embodiments of this application also provide a communication device, comprising: a memory and a processor, the processor being configured to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device causes the device to perform the method described in the twentieth aspect or any possible design of the twentieth aspect.

[0961] In a twentieth aspect, embodiments of this application also provide a communication device, comprising: a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and to execute the method described in the twentieth aspect or any possible design of the twentieth aspect.

[0962] The communication apparatus described in aspects 22 to 24 above can be applied to network equipment.

[0963] In a twentieth aspect, embodiments of this application also provide a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a network device or in a chip embedded in the network device, they cause the network device to perform the method described in the twentieth aspect.

[0964] In a twentieth aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, enable the computer to perform the methods described in the twentieth aspect above or any possible design of the twentieth aspect above.

[0965] Understandably, the beneficial effects that can be achieved by aspects 22 to 26 provided above can be referenced to the beneficial effects in aspect 21 and any of its possible designs, which will not be repeated here.

[0966] In a twentieth aspect, embodiments of this application also provide a signal processing method applied to a communication system including network devices and terminal devices, wherein the terminal devices perform the method described in the fifteenth aspect and any possible design thereof; and the network devices perform the method described in the twenty-first aspect and any possible design thereof.

[0967] In a twentieth aspect, embodiments of this application also provide a communication system, including: a network device and a terminal device; the terminal device performs the method as described in the fifteenth aspect and any possible design thereof; the network device performs the method as described in the twenty-first aspect and any possible design thereof.

[0968] Understandably, the beneficial effects that can be achieved by the above-mentioned aspects 27 and 28 can be referred to the beneficial effects described in aspects 15, 21, etc., and will not be repeated here.

[0969] In a twentieth aspect, embodiments of this application provide a signal processing method, the method comprising: generating a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[0970] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[0971] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0972] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[0973] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[0974] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[0975] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[0976] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[0977] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[0978] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[0979] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0980] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[0981] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0982] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[0983] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0984] Primitive polynomial x 4 +x1 +1, initial value [0, 1, 0, 0];

[0985] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[0986] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[0987] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[0988] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[0989] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[0990] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0991] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[0992] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[0993] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[0994] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[0995] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[0996] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[0997] Primitive polynomial x 5 +x 2+1, initial value [1, 0, 1, 1, 0];

[0998] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0999] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1000] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[1001] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1002] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1003] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1004] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1005] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1006] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1007] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1008] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1009] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1010] Primitive polynomial x6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1011] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0];

[1012] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1013] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1014] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1015] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1016] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1];

[1017] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1018] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1019] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1020] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1021] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1022] Primitive polynomial x 7 +x 1+1, initial value [1, 1, 0, 1, 1, 1, 0];

[1023] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1024] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1025] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0, 1];

[1026] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1027] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1028] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1029] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1030] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1031] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1032] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1033] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1034] Based on this method, when the terminal sends the first signal, it can determine the preamble sequence according to the m-sequence. Since the m-sequence is a pre-set primitive polynomial with the minimum number of taps and has good time-frequency two-dimensional correlation detection performance, the complexity of generating the m-sequence at the transceiver end can be reduced, and the uplink synchronization performance can be improved, thereby improving the uplink data demodulation performance.

[1035] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the beginning of the m-sequence with 0s.

[1036] Based on this possible design, by padding the first digit of the m-sequence with 0, the number of elements in the final preamble sequence can be made even, thus satisfying the rate matching requirement of the preamble sequence length.

[1037] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[1038] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1039] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1040] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1041] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1042] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1043] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1044] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1045] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1046] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1047] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1048] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1049] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1050] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1051] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1052] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1053] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1054] Primitive polynomial x 5 +x4 +x 3 +x 12 +1, initial value [0, 0, 0, 1, 1];

[1055] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1056] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1057] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1058] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1059] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1060] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1].

[1061] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1062] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1063] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[1064] Primitive polynomial x 6 +x5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1065] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1066] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1067] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1068] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1069] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1070] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1071] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1072] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[1073] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1074] Primitive polynomial x7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1075] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1076] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1077] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1078] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1079] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1080] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0].

[1081] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1082] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1083] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1084] Primitive polynomial x8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1, 1];

[1085] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1, 0];

[1086] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1087] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1, 1];

[1088] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1089] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1090] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1091] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1, 1];

[1092] Primitive polynomial x8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1093] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1094] In a thirtieth aspect, embodiments of this application provide a communication device that has the function of implementing the method of aspect twenty-nine described above. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the function of the method described in aspect twenty-nine, such as a transmitting unit, a processing unit, etc.

[1095] The processing unit is configured to generate a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; and to modulate the first sequence to obtain a first signal.

[1096] The transmitting unit is used to transmit the first signal;

[1097] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[1098] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1099] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1100] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1101] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1102] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1103] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1104] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1105] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[1106] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1107] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1108] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1109] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1110] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1111] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1112] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1113] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1114] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1115] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1116] Primitive polynomial x 4+x 1 +1, initial value [0, 1, 0, 1];

[1117] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1118] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1119] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1120] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1121] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1122] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1123] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1124] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1125] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1126] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1127] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[1128] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1129] Primitive polynomial x 6 +x1 +1, initial value [0, 1, 1, 0, 0, 0];

[1130] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1131] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1132] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1133] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1134] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1135] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1136] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1137] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1138] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0];

[1139] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1140] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1141] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1142] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1143] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1];

[1144] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1145] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1146] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1147] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1148] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1149] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0];

[1150] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1151] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1152] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0, 1];

[1153] Primitive polynomial x 8 +x 4 +x3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1154] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1155] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1156] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1157] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1158] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1159] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1160] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1161] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the beginning of the m-sequence with 0s.

[1162] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[1163] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1164] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1165] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1166] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1167] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1168] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1169] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1170] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1171] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1172] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1173] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1174] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1175] Primitive polynomial x 5 +x 4 +x3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1176] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1177] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1178] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1179] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1180] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1181] Primitive polynomial x 5 +x 4 +x 3 +x 12 +1, initial value [1, 0, 0, 1, 0];

[1182] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1183] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1].

[1184] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1185] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[1186] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1187] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1188] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1189] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1190] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1191] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1192] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1193] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[1194] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1195] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1196] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1197] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1198] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1199] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1200] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1201] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0].

[1202] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1203] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1204] Primitive polynomial x 8 +x 7 +x 6 +x3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1, 1];

[1205] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1, 0];

[1206] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1207] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1, 1];

[1208] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1209] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1210] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1211] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1, 1];

[1212] Primitive polynomial x 8 +x 6 +x 5 +x4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1213] In a thirty-first aspect, embodiments of this application also provide a communication device, including: a memory and a processor, the processor being configured to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device causes the device to perform the method described in the twenty-ninth aspect or any possible design of the twenty-ninth aspect.

[1214] In a thirty-second aspect, embodiments of this application also provide a communication device, including: a processor and an interface circuit, the processor being configured to communicate with other devices via the interface circuit and to execute the method described in aspect twenty-nine or any possible design of aspect twenty-nine.

[1215] The communication apparatus described in aspects 30 to 32 above can be applied to terminal equipment.

[1216] In a thirty-third aspect, embodiments of this application also provide a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a terminal device or in a chip embedded in the terminal device, the terminal device performs the method described in the twenty-ninth aspect.

[1217] In a thirty-fourth aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, enable the computer to perform the methods described in the twenty-ninth aspect or any possible design of the twenty-ninth aspect.

[1218] Understandably, the beneficial effects that can be achieved by aspects 30 to 34 provided above can be referenced to the beneficial effects in aspect 29 and any of its possible designs, which will not be repeated here.

[1219] In a thirty-fifth aspect, embodiments of this application provide a signal processing method, the method comprising: receiving a first signal, the first signal being modulated by a terminal device according to a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; determining the position of the preamble sequence in the first signal; acquiring a data window according to the position of the preamble in the first signal; and demodulating the data signal within the data window;

[1220] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[1221] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1222] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1223] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1224] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1225] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1226] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1227] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1228] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[1229] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1230] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1231] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1232] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1233] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1234] Primitive polynomial x 4 +x1 +1, initial value [0, 1, 0, 0];

[1235] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1236] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1237] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1238] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1239] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[1240] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1241] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1242] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1243] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1244] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1245] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1246] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1247] Primitive polynomial x 5 +x 2+1, initial value [1, 0, 1, 1, 0];

[1248] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1249] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1250] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[1251] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1252] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1253] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1254] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1255] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1256] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1257] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1258] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1259] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1260] Primitive polynomial x6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1261] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0];

[1262] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1263] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1264] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1265] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1266] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1];

[1267] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1268] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1269] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1270] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1271] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1272] Primitive polynomial x 7 +x 1+1, initial value [1, 1, 0, 1, 1, 1, 0];

[1273] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1274] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1275] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0, 1];

[1276] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1277] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1278] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1279] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1280] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1281] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1282] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1283] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1284] Based on this method, when the terminal sends the first signal, it can determine the preamble sequence according to the m-sequence. Since the m-sequence is a pre-set primitive polynomial with the minimum number of taps and has good time-frequency two-dimensional correlation detection performance, the complexity of generating the m-sequence at the transceiver end can be reduced, and the uplink synchronization performance can be improved, thereby improving the uplink data demodulation performance.

[1285] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the beginning of the m-sequence with 0s.

[1286] Based on this possible design, by padding the first digit of the m-sequence with 0, the number of elements in the final preamble sequence can be made even, thus satisfying the rate matching requirement of the preamble sequence length.

[1287] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[1288] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1289] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1290] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1291] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1292] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1293] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1294] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1295] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1296] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1297] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1298] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1299] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1300] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1301] Primitive polynomial x 5 +x 3 +x 2 +x 12 +1, initial value [1, 1, 0, 1, 0];

[1302] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1303] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1304] Primitive polynomial x 5 +x4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1305] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1306] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1307] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1308] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1309] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1310] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1311] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1312] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1313] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[1314] Primitive polynomial x 6 +x5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1315] Primitive polynomial x 6 +x 5 +x 4 +x 12 +1, initial value [0, 1, 1, 0, 1, 0];

[1316] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1317] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1318] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1319] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1320] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1321] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1322] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[1323] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1324] Primitive polynomial x7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1325] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1326] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1327] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1328] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1329] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1330] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1331] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1332] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1333] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1334] Primitive polynomial x8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1, 1];

[1335] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1, 0];

[1336] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1337] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1, 1];

[1338] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1339] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1340] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1341] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1, 1];

[1342] Primitive polynomial x8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1343] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[1344] In a thirty-sixth aspect, embodiments of this application provide a communication device that performs the functions of the method described in aspect thirty-five. The functions can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functions of the method described in aspect thirty-five, such as a receiving unit, a processing unit, etc.

[1345] The receiving unit is used to receive a first signal, which is obtained by the terminal device based on a first sequence. The first sequence includes a preamble sequence, which is a second sequence or an equivalent sequence of the second sequence. The equivalent sequence is obtained by bitwise inversion and / or reversal of the sequence.

[1346] The processing unit is used to determine the position of the preamble sequence in the first signal; obtain a data window based on the position of the preamble in the first signal; and demodulate the data signal within the data window.

[1347] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[1348] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1349] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1350] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1351] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1352] Primitive polynomial x 3 +x1 +1, initial value [0, 1, 0];

[1353] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1354] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1355] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[1356] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1357] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1358] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1359] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1360] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1361] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1362] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1363] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1364] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1365] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1366] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[1367] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1368] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1369] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1370] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1371] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1372] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1373] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1374] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1375] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1376] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1377] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[1378] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1379] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1380] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1381] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1382] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1383] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1384] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1385] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1386] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1387] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1388] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0];

[1389] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1390] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1391] Primitive polynomial x 7 +x 1+1, initial value [0, 1, 1, 0, 0, 1, 1];

[1392] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1393] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1];

[1394] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1395] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1396] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1397] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1398] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1399] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0];

[1400] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1401] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1402] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0, 1];

[1403] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1404] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1405] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1406] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1407] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1408] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1409] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1410] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1411] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the beginning of the m-sequence with 0s.

[1412] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[1413] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1414] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1415] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1416] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1417] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1418] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1419] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1420] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1421] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1422] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1423] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1424] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1425] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1426] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1427] Primitive polynomial x 5 +x 4 +x 3 +x 12 +1, initial value [0, 0, 0, 1, 1];

[1428] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1429] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1430] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1431] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1432] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1433] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1434] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1435] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[1436] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1437] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1438] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1439] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1440] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1441] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1442] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1443] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[1444] Primitive polynomial x 7 +x 6 +x 5 +x3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1445] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1446] Primitive polynomial x 7 +x 5 +x 3 +x 12 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1447] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1448] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1449] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1450] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1451] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1452] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1453] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1454] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1, 1];

[1455] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1, 0];

[1456] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1457] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1, 1];

[1458] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1459] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1460] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1461] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1, 1];

[1462] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1463] In a thirty-seventh aspect, embodiments of this application also provide a communication device, including: a memory and a processor, the processor being configured to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device causes the device to perform the method described in aspect thirty-five or any possible design of aspect thirty-five.

[1464] In a thirty-eighth aspect, embodiments of this application also provide a communication device, including: a processor and an interface circuit, the processor being configured to communicate with other devices via the interface circuit and to execute the method described in aspect thirty-five or any possible design of aspect thirty-five.

[1465] The communication apparatus described in aspects 36 to 38 above can be applied to network equipment.

[1466] In a thirty-ninth aspect, embodiments of this application also provide a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a network device or in a chip embedded in the network device, they cause the network device to perform the method described in the thirty-fifth aspect.

[1467] In a fortieth aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, enable the computer to perform the methods described in the thirty-fifth aspect or any possible design of the thirty-fifth aspect.

[1468] Understandably, the beneficial effects that can be achieved by aspects 36 to 40 provided above can be referenced to the beneficial effects of aspect 35 and any of its possible designs, which will not be repeated here.

[1469] In the forty-first aspect, embodiments of this application also provide a signal processing method applied to a communication system including network devices and terminal devices, wherein the terminal devices perform the method described in the twenty-ninth aspect and any possible design thereof; and the network devices perform the method described in the thirty-fifth aspect and any possible design thereof.

[1470] In a forty-second aspect, embodiments of this application also provide a communication system, including: a network device and a terminal device; the terminal device performs the method as described in the twenty-ninth aspect and any possible design thereof; the network device performs the method as described in the thirty-fifth aspect and any possible design thereof.

[1471] Understandably, the beneficial effects that can be achieved by aspects 41 and 42 provided above can be referred to the beneficial effects described in aspects 29 and 35, etc., and will not be repeated here.

[1472] In a forty-third aspect, embodiments of this application provide a signal processing method, the method comprising: generating a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[1473] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[1474] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1475] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1476] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1477] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1478] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1479] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1480] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1481] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1482] Primitive polynomial x 3 +x1 +1, initial value [1, 0, 0];

[1483] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1484] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1485] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1486] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1487] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1488] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1489] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1490] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1491] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1492] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1493] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1494] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1495] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1496] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1497] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1498] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1499] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1500] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1501] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1502] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1503] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1504] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1505] Primitive polynomial x 5 +x 4 +x3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1506] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1507] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1508] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[1509] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1510] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1511] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1512] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1513] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1514] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1515] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1516] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1517] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1518] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1519] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[1520] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1521] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1522] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1523] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1524] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1525] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1526] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1527] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1528] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1529] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1530] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1531] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1, 1];

[1532] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1, 0];

[1533] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1534] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1, 1];

[1535] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1536] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1537] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1538] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1, 1];

[1539] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1540] Based on this method, when the terminal sends the first signal, it can determine the preamble sequence according to the m-sequence. Since the m-sequence is a pre-set m-sequence with good time-frequency two-dimensional correlation detection performance, it can improve uplink synchronization performance, thereby improving uplink data demodulation performance.

[1541] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the beginning of the m-sequence with 0s.

[1542] Based on this possible design, by padding the first digit of the m-sequence with 0, the number of elements in the final preamble sequence can be made even, thus satisfying the rate matching requirement of the preamble sequence length.

[1543] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[1544] Primitive polynomial x 3 +x 1+1, initial value [1, 1, 0].

[1545] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1546] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1547] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1548] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1549] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1550] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1551] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1].

[1552] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1553] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1554] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1555] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1556] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1557] Primitive polynomial x 5 +x 2+1, initial value [0, 0, 0, 1, 0];

[1558] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1559] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1560] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1561] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1562] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1563] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0].

[1564] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1565] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1566] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1567] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1568] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1569] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1570] Primitive polynomial x6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1571] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1572] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0].

[1573] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1574] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1575] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1576] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1577] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1];

[1578] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1579] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1580] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1581] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1582] Primitive polynomial x 7 +x 1+1, initial value [0, 1, 0, 0, 0, 1, 1];

[1583] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0].

[1584] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1585] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1586] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1587] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0, 1];

[1588] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1589] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1590] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1591] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1592] Primitive polynomial x 8 +x 4+x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1593] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1594] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1595] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1596] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1597] In a forty-fourth aspect, embodiments of this application provide a communication device that performs the functions of the method described in aspect forty-three. The functions can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functions of the method described in aspect forty-three, such as a transmitting unit, a processing unit, etc.

[1598] The processing unit is configured to generate a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; and to modulate the first sequence to obtain a first signal.

[1599] The transmitting unit is used to transmit the first signal;

[1600] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[1601] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1602] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1603] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1604] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1605] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1606] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1607] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1608] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1609] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1610] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1611] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1612] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1613] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1614] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1615] Primitive polynomial x 4 +x3 +1, initial value [1, 0, 1, 0];

[1616] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1617] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1618] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1619] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1620] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1621] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1622] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1623] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1624] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1625] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1626] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1627] Primitive polynomial x 5 +x4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1628] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1629] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1630] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1631] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1632] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1633] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1634] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1635] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[1636] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1637] Primitive polynomial x6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1638] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1639] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1640] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1641] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1642] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1643] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1644] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1645] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1646] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[1647] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1+1, initial value [1, 1, 0, 1, 1, 0, 1];

[1648] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1649] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1650] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1651] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1652] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1653] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1654] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1655] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1656] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1657] Primitive polynomial x 8 +x 5 +x 3 +x 1+1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1658] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1, 1];

[1659] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1, 0];

[1660] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1661] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1, 1];

[1662] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1663] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1664] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1665] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1+1, initial value [0, 0, 0, 1, 1, 1, 1, 1];

[1666] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1667] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the beginning of the m-sequence with 0s.

[1668] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[1669] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0].

[1670] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1671] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1672] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1673] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1674] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1675] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1].

[1676] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1677] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1678] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1679] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1680] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1681] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1682] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1683] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1684] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1685] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1686] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0].

[1687] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1688] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1689] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1690] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1691] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1692] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1693] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1694] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0].

[1695] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1696] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1697] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1698] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1];

[1699] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1700] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1701] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1702] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1703] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1704] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0].

[1705] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1706] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1707] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0, 1];

[1708] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1709] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1710] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1711] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1712] Primitive polynomial x 8 +x 4 +x 3 +x 2+1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1713] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1714] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1715] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1716] In a forty-fifth aspect, embodiments of this application also provide a communication device, including: a memory and a processor, the processor being configured to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device causes the device to perform the method described in aspect forty-third or any possible design of aspect forty-third.

[1717] In a forty-sixth aspect, embodiments of this application also provide a communication device, including: a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and to execute the method described in aspect forty-three or any possible design of aspect forty-three.

[1718] The communication apparatus described in aspects 44 to 46 above can be applied to terminal equipment.

[1719] In a forty-seventh aspect, embodiments of this application also provide a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a terminal device or in a chip embedded in the terminal device, the terminal device performs the method described in the forty-third aspect.

[1720] In a forty-eighth aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, enable the computer to perform the methods described in the forty-third aspect or any possible design of the forty-third aspect.

[1721] Understandably, the beneficial effects that can be achieved by aspects 44 to 48 provided above can be referenced to the beneficial effects of aspect 43 and any of its possible designs, which will not be repeated here.

[1722] In a forty-ninth aspect, embodiments of this application provide a signal processing method, the method comprising: receiving a first signal, the first signal being modulated by a terminal device according to a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; determining the position of the preamble sequence in the first signal; acquiring a data window according to the position of the preamble in the first signal; and demodulating the data signal within the data window;

[1723] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[1724] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1725] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1726] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1727] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1728] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1729] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1730] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1731] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1732] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1733] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1734] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1735] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1736] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1737] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1738] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1739] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1740] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1741] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1742] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1743] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1744] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1745] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1746] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1747] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1748] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1749] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1750] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1751] Primitive polynomial x 5 +x 3 +x 2 +x 12 +1, initial value [1, 0, 1, 0, 1];

[1752] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1753] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1754] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1755] Primitive polynomial x 5 +x 4 +x 3 +x 2+1, initial value [1, 1, 0, 1, 1];

[1756] Primitive polynomial x 5 +x 3 +x 2 +x 12 +1, initial value [0, 1, 0, 1, 1];

[1757] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1758] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[1759] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1760] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1761] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1762] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1763] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1764] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1765] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1766] Primitive polynomial x 6 +x1 +1, initial value [1, 0, 1, 0, 1, 0];

[1767] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1768] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1769] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[1770] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1771] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1772] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1773] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1774] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1775] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1776] Primitive polynomial x7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1777] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1778] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1779] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1780] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1781] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1, 1];

[1782] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1, 0];

[1783] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1784] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1, 1];

[1785] Primitive polynomial x 8 +x 7 +x2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1786] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1787] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1788] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1, 1];

[1789] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1790] Based on this method, when the terminal sends the first signal, it can determine the preamble sequence according to the m-sequence. Since the m-sequence is a pre-set m-sequence with good time-frequency two-dimensional correlation detection performance, it can improve uplink synchronization performance, thereby improving uplink data demodulation performance.

[1791] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the beginning of the m-sequence with 0s.

[1792] Based on this possible design, by padding the first digit of the m-sequence with 0, the number of elements in the final preamble sequence can be made even, thus satisfying the rate matching requirement of the preamble sequence length.

[1793] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[1794] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0].

[1795] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1796] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1797] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1798] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1799] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1800] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1801] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1].

[1802] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1803] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1804] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1805] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1806] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1807] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1808] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1809] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1810] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1811] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1812] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1813] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0].

[1814] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1815] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1816] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1817] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1818] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1819] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1820] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1821] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1822] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0].

[1823] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1824] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1825] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1826] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1827] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1];

[1828] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1829] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1830] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1831] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1832] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1833] Primitive polynomial x7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0].

[1834] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1835] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1836] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1837] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0, 1];

[1838] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1839] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1840] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1841] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1842] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1843] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1844] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1845] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1846] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1847] In a fiftieth aspect, embodiments of this application provide a communication device that performs the functions of the method described in aspect forty-nine above. The functions can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functions of the method described in aspect forty-nine above, such as a receiving unit, a processing unit, etc.

[1848] The receiving unit is used to receive a first signal, which is obtained by the terminal device based on a first sequence. The first sequence includes a preamble sequence, which is a second sequence or an equivalent sequence of the second sequence. The equivalent sequence is obtained by bitwise inversion and / or reversal of the sequence.

[1849] The processing unit is used to determine the position of the preamble sequence in the first signal; obtain a data window based on the position of the preamble in the first signal; and demodulate the data signal within the data window.

[1850] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[1851] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1852] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1853] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1854] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1855] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1856] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1857] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1858] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1859] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1860] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1861] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1862] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1863] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1864] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1865] Primitive polynomial x 4 +x3 +1, initial value [1, 0, 1, 0];

[1866] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1867] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1868] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1869] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1870] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1871] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1872] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1873] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1874] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1875] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1876] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1877] Primitive polynomial x 5 +x4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1878] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1879] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1880] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1881] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1882] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1883] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1884] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1885] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[1886] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1887] Primitive polynomial x6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1888] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1889] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1890] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1891] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1892] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1893] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1894] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1895] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1896] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[1897] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1+1, initial value [1, 1, 0, 1, 1, 0, 1];

[1898] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1899] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1900] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1901] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1902] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1903] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1904] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1905] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1906] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1907] Primitive polynomial x 8 +x 5 +x 3 +x 1+1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1908] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1, 1];

[1909] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1, 0];

[1910] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1911] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1, 1];

[1912] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1913] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1914] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1915] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1+1, initial value [0, 0, 0, 1, 1, 1, 1, 1];

[1916] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1917] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the beginning of the m-sequence with 0s.

[1918] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[1919] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0].

[1920] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1921] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1922] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1923] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1924] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1925] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1].

[1926] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1927] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1928] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1929] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1930] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1931] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1932] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1933] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1934] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1935] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1936] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0].

[1937] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1938] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1939] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1940] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1941] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1942] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1943] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1944] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0].

[1945] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1946] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1947] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1948] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1];

[1949] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1950] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1951] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1952] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1953] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1954] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0].

[1955] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1956] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1957] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0, 1];

[1958] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1959] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1960] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1961] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1962] Primitive polynomial x 8 +x 4 +x 3 +x 2+1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1963] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1964] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1965] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1966] In a 51st aspect, embodiments of this application also provide a communication device, including: a memory and a processor, the processor being configured to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device causes the device to perform the method described in aspect 49 or any possible design of aspect 49.

[1967] In a 52nd aspect, embodiments of this application also provide a communication device, including: a processor and an interface circuit, the processor being configured to communicate with other devices via the interface circuit and to execute the method described in aspect 49 or any possible design of aspect 49.

[1968] The communication apparatus described in aspects 50 to 52 above can be applied to network equipment.

[1969] In a 53rd aspect, embodiments of this application also provide a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a network device or in a chip embedded in the network device, they cause the network device to perform the method described in the 49th aspect.

[1970] In a 54th aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, enable the computer to perform the methods described in the 49th aspect or any possible design of the 49th aspect.

[1971] Understandably, the beneficial effects that can be achieved by aspects 50 to 54 provided above can be referenced to the beneficial effects in aspect 49 and any of its possible designs, which will not be repeated here.

[1972] In a 55th aspect, embodiments of this application also provide a signal processing method applied to a communication system including a network device and a terminal device, wherein the terminal device performs the method described in the 43rd aspect and any possible design thereof; and the network device performs the method described in the 49th aspect and any possible design thereof.

[1973] In a 56th aspect, embodiments of this application also provide a communication system, including: a network device and a terminal device; the terminal device performs the method as described in aspect 43 and any possible design thereof; the network device performs the method as described in aspect 49 and any possible design thereof.

[1974] Understandably, the beneficial effects that can be achieved by aspects 55 and 56 provided above can be referred to the beneficial effects described in aspects 43 and 49, etc., and will not be repeated here.

[1975] In a 57th aspect, embodiments of this application provide a signal processing method, the method comprising: generating a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[1976] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[1977] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1978] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1979] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[1980] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1981] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1982] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1983] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1984] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1985] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1986] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[1987] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1988] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1989] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1990] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1991] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1992] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[1993] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[1994] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[1995] Primitive polynomial x 4+x 1 +1, initial value [1, 1, 0, 1];

[1996] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1997] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[1998] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0];

[1999] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0];

[2000] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[2001] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1];

[2002] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[2003] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0];

[2004] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[2005] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[2006] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[2007] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2008] Primitive polynomial x 6 +x1 +1, initial value [1, 1, 0, 1, 1, 0];

[2009] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 0, 1];

[2010] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[2011] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[2012] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0];

[2013] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[2014] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[2015] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[2016] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1];

[2017] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0, 0];

[2018] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2019] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1];

[2020] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[2021] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0, 0];

[2022] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0];

[2023] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[2024] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1];

[2025] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2026] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 1, 0, 0];

[2027] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0];

[2028] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0];

[2029] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2030] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[2031] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1];

[2032] Primitive polynomial x 8 +x 4 +x3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2033] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0];

[2034] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 1, 0];

[2035] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[2036] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1];

[2037] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 1, 0, 0];

[2038] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0];

[2039] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

[2040] Based on this method, when the terminal sends the first signal, it can determine the preamble sequence according to the m-sequence. Since the m-sequence is a pre-set primitive polynomial with the minimum number of taps and has good time-frequency two-dimensional correlation detection performance, the complexity of generating the m-sequence at the transceiver end can be reduced, and the uplink synchronization performance can be improved, thereby improving the uplink data demodulation performance.

[2041] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the first part of the m-sequence with 1.

[2042] Based on this possible design, by padding the first element of the m-sequence with 1, the number of elements in the final preamble sequence can be made even, thus satisfying the rate matching requirement of the preamble sequence length.

[2043] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[2044] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0];

[2045] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[2046] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[2047] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[2048] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1];

[2049] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1].

[2050] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2051] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2052] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[2053] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[2054] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0];

[2055] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[2056] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2057] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2058] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0];

[2059] Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1];

[2060] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1];

[2061] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1];

[2062] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0];

[2063] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0];

[2064] Primitive polynomial x 5 +x 3 +x2 +x 1 +1, initial value [1, 1, 0, 0, 0];

[2065] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1];

[2066] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1].

[2067] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2068] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2069] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0];

[2070] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1];

[2071] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0];

[2072] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[2073] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 1];

[2074] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[2075] Primitive polynomial x 6 +x 5 +x 2 +x 1+1, initial value [0, 1, 0, 1, 0, 0].

[2076] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2077] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2078] Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1];

[2079] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2080] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0];

[2081] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[2082] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1];

[2083] Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1];

[2084] Primitive polynomial x 7 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0];

[2085] Primitive polynomial x 7 +x 4 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[2086] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1];

[2087] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0].

[2088] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2089] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2090] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 1, 0, 1, 1];

[2091] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[2092] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0];

[2093] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x2 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[2094] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0];

[2095] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2096] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2097] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2098] Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 0, 1].

[2099] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2100] In a 58th aspect, embodiments of this application provide a communication device that performs the functions of the method described in aspect 57. The functions can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functions of the method described in aspect 57, such as a transmitting unit, a processing unit, etc.

[2101] The processing unit is configured to generate a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; and to modulate the first sequence to obtain a first signal.

[2102] The transmitting unit is used to transmit the first signal;

[2103] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[2104] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2105] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[2106] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[2107] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[2108] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[2109] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[2110] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[2111] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[2112] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2113] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[2114] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[2115] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[2116] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[2117] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[2118] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[2119] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[2120] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[2121] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[2122] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[2123] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2124] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[2125] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0];

[2126] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0];

[2127] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[2128] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1];

[2129] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[2130] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0];

[2131] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[2132] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[2133] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[2134] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2135] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[2136] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 0, 1];

[2137] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[2138] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[2139] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0];

[2140] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[2141] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[2142] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[2143] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1];

[2144] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0, 0];

[2145] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2146] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1];

[2147] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[2148] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0, 0];

[2149] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0];

[2150] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[2151] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1];

[2152] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2153] Primitive polynomial x 7 +x1 +1, initial value [1, 1, 1, 1, 1, 0, 0];

[2154] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0];

[2155] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0];

[2156] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2157] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[2158] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1];

[2159] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2160] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0];

[2161] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 1, 0];

[2162] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[2163] Primitive polynomial x 8 +x4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1];

[2164] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 1, 0, 0];

[2165] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0];

[2166] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

[2167] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the first part of the m-sequence with 1.

[2168] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[2169] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0];

[2170] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[2171] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[2172] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[2173] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1];

[2174] Primitive polynomial x 3 +x 2+1, initial value [1, 0, 1].

[2175] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2176] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[2177] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[2178] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0];

[2179] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[2180] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2181] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0];

[2182] Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1];

[2183] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1];

[2184] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1];

[2185] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0];

[2186] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0];

[2187] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0];

[2188] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1];

[2189] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1].

[2190] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2191] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0];

[2192] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1];

[2193] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0];

[2194] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[2195] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 1];

[2196] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[2197] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0, 0].

[2198] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2199] Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1];

[2200] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2201] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0];

[2202] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[2203] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1];

[2204] Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1];

[2205] Primitive polynomial x 7 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0];

[2206] Primitive polynomial x 7 +x 4 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[2207] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1];

[2208] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0].

[2209] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2210] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 1, 0, 1, 1];

[2211] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[2212] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0];

[2213] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[2214] Primitive polynomial x 8 +x 7 +x6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0];

[2215] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2216] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2217] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2218] Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 0, 1].

[2219] In a 59th aspect, embodiments of this application also provide a communication device, including: a memory and a processor, the processor being configured to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device causes the device to perform the method described in aspect 57 or any possible design of aspect 57.

[2220] In a sixtieth aspect, embodiments of this application also provide a communication device, including: a processor and an interface circuit, the processor being configured to communicate with other devices via the interface circuit and to perform the method described in aspect 57 or any possible design of aspect 57.

[2221] The communication apparatus described in aspects 58 to 60 above can be applied to terminal equipment.

[2222] In a sixty-first aspect, embodiments of this application also provide a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a terminal device or in a chip embedded in the terminal device, the terminal device performs the method described in aspect fifty-seven.

[2223] In a sixty-second aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, enable the computer to perform the methods described in aspect fifty-seven or any possible design of aspect fifty-seven.

[2224] Understandably, the beneficial effects that can be achieved by aspects 58 to 62 provided above can be referenced to the beneficial effects of aspect 57 and any of its possible designs, which will not be repeated here.

[2225] In a sixty-third aspect, embodiments of this application provide a signal processing method, the method comprising: receiving a first signal, the first signal being modulated by a terminal device according to a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; determining the position of the preamble sequence in the first signal; acquiring a data window according to the position of the preamble in the first signal; and demodulating the data signal within the data window;

[2226] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[2227] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2228] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[2229] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[2230] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[2231] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[2232] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[2233] Primitive polynomial x 3 +x1 +1, initial value [1, 1, 1];

[2234] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[2235] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2236] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[2237] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[2238] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[2239] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[2240] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[2241] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[2242] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[2243] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[2244] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[2245] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[2246] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2247] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[2248] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0];

[2249] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0];

[2250] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[2251] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1];

[2252] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[2253] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0];

[2254] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[2255] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[2256] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[2257] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2258] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[2259] Primitive polynomial x 6 +x 1+1, initial value [0, 1, 0, 1, 0, 1];

[2260] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[2261] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[2262] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0];

[2263] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[2264] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[2265] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[2266] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1];

[2267] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0, 0];

[2268] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2269] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1];

[2270] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[2271] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0, 0];

[2272] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0];

[2273] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[2274] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1];

[2275] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2276] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 1, 0, 0];

[2277] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0];

[2278] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0];

[2279] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2280] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[2281] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1];

[2282] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2283] Primitive polynomial x 8+x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0];

[2284] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 1, 0];

[2285] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[2286] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1];

[2287] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 1, 0, 0];

[2288] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0];

[2289] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

[2290] Based on this method, when the terminal sends the first signal, it can determine the preamble sequence according to the m-sequence. Since the m-sequence is a pre-set primitive polynomial with the minimum number of taps and has good time-frequency two-dimensional correlation detection performance, the complexity of generating the m-sequence at the transceiver end can be reduced, and the uplink synchronization performance can be improved, thereby improving the uplink data demodulation performance.

[2291] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the first part of the m-sequence with 1.

[2292] Based on this possible design, by padding the first element of the m-sequence with 1, the number of elements in the final preamble sequence can be made even, thus satisfying the rate matching requirement of the preamble sequence length.

[2293] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[2294] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0];

[2295] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[2296] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[2297] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[2298] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1];

[2299] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[2300] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2301] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2302] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[2303] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[2304] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0];

[2305] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[2306] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2307] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2308] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0];

[2309] Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1];

[2310] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1];

[2311] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1];

[2312] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0];

[2313] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0];

[2314] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0];

[2315] Primitive polynomial x 5 +x4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1];

[2316] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[2317] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2318] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2319] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0];

[2320] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1];

[2321] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0];

[2322] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[2323] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 1];

[2324] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[2325] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0, 0];

[2326] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2327] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2328] Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1];

[2329] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2330] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0];

[2331] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[2332] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1];

[2333] Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1];

[2334] Primitive polynomial x 7 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0];

[2335] Primitive polynomial x 7 +x4 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[2336] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1];

[2337] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0];

[2338] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2339] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2340] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 1, 0, 1, 1];

[2341] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[2342] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0];

[2343] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[2344] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0];

[2345] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2346] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2347] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2348] Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 0, 1].

[2349] Based on this possible design, the time-frequency two-dimensional correlation detection performance of the preamble sequence is optimized to the maximum extent, further improving the uplink synchronization performance, and thus improving the uplink data demodulation performance.

[2350] In a sixty-fourth aspect, embodiments of this application provide a communication device that performs the functions of the method described in aspect sixty-three. The functions can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functions of the method described in aspect sixty-three, such as a receiving unit, a processing unit, etc.

[2351] The receiving unit is used to receive a first signal, which is obtained by the terminal device based on a first sequence. The first sequence includes a preamble sequence, which is a second sequence or an equivalent sequence of the second sequence. The equivalent sequence is obtained by bitwise inversion and / or reversal of the sequence.

[2352] The processing unit is used to determine the position of the preamble sequence in the first signal; obtain a data window based on the position of the preamble in the first signal; and demodulate the data signal within the data window.

[2353] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[2354] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2355] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[2356] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[2357] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[2358] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[2359] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[2360] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[2361] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[2362] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2363] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[2364] Primitive polynomial x 4 +x 1+1, initial value [0, 1, 0, 0];

[2365] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[2366] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[2367] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[2368] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[2369] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[2370] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[2371] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[2372] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[2373] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2374] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[2375] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0];

[2376] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0];

[2377] Primitive polynomial x 5 +x 2+1, initial value [1, 0, 1, 1, 0];

[2378] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1];

[2379] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[2380] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0];

[2381] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[2382] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[2383] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[2384] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2385] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[2386] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 0, 1];

[2387] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[2388] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[2389] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0];

[2390] Primitive polynomial x 6 +x1 +1, initial value [1, 0, 1, 0, 1, 1];

[2391] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[2392] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[2393] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1];

[2394] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0, 0];

[2395] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2396] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1];

[2397] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[2398] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0, 0];

[2399] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0];

[2400] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[2401] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1];

[2402] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2403] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 1, 0, 0];

[2404] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0];

[2405] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0];

[2406] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2407] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[2408] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1];

[2409] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2410] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0];

[2411] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 1, 0];

[2412] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[2413] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1];

[2414] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 1, 0, 0];

[2415] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0];

[2416] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

[2417] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the first part of the m-sequence with 1.

[2418] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[2419] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0];

[2420] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[2421] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[2422] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[2423] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1];

[2424] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[2425] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2426] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[2427] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[2428] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0];

[2429] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[2430] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2431] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0];

[2432] Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1];

[2433] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1];

[2434] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1];

[2435] Primitive polynomial x 5 +x 3 +x 2 +x 1+1, initial value [1, 1, 1, 1, 0];

[2436] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0];

[2437] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0];

[2438] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1];

[2439] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[2440] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2441] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0];

[2442] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1];

[2443] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0];

[2444] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[2445] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 1];

[2446] Primitive polynomial x 6 +x 5+1, initial value [0, 1, 0, 1, 0, 0];

[2447] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0, 0];

[2448] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2449] Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1];

[2450] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2451] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0];

[2452] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[2453] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1];

[2454] Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1];

[2455] Primitive polynomial x 7 +x 5 +x 2 +x 1+1, initial value [0, 0, 0, 1, 0, 1, 0];

[2456] Primitive polynomial x 7 +x 4 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[2457] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1];

[2458] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0];

[2459] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2460] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 1, 0, 1, 1];

[2461] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[2462] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0];

[2463] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[2464] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0];

[2465] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2466] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2467] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2468] Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 0, 1].

[2469] In a sixty-fifth aspect, embodiments of this application also provide a communication device, including: a memory and a processor, the processor being configured to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device causes the device to perform the method described in aspect sixty-third or any possible design of aspect sixty-third.

[2470] In a sixty-sixth aspect, embodiments of this application also provide a communication device, including: a processor and an interface circuit, the processor being configured to communicate with other devices via the interface circuit and to execute the method described in aspect sixty-three or any possible design of aspect sixty-three.

[2471] The communication apparatus described in aspects 64 to 66 above can be applied to network equipment.

[2472] In a sixty-seventh aspect, embodiments of this application also provide a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a network device or in a chip embedded in the network device, they cause the network device to perform the method described in aspect sixty-three.

[2473] In a sixty-eighth aspect, embodiments of this application also provide a computer program product containing instructions that, when run on a computer, enable the computer to perform the methods described in the sixty-third aspect or any possible design of the sixty-third aspect.

[2474] Understandably, the beneficial effects that can be achieved by aspects 64 to 68 provided above can be referenced to the beneficial effects in aspect 63 and any of its possible designs, which will not be repeated here.

[2475] In a sixty-ninth aspect, embodiments of this application also provide a signal processing method applied to a communication system including network devices and terminal devices, wherein the terminal devices perform the method described in the fifty-seventh aspect and any possible design thereof; and the network devices perform the method described in the sixty-third aspect and any possible design thereof.

[2476] In a seventieth aspect, embodiments of this application also provide a communication system, including: a network device and a terminal device; the terminal device performs the method as described in aspect fifty-seven and any possible design thereof; the network device performs the method as described in aspect sixty-three and any possible design thereof.

[2477] Understandably, the beneficial effects that can be achieved by aspects 69 and 70 provided above can be referred to the beneficial effects described in aspects 57, 63, etc., and will not be repeated here.

[2478] In a seventy-one aspect, embodiments of this application provide a signal processing method, the method comprising: generating a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[2479] The second sequence is determined based on the m sequence. The number of elements in the second sequence is even. The m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set.

[2480] The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2481] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[2482] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0];

[2483] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[2484] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[2485] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[2486] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[2487] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[2488] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[2489] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1];

[2490] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[2491] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2492] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[2493] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[2494] Primitive polynomial x 4+x 1 +1, initial value [0, 1, 0, 0];

[2495] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[2496] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0];

[2497] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[2498] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[2499] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[2500] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[2501] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[2502] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2503] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0];

[2504] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[2505] Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1];

[2506] Primitive polynomial x 5 +x 3 +x 2 +x 1+1, initial value [1, 0, 0, 0, 1];

[2507] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1];

[2508] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0];

[2509] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0];

[2510] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0];

[2511] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1];

[2512] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[2513] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2514] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0];

[2515] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[2516] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1];

[2517] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 0, 1];

[2518] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[2519] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0];

[2520] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0];

[2521] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 1];

[2522] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[2523] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0, 0];

[2524] The sequences in the fifth set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2525] Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1];

[2526] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2527] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0];

[2528] Primitive polynomial x 7 +x 6 +x5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[2529] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1];

[2530] Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1];

[2531] Primitive polynomial x 7 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0];

[2532] Primitive polynomial x 7 +x 4 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[2533] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1];

[2534] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0];

[2535] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2536] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1+1, initial value [0, 1, 0, 0, 1, 0, 1, 1];

[2537] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[2538] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0];

[2539] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[2540] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0];

[2541] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2542] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[2543] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2544] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2545] Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 0, 1].

[2546] Based on this method, the preamble sequence can be determined from the m-sequence when the terminal sends the first signal. Since the m-sequence is a pre-set m-sequence with good time-frequency two-dimensional correlation detection performance, the uplink synchronization performance can be improved, thereby improving the uplink data demodulation performance.

[2547] In one possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by padding the first part of the m-sequence with 1.

[2548] Based on this possible design, by padding the first element of the m-sequence with 1, the number of elements in the final preamble sequence can be made even, thus satisfying the rate matching requirement of the preamble sequence length.

[2549] In one possible design, the sequences in the first sequence set also include at least one of the m sequences obtained by combining the following primitive polynomials and initial values:

[2550] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[2551] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[2552] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1].

[2553] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2554] In one possible design, the sequences in the second sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2555] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[2556] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[2557] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[2558] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1].

[2559] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2560] In one possible design, the sequence in the third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2561] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0];

[2562] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0];

[2563] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[2564] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1];

[2565] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[2566] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0];

[2567] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[2568] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[2569] Primitive polynomial x 5 +x 2+1, initial value [0, 1, 1, 1, 0].

[2570] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2571] In one possible design, the sequences in the fourth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2572] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[2573] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0];

[2574] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[2575] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[2576] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[2577] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1];

[2578] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0, 0].

[2579] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2580] In one possible design, the fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2581] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1];

[2582] Primitive polynomial x7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[2583] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0, 0];

[2584] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0];

[2585] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[2586] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1];

[2587] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2588] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 1, 0, 0];

[2589] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0];

[2590] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0].

[2591] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2592] In one possible design, the sequences in the sixth sequence set also include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2593] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1];

[2594] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2595] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0];

[2596] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 1, 0];

[2597] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[2598] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1];

[2599] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 1, 0, 0];

[2600] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0];

[2601] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

[2602] Based on this possible design, it is possible to provide an m-sequence corresponding to a primitive polynomial with the fewest taps, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2603] In a seventy-second aspect, embodiments of this application provide a communication device that performs the functions of the method described in aspect seventy-one. The funct...

Claims

1. A signal processing method, characterized in that, include: Generate a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; The first sequence is modulated to obtain a first signal; Send the first signal; Wherein, the second sequence is an m-sequence, and the m-sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set; The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 + x 1 + 1, initial value [0, 1, 0] Primitive polynomial x 3 + x 1 + 1, initial value [0, 1, 1] Primitive polynomial x 3 + x 1 + 1, initial value [1, 1, 0] Primitive polynomial x 3 + x 1 + 1, initial value [0, 0, 1] Primitive polynomial x 3 + x 1 + 1, initial value [1, 0, 0] Primitive polynomial x 3 + x 1 + 1, initial value [1, 1, 1] Primitive polynomial x 3 + x 1 + 1, initial value [1, 0, 1] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 0, 1] Primitive polynomial x 4 + x 1 + 1, initial value [1, 0, 1, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 1, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 0, 0] Primitive polynomial x 4 + x 1 + 1, initial value [1, 0, 0, 0] Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 1, 0] Primitive polynomial x 4 + x 1 + 1, initial value [1, 1, 1, 1] Primitive polynomial x 4 + x 1 + 1, initial value [1, 0, 0, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 0, 1, 0] Primitive polynomial x 4 + x 1 + 1, initial value [0, 0, 1, 1] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 + x 2 + 1, initial value [1, 0, 0, 1, 1] Primitive polynomial x 5 + x 2 + 1, initial value [0, 0, 1, 0, 0] Primitive polynomial x 5 + x 2 + 1, initial value [1, 0, 1, 0, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 0, 1, 1] Primitive polynomial x 5 + x 2 + 1, initial value [0, 0, 0, 1, 1] Primitive polynomial x 5 + x 2 + 1, initial value [0, 0, 1, 1, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 0, 1, 0, 1] Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 0, 0, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 1, 1, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 1, 1, 1] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 + x 1 + 1, initial value [1, 0, 1, 0, 0, 1] Primitive polynomial x 6 + x 1 + 1, initial value [0, 1, 0, 0, 1, 0] Primitive polynomial x 6 + x 1 + 1, initial value [0, 0, 0, 0, 0, 1] Primitive polynomial x 6 + x 1 + 1, initial value [1, 1, 1, 1, 0, 1] Primitive polynomial x 6 + x 1 + 1, initial value [1, 1, 1, 1, 1, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 1, 1, 1, 0, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 1, 0, 0, 1, 0] Primitive polynomial x 6 + x 1 + 1, initial value [0, 1, 1, 1, 0, 1] Primitive polynomial x 6 + x 1 + 1, initial value [0, 0, 0, 1, 0, 1] Primitive polynomial x 6 + x 1 + 1, initial value [0, 1, 1, 1, 1, 1] The sequences in the fifth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 + x 1 + 1, initial value [0, 0, 1, 0, 1, 1, 0] Primitive polynomial x 7 + x 1 + 1, initial value [1, 0, 1, 0, 1, 1, 0] Primitive polynomial x 7 + x 1 + 1, initial value [1, 1, 1, 1, 0, 0, 0] Primitive polynomial x 7 + x 1 + 1, initial value [0, 1, 0, 1, 1, 1, 1] Primitive polynomial x 7 + x 1 + 1, initial value [0, 0, 1, 1, 1, 0, 1] Primitive polynomial x 7 + x 1 + 1, initial value [0, 1, 1, 0, 1, 1, 1] Primitive polynomial x 7 + x 1 + 1, initial value [0, 1, 0, 1, 1, 0, 0] Primitive polynomial x 7 + x 1 + 1, initial value [1, 0, 1, 0, 0, 0, 1] Primitive polynomial x 7 + x 1 + 1, initial value [1, 1, 1, 1, 0, 1, 0] Primitive polynomial x 7 + x 1 + 1, initial value [0, 0, 1, 1, 1, 1, 0] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 0, 1, 1, 0, 0, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 0, 0, 1, 0, 0, 1, 0] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 0, 1, 1, 0, 1, 1, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 0, 1, 0, 1, 0, 1, 0] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 1, 0, 0, 0, 0, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 0, 0, 0, 1, 0, 0] primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 1, 0, 0, 0, 1, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 0, 0, 1, 1, 0, 0] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 0, 1, 0, 0, 1, 0, 1] primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

2. The method according to claim 1, characterized in that, The sequence in the first sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 + x 2 + 1, initial value [1, 1, 1] Primitive polynomial x 3 + x 2 + 1, initial value [0, 1, 0] Primitive polynomial x 3 + x 2 + 1, initial value [1, 0, 0] The primitive polynomial x 3 + x 2 + 1, with initial value [0, 0, 1].

3. The method according to claim 1 or 2, characterized in that, The second set of sequences also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 + x 3 + 1, initial value [1, 1, 1, 1] Primitive polynomial x 4 + x 3 + 1, initial value [0, 1, 1, 1] Primitive polynomial x 4 + x 3 + 1, initial value [0, 0, 1, 0] Primitive polynomial x 4 + x 3 + 1, initial value [0, 1, 1, 0] primitive polynomial x 4 + x 3 + 1, initial value [0, 0, 1, 1].

4. The method according to any one of claims 1-3, characterized in that, The third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 + x 3 + x 2 + x 1 + 1, initial value [1, 0, 0, 1, 1] Primitive polynomial x 5 + x 4 + x 3 + x 2 + 1, initial value [0, 0, 1, 1, 0] Primitive polynomial x 5 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 1, 0, 1] Primitive polynomial x 5 + x 3 + x 2 + x 1 + 1, initial value [1, 0, 0, 0, 0] Primitive polynomial x 5 + x 3 + 1, initial value [1, 1, 1, 1, 0] Primitive polynomial x 5 + x 3 + 1, initial value [1, 0, 1, 1, 0] Primitive polynomial x 5 + x 3 + x 2 + x 1 + 1, initial value [0, 0, 0, 1, 0] Primitive polynomial x 5 + x 4 + x 3 + x 2 + 1, initial value [1, 1, 1, 0, 1].

5. The method according to any one of claims 1-4, characterized in that, The fourth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 + x 5 + 1, initial value [1, 0, 1, 1, 1, 0] Primitive polynomial x 6 + x 5 + x 3 + x 2 + 1, initial value [0, 0, 0, 0, 1, 1] Primitive polynomial x 6 + x 4 + x 3 + x 1 + 1, initial value [1, 0, 0, 1, 0, 0] Primitive polynomial x 6 + x 5 + x 2 + x 1 + 1, initial value [1, 0, 1, 0, 1, 1] Primitive polynomial x 6 + x 5 + x 4 + x 1 + 1, initial value [1, 1, 0, 0, 0, 1] Primitive polynomial x 6 + x 5 + 1, initial value [1, 1, 0, 1, 1, 1] The primitive polynomial x 6 + x 5 + 1 with initial value [1, 0, 0, 0, 0, 1].

6. The method according to any one of claims 1-5, characterized in that, The fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 + x 6 + 1, initial value [1, 0, 1, 1, 1, 0, 1] Primitive polynomial x 7 + x 5 + x 4 + x 3 + x 2 + x 1 + 1, initial value [1, 1, 0, 0, 0, 1, 1] Primitive polynomial x 7 + x 6 + x 5 + x 4 + x 3 + x 2 + 1, initial value [1, 1, 1, 0, 1, 1, 1] Primitive polynomial x 7 + x 6 + 1, initial value [1, 0, 1, 1, 1, 1, 0] primitive polynomial x 7 + x 3 + x 2 + x 1 + 1, initial value [1, 0, 1, 0, 1, 0, 0] Primitive polynomial x 7 + x 6 + x 5 + x 4 + 1, initial value [1, 0, 0, 0, 1, 0, 0] Primitive polynomial x 7 + x 3 + x 2 + x 1 + 1, initial value [1, 0, 0, 0, 1, 0, 1] primitive polynomial x 7 + x 6 + x 5 + x 4 + 1, initial value [0, 1, 1, 1, 1, 0, 1].

7. The method according to any one of claims 1-6, characterized in that, The sixth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 + x 6 + x 5 + x 3 + 1, initial value [0, 0, 1, 1, 0, 1, 1, 1] Primitive polynomial x 8 + x 5 + x 3 + x 2 + 1, initial value [0, 0, 0, 0, 1, 1, 1, 0] Primitive polynomial x 8 + x 6 + x 4 + x 3 + x 2 + x 1 + 1, initial value [0, 1, 0, 0, 0, 0, 0, 0] primitive polynomial x 8 + x 7 + x 6 + x 5 + x 4 + x 2 + 1, initial value [1, 0, 0, 1, 0, 1, 0, 1] Primitive polynomial x 8 + x 7 + x 5 + x 3 + 1, initial value [0, 0, 1, 1, 1, 1, 1, 0] Primitive polynomial x 8 + x 5 + x 3 + x 1 + 1, initial value [0, 0, 0, 1, 0, 1, 0, 0] Primitive polynomial x 8 + x 6 + x 5 + x 4 + 1, initial value [1, 0, 0, 0, 1, 1, 0, 0] Primitive polynomial x 8 + x 7 + x 2 + x 1 + 1, initial value [0, 1, 1, 1, 0, 0, 0, 0] primitive polynomial x 8 + x 7 + x 6 + x 1 + 1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

8. A signal processing method, characterized in that, include: Generate a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; The first sequence is modulated to obtain a first signal; Send the first signal; Wherein, the second sequence is determined based on the m sequence, the number of elements in the second sequence is even, and the m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set; The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 + x 1 + 1, initial value [0, 1, 1] Primitive polynomial x 3 + x 1 + 1, initial value [0, 0, 1] Primitive polynomial x 3 + x 1 + 1, initial value [1, 1, 1] Primitive polynomial x 3 + x 1 + 1, initial value [0, 1, 0] Primitive polynomial x 3 + x 1 + 1, initial value [1, 0, 0] Primitive polynomial x 3 + x 1 + 1, initial value [1, 0, 1] Primitive polynomial x 3 + x 1 + 1, initial value [1, 1, 0] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 + x 1 + 1, initial value [1, 0, 1, 0] Primitive polynomial x 4 + x 1 + 1, initial value [1, 0, 0, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 0, 1, 1] Primitive polynomial x 4 + x 1 + 1, initial value [1, 1, 1, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 0, 0] Primitive polynomial x 4 + x 1 + 1, initial value [1, 0, 0, 0] Primitive polynomial x 4 + x 1 + 1, initial value [1, 1, 0, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 0, 0, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 1, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 0, 1] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 + x 2 + 1, initial value [1, 1, 1, 0, 1] Primitive polynomial x 5 + x 2 + 1, initial value [1, 0, 1, 0, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 0, 1, 0, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 0, 0, 1, 0] Primitive polynomial x 5 + x 2 + 1, initial value [1, 0, 0, 0, 0] Primitive polynomial x 5 + x 2 + 1, initial value [1, 0, 1, 0, 1] Primitive polynomial x 5 + x 2 + 1, initial value [1, 0, 1, 1, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 0, 0, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 1, 1, 1] Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 1, 1, 0] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 + x 1 + 1, initial value [0, 1, 1, 0, 0, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 0, 1, 0, 1, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 0, 1, 1, 1, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 1, 0, 1, 0, 1] Primitive polynomial x 6 + x 1 + 1, initial value [0, 0, 1, 1, 1, 1] Primitive polynomial x 6 + x 1 + 1, initial value [0, 0, 1, 1, 0, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 1, 1, 1, 0, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 0, 1, 0, 0, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 1, 1, 1, 0, 1] Primitive polynomial x 6 + x 1 + 1, initial value [1, 1, 0, 0, 0, 0] The sequences in the fifth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 + x 1 + 1, initial value [1, 1, 1, 0, 1, 0, 1] Primitive polynomial x 7 + x 1 + 1, initial value [0, 1, 1, 0, 0, 1, 1] Primitive polynomial x 7 + x 1 + 1, initial value [0, 0, 1, 1, 0, 0, 1] Primitive polynomial x 7 + x 1 + 1, initial value [0, 0, 0, 0, 0, 0, 1] Primitive polynomial x 7 + x 1 + 1, initial value [1, 1, 0, 0, 1, 0, 1] Primitive polynomial x 7 + x 1 + 1, initial value [0, 1, 1, 1, 0, 1, 0] Primitive polynomial x 7 + x 1 + 1, initial value [1, 1, 0, 0, 1, 1, 1] Primitive polynomial x 7 + x 1 + 1, initial value [1, 0, 1, 0, 1, 0, 1] Primitive polynomial x 7 + x 1 + 1, initial value [0, 1, 0, 0, 0, 1, 1] Primitive polynomial x 7 + x 1 + 1, initial value [1, 1, 0, 1, 1, 1, 0] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 1, 0, 1, 0, 1, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 1, 0, 1, 0, 1, 0, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 0, 1, 1, 0, 0, 0] primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 0, 1, 0, 1, 1, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 1, 1, 0, 0, 1, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 0, 1, 1, 1, 0, 0] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 1, 1, 0, 0, 0, 1, 0] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 0, 1, 1, 1, 1, 0, 0] primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 1, 1, 0, 0, 1, 1, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

9. The method according to claim 8, characterized in that, The second sequence is determined based on the m sequence, including: the second sequence is determined by padding the first part of the m sequence with 0.

10. The method according to claim 8 or 9, characterized in that, The sequence in the first sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 + x 2 + 1, initial value [1, 0, 1] Primitive polynomial x 3 + x 2 + 1, initial value [0, 1, 0] Primitive polynomial x 3 + x 2 + 1, initial value [1, 0, 0] The primitive polynomial x 3 + x 2 + 1 with initial value [1, 1, 1].

11. The method according to any one of claims 8-10, characterized in that, The second set of sequences also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 + x 3 + 1, initial value [1, 1, 1, 0] Primitive polynomial x 4 + x 3 + 1, initial value [1, 0, 1, 0] Primitive polynomial x 4 + x 3 + 1, initial value [0, 0, 0, 1] Primitive polynomial x 4 + x 3 + 1, initial value [1, 0, 0, 1] The primitive polynomial x 4 + x 3 + 1 with initial value [0, 0, 1, 0].

12. The method according to any one of claims 8-11, characterized in that, The third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 + x 3 + x 2 + x 1 + 1, initial value [1, 1, 0, 1, 0] Primitive polynomial x 5 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 1, 0, 0] Primitive polynomial x 5 + x 4 + x 2 + x 1 + 1, initial value [1, 1, 0, 1, 0] Primitive polynomial x 5 + x 4 + x 3 + x 1 + 1, initial value [0, 0, 0, 1, 1] Primitive polynomial x 5 + x 3 + x 2 + x 1 + 1, initial value [1, 0, 1, 0, 1] Primitive polynomial x 5 + x 4 + x 3 + x 2 + 1, initial value [0, 0, 1, 1, 1] Primitive polynomial x 5 + x 4 + x 2 + x 1 + 1, initial value [0, 0, 1, 0, 1] Primitive polynomial x 5 + x 4 + x 3 + x 1 + 1, initial value [1, 0, 0, 1, 0] Primitive polynomial x 5 + x 4 + x 3 + x 2 + 1, initial value [1, 1, 0, 1, 1] Primitive polynomial x 5 + x 3 + x 2 + x 1 + 1, initial value [0, 1, 0, 1, 1].

13. The method according to any one of claims 8-12, characterized in that, The fourth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 + x 5 + 1, initial value [1, 1, 1, 1, 1, 0] Primitive polynomial x 6 + x 5 + x 2 + x 1 + 1, initial value [1, 0, 1, 0, 1, 0] Primitive polynomial x 6 + x 5 + x 4 + x 1 + 1, initial value [0, 1, 1, 0, 1, 0] Primitive polynomial x 6 + x 5 + 1, initial value [1, 0, 1, 1, 1, 0] Primitive polynomial x 6 + x 4 + x 3 + x 1 + 1, initial value [1, 1, 0, 1, 1, 0] Primitive polynomial x 6 + x 5 + x 3 + x 2 + 1, initial value [0, 0, 1, 0, 0, 1] The primitive polynomial x 6 + x 5 + 1 with initial value [0, 1, 0, 1, 0, 0].

14. The method according to any one of claims 8-13, characterized in that, The fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 + x 6 + x 5 + x 4 + 1, initial value [0, 0, 1, 1, 1, 1, 0] Primitive polynomial x 7 + x 6 + x 5 + x 3 + x 2 + x 1 + 1, initial value [1, 1, 0, 1, 1, 0, 1] Primitive polynomial x 7 + x 6 + x 4 + x 2 + 1, initial value [0, 1, 1, 1, 0, 1, 1] Primitive polynomial x 7 + x 5 + x 3 + x 1 + 1, initial value [1, 0, 0, 0, 1, 0, 0] Primitive polynomial x 7 + x 3 + x 2 + x 1 + 1, initial value [1, 1, 1, 1, 0, 0, 1] Primitive polynomial x 7 + x 6 + x 5 + x 4 + 1, initial value [0, 1, 0, 1, 0, 0, 1] Primitive polynomial x 7 + x 4 + x 3 + x 2 + 1, initial value [0, 0, 1, 1, 0, 1, 1] Primitive polynomial x 7 + x 3 + 1, initial value [1, 1, 0, 0, 0, 1, 1] The primitive polynomial x 7 + x 6 + 1 with initial value [1, 0, 0, 1, 1, 0, 0].

15. The method according to any one of claims 8-14, characterized in that, The sixth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 + x 5 + x 3 + x 1 + 1, initial value [1, 0, 0, 1, 0, 1, 0, 1] Primitive polynomial x 8 + x 7 + x 6 + x 3 + x 2 + x 1 + 1, initial value [0, 0, 1, 1, 1, 1, 1, 1] Primitive polynomial x 8 + x 7 + x 6 + x 5 + x 2 + x 1 + 1, initial value [0, 0, 1, 1, 1, 0, 1, 0] primitive polynomial x 8 + x 6 + x 3 + x 2 + 1, initial value [0, 0, 1, 0, 0, 0, 1, 1] Primitive polynomial x 8 + x 7 + x 6 + x 1 + 1, initial value [0, 0, 0, 0, 0, 0, 1, 1] Primitive polynomial x 8 + x 7 + x 2 + x 1 + 1, initial value [1, 1, 0, 1, 1, 0, 1, 0] Primitive polynomial x 8 + x 5 + x 3 + x 1 + 1, initial value [0, 1, 0, 1, 0, 1, 0, 0] primitive polynomial x 8 + x 7 + x 5 + x 3 + 1, initial value [1, 1, 0, 0, 0, 0, 1, 1] Primitive polynomial x 8 + x 7 + x 6 + x 5 + x 2 + x 1 + 1, initial value [0, 0, 0, 1, 1, 1, 1, 1] primitive polynomial x 8 + x 6 + x 5 + x 4 + 1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

16. A signal processing method, characterized in that, include: Generate a first sequence, the first sequence including a preamble sequence, the preamble sequence being a second sequence or an equivalent sequence of the second sequence, the equivalent sequence being obtained by bitwise inversion and / or reversal of the sequence; The first sequence is modulated to obtain a first signal; Send the first signal; Wherein, the second sequence is determined based on the m sequence, the number of elements in the second sequence is even, and the m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set; The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 + x 1 + 1, initial value [0, 1, 0] Primitive polynomial x 3 + x 1 + 1, initial value [1, 1, 0] Primitive polynomial x 3 + x 1 + 1, initial value [0, 0, 1] Primitive polynomial x 3 + x 1 + 1, initial value [0, 1, 1] Primitive polynomial x 3 + x 1 + 1, initial value [1, 0, 0] Primitive polynomial x 3 + x 1 + 1, initial value [1, 1, 1] Primitive polynomial x 3 + x 1 + 1, initial value [1, 0, 1] The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 0, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 0, 0] Primitive polynomial x 4 + x 1 + 1, initial value [1, 0, 1, 0] Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 1, 1] Primitive polynomial x 4 + x 1 + 1, initial value [1, 1, 1, 1] Primitive polynomial x 4 + x 1 + 1, initial value [1, 0, 0, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 0, 1, 0] Primitive polynomial x 4 + x 1 + 1, initial value [1, 0, 1, 1] Primitive polynomial x 4 + x 1 + 1, initial value [0, 1, 1, 0] Primitive polynomial x 4 + x 1 + 1, initial value [1, 1, 0, 1] The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 0, 1, 1] Primitive polynomial x 5 + x 2 + 1, initial value [1, 1, 1, 0, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 0, 1, 0] Primitive polynomial x 5 + x 2 + 1, initial value [1, 0, 1, 1, 0] Primitive polynomial x 5 + x 2 + 1, initial value [1, 1, 0, 1, 1] Primitive polynomial x 5 + x 2 + 1, initial value [1, 0, 0, 1, 1] Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 1, 0, 0] Primitive polynomial x 5 + x 2 + 1, initial value [1, 0, 1, 0, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 0, 1, 1, 0] Primitive polynomial x 5 + x 2 + 1, initial value [0, 1, 1, 1, 0] The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 + x 1 + 1, initial value [1, 1, 0, 1, 1, 0] Primitive polynomial x 6 + x 1 + 1, initial value [0, 1, 0, 1, 0, 1] Primitive polynomial x 6 + x 1 + 1, initial value [0, 1, 1, 0, 1, 0] Primitive polynomial x 6 + x 1 + 1, initial value [0, 0, 0, 1, 0, 1] Primitive polynomial x 6 + x 1 + 1, initial value [0, 1, 0, 1, 1, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 0, 1, 0, 1, 1] Primitive polynomial x 6 + x 1 + 1, initial value [0, 0, 1, 1, 0, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 0, 1, 0, 1, 0] Primitive polynomial x 6 + x 1 + 1, initial value [1, 1, 1, 0, 1, 1] Primitive polynomial x 6 + x 1 + 1, initial value [1, 0, 0, 0, 0, 0] The sequences in the fifth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 + x 1 + 1, initial value [1, 0, 1, 0, 0, 1, 1] Primitive polynomial x 7 + x 1 + 1, initial value [1, 1, 0, 1, 0, 1, 0] Primitive polynomial x 7 + x 1 + 1, initial value [1, 0, 0, 0, 0, 0, 0] Primitive polynomial x 7 + x 1 + 1, initial value [1, 0, 0, 1, 1, 1, 0] Primitive polynomial x 7 + x 1 + 1, initial value [1, 1, 1, 1, 0, 0, 1] Primitive polynomial x 7 + x 1 + 1, initial value [0, 0, 1, 0, 1, 0, 1] Primitive polynomial x 7 + x 1 + 1, initial value [1, 1, 1, 0, 0, 1, 0] Primitive polynomial x 7 + x 1 + 1, initial value [1, 1, 1, 1, 1, 0, 0] Primitive polynomial x 7 + x 1 + 1, initial value [1, 0, 0, 1, 0, 1, 0] Primitive polynomial x 7 + x 1 + 1, initial value [0, 1, 0, 1, 0, 1, 0] The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 1, 1, 0, 0, 0, 0] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 0, 1, 1, 1, 0, 0, 1] primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 0, 1, 0, 1, 1, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 1, 1, 1, 0, 0, 0] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 1, 0, 1, 1, 1, 0] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 1, 0, 1, 0, 1, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 0, 1, 0, 0, 1, 1] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 1, 1, 1, 1, 0, 0] Primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 0, 0, 1, 0, 1, 0] primitive polynomial x 8 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

17. The method according to claim 16, characterized in that, The second sequence is determined based on the m sequence, including: the second sequence is determined by padding the first digit of the m sequence with 1.

18. The method according to claim 16 or 17, characterized in that, The sequence in the first sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 + x 2 + 1, initial value [1, 1, 0] Primitive polynomial x 3 + x 2 + 1, initial value [1, 1, 1] Primitive polynomial x 3 + x 2 + 1, initial value [0, 0, 1] Primitive polynomial x 3 + x 2 + 1, initial value [0, 1, 0] Primitive polynomial x 3 + x 2 + 1, initial value [0, 1, 1] The primitive polynomial x 3 + x 2 + 1 with initial value [1, 0, 1].

19. The method according to any one of claims 16-18, characterized in that, The second set of sequences also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 + x 3 + 1, initial value [1, 1, 1, 0] Primitive polynomial x 4 + x 3 + 1, initial value [1, 1, 1, 1] Primitive polynomial x 4 + x 3 + 1, initial value [1, 1, 0, 0] The primitive polynomial x 4 + x 3 + 1 with initial value [0, 1, 1, 0].

20. The method according to any one of claims 16-19, characterized in that, The third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 + x 3 + x 2 + x 1 + 1, initial value [0, 1, 0, 1, 0] Primitive polynomial x 5 + x 3 + 1, initial value [0, 0, 0, 0, 1] Primitive polynomial x 5 + x 3 + x 2 + x 1 + 1, initial value [1, 0, 0, 0, 1] Primitive polynomial x 5 + x 4 + x 3 + x 2 + 1, initial value [1, 0, 1, 1, 1] Primitive polynomial x 5 + x 3 + x 2 + x 1 + 1, initial value [1, 1, 1, 1, 0] Primitive polynomial x 5 + x 4 + x 3 + x 2 + 1, initial value [0, 0, 1, 0, 0] Primitive polynomial x 5 + x 3 + x 2 + x 1 + 1, initial value [1, 1, 0, 0, 0] Primitive polynomial x 5 + x 4 + x 3 + x 2 + 1, initial value [0, 1, 1, 1, 1] Primitive polynomial x 5 + x 4 + x 2 + x 1 + 1, initial value [0, 0, 1, 0, 1].

21. The method according to any one of claims 16-20, characterized in that, The fourth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 + x 5 + 1, initial value [0, 1, 1, 0, 1, 0] Primitive polynomial x 6 + x 5 + 1, initial value [0, 1, 1, 0, 0, 1] Primitive polynomial x 6 + x 5 + 1, initial value [1, 1, 0, 1, 1, 0] Primitive polynomial x 6 + x 5 + 1, initial value [1, 1, 1, 1, 1, 0] Primitive polynomial x 6 + x 5 + 1, initial value [1, 1, 1, 1, 1, 1] Primitive polynomial x 6 + x 5 + 1, initial value [0, 1, 0, 1, 0, 0] Primitive polynomial x 6 + x 5 + x 2 + x 1 + 1, initial value [0, 1, 0, 1, 0, 0].

22. The method according to any one of claims 16-21, characterized in that, The fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 + x 6 + 1, initial value [1, 1, 1, 0, 0, 1, 1] Primitive polynomial x 7 + x 3 + x 2 + x 1 + 1, initial value [1, 1, 1, 0, 0, 1, 0] Primitive polynomial x 7 + x 6 + x 5 + x 4 + 1, initial value [0, 0, 1, 0, 1, 0, 0] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0]; Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1]; Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1]; Primitive polynomial x 7 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0]; Primitive polynomial x 7 +x 4 +1, initial value [0, 0, 1, 1, 0, 1, 1]; Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1]; Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0].

23. The method according to any one of claims 16-22, characterized in that, The sixth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 1, 0, 1, 1]; Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0]; Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0]; Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1]; Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0]; Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1]; Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0]; Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0]; Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 0, 1].

24. A signal processing method, characterized in that, include: The terminal device receives a first signal, which is modulated by the terminal device according to a first sequence. The first sequence includes a preamble sequence, and the preamble sequence is a second sequence or an equivalent sequence of the second sequence. The equivalent sequence is obtained by bitwise inversion and / or reversal of the sequence. Determine the position of the preamble sequence in the first signal; A data window is obtained based on the position of the preamble sequence in the first signal, and the data signal within the data window is demodulated. Wherein, the second sequence is an m-sequence, and the m-sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set; The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0]; Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1]; Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0]; Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1]; Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0]; Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1]; Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1]; The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1]; Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0]; Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0]; Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0]; Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1]; Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0]; Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1]; The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1]; Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0]; Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1]; Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 1]; Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 1]; Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1]; The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1]; Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 0, 1, 0]; Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1]; Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1]; Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 1, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 1, 0]; Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 0, 1]; Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1]; Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 1, 1]; The sequences in the fifth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 1, 0]; Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 1, 0]; Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0]; Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 1, 1]; Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1]; Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 1, 1, 1]; Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0]; Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 0, 1]; Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 1, 0]; Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 0]; The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 0, 0, 0, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 0, 1, 0, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0, 0, 1, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 0, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

25. The method according to claim 24, characterized in that, The sequence in the first sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1]; Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0]; Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0]; Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1]; The second set of sequences also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1]; Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 1]; Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0]; Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0]; Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 1]; The third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 1, 1]; Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0]; Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 1]; Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0]; Primitive polynomial x 5 +x 3 +1, initial value [1, 1, 1, 1, 0]; Primitive polynomial x 5 +x 3 +1, initial value [1, 0, 1, 1, 0]; Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0]; Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1]; The fourth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0]; Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1]; Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 0]; Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 1]; Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [1, 1, 0, 0, 0, 1]; Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 1]; Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 0, 0, 0, 1]; The fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 0, 1]; Primitive polynomial x 7 +x 5 +x 4 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0, 1, 1]; Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1, 1, 1]; Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 1, 1, 1, 1, 0]; Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 0]; Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 0, 0]; Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 1]; Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 1, 1, 1, 0, 1]; The sixth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 +x 6 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1]; Primitive polynomial x 8 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1, 1, 0]; Primitive polynomial x 8 +x 6 +x 4 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 0, 0, 0, 0]; Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 4 +x 2 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1]; Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [0, 0, 1, 1, 1, 1, 1, 0]; Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0, 0]; Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0]; Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0]; Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

26. A signal processing method, characterized in that, include: The terminal device receives a first signal, which is modulated by the terminal device according to a first sequence. The first sequence includes a preamble sequence, and the preamble sequence is a second sequence or an equivalent sequence of the second sequence. The equivalent sequence is obtained by bitwise inversion and / or reversal of the sequence. Determine the position of the preamble sequence in the first signal; A data window is obtained based on the position of the preamble sequence in the first signal, and the data signal within the data window is demodulated. Wherein, the second sequence is determined based on the m sequence, the number of elements in the second sequence is even, and the m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set; The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1]; Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1]; Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1]; Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0]; Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0]; Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1]; Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0]; The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0]; Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1]; Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0]; Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0]; Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1]; The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1]; Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0]; Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0]; Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1]; Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1]; Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0]; The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1]; Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1]; Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1]; Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0]; The sequences in the fifth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1]; Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1]; Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1]; Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1]; Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1]; Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0]; Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1]; Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1]; Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1]; Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0]; The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

27. The method according to claim 26, characterized in that, The second sequence is determined based on the m sequence, including: the second sequence is determined by padding the first part of the m sequence with 0.

28. The method according to claim 26 or 27, characterized in that, The sequence in the first sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1]; Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0]; Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0]; Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1]; The second set of sequences also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0]; Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0]; Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1]; Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1]; Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0]; The third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0]; Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0]; Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0]; Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1]; Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1]; Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1]; Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1]; Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0]; Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1]; Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1]; The fourth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0]; Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0]; Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0]; Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0]; Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0]; Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1]; Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0]; The fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 1, 0]; Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1]; Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1]; Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0]; Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1]; Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1]; Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1]; Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1]; Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0]; The sixth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1]; Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1, 1]; Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1, 0]; Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1]; Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 0, 1, 1]; Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0]; Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0]; Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1]; Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1, 1]; Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

29. A signal processing method, characterized in that, include: The terminal device receives a first signal, which is modulated by the terminal device according to a first sequence. The first sequence includes a preamble sequence, and the preamble sequence is a second sequence or an equivalent sequence of the second sequence. The equivalent sequence is obtained by bitwise inversion and / or reversal of the sequence. Determine the position of the preamble sequence in the first signal; A data window is obtained based on the position of the preamble sequence in the first signal, and the data signal within the data window is demodulated. Wherein, the second sequence is determined based on the m sequence, the number of elements in the second sequence is even, and the m sequence is one of the sequences in the first sequence set, or one of the sequences in the second sequence set, or one of the sequences in the third sequence set, or one of the sequences in the fourth sequence set, or one of the sequences in the fifth sequence set, or one of the sequences in the sixth sequence set; The sequences in the first set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0]; Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0]; Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1]; Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1]; Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0]; Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1]; Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1]; The sequences in the second set of sequences include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0]; Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0]; Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1]; Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1]; Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0]; Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1]; Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0]; Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1]; The sequences in the third sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1]; Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0]; Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0]; Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1]; Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1]; Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0]; Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0]; Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0]; The sequences in the fourth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 1, 0]; Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 0, 1]; Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0]; Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1]; Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 1]; Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0]; Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1]; Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0, 0]; The sequences in the fifth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1]; Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0]; Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0, 0]; Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0]; Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1]; Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1]; Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0]; Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 1, 0, 0]; Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0]; Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0]; The sequences in the sixth sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 1, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 1, 0, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

30. The method according to claim 29, characterized in that, The second sequence is determined based on the m sequence, including: the second sequence is determined by padding the first digit of the m sequence with 1.

31. The method according to claim 29 or 30, characterized in that, The sequence in the first sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0]; Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1]; Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1]; Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0]; Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1]; Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1]; The second set of sequences also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0]; Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1]; Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0]; Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0]; The third sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0]; Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1]; Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1]; Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1]; Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0]; Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0]; Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0]; Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1]; Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1]; The fourth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0]; Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1]; Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0]; Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 0]; Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1, 1]; Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0]; Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0, 0]; The fifth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1]; Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0]; Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0]; Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0]; Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1]; Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1]; Primitive polynomial x 7 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0]; Primitive polynomial x 7 +x 4 +1, initial value [0, 0, 1, 1, 0, 1, 1]; Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1]; Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0]; The sixth sequence set also includes at least one of the m-sequences obtained by combining the following primitive polynomials and initial values: Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 1, 0, 1, 1]; Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0]; Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0]; Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1]; Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 0, 1, 1, 0]; Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1]; Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0]; Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0]; Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 0, 1].

32. A signal processing method, characterized in that, The method is applied to a communication system including terminal devices and network devices, wherein the terminal devices perform the method according to any one of claims 1-7, and the network devices perform the method according to claim 24 or 25; or the terminal devices perform the method according to any one of claims 8-15, and the network devices perform the method according to any one of claims 26-28; or the terminal devices perform the method according to any one of claims 16-23, and the network devices perform the method according to any one of claims 29-31.

33. A communication device, characterized in that, include: A memory and a processor, the processor being configured to execute computer instructions stored in the memory, which, when executed, cause the apparatus to perform the method of any one of claims 1-7, or the method of any one of claims 8-15, or the method of any one of claims 16-23, or the method of claim 24 or 25, or the method of any one of claims 26-28, or the method of any one of claims 29-31.

34. A communication device, characterized in that, include: A processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and to perform the method of any one of claims 1-7, or the method of any one of claims 8-15, or the method of any one of claims 16-23, or the method of claim 24 or 25, or the method of any one of claims 26-28, or the method of any one of claims 29-31.

35. A communication system, characterized in that, The method includes a terminal device and a network device, wherein the terminal device is used to perform the method according to any one of claims 1-7, and the network device is used to perform the method according to claim 24 or 25; or the terminal device is used to perform the method according to any one of claims 8-15, and the network device is used to perform the method according to any one of claims 26-28; or the terminal device is used to perform the method according to any one of claims 16-23, and the network device is used to perform the method according to any one of claims 29-31.

36. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions; when the computer instructions are executed in a terminal device or in a chip embedded in the terminal device, the terminal device performs the method according to any one of claims 1-7, or the method according to any one of claims 8-15, or the method according to any one of claims 16-23; or when the computer instructions are executed in a network device or in a chip embedded in the network device, the network device performs the method according to claim 24 or 25, or the method according to any one of claims 26-28, or the method according to any one of claims 29-31.

37. A computer program product containing instructions, characterized in that, When it is run on a computer, it enables the computer to perform the method of any one of claims 1-7, or the method of any one of claims 8-15, or the method of any one of claims 16-23, or the method of claim 24 or 25, or the method of any one of claims 26-28, or the method of any one of claims 29-31.

Images