Communication method, communication apparatus, computer-readable storage medium, and computer program product

Abstract

The present application provides a communication method, a communication apparatus, a computer-readable storage medium, and a computer program product. The method comprises: determining a preamble sequence; sending the preamble sequence, wherein the preamble sequence is any one of the following sequences or an equivalent sequence of any one of the following sequences: [1, 1, -1, 1, 1, -1, -1, -1]; [1, -1, 1, 1, 1, 1, 1, -1]; [1, -1, -1, -1, 1, 1, -1, 1]; or [1, 1, 1, -1, 1, -1, 1, 1]. Because the preamble sequence is a Golay sequence having good autocorrelation properties, a receiving side can perform synchronization on a received signal on the basis of the preamble sequence, thereby improving synchronization detection performance. The receiving side performs synchronization on the received signal on the basis of the preamble sequence, thereby reducing detection complexity.

Description

Communication methods, communication devices, computer-readable storage media and computer program products

[0001] This application claims priority to Chinese Patent Application No. 202510392087.X, filed on March 28, 2025, with the China National Intellectual Property Administration, entitled “Communication Method, Communication Device, Computer-Readable Storage Medium and Computer Program Product”, the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communications, and more particularly to communication methods, communication devices, computer-readable storage media, and computer program products. Background Technology

[0003] With the increasing prevalence of machine-type communication (MTC) and Internet of Things (IoT) communication, the number of connected IoT devices is growing daily. Consequently, the industry's demand for reduced cost and power consumption in IoT devices is becoming increasingly strong. During the 4G era, the 3rd Generation Partnership Project (3GPP) introduced the Narrow Band Internet of Things (NB-IoT) system. Because NB-IoT terminals (i.e., terminals in an NB-IoT system) require external power (e.g., batteries) and have the ability to generate local high-frequency oscillator carriers, these terminals can only achieve milliwatt-level power consumption. With the evolution and development of 5G IoT, the need to support even lower-power terminals in 5G networks and subsequent networks is growing. Radio frequency identification (RFID) technology provides a good technical reference for low power consumption, supporting microwatt-level power consumption. RFID terminals (tags) use low-precision, low-power mid-to-low frequency ring oscillators or receive downlink signals without a local oscillator.

[0004] Given the low power consumption advantage of RFID communication technology, the Ambient Internet of Things (A-IoT) has emerged. A-IoT terminals (i.e., the terminals in A-IoT) use low-precision, low-power, mid-to-low frequency ring oscillators or completely oscillator-less receivers to receive downlink or transmit uplink signals to meet ultra-low power consumption requirements. A-IoT terminals are low-cost, with typical power consumption of approximately 1µW and sampling clock frequency accuracy less than 10^5ppm, making them suitable only for asynchronous transmission mechanisms. Considering both data processing latency and signal propagation latency, the receiving side needs to synchronize the received uplink or downlink signals based on a preamble sequence.

[0005] One approach to synchronizing signals (uplink or downlink signals) on the receiving side based on a preamble sequence is as follows: The receiving side (e.g., a base station) performs sliding detection on the received signal within a sliding window. Synchronizing the received signal based on different preamble sequences can be understood as performing synchronization detection on the received signal according to different preamble sequences to achieve synchronization. When the receiving side synchronizes the received signal based on different preamble sequences, the synchronization detection performance and / or detection complexity vary. Therefore, it is necessary to investigate which preamble sequence to use for synchronizing the received signal to improve synchronization detection performance and / or reduce detection complexity. Summary of the Invention

[0006] This application discloses a communication method, a communication device, a computer-readable storage medium, and a computer program product, which can improve the synchronization detection performance and / or reduce the detection complexity of synchronizing received signals based on a preamble sequence.

[0007] In a first aspect, embodiments of this application provide a communication method. The method is applied to a first communication device and is implemented by the first communication device or a component on the first communication device side (such as a chip, processing system, or functional module in the first communication device). The following description uses the implementation of the first communication device as an example. The method includes: a first communication device determining a preamble sequence; transmitting the preamble sequence, wherein the preamble sequence is any one of the following or an equivalent sequence of any one of the following: [1,1,-1,1,1,-1,-1,-1]; or, [1,-1,1,1,1,1,1,-1]; or, [1,-1,-1,-1,1,1,-1,1]; or, [1,1,1,-1,1,-1,1,1]; the preamble sequence and its equivalent sequence satisfy any one of the following: the preamble sequence is obtained by inverting the elements in its equivalent sequence; the preamble sequence is obtained by reversing the elements in its equivalent sequence; the preamble sequence is obtained by inverting and reversing the elements in its equivalent sequence; the preamble sequence is obtained by replacing -1 with 0 in its equivalent sequence; the preamble sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing the elements. Optionally, the first communication device stores or has access to the preamble sequence. To avoid excessive length, this application only shows examples of some preamble sequences, not all examples.

[0008] Using the first aspect of the method, the first communication device transmits a preamble sequence. Because this preamble sequence has good autocorrelation, for example, its maximum autocorrelation sidelobe is lower than that of existing preamble sequences, the receiving side (i.e., the device receiving the signal carrying the preamble sequence) can improve synchronization detection performance by synchronizing the received signal based on this preamble sequence. Furthermore, synchronizing the received signal based on this preamble sequence reduces detection complexity compared to synchronizing based on existing preamble sequences.

[0009] In one possible design of the first aspect, the first communication device transmits the preamble sequence, comprising: the first communication device transmitting a signal carrying the preamble sequence and data; so that the receiving side synchronizes the received signal based on the preamble sequence, thereby determining the starting position of the data.

[0010] Secondly, embodiments of this application provide another communication method, which is applied to a second communication device. The method is implemented by the second communication device or a component on the side of the second communication device (such as a chip, processing system, or functional module in the second communication device). The following description uses the implementation of the second communication device as an example. The method includes: a second communication device receiving a first signal; synchronizing the received first signal based on a preamble sequence; the preamble sequence being any one of the following or an equivalent sequence of any one of the following: [1,1,-1,1,1,-1,-1,-1]; or, [1,-1,1,1,1,1,1,-1]; or, [1,-1,-1,-1,1,1,-1,1]; or, [1,1,1,-1,1,-1,1,1]; the preamble sequence and its equivalent sequence satisfy any one of the following: the preamble sequence is obtained by inverting the elements in its equivalent sequence; the preamble sequence is obtained by reversing the elements in its equivalent sequence; the preamble sequence is obtained by inverting and reversing the elements in its equivalent sequence; the preamble sequence is obtained by replacing -1 with 0 in its equivalent sequence; the preamble sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing it. Optionally, the first signal is an uplink signal.

[0011] Using the second method, the second communication device synchronizes the received first signal based on a preamble sequence. Since this preamble sequence has good autocorrelation, for example, its maximum autocorrelation sidelobe is lower than that of existing preamble sequences, synchronizing the received signal based on this preamble sequence improves synchronization detection performance. Furthermore, synchronizing the received signal based on this preamble sequence reduces detection complexity compared to synchronizing based on existing preamble sequences.

[0012] In one possible design of the first or second aspect, the leader sequence is [a m+1 ,b m+1 ], the a m+1 and the b m+1 Let W1, W2, and P be a set of Gray complementary sequences determined by sequences [W1], [W2], and [P], where the lengths of all sequences are M, where M is an integer greater than or equal to 1. m,1 W is the m-th element in the sequence [W1]. m,2 W is the m-th element in the sequence [W2]. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0]. It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m a is an integer greater than or equal to 0. m+1 The nth element in is a m+1 (n), the b m+1 The nth element in is b m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) and the b m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0013] When n = 0, δ(n) = 1; when n ≠ 0, δ(n) = 0.

[0014] The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1], and both sequence [W1] and sequence [W2] are [-1,1]; or...

[0015] The leading sequence is [1,-1,1,1,1,1,1,-1], and both sequence [W1] and sequence [W2] are [1,-1]; or,

[0016] The leading sequence is [1,-1,-1,-1,1,1,-1,1], and both sequence [W1] and sequence [W2] are [-1,-1]; or,

[0017] The leading sequence is [1,1,1,-1,1,-1,1,1], and both sequences [W1] and [W2] are [1,1]. Optionally, δ(n) is the impulse function.

[0018] In this design, the leader sequence is [a m+1 ,b m+1 Synchronizing the received signal based on this preamble sequence can reduce detection complexity and improve synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 8.

[0019] In one possible design of the second aspect, the synchronization of the received first signal by the second communication device based on the preamble sequence includes: the second communication device using a correlator to perform correlation detection on the preamble sequence and the received sequence obtained based on the received first signal to obtain a correlation value sequence; determining the end position and / or start position of the preamble sequence in the first signal based on the time corresponding to the maximum value in the correlation value sequence, wherein the correlator includes an M-level register. This is the register depth of the m-th register in the M-level register. Optionally, the correlator further includes an M-level adder and an M-level subtractor for correlation detection of the leader sequence, which is obtained by concatenating a set of complementary Gray sequences. Optionally, the correlator further includes an M-level adder and an M-1-level subtractor for correlation detection of the leader sequence, which is a single generalized Gray sequence [A] = [A0, A1, ..., A...]. N-1 ] = [a M+1 (0),a M+1 (1),…,a M+1 (N-1)]. Optionally, the correlator further includes an M-1 level adder and an M-level subtractor, which are used for correlation detection of a leader sequence, which is a single generalized Gray sequence [B] = [B0, B1, ..., B]. N-1 ] = [b M+1 (0),b M+1 (1),…,b M+1 (N-1)].

[0020] In this design, the second communication device uses a correlator including the aforementioned M-level registers to perform correlation detection on the received first signal based on a preamble sequence. Compared with using a correlator including other M-level registers to perform correlation detection on the received first signal based on a preamble sequence, this reduces the detection complexity.

[0021] In one possible design of the first or second aspect, the leading sequence is a Gray sequence determined based on sequence [W1], sequence [W2], and sequence [P], wherein the lengths of sequence [W1], sequence [W2], and sequence [P] are all M, where M is an integer greater than or equal to 1, and W... m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0,2]. It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m A is an integer greater than or equal to 0, and the nth element in the leading sequence is A. n =a m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0022] Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0;

[0023] The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1], the sequence [W1] is [-1,1,1], and the sequence [W2] is [-1,1,-1]; or...

[0024] The leading sequence is [1,-1,1,1,1,1,1,-1], the sequence [W1] is [1,-1,1], and the sequence [W2] is [1,-1,-1]; or...

[0025] The leading sequence is [1,-1,-1,-1,1,1,-1,1], the sequence [W1] is [-1,-1,1], and the sequence [W2] is [-1,-1,-1]; or...

[0026] The leading sequence is [1,1,1,-1,1,-1,1,1], the sequence [W1] is [1,1,1], and the sequence [W2] is [1,1,-1].

[0027] In this design, synchronizing the received signal based on this preamble sequence reduces detection complexity and improves synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 8.

[0028] Thirdly, embodiments of this application provide another communication method. This method is applied to a first communication device and is implemented by the first communication device or a component on the first communication device side (e.g., a chip, processing system, or functional module in the first communication device). The following description uses an implementation by a first communication device as an example. The method includes: the first communication device determining a preamble sequence; and sending the preamble sequence, wherein the preamble sequence is any one of the following or an equivalent sequence of any one of the following:

[0029] [1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,1]; or,

[0030] [1,-1,1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,1]; or,

[0031] [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0032] [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,1]; or,

[0033] [1,1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1]; or,

[0034] [1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,1,-1]; or,

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

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

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

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

[0039] [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1]; or,

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

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

[0042] [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1]; or,

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

[0044] [1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,1,-1,1,1]; or,

[0045] [1,1,-1,1,-1,1,1,1,1,1,1,1,-1,-1,1,-1,-1]; or,

[0046] [1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,-1]; or,

[0047] [1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1]; or,

[0048] [1,1,1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1]; or,

[0049] [1,1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1]; or,

[0050] [1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1]; or,

[0051] [1,1,-1,-1,-1,1,-1,1,-1,1,1,1,1,-1,1,-1,1,-1]; or,

[0052] [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1]; or,

[0053] [1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1]; or,

[0054] [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,1]; or,

[0055] [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1]; or,

[0056] [1,-1,1,1,1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1]; or,

[0057] [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1]; or,

[0058] [1,-1,-1,-1,1,-1,1,1,1,1,-1,1,1,1,-1,1,1,1,-1]; or,

[0059] [1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1]; or,

[0060] [1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1]; or,

[0061] [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1]; or,

[0062] [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1]; or,

[0063] [1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1]; or,

[0064] [1,-1,1,-1,1,1,-1,-1,1,1,1,1,-1,-1,-1,1]; or,

[0065] [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1]; or,

[0066] [1,-1,1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1,1,-1]; or,

[0067] [1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1]; or,

[0068] [1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1];

[0069] The leading sequence and its equivalent sequence satisfy any of the following: the leading sequence is obtained by inverting the elements in its equivalent sequence; the leading sequence is obtained by reversing the elements in its equivalent sequence; the leading sequence is obtained by inverting and reversing the elements in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing it. Optionally, the first communication device is an A-IoT terminal.

[0070] Using a third approach, the first communication device transmits a preamble sequence. Because this preamble sequence has good autocorrelation, for example, its maximum autocorrelation sidelobe is lower than that of existing preamble sequences, the receiving side (i.e., the device receiving the signal carrying this preamble sequence) can improve synchronization detection performance by synchronizing the received signal based on this preamble sequence. Furthermore, synchronizing the received signal based on this preamble sequence reduces detection complexity compared to synchronizing based on existing preamble sequences.

[0071] Fourthly, embodiments of this application provide another communication method applied to a second communication device. This method is implemented by the second communication device or a component on the second communication device side (e.g., a chip, processing system, or functional module in the second communication device). The following description uses an implementation by a second communication device as an example. The method includes: the second communication device receiving a first signal; synchronizing the received first signal based on a preamble sequence, wherein the preamble sequence is any one of the following or an equivalent sequence of any one of the following:

[0072] [1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,1]; or,

[0073] [1,-1,1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,1]; or,

[0074] [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

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

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

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

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

[0079] [1,1,1,-1,1,-1,1,1,1,1,1,-1,-1,1,-1,-1,-1]; or,

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

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

[0082] [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1]; or,

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

[0084] [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,1,1]; or,

[0085] [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1]; or,

[0086] [1,-1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1]; or,

[0087] [1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,1,-1,1,1]; or,

[0088] [1,1,-1,1,-1,1,1,1,1,1,1,1,-1,-1,1,-1,-1]; or,

[0089] [1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,-1]; or,

[0090] [1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1]; or,

[0091] [1,1,1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1]; or,

[0092] [1,1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1]; or,

[0093] [1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1]; or,

[0094] [1,1,-1,-1,-1,1,-1,1,-1,1,1,1,1,-1,1,-1,1,-1]; or,

[0095] [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1]; or,

[0096] [1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1]; or,

[0097] [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,1]; or,

[0098] [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1]; or,

[0099] [1,-1,1,1,1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1]; or,

[0100] [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1]; or,

[0101] [1,-1,-1,-1,1,-1,1,1,1,1,-1,1,1,1,-1,1,1,1,-1]; or,

[0102] [1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1]; or,

[0103] [1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1]; or,

[0104] [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1]; or,

[0105] [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1]; or,

[0106] [1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1]; or,

[0107] [1,-1,1,-1,1,1,-1,-1,1,1,1,1,-1,-1,-1,1]; or,

[0108] [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1]; or,

[0109] [1,-1,1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1,1,-1]; or,

[0110] [1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1]; or,

[0111] [1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1];

[0112] The preamble sequence and its equivalent sequence satisfy any of the following: the preamble sequence is obtained by inverting the elements in its equivalent sequence; the preamble sequence is obtained by reversing the elements in its equivalent sequence; the preamble sequence is obtained by inverting and reversing the elements in its equivalent sequence; the preamble sequence is obtained by replacing -1 with 0 in its equivalent sequence; the preamble sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing it. Optionally, the first signal is an uplink signal.

[0113] The fourth method involves the second communication device synchronizing the received first signal based on a preamble sequence. Because this preamble sequence possesses good autocorrelation characteristics—for example, its maximum autocorrelation sidelobe is lower than that of existing preamble sequences—synchronizing the received signal based on this preamble sequence improves synchronization detection performance. Furthermore, synchronizing the received signal based on this preamble sequence reduces detection complexity compared to synchronizing based on existing preamble sequences.

[0114] In one possible design of the third or fourth aspect, the leader sequence is [a m+1 ,b m+1 ], the a m+1 and the b m+1 Let W1, W2, and P be a set of Gray complementary sequences determined by sequences [W1], [W2], and [P], where the lengths of all sequences are M, where M is an integer greater than or equal to 1. m,1 W is the m-th element in the sequence [W1]. m,2 W is the m-th element in the sequence [W2]. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0]. It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m a is an integer greater than or equal to 0. m+1 The nth element in is a m+1 (n), the b m+1 The nth element in is b m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) and the b m+1(n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0115] Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0;

[0116] The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,1,1,1], the sequences [W1] and [W2] are both [-1,1,1], and the sequence [P] is [1,0,2]; or...

[0117] The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [1,0,2]; or...

[0118] The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [1,0,2]; or...

[0119] The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,-1,1,1,1], the sequences [W1] and [W2] are both [1,1,-1], and the sequence [P] is [1,0,2]; or...

[0120] The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,1,-1], and the sequence [P] is [1,0,2]; or...

[0121] The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,1,-1,1,1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [1,0,2]; or...

[0122] The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [1,0,2]; or...

[0123] The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,1,-1,-1,-1,1,-1,-1], the sequences [W1] and [W2] are both [1,1,1], and the sequence [P] is [1,0,2]; or...

[0124] The leading sequence is [1,1,-1,1,1,1,1,-1,1,1,-1,1,1,-1,1,-1,-1,-1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [0,1,2]; or...

[0125] The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [0,1,2]; or...

[0126] The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [0,1,2]; or...

[0127] The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [0,1,2]; or...

[0128] The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,1,-1,1,1,1], the sequences [W1] and [W2] are both [-1,1,1], and the sequence [P] is [2,0,1]; or...

