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

Abstract

The invention discloses a signal processing method, a communication device, a communication system and a storage medium, and relates to the field of communication. The method comprises the following steps: the terminal equipment generates a first sequence comprising a lead code sequence, then modulates the first sequence to obtain a first signal, and sends the first signal. Therefore, when the network equipment receives the first signal, synchronization of the first signal is carried out according to the lead code sequence, so that the position of the lead code sequence in the first signal is determined, and the synchronized first signal is demodulated to obtain the first sequence. Wherein the lead code sequence is a second sequence or an equivalent sequence of the second sequence. Moreover, the second sequence is determined according to an m sequence, and the m sequence is a preset m sequence with a relatively small correlation value peak during sliding correlation. According to the method, when the terminal equipment sends an uplink signal, the lead code sequence is generated according to the preset m sequence with the lower correlation value order peak, so that the uplink synchronization performance is improved.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of communications, and in particular to a signal processing method, a communication device, a communication system, and a storage medium. Background Art

[0002] Active or semi-passive Internet of Things (IoT) is a low-cost, low-power IoT solution, consuming no more than 500μW. It can achieve longer coverage than passive IoT and supports coherent uplink reception. Binary phase shift keying (BPSK) is an optional modulation method. When transmitting uplink data, the device adds a preamble to the data signal for uplink synchronization. The base station detects the preamble for timing and determines the data location. The detection method is that the base station receives the signal within the time window when the preamble is likely to arrive, generates a local preamble signal, and performs sliding correlation with the received signal. The location with the maximum correlation value is determined as the timing position of the preamble. Because the uplink data is scheduled by the base station, the base station knows the data length. Based on the preamble timing position and data length, the start and end positions of the received signal's data window can be determined.

[0003] However, uplink reception usually has a certain carrier frequency offset (CFO). CFO causes the main peak of the correlation value to shift in the time-frequency dimension when the local preamble signal is sliding correlated with the received signal, thereby affecting the uplink synchronization performance and further affecting the physical uplink shared channel (PUSCH) data demodulation performance. Summary of the Invention

[0004] The embodiments of the present application provide a signal processing method, a communication device, a communication system, and a storage medium, which can enable a terminal device to generate a preamble code sequence according to an m-sequence with a preset correlation value with a lower peak value when sending an uplink signal, thereby improving uplink synchronization performance.

[0005] In a first aspect, an embodiment of the present application provides 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 inverting and / or reversing the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[0006] 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;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0026] 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:

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

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

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

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

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

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

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

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

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

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

[0037] 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:

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

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

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

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

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

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

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

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

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

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

[0048] 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:

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

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

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

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

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

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

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

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

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

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

[0059] 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:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0117] 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];

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

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

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

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

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

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

[0124] In a second aspect, embodiments of the present application provide a communication device that implements the method described in the first aspect. The functionality 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 functionality of the method described in the first aspect, such as a processing unit, a sending unit, and the like.

[0125] a processing unit, 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 inverting and / or reversing the sequence; and modulating the first sequence to obtain a first signal;

[0126] a sending unit, configured to send a first signal;

[0127] 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;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0147] 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:

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

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

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

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

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

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

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

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

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

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

[0158] 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:

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

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

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

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

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

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

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

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

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

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

[0169] 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:

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

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

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

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

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

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

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

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

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

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

[0180] 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:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0210] Primitive polynomial x 5 +x4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 1].

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0232] 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];

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

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

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

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

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

[0238] In a third aspect, an embodiment of the present application also provides a communication device, comprising: a memory and a processor, the processor being used to execute computer instructions stored in the memory, and when the computer instructions are executed, the device executes the method described in the first aspect or any possible design of the first aspect.

[0239] In a fourth aspect, an embodiment of the present application further provides a communication device, comprising: a processor and an interface circuit, the processor being used to communicate with other devices through the interface circuit and execute the method described in the first aspect or any possible design of the first aspect.

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

[0241] In a fifth aspect, an embodiment of the present application also provides a computer-readable storage medium, which stores computer instructions; when the computer instructions are executed in a terminal device or a chip built into the terminal device, the terminal device executes the method described in the first aspect.

[0242] In a sixth aspect, an embodiment of the present application further provides a computer program product comprising instructions, which, when executed on a computer, enables the computer to execute the method described in the first aspect or any possible design of the first aspect.

[0243] It can be understood that the beneficial effects that can be achieved by the second to sixth aspects provided above can refer to the beneficial effects in the first aspect and any possible design thereof, and will not be repeated here.

[0244] In a seventh aspect, an embodiment of the present application provides a signal processing method, the method comprising: receiving a first signal, where the first signal is 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 inverting and / or reversing the sequence; determining a position of the preamble sequence in the first signal; obtaining a data window based on the position of the preamble in the first signal, and demodulating a data signal within the data window;

[0245] 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;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0265] 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:

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

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

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

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

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

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

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

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

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

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

[0276] 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:

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

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

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

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

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

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

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

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

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

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

[0287] 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:

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

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

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

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

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

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

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

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

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

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

[0298] 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:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0350] Primitive polynomial x 7 +x6 +x 5 +x 4 +1, initial value [0, 1, 1, 1, 1, 0, 1];

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

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

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

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

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

[0356] 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];

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

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

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

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

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

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

[0363] In an eighth aspect, an embodiment of the present application provides a communication device having the functionality to implement the method of the seventh aspect. The functionality 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 functionality of the method described in the seventh aspect, such as a receiving unit, a processing unit, and the like.

[0364] a receiving unit, configured to receive a first signal, where the first signal is modulated by a terminal device according to a first sequence, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence;

[0365] a processing unit, configured to determine a position of a preamble sequence in the first signal; obtain a data window according to the position of the preamble sequence in the first signal, and demodulate a data signal in the data window;

[0366] 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;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0386] 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:

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

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

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

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

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

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

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

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

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

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

[0397] 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:

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

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

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

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

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

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

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

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

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

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

[0408] 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:

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

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

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

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

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

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

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

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

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

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

[0419] 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:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0471] 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];

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

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

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

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

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

[0477] In the ninth aspect, an embodiment of the present application also provides a communication device, comprising: a memory and a processor, the processor being used to execute computer instructions stored in the memory, and when the computer instructions are executed, the device executes the method described in the seventh aspect or any possible design of the seventh aspect.

[0478] In the tenth aspect, an embodiment of the present application also provides a communication device, including: a processor and an interface circuit, the processor is used to communicate with other devices through the interface circuit, and execute the method described in the seventh aspect or any possible design of the seventh aspect.

[0479] The communication devices described in the eighth to tenth aspects above can be applied to network equipment.

[0480] In the eleventh aspect, an embodiment of the present application also provides a computer-readable storage medium, which stores computer instructions; when the computer instructions are executed in a network device or a chip built into the network device, the network device executes the method described in the seventh aspect.

[0481] In the twelfth aspect, an embodiment of the present application further provides a computer program product comprising instructions, which, when executed on a computer, enables the computer to execute the method described in the seventh aspect or any possible design of the seventh aspect.

[0482] It can be understood that the beneficial effects that can be achieved in the eighth to twelfth aspects provided above can be referred to the beneficial effects in the seventh aspect and any possible design thereof, and will not be repeated here.

[0483] In the thirteenth aspect, an embodiment of the present application also provides a signal processing method, which is applied to a communication system including a network device and a terminal device, wherein the terminal device executes the method described in the first aspect and any possible design thereof; the network device executes the method described in the seventh aspect and any possible design thereof.

[0484] In the fourteenth aspect, an embodiment of the present application also provides a communication system, including: a network device and a terminal device; the terminal device executes the method described in the first aspect and any possible design thereof; the network device executes the method described in the seventh aspect and any possible design thereof.

[0485] It can be understood that the beneficial effects that can be achieved in the thirteenth and fourteenth aspects provided above can refer to the beneficial effects described in the first and seventh aspects, etc., and will not be repeated here.

[0486] In a fifteenth aspect, an embodiment of the present application provides 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 inverting and / or reversing the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[0487] 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;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0510] 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:

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

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

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

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

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

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

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

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

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

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

[0521] 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:

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

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

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

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

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

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

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

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

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

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

[0532] 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:

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

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

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

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

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

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

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

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

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

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

[0543] 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:

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

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

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

[0547] 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];

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

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

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

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

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

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

[0554] Based on this method, when a terminal sends a first signal, it can determine a preamble sequence based on an 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 and thus improve uplink data demodulation performance.

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

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

[0557] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

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

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

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

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

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

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

[0564] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

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

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

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

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

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

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

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

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

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

[0574] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

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

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

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

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

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

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

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

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

[0583] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

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

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

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

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

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

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

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

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

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

[0593] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

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

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

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

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

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

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

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

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

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

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

[0604] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0605] In a sixteenth aspect, an embodiment of the present application provides a communication device having the functionality to implement the method of the fifteenth aspect. The functionality 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 functionality of the method described in the fifteenth aspect, for example, a sending unit, a processing unit, etc.

[0606] a processing unit, 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 inverting and / or reversing the sequence; and modulating the first sequence to obtain a first signal;

[0607] a sending unit, configured to send a first signal;

[0608] 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;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0631] 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:

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

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

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

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

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

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

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

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

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

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

[0642] 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:

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

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

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

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

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

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

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

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

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

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

[0653] 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:

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

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

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

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

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

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

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

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

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

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

[0664] 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:

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

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

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

