A data transmission method and apparatus

Abstract

The present application provides a data transmission method and apparatus. The method includes: generating a physical layer protocol data unit (PPDU), where the PPDU includes a training field, and the training field includes a sequence for target sensing; and transmitting the PPDU. Through the technical solution provided by the present application, target sensing can be performed and the sensing performance can be improved.

Description

Technical Field

[0001] This application relates to the field of communication technologies, and particularly to a data transmission method and apparatus. Background Art

[0002] Wireless Local Area Network (WLAN) sensing is a technology for target sensing using wireless signals. This technology is based on the ability to measure radio and sample the environment. Each communication path between two physical devices provides an opportunity to extract information about its surrounding environment. WLAN devices have been increasingly widely used due to advantages such as no need for wiring, high mobility, and fast transmission rate. Therefore, WLAN Sensing based on the WLAN standard has very broad application prospects.

[0003] Existing IEEE 802.11 series standards include mainstream low-frequency band (e.g., 2.4 GHz and 5 GHz) related standards (e.g., 802.11n, 802.11ac, 802.11ax, etc.) and high-frequency band (e.g., 60 GHz) related standards (e.g., 802.11ad, 802.11ay). Existing WLAN Sensing in the prior art generally performs target sensing based on the above existing standards.

[0004] High-frequency band (e.g., 60 GHz) signals have short wavelengths, are sensitive to moving targets, have large transmission bandwidths, and high range resolutions. Therefore, they have good target sensing advantages. However, the sequences adopted by existing high-frequency band related standards are all designed for optimal communication, and thus cannot achieve optimal sensing. Summary of the Invention

[0005] This application provides a data transmission method and apparatus, which can be used for target sensing and improve sensing performance.

[0006] The first aspect of this application provides a data transmission method, including:

[0007] Generate a Physical Layer Protocol Data Unit (PPDU), where the PPDU includes a training field, and the training field includes a sequence for target sensing;

[0008] Transmit the PPDU.

[0009] Based on the above embodiments, this application optimizes the design of the sequence, enabling the sequence to be applied to existing high-frequency band related standards and enabling higher-performance target sensing.

[0010] As a possible implementation of the first aspect, the sequence for target perception is obtained based on a binary sequence pair, an Alamouti matrix, and a Rohde - Sue - Morse PTM sequence. Among them, the Alamouti matrix includes:

[0011]

[0012] Among them, x and y are the binary sequence pair, are the reversed complex conjugates of x and y respectively, A0 corresponds to 0 in the PTM sequence, A1 corresponds to 1 in the PTM sequence, and the length of the PTM sequence is 2 M+1 , and M is an integer greater than 0.

[0013] Based on the above embodiments, the sequence for target perception obtained based on the binary sequence pair, the Alamouti matrix, and the Rohde - Sue - Morse PTM sequence is a variable - length sequence with high Doppler tolerance, which can be applied in existing high - frequency - band - related standards for target perception, and can improve the perception performance and has good perception function.

[0014] Among them, M can have different values. Different values of M correspond to sequences for perception with different lengths. The larger the value of M, the longer the sequence for target perception generated, and the smaller the interference between sequences when the sequence is used for perception, and the better the perception performance. Since the transmission time of the sequence for target perception needs to be less than the maximum accumulation time when the sequence is used for perception, optionally, M takes integer values from 1 to 5. The perception performance of the sequence for target perception with the corresponding length within this value range is better. However, the value range of M is not limited to this.

[0015] As a possible implementation of the first aspect, when M = 1, the sequence for target perception is S Vm11 、S Hm12 ; Among them, the S Vm11 、S Hm12 are respectively:

[0016]

[0017]

[0018] As a possible implementation of the first aspect, when M = 2, the S Vm21 、S Hm22 of the sequence for target perception; Among them, the S Vm21 、S Hm22 are respectively:

[0019]

[0020]

[0021] As a possible implementation of the first aspect, when M = 3, the S of the sequence for target perception Vm31 、S Hm32 ; where the S Vm31 、S Hm32 are respectively:

[0022]

[0023]

[0024] As a possible implementation of the first aspect, the sequence length of the binary sequence pair includes any one of the following: 256 bits, 512 bits, 1024 bits, 2048 bits.

[0025] Based on the above embodiments, the binary sequence pair is used as the base sequence for generating the sensing sequence. The local region has low autocorrelation and low cross-correlation. The sensing sequence generated based on the binary sequence pair with low autocorrelation and low cross-correlation has high Doppler tolerance and better target sensing performance.

[0026] As a possible implementation of the first aspect, when the sequence length of the binary sequence pair is 256 bits, the sequences corresponding to the binary sequence pair are respectively:

[0027] Sn2561, Sn2562; where the specific forms of Sn2561 and Sn2562 are shown in the specific implementation manners.

[0028] As a possible implementation of the first aspect, when the sequence length of the binary sequence pair is 512 bits, the sequences corresponding to the binary sequence pair are respectively:

[0029] Sn5121, Sn5122; where the specific forms of Sn5121 and Sn5122 are shown in the specific implementation manners.

[0030] As a possible implementation of the first aspect, when the sequence length of the binary sequence pair is 1024, the sequences corresponding to the binary sequence pair are respectively:

[0031] Sn10241, Sn10242; where the specific forms of Sn10241 and Sn10242 are shown in the specific implementation manners.

[0032] As a possible implementation of the first aspect, when the sequence length of the binary sequence pair is 2048, the sequences corresponding to the binary sequence pair are respectively:

[0033] Sn20481; Sn20482; wherein, the specific forms of the Sn20481; Sn20482 are shown in the specific embodiments.

[0034] The second aspect of the present application provides a data transmission method, including:

[0035] Receiving a physical layer protocol data unit (PPDU), the PPDU includes a training field, and the training field includes a sequence for target sensing.

[0036] Performing target sensing according to the sequence for target sensing.

[0037] Based on the above embodiments, the present application has optimized the design of the sequence, so that the sequence can be applied to existing high-frequency band related standards and can perform higher-performance target sensing.

[0038] As a possible implementation manner of the second aspect, the sequence for target sensing is obtained based on a binary sequence pair, an Alamouti matrix, and a Lohete-Su-Morse (PTM) sequence, wherein the Alamouti matrix includes:

[0039]

[0040] wherein, x and y are the binary sequence pair, are the reverse complex conjugates of x and y respectively, A0 corresponds to 0 in the PTM sequence, A1 corresponds to 1 in the PTM sequence, and the length of the PTM sequence is 2 M+1 , and M is an integer greater than 0.

[0041] Based on the above embodiments, the sequence for target sensing obtained based on the binary sequence pair, the Alamouti matrix, and the PTM sequence is a variable-length sequence with high Doppler tolerance, which can be applied to existing high-frequency band related standards for target sensing, and can improve the sensing performance and has good sensing functions. Among them, M can have different values. Different values of M correspond to sequences for sensing with different lengths. The larger the value of M, the longer the sequence for target sensing generated correspondingly, and the smaller the interference of the sequence for target sensing during target sensing, and the better the sensing performance. Since the transmission time of the sequence for target sensing needs to be less than the maximum accumulation time of the sequence for sensing, optionally, the value of M is an integer from 1 to 5. The sensing performance of the sequence for target sensing with the corresponding length within this value range is better. It should be noted that the value range of M is not limited to this.

[0042] As a possible implementation manner of the second aspect, when M = 1, the sequence for target sensing is S Vm11 、SHm12 ; wherein, the S Vm11 , S Hm12 are respectively:

[0043]

[0044]

[0045] As a possible implementation manner of the second aspect, when M = 2, the S Vm21 , S Hm22 ; wherein, the S Vm21 , S Hm22 are respectively:

[0046]

[0047]

[0048] As a possible implementation manner of the second aspect, when M = 3, the S Vm31 , S Hm32 ; wherein, the S Vm31 , S Hm32 are respectively:

[0049]

[0050]

[0051] As a possible implementation manner of the second aspect, the sequence lengths of the binary sequence pairs include any one of the following: 256 bits, 512 bits, 1024 bits, 2048 bits.

[0052] Based on the above embodiments, the binary sequence pair is used as the base sequence for generating the sensing sequence. The design principle of this binary sequence pair is that the local area has low autocorrelation and low cross-correlation. The sensing sequence generated based on this binary sequence pair with low autocorrelation and low cross-correlation has high Doppler tolerance and better target sensing performance.

[0053] As a possible implementation manner of the second aspect, when the length of the binary sequence pair is 256 bits, the sequences corresponding to the binary sequence pair are respectively:

[0054] Sn2561, Sn2562; wherein, the specific forms of Sn2561 and Sn2562 are shown in the specific embodiments.

[0055] As a possible implementation manner of the second aspect, when the length of the binary sequence pair is 512 bits, the sequences corresponding to the binary sequence pair are respectively:

[0056] Sn5121, Sn5122; wherein, the specific forms of the Sn5121 and Sn5122 are shown in the specific embodiments.

[0057] As a possible implementation of the second aspect, when the length of the binary sequence pair is 1024, the sequences corresponding to the binary sequence pair are respectively:

[0058] Sn10241, Sn10242; wherein, the specific forms of the Sn10241 and Sn10242 are shown in the specific embodiments.

[0059] As a possible implementation of the second aspect, when the length of the binary sequence pair is 2048, the sequences corresponding to the binary sequence pair are respectively:

[0060] Sn20481; Sn20482; wherein, the specific forms of the Sn20481 and Sn20482 are shown in the specific embodiments.

[0061] The third aspect of the present application provides a data transmission device, which is used to execute any one of the possible implementation manners of the first aspect above.

[0062] The fourth aspect of the present application provides a data transmission device, which is used to execute any one of the possible implementation manners of the second aspect above.

[0063] The fifth aspect of the present application provides a data transmission device, including a processor and a transceiver;

[0064] The processor is used to generate a physical layer protocol data unit PPDU, the PPDU includes a training field, and the training field includes a sequence for target perception;

[0065] The transceiver is used to send the physical layer protocol data unit PPDU.

[0066] The sixth aspect of the present application provides a data transmission device, including a processor and a transceiver;

[0067] The transceiver is used to receive a physical layer protocol data unit PPDU, the PPDU includes a training field, and the training field includes a sequence for target perception;

[0068] The processor is used to perform target perception according to the sequence for target perception.

[0069] The seventh aspect of the present application provides a data transmission device, including a processing circuit and an output interface;

[0070] The processing circuit is used to generate a physical layer protocol data unit (PPDU), the PPDU includes a training field, and the training field includes a sequence for target perception;

[0071] The output interface is used to output the PPDU.

[0072] The eighth aspect of the present application provides a data transmission device, including a processing circuit and an input interface;

[0073] The input interface is used to input a physical layer protocol data unit (PPDU), the PPDU includes a training field, and the training field includes a sequence for target perception;

[0074] The processing circuit is used to perform target perception according to the sequence for target perception.

[0075] The ninth aspect of the present application provides a computer-readable storage medium for storing a computer program, and the computer program includes instructions for executing any possible method of the first aspect or the second aspect.

[0076] The tenth aspect of the present application provides a computer program product, including instructions for executing any possible method of the above-mentioned first aspect or second aspect. Description of the Drawings

[0077] The following further describes each feature of the present application and the connection between each feature with reference to the drawings. The drawings are all exemplary, some features are not shown in actual proportion, and in some drawings, the conventional and non-essential features for the field related to the present application may be omitted, or non-essential features for the present application may be shown additionally. The combination of the features shown in the drawings is not used to limit the present application. In addition, throughout this specification, the content referred to by the same reference numerals is also the same. The specific description of the drawings is as follows:

[0078] Figure 1 It is a schematic flowchart of a data transmission method provided by an embodiment of the present application;