[0129] The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [2,0,1]; or...

[0130] The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [2,0,1]; or...

[0131] The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,1], the sequences [W1] and [W2] are both [1,1,-1], and the sequence [P] is [2,0,1]; or...

[0132] The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,1,1,-1,-1,1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,1,-1], and the sequence [P] is [2,0,1]; or...

[0133] The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,1,-1,1,1,1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [2,0,1]; or...

[0134] The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [2,0,1]; or...

[0135] The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,-1,1,1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,1], and the sequence [P] is [2,0,1]; or...

[0136] The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [0,2,1]; or...

[0137] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [0,2,1]; or...

[0138] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [0,2,1]; or...

[0139] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [0,2,1]; or...

[0140] The leading sequence is [1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,1], the sequences [W1] and [W2] are both [-1,1,1], and the sequence [P] is [2,1,0]; or...

[0141] The leading sequence is [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [2,1,0]; or...

[0142] The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [2,1,0]; or...

[0143] The leading sequence is [1,-1,1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,1,-1], and the sequence [P] is [2,1,0]; or...

[0144] The leading sequence is [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1], the sequences [W1] and [W2] are both [-1,1,-1], and the sequence [P] is [2,1,0]; or...

[0145] The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [2,1,0]; or...

[0146] The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [2,1,0]; or...

[0147] The leading sequence is [1,1,1,-1,1,1,-1,1,1,-1,1,1,1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,1], and the sequence [P] is [2,1,0]; or...

[0148] The leading sequence is [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1,1], the sequences [W1] and [W2] are both [-1,1,1], and the sequence [P] is [1,2,0]; or...

[0149] The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [1,2,0]; or...

[0150] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [1,2,0]; or...

[0151] The leading sequence is [1,-1,1,-1,1,1,-1,-1,1,1,1,1,1,-1,-1,-1,1], the sequences [W1] and [W2] are both [1,1,-1], and the sequence [P] is [1,2,0]; or...

[0152] The leading sequence is [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1], the sequences [W1] and [W2] are both [-1,1,-1], and the sequence [P] is [1,2,0]; or...

[0153] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [1,2,0]; or...

[0154] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [1,2,0]; or...

[0155] The leading sequence is [1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,1], and the sequence [P] is [1,2,0].

[0156] In this design, the leader sequence is [a m+1 ,b m+1 Synchronizing the received signal based on this preamble sequence can reduce detection complexity and improve synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 16.

[0157] In one possible design of the fourth aspect, the synchronization of the received first signal by the second communication device based on the preamble sequence includes: the second communication device using a correlator to perform correlation detection on the received first signal based on the preamble sequence to obtain a correlation value sequence; determining the end position and / or start position of the signal carrying the preamble sequence in the first signal based on the time corresponding to the maximum value in the correlation value sequence, wherein the correlator includes an M-level register. It is the register depth of the m-th register in the M-level register.

[0158] In this design, the second communication device uses a correlator including the aforementioned M-level registers to perform correlation detection on the received first signal based on a preamble sequence. Compared with using a correlator including other M-level registers to perform correlation detection on the received first signal based on a preamble sequence, this reduces the detection complexity.

[0159] In one possible design of the third or fourth aspect, the leading sequence is a Gray sequence determined based on sequence [W1], sequence [W2], and sequence [P], wherein the lengths of sequence [W1], sequence [W2], and sequence [P] are all M, where M is an integer greater than or equal to 1, and W... m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m The m-th element in the sequence [P] It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m A is an integer greater than or equal to 0, and the nth element in the leading sequence is A. n =a m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0160] Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0;

[0161] The leading sequence is [1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [1,0,2,3]; or...

[0162] The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [1,0,2,3]; or...

[0163] The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [1,0,2,3]; or...

[0164] The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,-1,1,1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [1,0,2,3]; or...

[0165] The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [1,0,2,3]; or...

[0166] The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,1,-1,1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [1,0,2,3]; or...

[0167] The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [1,0,2,3]; or...

[0168] The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,1,-1,-1,-1,1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [1,0,2,3]; or...

[0169] The leading sequence is [1,1,-1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [0,1,2,3]; or...

[0170] The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [0,1,2,3]; or...

[0171] The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [0,1,2,3]; or...

[0172] The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [0,1,2,3]; or...

[0173] The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [2,0,1,3]; or...

[0174] The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [2,0,1,3]; or...

[0175] The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [2,0,1,3]; or...

[0176] The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [2,0,1,3]; or...

[0177] The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,1,1,-1,-1,1,-1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [2,0,1,3]; or...

[0178] The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,1,-1,1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [2,0,1,3]; or...

[0179] The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [2,0,1,3]; or...

[0180] The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,-1,1,1,-1,-1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [2,0,1,3]; or...

[0181] The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [0,2,1,3]; or...

[0182] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [0,2,1,3]; or...

[0183] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [0,2,1,3]; or...

[0184] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [0,2,1,3]; or...

[0185] The leading sequence is [1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,-1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [2,1,0],3; or...

[0186] The leading sequence is [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [2,1,0,3]; or...

[0187] The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [2,1,0,3]; or...

[0188] The leading sequence is [1,-1,1,1,1,-1,-1,-1,1,1,1,-1,1,1,-1,1,-1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [2,1,0,3]; or...

[0189] The leading sequence is [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [2,1,0,3]; or...

[0190] The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [2,1,0,3]; or...

[0191] The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [2,1,0,3]; or...

[0192] The leading sequence is [1,1,1,-1,1,1,-1,1,1,-1,1,1,1,-1,-1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [2,1,0,3]; or...

[0193] The leading sequence is [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [1,2,0,3]; or...

[0194] The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [1,2,0,3]; or...

[0195] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [1,2,0,3]; or...

[0196] The leading sequence is [1,-1,1,-1,1,1,-1,-1,1,1,1,1,-1,-1,-1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [1,2,0,3]; or...

[0197] The leading sequence is [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,1,-1,1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [1,2,0,3]; or...

[0198] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [1,2,0,3]; or...

[0199] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [1,2,0,3]; or...

[0200] The leading sequence is [1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,1,-1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [1,2,0,3].

[0201] In this design, synchronizing the received signal based on this preamble sequence reduces detection complexity and improves synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 16.

[0202] Fifthly, embodiments of this application provide another communication method. This method is applied to a first communication device and is implemented by the first communication device or a component on the first communication device side (e.g., a chip, processing system, or functional module in the first communication device). The following description uses an implementation by a first communication device as an example. The method includes: the first communication device determining a preamble sequence; and sending the preamble sequence, wherein the preamble sequence is any one of the following or an equivalent sequence of any one of the following:

[0203] [1,1,1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0204] [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,1,1]; or,

[0205] [1,-1,1,-1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0206] [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0207] [1,1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1]; or,

[0208] [1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,-1,-1,-1]; or,

[0209] [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,-1]; or,

[0210] [1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0211] [1,1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0212] [1,1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0213] [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1]; or,

[0214] [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0215] [1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0216] [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1]; or,

[0217] [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1]; or,

[0218] [1,-1,1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,1]; or,

[0219] [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,-1,-1,-1]; or,

[0220] [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,-1,-1,-1]; or,

[0221] [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0222] [1,1,1,1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1]; or,

[0223] [1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0224] [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,1]; or,

[0225] [1,-1,1,-1,-1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,1]; or,

[0226] [1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0227] [1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1]; or,

[0228] [1,1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,1,-1,-1,1,1,-1,-1]; or,

[0229] [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1]; or,

[0230] [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0231] [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0232] [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,-1,1,1,1]; or,

[0233] [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0234] [1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0235] [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,1]; or,

[0236] [1,-1,1,-1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,-1,-1]; or,

[0237] [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,1,1,1,1,-1,1,-1,1,-1]; or,

[0238] [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1];

[0239] The leading sequence and its equivalent sequence satisfy any of the following: the leading sequence is obtained by inverting the elements in its equivalent sequence; the leading sequence is obtained by reversing the elements in its equivalent sequence; the leading sequence is obtained by inverting and reversing the elements in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing it. Optionally, the first communication device is an A-IoT terminal.

[0240] Using the fifth aspect of the method, the first communication device transmits a preamble sequence. Because this preamble sequence has good autocorrelation, for example, its maximum autocorrelation sidelobe is lower than that of existing preamble sequences, the receiving side (i.e., the device receiving the signal carrying this preamble sequence) can improve synchronization detection performance by synchronizing the received signal based on this preamble sequence. Furthermore, synchronizing the received signal based on this preamble sequence reduces detection complexity compared to synchronizing based on existing preamble sequences.

[0241] Sixthly, embodiments of this application provide another communication method applied to a second communication device. This method is implemented by the second communication device or a component on the second communication device side (e.g., a chip, processing system, or functional module in the second communication device). The following description uses an implementation by a second communication device as an example. The method includes: the second communication device receiving a first signal; synchronizing the received first signal based on a preamble sequence, wherein the preamble sequence is any one of the following or an equivalent sequence of any one of the following:

[0242] [1,1,1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0243] [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,1,1]; or,

[0244] [1,-1,1,-1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0245] [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0246] [1,1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1]; or,

[0247] [1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,-1,-1,-1]; or,

[0248] [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,-1]; or,

[0249] [1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0250] [1,1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0251] [1,1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0252] [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1]; or,

[0253] [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0254] [1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0255] [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1]; or,

[0256] [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1]; or,

[0257] [1,-1,1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,1]; or,

[0258] [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,-1,-1,-1]; or,

[0259] [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,-1,-1,-1]; or,

[0260] [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0261] [1,1,1,1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1]; or,

[0262] [1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0263] [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,1]; or,

[0264] [1,-1,1,-1,-1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,1]; or,

[0265] [1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0266] [1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1]; or,

[0267] [1,1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,1,-1,-1,1,1,-1,-1]; or,

[0268] [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1]; or,

[0269] [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0270] [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0271] [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,-1,1,1,1]; or,

[0272] [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0273] [1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0274] [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,1]; or,

[0275] [1,-1,1,-1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,-1,-1]; or,

[0276] [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,1,1,1,1,-1,1,-1,1,-1]; or,

[0277] [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1];

[0278] The preamble sequence and its equivalent sequence satisfy any of the following: the preamble sequence is obtained by inverting the elements in its equivalent sequence; the preamble sequence is obtained by reversing the elements in its equivalent sequence; the preamble sequence is obtained by inverting and reversing the elements in its equivalent sequence; the preamble sequence is obtained by replacing -1 with 0 in its equivalent sequence; the preamble sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing it. Optionally, the first signal is an uplink signal.

[0279] Using the sixth aspect of the method, the second communication device synchronizes the received first signal based on a preamble sequence. Since this preamble sequence has good autocorrelation, for example, its maximum autocorrelation sidelobe is lower than that of existing preamble sequences, synchronizing the received signal based on this preamble sequence by the second communication device can improve synchronization detection performance. Furthermore, synchronizing the received signal based on this preamble sequence by the second communication device can reduce detection complexity compared to synchronizing based on existing preamble sequences.

[0280] In one possible design of the fifth or sixth aspect, the leader sequence is [a m+1 ,b m+1 ], the a m+1 and the b m+1 Let W1, W2, and P be a set of Gray complementary sequences determined by sequences [W1], [W2], and [P], where the lengths of all sequences are M, where M is an integer greater than or equal to 1. m,1 W is the m-th element in the sequence [W1]. m,2 W is the m-th element in the sequence [W2]. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0]. It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m a is an integer greater than or equal to 0. m+1 The nth element in is a m+1 (n), the b m+1 The nth element in is b m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) and the b m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0281] Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0;

[0282] The leading sequence is [1,1,1,1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,-1,1], and the sequence [P] is [2,0,3,1]; or...

[0283] The leading sequence is [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,1,1,1,1], the sequences [W1] and [W2] are both [-1,1,-1,1], and the sequence [P] is [2,0,3,1]; or...

[0284] The leading sequence is [1,-1,1,-1,1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,-1,-1,1], and the sequence [P] is [2,0,3,1]; or...

[0285] The leading sequence is [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,-1,1], and the sequence [P] is [2,0,3,1]; or...

[0286] The leading sequence is [1,1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,1,1,-1,1,-1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [1,1,-1,-1], and the sequence [P] is [2,0,3,1]; or...

[0287] The leading sequence is [1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,-1], the sequences [W1] and [W2] are both [-1,1,-1,-1], and the sequence [P] is [2,0,3,1]; or...

[0288] The leading sequence is [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,-1,-1,1,1,-1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1,-1], and the sequence [P] is [2,0,3,1]; or...

[0289] The leading sequence is [1,-1,-1,1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1,-1], and the sequence [P] is [2,0,3,1]; or...

[0290] The leading sequence is [1,1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,1,1,1], and the sequence [P] is [2,1,3,0]; or...

[0291] The leading sequence is [1,1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,-1,1], and the sequence [P] is [2,1,3,0]; or...

[0292] The leading sequence is [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1], the sequences [W1] and [W2] are both [-1,1,-1,1], and the sequence [P] is [2,1,3,0]; or...

[0293] The leading sequence is [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [1,-1,-1,1], and the sequence [P] is [2,1,3,0]; or...

[0294] The leading sequence is [1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,-1,1], and the sequence [P] is [2,1,3,0]; or...

[0295] The leading sequence is [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1,1,-1], the sequences [W1] and [W2] are both [1,1,1,-1], and the sequence [P] is [2,1,3,0]; or...

[0296] The leading sequence is [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,1,-1,1], the sequences [W1] and [W2] are both [-1,1,1,-1], and the sequence [P] is [2,1,3,0]; or...

[0297] The leading sequence is [1,-1,1,-1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,1,-1,-1], and the sequence [P] is [2,1,3,0]; or...

[0298] The leading sequence is [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,1,-1], the sequences [W1] and [W2] are both [-1,1,-1,-1], and the sequence [P] is [2,1,3,0]; or...

[0299] The leading sequence is [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,1,1,1,-1,1,-1,1,-1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1,-1], and the sequence [P] is [2,1,3,0]; or...

[0300] The leading sequence is [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1,-1], and the sequence [P] is [2,1,3,0]; or...

[0301] The leading sequence is [1,1,1,1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1], the sequences [W1] and [W2] are both [1,1,1,1], and the sequence [P] is [2,1,3,0]; or...

[0302] The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,-1,1], and the sequence [P] is [3,0,2,1]; or...

[0303] The leading sequence is [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,1,-1,1,1,-1,1,1,1,1], the sequences [W1] and [W2] are both [-1,1,-1,1], and the sequence [P] is [3,0,2,1]; or...

[0304] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,-1,-1,1], and the sequence [P] is [3,0,2,1]; or...

[0305] The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,-1,1], and the sequence [P] is [3,0,2,1]; or...

[0306] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [1,1,-1,-1], and the sequence [P] is [3,0,2,1]; or...

[0307] The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1], the sequences [W1] and [W2] are both [-1,1,-1,-1], and the sequence [P] is [3,0,2,1]; or...

[0308] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,1,1,1,1,-1,1,-1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1,-1], and the sequence [P] is [3,0,2,1]; or...

[0309] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1,-1], and the sequence [P] is [3,0,2,1]; or...

[0310] The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,-1,1], and the sequence [P] is [3,1,2,0]; or...

[0311] The leading sequence is [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1], the sequences [W1] and [W2] are both [-1,1,-1,1], and the sequence [P] is [3,1,2,0]; or...

[0312] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [1,-1,-1,1], and the sequence [P] is [3,1,2,0]; or...

[0313] The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,-1,1], and the sequence [P] is [3,1,2,0]; or...

[0314] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,1,-1,-1], and the sequence [P] is [3,1,2,0]; or...

[0315] The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,1,-1,1,-1], the sequences [W1] and [W2] are both [-1,1,-1,-1], and the sequence [P] is [3,1,2,0]; or...

[0316] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1,-1], and the sequence [P] is [3,1,2,0]; or...

[0317] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1,-1], and the sequence [P] is [3,1,2,0].

[0318] In this design, the leader sequence is [a m+1 ,b m+1 Synchronizing the received signal based on this preamble sequence can reduce detection complexity and improve synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 32.

[0319] In one possible design of the sixth aspect, the synchronization of the received first signal by the second communication device based on the preamble sequence includes: the second communication device using a correlator to perform correlation detection on the received first signal based on the preamble sequence to obtain a correlation value sequence; determining the end position and / or start position of the signal carrying the preamble sequence in the first signal based on the time corresponding to the maximum value in the correlation value sequence, wherein the correlator includes an M-level register. It is the register depth of the m-th register in the M-level register.

[0320] In this design, the second communication device uses a correlator including the aforementioned M-level registers to perform correlation detection on the received first signal based on a preamble sequence. Compared with using a correlator including other M-level registers to perform correlation detection on the received first signal based on a preamble sequence, this reduces the detection complexity.

[0321] In one possible design of the fifth or sixth aspect, the leading sequence is a Gray sequence determined based on sequence [W1], sequence [W2], and sequence [P], wherein the lengths of sequence [W1], sequence [W2], and sequence [P] are all M, where M is an integer greater than or equal to 1, and W... m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m The m-th element in the sequence [P] It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m A is an integer greater than or equal to 0, and the nth element in the leading sequence is A. n =a m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0322] Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0;