[0668] 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];

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0719] In the seventeenth aspect, an embodiment of the present application also provides a communication device, comprising: a memory and a processor, the processor being used to execute computer instructions stored in the memory, and when the computer instructions are executed, the device executes the method described in the fifteenth aspect or any possible design of the fifteenth aspect.

[0720] In the eighteenth aspect, an embodiment of the present application also provides a communication device, including: a processor and an interface circuit, the processor is used to communicate with other devices through the interface circuit, and execute the method described in the fifteenth aspect or any possible design of the fifteenth aspect.

[0721] The communication devices described in aspects 16 to 18 above can be applied to terminal equipment.

[0722] In the nineteenth aspect, an embodiment of the present application also provides a computer-readable storage medium, which stores computer instructions; when the computer instructions are executed in a terminal device or a chip built into the terminal device, the terminal device executes the method described in the fifteenth aspect.

[0723] In the twentieth aspect, an embodiment of the present application further provides a computer program product comprising instructions, which, when executed on a computer, enables the computer to execute the method described in the fifteenth aspect or any possible design of the fifteenth aspect.

[0724] It can be understood that the beneficial effects that can be achieved in the above-mentioned aspects 16 to 20 can be referred to the beneficial effects in the 15th aspect and any possible design thereof, and will not be repeated here.

[0725] In a twenty-first aspect, an embodiment of the present application provides a signal processing method, the method comprising: receiving a first signal, where the first signal is 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 inverting and / or reversing the sequence; determining a position of the preamble sequence in the first signal; obtaining a data window based on the position of the preamble in the first signal, and demodulating a data signal within the data window;

[0726] 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;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0749] 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:

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

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

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

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

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

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

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

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

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

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

[0760] 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:

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

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

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

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

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

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

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

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

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

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

[0771] 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:

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

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

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

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

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

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

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

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

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

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

[0782] 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:

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

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

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

[0786] 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];

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

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

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

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

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

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

[0793] Based on this method, when a terminal sends a first signal, it can determine a preamble sequence based on an 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 and thus improve uplink data demodulation performance.

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

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

[0796] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

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

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

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

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

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

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

[0803] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

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

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

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

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

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

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

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

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

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

[0813] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

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

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

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

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

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

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

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

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

[0822] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

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

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

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

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

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

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

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

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

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

[0832] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

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

[0834] Primitive polynomial x8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0];

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

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

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

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

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

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

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

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

[0843] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[0844] In aspect 22, an embodiment of the present application provides a communication device having the functionality to implement the method of aspect 21. The functionality 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 functionality of the method described in aspect 20, such as a receiving unit, a processing unit, and the like.

[0845] a receiving unit, configured to receive a first signal, where the first signal is modulated by a terminal device according to a first sequence, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence;

[0846] a processing unit, configured to determine a position of a preamble sequence in the first signal; obtain a data window according to the position of the preamble sequence in the first signal, and demodulate a data signal in the data window;

[0847] 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;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0870] 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:

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

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

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

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

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

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

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

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

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

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

[0881] 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:

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

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

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

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

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

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

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

[0889] Primitive polynomial x6 +x 5 +1, initial value [1, 1, 0, 1, 1, 1];

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

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

[0892] 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:

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

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

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

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

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

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

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

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

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

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

[0903] 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:

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

[0905] Primitive polynomial x 8 +x 5 +x 3 +x 2 +1, initial value [0, 0, 0, 0, 1, 1, 1, 0];

[0906] Primitive polynomial x 8 +x 6 +x 4 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 0, 0, 0, 0];

[0907] 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];

[0908] Primitive polynomial x 8 +x 7 +x 5 +x3 +1, initial value [0, 0, 1, 1, 1, 1, 0];

[0909] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0, 0];

[0910] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[0911] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0912] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[0913] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1, 1].

[0914] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0915] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1].

[0916] In one possible design, the sequences in the second sequence set further 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 [0, 1, 1, 0];

[0918] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0919] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0920] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[0921] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1].

[0922] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0923] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[0924] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[0925] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 1];

[0926] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[0927] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 1];

[0928] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0929] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[0930] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1].

[0931] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0932] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[0933] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0];

[0934] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[0935] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 1, 0];

[0936] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 0, 1];

[0937] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[0938] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 1, 1, 1].

[0939] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0940] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[0941] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 1, 1];

[0942] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 0, 1];

[0943] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 1, 1, 1];

[0944] Primitive polynomial x7 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0];

[0945] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 0, 1];

[0946] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 1, 0];

[0947] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 0].

[0948] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0949] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0];

[0950] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1, 1];

[0951] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[0952] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 0, 0, 0, 0, 1];

[0953] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 0];

[0954] Primitive polynomial x 8 +x 4+x 3 +x 2 +1, initial value [1, 0, 1, 0, 0, 0, 1, 1];

[0955] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 0, 1, 1, 0, 0];

[0956] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 0, 1];

[0957] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 0, 1, 0].

[0958] In aspect 23, an embodiment of the present application also provides a communication device, comprising: a memory and a processor, the processor being used to execute computer instructions stored in the memory, and when the computer instructions are executed, the device executes the method described in aspect 21 or any possible design of aspect 21.

[0959] In aspect 24, an embodiment of the present application also provides a communication device, comprising: a processor and an interface circuit, the processor being used to communicate with other devices through the interface circuit and execute the method described in aspect 21 or any possible design of aspect 21.

[0960] The communication devices described in aspects 22 to 24 above can be applied to network equipment.

[0961] In aspect 25, an embodiment of the present application further provides a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a network device or a chip built into the network device, the network device executes the method described in aspect 21.

[0962] In aspect 26, an embodiment of the present application further provides a computer program product comprising instructions, which, when run on a computer, enables the computer to execute the method described in aspect 21 or any possible design of aspect 21.

[0963] It can be understood that the beneficial effects that can be achieved in the above-mentioned aspects 22 to 26 can be referred to the beneficial effects in aspect 21 and any possible design thereof, and will not be repeated here.

[0964] In aspect 27, an embodiment of the present application also provides a signal processing method, which is applied to a communication system including a network device and a terminal device, wherein the terminal device executes the method described in aspect 15 and any possible design thereof; the network device executes the method described in aspect 21 and any possible design thereof.

[0965] In aspect 28, an embodiment of the present application also provides a communication system, including: a network device and a terminal device; the terminal device executes the method described in aspect 15 and any possible design thereof; the network device executes the method described in aspect 21 and any possible design thereof.

[0966] It can be understood that the beneficial effects that can be achieved in the twenty-seventh and twenty-eighth aspects provided above can refer to the beneficial effects described in the fifteenth and twenty-first aspects, and will not be repeated here.

[0967] In a twenty-ninth aspect, an embodiment of the present application provides 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 inverting and / or reversing the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[0968] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[0969] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0970] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[0971] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[0972] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[0973] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[0974] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[0975] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[0976] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[0977] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[0978] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[0979] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[0980] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[0981] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[0982] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[0983] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[0984] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[0985] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[0986] Primitive polynomial x 4+x 1 +1, initial value [0, 1, 1, 1];

[0987] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[0988] 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:

[0989] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[0990] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[0991] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[0992] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[0993] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[0994] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[0995] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[0996] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[0997] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[0998] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[0999] 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:

[1000] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1001] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1002] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1003] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1004] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1005] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1006] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1007] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1008] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1009] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0];

[1010] 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:

[1011] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1012] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1013] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1014] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[1015] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1016] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1017] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1018] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1019] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1020] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0];

[1021] 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:

[1022] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1023] Primitive polynomial x 8 +x 4 +x 3 +x 2+1, initial value [1, 1, 0, 1, 0, 1, 0];

[1024] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1025] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1026] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1027] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1028] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1029] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1030] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1031] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1032] Based on this method, when a terminal sends a first signal, it can determine a preamble sequence based on an m-sequence. Because the m-sequence is a pre-set primitive polynomial with a minimum number of taps and has good two-dimensional time-frequency correlation detection performance, the complexity of generating the m-sequence at the transceiver can be reduced, and uplink synchronization performance, thereby improving uplink data demodulation performance, can be improved.

[1033] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 0 to the first bit of the m-sequence.

[1034] Based on this possible design, the number of elements in the final preamble sequence can be made even by padding the first bit of the m sequence with 0, thereby meeting the rate matching requirement of the preamble sequence length.

[1035] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1036] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1037] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1038] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1039] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1040] 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.

[1041] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1042] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1043] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1044] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1045] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1046] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1047] 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.

[1048] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1049] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1050] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1051] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1052] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1053] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1054] Primitive polynomial x 5 +x 4 +x 3 +x2 +1, initial value [0, 0, 1, 1, 1];

[1055] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1056] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1057] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1058] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1].

[1059] 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.

[1060] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1061] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[1062] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1063] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1064] Primitive polynomial x 6 +x 5+1, initial value [1, 0, 1, 1, 1, 0];

[1065] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1066] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1067] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1068] 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.

[1069] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1070] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 0];

[1071] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1072] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1073] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1074] Primitive polynomial x7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1075] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1076] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1077] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1078] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0].

[1079] 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.

[1080] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1081] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1082] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1];

[1083] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x1 +1, initial value [0, 0, 1, 1, 1, 0, 1, 0];

[1084] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1085] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1, 1];

[1086] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1087] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1088] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1089] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1];

[1090] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1091] 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.