[0079] Figure 2 It is a transmit-receive diagram of a full-polarization radar system;

[0080] Figure 3A It is a frame structure of 802.11ad provided by an embodiment of the present application;

[0081] Figure 3B It is a frame structure of 802.11ay provided by an embodiment of the present application;

[0082] Figure 4 It is a schematic flowchart of a method for generating a binary sequence pair provided by an embodiment of the present application;

[0083] Figure 5 Flowchart for iteratively updating binary sequence pairs using the coordinate descent method provided by an embodiment of this application;

[0084] Figure 6 Schematic flowchart of a method for generating binary sequence pairs provided by an embodiment of this application;

[0085] Figure 7 Schematic flowchart of a specific implementation manner for iteratively updating binary sequence pairs using the coordinate descent method in a method for generating binary sequence pairs provided by an embodiment of this application;

[0086] Figure 8 Schematic diagram of a model of the auto - ambiguity function of a sequence for sensing provided by an embodiment of this application;

[0087] Figure 9 Schematic diagram of a model of the cross - ambiguity function of a sequence for sensing provided by an embodiment of this application;

[0088] Figure 10 Another schematic diagram of a model of the auto - ambiguity function of a sequence for sensing provided by an embodiment of this application;

[0089] Figure 11 Another schematic diagram of a model of the cross - ambiguity function of a sequence for sensing provided by an embodiment of this application;

[0090] Figure 12 Another schematic diagram of a model of the auto - ambiguity function of a sequence for sensing provided by an embodiment of this application;

[0091] Figure 13 Another schematic diagram of a model of the cross - ambiguity function of a sequence for sensing provided by an embodiment of this application;

[0092] Figure 14 Schematic diagram of the structure of a data transmission device applied to a sending end provided by an embodiment of this application;

[0093] Figure 15 Schematic diagram of the structure of a data transmission device applied to a receiving end provided by an embodiment of this application;

[0094] Figure 16 Schematic diagram of the structure of a communication system provided by an embodiment of this application. Detailed implementation manners

[0095] The terms "first", "second", "third", etc. or similar terms such as Module A, Module B, Module C, etc. in the specification and claims are only used to distinguish similar objects and do not represent a specific order for the objects. It can be understood that, where permitted, the specific order or sequence can be interchanged so that the embodiments of the present application described herein can be implemented in an order other than that illustrated or described herein.

[0096] In the following description, the reference numerals indicating steps, such as S110, S120, etc., do not necessarily mean that the steps will be executed in this order. Where permitted, the order of the steps can be interchanged or the steps can be executed simultaneously.

[0097] The term "comprising" used in the specification and claims should not be construed as being limited to the content listed thereafter; it does not exclude other elements or steps. Therefore, it should be construed as specifying the presence of the recited features, integers, steps or components, but not excluding the presence or addition of one or more other features, integers, steps or components and their groups. Thus, the expression "a device comprising device A and B" should not be limited to a device consisting only of components A and B.

[0098] The term "an embodiment" or "embodiments" mentioned in this specification means that the specific features, structures or characteristics described in connection with the embodiment are included in at least one embodiment of the present invention. Therefore, the phrases "in an embodiment" or "in embodiments" that appear throughout this specification do not necessarily all refer to the same embodiment, but may refer to the same embodiment. In addition, in one or more embodiments, the various specific features, structures or characteristics can be combined in any suitable manner, as will be apparent to those of ordinary skill in the art from this disclosure.

[0099] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the technical field to which this application belongs. In case of inconsistency, the meaning set forth in this specification or the meaning derived from the content recorded in this specification shall prevail. In addition, the terms used herein are only for the purpose of describing the embodiments of this application and are not intended to limit this application.

[0100] In order to accurately describe the technical content in this application and to accurately understand this application, the following explanations or definitions of the terms and related technologies used in this specification are given before describing the specific embodiments:

[0101] (I) Full Polarization Radar, Polarization Scattering Matrix and Pulse Repetition Interval

[0102] Full-polarization radar: Polarization, together with amplitude, frequency, and phase, constitutes a complete description of electromagnetic waves and is one of the essential characteristics of targets. The polarization characteristics of a target are described by the target polarization scattering matrix (PSM), which can provide richer electromagnetic scattering information than the radar cross section (RCS) and can enhance the performance of radar in aspects such as anti-jamming, anti-stealth, and anti-clutter. The accurate measurement of the target PSM is the prerequisite and foundation for utilizing target polarization information. Currently, the radar used for measuring the target PSM is called a full-polarization radar.

[0103] Among them, the polarization scattering matrix (PSM) is used to describe the polarization characteristics of a target, which can provide richer electromagnetic scattering information than the radar cross section (RCS). Based on the PSM information, radar ranging and other functions can be realized. The parameters in the PSM matrix are the target scattering coefficients.

[0104] Pulse Repetition Interval (PRI): The pulse repetition interval refers to the time interval between one pulse and the next pulse.

[0105] (2) Simulated annealing method, coordinate descent method

[0106] Simulated Annealing (SA): The simulated annealing algorithm is derived from the principle of solid annealing. The solid is heated to a sufficiently high temperature and then allowed to cool slowly. When heated, the particles inside the solid become disordered with the increase in temperature, and the internal energy increases. When cooling slowly, the particles gradually become ordered, reaching an equilibrium state at each temperature, and finally reaching the ground state at room temperature with the internal energy reduced to the minimum. According to the Metropolis criterion, the probability of a particle tending to equilibrium at temperature T is e^(-ΔE / (kT)), where E is the internal energy at temperature T, ΔE is the change in E, and k is the Boltzmann constant. Using solid annealing to simulate the combinatorial optimization problem, simulating the internal energy E as the objective function value f and the temperature T as the control parameter t, we obtain the simulated annealing algorithm for solving the combinatorial optimization problem: starting from the initial solution i and the initial value of the control parameter t, repeat the iteration of "S1 Generate a new solution; S2 Calculate the difference in the objective function; S3 Accept or discard" for the current solution, and gradually decay the value of t. The current solution at the end of the algorithm is the obtained approximate optimal solution, which is a heuristic random search process based on the Monte Carlo iterative solution method. The control of the annealing process includes the initial value t of the control parameter, its decay factor Δt, the number of iterations L at each t value, and the stopping condition S.

[0107] Coordinate Descent (CD): The coordinate descent method is a non-gradient optimization algorithm. In each iteration of the algorithm, a one-dimensional search is performed along a coordinate direction at the current point to find a local minimum of a function. Different coordinate directions are cycled through throughout the process.

[0108] In addition, the unit modulus sequence in the embodiments of the present application refers to a sequence in which the modulus lengths of all elements are 1; the binary sequence refers to a sequence in which the size of the alphabet set of each element value is 2, generally {-1, 1} or {0, 1}. Among them, the alphabet set refers to the set of values that an element can take. Further, since the polarization scattering matrix (PSM) is a prerequisite for ranging, the process of obtaining PSM information from the sequence for sensing is introduced below.

[0109] The full-polarization radar system is a system that can transmit and receive signals simultaneously on two orthogonal polarizations. By transmitting and receiving the sequence for sensing through this system, the auto-ambiguity function and cross-ambiguity function of the received sequence are further calculated, and thus the information of the PSM matrix can be further obtained. The ranging information can be obtained through this PSM matrix information.

[0110] Among them, the full-polarization radar system model is defined as shown in Table 1:

[0111] Table 1

[0112]

[0113]

[0114] In the full-polarization radar system model in Table 1, the first row represents that N sequences are transmitted on the transmitting antenna in the vertical polarization direction V, where s V,n represents the sequence transmitted in the nth pulse repetition interval (PRI). The second row represents that N sequences are transmitted on the transmitting antenna in the horizontal polarization direction H, where s H,n represents the sequence transmitted in the nth pulse repetition interval (PRI). The third and fourth rows represent that N sequences are received through two receiving antennas in the vertical and horizontal polarization directions V and H, where r V,n and r H,n respectively represent the sequences received in the nth pulse repetition interval (PRI) corresponding to the antennas. The fifth row represents the filter bank set for the receiving antenna corresponding to the vertical polarization direction V, which matches s V,0 and s H,0 . The sixth row represents the filter bank set for the receiving antenna corresponding to the horizontal polarization direction H, which also matches s V,0 and s H,0 . Among them, the ~ in the fifth and sixth rows means reverse conjugate.

[0115] In addition, the above Output represents the sum of the outputs corresponding to each of the N PRIs, which constitutes a total output Output. Among them, is a matrix representing the output corresponding to the nth PRI.

[0116] As Figure 2 shown in the transmission and reception diagram of the radar system, where the transmission signal of the radar corresponding to the nth PRI is s n , and the vector r n of the signal received by this radar is:

[0117] r n = Hs n e jnθ ,

[0118]

[0119] where the H matrix corresponds to the PSM matrix, and h VH represents the target scattering coefficient from the horizontal polarization direction H to the vertical polarization V, h HV represents the target scattering coefficient from the vertical polarization V to the horizontal polarization direction H, h VV represents the target scattering coefficient from the vertical polarization V to the vertical polarization V, h HH represents the target scattering coefficient from the horizontal polarization direction H to the horizontal polarization direction H, and θ represents the Doppler frequency shift.

[0120] In the nth PRI, after the vector r n of the received signal passes through the filter bank, the output in the nth PRI is:

[0121]

[0122] where represents the convolution of r V,n and ; represents the convolution of r H,n and ; represents the convolution of r V,n and ; represents the convolution of r H,n and ; represents the reverse conjugate of s V,n ; represents the reverse conjugate of s H,n ; k represents the time delay; represents that in the nth PRI, the vector r nThe output in the nth PRI after passing through the filter bank.

[0123]

[0124]

[0125] Among them, represents the convolution of s V,n and ; represents the convolution of s V,n and ; L represents the sequence length; l represents the l-th element of the current sequence; k represents the time delay.

[0126] Thus, the output of all PRIs, that is, the total output of the system is:

[0127]

[0128] Among them, corresponding to the above formula, the ambiguity function of the matrix value is:

[0129]

[0130] Among them, the two ambiguity functions g V,V (k,θ) and g H,H (k,θ) on the main diagonal are the auto-ambiguity functions of the sequences received in the vertical polarization direction V and the horizontal polarization direction H respectively, and the two ambiguity functions g H,V (k,θ) and g H,H (k,θ) on the off-diagonal are the cross-ambiguity functions of the sequences received in the vertical polarization direction V and the horizontal polarization direction H respectively. The above sub-ambiguity functions and cross-ambiguity functions can be calculated through their respective ambiguity function formulas, that is, can be obtained.

[0131] Since Therefore,

[0132] On this basis, and since the total output Output(k) of the system is known, therefore, from the above Output(k) formula, That is, the aforementioned That is, the target polarization scattering matrix (PSM). Further, ranging information can be obtained based on the PSM matrix. As described above, it is an introduction to sending and receiving sequences through a full-polarization radar system, further calculating the auto-ambiguity function and cross-ambiguity function of the sequences, and further obtaining the PSM matrix to obtain ranging information. As can be seen from the above, to achieve ranging perception, it is necessary to send and receive the sequences used for perception. Therefore, the quality of the sequences has an important impact on the perception performance. However, the existing sequences are designed for optimal communication, so optimal perception cannot be achieved.

[0133] Therefore, in this application, the sequences used for perception are optimized so that the sequences can be applied to existing high-frequency band related standards and can perform higher-performance target perception. The following will describe in detail a data transmission method provided by this application with reference to the accompanying drawings. Specifically, as Figure 1 shown, the method may include:

[0134] S110: The sending end generates a physical layer protocol data unit (PPDU), and the PPDU includes a training field, and the training field includes sequences for target perception.