[0323] The leading sequence is [1,1,1,1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0324] The leading sequence is [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0325] The leading sequence is [1,-1,1,-1,1,1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,-1,-1,1,1], the sequence [W2] is [1,-1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0326] The leading sequence is [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0327] The leading sequence is [1,1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,1,-1,1,-1,-1,-1,-1,1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0328] The leading sequence is [1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,-1,1,-1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0329] The leading sequence is [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0330] The leading sequence is [1,-1,-1,1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0331] The leading sequence is [1,1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,1,1,1,1], the sequence [W2] is [-1,1,1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0332] The leading sequence is [1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0333] The leading sequence is [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0334] The leading sequence is [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1], the sequence [W1] is [1,-1,-1,1,1], the sequence [W2] is [1,-1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0335] The leading sequence is [1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0336] The leading sequence is [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1,1,-1], the sequence [W1] is [1,1,1,-1,1], the sequence [W2] is [1,1,1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0337] The leading sequence is [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,1,1,-1,-1,1,-1,1,-1,1,-1,1], the sequence [W1] is [-1,1,1,-1,1], the sequence [W2] is [-1,1,1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0338] The leading sequence is [1,-1,1,-1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0339] The leading sequence is [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0340] The leading sequence is [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0341] The leading sequence is [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0342] The leading sequence is [1,1,1,1,1,1,-1,-1,1,-1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1], the sequence [W1] is [1,1,1,1,1], the sequence [W2] is [1,1,1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0343] The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0344] The leading sequence is [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0345] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1], the sequence [W1] is [1,-1,-1,1,1], the sequence [W2] is [1,-1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0346] The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0347] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0348] The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0349] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,1,1,1,1,-1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0350] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0351] The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0352] The leading sequence is [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0353] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1], the sequence [W1] is [1,-1,-1,1,1], the sequence [W2] is [1,-1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0354] The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0355] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,1,-1,1,-1,-1,1,-1,1,-1,1,-1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0356] The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,1,-1,1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0357] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,1,1,-1,1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0358] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4].

[0359] In this design, synchronizing the received signal based on this preamble sequence reduces detection complexity and improves synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 32.

[0360] In a seventh aspect, embodiments of this application provide another communication device that has the function of implementing the behavior described in the first aspect method embodiment. The communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. The function of the communication device can be implemented by hardware or by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the above functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the processing module is used to determine a preamble sequence; the transceiver module is used to send the preamble sequence, the preamble sequence being any one of the following or an equivalent sequence of any one of the following: [1,1,-1,1,1,-1,-1,-1]; or, [1,-1,1,1,1,1,1,-1]; or, [1,-1,-1,-1,1,1,1,-1,1]; or, [1, 1,1,-1,1,-1,1,1; the leading sequence and its equivalent sequence satisfy any one of the following: the leading sequence is obtained by inverting the elements in its equivalent sequence; the leading sequence is obtained by reversing the elements in its equivalent sequence; the leading sequence is obtained by inverting and reversing the elements in its equivalent sequence; the leading sequence is obtained by replacing -1 in its equivalent sequence with 0; the leading sequence is obtained by replacing -1 in its equivalent sequence with 0 and then inverting and / or reversing it.

[0361] For possible implementations of the communication device in the seventh aspect, please refer to the various possible implementations in the first aspect.

[0362] For the technical effects of the various possible implementations of the seventh aspect, please refer to the introduction of the technical effects of the various possible implementations of the first aspect.

[0363] Eighthly, embodiments of this application provide another communication device that has the functionality to implement the behavior described in the second aspect of the method embodiments. This communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. It may also be implemented by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the aforementioned functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the transceiver module is used to receive a first signal; and the processing module is used to synchronize the received first signal based on a preamble sequence. The description of the preamble sequence in the eighth aspect can be found in the description of the preamble sequence in the second aspect.

[0364] In one possible design of the eighth aspect, the processing module is specifically used to perform correlation detection on the received first signal based on the preamble sequence using a correlator to obtain a correlation value sequence; and to determine the end position and / or start position of the signal carrying the preamble sequence in the first signal based on the time corresponding to the maximum value in the correlation value sequence. The correlator includes M-level registers. It is the register depth of the m-th register in the M-level register.

[0365] For possible implementations of the communication device in the eighth aspect, please refer to the various possible implementations in the second aspect.

[0366] For the technical effects of the various possible implementations of the eighth aspect, please refer to the introduction of the technical effects of the various possible implementations of the second aspect.

[0367] In a ninth aspect, embodiments of this application provide another communication device that has the functionality to implement the behavior described in the method embodiments of the third aspect. This communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. The functionality of the communication device can be implemented in hardware or by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the aforementioned functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the processing module is used to determine a preamble sequence; and the transceiver module is used to transmit the preamble sequence. The description of the preamble sequence in the ninth aspect can be found in the description of the preamble sequence in the third aspect.

[0368] For possible implementations of the communication device in the ninth aspect, please refer to the various possible implementations in the third aspect.

[0369] For the technical effects of the various possible implementations of the ninth aspect, please refer to the introduction of the technical effects of the various possible implementations of the third aspect.

[0370] In a tenth aspect, embodiments of this application provide another communication device that has the function of implementing the behavior described in the method embodiments of the fourth aspect. This communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. It may also be implemented by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the above-described functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the transceiver module is used to receive a first signal; and the processing module is used to synchronize the received first signal based on a preamble sequence. The description of the preamble sequence in the tenth aspect can be found in the description of the preamble sequence in the fourth aspect.

[0371] In one possible design of the tenth aspect, the processing module is specifically configured to use a correlator to perform correlation detection on the received first signal based on the preamble sequence to obtain a correlation value sequence; and to determine the end position and / or start position of the signal carrying the preamble sequence in the first signal based on the time corresponding to the maximum value in the correlation value sequence. The correlator includes M-level registers. This is the register depth of the m-th register in the M-level register. Optionally, the correlator further includes an M-level adder and an M-level subtractor for correlation detection of the leader sequence, which is obtained by concatenating a set of complementary Gray sequences. Optionally, the correlator further includes an M-level adder and an M-1-level subtractor for correlation detection of the leader sequence, which is a single generalized Gray sequence [A] = [A0, A1, ..., A...]. N-1 Optionally, the correlator further includes an M-1 level adder and an M-level subtractor, which are used for correlation detection of a leader sequence, which is a single generalized Gray sequence [B] = [B0, B1, ..., B]. N-1 ].

[0372] For possible implementations of the communication device in the tenth aspect, please refer to the various possible implementations in the fourth aspect.

[0373] For the technical effects of the various possible implementations of the tenth aspect, please refer to the introduction of the technical effects of the various possible implementations of the fourth aspect.

[0374] Eleventhly, embodiments of this application provide another communication device that has the function of implementing the behavior described in the fifth aspect of the method embodiments. This communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. The functions of the communication device can be implemented by hardware or by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the above functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the processing module is used to determine a preamble sequence; the transceiver module is used to transmit the preamble sequence. The description of the preamble sequence in the ninth aspect can be found in the description of the preamble sequence in the third aspect.

[0375] For possible implementations of the communication device in the eleventh aspect, please refer to the various possible implementations in the fifth aspect.

[0376] For the technical effects of the various possible implementations of the eleventh aspect, please refer to the introduction of the technical effects of the various possible implementations of the fifth aspect.

[0377] In a twelfth aspect, embodiments of this application provide another communication device that has the function of implementing the behavior described in the sixth aspect method embodiment. This communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. It may also be implemented by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the above functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the transceiver module is used to receive a first signal; the processing module is used to synchronize the received first signal based on a preamble sequence. The description of the preamble sequence in the tenth aspect can be found in the description of the preamble sequence in the fourth aspect.

[0378] In one possible design of the twelfth aspect, the processing module is specifically configured to use a correlator to perform correlation detection on the received first signal based on the preamble sequence to obtain a correlation value sequence; and to determine the end position and / or start position of the signal carrying the preamble sequence in the first signal based on the time corresponding to the maximum value in the correlation value sequence. The correlator includes an M-level register. It is the register depth of the m-th register in the M-level register.

[0379] For possible implementations of the communication device in aspect 12, please refer to the various possible implementations in aspect 6.

[0380] For the technical effects of the various possible implementations of the twelfth aspect, please refer to the introduction of the technical effects of the various possible implementations of the sixth aspect.

[0381] In a thirteenth aspect, embodiments of this application provide another communication device, the communication device including a processor coupled to a memory for storing computer programs or instructions, the processor for executing the computer programs or instructions in the memory to cause the communication device to perform the methods of any one of the first to sixth aspects described above.

[0382] Optionally, the communication device further includes a memory. For example, the communication device may be a chip, the processor may be a processing unit within the chip, and the memory may be random access memory or cache within the chip.

[0383] In this embodiment of the application, during the execution of the above method, the process of sending information (or signals) can be understood as a process of outputting information based on a computer program or instruction of the processor. When outputting information, the processor outputs the information to the transceiver so that the transceiver can transmit it. After being output by the processor, the information may undergo further processing before reaching the transceiver. Similarly, when the processor receives input information, the transceiver receives the information and inputs it into the processor. Furthermore, after the transceiver receives the information, the information may undergo further processing before being input into the processor.

[0384] Unless otherwise specified, or unless it contradicts its actual function or internal logic in the relevant description, the sending and / or receiving operations involved by the processor can generally be understood as processor-based computer program or instruction output.

[0385] In implementation, the processor described above can be a processor specifically designed to execute these methods, or it can be a processor that executes computer programs or instructions stored in memory to execute these methods, such as a general-purpose processor. For example, the processor can also be used to execute programs stored in memory, which, when executed, cause the communication device to perform the methods as shown in the first aspect or any possible implementation thereof.

[0386] In one possible implementation, the memory is located outside the aforementioned communication device. In another possible implementation, the memory is located inside the aforementioned communication device.

[0387] In one possible implementation, the processor and memory may be integrated into a single device; that is, the processor and memory may be integrated together.

[0388] In one possible implementation, the communication device further includes a transceiver for receiving or transmitting signals, etc.

[0389] In a fourteenth aspect, this application provides another communication device, which includes a processing circuit and an interface circuit, the interface circuit being used to acquire or output data; the processing circuit being used to perform the method as described in any one of the first to sixth aspects above.

[0390] In a fifteenth aspect, this application provides a computer-readable storage medium storing a computer program or instructions that, when executed on a computer, cause the computer to perform the methods described in any of the first to sixth aspects above. For example, the computer is a terminal device or an access network device.

[0391] In a sixteenth aspect, this application provides a computer program product that, when run on a computer, causes the computer to perform the method described in any one of the first to sixth aspects above.

[0392] In a seventeenth aspect, this application provides a chip including a communication interface and a processor; the communication interface is used for signal transmission and reception of the chip; the processor is used to execute computer programs or instructions, causing a communication device including the chip to perform the method as described in any one of the first to sixth aspects above.

[0393] In the eighteenth aspect, this application provides a communication system, including the communication device of the seventh aspect and the communication device of the eighth aspect.

[0394] In a nineteenth aspect, this application provides a communication system, including the communication apparatus of the ninth aspect and the communication apparatus of the tenth aspect.

[0395] In a twentieth aspect, this application provides a communication system, including a communication device according to an eleventh aspect and a communication device according to a twelfth aspect. Attached Figure Description

[0396] Figure 1 is a schematic diagram of a communication system applicable to the embodiments of this application;

[0397] Figure 2 is a schematic diagram of a reflection communication provided in an embodiment of this application;

[0398] Figure 3A is a schematic diagram of the frame structure of an uplink or downlink signal;

[0399] Figure 3B is a schematic diagram of another type of uplink or downlink signal frame structure;

[0400] Figure 3C is a schematic diagram of another type of uplink or downlink signal frame structure;

[0401] Figure 4 is a flowchart illustrating the communication method provided in an embodiment of this application;

[0402] Figure 5 is a schematic diagram of using a correlator to perform correlation detection on the preamble and receiver sequences;

[0403] Figure 6 is a schematic diagram of the structure of a communication device 60 provided in an embodiment of this application;

[0404] Figure 7 is a schematic diagram of another communication device provided in an embodiment of this application;

[0405] Figure 8 is a schematic diagram of another structure of the communication device provided in an embodiment of this application. Detailed Implementation

[0406] The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are only used to distinguish different objects and not to describe a specific order. It is understood that the various numerical designations used in the embodiments of this application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application. The order of the process numbers does not imply the order of execution; the execution order of each process should be determined by its function and inherent logic. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or devices.

[0407] The term "embodiment" as used herein means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of this application. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a mutually exclusive, independent, or alternative embodiment. Those skilled in the art will understand, explicitly and implicitly, that the embodiments described herein can be combined with other embodiments. In this application, message names are used only to distinguish different messages and should not be construed as limiting. That is, any message name in this application can be replaced with other names, and this application does not impose any limitations.

[0408] The terminology used in the following embodiments of this application is for the purpose of describing particular embodiments only and is not intended to be limiting of this application. As used in the specification and appended claims of this application, the singular expressions “a,” “an,” “the,” “the,” “the,” and “this” are intended to include the plural expressions as well, unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used in this application refers to and includes any or all possible combinations of one or more of the listed items. For example, “A and / or B” can mean: the presence of only A, the presence of only B, and the presence of both A and B, where A and B can be singular or plural. The term “multiple” as used in this application refers to two or more. In the textual description of this application, the character “ / ” generally indicates that the preceding and following objects are in an “or” relationship.

[0409] It is understood that in the various embodiments of this application, "B corresponding to A" means that there is a correspondence between A and B, and B can be determined based on A. However, it should also be understood that determining (or generating) B based on (or on) A does not mean that B is determined (or generated) solely based on (or on) A; B can also be determined (or generated) based on (or on) A and / or other information.

[0410] It should be understood that in this application, the indication includes direct indication (also known as explicit indication) and implicit indication. Direct indication information A refers to information A being included; implicit indication information A refers to information A being indicated through the correspondence between information A and information B, and through direct indication information B. The correspondence between information A and information B can be predefined, pre-stored, pre-burned, or pre-configured.

[0411] It should be understood that in this application, information C is used to determine information D, including both situations where information D is determined solely based on information C and situations where it is determined based on information C and other information. Furthermore, information C can also be used to determine information D indirectly, for example, where information D is determined based on information E, and information E is determined based on information C.

[0412] Furthermore, in the embodiments of this application, "network element A sends information A to network element B" can be understood as network element B being the destination of information A or an intermediate network element in the transmission path between the destination and network element B, which may include sending information directly or indirectly to network element B. "Network element B receives information A from network element A" can be understood as network element A being the source of information A or an intermediate network element in the transmission path between the source and network element A, which may include receiving information directly or indirectly from network element A. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source. Similar expressions in this application can be understood in a similar way and will not be elaborated further here.

[0413] The technical solutions in this application will now be described with reference to the accompanying drawings.

[0414] First, the communication system to which the embodiments of this application are applicable will be described.

[0415] Figure 1 is a schematic diagram of a communication system applicable to an embodiment of this application. As shown in Figure 1, the communication system includes: an access network device and a terminal device. Optionally, the access network device is connected to the core network via wireless or wired means. Optionally, the core network device and the access network device in the core network can be different physical devices, or they can be the same physical device integrating core network logical functions and wireless access network logical functions.

[0416] Access network equipment is a device deployed in a radio access network to provide wireless communication functions. Alternatively, access network equipment is a device with wireless transceiver capabilities used to communicate with terminal devices. Access network equipment is a node in the radio access network (RAN), also known as a base station or RAN node. In other words, access network equipment is a device that provides base station functionality within the network. For example, in 2G networks, devices providing base station functionality include base transceiver stations (BTS) and base station controllers (BSCs). In 3G networks, devices providing base station functionality include NodeBs (NodeBs) and radio network controllers (RNCs). In 4G networks, devices providing base station functionality include evolved NodeBs (eNBs). In WLANs, devices providing base station functionality are access points (APs). In 5G networks such as New Radio (NR) or LTE+, equipment providing base station functionality includes evolved Node Bs (gNBs), Transmission and Reception Points (TRPs), or Transmission Points (TPs). TRPs or TPs may exclude the baseband portion and include only the radio frequency (RF) portion, or they may include both the baseband and RF portions. Access network equipment can also be base stations in public land mobile networks (PLMNs) that evolve after 5G, broadband network gateways (BNGs), aggregation switches, or 3GPP access equipment, etc.

[0417] The aforementioned RAN can be configured as a RAN defined by the 3GPP protocol, an open radio access network (O-RAN), or a cloud radio access network (C-RAN), etc. Access network equipment can also include various forms of base stations, such as macro base stations, micro base stations (also known as small stations), relay stations, mobile switching centers, and equipment that performs base station functions in device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, as well as access network equipment in non-terrestrial networks (NTN), etc., without specific limitations.

[0418] Access network equipment may also include network elements or modules that implement some of the functions of a base station, such as one or more of the following: a centralized unit (CU), a distributed unit (DU), or a radio unit (RU). Optionally, the CU can be further separated into a CU-control plane (CP) and a CU-user plane (UP). The functions of the CU and DU can be implemented by different network elements, or simultaneously by the base band unit (BBU) of the base station. The functions of the RU can be implemented by the radio frequency equipment of the base station. For example, the radio frequency equipment of the base station may be a remote radio unit (RRU), a pico remote radio unit (pRRU), an active antenna unit (AAU), or other units, modules, or devices with radio frequency processing functions. The communication interface protocol between the BBU and the radio frequency equipment can be the Common Public Radio Interface (CPRI) protocol, the Enhanced Common Public Radio Interface (eCPRI) protocol, or the fronthaul interface protocol between the DU and RU in the O-RAN system, etc., without restriction.

[0419] The communication device used to implement the functions of the access network device can be the access network device itself, or it can be a device that supports the access network device in implementing these functions, such as a chip system. This device can be installed in the access network device or used in conjunction with the access network device. The chip system in this embodiment can be composed of chips, or it can include chips and other discrete components.

[0420] A terminal device is a device with wireless transceiver capabilities. Terminal devices are primarily used to receive or send service data. They can communicate with one or more core networks via the RAN (Access Node) (the access portion of a wireless communication network). Terminal devices can be mobile or stationary. Terminal devices have different names for user equipment in different networks, such as: terminal, mobile station, subscriber unit, station, cellular phone, personal digital assistant, wireless modem, wireless communication equipment, handheld device, laptop, cordless phone, wireless local loop station, vehicle-mounted equipment, remote station, remote terminal, mobile device, user terminal, wireless communication equipment, user agent, or user equipment, etc.