[1092] In a 30th aspect, an embodiment of the present application provides a communication device having the functionality to implement the method of aspect 29 above. The functionality can be implemented through hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functionality of the method described in aspect 29 above, such as a sending unit, a processing unit, etc.

[1093] a processing unit, 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 inverting and / or reversing the sequence; and modulating the first sequence to obtain a first signal;

[1094] a sending unit, configured to send a first signal;

[1095] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[1096] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1097] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1098] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1099] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1100] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1101] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1102] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1103] Primitive polynomial x 3 +x 1+1, initial value [1, 1, 0];

[1104] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1105] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1106] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1107] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1108] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1109] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1110] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1111] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1112] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1113] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1114] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[1115] 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:

[1116] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1117] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1118] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1119] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1120] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1121] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1122] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1123] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1124] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1125] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[1126] 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:

[1127] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1128] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1129] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1130] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1131] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1132] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1133] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1134] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1135] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1136] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0];

[1137] 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:

[1138] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1139] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1140] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1141] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[1142] Primitive polynomial x 7 +x1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1143] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1144] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1145] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1146] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1147] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0];

[1148] 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:

[1149] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1150] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[1151] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1152] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1153] Primitive polynomial x8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1154] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1155] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1156] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1157] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1158] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1159] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 0 to the first bit of the m-sequence.

[1160] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1161] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1162] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1163] Primitive polynomial x 3 +x2 +1, initial value [1, 0, 0];

[1164] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1165] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1166] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1167] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1168] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1169] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1170] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1171] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1172] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1173] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1174] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1175] Primitive polynomial x5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1176] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1177] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1178] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1179] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1180] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1181] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1].

[1182] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1183] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[1184] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1185] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1186] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1187] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1188] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1189] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1190] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1191] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 0];

[1192] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1193] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1194] Primitive polynomial x 7 +x 5 +x 3 +x1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1195] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1196] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1197] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1198] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1199] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0].

[1200] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1201] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1202] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1];

[1203] 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];

[1204] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1205] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1, 1];

[1206] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1207] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1208] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1209] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1];

[1210] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1211] In aspect 31, an embodiment of the present application also provides a communication device, comprising: a memory and a processor, the processor being used to execute computer instructions stored in the memory, and when the computer instructions are executed, the device executes the method described in aspect 29 or any possible design of aspect 29.

[1212] In aspect 32, an embodiment of the present application also provides a communication device, comprising: a processor and an interface circuit, the processor being used to communicate with other devices through the interface circuit and execute the method described in aspect 29 or any possible design of aspect 29.

[1213] The communication devices described in aspects 30 to 32 above can be applied to terminal equipment.

[1214] In aspect 33, an embodiment of the present application further provides a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a terminal device or in a chip built into the terminal device, the terminal device executes the method described in aspect 29.

[1215] In aspect 34, an embodiment of the present application further provides a computer program product comprising instructions, which, when run on a computer, enables the computer to execute the method described in aspect 29 or any possible design of aspect 29.

[1216] It can be understood that the beneficial effects that can be achieved in the above-mentioned aspects 30 to 34 can be referred to the beneficial effects in the 29th aspect and any possible design thereof, and will not be repeated here.

[1217] In a thirty-fifth aspect, an embodiment of the present application provides a signal processing method, the method comprising: receiving a first signal, where the first signal is 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 inverting and / or reversing the sequence; determining a position of the preamble sequence in the first signal; obtaining a data window based on the position of the preamble in the first signal, and demodulating a data signal within the data window;

[1218] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[1219] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1220] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1221] Primitive polynomial x 3+x 1 +1, initial value [0, 0, 1];

[1222] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1223] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1224] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1225] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1226] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[1227] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1228] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1229] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1230] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1231] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1232] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1233] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1234] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1235] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1236] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1237] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[1238] 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:

[1239] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1240] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1241] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1242] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1243] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1244] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1245] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1246] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1247] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1248] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[1249] 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:

[1250] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1251] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1252] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1253] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1254] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1255] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1256] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1257] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1258] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1259] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0];

[1260] 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:

[1261] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1262] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1263] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1264] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[1265] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1266] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1267] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1268] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1269] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1270] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0];

[1271] 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:

[1272] Primitive polynomial x 8 +x 4 +x 3+x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1273] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[1274] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1275] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1276] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1277] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1278] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1279] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1280] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1281] Primitive polynomial x 8 +x4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1282] Based on this method, when a terminal sends a first signal, it can determine a preamble sequence based on an m-sequence. Because the m-sequence is a pre-set primitive polynomial with a minimum number of taps and has good two-dimensional time-frequency correlation detection performance, the complexity of generating the m-sequence at the transceiver can be reduced, and uplink synchronization performance, thereby improving uplink data demodulation performance, can be improved.

[1283] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 0 to the first bit of the m-sequence.

[1284] Based on this possible design, the number of elements in the final preamble sequence can be made even by padding the first bit of the m sequence with 0, thereby meeting the rate matching requirement of the preamble sequence length.

[1285] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1286] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1287] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1288] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1289] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1290] 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.

[1291] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1292] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1293] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1294] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1295] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1296] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1297] 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.

[1298] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1299] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1300] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1301] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1302] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1303] Primitive polynomial x 5 +x 3 +x 2 +x 1+1, initial value [1, 0, 1, 0, 1];

[1304] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1305] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1306] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1307] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1308] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1309] 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.

[1310] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1311] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[1312] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1313] Primitive polynomial x 6 +x 5 +x 4 +x 1+1, initial value [0, 1, 1, 0, 1, 0];

[1314] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1315] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1316] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1317] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1318] 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.

[1319] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1320] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 0];

[1321] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1322] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1323] Primitive polynomial x 7 +x 5 +x3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1324] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1325] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1326] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1327] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1328] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1329] 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.

[1330] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1331] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1332] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1];

[1333] 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];

[1334] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1335] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1, 1];

[1336] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1337] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1338] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1339] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1];

[1340] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1341] 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.

[1342] In aspect 36, an embodiment of the present application provides a communication device having the functionality to implement the method of aspect 35. The functionality 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 functionality of the method described in aspect 35, such as a receiving unit, a processing unit, and the like.

[1343] a receiving unit, configured to receive a first signal, where the first signal is modulated by a terminal device according to a first sequence, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence;

[1344] a processing unit, configured to determine a position of a preamble sequence in the first signal; obtain a data window according to the position of the preamble sequence in the first signal, and demodulate a data signal in the data window;

[1345] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[1346] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1347] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1348] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1349] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1350] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1351] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1352] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1353] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[1354] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1355] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1356] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1357] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1358] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1359] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1360] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1361] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1362] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1363] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1364] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[1365] 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:

[1366] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1367] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1368] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1369] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1370] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1371] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1372] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1373] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1374] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1375] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[1376] 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:

[1377] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1378] Primitive polynomial x6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1379] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1380] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1381] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1382] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1383] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1384] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1385] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1386] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0];

[1387] 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:

[1388] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1389] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1390] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1391] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[1392] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1393] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1394] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1395] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1396] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1397] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0];

[1398] 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:

[1399] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1400] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[1401] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1402] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1403] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1404] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1405] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1406] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1407] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1408] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1409] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 0 to the first bit of the m-sequence.

[1410] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1411] Primitive polynomial x 3 +x 2+1, initial value [1, 0, 1];

[1412] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1413] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1414] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1415] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1416] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1417] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1418] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1419] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1420] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1421] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1422] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1423] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1424] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1425] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1426] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1427] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1428] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1429] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1430] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1431] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1432] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1433] Primitive polynomial x 6 +x 5+1, initial value [1, 1, 1, 1, 0];

[1434] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1435] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1436] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1437] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1438] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1439] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1440] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1441] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 0];

[1442] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1443] Primitive polynomial x 7 +x6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1444] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1445] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1446] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1447] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1448] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1449] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1450] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1451] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1452] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1+1, initial value [0, 0, 1, 1, 1, 1, 1];

[1453] 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];

[1454] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1455] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1, 1];

[1456] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1457] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1458] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1459] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1];

[1460] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1461] In aspect 37, an embodiment of the present application also provides a communication device, comprising: a memory and a processor, the processor being used to execute computer instructions stored in the memory, and when the computer instructions are executed, the device executes the method described in aspect 35 or any possible design of aspect 35.

[1462] In aspect 38, an embodiment of the present application also provides a communication device, comprising: a processor and an interface circuit, the processor being used to communicate with other devices through the interface circuit and execute the method described in aspect 35 or any possible design of aspect 35.

[1463] The communication devices described in aspects 36 to 38 above can be applied to network equipment.

[1464] In aspect 39, an embodiment of the present application further provides a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a network device or a chip built into the network device, the network device executes the method described in aspect 35.

[1465] In aspect 40, an embodiment of the present application further provides a computer program product comprising instructions, which, when run on a computer, enables the computer to execute the method described in aspect 35 or any possible design of aspect 35.

[1466] It can be understood that the beneficial effects that can be achieved in the above-mentioned aspects 36 to 40 can be referred to the beneficial effects in the 35th aspect and any possible design thereof, and will not be repeated here.

[1467] In the forty-first aspect, an embodiment of the present application also provides a signal processing method, which is applied to a communication system including a network device and a terminal device, wherein the terminal device executes the method described in the twenty-ninth aspect and any possible design thereof; and the network device executes the method described in the thirty-fifth aspect and any possible design thereof.

[1468] In aspect 42, an embodiment of the present application also provides a communication system, including: a network device and a terminal device; the terminal device executes the method described in aspect 29 and any possible design thereof; the network device executes the method described in aspect 35 and any possible design thereof.