[0135] In a possible implementation, as Figure 3A shown, Figure 3A is the frame structure of high-frequency band 802.11ad. Figure 3A The training field unit (TRN-UNIT) shown includes the above-mentioned sequences for target perception. Under the 802.11ad standard, using these sequences for target perception can improve the perception performance. For another example, as Figure 3B shown, Figure 3B is the frame structure of high-frequency band 802.11ay. Among them, Figure 3B the training field unit (TRN-UNIT) shown includes the above-mentioned sequences for perception. Similarly, under the 802.11ay standard, using these sequences for target perception can also improve the perception performance.

[0136] S120: The sending end sends the PPDU.

[0137] Optionally, the sending end can send the PPDU in a broadcast, unicast, or multicast manner.

[0138] S130: The receiving end receives the PPDU.

[0139] The receiving end receives the PPDU and uses the sequences included in the PPDU for target perception.

[0140] Specifically, in step S110, the sequence for target perception included in the training field is obtained based on a binary sequence pair, an Alamouti matrix, and a Prouhet-Thue-Morse (PTM) sequence. The Alamouti matrix includes:

[0141]

[0142] where x and y are the binary sequence pair, are the reverse complex conjugates of x and y respectively. The matrix A0 corresponds to 0 in the PTM sequence, and the matrix A1 corresponds to 1 in the PTM sequence. That is, when the element value in the PTM sequence is 0, it corresponds to A0 in the Alamouti matrix, and when the element value in the PTM sequence is 1, it corresponds to A1 in the Alamouti matrix.

[0143] It can be understood that a first matrix is obtained according to the above correspondence between the PTM sequence and the Alamouti matrix. The first row of this first matrix constitutes the sequence in the V polarization direction, and the second row of this matrix constitutes the sequence in the H polarization direction. That is, the first row and the second row of this first matrix constitute the sequence for target perception in the embodiments of the present application. Further, the PTM sequence is Its recursive definition is a0 = 0, a 2k = a k , a 2k+1 = 1 - a k , where k > 0; the length of the PTM sequence is 2 M+1 , and M is an integer greater than 0. M can have different values. Specifically, different values of M correspond to sequences for perception with different lengths. The larger the value of M, the longer the sequence for target perception generated, and the smaller the interference between the sequences during perception, and the better the perception performance.

[0144] Exemplarily, several different values of M are given below, corresponding to obtaining sequences for perception with different lengths. It should be noted that the values of M are only examples and are not limited to the following values. According to the above introduction, M can take any integer value greater than 0. Additionally, in the following embodiments, x and y are the binary sequence pair, are the reverse complex conjugates of x and y respectively. For the sake of simplicity, a unified description is made here and will not be repeated below.

[0145] In one embodiment, when M = 1, the sequence for target perception is S Vm11 、S Hm12 . Specifically, the sequences for target perception are respectively:

[0146]

[0147] Specifically, when M = 1, the length of the PTM sequence is 4, and the value of the PTM sequence is 0110. According to the correspondence between the Alamouti matrix and the PTM sequence, the first matrix is obtained as A = [A0 A1 A1 A0], specifically:

[0148]

[0149] The first row of the first matrix corresponds to S of the target sensing sequence Vm11 , and the second row of the first matrix corresponds to S of the target sensing sequence Hm12 .

[0150] In another embodiment, when M = 2, the sequences for target sensing are S Vm21 , S Hm22 , where

[0151]

[0152] Specifically, when M = 2, the length of the PTM sequence is 16, and the value of the PTM sequence is 01101001. The PTM sequence 01101001 corresponds to 8 Alamouti matrices A0 A1 A1 A0 A1 A0 A0 A1. These 8 Alamouti matrices form a first matrix A2 = [A0 A1 A1 A0 A1 A0 A0 A1]. Specifically:

[0153]

[0154] The first row of the first matrix A2 corresponds to S Vm11 , and the second row of the first matrix A2 corresponds to S Hm12 .

[0155] In another embodiment, when M = 3, the sequences for target sensing are S Vm31 , S Hm32 , where

[0156]

[0157]

[0158] Specifically, when M = 3, the length of the PTM sequence is 16, and the values of the PTM sequence are 0110100110010110. The PTM sequence 0110100110010110 corresponds to 16 Alamouti matrices A0 A1 A1 A0 A1 A0 A0 A1 A1 A0 A0 A1 A0 A1 A1 A0. These 16 Alamouti matrices form a first matrix A3 = [A0 A1 A1 A0 A1 A0 A0 A1 A1 A0 A0 A1 A0 A1 A1 A0]. Specifically:

[0159]

[0160] The first row of the first matrix A3 corresponds to S of the target sensing sequence Vm11 , and the second row of the first matrix A3 corresponds to S of the target sensing sequence Hm12 .

[0161] Based on the above embodiments, sequences of different lengths for target sensing can be obtained according to the binary sequence pair, Alamouti matrix, and PTM sequence, which are applicable to different target sensing scenarios. Moreover, the sequences for sensing have high Doppler tolerance.

[0162] Furthermore, the sequence lengths of the binary sequence pairs for generating the sequences for sensing may include any one of the following: 256 bits, 512 bits, 1024 bits, 2048 bits.

[0163] In one embodiment, the sequence length of the binary sequence pair is 256 bits, and the sequences corresponding to the binary sequence pair are:

[0164]

[0165]

[0166] That is, in the above binary sequence pair x, y, x corresponds to Sn2561 and y corresponds to Sn2562.

[0167] In one embodiment, the sequence length of the binary sequence pair is 512 bits, and the sequences corresponding to the binary sequence pair are:

[0168]

[0169]

[0170]

[0171]

[0172] That is, in the above binary sequence pair x, y, x corresponds to Sn5121 and y corresponds to Sn5122.

[0173] In one embodiment, the sequence length of the binary sequence pair is 1024, and the sequences corresponding to the binary sequence pair are:

[0174]

[0175]

[0176]

[0177]

[0178] That is, in the above binary sequence pair x, y, x corresponds to Sn10241 and y corresponds to Sn10242.

[0179] In one embodiment, the sequence length of the binary sequence pair is 2048, and the sequences corresponding to the binary sequence pair are:

[0180]

[0181]

[0182]

[0183]

[0184]

[0185]

[0186]

[0187] That is, in the above binary sequence pair x, y, x corresponds to Sn20481 and y corresponds to Sn20482. Based on the above embodiments, the binary sequence pair serves as the base sequence for generating the sensing sequence. The design principle of this binary sequence pair is that the local area has low autocorrelation and low cross-correlation. The low autocorrelation means that the sum of the autocorrelations of the binary sequence pair in this local area is close to zero except at the position of 0. The low cross-correlation means that the cross-correlation in this area is also close to zero. Among them, the sum of the autocorrelations refers to the two sequences of the binary sequence pair performing autocorrelation respectively and then summing. The position of 0 refers to the position where the two sequences are completely aligned. The sensing sequence generated based on this binary sequence pair with low autocorrelation and low cross-correlation has high Doppler tolerance and better target sensing performance. Specifically, when using this sensing sequence for sensing, as shown by the autoambiguity function model of this sensing sequence, at any Doppler frequency offset, the main lobe (position of 0) of the sequence autocorrelation remains stable, indicating that the sensing sequence of this application has high Doppler tolerance during target sensing. And as shown by the autoambiguity function model, at any Doppler frequency offset, the sidelobes (except the position of 0) of the sequence autocorrelation are close to zero within the local range, indicating that this application helps to better achieve target sensing. The cross-ambiguity function model shows that the cross-ambiguity function value is low, indicating that the interference between the sensing sequences is small, which helps to better sense the target. In addition, regarding the aforementioned "local area", for example, considering the application range of the actual application scenario in the field of target sensing technology and the speed of the single-carrier physical layer in the existing high-frequency standard being 1.76 Gbps, the range of the local area in the above design criterion can be set to ±128. This local area corresponds to ±21.82 meters in the actual scenario. In the case of self-transmitting and self-receiving, it corresponds to ±10.91 meters in the actual scenario. The value of the local area can meet the application scenarios in the existing high-frequency related standards. The above "±128" means that when generating the binary sequence pair within this area range, one sequence remains stationary and the other moves, moving 128 to the left (-128) and 128 to the right (+128).

[0188] Further, the method for generating the above binary sequence pair provided by the present application will be described in detail below with reference to the accompanying drawings. As Figure 4 shown, the method for generating the above binary sequence pair provided by the present application mainly includes the following steps:

[0189] S410: Initialize the binary sequence pair and the annealing temperature in the simulated annealing algorithm.

[0190] Specifically, the length of the initialized binary sequence pair is the length of the binary sequence pair to be obtained. For example, if the length of the binary sequence pair to be obtained is 256 bits, then the length of the initialized binary sequence is 256 bits.

[0191] S420: When executing the simulated annealing algorithm, the following steps are performed at each annealing temperature of the simulated annealing algorithm: The input binary sequence pair at the current annealing temperature is iteratively updated according to the coordinate descent method. During the iterative update of the binary sequence pair according to the coordinate descent method, the optimal binary sequence pair is searched from these updated binary sequence pairs, and the objective function value of the optimal binary sequence pair is synchronously updated.

[0192] In some embodiments, as Figure 5 shown in the flowchart, this step S420 may include the following sub-steps S4201 - S4203:

[0193] S4201: Flip each element of each sequence in the input binary sequence pair bit by bit, where each flip of an element corresponds to one update in one iteration of the coordinate descent method;

[0194] S4202: At each update, that is, at each flip of an element, for the binary sequence pair formed after flipping the element, that is, the flipped binary sequence pair, calculate its objective function value; The calculation of this objective function value may include the following two steps:

[0195] The first step is to calculate the autocorrelation function and cross-correlation function of each sequence in the flipped binary sequence pair using the following formula;

[0196] The autocorrelation function is calculated using the following formula:

[0197]

[0198] C′ x (k) is the autocorrelation function value of sequence x before flipping the i-th element in the binary sequence pair,

[0199] C x (k) is the autocorrelation function value of sequence x after flipping the i-th element,

[0200] x i represents the i-th element of sequence x, k represents the time delay; x i-k represents the i - k-th element of sequence x; x i+k represents the i + k-th element of sequence x; L represents the length of sequence x.

[0201] The cross-correlation function is calculated using the following formula:

[0202] After flipping the i-th element of sequence x, the cross-correlation function of sequence x and sequence y is:

[0203]

[0204] After flipping the i-th element of sequence y, the cross-correlation function of sequence x and sequence y is:

[0205]

[0206] C′ xy (k) is the cross - correlation function value before the sequences x or y are flipped.

[0207] C xy (k) is the cross - correlation function value after the sequences x or y are flipped.

[0208] k represents the time delay, x i represents the i - th element of the sequence x, y i represents the i - th element of the sequence y, y i+k represents the (i + k)-th element of the sequence y.

[0209] In the second step, calculate the objective function of the flipped binary sequence pair using the following formula:

[0210] The objective function value is calculated using the following formula:

[0211]

[0212] s.t. |x k | = 1, k = 0, 1,..., L - 1,

[0213] |x k | = 1, k = 0, 1,..., L - 1,

[0214] C x (k) represents the autocorrelation function of the sequence x.

[0215] C y (k) represents the autocorrelation function of the sequence y.

[0216] C xy (k) represents the cross - correlation function between x and y.

[0217] x k represents the k - th symbol of x, y k represents the k - th symbol of y.

[0218]

[0219] S4203: Each time there is an update corresponding to step S4202, that is, when flipping one element each time, determine whether to update the binary sequence pair before flipping to the binary sequence pair after flipping according to one of the following situations, and perform the corresponding update of the optimal binary sequence pair:

[0220] A) When the objective function value of the binary sequence pair formed after the flip is not greater than the objective function value of the binary sequence pair before this flip, update the binary sequence pair before the flip to the binary sequence pair formed after the flip, that is, accept the update of the binary sequence pair in this iteration (that is, accept the flip of this element). And, update the optimal binary sequence pair to the binary sequence pair formed after this flip (that is, use the optimal binary sequence pair as an intermediate value to record the binary sequence pair after accepting this update), and record the objective function value of the binary sequence pair after this flip, that is, record the objective function value of the currently updated optimal binary sequence pair.

[0221] B) When the objective function value of the binary sequence pair formed after the flip is greater than the objective function value of the binary sequence pair before this flip, and the value of the acceptance probability function is less than a certain value, update the binary sequence pair before the flip to the binary sequence pair after the flip (that is, accept the flip of this element with a certain probability). And, update the objective function value to the objective function value of the binary sequence pair formed after the flip. At this time, the optimal binary sequence pair is not updated (that is, the optimal binary sequence pair is still the binary sequence pair before the flip).

[0222] C) When the objective function value of the binary sequence pair formed after the flip is greater than the objective function value of the binary sequence pair before this flip, and the value of the acceptance probability function is greater than or equal to a certain value, the binary sequence pair before this flip is not updated (that is, the binary sequence pair formed after this flip is updated to the binary sequence pair before this flip, and the flip of this element is not accepted). At this time, neither the optimal binary sequence pair nor the objective function value of the binary sequence pair is updated, that is, both are the relevant values of the binary sequence pair before the flip.

[0223] Among them, the acceptance probability function is Among them, P is the value of the acceptance probability function, f is the objective function value of the binary sequence pair formed after the flip, f0 is the objective function value of the binary sequence pair before the flip (that is, the objective function value before updating the optimal binary sequence pair), and T is the current annealing temperature in the simulated annealing algorithm. The value compared with the value of the acceptance probability function can be a random number between [0, 1], or a preset value.

[0224] The above steps determine whether it is necessary to record (record in the way of the optimal binary sequence pair) the update of the binary sequence pair in this iteration according to the magnitude relationship of the objective function values in two iterative processes and the greedy search probability (that is, the above acceptance probability) designed according to the simulated annealing algorithm criterion. This not only ensures the convergence of the objective function, but also uses the annealing temperature in the simulated annealing algorithm as the judgment condition for iteratively updating the binary sequence pair by the coordinate descent method, avoiding the binary sequence pair obtained from falling into the local optimum and being able to search for binary sequence pairs with good local autocorrelation and cross-correlation.

[0225] S430: At each annealing temperature of the simulated annealing algorithm: Use the binary sequence pair obtained at the end of the coordinate descent method at the current annealing temperature as the output binary sequence pair at the current annealing temperature, and use this output binary sequence pair as the input binary sequence pair at the next annealing temperature to update the optimal binary sequence pair again through step S420 at the next annealing temperature.

[0226] S440: When the exit condition of the simulated annealing algorithm is reached, end the simulated annealing algorithm and output the optimal binary sequence pair at this time as the binary sequence pair to be generated.

[0227] In some embodiments, the exit condition can be one of the following:

[0228] Exit condition one: When the annealing temperature of the simulated annealing algorithm gradually decreases and reaches the lowest threshold of the preset annealing temperature. Or

[0229] Exit condition two: When the annealing temperatures continuously decrease, and the objective function values of the output binary sequence pairs at these annealing temperatures are stable. Or

[0230] Exit condition three: When the annealing temperatures continuously decrease, and the objective function values of the output binary sequence pairs at these annealing temperatures are stable, and the current annealing temperature is lower than a certain preset value.

[0231] When the objective function values of the output binary sequence pairs at the continuously decreasing annealing temperatures are stable, it means that the optimal binary sequence pair is stable. Therefore, the simulated annealing algorithm is exited, and the optimal binary sequence pair at this time is output as the binary sequence pair to be generated.

[0232] It should be noted that the stability of the objective function values of the output binary sequence pairs means that at a certain number of continuously decreasing annealing temperatures, the objective function values of the output binary sequence pairs at these annealing temperatures do not change or change less than a threshold.

[0233] This application combines the simulated annealing algorithm and the coordinate descent method to generate binary sequence pairs, which can not only ensure that the objective function value of the binary sequence pair converges to a stable value, but also search for the optimal binary sequence pair. And this application provides a method for quickly calculating the objective function value, which can reduce the complexity of the objective function calculation from O(L 2 ) to the linear complexity O(L).

[0234] To further understand the method for generating binary sequence pairs provided by this application, the following will combine the attached Figure 6 and the attached Figure 7 , and conduct an exemplary description of the method flow for generating binary sequence pairs provided by this application.

[0235] As shown Figure 6 in the figure, the main flowchart of the binary sequence pair generation method provided by this specific embodiment may include the following steps:

[0236] S210a - S210b: Receive the input initial parameter values and complete the initialization of each parameter, including:

[0237] Set the initial binary sequence pair of the input binary sequence pair X as X 0 , that is, X = X 0 ; and set the initial value of the optimal binary sequence pair X best as this X 0 , that is, X best = X 0 ; where the total number of sequences included in the initial binary sequence pair X 0 (i.e., the size of the binary sequence pair) is M, and the number of elements included in each sequence of the binary sequence pair (i.e., the length) is L.

[0238] Set the preset lowest annealing temperature to be used in the simulated annealing algorithm as T min ; set the preset annealing coefficient as α, where α > 0, and its value can be a value less than and close to 1, for example: 0.96, 0.95, etc.

[0239] S220: Judge the size relationship between the current annealing temperature T and the preset lowest annealing temperature T min . When T ≤ T min , that is, when the current annealing temperature is less than the preset lowest annealing temperature (corresponding to the first exit condition in S140), output the optimal binary sequence pair and end this process; otherwise, execute step S230.

[0240] S230: Use the coordinate descent method to perform n - time iterative updates on the input binary sequence pair X, and iteratively update the optimal binary sequence pair X best , and calculate the objective function value f of the binary sequence pair after each update. After the coordinate descent method iteration ends, use the output binary sequence pair as the output binary sequence pair of the current annealing temperature T. This step will be described in detail later.

[0241] Among them, the specific calculation method for calculating the objective function value f of the binary sequence pair after each update can refer to the aforementioned step S122.

[0242] S240: Update the annealing temperature using T = α * T. As described in step S210, α is the preset annealing coefficient.

[0243] S250a - S250c: Determine whether the objective function value f of the output binary sequence pair at the previous annealing temperature (i.e., before the annealing temperature is updated) remains stable for t consecutive times during t consecutive temperature drops in the simulated annealing algorithm. If so, use the optimal binary sequence pair X formed at the end of the iterative update by the coordinate descent method at the current annealing temperature best as the output binary sequence pair at the current annealing temperature, and also as the input binary sequence pair at the next annealing temperature, and return to step S220; if not, use the binary sequence pair formed at the end of the iterative update by the coordinate descent method at the current annealing temperature as the output binary sequence pair at the current annealing temperature, and also as the input binary sequence pair at the next annealing temperature, and return to step S220.

[0244] As Figure 7 shown, a specific implementation of using the coordinate descent method to perform n iterative updates on the binary sequence pair X in step S230 above includes the following steps:

[0245] S2301: Input the initialized binary sequence pair X 0 , including inputting the total number of sequences M of the binary sequence pair X 0 and the number of elements L in each sequence, preset the maximum number of iterations Num used by the coordinate descent method, and a variable n for iterative calculation for each time, and initialize n = 1. Additionally, a variable m corresponding to the total number of sequences M of the binary sequence pair X 0 is set for calculating each sequence, where m ∈ M, and a variable i corresponding to the number of elements L is set for iterative calculation of each element, where i ∈ L.

[0246] S2302: Calculate the objective function value f of the binary sequence pair X 0 as the initial value f0 of the objective function value. Among them, the specific calculation method of the objective function value f can be referred to in the previous step S122.

[0247] S2303a - S2303b: Determine the size relationship between n and the maximum number of iterations Num. If n ≤ Num, that is, the current number of iterations is less than or equal to the maximum number of iterations, then set the variable m = 1, that is, set the initial value of the variable m to 1 (start iterative calculation from the first sequence in the binary sequence pair), and execute step S2304; if n > Num, it means that the iterative process of the coordinate descent method has been completed, and end the current process of the coordinate descent method.

[0248] S2304: Determine the size relationship between m and M. If m ≤ M, that is, it means that not all sequences in the current binary sequence pair have completed iterative calculation. At this time, execute step S2306; if m > M, that is, it means that all sequences in the binary sequence pair have completed iterative calculation. At this time, execute step S2305.

[0249] S2305: Let n = n + 1, and return to step S2303 to perform the next iteration calculation in the coordinate descent method.

[0250] S2306: Let the variable i = 1, that is, set the initial value of the variable i to 1 (start the flipping calculation from the first element in the sequence), and then execute step S2307.

[0251] S2307: Judge the size relationship between i and L. If i ≤ L, it means that not all elements in this sequence have completed the flipping calculation, then execute step S2309. If i > L, it means that all elements in this sequence have completed the flipping calculation, then execute step S2308.

[0252] S2308: Let m = m + 1, and return to step S2304 to process the next sequence.

[0253] S2309: Let a sequence x variable be the m-th sequence in the binary sequence pair X 0 That is, This step means to process the m-th sequence.

[0254] Process this sequence x to achieve flipping the i-th element of the m-th sequence in the binary sequence pair X 0 That is,

[0255] Update the sequence x, that is, replace the original element at the same position with the flipped element x(i). The new m-th sequence is composed of the replaced element and the elements at other positions. The new binary sequence pair is composed of the updated sequence x and other sequences, that is, the binary sequence pair formed after flipping, and calculate the objective function value of the binary sequence pair formed after flipping, and execute step S2310. Among them, the specific method for calculating the objective function value can refer to the previous step S122.

[0256] S2310: Judge the size relationship between the objective function value f of the binary sequence pair formed after flipping and the objective function value f0 of the binary sequence pair before flipping. Here, it can be obtained by subtracting the two and then comparing with 0. If f - f0 ≤ 0, it means accepting the binary sequence pair formed after this flipping and using it as the binary sequence pair input for the next iteration. At this time, execute S2311, otherwise, execute S2312.

[0257] S2311: Let X best = X, f0 = f, i = i + 1, which means accepting the binary sequence pair formed after this iteration, that is, letting the flipped sequence x be the binary sequence pair X 0For the m-th sequence in [sequence name], update the m-th sequence to the reversed sequence, make the reversed binary sequence pair in this iteration the optimal binary sequence pair, make the objective function value of the reversed binary sequence pair corresponding to this iteration the initial objective function value for the next iteration, and move the elements in the sequence to the next element for reverse calculation. Then return to step S2307.

[0258] S2312: Calculate the acceptance probability P, where, and generate a random number R, where R is a random number between [0, 1]. Here, P is the value of the acceptance probability function, f is the objective function value of the binary sequence pair formed after flipping, f0 is the objective function value of the binary sequence pair before flipping, and T is the annealing temperature for this time.

[0259] S2313 - S2315: Determine the magnitude relationship between R and P. If R > P, then let f0 = f, i = i + 1, indicating that the binary sequence pair formed after flipping generated in this iteration is accepted, that is, let the reversed sequence x be the m-th sequence in binary sequence pair X 0 For the m-th sequence in [sequence name], update the m-th sequence to the reversed sequence, make the reversed binary sequence pair in this iteration the optimal binary sequence pair, make the objective function value of the reversed binary sequence pair corresponding to this iteration the initial objective function value for the next iteration, and move the elements in the sequence to the next element for reverse calculation. Then return to step S2307.