[0421] Terminal devices can also include satellite phones, cellular phones, smartphones, wireless data cards, wireless modems, machine-type communication devices, cordless phones, session initiation protocol (SIP) phones, customer-premises equipment (CPE), point-of-sale (POS) machines, handheld devices with wireless communication capabilities, computing devices or other processing devices connected to a wireless modem, communication devices mounted on high-altitude aircraft, wearable devices, drones, robots, terminals in device-to-device (D2D) communication, terminals in vehicle-to-everything (V2X) communication, virtual reality (VR) terminal devices, augmented reality (AR) terminal devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical care, wireless terminals in smart grids, wireless terminals in transportation safety, and wireless terminals in smart cities. There are no restrictions on wireless terminals in cities, wireless terminals in smart homes, or terminal devices in communication networks that evolve after 5G.

[0422] The terminal device can also be a device with radio frequency identification (RFID) functionality. For example, the terminal device can be an RFID tag. The terminal device can be an active RFID tag, a passive RFID tag, or a semi-passive RFID tag. In some embodiments, the terminal device can be a device with Internet of Things (IoT) functionality. For example, the terminal device can be an IoT tag. The terminal device can also be a terminal in A-IoT, i.e., an A-IoT terminal (e.g., an A-IoT tag).

[0423] The communication device used to implement the functions of a terminal device can be the terminal device itself, or it can be a device that supports the terminal device in implementing those functions, such as a chip system. This device can be installed in the terminal device or used in conjunction with the terminal device. In this application, the chip system can be composed of chips, or it can include chips and other discrete components.

[0424] To facilitate understanding of the embodiments of this application, a few basic concepts involved in the embodiments of this application will be briefly explained.

[0425] 1. Radio Frequency Identification (RFID) technology:

[0426] RFID technology is a type of automatic identification technology that uses radio frequency (RF) for non-contact, two-way data communication. RFID technology enables readers to read and write tags via RF, thereby achieving target identification and data exchange. Typical applications of RFID include animal microchips, car anti-theft devices, access control, parking management, production line automation, and material management.

[0427] RFID technology provides a good technical reference in the low-power direction, supporting microwatt-level power consumption. RFID terminals (tags) use low-precision, low-power mid-to-low frequency ring oscillators or completely oscillator-less receivers to receive downlink signals. When the tag is working, the communication energy and carrier wave are supplied by the reader, and communication is based on a reflected carrier wave, as shown in Figure 2. Figure 2 is a schematic diagram of a reflective communication provided by an embodiment of this application. Referring to Figure 2, the solid line represents the carrier signal sent by the reader, and the dashed line represents the signal modulated and reflected by the tag based on the carrier wave sent by the reader.

[0428] 2. Ambient Internet of Things (Ambient IoT):

[0429] Given the low power consumption advantage of RFID technology, Ambient IoT (A-IoT) emerged. To meet ultra-low power consumption requirements, A-IoT terminals use low-precision, low-power mid-to-low frequency ring oscillators or completely oscillator-less receivers to receive downlink signals or transmit uplink signals. Because A-IoT terminals use low-precision, low-power mid-to-low frequency ring oscillators or completely oscillator-less receivers to receive downlink signals, they can only perform amplitude detection, such as envelope detection, because a low-precision ring oscillator alone cannot guarantee accurate demodulation of signal phase information.

[0430] AIoT terminals are low-cost, with typical power consumption of approximately 1µW and sampling clock frequency accuracy of less than 10^5ppm, making them suitable only for asynchronous transmission mechanisms. Considering both data processing latency and signal propagation latency, the receiving side needs to synchronize the received uplink or downlink signals based on a preamble sequence. A common frame structure for uplink or downlink signals is shown in Figure 3A. Figure 3A is a schematic diagram of a frame structure for an uplink or downlink signal. As shown in Figure 3A, the uplink or downlink signal includes a preamble and data.

[0431] If the length of the data is unknown at the receiving end, a post-amble is also required as a terminator. Figure 3B shows a schematic diagram of another frame structure for uplink or downlink signals. As shown in Figure 3B, the uplink or downlink signal includes: a preamble, data, and a post-amble.

[0432] To further improve synchronization accuracy and thus enhance data detection performance, a mid-amble can be inserted in the middle of the data. The mid-amble can help correct residual time deviations and can also be used for channel estimation. Figure 3C shows another type of uplink or downlink signal frame structure. As shown in Figure 3C, the uplink or downlink signal includes: preamble, data, mid-amble, and post-amble. Sometimes the post-amble is considered part of the mid-amble.

[0433] 3. The receiving side synchronizes the signal (uplink or downlink signal) based on the preamble sequence:

[0434] The receiving side (e.g., the base station) performs sliding detection on the received signal within a sliding window. The length of the sliding window is related to the processing delay and signal propagation delay. The length of the sliding window can be predefined by the protocol or preconfigured. A common detection method is time-domain sliding detection, where a preamble signal window is truncated for each sliding time-domain sampling point. Then, a local preamble sequence is correlated with the received signal (optionally, the local preamble sequence can be upsampled, or the received signal can be downsampled to ensure a consistent sampling rate). This process is repeated to obtain multiple correlation values, and the sampling point corresponding to the maximum correlation value is the synchronization position. The local preamble sequence can be a preamble sequence stored locally on the receiving side.

[0435] Assume the received signal at the receiving side is y rev The local preamble signal is y preamble Let the size of the sliding window be L. win The length of the local preamble signal is L:

[0436] Among them, C k,L This represents a correlation value obtained by correlating the local preamble signal and the received signal. L is an integer greater than 1. For example, L can be 8, 16, 32, etc. 0 ≤ k ≦ L win L win It is an integer greater than 0.

[0437] To achieve better synchronization, sequences with good autocorrelation performance are usually selected as leader sequences.

[0438] 4. Generalized Golay sequence:

[0439] Generalized Gray sequences are generally generated based on recursive formulas. A generalized Gray sequence [A] can be determined by sequences [P], [W1], and [W2], each of length M. M = log₂N. N is the length of the generalized Gray sequence. N is an integer greater than 1, such as 8, 16, 32, etc. Sequence [P] = [P1, P2, ..., P M ]. Among them, P k ∈{0, 1, ..., M-1}. k = 1, 2, ..., M. Sequence [W1] = [W 1,1 W 2,1 , ..., W M,1 ]. W m,1 W is the m-th element in the sequence [W1]. m,1 ∈{1,-1}. Sequence[W2]=[W 1,2 W 2,2 , ..., W M,2 ]. W m,2 W is the m-th element in the sequence [W2]. m,2∈{1,-1}. In a broader sense, W... m,1 and W m,2 The values ​​of can be different. The generalized Gray sequence [A] (or [a]) m+1 The nth element in ]) is A n =a M+1 (n), a M+1 (n) is a when m = M m+1 (n). 0≤n≤N-1, 1≤m≤M, and n and m are integers. The formulas for generating the generalized Gray sequence are: a1(n)=δ(n)(2); b1(n)=δ(n)(3);

[0440] Where δ(n) is the impulse function, δ(n) = 1 when n = 0, and δ(n) = 0 when n ≠ 0. P m Let m be the m-th element in sequence [P]. P is the register depth of the m-th register in the M-th register used to generate this generalized Gray sequence. m P is an integer greater than or equal to 0. For example, in a Gray sequence of length 16, P... m The set of values ​​for is {0, 1, 2, 3}. Taking an 8-length Gray sequence as an example, P... m The set of values ​​for is {0, 1, 2}. It can be understood that [P1, P2, ..., P...] M The register depth is [0,1,…,M-1], [1,0,2,…,M-1], etc. The register depth of a register represents the number of memory units that make up that register. Therefore, the m-th register in an M-level register system consists of... It consists of several storage units.

[0441] The generalized Gray sequence [A] of length N generated by the M-level register can be specifically represented as: [A] = [A0, A1, ..., A N-1 ] = [a M+1 (0),a M+1 (1),…,a M+1 (N-1)].

[0442] It can also generate the complementary sequence of the following generalized Gray sequence [A]: [B] = [B0, B1, ..., B N-1 ] = [b M+1 (0),b M+1 (1),…,b M+1 (N-1)].

[0443] The definition of Gray's complementary sequences is as follows: The autocorrelation functions of sequences [A] and [B] are defined as follows: Cj +D j =0,j≠0; C0+D0=2N;

[0444] The sequences [A] and [B] generated based on the above recursive formula satisfy the above definition.

[0445] Taking N=4 as an example, W1=[1,-1], W2=[1,-1], P=[0,1], the specific process of the generalized Gray sequence is given:

[0446] Step 1: Initialize a1 = [1, 0, 0, 0], b1 = [1, 0, 0, 0].

[0447] Step 2: a2(i) = a1(i) + W 1,1 *b1(i-1), b2(i)=a1(i)-W 1,2 Substituting *b1(i-1) into the numerical values, we get a2 = [1, 1, 0, 0] and b2 = [1, -1, 0, 0].

[0448] Step 3: a3(i) = a2(i) + W 2,1 *b2(i-2), b3(i)=a2(i)-W 2,2 Substituting *h2(i-2) into the numerical values, we get a3 = [1, 1, -1, 1] and b3 = [1, 1, 1, -1].

[0449] The final generalized Gray sequence is a3 = [1, 1, -1, 1].

[0450] 5. On-off keying (OOK) modulation:

[0451] OOK modulation is binary amplitude shift keying (ASK). OOK is a special case of ASK modulation. A high amplitude (or envelope, level, or energy, etc.) (e.g., above a certain threshold, or non-zero) is called an OOK modulation symbol 1, or OOK modulation symbol ON, or OOK modulation symbol on; a low amplitude (or envelope, level, or energy, etc.) (e.g., below a certain threshold, or zero) is called an OOK modulation symbol 0, or OOK modulation symbol OFF, or OOK modulation symbol off. The amplitude level is defined relative to the receiver's demodulation threshold; above the threshold is called high amplitude, and below the threshold is called low amplitude. In other words, within a given time period, if the signal amplitude is 0 (i.e., no transmission), it represents a transmission of 0; if the signal amplitude is not 0, it represents a transmission of 1.

[0452] The preceding text introduced some terms, concepts, or processes involved in the embodiments of this application. The following text introduces the technical background involved in the embodiments of this application.

[0453] In 3GPP R19 RAN1 120, candidate preamble sequences were identified as Gray sequences and m-sequences. Among these, the Gray sequences mentioned in the proposals from various companies included single generalized Gray sequences and complementary Gray sequences, but no specific sequences or generation methods were specified. As described in the background section, the synchronization detection performance and / or detection complexity differ when the receiver synchronizes the received signal based on different preamble sequences. Therefore, it is necessary to investigate which preamble sequence to use for synchronizing the received signal to improve synchronization detection performance and / or reduce detection complexity. This application designs preamble sequences with lengths of 8, 16, and 32. The preamble sequences designed in this application are Gray sequences or obtained by splicing together a set of complementary Gray sequences. Compared with arbitrarily selecting a Gray sequence, the receiver can improve synchronization detection performance and / or reduce detection complexity when synchronizing the received signal using the preamble sequences designed in this application.

[0454] The communication method and apparatus provided in this application will be further described below with reference to the accompanying drawings. It is understood that this application uses a first communication device and a second communication device as examples of the execution entities in the interactive illustration, but this application does not limit the execution entities in the interactive illustration. For example, the method executed by the second communication device in this application can also be implemented by a module (e.g., a circuit, chip, or chip system) in an access network device, or by a logic node, logic module, or software capable of implementing all or part of the functions of the second communication device. The method executed by the first communication device in this application can also be implemented by a communication module in a terminal device or by a circuit or chip (e.g., a baseband chip, or a system-on-a-chip (SoC) chip containing a baseband chip, or a system-in-package (SIP) chip) in the terminal device responsible for communication functions.

[0455] This application describes the method provided by the first communication device and the second communication device from both sides. However, during the transmission of signals, the first communication device and the second communication device can also forward the signals through other devices, such as forwarding the signals between the first communication device and the second communication device through a forwarding device. This application does not limit other devices besides the first communication device and the second communication device.

[0456] Figure 4 is a flowchart illustrating the communication method provided in an embodiment of this application. As shown in Figure 4, the method includes:

[0457] 401. The first communication device determines the preamble sequence.

[0458] The preamble sequence can be any of the preamble sequences provided in this application. In this application, the preamble sequence determined by the first communication device can be a pre-modulated preamble sequence or a post-modulated preamble sequence. Optionally, the first communication device is an A-IoT terminal. The first communication device determining the preamble sequence can be determining the preamble sequence to be transmitted, or determining the preamble sequence to be transmitted and the time-frequency resources for transmitting the preamble sequence. Optionally, the first communication device stores the preamble sequence or can generate the preamble sequence. Optionally, the preamble sequence is a Gray sequence. The length of the preamble sequence is 8, 16, 32, etc. Optionally, the first communication device uses a low-frequency ring oscillator (e.g., a low-precision, low-power low-frequency ring oscillator) or receives downlink signals without a local oscillator.

[0459] In one possible design, the leading sequence is any one of the following or an equivalent sequence of any one of the following:

[0460] [1,1,-1,1,1,-1,-1,-1,-1]; or,

[0461] [1,-1,1,1,1,1,1,1,-1]; or,

[0462] [1,-1,-1,-1,1,1,-1,1]; or,

[0463] [1,1,1,-1,1,-1,1,1,1].

[0464] In this application, the leading sequence and its equivalent sequence satisfy any of the following: the leading sequence is obtained by inverting the elements in its equivalent sequence; the leading sequence is obtained by reversing (or reversing) the elements in its equivalent sequence; the leading sequence is obtained by inverting and reversing the elements in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing. Inverting an element in a sequence means replacing each element in the sequence with its opposite, for example, the inversion of 1 is -1, the inversion of -1 is 1, and the inversion of 0 is 0. As an example, the equivalent sequence of the leading sequence is [1,1,-1,1,1,-1,-1,-1,-1], and the leading sequence is obtained by inverting the elements in its equivalent sequence, which is [-1,-1,1,-1,-1,1,1,1]. The sequence [a M+1 (0),a M+1 (1),…,a M11 Reverse the order of the elements in (N-1) to obtain the sequence [a M+1 (N-1),a M+1 (N-2),…,a M+1 (1),a M+1(0)]. As an example, the equivalent sequence of the leading sequence is [1,1,-1,1,1,-1,-1,-1,-1]. The leading sequence is obtained by reversing (or reversing) the elements in its equivalent sequence, which is [-1,-1,-1,1,1,-1,1,1,1]. Reversing or inverting the elements in a sequence can be done by first reversing the elements in the sequence and then reversing the elements in the reversed sequence, or vice versa. As an example, the equivalent sequence of the leading sequence is [1,1,-1,1,1,-1,-1,-1,-1]. The leading sequence is obtained by reversing and inverting the elements in its equivalent sequence, which is [1,1,1,-1,-1,1,-1,-1,-1]. The leader sequence is obtained by replacing every -1 with 0 in its equivalent sequence. For example, if the equivalent sequence of the leader sequence is [1,1,-1,1,1,-1,-1,-1,-1], replacing every -1 with 0 results in the leader sequence [1,1,0,1,1,0,0,0]. Similarly, if the equivalent sequence of the leader sequence is [1,1,-1,1,1,-1,-1,-1,-1], replacing every -1 with 0 and then inverting the result gives the leader sequence [-1,-1,0,-1,-1,0,0,0]. As an example, the equivalent sequence of the leading sequence is [1,1,-1,1,1,-1,-1,-1,-1]. The leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then reversing it, resulting in the leading sequence [0,0,0,1,1,0,1,1]. As another example, the equivalent sequence of the leading sequence is [1,1,-1,1,1,-1,-1,-1,-1]. The leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and reversing it, resulting in the leading sequence [0,0,0,-1,-1,0,-1,-1].

[0465] In one possible implementation, the leading sequence is [a m+1 ,b m+1 ], a m+1 and b m+1 Let W1, W2, and P be a set of Gray complementary sequences determined by sequences [W1], [W2], and [P], each with a length of M, where M is an integer greater than or equal to 1. m,1 W is the m-th element in the sequence [W1]. m,2 W is the m-th element in the sequence [W2]. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0]. P is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence. m a is an integer greater than or equal to 0. m+1 The nth element in is a m+1 (n), b m+1 The nth element in is b m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, a m+1 (n) and b m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0466] When n = 0, δ(n) = 1; when n ≠ 0, δ(n) = 0.

[0467] The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1], and sequences [W1] and [W2] are both [-1,1]; or,

[0468] The leading sequence is [1,-1,1,1,1,1,1,-1], and sequences [W1] and [W2] are both [1,-1]; or,

[0469] The leading sequence is [1,-1,-1,-1,1,1,-1,1], and both sequences [W1] and [W2] are [-1,-1]; or,

[0470] The leading sequence is [1,1,1,-1,1,-1,1,1], and sequences [W1] and [W2] are both [1,1]. Optionally, δ(n) is the impulse function.

[0471] It's important to understand that a sequence obtained by splicing together a set of complementary Gray sequences is also a single generalized Gray sequence. [W] n,1 ] = [W n,2 ] = [-1,1,-1,1], [P n Taking [W] = [1,0,2,3] as an example, based on [W] n,1 ]、[W n,1 ]、[P n The [a] is obtained by splicing together a set of complementary Gray sequences. M+1 ,b M+1 The sequence is [1, 1, -1, 1, -1, 1, 1, 1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, -1, -1, 1, 1, 1]. This sequence is based on [W]. n,1 ] = [-1,1,-1,1,1], [W n,2 ]=[-1,1,-1,1,-1],[Pn The a generated by ] = [1,0,2,3,4] M+1 Exactly the same.

[0472] In this implementation, the leading sequence is [a m+1 ,b m+1 Synchronizing the received signal based on this preamble sequence can reduce detection complexity and improve synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 8.

[0473] In another possible implementation, the leading sequence is a Gray sequence determined by sequences [W1], [W2], and [P], where the lengths of sequences [W1], [W2], and [P] are all M, where M is an integer greater than or equal to 1. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1, 0, 2]. P is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence. m A is an integer greater than or equal to 0, and the nth element in the preceding sequence is A. n =a m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, a m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0474] Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0;