[1469] It can be understood that the beneficial effects that can be achieved in the forty-first and forty-second aspects provided above can be referred to the beneficial effects described in the twenty-ninth and thirty-fifth aspects, and will not be repeated here.

[1470] In a forty-third aspect, an embodiment of the present application provides 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 inverting and / or reversing the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[1471] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[1472] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1473] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1474] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1475] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1476] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1477] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1478] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1479] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1480] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1481] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1482] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1483] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1484] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1485] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1486] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1487] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1488] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1489] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1490] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1491] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1492] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1493] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1494] 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:

[1495] Primitive polynomial x5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1496] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1497] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1498] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1499] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1500] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1501] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1502] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1503] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1504] Primitive polynomial x 5 +x 3 +x2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1505] 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:

[1506] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[1507] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1508] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1509] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1510] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1511] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1512] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1513] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1514] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1515] Primitive polynomial x 6 +x1 +1, initial value [1, 0, 1, 1, 1, 0];

[1516] 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:

[1517] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 0];

[1518] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1519] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1520] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1521] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1522] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1523] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1524] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1525] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1526] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1527] 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:

[1528] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1529] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1];

[1530] 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];

[1531] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1532] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1, 1];

[1533] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1534] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1535] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1536] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1];

[1537] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1538] Based on this method, when a terminal sends a first signal, it can determine a preamble sequence based on an 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 and thus improve uplink data demodulation performance.

[1539] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 0 to the first bit of the m-sequence.

[1540] Based on this possible design, the number of elements in the final preamble sequence can be made even by padding the first bit of the m sequence with 0, thereby meeting the rate matching requirement of the preamble sequence length.

[1541] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1542] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0].

[1543] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1544] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1545] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1546] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1547] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1548] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1549] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1].

[1550] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1551] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1552] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1553] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1554] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1555] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1556] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1557] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1558] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1559] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1560] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1561] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0].

[1562] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1563] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1564] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1565] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1566] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1567] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1568] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1569] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1570] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0].

[1571] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1572] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1573] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1574] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1575] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[1576] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1577] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1578] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1579] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1580] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1581] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0].

[1582] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1583] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1584] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1585] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[1586] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1587] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1588] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1589] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1590] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1591] Primitive polynomial x 8 +x 4 +x 3+x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1592] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1593] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1594] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1595] In aspect 44, an embodiment of the present application provides a communication device having the functionality to implement the method of aspect 43 above. The functionality can be implemented via hardware or by hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functionality of the method of aspect 43 above, such as a sending unit, a processing unit, etc.

[1596] a processing unit, 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 inverting and / or reversing the sequence; and modulating the first sequence to obtain a first signal;

[1597] a sending unit, configured to send a first signal;

[1598] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[1599] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1600] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1601] Primitive polynomial x 3 +x 2+1, initial value [1, 0, 1];

[1602] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1603] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1604] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1605] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1606] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1607] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1608] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1609] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1610] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1611] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1612] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1613] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1614] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1615] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1616] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1617] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1618] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1619] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1620] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1621] 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:

[1622] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1623] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1624] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1625] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1626] Primitive polynomial x 5 +x 3 +x2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1627] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1628] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1629] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1630] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1631] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1632] 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:

[1633] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[1634] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1635] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1636] Primitive polynomial x 6 +x5 +1, initial value [1, 0, 1, 1, 1, 0];

[1637] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1638] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1639] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1640] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1641] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1642] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1643] 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:

[1644] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 0];

[1645] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1646] Primitive polynomial x 7 +x 6 +x 4 +x 2+1, initial value [0, 1, 1, 1, 0, 1, 1];

[1647] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1648] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1649] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1650] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1651] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1652] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1653] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1654] 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:

[1655] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1656] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2+x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1];

[1657] 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];

[1658] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1659] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1, 1];

[1660] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1661] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1662] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1663] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1];

[1664] Primitive polynomial x 8 +x 6 +x 5 +x 4+1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1665] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 0 to the first bit of the m-sequence.

[1666] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1667] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0].

[1668] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1669] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1670] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1671] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1672] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1673] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1].

[1674] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1675] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1676] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1677] Primitive polynomial x 5 +x 2+1, initial value [0, 0, 1, 0, 0];

[1678] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1679] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1680] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1681] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1682] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1683] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1684] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0].

[1685] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1686] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1687] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1688] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1689] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1690] Primitive polynomial x6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1691] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1692] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0].

[1693] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1694] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1695] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1696] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[1697] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1698] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1699] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1700] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1701] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1702] Primitive polynomial x 7 +x 1+1, initial value [1, 1, 0, 1, 1, 1, 0].

[1703] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1704] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1705] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[1706] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1707] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1708] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1709] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1710] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1711] Primitive polynomial x 8 +x 4 +x 3 +x 2+1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1712] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1713] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1714] In aspect 45, an embodiment of the present application also provides a communication device, comprising: a memory and a processor, the processor being used to execute computer instructions stored in the memory, and when the computer instructions are executed, the device executes the method described in aspect 43 or any possible design of aspect 43.

[1715] In aspect 46, an embodiment of the present application also provides a communication device, comprising: a processor and an interface circuit, the processor being used to communicate with other devices through the interface circuit and execute the method described in aspect 43 or any possible design of aspect 43.

[1716] The communication devices described in aspects 44 to 46 above can be applied to terminal equipment.

[1717] In aspect 47, an embodiment of the present application further provides a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a terminal device or in a chip built into the terminal device, the terminal device executes the method described in aspect 43.

[1718] In aspect 48, an embodiment of the present application also provides a computer program product comprising instructions, which, when run on a computer, enables the computer to execute the method described in aspect 43 or any possible design of aspect 43.

[1719] It can be understood that the beneficial effects that can be achieved in the above-mentioned aspects 44 to 48 can be referred to the beneficial effects in the 43rd aspect and any possible design thereof, and will not be repeated here.

[1720] In a forty-ninth aspect, an embodiment of the present application provides a signal processing method, the method comprising: receiving a first signal, where the first signal is 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 inverting and / or reversing the sequence; determining a position of the preamble sequence in the first signal; obtaining a data window based on the position of the preamble in the first signal, and demodulating a data signal within the data window;

[1721] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[1722] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1723] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1724] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1725] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1726] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1727] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1728] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1729] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1730] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1731] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1732] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1733] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1734] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1735] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1736] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 1, 0];

[1737] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1738] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1739] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1740] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1741] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1742] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1743] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1744] 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:

[1745] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1746] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1747] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1748] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1749] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1750] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1751] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1752] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1753] Primitive polynomial x 5 +x 4 +x 3 +x 2+1, initial value [1, 1, 0, 1, 1];

[1754] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1755] 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:

[1756] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[1757] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1758] Primitive polynomial x 6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1759] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1760] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1761] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1762] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1763] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1764] Primitive polynomial x 6 +x1 +1, initial value [1, 0, 1, 0, 1, 0];

[1765] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1766] 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:

[1767] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 0];

[1768] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1];

[1769] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1770] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1771] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1772] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1773] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1774] Primitive polynomial x7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1775] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1776] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1777] 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:

[1778] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1779] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1];

[1780] 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];

[1781] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1782] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1, 1];

[1783] Primitive polynomial x 8 +x 7 +x2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1784] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1785] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1786] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 1, 1, 1];

[1787] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1788] Based on this method, when a terminal sends a first signal, it can determine a preamble sequence based on an 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 and thus improve uplink data demodulation performance.

[1789] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 0 to the first bit of the m-sequence.

[1790] Based on this possible design, the number of elements in the final preamble sequence can be made even by padding the first bit of the m sequence with 0, thereby meeting the rate matching requirement of the preamble sequence length.

[1791] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1792] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0].

[1793] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1794] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1795] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1796] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1797] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1798] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1799] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1].

[1800] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1801] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1802] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1803] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1804] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1805] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1806] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1807] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1808] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1809] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1810] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1811] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0].

[1812] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1813] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1814] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1815] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1816] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1817] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1818] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1819] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1820] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0].

[1821] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1822] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1823] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1824] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1825] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[1826] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1827] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1828] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1829] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1830] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1831] Primitive polynomial x7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0].

[1832] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1833] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1834] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1835] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[1836] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1837] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1838] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1839] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1840] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1841] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1842] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1843] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1844] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[1845] In a fiftieth aspect, an embodiment of the present application provides a communication device having the functionality to implement the method of aspect 49. The functionality 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 functionality of the method described in aspect 49, such as a receiving unit, a processing unit, and the like.

[1846] a receiving unit, configured to receive a first signal, where the first signal is modulated by a terminal device according to a first sequence, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence;

[1847] a processing unit, configured to determine a position of a preamble sequence in the first signal; obtain a data window according to the position of the preamble sequence in the first signal, and demodulate a data signal in the data window;

[1848] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[1849] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1850] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1851] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[1852] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1853] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1854] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[1855] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 0];

[1856] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1857] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1858] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[1859] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1860] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1861] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1862] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[1863] Primitive polynomial x 4 +x3 +1, initial value [1, 0, 1, 0];

[1864] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1865] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 0, 1];

[1866] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 1];

[1867] Primitive polynomial x 4 +x 3 +1, initial value [1, 0, 0, 1];

[1868] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1869] Primitive polynomial x 4 +x 3 +1, initial value [0, 0, 1, 0];