[0260] If R ≤ P, then only let i = i + 1, indicating that the m-th sequence is not updated, the optimal binary sequence pair is not updated, and the objective function corresponding to the binary sequence pair formed after flipping is not updated, that is, the binary sequence pair formed after flipping is not recorded, and only the initial binary sequence pair for the next iteration is the binary sequence pair before flipping. Return to step S2307.

[0261] After obtaining the sensing sequence for target sensing, taking ranging using this sensing sequence as an example, the embodiments provided in this application will be described in more detail below. In this embodiment, the value of M is only an example and is not limited to the following values. M can take any integer value greater than 0. In this embodiment, taking the length of the binary sequence pair as 2048 bits as an example, according to the foregoing introduction, the length of the binary sequence pair can also have other values, such as 256 bits, 512 bits, 1024 bits, etc. In addition, as described in the foregoing embodiments, x and y are binary sequence pairs, are the reverse complex conjugates of x and y respectively.

[0262] In one embodiment, when the length of the binary sequence pair is 2048 bits and M = 1:

[0263] During the actual process of transmitting the ranging sequence, the radar transmitting end sends the ranging sequence in the form of a pulse train. The sequence transmitted through the transmitting antenna in the vertical polarization direction V is the ranging sequence S Vm11 , that is, the first row of matrix A in the foregoing embodiment:

[0264]

[0265] Among them, the above 8 sequences are transmitted through the transmitting antenna in the vertical polarization direction V, and one sequence is transmitted in each PRI. The following respectively represent the sequences transmitted in each of the 0-7 pulse repetition intervals PRI in turn:

[0266] s V,0 =x s V,3 =-x s V,5 =-x s V,6 =x

[0267] The sequence transmitted through the transmitting antenna in the horizontal polarization direction H is the ranging sequence S Hm42 , that is, the second row of matrix A:

[0268]

[0269] Among them, the above 8 sequences are transmitted through the transmitting antenna in the horizontal polarization direction H, and one sequence is transmitted in each PRI. The following respectively represent the sequences transmitted in each of the 0-7 pulse repetition intervals PRI in turn;

[0270] s H,0 =y s H,3 =-y s H,5 =-y s H，6 =y

[0271] Correspondingly, at the receiving end, filter banks are respectively arranged for the receiving antenna in the vertical polarization direction V and the receiving antenna in the horizontal polarization direction H. Each filter bank calculates respective ambiguity functions. For example, if each filter bank has two filters, for the sequence received by the receiving antenna in the vertical polarization direction V, the following can be calculated:

[0272] For the transmitted sequence S vm41 , the auto-ambiguity function is:

[0273]

[0274] For the transmitted sequences S vm41 and S Hm42 , their cross-ambiguity function is:

[0275]

[0276] Similarly, for the sequence received by the receiving antenna corresponding to the horizontal polarization direction H, the following auto-ambiguity and cross-ambiguity functions can be calculated:

[0277] g H，V (k,θ) g H，H (k,θ)

[0278] where k represents the time delay, θ represents the Doppler frequency shift, C x (k) represents the autocorrelation function of sequence x, C y (k) represents the autocorrelation function of sequence y, C xy (k) represents the cross-correlation function of x and y.

[0279] From the above, after calculating the above auto-ambiguity function and cross-ambiguity function, the PSM matrix can be further obtained according to the total output Output(k) and the calculated values of the auto-ambiguity function and cross-ambiguity function: Thus, when the PSM matrix is calculated, the ranging information, etc. can be further obtained based on the PSM matrix.

[0280] Such as Figure 8 、 9 shown, are respectively the auto-ambiguity function and cross-ambiguity function of the sequence for sensing constructed based on the binary sequence pair with a length of 2048 bits. From Figure 8 shown, the auto-ambiguity function model of this sensing sequence shows that at any Doppler frequency offset, the main lobe (at the 0 position) of the sequence autocorrelation remains stable, indicating that the sensing sequence of this application has high Doppler tolerance during target sensing, and the side lobes (except at the 0 position) of the sequence autocorrelation are close to zero within a local range. The maximum side lobe of the auto-ambiguity function within the local range is -49.32 dB, and the auto-ambiguity side lobe is relatively low, indicating that this application helps to achieve better target sensing. From Figure 9 shown, the cross-ambiguity function value of the sequence of this application can reach -73.79 dB within a local range. The cross-ambiguity function value is low, and the mutual interference between sequences is small, which helps for better target sensing.

[0281] In another embodiment, when the length of the binary sequence pair is 2048 bits and M = 2:

[0282] During the actual process of transmitting the ranging sequence, the radar transmitting end sends the ranging sequence in the form of a pulse train. The sequence sent through the transmitting antenna in the vertical polarization direction V is the ranging sequence S Vm21 , that is, the first row of matrix A2:

[0283]

[0284] Among them, the above 16 sequences are transmitted by a transmitting antenna with a vertical polarization direction V, and one sequence is transmitted in each PRI.

[0285] The sequence transmitted by the transmitting antenna with a horizontal polarization direction H is the ranging sequence S Hm22 , that is, the second row of matrix A2:

[0286]

[0287] Among them, the above 16 sequences are transmitted by a transmitting antenna with a horizontal polarization direction H, and one sequence is transmitted in each PRI.

[0288] At the receiving end of the radar: filter banks are respectively arranged for the receiving antenna corresponding to the vertical polarization direction V and the receiving antenna corresponding to the horizontal polarization direction H. And the ambiguity functions are respectively calculated. For example, if each filter bank has two filters, for the sequence received by the receiving antenna corresponding to the vertical polarization direction V, it can be calculated that:

[0289] For the transmitted sequence S Vm21 , the auto-ambiguity function is:

[0290]

[0291] For the transmitted sequence S Vm21 and S Hm22 , the cross-ambiguity function is:

[0292]

[0293] Similarly, for the sequence received by the receiving antenna corresponding to the horizontal polarization direction H, the auto-ambiguity and cross-ambiguity functions can be calculated.

[0294] Among them, k represents the time delay, θ represents the Doppler frequency shift, C x (k) represents the autocorrelation function of sequence x, C y (k) represents the autocorrelation function of sequence y, C xy (k) represents the cross-correlation function of x and y.

[0295] From the above, after calculating the above auto-ambiguity function and cross-ambiguity function, the PSM matrix can be further obtained according to the total output Output(k) and the calculated values of the auto-ambiguity function and cross-ambiguity function: Thus, when the PSM matrix is calculated, the ranging information and the like can be further obtained based on this PSM matrix.

[0296] Such as Figure 10 , 11As shown, they are the auto - ambiguity function and the cross - ambiguity function of the sequences for sensing constructed based on 2048 - bit binary sequence pairs. From Figure 10 As shown, the auto - ambiguity function model of this sensing sequence shows that at any Doppler frequency offset, the main lobe (at the 0 position) of the sequence autocorrelation remains stable, indicating that the sensing sequence of this application has high Doppler tolerance during target sensing. And the side lobes (except at the 0 position) of the sequence autocorrelation are close to zero within a local range. The maximum side lobe of the auto - ambiguity function within the local range is - 49.32dB, and the auto - ambiguity side lobes are low, indicating that this application helps to achieve better target sensing. From Figure 11 As shown, the cross - ambiguity function value of the sequence of this application can reach - 80.57dB within a local range. The low cross - ambiguity function value means that the mutual interference between sequences is small, which helps for better target sensing.

[0297] In another embodiment, when the length of the binary sequence pair is 2048 bits and M = 3:

[0298] During the actual process of sending the ranging sequence, the radar transmitter sends the ranging sequence in the form of a pulse train. The sequence sent through the transmitting antenna in the vertical polarization direction V is the ranging sequence S Vm31 , that is, the first row of the matrix A3:

[0299]

[0300] Among them, the above 32 sequences are sent through the transmitting antenna in the vertical polarization direction V, and one sequence is sent in each PRI.

[0301] The sequence sent through the transmitting antenna in the horizontal polarization direction H is the ranging sequence S Hm32 , that is, the second row of the matrix A3:

[0302]

[0303] Among them, the above 32 sequences are sent through the transmitting antenna in the horizontal polarization direction H, and one sequence is sent in each PRI.

[0304] At the receiving end: Filter banks are respectively set for the receiving antenna in the vertical polarization direction V and the receiving antenna in the horizontal polarization direction H. And the respective ambiguity functions are calculated. For example, if each filter bank has two filters, for the sequence received by the receiving antenna in the vertical polarization direction V, the following can be calculated:

[0305] For the transmitted sequence s V The auto - ambiguity function is:

[0306]

[0307] For the transmitted sequence sV and s H , whose cross-ambiguity function is:

[0308]

[0309] Similarly, for the sequence received by the receiving antenna corresponding to the horizontal polarization direction H, the auto-ambiguity and cross-ambiguity functions can be calculated; where k represents the time delay, θ represents the Doppler frequency shift, C x (k) represents the autocorrelation function of sequence x, C y (k) represents the autocorrelation function of sequence y, C xy (k) represents the cross-correlation function of x and y. From the above, after calculating the above auto-ambiguity function and cross-ambiguity function, the PSM matrix can be further obtained according to the total output Output(k) and the calculated values of the auto-ambiguity function and cross-ambiguity function: Thus, when the PSM matrix is calculated, the ranging information and the like can be further obtained based on the PSM matrix.

[0310] Such as Figure 12 、 13 shown, they are respectively the auto-ambiguity function and cross-ambiguity function of the sequence for sensing constructed based on the 2048-bit binary sequence pair. From Figure 12 shown, the auto-ambiguity function model of the sensing sequence shows that at any Doppler frequency offset, the main lobe (0 position) of the sequence autocorrelation remains stable, indicating that the sensing sequence of the present application has high Doppler tolerance during target sensing, and the side lobes (except the 0 position) of the sequence autocorrelation are close to zero within a local range, and the maximum side lobe of the auto-ambiguity function within the local range is -49.32 dB, and the auto-ambiguity side lobe is relatively low, indicating that the present application helps to achieve better target sensing. From Figure 13 shown, the cross-ambiguity function value of the sequence of the present application can reach -82.28 dB within a local range, the cross-ambiguity function value is low, and the mutual interference between sequences is small, which helps for better target sensing.

[0311] Corresponding to the foregoing method embodiments, the following are device embodiments. Regarding the beneficial effects or technical problems solved by each device, reference can be made to the descriptions in the methods corresponding to each device respectively, or to the descriptions in the summary of the invention. Details are not repeated here.

[0312] Such as Figure 14 shown, the embodiment of the present application provides a schematic structural diagram of a data transmission device applied to a sending end. The device includes:

[0313] A processing unit, configured to generate a physical layer protocol data unit PPDU, where the PPDU includes a training field, and the training field includes a sequence for target sensing.

[0314] A transmitting unit, configured to transmit the PPDU.

[0315] The data transmission device applied to the transmitting end provided in this embodiment is the transmitting end in the above method, and it has any functions of the transmitting end in the above method. For specific details, refer to the above method and will not be elaborated here.

[0316] In this embodiment, the sequence for target sensing included in the training field is obtained based on a binary sequence pair, an Alamouti matrix, and a Prouhet-Thue-Morse (PTM) sequence, where the Alamouti matrix includes:

[0317]