[0475] The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1], the sequence [W1] is [-1,1,1], and the sequence [W2] is [-1,1,-1]; or,

[0476] The leading sequence is [1,-1,1,1,1,1,1,-1], the sequence [W1] is [1,-1,1], and the sequence [W2] is [1,-1,-1]; or,

[0477] The leading sequence is [1,-1,-1,-1,1,1,-1,1], the sequence [W1] is [-1,-1,1], and the sequence [W2] is [-1,-1,-1]; or,

[0478] The leading sequence is [1,1,1,-1,1,-1,1,1], the sequence [W1] is [1,1,1], and the sequence [W2] is [1,1,-1].

[0479] Here's a general explanation: the nth element in the preceding sequence can be A. n =a m+1 (n), meaning the preceding sequence is [A], or it can be B. n =b m+1 (n), meaning the preceding sequence is [B]. The nth element in the preceding sequence is A. n =a m+1 When (n), the last element in sequence [W1] is 1, and the last element in sequence [W2] is either 1 or -1. This application only shows that the nth element in the preceding sequence is A. n =a m+1 (n), an example where the last element of sequence [W1] is 1 and the last element of sequence [W2] is -1. It should be understood that the nth element in the leading sequence is A. n =a m+1 When (n), the last element in sequence [W2] can be 1. For example, if the preceding sequence is [1,1,-1,1,1,-1,-1,-1,-1], sequence [W1] is [-1,1,1], and sequence [W2] is [-1,1,1]. The nth element in the preceding sequence is B. n =b m+1 When (n), the last element in sequence [W2] is -1, and the last element in sequence [W1] is either 1 or -1. Another possible implementation is to set the nth element of the leading sequence in the reference implementation to A. n =a m+1 (n) is replaced with the nth element in the preceding sequence, which is B. n =b m+1 (n). In this application, the reference implementation means that any of the preceding sequences provided in this application consists of a Gray sequence determined based on sequence [W1], sequence [W2], and sequence [P], and the nth element in the preceding sequence can be A. n =a m+1 The implementation of (n) can be as described above. For example, the leading sequence is a Gray sequence determined by sequences [W1], [W2], and [P], where the nth element of the leading sequence is B. n =b m+1 (n), with the preceding sequence [1,1,-1,1,1,-1,-1,-1,-1], sequence [W1] being [-1,1,1], and sequence [W2] being [-1,1,-1]. Another possible implementation is to set the nth element of the preceding sequence in the reference implementation to A. n =a m+1 (n) is replaced with the nth element in the preceding sequence, which is B. n =bm+1 (n) and replacing the last element in sequence [W1] with -1. For example, the leading sequence is a Gray sequence determined based on sequences [W1], [W2], and [P], where the nth element in the leading sequence is B. n =b m+1 (n), with the leading sequence [1,1,-1,1,1,-1,-1,-1,-1], sequence [W1] [-1,1,-1], and sequence [W2] [-1,1,-1]. The leading sequences obtained through the reference implementation and the two possible implementations mentioned above are the same.

[0480] In this implementation, synchronizing the received signal based on the preamble sequence reduces detection complexity and improves synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 8.

[0481] In another possible design, the leading sequence is any one of the following or an equivalent sequence of any one of the following:

[0482] [1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,1]; or,

[0483] [1,-1,1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,1]; or,

[0484] [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0485] [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,1]; or,

[0486] [1,1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1]; or,

[0487] [1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,1,-1]; or,

[0488] [1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,-1,1]; or,

[0489] [1,1,1,-1,1,-1,1,1,1,1,1,-1,-1,1,-1,-1,-1]; or,

[0490] [1,1,-1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,1]; or,

[0491] [1,-1,-1,-1,1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1]; or,

[0492] [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1]; or,

[0493] [1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,1]; or,

[0494] [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,1,1]; or,

[0495] [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1]; or,

[0496] [1,-1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1]; or,

[0497] [1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,1,-1,1,1]; or,

[0498] [1,1,-1,1,-1,1,1,1,1,1,1,1,-1,-1,1,-1,-1]; or,

[0499] [1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,-1]; or,

[0500] [1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1]; or,

[0501] [1,1,1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1]; or,

[0502] [1,1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1]; or,

[0503] [1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1]; or,

[0504] [1,1,-1,-1,-1,1,-1,1,-1,1,1,1,1,-1,1,-1,1,-1]; or,

[0505] [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1]; or,

[0506] [1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1]; or,

[0507] [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,1]; or,

[0508] [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1]; or,

[0509] [1,-1,1,1,1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1]; or,

[0510] [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1]; or,

[0511] [1,-1,-1,-1,1,-1,1,1,1,1,-1,1,1,1,-1,1,1,1,-1]; or,

[0512] [1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1]; or,

[0513] [1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1]; or,

[0514] [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1]; or,

[0515] [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1]; or,

[0516] [1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1]; or,

[0517] [1,-1,1,-1,1,1,-1,-1,1,1,1,1,-1,-1,-1,1]; or,

[0518] [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1]; or,

[0519] [1,-1,1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1,1,-1]; or,

[0520] [1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1]; or,

[0521] [1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1,-1].

[0522] In one possible implementation, the leading sequence is [a m+1 ,b m+1 ], a m+1 and b m+1 Let W1, W2, and P be a set of Gray complementary sequences determined by sequences [W1], [W2], and [P], each with a length of M, where M is an integer greater than or equal to 1. m,1 W is the m-th element in the sequence [W1]. m,2 W is the m-th element in the sequence [W2]. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0]. P is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence. m a is an integer greater than or equal to 0. m+1 The nth element in is a m+1 (n), b m+1 The nth element in is b m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, a m+1 (n) and b m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0523] Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0;

[0524] The leading sequence is [1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,1], sequences [W1] and [W2] are both [-1,1,1], and sequence [P] is [1,0,2]; or,

[0525] The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], sequences [W1] and [W2] are both [1,-1,1], and sequence [P] is [1,0,2]; or,

[0526] The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,1], and sequence [P] is [1,0,2]; or,

[0527] The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,-1,1,1,1], sequences [W1] and [W2] are both [1,1,-1], and sequence [P] is [1,0,2]; or,

[0528] The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1], sequences [W1] and [W2] are both [-1,1,-1], and sequence [P] is [1,0,2]; or,

[0529] The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,1,-1], sequences [W1] and [W2] are both [1,-1,-1], and sequence [P] is [1,0,2]; or,

[0530] The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,-1,1], sequences [W1] and [W2] are both [-1,-1,-1], and sequence [P] is [1,0,2]; or,

[0531] The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,1,-1,-1,-1,1,-1,-1], sequences [W1] and [W2] are both [1,1,1], and sequence [P] is [1,0,2]; or,

[0532] The leading sequence is [1,1,-1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,1], sequences [W1] and [W2] are both [1,-1,1], and sequence [P] is [0,1,2]; or,

[0533] The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,1], and sequence [P] is [0,1,2]; or,

[0534] The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1], sequences [W1] and [W2] are both [1,-1,-1], and sequence [P] is [0,1,2]; or,

[0535] The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,1,1], sequences [W1] and [W2] are both [-1,-1,-1], and sequence [P] is [0,1,2]; or,

[0536] The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,1,1], sequences [W1] and [W2] are both [-1,1,1], and sequence [P] is [2,0,1]; or,

[0537] The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1], sequences [W1] and [W2] are both [1,-1,1], and sequence [P] is [2,0,1]; or,

[0538] The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,1], and sequence [P] is [2,0,1]; or,

[0539] The leading sequence is [1,1,-1,1,1,-1,-1,-1,1,1,1,-1,1,-1,1,1,1], sequences [W1] and [W2] are both [1,1,-1], and sequence [P] is [2,0,1]; or,

[0540] The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,1,-1,-1,-1,1,-1,-1], sequences [W1] and [W2] are both [-1,1,-1], and sequence [P] is [2,0,1]; or,

[0541] The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,-1], sequences [W1] and [W2] are both [1,-1,-1], and sequence [P] is [2,0,1]; or,

[0542] The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], sequences [W1] and [W2] are both [-1,-1,-1], and sequence [P] is [2,0,1]; or,

[0543] The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,-1,1,1,-1,-1,-1,-1], sequences [W1] and [W2] are both [1,1,1], and sequence [P] is [2,0,1]; or,

[0544] The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1,-1,1], sequences [W1] and [W2] are both [1,-1,1], and sequence [P] is [0,2,1]; or,

[0545] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,1], and sequence [P] is [0,2,1]; or,

[0546] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1], sequences [W1] and [W2] are both [1,-1,-1], and sequence [P] is [0,2,1]; or,

[0547] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1], sequences [W1] and [W2] are both [-1,-1,-1], and sequence [P] is [0,2,1]; or,

[0548] The leading sequence is [1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,1], sequences [W1] and [W2] are both [-1,1,1], and sequence [P] is [2,1,0]; or,

[0549] The leading sequence is [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,1], sequences [W1] and [W2] are both [1,-1,1], and sequence [P] is [2,1,0]; or,

[0550] The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,1], and sequence [P] is [2,1,0]; or,

[0551] The leading sequence is [1,-1,1,1,1,-1,-1,-1,1,1,1,-1,1,1,-1,1,-1,1], sequences [W1] and [W2] are both [1,1,-1], and sequence [P] is [2,1,0]; or,

[0552] The leading sequence is [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1], sequences [W1] and [W2] are both [-1,1,-1], and sequence [P] is [2,1,0]; or,

[0553] The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,1,-1], sequences [W1] and [W2] are both [1,-1,-1], and sequence [P] is [2,1,0]; or,

[0554] The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1], sequences [W1] and [W2] are both [-1,-1,-1], and sequence [P] is [2,1,0]; or,

[0555] The leading sequence is [1,1,1,-1,1,1,-1,1,1,-1,1,1,1,-1,-1,-1,-1], sequences [W1] and [W2] are both [1,1,1], and sequence [P] is [2,1,0]; or,

[0556] The leading sequence is [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1,1], sequences [W1] and [W2] are both [-1,1,1], and sequence [P] is [1,2,0]; or,

[0557] The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1], sequences [W1] and [W2] are both [1,-1,1], and sequence [P] is [1,2,0]; or,

[0558] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,1], and sequence [P] is [1,2,0]; or,

[0559] The leading sequence is [1,-1,1,-1,1,1,-1,-1,1,1,1,1,1,-1,-1,-1,1], sequences [W1] and [W2] are both [1,1,-1], and sequence [P] is [1,2,0]; or,

[0560] The leading sequence is [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1], sequences [W1] and [W2] are both [-1,1,-1], and sequence [P] is [1,2,0]; or,

[0561] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1], sequences [W1] and [W2] are both [1,-1,-1], and sequence [P] is [1,2,0]; or,

[0562] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1], sequences [W1] and [W2] are both [-1,-1,-1], and sequence [P] is [1,2,0]; or,

[0563] The leading sequence is [1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,1], and the sequence [P] is [1,2,0].

[0564] In this implementation, the leading sequence is [a m+1 ,b m+1 Synchronizing the received signal based on this preamble sequence can reduce detection complexity and improve synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 16.

[0565] In another possible implementation, the leading sequence is a Gray sequence determined by sequences [W1], [W2], and [P], where the lengths of sequences [W1], [W2], and [P] are all M, where M is an integer greater than or equal to 1. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in sequence [P]. P is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence. m A is an integer greater than or equal to 0, and the nth element in the preceding sequence is A. n =a m+1(n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, a m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0566] Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0;

[0567] The leading sequence is [1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [1,0,2,3]; or,

[0568] The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [1,0,2,3]; or,

[0569] The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [1,0,2,3]; or,

[0570] The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,-1,1,1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [1,0,2,3]; or,

[0571] The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [1,0,2,3]; or,

[0572] The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,1,-1,1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [1,0,2,3]; or,

[0573] The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [1,0,2,3]; or...

[0574] The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,1,-1,-1,-1,1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [1,0,2,3]; or,

[0575] The leading sequence is [1,1,-1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [0,1,2,3]; or,

[0576] The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [0,1,2,3]; or,

[0577] The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [0,1,2,3]; or,

[0578] The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [0,1,2,3]; or,

[0579] The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [2,0,1,3]; or,

[0580] The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [2,0,1,3]; or,

[0581] The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [2,0,1,3]; or,

[0582] The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [2,0,1,3]; or,

[0583] The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,1,-1,-1,1,-1,-1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [2,0,1,3]; or,

[0584] The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,1,-1,1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [2,0,1,3]; or,

[0585] The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [2,0,1,3]; or,

[0586] The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,-1,1,1,-1,-1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [2,0,1,3]; or,

[0587] The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [0,2,1,3]; or,

[0588] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [0,2,1,3]; or,

[0589] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [0,2,1,3]; or,

[0590] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [0,2,1,3]; or,

[0591] The leading sequence is [1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,-1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [2,1,0],3; or,

[0592] The leading sequence is [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [2,1,0,3]; or,

[0593] The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [2,1,0,3]; or...

[0594] The leading sequence is [1,-1,1,1,1,-1,-1,-1,1,1,1,-1,1,1,-1,1,-1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [2,1,0,3]; or,

[0595] The leading sequence is [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [2,1,0,3]; or,

[0596] The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,1,-1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [2,1,0,3]; or,

[0597] The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [2,1,0,3]; or...

[0598] The leading sequence is [1,1,1,-1,1,1,-1,1,1,-1,1,1,1,-1,-1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [2,1,0,3]; or,

[0599] The leading sequence is [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [1,2,0,3]; or,

[0600] The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [1,2,0,3]; or,

[0601] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [1,2,0,3]; or,

[0602] The leading sequence is [1,-1,1,-1,1,1,-1,-1,1,1,1,1,-1,-1,-1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [1,2,0,3]; or,

[0603] The leading sequence is [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,1,-1,1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [1,2,0,3]; or,

[0604] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,-1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [1,2,0,3]; or,

[0605] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [1,2,0,3]; or...

[0606] The leading sequence is [1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,1,-1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [1,2,0,3].

[0607] In this implementation, synchronizing the received signal based on the preamble sequence reduces detection complexity and improves synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 16.

[0608] In another possible design, the leading sequence is any one of the following or an equivalent sequence of any one of the following:

[0609] [1,1,1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0610] [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,1,1]; or,

[0611] [1,-1,1,-1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0612] [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0613] [1,1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1]; or,

[0614] [1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,-1,-1,-1]; or,

[0615] [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,-1]; or,

[0616] [1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0617] [1,1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0618] [1,1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0619] [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1]; or,

[0620] [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0621] [1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0622] [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1]; or,

[0623] [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1]; or,

[0624] [1,-1,1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,1]; or,

[0625] [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,-1,-1,-1]; or,

[0626] [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,-1,-1,-1]; or,

[0627] [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0628] [1,1,1,1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1]; or,

[0629] [1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0630] [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,1]; or,

[0631] [1,-1,1,-1,-1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,1]; or,

[0632] [1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0633] [1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1]; or,

[0634] [1,1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,1,-1,-1,1,1,-1,-1]; or,

[0635] [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1]; or,

[0636] [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0637] [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0638] [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,-1,1,1,1]; or,

[0639] [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0640] [1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or,

[0641] [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,1]; or,

[0642] [1,-1,1,-1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,-1,-1]; or,

[0643] [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,1,1,1,1,-1,1,-1,1,-1]; or,

[0644] [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1].

[0645] In one possible implementation, the leading sequence is [a m+1 ,b m+1 ], a m+1 and b m+1 Let W1, W2, and P be a set of Gray complementary sequences determined by sequences [W1], [W2], and [P], each with a length of M, where M is an integer greater than or equal to 1. m,1 W is the m-th element in the sequence [W1]. m,2 W is the m-th element in the sequence [W2]. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0]. P is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence. m a is an integer greater than or equal to 0. m+1 The nth element in is a m+1 (n), b m+1 The nth element in is b m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, a m+1 (n) and b m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0646] Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0;

[0647] The leading sequence is [1,1,1,1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [1,1,-1,1], and sequence [P] is [2,0,3,1]; or,

[0648] The leading sequence is [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,1,1,1,1], sequences [W1] and [W2] are both [-1,1,-1,1], and sequence [P] is [2,0,3,1]; or,

[0649] The leading sequence is [1,-1,1,-1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [1,-1,-1,1], and sequence [P] is [2,0,3,1]; or,

[0650] The leading sequence is [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,-1,1], and sequence [P] is [2,0,3,1]; or,

[0651] The leading sequence is [1,1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1], sequences [W1] and [W2] are both [1,1,-1,-1], and sequence [P] is [2,0,3,1]; or,

[0652] The leading sequence is [1,1,-1,-1,-1,1,1,-1,-1,1,-1,1,1,1,1,1,1,1,-1,1,-1,1,-1,1,-1,-1,-1], sequences [W1] and [W2] are both [-1,1,-1,-1], and sequence [P] is [2,0,3,1]; or,

[0653] The leading sequence is [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [1,-1,-1,-1], and sequence [P] is [2,0,3,1]; or,

[0654] The leading sequence is [1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,-1,-1], and sequence [P] is [2,0,3,1]; or,

[0655] The leading sequence is [1,1,1,1,-1,-1,1,1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,1,1,1], and sequence [P] is [2,1,3,0]; or,

[0656] The leading sequence is [1,1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [1,1,-1,1], and sequence [P] is [2,1,3,0]; or,

[0657] The leading sequence is [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1,1], sequences [W1] and [W2] are both [-1,1,-1,1], and sequence [P] is [2,1,3,0]; or,

[0658] The leading sequence is [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]. Sequences [W1] and [W2] are both [1,-1,-1,1], and sequence [P] is [2,1,3,0]; or...

[0659] The leading sequence is [1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]. Sequences [W1] and [W2] are both [-1,-1,-1,-1,1]. Sequence [P] is [2,1,3,0]; or...

[0660] The leading sequence is [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1], sequences [W1] and [W2] are both [1,1,1,-1], and sequence [P] is [2,1,3,0]; or,

[0661] The leading sequence is [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,-1,1], sequences [W1] and [W2] are both [-1,1,1,-1], and sequence [P] is [2,1,3,0]; or,

[0662] The leading sequence is [1,-1,1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,1], sequences [W1] and [W2] are both [1,1,-1,-1], and sequence [P] is [2,1,3,0]; or,

[0663] The leading sequence is [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1], sequences [W1] and [W2] are both [-1,1,-1,-1], and sequence [P] is [2,1,3,0]; or,

[0664] The leading sequence is [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]. Sequences [W1] and [W2] are both [1,-1,-1,-1], and sequence [P] is [2,1,3,0]; or...

[0665] The leading sequence is [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,-1,-1], and sequence [P] is [2,1,3,0]; or,

[0666] The leading sequence is [1,1,1,1,1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1], sequences [W1] and [W2] are both [1,1,1,1], and sequence [P] is [2,1,3,0]; or,

[0667] The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [1,1,-1,1], and sequence [P] is [3,0,2,1]; or,

[0668] The leading sequence is [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,-1,1,1,1], sequences [W1] and [W2] are both [-1,1,-1,1], and sequence [P] is [3,0,2,1]; or,

[0669] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [1,-1,-1,1], and sequence [P] is [3,0,2,1]; or,

[0670] The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,-1,1], and sequence [P] is [3,0,2,1]; or,

[0671] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,1,1], sequences [W1] and [W2] are both [1,1,-1,-1], and sequence [P] is [3,0,2,1]; or,

[0672] The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,-1,-1], sequences [W1] and [W2] are both [-1,1,-1,-1], and sequence [P] is [3,0,2,1]; or,

[0673] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1,-1,-1], sequences [W1] and [W2] are both [1,-1,-1,-1], and sequence [P] is [3,0,2,1]; or,

[0674] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,-1,-1], and sequence [P] is [3,0,2,1]; or,

[0675] The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [1,1,-1,1], and sequence [P] is [3,1,2,0]; or,

[0676] The leading sequence is [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1], sequences [W1] and [W2] are both [-1,1,-1,1], and sequence [P] is [3,1,2,0]; or,

[0677] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1], sequences [W1] and [W2] are both [1,-1,-1,1], and sequence [P] is [3,1,2,0]; or,

[0678] The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], sequences [W1] and [W2] are both [-1,-1,-1,1], and sequence [P] is [3,1,2,0]; or...

[0679] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1], sequences [W1] and [W2] are both [1,1,-1,-1], and sequence [P] is [3,1,2,0]; or,

[0680] The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,1,-1,1,-1], sequences [W1] and [W2] are both [-1,1,-1,-1], and sequence [P] is [3,1,2,0]; or,

[0681] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,1,1,-1,1,-1,1,-1,-1], sequences [W1] and [W2] are both [1,-1,-1,-1], and sequence [P] is [3,1,2,0]; or,

[0682] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,-1,-1], and the sequence [P] is [3,1,2,0].

[0683] In this implementation, the leading sequence is [a m+1 ,b m+1 Synchronizing the received signal based on this preamble sequence can reduce detection complexity and improve synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 32.

[0684] In another possible implementation, the leading sequence is a Gray sequence determined by sequences [W1], [W2], and [P], where the lengths of sequences [W1], [W2], and [P] are all M, where M is an integer greater than or equal to 1. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in sequence [P]. P is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence. mA is an integer greater than or equal to 0, and the nth element in the preceding sequence is A. n =a m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, a m+1 (n) satisfies the following formulas: a1(n)=δ(n); b1(n)=δ(n);

[0685] Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0;

[0686] The leading sequence is [1,1,1,1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0687] The leading sequence is [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0688] The leading sequence is [1,-1,1,-1,1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1], the sequence [W1] is [1,-1,-1,1,1], the sequence [W2] is [1,-1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0689] The leading sequence is [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0690] The leading sequence is [1,1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,1,-1,1,-1,-1,-1,-1,1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0691] The leading sequence is [1,1,-1,-1,-1,1,1,-1,-1,1,-1,1,1,1,1,1,1,1,-1,1,-1,1,1,-1,1,-1,-1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0692] The leading sequence is [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0693] The leading sequence is [1,-1,-1,1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,1,-1,-1,1,-1,-1,1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or...

[0694] The leading sequence is [1,1,1,1,-1,-1,1,1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,1,1,1,1], the sequence [W2] is [-1,1,1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0695] The leading sequence is [1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0696] The leading sequence is [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0697] The leading sequence is [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1], the sequence [W1] is [1,-1,-1,1,1], the sequence [W2] is [1,-1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0698] The leading sequence is [1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0699] The leading sequence is [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1,1,-1], the sequence [W1] is [1,1,1,-1,1], the sequence [W2] is [1,1,1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0700] The leading sequence is [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,1,-1,1,-1,1], the sequence [W1] is [-1,1,1,-1,1], the sequence [W2] is [-1,1,1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0701] The leading sequence is [1,-1,1,-1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0702] The leading sequence is [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0703] The leading sequence is [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0704] The leading sequence is [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0705] The leading sequence is [1,1,1,1,1,1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1,-1,-1,1,1,1,1], the sequence [W1] is [1,1,1,1,1], the sequence [W2] is [1,1,1,1,-1], and the sequence [P] is [2,1,3,0,4]; or...

[0706] The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0707] The leading sequence is [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,1,-1,-1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0708] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1], sequence [W1] is [1,-1,-1,1,1], sequence [W2] is [1,-1,-1,1,-1], and sequence [P] is [3,0,2,1,4]; or...

[0709] The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0710] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,-1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0711] The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0712] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0713] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,-1,-1], the sequence [W2] is [-1,-1,-1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or...

[0714] The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0715] The leading sequence is [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0716] The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,1], sequence [W1] is [1,-1,-1,1,1], sequence [W2] is [1,-1,-1,1,-1], and sequence [P] is [3,1,2,0,4]; or...