[1870] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1871] 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:

[1872] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1873] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1874] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 0];

[1875] Primitive polynomial x 5 +x4 +x 3 +x 1 +1, initial value [0, 0, 0, 1, 1];

[1876] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1];

[1877] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1];

[1878] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[1879] Primitive polynomial x 5 +x 4 +x 3 +x 1 +1, initial value [1, 0, 0, 1, 0];

[1880] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 1];

[1881] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 1];

[1882] 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:

[1883] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[1884] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1885] Primitive polynomial x6 +x 5 +x 4 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[1886] Primitive polynomial x 6 +x 5 +1, initial value [1, 0, 1, 1, 1, 0];

[1887] Primitive polynomial x 6 +x 4 +x 3 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[1888] Primitive polynomial x 6 +x 5 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 1];

[1889] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 0, 0];

[1890] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[1891] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[1892] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 1, 1, 0];

[1893] 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:

[1894] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 1, 1, 0];

[1895] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1+1, initial value [1, 1, 0, 1, 1, 0, 1];

[1896] Primitive polynomial x 7 +x 6 +x 4 +x 2 +1, initial value [0, 1, 1, 1, 0, 1, 1];

[1897] Primitive polynomial x 7 +x 5 +x 3 +x 1 +1, initial value [1, 0, 0, 0, 1, 0, 0];

[1898] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[1899] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 0, 1];

[1900] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 1, 0, 1];

[1901] Primitive polynomial x 7 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[1902] Primitive polynomial x 7 +x 3 +1, initial value [1, 1, 0, 0, 0, 1, 1];

[1903] Primitive polynomial x 7 +x 6 +1, initial value [1, 0, 0, 1, 1, 0, 0];

[1904] 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:

[1905] Primitive polynomial x 8 +x 5 +x 3 +x 1+1, initial value [1, 0, 0, 1, 0, 1, 0, 1];

[1906] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x 2 +x 1 +1, initial value [0, 0, 1, 1, 1, 1, 1];

[1907] 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];

[1908] Primitive polynomial x 8 +x 6 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0, 0, 1, 1];

[1909] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [0, 0, 0, 0, 0, 1, 1];

[1910] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 1, 0, 1, 1, 0, 1, 0];

[1911] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0, 0];

[1912] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 1, 0, 0, 0, 0, 1, 1];

[1913] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1+1, initial value [0, 0, 0, 1, 1, 1, 1];

[1914] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 0, 0, 1, 0, 0, 1, 0].

[1915] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 0 to the first bit of the m-sequence.

[1916] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1917] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0].

[1918] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1919] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 0];

[1920] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[1921] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 0, 1];

[1922] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1923] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1].

[1924] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1925] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 1];

[1926] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[1927] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 0, 0];

[1928] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 0, 1, 0];

[1929] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 0, 0];

[1930] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 1];

[1931] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1932] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 0, 0];

[1933] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 1];

[1934] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0].

[1935] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1936] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 0, 1];

[1937] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 1, 1];

[1938] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[1939] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[1940] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 0];

[1941] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 1, 0, 1];

[1942] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 0, 0, 0].

[1943] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1944] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 0, 0, 1, 1];

[1945] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 1, 0, 0, 1];

[1946] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 0, 0, 0, 1];

[1947] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 1];

[1948] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 1, 1, 0, 1, 0];

[1949] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 0, 1, 1, 1];

[1950] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 1, 0, 1];

[1951] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 0, 0, 1, 1];

[1952] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 1, 1, 0].

[1953] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1954] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[1955] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[1956] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 0, 0, 0];

[1957] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[1958] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 1, 1];

[1959] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 1, 1, 0, 0];

[1960] Primitive polynomial x 8 +x 4 +x 3 +x 2+1, initial value [1, 1, 1, 0, 0, 0, 1, 0];

[1961] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 1, 0, 0];

[1962] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 1, 1, 0, 0, 1, 1, 1];

[1963] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 1, 1, 0, 0].

[1964] In aspect 51, an embodiment of the present application also provides a communication device, comprising: a memory and a processor, the processor being used to execute computer instructions stored in the memory, and when the computer instructions are executed, the device executes the method described in aspect 49 or any possible design of aspect 49.

[1965] In aspect 52, an embodiment of the present application also provides a communication device, comprising: a processor and an interface circuit, the processor being used to communicate with other devices through the interface circuit and execute the method described in aspect 49 or any possible design of aspect 49.

[1966] The communication devices described in aspects 50 to 52 above can be applied to network equipment.

[1967] In aspect 53, an embodiment of the present application also provides a computer-readable storage medium, which stores computer instructions; when the computer instructions are executed in a network device or a chip built into the network device, the network device executes the method described in aspect 49.

[1968] In aspect 54, an embodiment of the present application also provides a computer program product comprising instructions, which, when run on a computer, enables the computer to execute the method described in aspect 49 or any possible design of aspect 49.

[1969] It can be understood that the beneficial effects that can be achieved by the 50th to 54th aspects provided above can be referred to the beneficial effects in the 49th aspect and any possible design thereof, and will not be repeated here.

[1970] In aspect 55, an embodiment of the present application also provides a signal processing method, which is applied to a communication system including a network device and a terminal device, wherein the terminal device executes the method described in aspect 43 and any possible design thereof; and the network device executes the method described in aspect 49 and any possible design thereof.

[1971] In aspect 56, an embodiment of the present application also provides a communication system, including: a network device and a terminal device; the terminal device executes the method described in aspect 43 and any possible design thereof; the network device executes the method described in aspect 49 and any possible design thereof.

[1972] It can be understood that the beneficial effects that can be achieved in the fifty-fifth and fifty-sixth aspects provided above can be referred to the beneficial effects described in the forty-third and forty-ninth aspects, and will not be repeated here.

[1973] In a fifty-seventh aspect, an embodiment of the present application provides 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 inverting and / or reversing the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[1974] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[1975] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1976] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[1977] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[1978] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[1979] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[1980] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[1981] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[1982] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[1983] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[1984] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[1985] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[1986] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[1987] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[1988] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[1989] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[1990] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[1991] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[1992] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[1993] Primitive polynomial x 4+x 1 +1, initial value [1, 1, 0, 1];

[1994] 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:

[1995] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[1996] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0];

[1997] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0];

[1998] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[1999] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1];

[2000] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[2001] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0];

[2002] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[2003] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[2004] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[2005] 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:

[2006] Primitive polynomial x 6 +x1 +1, initial value [1, 1, 0, 1, 1, 0];

[2007] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 0, 1];

[2008] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[2009] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[2010] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0];

[2011] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[2012] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[2013] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[2014] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1];

[2015] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0];

[2016] 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:

[2017] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1];

[2018] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[2019] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0];

[2020] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0];

[2021] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[2022] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1];

[2023] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2024] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[2025] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0];

[2026] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0];

[2027] 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:

[2028] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[2029] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1];

[2030] Primitive polynomial x 8 +x 4 +x3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2031] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0];

[2032] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[2033] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[2034] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1];

[2035] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0];

[2036] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0];

[2037] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

[2038] Based on this method, when a terminal sends a first signal, it can determine a preamble sequence based on an m-sequence. Because the m-sequence is a pre-set primitive polynomial with a minimum number of taps and has good two-dimensional time-frequency correlation detection performance, the complexity of generating the m-sequence at the transceiver can be reduced, and uplink synchronization performance, thereby improving uplink data demodulation performance, can be improved.

[2039] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 1 to the first digit of the m-sequence.

[2040] Based on this possible design, the number of elements in the final preamble sequence can be made even by adding 1 to the first bit of the m sequence, thereby meeting the rate matching requirement of the preamble sequence length.

[2041] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2042] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0];

[2043] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[2044] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[2045] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[2046] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1];

[2047] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1].

[2048] 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.

[2049] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2050] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[2051] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[2052] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0];

[2053] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[2054] 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.

[2055] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2056] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0];

[2057] Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1];

[2058] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1];

[2059] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1];

[2060] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0];

[2061] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0];

[2062] Primitive polynomial x 5 +x 3 +x2 +x 1 +1, initial value [1, 1, 0, 0, 0];

[2063] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1];

[2064] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1].

[2065] 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.

[2066] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2067] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0];

[2068] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1];

[2069] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0];

[2070] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[2071] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1];

[2072] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[2073] Primitive polynomial x 6 +x 5 +x 2 +x 1+1, initial value [0, 1, 0, 1, 0, 0].

[2074] 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.

[2075] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2076] Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1];

[2077] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2078] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0];

[2079] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[2080] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1];

[2081] Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1];

[2082] Primitive polynomial x 7 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0];

[2083] Primitive polynomial x 7 +x 4 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[2084] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1];

[2085] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0].

[2086] 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.

[2087] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2088] 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];

[2089] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[2090] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 1, 1, 0];

[2091] Primitive polynomial x 8 +x 7 +x 6 +x 3 +x2 +x 1 +1, initial value [0, 1, 0, 1, 1, 0, 0, 1];

[2092] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 1, 0];

[2093] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2094] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2095] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2096] Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 1].

[2097] 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.

[2098] In aspect 58, an embodiment of the present application provides a communication device having the functionality to implement the method of aspect 57 above. The functionality can be implemented through hardware or through hardware executing corresponding software. The hardware or software includes one or more units or modules corresponding to the functionality of the method described in aspect 57 above, such as a sending unit, a processing unit, etc.