[0318] where x and y are the binary sequence pair, are the reverse complex conjugates of x and y respectively, A0 corresponds to 0 in the PTM sequence, and A1 corresponds to 1 in the PTM sequence. That is to say, when the element value in the PTM sequence is 0, it corresponds to A0 in the Alamouti matrix, and when the element value in the PTM sequence is 1, it corresponds to A1 in the Alamouti matrix. It can be understood that the transmitting end can obtain a first matrix according to the above corresponding relationship between the PTM sequence and the Alamouti matrix. The first row of this first matrix constitutes the sequence in the V polarization direction, and the second row of this matrix constitutes the sequence in the H polarization direction. That is to say, the first row and the second row of this first matrix constitute the sequence for target sensing in the embodiment of this application. Further, the PTM sequence is Its recursive definition is a0 = 0, a 2k = a k , a 2k+1 = 1 - a k , where k > 0; the length of the PTM sequence is 2 M+1 , and M is an integer greater than 0. M can have different values. Different values of M correspond to sequences for sensing with different lengths. The larger the value of M, the longer the sequence for target sensing generated, and the smaller the interference between the sequences when the sequence is used for sensing, and the better the sensing performance. Exemplarily, several different values of M are given below, corresponding to obtaining sequences for sensing with different lengths. It should be noted that the values of M are only examples and are not limited to the following values. According to the above introduction, M can take any integer value greater than 0, and based on the method provided in this application, different values of M can obtain sequences for target sensing with different lengths.

[0319] In one embodiment, when M = 1, the sequence for target sensing can be S Vm11 、SHm12 , specifically, the sequences for target perception are respectively:

[0320]

[0321] Specifically, when M = 1, the length of the PTM sequence is 4, and the value of the PTM sequence is 0110. According to the correspondence between the Alamouti matrix and the PTM sequence, the first matrix is obtained as A = [A0 A1 A1 A0], specifically:

[0322]

[0323] The first row of the first matrix A corresponds to S of the target perception sequence Vm11 , and the second row of the first matrix A corresponds to S of the target perception sequence Hm12 .

[0324] In another embodiment, when M = 2, the sequences for target perception can be S Vm21 , S Hm22 , specifically, the sequences for target perception are respectively:

[0325]

[0326]

[0327] Specifically, when M = 2, the length of the PTM sequence is 16, and the value of the PTM sequence is 01101001. This PTM sequence 01101001 corresponds to 8 Alamouti matrices A0 A1 A1 A0 A1 A0 A0 A1. These 8 Alamouti matrices form a first matrix A2 = [A0 A1 A1 A0 A1 A0 A0 A1]. Specifically:

[0328]

[0329] The first row of the first matrix A2 corresponds to S of the target perception sequence Vm11 , and the second row of the first matrix A2 corresponds to S of the target perception sequence Hm12 .

[0330] In another embodiment, when M = 3, the sequences for target perception can be S Vm31 , S Hm32 , and at this time, the sequences can be respectively:

[0331]

[0332]

[0333] Specifically, when M = 3, the length of the PTM sequence is 16, and the values of the PTM sequence are 0110100110010110. This PTM sequence 0110100110010110 corresponds to 16 Alamouti matrices A0 A1 A1 A0 A1 A0 A0 A1 A1 A0 A0 A1 A0 A1 A1 A0. These 16 Alamouti matrices form a first matrix A3 = [A0 A1 A1 A0 A1 A0 A0 A1 A1 A0 A0 A1 A0 A1 A1 A0]. Specifically:

[0334]

[0335] The first row of the first matrix A3 corresponds to S of the target sensing sequence Vm11 , and the second row of the first matrix A3 corresponds to S of the target sensing sequence Hm12 .

[0336] Based on the above embodiments, sequences for target sensing with different lengths can be obtained according to binary sequence pairs, Alamouti matrices, and PTM sequences, which are applicable to different target sensing scenarios. Moreover, the sequences for sensing have high Doppler tolerance.

[0337] Furthermore, the sequence lengths of the binary sequence pairs for generating the sequences for sensing can include any one of the following: 256 bits, 512 bits, 1024 bits, 2048 bits.

[0338] In one embodiment, the sequence length of the binary sequence pair is 256 bits, and the sequences corresponding to the binary sequence pair are: Sn2561, Sn2562. That is, in the above binary sequence pair x, y, x corresponds to Sn2561 and y corresponds to Sn2562. Among them, the specific forms of Sn2561 and Sn2562 can be seen in the foregoing specific embodiments. Details are not described herein again.

[0339] In one embodiment, the sequence length of the binary sequence pair is 512 bits, and the sequences corresponding to the binary sequence pair are: Sn5121, Sn5122. That is, in the above binary sequence pair x, y, x corresponds to Sn5121 and y corresponds to Sn5122. Among them, the specific forms of Sn5121 and Sn5122 can be seen in the foregoing specific embodiments. Details are not described herein again.

[0340] In one embodiment, the sequence lengths of the binary sequence pair are 1024, and the sequences corresponding to the binary sequence pair are respectively: Sn10241, Sn10242. That is, in the above binary sequence pair x, y, x corresponds to Sn10241 and y corresponds to Sn10242. Among them, the specific forms of Sn10241 and Sn10242 can be seen in the foregoing specific embodiments. Details are not described herein again.

[0341] In one embodiment, the sequence lengths of the binary sequence pair are 2048, and the sequences corresponding to the binary sequence pair are respectively: Sn20481, Sn20482. That is, in the above binary sequence pair x, y, x corresponds to Sn20481 and y corresponds to Sn20482. Among them, the specific forms of Sn20481 and Sn20482 can be seen in the foregoing specific embodiments. Details are not described herein again.

[0342] Understandably, based on the above embodiments, the binary sequence pair serves as the base sequence for generating the sensing sequence. The design principle of this binary sequence pair is that the local region has low autocorrelation and low cross-correlation. The low autocorrelation and low cross-correlation mean that the sum of the autocorrelations of the binary sequences in this local region is close to zero except at the position of 0, and the cross-correlation in this region is also close to zero. Among them, the sum of the autocorrelations refers to performing autocorrelation on the two sequences of the binary sequence pair respectively and then summing. The position of 0 refers to the position where the two sequences are completely aligned. The sensing sequence generated based on this binary sequence pair with low autocorrelation and low cross-correlation has high Doppler tolerance and better target sensing performance. Specifically, when using this sensing sequence for sensing, as shown by the autoambiguity function model of this sensing sequence, at any Doppler frequency offset, the main lobe (position of 0) of the sequence autocorrelation remains stable, indicating that the sensing sequence of this application has high Doppler tolerance during target sensing. And as shown by the autoambiguity function model of this sensing sequence, at any Doppler frequency offset, the sidelobes (except at the position of 0) of the sequence autocorrelation are close to zero within the local range, and this feature is conducive to better realizing target sensing. The cross-ambiguity function model shows that the cross-ambiguity function value is low, indicating that the mutual interference between the sensing sequences is small, which helps better target sensing. In addition, regarding the above-mentioned "local region", considering the application range of the actual application scenario in the field of target sensing technology and the speed of the single-carrier physical layer in the existing high-frequency standard being 1.76 Gbps, the range of the local region in the above design criterion can be set to ±128. This local region corresponds to ±21.82 meters in the actual scenario. In the case of self-transmitting and self-receiving, it corresponds to ±10.91 meters in the actual scenario. The value of the local region can meet the application scenarios in the existing high-frequency related standards. The above-mentioned "±128" means that when generating the binary sequence pair within this region range, one sequence remains different, and the other moves, moving 128 to the left (-128) and 128 to the right (+128).

[0343] As Figure 15 shown, an embodiment of the present application provides a schematic structural diagram of a data transmission device applied to a receiving end. The device includes:

[0344] A receiving unit, configured to receive a physical layer protocol data unit PPDU, where the PPDU includes a training field, and the training field includes a sequence for target sensing.

[0345] A processing unit, configured to perform target sensing according to the sequence for target sensing.

[0346] The data transmission device applied to the receiving end provided in this embodiment is the receiving end in the above method, and it has any functions of the receiving end in the above method. For specific details, reference can be made to the above method, which will not be elaborated here.

[0347] In this embodiment, the sequence for target perception included in the training field is obtained based on a binary sequence pair, an Alamouti matrix, and a Prouhet-Thue-Morse (PTM) sequence, where the Alamouti matrix includes:

[0348]

[0349] where x and y are the binary sequence pair, are the reverse complex conjugates of x and y respectively, A0 corresponds to 0 in the PTM sequence, and A1 corresponds to 1 in the PTM sequence. That is to say, when the element value in the PTM sequence is 0, it corresponds to A0 in the Alamouti matrix, and when the element value in the PTM sequence is 1, it corresponds to A1 in the Alamouti matrix. It can be understood that the transmitting end can obtain a first matrix according to the above corresponding relationship between the PTM sequence and the Alamouti matrix. The first row of this first matrix constitutes the sequence in the V polarization direction, and the second row of this matrix constitutes the sequence in the H polarization direction. That is to say, the first row and the second row of this first matrix constitute the sequence for target perception described in the embodiments of the present application. Further, the PTM sequence is Its recursive definition is a0 = 0, a 2k = a k , a 2k+1 = 1 - a k , where k > 0; the length of the PTM sequence is 2 M+1 , and M is an integer greater than 0. M can have different values. Different values of M correspond to sequences for perception with different lengths. The larger the value of M, the longer the sequence for target perception generated, and the smaller the interference between the sequences when the sequence is used for perception, and the better the perception performance. Exemplarily, several different values of M are given below, corresponding to obtaining sequences for perception with different lengths. It should be noted that the values of M are only examples and are not limited to the following values. According to the above introduction, M can take any integer value greater than 0, and based on the method provided in the present application, different values of M can obtain sequences for target perception with different lengths.

[0350] In one embodiment, when M = 1, the sequence for target perception can be S Vm11 、S Hm12 , specifically, the sequences for target perception are respectively:

[0351]

[0352] Specifically, when M = 1, the length of the PTM sequence is 4, and the value of the PTM sequence is 0110. According to the correspondence between the Alamouti matrix and the PTM sequence, the first matrix is obtained as A = [A0 A1 A1 A0], specifically:

[0353]

[0354] The first row of the first matrix A corresponds to S of the target sensing sequence Vm11 , and the second row of the first matrix A corresponds to S of the target sensing sequence Hm12 .

[0355] In another embodiment, when M = 2, the sequence for target sensing can be S Vm21 , S Hm22 . Specifically, the sequences for target sensing are respectively:

[0356]

[0357]

[0358] Specifically, when M = 2, the length of the PTM sequence is 16, and the value of the PTM sequence is 01101001. This PTM sequence 01101001 corresponds to 8 Alamouti matrices A0 A1 A1 A0 A1 A0 A0 A1. These 8 Alamouti matrices form a first matrix A2 = [A0 A1 A1 A0 A1 A0 A0 A1]. Specifically:

[0359]

[0360] The first row of the first matrix A2 corresponds to S of the target sensing sequence Vm11 , and the second row of the first matrix A2 corresponds to S of the target sensing sequence Hm12 .

[0361] In another embodiment, when M = 3, the sequence for target sensing can be S Vm31 , S Hm32 . At this time, the sequences can be respectively:

[0362]

[0363]

[0364] Specifically, when M = 3, the length of the PTM sequence is 16, and the values of the PTM sequence are 0110100110010110. The PTM sequence 0110100110010110 corresponds to 16 Alamouti matrices A0 A1 A1 A0 A1 A0 A0 A1 A1 A0 A0 A1 A0 A1 A1 A0. These 16 Alamouti matrices form a first matrix A3 = [A0 A1 A1 A0 A1 A0 A0 A1 A1 A0 A0 A1 A0 A1 A1 A0]. Specifically:

[0365]

[0366] The first row of the first matrix A3 corresponds to S of the target sensing sequence Vm11 , and the second row of the first matrix A3 corresponds to S of the target sensing sequence Hm12 .

[0367] Based on the above embodiments, sequences of different lengths for target sensing can be obtained according to binary sequence pairs, Alamouti matrices, and PTM sequences, which are applicable to different target sensing scenarios. Moreover, the sequences for sensing have high Doppler tolerance.