[0717] The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0718] The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1,-1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0719] The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,1,-1,1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0720] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4]; or...

[0721] The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4].

[0722] In this implementation, synchronizing the received signal based on the preamble sequence reduces detection complexity and improves synchronization detection performance compared to synchronizing based on a non-Gray sequence of length 32.

[0723] One possible implementation of obtaining the aforementioned preamble sequence is as follows: First, select (determine) Gray sequences with good autocorrelation (lengths of 8, 16, 32, etc.); then, from the selected Gray sequences with good autocorrelation, select Gray sequences with low computational complexity (below a certain threshold) for correlation detection. Another possible implementation of obtaining the aforementioned preamble sequence is as follows: First, select Gray sequences with low computational complexity (below a certain threshold) for correlation detection; then, from the selected (determined) Gray sequences with low computational complexity for correlation detection, select (determine) Gray sequences with good autocorrelation (lengths of 8, 16, 32, etc.). That is, the preamble sequence provided in this application comprehensively considers the autocorrelation and detection complexity of the preamble sequence. The applicant has found that the complexity of performing correlation detection on the preamble sequence and the received sequence obtained based on the received first signal using a correlator is related to the register depth of each register in the M-level registers included in the correlator. This application provides a sequence that enables lower computational complexity [P]. n Therefore, the complexity of detection can be reduced.

[0724] 402. The first communication device sends a preamble sequence.

[0725] Correspondingly, the second communication device receives the first signal. The first signal carries a preamble sequence, or in other words, the first signal includes a preamble signal transmitted based on the preamble sequence; that is, a segment of the first signal is the preamble signal. Optionally, the first signal also carries data to be transmitted, that is, data to be transmitted by the first communication device to the second communication device. The following description uses the example of the first signal carrying both a preamble sequence and data. Optionally, the first signal is an uplink signal.

[0726] One possible implementation of the first communication device transmitting the preamble sequence is as follows: the first communication device modulates the preamble sequence and the data to be transmitted to generate a first signal; the first communication device transmits the first signal, and correspondingly, the second communication device receives the first signal. In this application, the method by which the first communication device modulates the preamble sequence and the data to be transmitted is not limited. Optionally, the first communication device performs OOK modulation on the preamble sequence and the data to be transmitted to generate the first signal. Optionally, the first communication device performs binary phase shift keying (BPSK) modulation on the preamble sequence and the data to be transmitted to generate the first signal.

[0727] 403. The second communication device synchronizes the received first signal based on the preamble sequence.

[0728] Optionally, the second communication device receives the signal within the time window during which the first signal may arrive, and performs a sliding correlation between the preamble sequence and the received first signal; then, it determines the position of the preamble sequence carried in the first signal based on the position of the maximum correlation value. One possible implementation of the second communication device synchronizing the received first signal based on the preamble sequence is as follows: the second communication device uses a correlator to perform correlation detection on the preamble sequence and the received sequence obtained based on the received first signal, obtaining a correlation value sequence; based on the time corresponding to the maximum value in this correlation value sequence, it determines the end position and / or start position of the preamble sequence carried in the first signal. This correlator includes an M-level register. This refers to the register depth of the m-th register in the M-level register set. The second communication device uses a correlator including the aforementioned M-level registers to perform correlation detection on the received sequence obtained from the received first signal based on a preamble sequence. Compared to using a correlator including other M-level registers to perform correlation detection on the received sequence obtained from the received first signal based on a preamble sequence, this reduces the detection complexity. Optionally, the second communication device demodulates the data in the first signal. Optionally, the second communication device is an access network device. Synchronization of the received first signal by the second communication device based on the preamble sequence can be performed in the DU or in the RU.