[2099] a processing unit, 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 inverting and / or reversing the sequence; and modulating the first sequence to obtain a first signal;

[2100] a sending unit, configured to send a first signal;

[2101] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[2102] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2103] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[2104] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[2105] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[2106] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[2107] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[2108] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[2109] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[2110] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2111] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[2112] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[2113] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[2114] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[2115] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[2116] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[2117] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[2118] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[2119] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[2120] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[2121] 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:

[2122] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[2123] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0];

[2124] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0];

[2125] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[2126] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1];

[2127] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[2128] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0];

[2129] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[2130] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[2131] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[2132] 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:

[2133] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[2134] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 0, 1];

[2135] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[2136] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[2137] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0];

[2138] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[2139] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[2140] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[2141] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1];

[2142] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0];

[2143] 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:

[2144] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1];

[2145] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[2146] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0];

[2147] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0];

[2148] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[2149] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1];

[2150] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2151] Primitive polynomial x 7 +x1 +1, initial value [1, 1, 1, 1, 0, 0];

[2152] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0];

[2153] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0];

[2154] 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:

[2155] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[2156] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1];

[2157] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2158] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0];

[2159] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[2160] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[2161] Primitive polynomial x 8 +x4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1];

[2162] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0];

[2163] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0];

[2164] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

[2165] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 1 to the first digit of the m-sequence.

[2166] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2167] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0];

[2168] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[2169] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[2170] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[2171] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1];

[2172] Primitive polynomial x 3 +x 2+1, initial value [1, 0, 1].

[2173] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2174] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[2175] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[2176] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0];

[2177] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[2178] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2179] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0];

[2180] Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1];

[2181] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1];

[2182] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1];

[2183] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0];

[2184] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0];

[2185] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0];

[2186] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1];

[2187] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1].

[2188] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2189] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0];

[2190] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1];

[2191] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0];

[2192] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[2193] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1];

[2194] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[2195] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0, 0].

[2196] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2197] Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1];

[2198] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2199] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0];

[2200] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[2201] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1];

[2202] Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1];

[2203] Primitive polynomial x 7 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0];

[2204] Primitive polynomial x 7 +x 4 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[2205] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1];

[2206] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0].

[2207] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2208] 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];

[2209] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[2210] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 1, 1, 0];

[2211] 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];

[2212] Primitive polynomial x 8 +x 7 +x6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 1, 0];

[2213] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2214] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2215] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2216] Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 1].

[2217] In aspect 59, an embodiment of the present application also provides a communication device, comprising: a memory and a processor, the processor being used to execute computer instructions stored in the memory, and when the computer instructions are executed, the device executes the method described in aspect 57 or any possible design of aspect 57.

[2218] In aspect sixty, an embodiment of the present application also provides a communication device, including: a processor and an interface circuit, the processor being used to communicate with other devices through the interface circuit and execute the method described in aspect fifty-seven or any possible design of aspect fifty-seven.

[2219] The communication devices described in aspects 58 to 60 above can be applied to terminal equipment.

[2220] In aspect sixty-first, an embodiment of the present application further provides a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a terminal device or in a chip built into the terminal device, the terminal device executes the method described in aspect fifty-seven.

[2221] In aspect sixty-second, an embodiment of the present application also provides a computer program product comprising instructions, which, when run on a computer, enables the computer to execute the method described in aspect fifty-seven or any possible design of aspect fifty-seven.

[2222] It can be understood that the beneficial effects that can be achieved in the fifty-eighth to sixty-second aspects provided above can be referred to the beneficial effects in the fifty-seventh aspect and any possible design thereof, and will not be repeated here.

[2223] In a sixty-third aspect, an embodiment of the present application provides a signal processing method, the method comprising: receiving a first signal, where the first signal is 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 inverting and / or reversing the sequence; determining a position of the preamble sequence in the first signal; obtaining a data window based on the position of the preamble sequence in the first signal, and demodulating a data signal within the data window;

[2224] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[2225] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2226] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[2227] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[2228] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[2229] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[2230] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[2231] Primitive polynomial x 3 +x1 +1, initial value [1, 1, 1];

[2232] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[2233] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2234] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[2235] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 0];

[2236] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[2237] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[2238] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[2239] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[2240] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[2241] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[2242] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[2243] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[2244] 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:

[2245] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[2246] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0];

[2247] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0];

[2248] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[2249] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1];

[2250] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[2251] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0];

[2252] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[2253] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[2254] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[2255] 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:

[2256] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[2257] Primitive polynomial x 6 +x 1+1, initial value [0, 1, 0, 1, 0, 1];

[2258] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[2259] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[2260] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0];

[2261] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[2262] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[2263] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[2264] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1];

[2265] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0];

[2266] 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:

[2267] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1];

[2268] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[2269] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0];

[2270] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0];

[2271] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[2272] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1];

[2273] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2274] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[2275] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0];

[2276] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0];

[2277] 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:

[2278] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[2279] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1];

[2280] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2281] Primitive polynomial x 8+x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0];

[2282] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[2283] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[2284] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1];

[2285] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0];

[2286] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0];

[2287] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

[2288] Based on this method, when a terminal sends a first signal, it can determine a preamble sequence based on an m-sequence. Because the m-sequence is a pre-set primitive polynomial with a minimum number of taps and has good two-dimensional time-frequency correlation detection performance, the complexity of generating the m-sequence at the transceiver can be reduced, and uplink synchronization performance, thereby improving uplink data demodulation performance, can be improved.

[2289] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 1 to the first digit of the m-sequence.

[2290] Based on this possible design, the number of elements in the final preamble sequence can be made even by adding 1 to the first bit of the m sequence, thereby meeting the rate matching requirement of the preamble sequence length.

[2291] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2292] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0];

[2293] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[2294] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[2295] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[2296] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1];

[2297] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[2298] 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.

[2299] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2300] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[2301] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[2302] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0];

[2303] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[2304] 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.

[2305] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2306] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0];

[2307] Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1];

[2308] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1];

[2309] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1];

[2310] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0];

[2311] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0];

[2312] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0];

[2313] Primitive polynomial x 5 +x4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1];

[2314] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[2315] 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.

[2316] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2317] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0];

[2318] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1];

[2319] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0];

[2320] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[2321] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1];

[2322] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[2323] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0, 0];

[2324] 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.

[2325] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2326] Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1];

[2327] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2328] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0];

[2329] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[2330] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1];

[2331] Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1];

[2332] Primitive polynomial x 7 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0];

[2333] Primitive polynomial x 7 +x4 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[2334] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1];

[2335] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0];

[2336] 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.

[2337] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2338] 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];

[2339] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[2340] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 1, 1, 0];

[2341] 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];

[2342] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 1, 0];

[2343] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2344] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2345] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2346] Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 1].

[2347] 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.

[2348] In aspect 64, an embodiment of the present application provides a communication device having the functionality to implement the method described in aspect 63. The functionality 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 functionality of the method described in aspect 63, such as a receiving unit, a processing unit, and the like.

[2349] a receiving unit, configured to receive a first signal, where the first signal is modulated by a terminal device according to a first sequence, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence;

[2350] a processing unit, configured to determine a position of a preamble sequence in the first signal; obtain a data window according to the position of the preamble sequence in the first signal, and demodulate a data signal in the data window;

[2351] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[2352] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2353] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[2354] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[2355] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[2356] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[2357] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[2358] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[2359] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1];

[2360] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2361] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[2362] Primitive polynomial x 4 +x 1+1, initial value [0, 1, 0, 0];

[2363] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[2364] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[2365] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[2366] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[2367] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[2368] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[2369] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[2370] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1];

[2371] 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:

[2372] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[2373] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0];

[2374] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0];

[2375] Primitive polynomial x 5 +x 2+1, initial value [1, 0, 1, 1, 0];

[2376] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1];

[2377] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[2378] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0];

[2379] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[2380] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[2381] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 1, 0];

[2382] 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:

[2383] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[2384] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 0, 1];

[2385] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[2386] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[2387] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0];

[2388] Primitive polynomial x 6 +x1 +1, initial value [1, 0, 1, 0, 1, 1];

[2389] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[2390] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[2391] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1];

[2392] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0];

[2393] 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:

[2394] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1];

[2395] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[2396] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0];

[2397] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0];

[2398] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[2399] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1];

[2400] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2401] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[2402] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0];

[2403] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0];

[2404] 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:

[2405] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[2406] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1];

[2407] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2408] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0];

[2409] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[2410] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[2411] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1];

[2412] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0];

[2413] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0];

[2414] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

[2415] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 1 to the first digit of the m-sequence.

[2416] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2417] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0];

[2418] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[2419] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[2420] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[2421] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1];

[2422] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[2423] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2424] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[2425] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[2426] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0];

[2427] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[2428] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2429] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0];

[2430] Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1];

[2431] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1];

[2432] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1];

[2433] Primitive polynomial x 5 +x 3 +x 2 +x 1+1, initial value [1, 1, 1, 1, 0];

[2434] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0];

[2435] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0];

[2436] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1];

[2437] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[2438] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2439] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0];

[2440] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1];

[2441] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0];

[2442] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[2443] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1];

[2444] Primitive polynomial x 6 +x 5+1, initial value [0, 1, 0, 1, 0, 0];

[2445] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0, 0];

[2446] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2447] Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1];

[2448] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2449] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0];

[2450] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[2451] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1];

[2452] Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1];

[2453] Primitive polynomial x 7 +x 5 +x 2 +x 1+1, initial value [0, 0, 0, 1, 0, 1, 0];