[0368] Furthermore, the sequence lengths of the binary sequence pairs used to generate the sequences for sensing may include any one of the following: 256 bits, 512 bits, 1024 bits, 2048 bits.

[0369] In one embodiment, the sequence length of the binary sequence pair is 256 bits, and the sequences corresponding to the binary sequence pair are: Sn2561, Sn2562. That is, in the above binary sequence pair x, y, x corresponds to Sn2561 and y corresponds to Sn2562. Among them, the specific forms of Sn2561 and Sn2562 can be seen in the foregoing specific embodiments. Details are not described herein again.

[0370] In one embodiment, the sequence length of the binary sequence pair is 512 bits, and the sequences corresponding to the binary sequence pair are: Sn5121, Sn5122. That is, in the above binary sequence pair x, y, x corresponds to Sn5121 and y corresponds to Sn5122. Among them, the specific forms of Sn5121 and Sn5122 can be seen in the foregoing specific embodiments. Details are not described herein again.

[0371] In one embodiment, the sequence length of the binary sequence pair is 1024, and the sequences corresponding to the binary sequence pair are respectively: Sn10241 and Sn10242. That is, in the above binary sequence pair x, y, x corresponds to Sn10241 and y corresponds to Sn10242. Among them, the specific forms of Sn10241 and Sn10242 can be seen in the foregoing specific embodiments. Details are not described herein again.

[0372] In one embodiment, the sequence length of the binary sequence pair is 2048, and the sequences corresponding to the binary sequence pair are respectively: Sn20481 and Sn20482. That is, in the above binary sequence pair x, y, x corresponds to Sn20481 and y corresponds to Sn20482. Among them, the specific forms of Sn20481 and Sn20482 can be seen in the foregoing specific embodiments. Details are not described herein again.

[0373] Specifically, the beneficial effects of the above embodiments can be referred to the description on the method side, and details are not described herein again.

[0374] The data transmission device applied to the sending end and the data transmission device applied to the receiving end of the embodiments of the present application are introduced above. The following introduces the possible product forms of the data transmission device applied to the sending end and the data transmission device applied to the receiving end. It should be understood that any product form that has the features of the data transmission device applied to the sending end described above, and any product form that has the features of the data transmission device applied to the receiving end described above, falls within the protection scope of the present application. It should also be understood that the following introduction is only for example, and does not limit that the product forms of the data transmission device applied to the sending end and the data transmission device applied to the receiving end of the embodiments of the present application are limited to this. Figure 14 Any product form that has the features of the data transmission device applied to the sending end described above, Figure 15 and any product form that has the features of the data transmission device applied to the receiving end described above, falls within the protection scope of the present application. It should also be understood that the following introduction is only for example, and does not limit that the product forms of the data transmission device applied to the sending end and the data transmission device applied to the receiving end of the embodiments of the present application are limited to this.

[0375] As a possible product form, the data transmission device applied to the sending end and the data transmission device applied to the receiving end of the embodiments of the present application can be implemented by a general bus architecture.

[0376] The data transmission device applied to the sending end includes a processor and a transceiver that is internally connected and communicates with the processor; the processor is used to generate a physical layer protocol data unit PPDU, the PPDU includes a training field, and the training field includes a sequence for target perception; the transceiver is used to send the physical layer protocol data unit PPDU.

[0377] Optionally, the data transmission device applied to the sending end may further include a memory, and the memory is used to store instructions executed by the processor.

[0378] Optionally, the memory can be located inside or outside the device.

[0379] The data transmission device applied to the receiving end includes a processor and a transceiver internally connected and communicating with the processor; the transceiver is used to receive a physical layer protocol data unit (PPDU), the PPDU includes a training field, and the training field includes a sequence for target perception. The processor is used to perform target perception according to the sequence for target perception.

[0380] Optionally, the data transmission device applied to the receiving end may further include a memory, and the memory is used to store instructions executed by the processor.

[0381] Optionally, the memory can be located inside or outside the device.

[0382] As a possible product form, the data transmission device applied to the sending end and the data transmission device applied to the receiving end described in the embodiments of the present application can be implemented by a general-purpose processor.

[0383] The data transmission device applied to the sending end includes a processing circuit and an output interface internally connected and communicating with the processing circuit; the processing circuit is used to generate a physical layer protocol data unit (PPDU), the PPDU includes a training field, and the training field includes a sequence for target perception; the output interface is used to output the PPDU. Optionally, the general-purpose processor may further include a storage medium, and the storage medium is used to store instructions executed by the processing circuit.

[0384] The data transmission device applied to the receiving end includes a processing circuit and an input interface internally connected and communicating with the processing circuit, and the input interface is used to input a physical layer protocol data unit (PPDU), the PPDU includes a training field, and the training field includes a sequence for target perception. The processing circuit is used to perform target perception according to the sequence for target perception. Optionally, the general-purpose processor may further include a storage medium, and the storage medium is used to store instructions executed by the processing circuit.

[0385] As a possible product form, the data transmission device applied to the sending end and the data transmission device applied to the receiving end described in the embodiments of the present application can also be implemented by the following: one or more FPGAs (Field Programmable Gate Arrays), PLDs (Programmable Logic Devices), controllers, state machines, gate logic, discrete hardware components, any other suitable circuits, or any combination of circuits capable of performing various functions described throughout the present application.

[0386] It should be understood that the data transmission devices applied to the sending end and the data transmission devices applied to the receiving end in the above various product forms respectively have any functions of the sending end and the receiving end in the above method embodiments and achieve corresponding beneficial effects, which will not be elaborated here.

[0387] On the other hand, the present application also provides a computer-readable storage medium for storing a computer program, and the computer program includes instructions for executing the data transmission method in any one of the above method embodiments.

[0388] On the other hand, the present application also provides a computer program product, and the computer program product includes instructions for executing the data transmission method in any one of the above method embodiments.

[0389] On the other hand, as Figure 16 shown, the present application also provides a communication system, which includes the above-mentioned sending end and receiving end. The sending end is configured to generate and send a PPDU, and the PPDU includes a training field, and the training field includes a sequence for target perception; the receiving end is configured to receive the PPDU and perform target perception accordingly, and the PPDU includes a training field, and the training field includes a sequence for target perception. Wherein the sequence is the sequence described in any one of the above embodiments.

[0390] It should be understood that the term "and / or" in this article is merely a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone. In addition, the character " / " in this article generally represents an "or" relationship between the associated objects before and after.

[0391] Those of ordinary skill in the art can realize that, in combination with the method steps and units described in the embodiments disclosed in this article, they can be implemented by electronic hardware, computer software, or a combination of the two. To clearly illustrate the interchangeability of hardware and software, the steps and components of each embodiment have been generally described according to functions in the above description. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Those of ordinary skill in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present application.

[0392] Those skilled in the art can clearly understand that for the convenience and brevity of description, the specific working processes of the systems, devices, and units described above can refer to the corresponding processes in the foregoing method embodiments, which will not be elaborated here.

[0393] In several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division. In actual implementation, there can be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Additionally, the displayed or discussed couplings or direct couplings or communication connections to each other can be indirect couplings or communication connections through some interfaces, devices, or units, and can also be electrical, mechanical, or other forms of connection.

[0394] The units described as separate components may or may not be physically separated. The components displayed as units may or may not be physical units, that is, they can be located in one place or distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiments of the present application.

[0395] In addition, in each embodiment of the present application, the functional units can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

[0396] If the above-mentioned integrated unit is implemented in the form of a software functional unit 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 the present 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 storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical discs that can store program codes.

[0397] The above is only the specific implementation manner of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present application can easily think of various equivalent modifications or substitutions, and these modifications or substitutions should all be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A data transmission method, characterized in that, Including: Generating a physical layer protocol data unit (PPDU), where the PPDU includes a training field, and the training field includes a sequence for target perception; Transmitting the PPDU; Wherein, the sequence for target perception is obtained based on a binary sequence pair, an Alamouti matrix, and a Lohete-Su-Morse (PTM) sequence, and the Alamouti matrix includes: ， ； wherein, x and y are the binary sequence pairs, which are the reverse complex conjugates of x and y respectively, A0 corresponds to 0 in the PTM sequence, A1 corresponds to 1 in the PTM sequence, and the length of the PTM sequence is , and M is an integer greater than 0; Wherein, the binary sequence pair is generated in the following manner: Initializing the binary sequence pair and the annealing temperature in the simulated annealing algorithm; Executing the simulated annealing algorithm, and at each annealing temperature of the simulated annealing algorithm, performing: iteratively updating the input binary sequence pair at the current annealing temperature according to the coordinate descent method, and searching for the optimal binary sequence pair from these updated binary sequence pairs during the process of iteratively updating the binary sequence pair according to the coordinate descent method; And at each of the annealing temperatures: using the binary sequence pair obtained at the end of the coordinate descent method at the current annealing temperature as the output binary sequence pair at the current annealing temperature, and using this output binary sequence pair as the input binary sequence pair at the next annealing temperature to update the optimal binary sequence pair in the simulated annealing algorithm at the next annealing temperature; When the exit condition of the simulated annealing algorithm is reached, ending the simulated annealing algorithm, and using the optimal binary sequence pair at this time as the generated binary sequence pair.

2. A data transmission method, characterized in that, Including: Receiving a physical layer protocol data unit (PPDU), where the PPDU includes a training field, and the training field includes a sequence for target perception; Performing target perception according to the sequence for target perception; Wherein, the sequence for target perception is obtained based on a binary sequence pair, an Alamouti matrix, and a Lohete-Su-Morse (PTM) sequence, and the Alamouti matrix includes: ， ； wherein, x and y are the binary sequence pairs, which are the reverse complex conjugates of x and y respectively, A0 corresponds to 0 in the PTM sequence, A1 corresponds to 1 in the PTM sequence, and the length of the PTM sequence is , and M is an integer greater than 0; Wherein, the binary sequence pair is generated in the following manner: Initializing the binary sequence pair and the annealing temperature in the simulated annealing algorithm; Executing the simulated annealing algorithm, and at each annealing temperature of the simulated annealing algorithm, performing: iteratively updating the input binary sequence pair at the current annealing temperature according to the coordinate descent method, and searching for the optimal binary sequence pair from these updated binary sequence pairs during the process of iteratively updating the binary sequence pair according to the coordinate descent method; And at each of the annealing temperatures: using the binary sequence pair obtained at the end of the coordinate descent method at the current annealing temperature as the output binary sequence pair at the current annealing temperature, and using this output binary sequence pair as the input binary sequence pair at the next annealing temperature to update the optimal binary sequence pair in the simulated annealing algorithm at the next annealing temperature; When the exit condition of the simulated annealing algorithm is reached, ending the simulated annealing algorithm, and using the optimal binary sequence pair at this time as the generated binary sequence pair.

3. The method according to claim 1 or 2, characterized in that, When M = 1, the sequence for target perception is S Vm11 , S Hm12 ; where the S Vm11 , S Hm12 are respectively: S Vm11 = ; S Hm12 = 。 4. The method according to claim 3, wherein When M = 2, the sequence for target perception is S Vm21 , S Hm22 ; where the S Vm21 , S Hm22 are respectively: S Vm21 = ; S Hm22 = 。 5. The method according to claim 3, wherein When M = 3, the sequence for target perception is S Vm31 , S Hm32 ; where the S Vm31 , S Hm32 are respectively:

6. The method according to any one of claims 3-5, characterized in that The sequence length of the binary sequence pair includes any one of the following: 256 bits, 512 bits, 1024 bits, 2048 bits.