[0729] As an example, the second communication device can use a sliding window of length L to acquire a received sequence (corresponding to the received signal) of length (N+L), such that the received sequence [R] can be denoted as [R] = [R0, R1, ..., R N+L-1 Optionally, the received sequence is a received sequence of length (N+L) obtained by downsampling the received signal. Optionally, the received sequence is a received sequence of length (N+L) obtained by demodulating and decoding the received signal. The second communication device can perform correlation detection on the preamble sequence and the received sequence based on a correlator including M-level registers to obtain a correlation value sequence of length N, and then determine the position of the preamble sequence in the received sequence [R] based on the correlation value sequence, thereby achieving time synchronization. Figure 5 is a schematic diagram of using a correlator to perform correlation detection on the preamble sequence and the received sequence. As shown in Figure 5, the correlator includes M-level registers, M adders, and M subtractors. The second communication device can perform correlation detection on the preamble sequence and the received sequence at time T. k Enter R k , 0≤k≤N+L-1, and k is an integer. For example, input R0 at time T0, input R1 at time T1, ..., at time T... N+L-1 Enter R N+L-1 If the time delay caused by the correlator calculation is not considered, then T N-1 The correlation value output at time step is Ultimately, the correlator outputs (N+L-1) correlation values, which are the global aperiodic correlation value sequence between the received sequence and the preamble sequence. Since the length of the preamble sequence is N, T... N-1 Time to T N+L-1 The time corresponding to the maximum value among the (L+1) correlation values ​​output at time T is the end position of the preamble sequence in the received sequence [R]. Simultaneously, the start position of the preamble sequence in the received sequence [R] can be obtained based on the length N. The second communication device only needs the last (L+1) correlation values, therefore only T... N To T N+L-1 The addition at each time step is necessary, from T1 to T. N-1 The additions at each time step can be omitted; by recursively applying this process, the addition and subtraction steps required for each level can be obtained. Since the recursive process and the sequence [P]... n This means that the register depth of each level is related, so the order of the registers will affect the actual computational complexity required, i.e., the number of additions.

[0730] It's important to understand that the aforementioned correlation detection process can be understood as downsampling the received signal to obtain a received sequence of length N+L, which is then input into the correlator for detection. Alternatively, the preamble sequence can be upsampled and directly correlated with the received sequence; the performance is the same as correlation after downsampling the received signal, which will not be elaborated upon here.

[0731] The correlation detection method described above requires only log2N additions and log2N-1 subtractions for a Gray sequence of length N. However, the correlation of a non-generalized Gray sequence of length N usually requires (N-1) additions, as shown in formula (1) above. Therefore, using a Gray sequence as a leading sequence can reduce the detection complexity. For example, for a generalized Gray sequence of length N=8, each correlation value requires 3 additions and 2 subtractions. For another example, for a generalized Gray sequence of length N=4, each correlation value requires 2 additions and 1 subtraction. The following example illustrates the calculation process by correlating the received sequence with the sequence [A]. For example, a Gray sequence of length N=4 (i.e., the leading sequence) is sequence [A]=[1,1,-1,1]. A sliding window of length L=4 is used to obtain a received sequence of length N+L=8, such as the received sequence [R]=[R0,R1,…,R7]=[1,1,-1,1,0,0,0,0]. Where M = log₂N = 2, and the lengths of sequences [P], [W₁], and [W₂] are all 2, such as [P] = [0, 1], [W₁] = [W₂] = [1, -1]. Where P₁ = 0, then the register depth of the m=1th level register (denoted as register 1) is 2. 0 =1, the register includes 1 memory unit; P2=1, then the register depth of the m=2nd level register (i.e., register 2) is 2. 1 =2, this register includes 2 storage units. D1 and D2 are used below to represent the storage state of the storage units in register 1 and register 2 respectively, where the initial storage state of register 1 and register 2 is D1 = [0] and D2 = [0,0].

[0732] If the received sequence [R] is input sequentially into the correlator shown in Figure 5, then:

[0733] At time T0, the input R0 = 1, and D1 and D2 are updated to D1 = [1] and D2 = [1,0] respectively, resulting in an output correlation value of 1;

[0734] At time T1, the input R1 = 1, and D1 and D2 are updated to D1 = [1] and D2 = [2,1] respectively, resulting in an output correlation value of 0;

[0735] At time T2, the input R2 = -1, D1 and D2 are updated to D1 = [-1] and D2 = [0,2] respectively, and the correlation value of the output is -1;

[0736] At time T3, the input R3 = 1, and D1 and D2 are updated to D1 = [1] and D2 = [0,0] respectively, resulting in an output correlation value of 4;

[0737] At time T4, the input R4 = 0, and D1 and D2 are updated to D1 = [0] and D2 = [1,0] respectively, resulting in an output correlation value of -1;

[0738] At time T5, the input R5 = 0, and D1 and D2 are updated to D1 = [0] and D2 = [0,1] respectively, resulting in an output correlation value of 0;

[0739] At time T6, with input R6 = 0, D1 and D2 are updated to D1 = [0] and D2 = [0,0] respectively, and the correlation value of the output is 1;

[0740] At time T7, the input R7 = 0, and D1 and D2 are updated to D1 = [0] and D2 = [0,0] respectively, resulting in an output correlation value of 0.

[0741] The correlation value sequence obtained by correlating sequence [A] = [1,1,-1,1] with the received sequence [R] is [1,0,-1,4,-1,0,1,0]. Since the maximum correlation value in the correlation value sequence is the correlation value output at time T3, the end position of the preamble sequence in the received sequence [R] can be determined as R3. Furthermore, the start position of the preamble sequence in the received sequence [R] can be determined based on its length N, thus achieving time synchronization. The above detection process, i.e., the process of calculating the correlation value, is described using the correlation detection of the received sequence and sequence [A] as an example, where sequence [A] is the preamble sequence. It should be understood that if the received sequence and sequence [B] are correlated, the correlation value is obtained from the subtractor; where sequence [B] is the preamble sequence. If the preamble sequence is sequence [A, B], which is obtained by concatenating another set of complementary Gray sequences, if the received sequence and sequence [A, B] are correlated, the correlation values ​​need to be obtained from both the adder and subtractor and added together.

[0742] Table 1 shows the maximum autocorrelation sidelobes of the leader sequence provided in this application and the maximum autocorrelation sidelobes of a proposed leader sequence.

[0743] Table 1

[0744] Referring to Table 1, the maximum autocorrelation sidelobe of the leader sequence provided in this application is lower than that of the leader sequence in the proposal when the sequence length is longer.

[0745] Table 2 shows the percentage reduction in detection complexity compared to synchronizing the received signal based on the preamble sequence provided in this application versus synchronizing the received signal based on a non-generalized Gray sequence.

[0746] Table 2

[0747] In this embodiment, the first communication device transmits a preamble sequence. Because this preamble sequence has good autocorrelation, for example, its maximum autocorrelation sidelobe is lower than that of existing preamble sequences, the receiving side (i.e., the device receiving the signal carrying the preamble sequence) can improve synchronization detection performance by synchronizing the received signal based on this preamble sequence. Furthermore, synchronizing the received signal based on this preamble sequence reduces detection complexity compared to synchronizing based on existing preamble sequences.

[0748] The following describes the communication device provided in the embodiments of this application.

[0749] This application divides the communication device into functional modules according to the above method embodiments. For example, each function can be divided into its own functional modules, or two or more functions can be integrated into one processing module. The integrated modules can be implemented in hardware or as software functional modules. It should be noted that the module division in this application is illustrative and only represents one logical functional division; other division methods may be used in actual implementation. The communication device of the embodiments of this application will be described in detail below with reference to Figures 6 to 8.

[0750] Figure 6 is a schematic diagram of the structure of a communication device 60 provided in an embodiment of this application. As shown in Figure 6, the communication device includes a processing module 601 and a transceiver module 602. The transceiver module 602 can implement corresponding communication functions, and the processing module 601 is used to implement corresponding processing functions. For example, the transceiver module 602 can also be called an interface, a communication interface, or a communication module, etc.

[0751] In some embodiments of this application, the communication device can be used to perform the actions performed by the first communication device in the above method embodiments. The transceiver module 602 is used to perform the transmission and reception related operations of the first communication device in the above method embodiments, and the processing module 601 is used to perform the processing related operations of the first communication device in the above method embodiments.

[0752] In some embodiments, the processing module 601 is used for a preamble sequence, which can be any kind of preamble sequence provided in this application, and will not be described in detail here;

[0753] The transceiver module 602 is used to send the preamble sequence.

[0754] Reusing Figure 6, in some other embodiments of this application, the communication device can be used to perform the actions performed by the second communication device in the above method embodiments. The transceiver module 602 is used to perform the transceiver-related operations of the second communication device in the above method embodiments, and the processing module 601 is used to perform the processing-related operations of the second communication device in the above method embodiments.

[0755] In some embodiments, the transceiver module 602 is used to receive the first signal;

[0756] The processing module 601 is used to synchronize the received first signal based on a preamble sequence, which can be any preamble sequence provided in this application, and will not be described in detail here.

[0757] In some embodiments, the processing module 601 is specifically configured to use a correlator to perform correlation detection on the received first signal based on the preamble sequence to obtain a correlation value sequence; and to determine the end position and / or start position of the signal carrying the preamble sequence in the first signal based on the time corresponding to the maximum value in the correlation value sequence. The correlator includes an M-level register. It is the register depth of the m-th register in the M-level register.

[0758] Optionally, in the above embodiments, the communication device may further include a storage module, which can be used to store instructions and / or data. The processing module 601 can read the instructions and / or data in the storage module so that the communication device can implement the aforementioned method embodiments.

[0759] For details regarding the specific explanations of each term, noun, or step in the above embodiments, please refer to the descriptions in the above method embodiments; they will not be detailed here.

[0760] The specific descriptions of the transceiver module and processing module shown in the above embodiments are merely examples. For the specific functions or execution steps of the transceiver module and processing module, please refer to the above method embodiments, which will not be described in detail here.

[0761] The communication device of the present application embodiments has been described above. The following describes possible product forms of the communication device. Any product possessing the functions of the communication device shown in FIG. 6 above falls within the protection scope of the present application embodiments. The following description is merely illustrative and does not limit the product form of the communication device of the present application embodiments to this.

[0762] It should be understood that the communication device 60 here is embodied in the form of a functional module. The term "module" here may refer to application-specific integrated circuits (ASICs), electronic circuits, processors (e.g., shared processors, proprietary processors, or group processors) and memories for executing one or more software or firmware programs, combined logic circuits, and / or other suitable components that support the described functions.

[0763] The communication device 60 of each of the above-described schemes has the function of implementing the corresponding steps performed by the communication device (such as the first communication device or the second communication device) in the above-described methods. This function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above-described functions; for example, the transceiver module can be replaced by a transceiver (for example, the transmitting unit in the transceiver module can be replaced by a transmitter, and the receiving unit in the transceiver module can be replaced by a receiver), and other units, such as processing modules, can be replaced by processors, which respectively execute the transmission and reception operations and related processing operations in each method embodiment.

[0764] In addition, the transceiver module 602 can also be a transceiver circuit (for example, it may include a receiving circuit and a transmitting circuit), and the processing module 601 can be a processing circuit.

[0765] Figure 7 is a schematic diagram of another communication device provided in an embodiment of this application. As shown in Figure 7, the communication device includes one or more processors 720 and transceivers 710.

[0766] In other embodiments of this application, the communication device can be used to execute the steps, methods, or functions performed by the first communication device described above. For example, the processor 720 can be used to execute the functions or steps implemented by the processing module 601 shown in FIG. 6, and the transceiver 710 can be used to execute the functions or steps implemented by the transceiver module 602 shown in FIG. 6. Detailed descriptions of the processor 720 and the transceiver 710 can be found in FIG. 6 or the method embodiments shown above, and will not be elaborated further here.

[0767] In some embodiments of this application, the communication device is used to perform the steps, methods or functions performed by the second communication device described above. For example, the processor 720 can be used to perform the functions or steps implemented by the processing module 601 shown in FIG. 6, and the transceiver 710 can be used to perform the functions or steps implemented by the transceiver module 602 shown in FIG. 6.

[0768] In various implementations of the communication device shown in Figure 7, the transceiver may include a receiver for performing a receiving function (or operation) and a transmitter for performing a transmitting function (or operation). The transceiver is also used to communicate with other devices / appliances via a transmission medium.

[0769] Optionally, the communication device may further include one or more memories 730 for storing program instructions and / or data. The memory 730 is coupled to the processor 720. The coupling in this embodiment is an indirect coupling or communication connection between communication devices, units, or modules, and can be electrical, mechanical, or other forms, used for information exchange between the communication devices, units, or modules. The processor 720 may operate in conjunction with the memory 730. The processor 720 may execute program instructions stored in the memory 730. Optionally, at least one of the above-mentioned memories may be included in the processor.

[0770] This application embodiment does not limit the specific connection medium between the transceiver 710, processor 720, and memory 730. In Figure 7, the memory 730, processor 720, and transceiver 710 are connected via a bus 740, which is represented by a thick line. The connection methods between other components are only illustrative and not intended to be limiting. Buses can be categorized as address buses, data buses, control buses, etc. For ease of illustration, only one thick line is used in Figure 7, but this does not indicate that there is only one bus or one type of bus.

[0771] In the embodiments of this application, the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., and can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly manifested as being executed by a hardware processor, or being executed by a combination of hardware and software modules within the processor.

[0772] In this application embodiment, the memory may include, but is not limited to, non-volatile memory such as hard disk drive (HDD) or solid-state drive (SSD), random access memory (RAM), erasable programmable read-only memory (EPROM), read-only memory (ROM), or compact disc read-only memory (CD-ROM), etc. Memory is any storage medium capable of carrying or storing program code in the form of instructions or data structures, and capable of being read and / or written by a computer (such as the communication device shown in this application), but is not limited to this. The memory in this application embodiment may also be a circuit or any other device capable of implementing storage functions, used to store program instructions and / or data.

[0773] The processor 720 is primarily used for processing communication protocols and data, controlling the entire communication device, executing software programs, and processing software program data. The memory 730 is primarily used for storing software programs and data. The transceiver 710 may include control circuitry and an antenna. The control circuitry is primarily used for converting baseband signals to radio frequency signals and processing radio frequency signals. The antenna is primarily used for transmitting and receiving radio frequency signals in the form of electromagnetic waves. Input / output devices, such as touchscreens, displays, and keyboards, are primarily used for receiving user input data and outputting data to the user.

[0774] When the communication device is powered on, the processor 720 can read the software program in the memory 730, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor 720 performs baseband processing on the data to be transmitted and outputs the baseband signal to the radio frequency (RF) circuit. The RF circuit then performs RF processing on the baseband signal and transmits the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processor 720. The processor 720 converts the baseband signal back into data and processes the data.

[0775] In another implementation, the aforementioned radio frequency circuits and antennas can be set up independently of the processor that performs baseband processing. For example, in a distributed scenario, the radio frequency circuits and antennas can be arranged in a remote manner, independent of the communication device.

[0776] The communication device shown in this application embodiment may also have more components than those in Figure 7, and this application embodiment does not limit this. The methods executed by the processor and transceiver shown above are only examples, and the specific steps executed by the processor and transceiver can be referred to the methods described above.

[0777] In another possible implementation, in the communication device shown in FIG6, the processing module 601 can be one or more logic circuits, and the transceiver module 602 can be an input / output interface, or a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiver module 602 can also be a sending module and a receiving module. The sending module can be an output interface, and the receiving module can be an input interface. The sending module and the receiving module are integrated into one module, such as an input / output interface. As shown in FIG8, the communication device shown in FIG8 includes a logic circuit 801 and an interface 802. FIG8 is another structural schematic diagram of the communication device provided in the embodiments of this application. The above-mentioned processing module 601 can be implemented by the logic circuit 801, and the transceiver module 602 can be implemented by the interface 802. Among them, the logic circuit 801 can be a chip, a processing circuit, an integrated circuit, or a system on chip (SoC) chip, etc., and the interface 802 can be a communication interface, an input / output interface, a pin, etc. For example, FIG8 uses the above-mentioned communication device as a chip, which includes a logic circuit 801 and an interface 802.

[0778] In this embodiment, the logic circuit and the interface can also be coupled to each other. The specific connection method of the logic circuit and the interface is not limited in this embodiment. For example, the logic circuit 801 can be used to execute the functions or steps implemented by the processing module 601 shown in FIG. 6, and the interface 802 can be used to execute the functions or steps implemented by the transceiver module 602 shown in FIG. 6. For a detailed description of the logic circuit 801 and the interface 802, please refer to FIG. 6 or the method embodiment shown above, which will not be detailed here.

[0779] The communication device shown in the embodiments of this application can implement the method provided in the embodiments of this application in hardware form, or it can implement the method provided in the embodiments of this application in software form, etc., and the embodiments of this application do not limit it in this way.

[0780] Furthermore, embodiments of this application also provide a communication system, which includes a first communication device and a second communication device, which can be used to execute the methods in any of the foregoing embodiments.

[0781] This application also provides a computer-readable storage medium storing a computer program or instructions that, when run on a computer, cause the computer to perform the methods of the above embodiments.

[0782] This application also provides a computer program product, which includes instructions or a computer program that, when run on a computer, causes the methods in the above embodiments to be executed.

[0783] This application also provides a chip, which includes: a communication interface and a processor; the communication interface is used for signal transmission and reception of the chip; the processor is used to execute computer program instructions, causing a communication device including the chip to perform the methods as described in the above embodiments.

[0784] In the several embodiments provided in this application, it should be understood that the disclosed systems, communication devices, and methods can be implemented in other ways. For example, the communication device embodiments described above are merely illustrative. For instance, the division of modules is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple modules or components may be combined or integrated into another system, or some features may be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be indirect coupling or communication connection through some interfaces, communication devices, or modules, or it may be an electrical, mechanical, or other form of connection. Modules described as separate components may or may not be physically separate, and components shown as modules may or may not be physical modules, that is, they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected according to actual needs to achieve the technical effects of the solutions provided in the embodiments of this application.

[0785] Furthermore, the functional modules in the various embodiments of this application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0786] If the integrated module is implemented as a software functional module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a readable storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned readable storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0787] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, etc.) containing computer-usable program code.

[0788] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in one or more blocks of the flowchart illustrations and / or one or more blocks of the block diagrams.

[0789] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means that implement the functions specified in one or more flowcharts and / or one or more block diagrams.

[0790] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, such that the instructions, which execute on the computer or other programmable apparatus, provide steps for implementing the functions specified in one or more flowcharts and / or one or more block diagrams.

[0791] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