[2454] Primitive polynomial x 7 +x 4 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[2455] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1];

[2456] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0];

[2457] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2458] 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];

[2459] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[2460] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 1, 1, 0];

[2461] 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];

[2462] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 1, 0];

[2463] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2464] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2465] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2466] Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 1].

[2467] In aspect sixty-fifth, an embodiment of the present application also provides a communication device, comprising: a memory and a processor, the processor being used to execute computer instructions stored in the memory, and when the computer instructions are executed, the device executes the method described in aspect sixty-third or any possible design of aspect sixty-third.

[2468] In aspect sixty-six, an embodiment of the present application also provides a communication device, including: a processor and an interface circuit, the processor being used to communicate with other devices through the interface circuit and execute the method described in aspect sixty-third or any possible design of aspect sixty-third.

[2469] The communication devices described in aspects 64 to 66 above can be applied to network equipment.

[2470] In aspect sixty-seven, an embodiment of the present application further provides a computer-readable storage medium storing computer instructions; when the computer instructions are executed in a network device or in a chip built into the network device, the network device executes the method described in aspect sixty-three.

[2471] In aspect sixty-eight, an embodiment of the present application also provides a computer program product comprising instructions, which, when run on a computer, enables the computer to execute the method described in aspect sixty-third or any possible design of aspect sixty-third.

[2472] It can be understood that the beneficial effects that can be achieved in the sixty-fourth to sixty-eighth aspects provided above can be referred to the beneficial effects in the sixty-third aspect and any possible design thereof, and will not be repeated here.

[2473] In aspect sixty-ninth, an embodiment of the present application also provides a signal processing method, which is applied to a communication system including a network device and a terminal device, wherein the terminal device executes the method described in aspect fifty-seven and any possible design thereof; and the network device executes the method described in aspect sixty-third and any possible design thereof.

[2474] In aspect seventy, an embodiment of the present application also provides a communication system, including: a network device and a terminal device; the terminal device executes the method described in aspect fifty-seven and any possible design thereof; the network device executes the method described in aspect sixty-third and any possible design thereof.

[2475] It can be understood that the beneficial effects that can be achieved in the sixty-ninth and seventieth aspects provided above can be referred to the beneficial effects described in the fifty-seventh and sixty-third aspects, and will not be repeated here.

[2476] In a seventy-first aspect, an embodiment of the present application provides 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 inverting and / or reversing the sequence; modulating the first sequence to obtain a first signal; and transmitting the first signal;

[2477] The second sequence is determined based on the m-sequence, the number of elements in the second sequence is an even number, 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;

[2478] The sequences in the first sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2479] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 0];

[2480] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 0];

[2481] Primitive polynomial x 3 +x 2 +1, initial value [1, 1, 1];

[2482] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 0];

[2483] Primitive polynomial x 3 +x 2 +1, initial value [0, 0, 1];

[2484] Primitive polynomial x 3 +x 1 +1, initial value [0, 0, 1];

[2485] Primitive polynomial x 3 +x 1 +1, initial value [0, 1, 1];

[2486] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 0];

[2487] Primitive polynomial x 3 +x 2 +1, initial value [0, 1, 1];

[2488] Primitive polynomial x 3 +x 2 +1, initial value [1, 0, 1];

[2489] The sequences in the second sequence set include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2490] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 0, 1];

[2491] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 0];

[2492] Primitive polynomial x 4+x 1 +1, initial value [0, 1, 0, 0];

[2493] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 1, 1];

[2494] Primitive polynomial x 4 +x 3 +1, initial value [1, 1, 0, 0];

[2495] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 0];

[2496] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 1];

[2497] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 1, 1];

[2498] Primitive polynomial x 4 +x 3 +1, initial value [0, 1, 1, 0];

[2499] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 0, 1];

[2500] 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:

[2501] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0];

[2502] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 1];

[2503] Primitive polynomial x 5 +x 3 +1, initial value [0, 0, 0, 0, 1];

[2504] Primitive polynomial x 5 +x 3 +x 2 +x 1+1, initial value [1, 0, 0, 0, 1];

[2505] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1];

[2506] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0];

[2507] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 0, 0];

[2508] Primitive polynomial x 5 +x 3 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 0];

[2509] Primitive polynomial x 5 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 1];

[2510] Primitive polynomial x 5 +x 4 +x 2 +x 1 +1, initial value [0, 0, 1, 0, 1];

[2511] 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:

[2512] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 1, 0];

[2513] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 0, 1, 1, 0];

[2514] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 1, 0, 0, 1];

[2515] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 0, 1];

[2516] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 1, 0, 1, 0];

[2517] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 0, 1, 1, 0];

[2518] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 0];

[2519] Primitive polynomial x 6 +x 5 +1, initial value [1, 1, 1, 1, 1];

[2520] Primitive polynomial x 6 +x 5 +1, initial value [0, 1, 0, 1, 0, 0];

[2521] Primitive polynomial x 6 +x 5 +x 2 +x 1 +1, initial value [0, 1, 0, 1, 0, 0];

[2522] 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:

[2523] Primitive polynomial x 7 +x 6 +1, initial value [1, 1, 1, 0, 0, 1, 1];

[2524] Primitive polynomial x 7 +x 3 +x 2 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2525] Primitive polynomial x 7 +x 6 +x 5 +x 4 +1, initial value [0, 0, 1, 0, 1, 0, 0];

[2526] Primitive polynomial x 7 +x 6 +x5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 0];

[2527] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 1];

[2528] Primitive polynomial x 7 +x 6 +x 5 +x 2 +1, initial value [0, 0, 1, 0, 0, 1, 1];

[2529] Primitive polynomial x 7 +x 5 +x 2 +x 1 +1, initial value [0, 0, 0, 1, 0, 1, 0];

[2530] Primitive polynomial x 7 +x 4 +1, initial value [0, 0, 1, 1, 0, 1, 1];

[2531] Primitive polynomial x 7 +x 6 +x 5 +x 3 +x 2 +x 1 +1, initial value [0, 1, 1, 0, 1, 0, 1];

[2532] Primitive polynomial x 7 +x 6 +x 5 +x 4 +x 2 +x 1 +1, initial value [1, 1, 0, 0, 1, 0, 0];

[2533] 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:

[2534] 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];

[2535] Primitive polynomial x 8 +x 5 +x 3 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1, 0];

[2536] Primitive polynomial x 8 +x 7 +x 5 +x 3 +1, initial value [1, 0, 0, 0, 1, 1, 0];

[2537] 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];

[2538] Primitive polynomial x 8 +x 7 +x 6 +x 5 +x 2 +x 1 +1, initial value [1, 0, 0, 0, 1, 1, 0];

[2539] Primitive polynomial x 8 +x 6 +x 5 +x 4 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2540] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 1, 1, 0, 0, 0, 0];

[2541] Primitive polynomial x 8 +x 7 +x 2 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2542] Primitive polynomial x 8 +x 7 +x 6 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1, 0];

[2543] Primitive polynomial x 8 +x 6 +x 5 +x 2 +1, initial value [1, 1, 0, 0, 0, 0, 1].

[2544] Based on this method, when a terminal sends a first signal, it can determine a preamble sequence based on an 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 and thus improve uplink data demodulation performance.

[2545] In a possible design, the second sequence is determined based on the m-sequence, including: the second sequence is determined by adding 1 to the first digit of the m-sequence.

[2546] Based on this possible design, the number of elements in the final preamble sequence can be made even by adding 1 to the first bit of the m sequence, thereby meeting the rate matching requirement of the preamble sequence length.

[2547] In one possible design, the sequences in the first sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2548] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 0];

[2549] Primitive polynomial x 3 +x 1 +1, initial value [1, 1, 1];

[2550] Primitive polynomial x 3 +x 1 +1, initial value [1, 0, 1].

[2551] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2552] In one possible design, the sequences in the second sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2553] Primitive polynomial x 4 +x 1 +1, initial value [0, 0, 1, 0];

[2554] Primitive polynomial x 4 +x 1 +1, initial value [1, 0, 1, 1];

[2555] Primitive polynomial x 4 +x 1 +1, initial value [0, 1, 1, 0];

[2556] Primitive polynomial x 4 +x 1 +1, initial value [1, 1, 0, 1].

[2557] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2558] In one possible design, the sequences in the third sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2559] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 1, 0, 0];

[2560] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 0, 1, 0];

[2561] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 1, 0];

[2562] Primitive polynomial x 5 +x 2 +1, initial value [1, 1, 0, 1, 1];

[2563] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 0, 1, 1];

[2564] Primitive polynomial x 5 +x 2 +1, initial value [0, 1, 1, 0, 0];

[2565] Primitive polynomial x 5 +x 2 +1, initial value [1, 0, 1, 0, 0];

[2566] Primitive polynomial x 5 +x 2 +1, initial value [0, 0, 1, 1, 0];

[2567] Primitive polynomial x 5 +x 2+1, initial value [0, 1, 1, 1, 0].

[2568] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2569] In one possible design, the sequences in the fourth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2570] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 0, 1, 0, 1];

[2571] Primitive polynomial x 6 +x 1 +1, initial value [0, 1, 0, 1, 1, 0];

[2572] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 1];

[2573] Primitive polynomial x 6 +x 1 +1, initial value [0, 0, 1, 1, 0, 0];

[2574] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 1, 0, 1, 0];

[2575] Primitive polynomial x 6 +x 1 +1, initial value [1, 1, 1, 0, 1, 1];