7. The method according to any one of claims 3 to 5, characterized in that When the sequence length of the binary sequence pair is 256 bits, the sequences corresponding to the binary sequence pair are respectively: Sn2561, Sn2562; among which, the specific forms of the said Sn2561 and Sn2562 are as follows: Sn2561 = [-1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1-1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1-1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 1 -11 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1-1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1-1 1 1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1-1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 -1-1 -1 -1 1 1 -1 1 1 1 1 1 1 1 -1 1]; Sn2562 = [1 -1 1 1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 1 -1].

8. The method according to any one of claims 3-5, characterized in that, When the sequence length of the binary sequence pair is 512 bits, the sequences corresponding to the binary sequence pair are respectively: Sn5121, Sn5122; wherein, the specific forms of the Sn5121 and Sn5122 are as follows: Sn5121 = [1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -11 1 -1 1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -11 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -11 1 1 -1 -1 1 -1 1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 -1]； Sn5122=[-1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 11 1 1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1-1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 1 1 -1 1 -11 -1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -11 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 11 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -11 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1-1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 1 1 1 1 -1 1 1-1 -1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 1-1 -1 1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 1 1 -1 1-1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 1 -1 11 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -11 -1 -1 -1-1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 11 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1-1 1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 -11 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1]。 9. The method according to any one of claims 3 to 5, characterized in that, When the sequence length of the binary sequence pair is 1024, the sequences corresponding to the binary sequence pair are respectively: Sn10241, Sn10242; wherein, the specific forms of the Sn10241 and Sn10242 are as follows: Sn10241 = [1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1-1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 1 1 -1 -1 1 1-1 1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 1-1 1 1 -1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 11 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 -11 1 1 1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1-1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 11 1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 11 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 11 -1 1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1-1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 -1-1 -1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 1 -1 -11 -1 -1 1 1 1-1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 -1 1-1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1-1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1-1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1-1 1 1 -1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -11 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 1]； Sn10242 = [1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1-1 -1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -11 1 -1 1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1-1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1-1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1-1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 1 1 -1-1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 11 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 1 1 1 1-1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 -1-1 1 1 -1 1 -1 1 1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -11 1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 11 -1 1 11 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 11 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 11 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 -11 1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 1-1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 -1]。 10. The method according to any one of claims 3 to 5, characterized in that, When the sequence length of the binary sequence pair is 2048, the sequences corresponding to the binary sequence pair are respectively: Sn20481; Sn20482; wherein, the specific forms of the Sn20481 and Sn20482 are as follows: Sn20481 = [1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -11 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 11 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -11 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -11 1 -1 1 1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 11 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1-1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -11 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 -11 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1-1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1-1 -1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 -1 -11 -1 1 1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -11 -1 1 -1 -1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 -1 11 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 1-1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 -1 -11 -1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 -1-1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 1 -1-1 1 -1 1 1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 -11 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 11 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1-1 -1 -1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 11 1 1 -1 1 -1 1-1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1-1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 11 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -11 1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1-1 -1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 -1 1 11 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 1-1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -11 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 -1-1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -11 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 1 1 11 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1-1 -1 1 -1 -1 1 -1 1-1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 11 1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1-1 1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 1 -1 -11 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -11 1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1-1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 1 1 1-1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1-1 -1 1 1 1 1 -1 1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 -11 1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 -1-1 -1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -11 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1-1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1-1 -1 1 -1 -1 -1 1 1 -1 -1-1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -11 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1-1 1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 1 -1 1 1 1 1 1 1 1-1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 11 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 11 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 -1 1 1 1 1 11 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 -1-1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 11 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1-1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1 -11 1 1 -1 -1 -1 -1 1 -1 -1 1 11 -1 1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -11 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1]； Sn20482=[-1 -1 -1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1-1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1-1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1-1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -11 -1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 1-1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1-1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 1-1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1-1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1-1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 1 11 -1 1 -11 1 -1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -11 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1-1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 11 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -11 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 -11 -1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1-1 -1 1 -1-1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -11 1 1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 -1 1 11 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1-1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -11 1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -11 1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 11 1 1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 1-1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 1 1 -1 -1 -1 -1 1 11 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1-1 -1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 -1 1-1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1-1 1 1 -1 -1 -11 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1-1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 -1 1 1 1-1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 1 1 -1 -1 1 1 1 -1 -1 11 1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -11 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -11 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 -1 -11 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1-1 1 1 1 1 1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 11 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -11 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -11 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 -11 -1 1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 11 -1 1 1 1 -1 -1-1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1-1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 11 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1-1 -1 -1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1-1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 -1-1 1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 11 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 1 11 1 -1 -1 1 1 1 1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -11 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 -11 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -11 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 1 -1 1 1 -1-1 -1 -1 1 1 1 -1 -1 -11 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 -1 -11 1 1 1 -1 1 1 1 -1 -1 1 -1 1]。 11. A data transmission device, characterized in that, For performing the method according to any one of claims 1, 3 - 10.

12. A data transmission device, characterized in that, For performing the method according to any one of claims 2, 3 - 10.

13. A data transmission device, characterized in that, Comprising a processor and a transceiver; The processor is used to generate a physical layer protocol data unit PPDU, the PPDU includes a training field, and the training field includes a sequence for target perception; The transceiver is used to transmit the physical layer protocol data unit (PPDU). Among them, the sequence for target perception is obtained based on binary sequence pairs, Alamouti matrix, and Lohete-Su-Morse PTM sequence. The Alamouti matrix includes: ， ； wherein, x and y are the binary sequence pairs, which are the reverse complex conjugates of x and y respectively, A0 corresponds to 0 in the PTM sequence, A1 corresponds to 1 in the PTM sequence, and the length of the PTM sequence is , and M is an integer greater than 0; Among them, the binary sequence pairs are generated in the following manner: Initialize the binary sequence pairs and the annealing temperature in the simulated annealing algorithm. Execute the simulated annealing algorithm. At each annealing temperature of the simulated annealing algorithm, perform the following: Iteratively update the input binary sequence pairs at the current annealing temperature according to the coordinate descent method. During the process of iteratively updating the binary sequence pairs according to the coordinate descent method, search for the optimal binary sequence pairs from these updated binary sequence pairs. And at each annealing temperature: Take the binary sequence pairs obtained at the end of the coordinate descent method at the current annealing temperature as the output binary sequence pairs at the current annealing temperature. These output binary sequence pairs serve as the input binary sequence pairs for the next annealing temperature to update the optimal binary sequence pairs in the simulated annealing algorithm at the next annealing temperature. When the exit condition of the simulated annealing algorithm is reached, end the simulated annealing algorithm, and take the optimal binary sequence pairs at this time as the generated binary sequence pairs.

14. A data transmission device, characterized in that, It includes a processor and a transceiver. The transceiver is used to receive the physical layer protocol data unit (PPDU). The PPDU contains a training field, and the training field contains a sequence for target perception. The processor is used to perform target perception based on the sequence for target perception. Among them, the sequence for target perception is obtained based on binary sequence pairs, Alamouti matrix, and Lohete-Su-Morse PTM sequence. The Alamouti matrix includes: ， ； wherein, x and y are the binary sequence pairs, which are the reverse complex conjugates of x and y respectively, A0 corresponds to 0 in the PTM sequence, A1 corresponds to 1 in the PTM sequence, and the length of the PTM sequence is , and M is an integer greater than 0; Among them, the binary sequence pairs are generated in the following manner: Initialize the binary sequence pairs and the annealing temperature in the simulated annealing algorithm. Execute the simulated annealing algorithm. At each annealing temperature of the simulated annealing algorithm, perform the following: Iteratively update the input binary sequence pairs at the current annealing temperature according to the coordinate descent method. During the process of iteratively updating the binary sequence pairs according to the coordinate descent method, search for the optimal binary sequence pairs from these updated binary sequence pairs. And at each annealing temperature: Take the binary sequence pairs obtained at the end of the coordinate descent method at the current annealing temperature as the output binary sequence pairs at the current annealing temperature. These output binary sequence pairs serve as the input binary sequence pairs for the next annealing temperature to update the optimal binary sequence pairs in the simulated annealing algorithm at the next annealing temperature. When the exit condition of the simulated annealing algorithm is reached, end the simulated annealing algorithm, and take the optimal binary sequence pairs at this time as the generated binary sequence pairs.

15. A data transmission device, characterized in that, It includes a processing circuit and an output interface. The processing circuit is used to generate the physical layer protocol data unit (PPDU). The PPDU contains a training field, and the training field contains a sequence for target perception. The output interface is used to output the PPDU. Among them, the sequence for target perception is obtained based on a binary sequence pair, an Alamouti matrix, and a Lohete-Su-Morse PTM sequence, where the Alamouti matrix includes: ， ； wherein, x and y are the binary sequence pairs, which are the reverse complex conjugates of x and y respectively, A0 corresponds to 0 in the PTM sequence, A1 corresponds to 1 in the PTM sequence, and the length of the PTM sequence is , and M is an integer greater than 0; Among them, the binary sequence pair is generated in the following manner: Initialize the binary sequence pair and the annealing temperature in the simulated annealing algorithm; Execute the simulated annealing algorithm, and at each annealing temperature of the simulated annealing algorithm, execute: iteratively update the input binary sequence pair at the current annealing temperature according to the coordinate descent method. During the process of iteratively updating the binary sequence pair according to the coordinate descent method, search for the optimal binary sequence pair from these updated binary sequence pairs; And at each of the annealing temperatures: use the binary sequence pair obtained at the end of the coordinate descent method at the current annealing temperature as the output binary sequence pair at the current annealing temperature, and use this output binary sequence pair as the input binary sequence pair at the next annealing temperature to update the optimal binary sequence pair in the simulated annealing algorithm at the next annealing temperature; When the exit condition of the simulated annealing algorithm is reached, end the simulated annealing algorithm, and use the optimal binary sequence pair at this time as the generated binary sequence pair.

16. A data transmission device, characterized in that, It includes a processing circuit and an input interface; The input interface is used to input a physical layer protocol data unit (PPDU), the PPDU contains a training field, and the training field contains a sequence for target perception; The processing circuit is used to perform target perception according to the sequence for target perception; Among them, the sequence for target perception is obtained based on a binary sequence pair, an Alamouti matrix, and a Lohete-Su-Morse PTM sequence, where the Alamouti matrix includes: ， ； wherein, x and y are the binary sequence pairs, which are the reverse complex conjugates of x and y respectively, A0 corresponds to 0 in the PTM sequence, A1 corresponds to 1 in the PTM sequence, and the length of the PTM sequence is , and M is an integer greater than 0; Among them, the binary sequence pair is generated in the following manner: Initialize the binary sequence pair and the annealing temperature in the simulated annealing algorithm; Execute the simulated annealing algorithm, and at each annealing temperature of the simulated annealing algorithm, execute: iteratively update the input binary sequence pair at the current annealing temperature according to the coordinate descent method. During the process of iteratively updating the binary sequence pair according to the coordinate descent method, search for the optimal binary sequence pair from these updated binary sequence pairs; And at each of the annealing temperatures: use the binary sequence pair obtained at the end of the coordinate descent method at the current annealing temperature as the output binary sequence pair at the current annealing temperature, and use this output binary sequence pair as the input binary sequence pair at the next annealing temperature to update the optimal binary sequence pair in the simulated annealing algorithm at the next annealing temperature; When the exit condition of the simulated annealing algorithm is reached, end the simulated annealing algorithm, and use the optimal binary sequence pair at this time as the generated binary sequence pair.

17. A computer-readable storage medium, characterized in that, For storing a computer program, the computer program includes instructions for executing the method according to any one of claims 1-10.

18. A computer program product, characterized in that, The computer program product includes instructions for executing the method according to any one of claims 1-10.

Images