A communication method, characterized in that, include: Determine the leader sequence; Send the preamble sequence, which is any one of the following or an equivalent sequence of any one of the following: [1,1,-1,1,1,-1,-1,-1,-1]; or, [1,-1,1,1,1,1,1,1,-1]; or, [1,-1,-1,-1,1,1,-1,1]; or, [1,1,1,-1,1,-1,1,1]； The leading sequence and its equivalent sequence satisfy any of the following: the leading sequence is obtained by inverting the elements in its equivalent sequence; the leading sequence is obtained by reversing the elements in its equivalent sequence; the leading sequence is obtained by inverting and reversing the elements in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing the elements. A communication method, characterized in that, include: Receive the first signal; The received first signal is synchronized based on the preamble sequence; The leading sequence is any one of the following or an equivalent sequence of any one of the following: [1,1,-1,1,1,-1,-1,-1,-1]; or, [1,-1,1,1,1,1,1,1,-1]; or, [1,-1,-1,-1,1,1,-1,1]; or, [1,1,1,-1,1,-1,1,1]； The leading sequence and its equivalent sequence satisfy any of the following: the leading sequence is obtained by inverting the elements in its equivalent sequence; the leading sequence is obtained by reversing the elements in its equivalent sequence; the leading sequence is obtained by inverting and reversing the elements in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing the elements. The method according to claim 1 or 2, characterized in that, The leading sequence is [a m+1 ,b m+1 ], the a m+1 and the b m+1 Let W1, W2, and P be a set of Gray complementary sequences determined by sequences [W1], [W2], and [P], where the lengths of all sequences are M, where M is an integer greater than or equal to 1. m,1 W is the m-th element in the sequence [W1]. m,2 W is the m-th element in the sequence [W2]. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0]. It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m a is an integer greater than or equal to 0. m+1 The nth element in is a m+1 (n), the b m+1 The nth element in is b m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) and the b m+1 (n) satisfies the following formula: a1(n) = δ(n); b1(n)=δ(n); When n = 0, δ(n) = 1; when n ≠ 0, δ(n) = 0. The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1], and both sequence [W1] and sequence [W2] are [-1,1]; or... The leading sequence is [1,-1,1,1,1,1,1,-1], and both sequence [W1] and sequence [W2] are [1,-1]; or, The leading sequence is [1,-1,-1,-1,1,1,-1,1], and both sequence [W1] and sequence [W2] are [-1,-1]; or, The leading sequence is [1,1,1,-1,1,-1,1,1], and both the sequence [W1] and the sequence [W2] are [1,1]. The method according to claim 1 or 2, characterized in that, The leading sequence is a Gray sequence determined based on sequence [W1], sequence [W2], and sequence [P], where the lengths of sequence [W1], sequence [W2], and sequence [P] are all M, where M is an integer greater than or equal to 1. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0,2]. It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m A is an integer greater than or equal to 0, and the nth element in the preceding sequence is A. n =a m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) satisfies the following formula: a1(n) = δ(n); b1(n)=δ(n); Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0; The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1], the sequence [W1] is [-1,1,1], and the sequence [W2] is [-1,1,-1]; or... The leading sequence is [1,-1,1,1,1,1,1,-1], the sequence [W1] is [1,-1,1], and the sequence [W2] is [1,-1,-1]; or... The leading sequence is [1,-1,-1,-1,1,1,-1,1], the sequence [W1] is [-1,-1,1], and the sequence [W2] is [-1,-1,-1]; or... The leading sequence is [1,1,1,-1,1,-1,1,1], the sequence [W1] is [1,1,1], and the sequence [W2] is [1,1,-1]. A communication method, characterized in that, include: Determine the leader sequence; Send the preamble sequence, which is any one of the following or an equivalent sequence of any one of the following: [1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,1]; or, [1,-1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,-1]; or, [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,1]; or, [1,1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1]; or, [1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,1,-1]; or, [1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,-1,1]; or, [1,1,1,-1,1,-1,1,1,1,1,1,-1,-1,1,-1,-1,-1]; or, [1,1,-1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,1]; or, [1,-1,-1,-1,1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1]; or, [1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,1]; or, [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,1,1]; or, [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1]; or, [1,-1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,1,1,-1,-1,-1,1,1,1,-1,1,-1,1,1]; or, [1,1,-1,1,-1,1,1,1,1,1,1,1,-1,-1,1,-1,-1]; or, [1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,-1]; or, [1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1]; or, [1,1,1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1]; or, [1,1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1]; or, [1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,-1,-1,1,-1,1,-1,1,1,1,1,-1,1,-1,1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1]; or, [1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1]; or, [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,1]; or, [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1]; or, [1,-1,1,1,1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1]; or, [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1]; or, [1,-1,-1,-1,1,-1,1,1,1,1,-1,1,1,1,-1,1,1,1,-1]; or, [1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1]; or, [1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1]; or, [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1]; or, [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1]; or, [1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1]; or, [1,-1,1,-1,1,1,-1,-1,1,1,1,1,-1,-1,-1,1]; or, [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1]; or, [1,-1,1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1,1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1]; or, [1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,1,-1,-1]； The leading sequence and its equivalent sequence satisfy any of the following: the leading sequence is obtained by inverting the elements in its equivalent sequence; the leading sequence is obtained by reversing the elements in its equivalent sequence; the leading sequence is obtained by inverting and reversing the elements in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing the elements. A communication method, characterized in that, include: Receive the first signal; The received first signal is synchronized based on a preamble sequence, wherein the preamble sequence is any one of the following or an equivalent sequence of any one of the following: [1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,1]; or, [1,-1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,-1]; or, [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,1]; or, [1,1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1]; or, [1,-1,1,1,-1,-1,-1,1,1,-1,1,1,1,1,-1]; or, [1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,-1,1]; or, [1,1,1,-1,1,-1,1,1,1,1,1,-1,-1,1,-1,-1,-1]; or, [1,1,-1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,1]; or, [1,-1,-1,-1,1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1]; or, [1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,1]; or, [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,1,1]; or, [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1]; or, [1,-1,1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,1,1,-1,-1,-1,1,1,1,-1,1,-1,1,1]; or, [1,1,-1,1,-1,1,1,1,1,1,1,1,-1,-1,1,-1,-1]; or, [1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,-1]; or, [1,-1,-1,-1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1]; or, [1,1,1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1]; or, [1,1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1]; or, [1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,-1,-1,1,-1,1,-1,1,1,1,1,-1,1,-1,1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1]; or, [1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1]; or, [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,1]; or, [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1]; or, [1,-1,1,1,1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1]; or, [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1]; or, [1,-1,-1,-1,1,-1,1,1,1,1,-1,1,1,1,-1,1,1,1,-1]; or, [1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1]; or, [1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1]; or, [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1]; or, [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1]; or, [1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1]; or, [1,-1,1,-1,1,1,-1,-1,1,1,1,1,-1,-1,-1,1]; or, [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1]; or, [1,-1,1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1,1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1]; or, [1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,1,-1,-1]； The leading sequence and its equivalent sequence satisfy any of the following: the leading sequence is obtained by inverting the elements in its equivalent sequence; the leading sequence is obtained by reversing the elements in its equivalent sequence; the leading sequence is obtained by inverting and reversing the elements in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing the elements. The method according to claim 5 or 6, characterized in that, The leading sequence is [a m+1 ,b m+1 ], the a m+1 and the b m+1 Let W1, W2, and P be a set of Gray complementary sequences determined by sequences [W1], [W2], and [P], where the lengths of all sequences are M, where M is an integer greater than or equal to 1. m,1 W is the m-th element in the sequence [W1]. m,2 W is the m-th element in the sequence [W2]. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0]. It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m a is an integer greater than or equal to 0. m+1 The nth element in is a m+1 (n), the b m+1 The nth element in is b m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) and the b m+1 (n) satisfies the following formula: a1(n) = δ(n); b1(n)=δ(n); Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0; The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,1,1,1], the sequences [W1] and [W2] are both [-1,1,1], and the sequence [P] is [1,0,2]; or... The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [1,0,2]; or... The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [1,0,2]; or... The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,-1,1,1,1], the sequences [W1] and [W2] are both [1,1,-1], and the sequence [P] is [1,0,2]; or... The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,1,-1], and the sequence [P] is [1,0,2]; or... The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,1,-1,1,1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [1,0,2]; or... The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [1,0,2]; or... The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,1,-1,-1,-1,1,-1,-1], the sequences [W1] and [W2] are both [1,1,1], and the sequence [P] is [1,0,2]; or... The leading sequence is [1,1,-1,1,1,1,1,-1,1,1,-1,1,1,-1,1,-1,-1,-1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [0,1,2]; or... The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [0,1,2]; or... The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [0,1,2]; or... The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [0,1,2]; or... The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,1,-1,1,1,1], the sequences [W1] and [W2] are both [-1,1,1], and the sequence [P] is [2,0,1]; or... The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [2,0,1]; or... The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [2,0,1]; or... The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,1], the sequences [W1] and [W2] are both [1,1,-1], and the sequence [P] is [2,0,1]; or... The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,1,1,-1,-1,1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,1,-1], and the sequence [P] is [2,0,1]; or... The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,1,-1,1,1,1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [2,0,1]; or... The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [2,0,1]; or... The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,-1,1,1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,1], and the sequence [P] is [2,0,1]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [0,2,1]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [0,2,1]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [0,2,1]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [0,2,1]; or... The leading sequence is [1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,1], the sequences [W1] and [W2] are both [-1,1,1], and the sequence [P] is [2,1,0]; or... The leading sequence is [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [2,1,0]; or... The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [2,1,0]; or... The leading sequence is [1,-1,1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,1,-1], and the sequence [P] is [2,1,0]; or... The leading sequence is [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1], the sequences [W1] and [W2] are both [-1,1,-1], and the sequence [P] is [2,1,0]; or... The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [2,1,0]; or... The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [2,1,0]; or... The leading sequence is [1,1,1,-1,1,1,-1,1,1,-1,1,1,1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,1], and the sequence [P] is [2,1,0]; or... The leading sequence is [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1,1], the sequences [W1] and [W2] are both [-1,1,1], and the sequence [P] is [1,2,0]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [1,-1,1], and the sequence [P] is [1,2,0]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,1], and the sequence [P] is [1,2,0]; or... The leading sequence is [1,-1,1,-1,1,1,-1,-1,1,1,1,1,1,-1,-1,-1,1], the sequences [W1] and [W2] are both [1,1,-1], and the sequence [P] is [1,2,0]; or... The leading sequence is [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1], the sequences [W1] and [W2] are both [-1,1,-1], and the sequence [P] is [1,2,0]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1], and the sequence [P] is [1,2,0]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1], and the sequence [P] is [1,2,0]; or... The leading sequence is [1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,1], and the sequence [P] is [1,2,0]. The method according to claim 5 or 6, characterized in that, The leading sequence is a Gray sequence determined based on sequence [W1], sequence [W2], and sequence [P], where the lengths of sequence [W1], sequence [W2], and sequence [P] are all M, where M is an integer greater than or equal to 1. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m The m-th element in the sequence [P] It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m A is an integer greater than or equal to 0, and the nth element in the preceding sequence is A. n =a m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) satisfies the following formula: a1(n) = δ(n); b1(n)=δ(n); Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0; The leading sequence is [1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [1,0,2,3]; or... The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [1,0,2,3]; or... The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [1,0,2,3]; or... The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,1,-1,1,-1,1,1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [1,0,2,3]; or... The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,-1,-1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [1,0,2,3]; or... The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,1,-1,1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [1,0,2,3]; or... The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [1,0,2,3]; or... The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,1,-1,-1,-1,1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [1,0,2,3]; or... The leading sequence is [1,1,-1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [0,1,2,3]; or... The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [0,1,2,3]; or... The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [0,1,2,3]; or... The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [0,1,2,3]; or... The leading sequence is [1,1,1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [2,0,1,3]; or... The leading sequence is [1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [2,0,1,3]; or... The leading sequence is [1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [2,0,1,3]; or... The leading sequence is [1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [2,0,1,3]; or... The leading sequence is [1,1,-1,1,-1,1,1,1,1,1,1,1,-1,-1,1,-1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [2,0,1,3]; or... The leading sequence is [1,-1,-1,-1,1,1,-1,1,1,1,-1,1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [2,0,1,3]; or... The leading sequence is [1,-1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [2,0,1,3]; or... The leading sequence is [1,1,1,-1,1,-1,1,1,1,1,-1,1,1,-1,-1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [2,0,1,3]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1,-1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [0,2,1,3]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [0,2,1,3]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [0,2,1,3]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [0,2,1,3]; or... The leading sequence is [1,1,1,-1,-1,-1,1,1,-1,1,-1,1,1,-1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [2,1,0],3; or... The leading sequence is [1,1,-1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [2,1,0,3]; or... The leading sequence is [1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [2,1,0,3]; or... The leading sequence is [1,-1,1,1,1,-1,-1,-1,1,1,1,-1,1,1,-1,1,-1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [2,1,0,3]; or... The leading sequence is [1,-1,1,1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [2,1,0,3]; or... The leading sequence is [1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [2,1,0,3]; or... The leading sequence is [1,-1,-1,-1,-1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [2,1,0,3]; or... The leading sequence is [1,1,1,-1,1,1,-1,1,1,-1,1,1,1,-1,-1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [2,1,0,3]; or... The leading sequence is [1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,1,1], the sequence [W1] is [-1,1,1,1], the sequence [W2] is [-1,1,1,-1], and the sequence [P] is [1,2,0,3]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1], the sequence [W1] is [1,-1,1,1], the sequence [W2] is [1,-1,1,-1], and the sequence [P] is [1,2,0,3]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,1,1], the sequence [W2] is [-1,-1,1,-1], and the sequence [P] is [1,2,0,3]; or... The leading sequence is [1,-1,1,-1,1,1,-1,-1,1,1,1,1,-1,-1,-1,1], the sequence [W1] is [1,1,-1,1], the sequence [W2] is [1,1,-1,-1], and the sequence [P] is [1,2,0,3]; or... The leading sequence is [1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,1,-1,1,-1], the sequence [W1] is [-1,1,-1,1], the sequence [W2] is [-1,1,-1,-1], and the sequence [P] is [1,2,0,3]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1], and the sequence [P] is [1,2,0,3]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1], the sequence [W1] is [-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1], and the sequence [P] is [1,2,0,3]; or... The leading sequence is [1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,1,-1,-1,-1], the sequence [W1] is [1,1,1,1], the sequence [W2] is [1,1,1,-1], and the sequence [P] is [1,2,0,3]. A communication method, characterized in that, include: Determine the leader sequence; Send the preamble sequence, which is any one of the following or an equivalent sequence of any one of the following: [1,1,1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,1,1]; or, [1,-1,1,-1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1]; or, [1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,-1,-1,-1]; or, [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,-1]; or, [1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1]; or, [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1]; or, [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1]; or, [1,-1,1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,1]; or, [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,-1,-1,-1]; or, [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,-1,-1,-1]; or, [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1]; or, [1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,1]; or, [1,-1,1,-1,-1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,1]; or, [1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1]; or, [1,1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,1,-1,-1,1,1,-1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,-1,1,1,1]; or, [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,1]; or, [1,-1,1,-1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,-1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,1,1,1,1,-1,1,-1,1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,-1,-1,1]； The leading sequence and its equivalent sequence satisfy any of the following: the leading sequence is obtained by inverting the elements in its equivalent sequence; the leading sequence is obtained by reversing the elements in its equivalent sequence; the leading sequence is obtained by inverting and reversing the elements in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing the elements. A communication method, characterized in that, include: Receive the first signal; Based on the preamble sequence and synchronization with the received first signal, the preamble sequence is any one of the following or an equivalent sequence of any one of the following: [1,1,1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,1,1]; or, [1,-1,1,-1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1]; or, [1,1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,-1,-1,-1]; or, [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,-1]; or, [1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1]; or, [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1]; or, [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1]; or, [1,-1,1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,-1,-1,1,-1,-1,1]; or, [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,-1,-1,-1]; or, [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,1,1,1,-1,-1,1,-1,-1,-1,-1,-1,-1]; or, [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1]; or, [1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,1]; or, [1,-1,1,-1,-1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,1]; or, [1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,1,1]; or, [1,1,-1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,-1,1,-1,-1,1,1,-1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,1,1,-1,1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,-1,1,1,1]; or, [1,1,-1,-1,-1,1,-1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]; or, [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,1]; or, [1,-1,1,-1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,-1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,1,1,1,1,-1,1,-1,1,-1]; or, [1,-1,-1,1,-1,-1,-1,-1,-1,1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,-1,-1,1]； The leading sequence and its equivalent sequence satisfy any of the following: the leading sequence is obtained by inverting the elements in its equivalent sequence; the leading sequence is obtained by reversing the elements in its equivalent sequence; the leading sequence is obtained by inverting and reversing the elements in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence; the leading sequence is obtained by replacing -1 with 0 in its equivalent sequence and then inverting and / or reversing the elements. The method according to claim 9 or 10, characterized in that, The leading sequence is [a m+1 ,b m+1 ], the a m+1 and the b m+1 Let W1, W2, and P be a set of Gray complementary sequences determined by sequences [W1], [W2], and [P], where the lengths of all sequences are M, where M is an integer greater than or equal to 1. m,1 W is the m-th element in the sequence [W1]. m,2 W is the m-th element in the sequence [W2]. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m Let m be the m-th element in the sequence [P], where the sequence [P] is [1,0]. It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m a is an integer greater than or equal to 0. m+1 The nth element in is a m+1 (n), the b m+1 The nth element in is b m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) and the b m+1 (n) satisfies the following formula: a1(n) = δ(n); b1(n)=δ(n); Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0; The leading sequence is [1,1,1,1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,-1,1], and the sequence [P] is [2,0,3,1]; or... The leading sequence is [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,1,1,1,1], the sequences [W1] and [W2] are both [-1,1,-1,1], and the sequence [P] is [2,0,3,1]; or... The leading sequence is [1,-1,1,-1,1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,-1,-1,1], and the sequence [P] is [2,0,3,1]; or... The leading sequence is [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,-1,1], and the sequence [P] is [2,0,3,1]; or... The leading sequence is [1,1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,1,1,-1,1,-1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [1,1,-1,-1], and the sequence [P] is [2,0,3,1]; or... The leading sequence is [1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,-1], the sequences [W1] and [W2] are both [-1,1,-1,-1], and the sequence [P] is [2,0,3,1]; or... The leading sequence is [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,-1,-1,1,1,-1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1,-1], and the sequence [P] is [2,0,3,1]; or... The leading sequence is [1,-1,-1,1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1,-1], and the sequence [P] is [2,0,3,1]; or... The leading sequence is [1,1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,1,1,1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,-1,1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1], the sequences [W1] and [W2] are both [-1,1,-1,1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [1,-1,-1,1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,-1,1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1,1,-1], the sequences [W1] and [W2] are both [1,1,1,-1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,1,-1,1], the sequences [W1] and [W2] are both [-1,1,1,-1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,-1,1,-1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,1,-1,-1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,1,-1,1,-1,1,-1], the sequences [W1] and [W2] are both [-1,1,-1,-1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,1,1,1,-1,1,-1,1,-1,1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1,-1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1,-1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,1,1,1,1,1,-1,-1,-1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1], the sequences [W1] and [W2] are both [1,1,1,1], and the sequence [P] is [2,1,3,0]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,-1,1], and the sequence [P] is [3,0,2,1]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,1,-1,1,1,-1,1,1,1,1], the sequences [W1] and [W2] are both [-1,1,-1,1], and the sequence [P] is [3,0,2,1]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,-1,-1,1], and the sequence [P] is [3,0,2,1]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,-1,1], and the sequence [P] is [3,0,2,1]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [1,1,-1,-1], and the sequence [P] is [3,0,2,1]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1], the sequences [W1] and [W2] are both [-1,1,-1,-1], and the sequence [P] is [3,0,2,1]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,1,1,1,1,-1,1,-1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1,-1], and the sequence [P] is [3,0,2,1]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1,-1], and the sequence [P] is [3,0,2,1]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [1,1,-1,1], and the sequence [P] is [3,1,2,0]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1], the sequences [W1] and [W2] are both [-1,1,-1,1], and the sequence [P] is [3,1,2,0]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1], the sequences [W1] and [W2] are both [1,-1,-1,1], and the sequence [P] is [3,1,2,0]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequences [W1] and [W2] are both [-1,-1,-1,1], and the sequence [P] is [3,1,2,0]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,-1,1], the sequences [W1] and [W2] are both [1,1,-1,-1], and the sequence [P] is [3,1,2,0]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,1,-1,1,-1], the sequences [W1] and [W2] are both [-1,1,-1,-1], and the sequence [P] is [3,1,2,0]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,1,1,1,-1,1,1,-1,1,-1], the sequences [W1] and [W2] are both [1,-1,-1,-1], and the sequence [P] is [3,1,2,0]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1], the sequences [W1] and [W2] are both [-1,-1,-1,-1], and the sequence [P] is [3,1,2,0]. The method according to claim 9 or 10, characterized in that, The leading sequence is a Gray sequence determined based on sequence [W1], sequence [W2], and sequence [P], wherein the lengths of sequence [W1], sequence [W2], and sequence [P] are all M, where M is an integer W greater than or equal to 1. m,1 ∈{1,-1}, W m,2 ∈{1,-1}, 1≤m≤M, P m The m-th element in the sequence [P] It is the register depth of the m-th register in the M-th register used to generate the Gray complement sequence, wherein P m A is an integer greater than or equal to 0, and the nth element in the preceding sequence is A. n =a m+1 (n), 0≤n≤N-1, where n is an integer and N is an integer greater than 1, and the a m+1 (n) satisfies the following formula: a1(n) = δ(n); b1(n)=δ(n); Where δ(n) is the impulse function, when n=0, δ(n)=1, and when n≠0, δ(n)=0; The leading sequence is [1,1,1,1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or... The leading sequence is [1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or... The leading sequence is [1,-1,1,-1,1,1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,-1,-1,1,1], the sequence [W2] is [1,-1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or... The leading sequence is [1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [2,0,3,1,4]; or... The leading sequence is [1,1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,1,1,1,1,-1,1,-1,-1,-1,-1,1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or... The leading sequence is [1,1,-1,-1,-1,1,1,-1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,-1,1,-1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or... The leading sequence is [1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or... The leading sequence is [1,-1,-1,1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1], and the sequence [P] is [2,0,3,1,4]; or... The leading sequence is [1,1,1,1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,1,1,1,1], the sequence [W2] is [-1,1,1,1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,1,1,1,-1,-1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,1,-1,-1,1,1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1], the sequence [W1] is [1,-1,-1,1,1], the sequence [W2] is [1,-1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1,1,-1], the sequence [W1] is [1,1,1,-1,1], the sequence [W2] is [1,1,1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,-1,1,-1,-1,1,1,-1,1,1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,1,1,-1,-1,1,-1,1,-1,1,-1,1], the sequence [W1] is [-1,1,1,-1,1], the sequence [W2] is [-1,1,1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,-1,1,-1,1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,-1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,1,1,-1,1,-1,1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,1,1,1,1,1,-1,-1,1,-1,1,-1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,1,1,1,-1,-1,-1,1,1,1,1], the sequence [W1] is [1,1,1,1,1], the sequence [W2] is [1,1,1,1,-1], and the sequence [P] is [2,1,3,0,4]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,-1,1,-1,1,1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,1,-1,1], the sequence [W1] is [1,-1,-1,1,1], the sequence [W2] is [1,-1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [3,0,2,1,4]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,-1,1,1,-1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,1,-1,-1,-1,-1,1,1,1,1,1,1,-1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1,-1], and the sequence [P] is [3,0,2,1,4]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [1,1,-1,1,1], the sequence [W2] is [1,1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or... The leading sequence is [1,1,1,1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,1,-1,1,1,1,-1,1,1,1,1], the sequence [W1] is [-1,1,-1,1,1], the sequence [W2] is [-1,1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,1,1,1,1,1,-1,1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1], the sequence [W1] is [1,-1,-1,1,1], the sequence [W2] is [1,-1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or... The leading sequence is [1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1], the sequence [W1] is [-1,-1,-1,1,1], the sequence [W2] is [-1,-1,-1,1,-1], and the sequence [P] is [3,1,2,0,4]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,1,1,-1,1,-1,-1,1,-1,1,-1,1,-1,1], the sequence [W1] is [1,1,-1,-1,1], the sequence [W2] is [1,1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4]; or... The leading sequence is [1,-1,1,-1,-1,-1,1,1,-1,1,1,-1,1,1,1,1,1,1,1,-1,1,1,-1,1,1,-1,1,-1,1,-1], the sequence [W1] is [-1,1,-1,-1,1], the sequence [W2] is [-1,1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,1,1,-1,1,1,-1,1,-1], the sequence [W1] is [1,-1,-1,-1,1], the sequence [W2] is [1,-1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4]; or... The leading sequence is [1,-1,-1,1,-1,-1,-1,-1,-1,-1,1,-1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1], the sequence [W1] is [-1,-1,-1,-1,1], the sequence [W2] is [-1,-1,-1,-1,-1], and the sequence [P] is [3,1,2,0,4]. A communication device, characterized in that, Includes a module for performing the method as described in any one of claims 1-12. A communication device, characterized in that, The device includes a processor coupled to a memory for storing computer programs or instructions, and the processor is configured to execute the computer programs or instructions in the memory, causing the communication device to perform the method as described in any one of claims 1 to 12. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program or instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 12. A computer program product, characterized in that, When the computer program product is run on a computer, it causes the computer to perform the method as described in any one of claims 1 to 12.

Images