[2576] Primitive polynomial x 6 +x 1 +1, initial value [1, 0, 0, 0, 0].

[2577] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2578] In one possible design, the sequences in the fifth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2579] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 1, 0, 0, 1, 1];

[2580] Primitive polynomial x7 +x 1 +1, initial value [1, 1, 0, 1, 0, 1, 0];

[2581] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 0, 0, 0];

[2582] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 1, 1, 0];

[2583] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0, 1];

[2584] Primitive polynomial x 7 +x 1 +1, initial value [0, 0, 1, 0, 1, 0, 1];

[2585] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 0, 0, 1, 0];

[2586] Primitive polynomial x 7 +x 1 +1, initial value [1, 1, 1, 1, 0, 0];

[2587] Primitive polynomial x 7 +x 1 +1, initial value [1, 0, 0, 1, 0, 1, 0];

[2588] Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 1, 0, 1, 0].

[2589] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2590] In one possible design, the sequences in the sixth sequence set further include at least one of the m-sequences obtained by combining the following primitive polynomials and initial values:

[2591] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 0, 1, 1, 1, 0, 0, 1];

[2592] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 1, 1];

[2593] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0, 0];

[2594] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 1, 0];

[2595] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 0, 1, 0, 1, 1];

[2596] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 0, 1, 0, 0, 1, 1];

[2597] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [1, 0, 1, 1, 1, 0, 0];

[2598] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 0, 1, 0, 1, 0];

[2599] Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 0, 1, 0, 1, 0, 1].

[2600] Based on this possible design, an m-sequence corresponding to a primitive polynomial with a minimum number of taps can be provided, thereby reducing the complexity of generating the m-sequence at the transmitting and receiving ends.

[2601] In aspect 72, an embodiment of the present application provides a communication device having the functionality to implement the method of aspect 71. The functionality 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 functionality of the method of aspect 71, such as a sending unit, a processing unit, and the like.

[2602] a processing unit, configured to generate a first sequence,...

Claims

1. A signal processing method, characterized in that: include: Generate a first sequence, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence; Modulating the first sequence to obtain a first signal; Sending the first signal: 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 sequence set 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 sequence set 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, 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, 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]; 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, 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, 0, 0, 0]; Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 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, 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, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 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 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: 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].

3. The method according to claim 1 or 2, characterized in that: 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: 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 to 3, characterized in that: The sequences in the third sequence set also include 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 to 4, characterized in that: 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: 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].

6. The method according to any one of claims 1 to 5, characterized in that: The sequences in the fifth sequence set also include 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, 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 to 6, characterized in that: 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: 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]; 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, 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, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence; Modulating the first sequence to obtain a first signal; Sending the first signal: The second sequence is determined according to an m-sequence, the number of elements of the second sequence is an even number, 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 sequence set 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 sequence set 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, 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, 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]; 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 according to the m-sequence, including: the second sequence is determined according to supplementing the first bit of the m-sequence with 0.

10. The method according to claim 8 or 9, characterized in that: 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: 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".

11. The method according to any one of claims 8 to 10, characterized in that: 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: 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].

12. The method according to any one of claims 8 to 11, characterized in that: The sequences in the third sequence set also include 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 to 12, characterized in that: 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: Primitive polynomial x 6 +x 5 +1, initial value [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].

14. The method according to any one of claims 8 to 13, characterized in that: The sequences in the fifth sequence set also include 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, 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].

15. The method according to any one of claims 8 to 14, characterized in that: 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: 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]; 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, 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, 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]; 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, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence; Modulating the first sequence to obtain a first signal; Sending the first signal: The second sequence is determined according to an m-sequence, the number of elements of the second sequence is an even number, 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 sequence set include sequences obtained by combining the following primitive polynomials and initial values ​​respectively. m At least one of the sequences: 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 sequence set include the sequences obtained by combining the following primitive polynomials and initial values ​​respectively: m At least one of the sequences: 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]; The sequences in the fifth sequence set include sequences obtained by combining the following primitive polynomials and initial values ​​respectively. m At least one of the sequences: 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]; 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, 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, 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, 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 according to the m-sequence, including: the second sequence is determined according to adding 1 to the first position of the m-sequence.

18. The method according to claim 16 or 17, characterized in that 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: 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』.

19. The method according to any one of claims 16 to 18, characterized in that: 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: 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].

20. The method according to any one of claims 16 to 19, characterized in that: The sequences in the third sequence set also include 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 to 20, characterized in that: 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: 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, 0]; Primitive polynomial x 6 +x 5 +1, initial value [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 to 21, characterized in that: The sequences in the fifth sequence set also include 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, 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 to 22, characterized in that: 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: 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, 1].

24. A signal processing method, characterized in that: include: Receive a first signal, where the first signal is modulated by a terminal device according to a first sequence, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence; Determining a position of the preamble sequence in the first signal; Acquire a data window according to the position of the preamble sequence in the first signal, and demodulate the data signal in the data window; 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 sequence set 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 sequence set 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, 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, 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]; 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, 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, 0, 0, 0]; Primitive polynomial x 7 +x 1 +1, initial value [0, 1, 0, 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, 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, 1]; Primitive polynomial x 8 +x 4 +x 3 +x 2 +1, initial value [0, 1, 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 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: 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 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: 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 sequences in the third sequence set also include 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 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: 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 sequences in the fifth sequence set also include 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, 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, 0, 1]; 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: 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]; 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, 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: Receive a first signal, where the first signal is modulated by a terminal device according to a first sequence, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence; Determining a position of the preamble sequence in the first signal; Acquire a data window according to the position of the preamble sequence in the first signal, and demodulate the data signal in the data window; The second sequence is determined according to an m-sequence, the number of elements of the second sequence is an even number, 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 sequence set 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 sequence set 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, 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, 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]; 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 according to the m-sequence, including: the second sequence is determined according to supplementing the first bit of the m-sequence with 0.

28. The method according to claim 26 or 27, characterized in that 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: 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 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: 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 sequences in the third sequence set also include 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 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: Primitive polynomial x 6 +x 5 +1, initial value [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 sequences in the fifth sequence set also include 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, 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 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: 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]; 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, 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, 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]; 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: Receive a first signal, where the first signal is modulated by a terminal device according to a first sequence, where the first sequence includes a preamble sequence, where the preamble sequence is a second sequence or an equivalent sequence of the second sequence, where the equivalent sequence is obtained by bitwise inverting and / or reversing the sequence; Determining a position of the preamble sequence in the first signal; Acquire a data window according to the position of the preamble sequence in the first signal, and demodulate the data signal in the data window; The second sequence is determined according to an m-sequence, the number of elements of the second sequence is an even number, 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 sequence set 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 sequence set 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]; 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]; 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, 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, 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, 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 according to the m-sequence, including: the second sequence is determined according to adding 1 to the first position of the m-sequence.

31. The method according to claim 29 or 30, characterized in that 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: 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 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: 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 sequences in the third sequence set also include 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 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: 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, 0]; Primitive polynomial x 6 +x 5 +1, initial value [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 sequences in the fifth sequence set also include 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, 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 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: 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, 1].

32. A signal processing method, characterized in that: Applied to a communication system including a terminal device and a network device, the terminal device executes the method described in any one of claims 1 to 7, and the network device executes the method described in claim 24 or 25; or the terminal device executes the method described in any one of claims 8 to 15, and the network device executes the method described in any one of claims 26 to 28; or the terminal device executes the method described in any one of claims 16 to 23, and the network device executes the method described in any one of claims 29 to 31.

33. A communication device, characterized in that: include: A memory and a processor, the processor being used to execute computer instructions stored in the memory, wherein when the computer instructions are executed, the device executes the method described in any one of claims 1 to 7, or the method described in any one of claims 8 to 15, or the method described in any one of claims 16 to 23, or the method described in claim 24 or 25, or the method described in any one of claims 26 to 28, or the method described in any one of claims 29 to 31.

34. A communication device, characterized in that: include: A processor and an interface circuit, the processor being used to communicate with other devices through the interface circuit and to execute the method described in any one of claims 1 to 7, or the method described in any one of claims 8 to 15, or the method described in any one of claims 16 to 23, or the method described in claim 24 or 25, or the method described in any one of claims 26 to 28, or the method described in any one of claims 29 to 31.

35. A communication system, characterized in that: It includes a terminal device and a network device, the terminal device is used to execute the method described in any one of claims 1 to 7, and the network device is used to execute the method described in claim 24 or 25; or the terminal device is used to execute the method described in any one of claims 8 to 15, and the network device is used to execute the method described in any one of claims 26 to 28; or the terminal device is used to execute the method described in any one of claims 16 to 23, and the network device is used to execute the method described in any one of claims 29 to 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 a chip built into the terminal device, the terminal device executes the method described in any one of claims 1 to 7, or the method described in any one of claims 8 to 15, or the method described in any one of claims 16 to 23; or when the computer instructions are executed in a network device or a chip built into the network device, the network device executes the method described in claim 24 or 25, or the method described in any one of claims 26 to 28, or the method described in any one of claims 29 to 31.

37. A computer program product comprising instructions, characterized in that When it runs on a computer, the computer can execute the method described in any one of claims 1 to 7, or the method described in any one of claims 8 to 15, or the method described in any one of claims 16 to 23, or the method described in claim 24 or 25, or the method described in any one of claims 26 to 28, or the method described in any one of claims 29 to 31.

Images