A synchronization header design and receiving processing method, system, device and storage medium

Abstract

This invention relates to the field of signal processing technology, and discloses a synchronization header design and receiving processing method, system, device, and storage medium, wherein the method includes: constructing a length of... l The base sequence is obtained by performing autocorrelation on it, calculating the peak-to-peak ratio (PPR) of the autocorrelation results, and iteratively searching to find the base sequence with the highest PPR, which is then used as the optimal base sequence. n Group length is k The mask sequence, using the optimal base sequence as the basic unit and n The group mask sequence is XORed to obtain a sequence of length . n × k × l The invention generates a synchronization header sequence and outputs a dual-polarization synchronization header sequence through dual-polarization processing. It receives a received sequence containing both the dual-polarization synchronization header sequence and a noise sequence, constructs a dual-polarization local sequence based on the optimal base sequence, performs coherent and incoherent processing on the received sequence according to the local sequence, and outputs the corresponding processing results. This invention significantly reduces the number of multipliers and adders required for a single computation, resulting in low hardware processing overhead.

Description

Technical Field

[0001] This invention relates to the field of signal processing technology, and in particular to a synchronization header design and receiving processing method, system, device and storage medium. Background Technology

[0002] Pseudo-random noise (PRN) sequences are the core foundation for generating spreading codes in spread spectrum communication. The pseudo-codes generated from PRNs possess excellent autocorrelation properties, and different code types maintain good cross-correlation characteristics, making them a key carrier for signal detection and frame synchronization in communication systems. Therefore, various communication systems commonly use this sequence as a core component of the synchronization header, relying on its unique sequence characteristics to complete the synchronization identification of communication frames, ensuring the accuracy of communication signal transmission and parsing. It is an indispensable technical element in various communication systems such as spread spectrum communication and wireless communication.

[0003] In various complex communication environments, some communication systems need to operate under low signal-to-noise ratio (SNR) transmission conditions for extended periods. In these scenarios, communication signals are susceptible to environmental noise, channel multipath interference, co-channel interference, and other factors, easily masking signal characteristics and posing significant challenges to subsequent signal detection. To ensure sufficiently high correlation peaks during signal detection in such scenarios, overcoming the limitations of noise and various interferences, and achieving effective and accurate identification of the synchronization header, these systems typically employ a long pseudo-random sequence design for the synchronization header. Increasing the sequence length enhances the anti-interference capability and recognition reliability of correlation detection, ensuring accurate capture of the synchronization header even in complex interference environments.

[0004] However, in practical receiver processing of long pseudo-random sequences, the amount of data processed in a single operation increases significantly. This necessitates the use of more shift registers in the hardware circuitry to handle sequence shifting and storage operations, as well as more multipliers and adders to perform numerous multiplication-accumulation operations. This not only directly increases the overall hardware processing overhead and significantly raises the R&D and manufacturing costs of communication equipment, but also leads to more complex circuit structures due to the increased number of hardware components, reducing the integration and operational stability of the hardware system. Furthermore, the involvement of numerous hardware components in the computation can also affect the computational efficiency of related processing, increase signal detection latency, and reduce the real-time performance of signal detection, making it difficult to adapt to some communication scenarios with strict requirements for transmission latency.

[0005] Currently, there are some attempts in the industry to improve this problem. Some solutions try to reduce hardware resource requirements by simplifying the relevant computational logic. However, these methods often come at the cost of sacrificing the autocorrelation and cross-correlation characteristics of the pseudocode, resulting in a decrease in the detection performance of the synchronization head and failing to meet the signal detection requirements under low signal-to-noise ratio. Other solutions improve device utilization by optimizing hardware circuit layout and adopting integrated hardware design, but they are unable to fundamentally solve the problem of hardware resource consumption caused by long sequence operations. They still cannot balance the requirements of high detection performance under low signal-to-noise ratio and low-cost engineering implementation. This has become a technical problem that urgently needs to be solved in the field of synchronization head design and receiver processing in current low signal-to-noise ratio communication systems. Summary of the Invention

[0006] To address the aforementioned issues, this invention proposes a synchronization header design and receiving processing method, system, device, and storage medium that requires only a shift register of the base sequence length, while significantly reducing the number of multipliers and adders needed for a single calculation. This results in low hardware processing overhead and ease of engineering implementation at low cost.

[0007] The technical solution adopted in this invention is as follows: A synchronization header design and receiving processing method includes: Construction length is l The base sequence is obtained by performing autocorrelation operation on the base sequence to obtain the autocorrelation result. The peak-to-peak ratio of the autocorrelation result is calculated and the base sequence with the maximum peak-to-peak ratio is obtained by iterative search, which is taken as the optimal base sequence. structure n Group length is k The mask sequence, using the optimal base sequence as the basic unit and n The group mask sequence is XORed to obtain a sequence of length . n × k × l The synchronization header sequence is obtained and output as a dual-polarization synchronization header sequence through dual-polarization processing; The system receives a received sequence containing a dual-polarization synchronization header sequence and a noise sequence, constructs a dual-polarization local sequence based on the optimal base sequence, performs coherent and incoherent processing on the received sequence according to the local sequence, and outputs the corresponding processing results.

[0008] Furthermore, the construction length is l The autocorrelation result is obtained by performing autocorrelation operations on the basis sequences, including the following steps: S101. The structural length is l base sequence , of which n bits The generation methods include:

[0009]

[0010] In the formula, For length is l A random sequence, where the initial value is... exist Randomly select a value within the interval; S102. For lengths of l Perform autocorrelation operation on the basis sequence M' and output the autocorrelation result. :

[0011]

[0012] In the formula, It is a bipolar base sequence. for Right loop Bit, For the expected operation, This is for the transpose operation.

[0013] Further, the calculation of the peak-to-peak ratio of the autocorrelation results and the iterative search to obtain the base sequence with the maximum peak-to-peak ratio as the optimal base sequence includes the following steps: S103. Calculate the autocorrelation results of the basis sequence M'. peak-to-peak ratio thd :

[0014] S104. Repeat steps S101 to S103, looping. K Next, search for the basis sequence with the largest peak-to-peak ratio, and use it as the optimal basis sequence M, that is:

[0015] In the formula, The optimal basis sequence M is the first l 1 bit.

[0016] Furthermore, the construction n Group length is k The mask sequence includes: S201. Constructing the first m Group length is k mask sequence :

[0017]

[0018]

[0019] In the formula, For the first m Group mask sequence The k 1 bit; For the first m Group mask random number sequence The p A random number, and an initial value exist Randomly select a value within the interval; It is a cosine function. It is the inverse cosine function; S202. Calculate the first... m Group length is k mask sequence With the previous m- Cross-correlation results of a set of mask sequences:

[0020]

[0021] In the formula, For the first m Group mask sequence and the first j The cross-correlation results of the group mask sequences, For the first m Group of bipolar mask sequences, For the first j Group of bipolar mask sequences, This is a transpose operation; S203. Determine all cross-correlation results Is it less than 2? If so, then m = m +1, return to step S201; otherwise, directly return to step S201. m = n When +1 is reached, the process stops, meaning it's complete. n Group mask sequence Y=[Y1,Y2,…,Y n The construction of ].

[0022] Furthermore, the step of using the optimal basis sequence as the basic unit and... n The group mask sequence is XORed to obtain a sequence of length . n × k × l The synchronization header sequence is processed and a dual-polarization synchronization header sequence is output, including: Using the optimal basis sequence M as the basic unit, that is:

[0023] In the formula, The optimal basis sequence M is the first l 1 bit; according to n Group mask sequence Y=[Y1,Y2,…,Y n ], where the length of each mask sequence is k The optimal basis sequence M is XORed sequentially, and the output length is... n × k × l The synchronization header sequence S, namely:

[0024]

[0025]

[0026] In the formula, For the first m Group mask sequence The k bits, For the synchronization header sequence S, the first... n × l × k bits, This is an XOR operation; The synchronization header sequence S is processed into dual polarization, and the dual polarization synchronization header sequence is output. ,Right now: .

[0027] Further, the received sequence, comprising a dual-polarization synchronization header sequence and a noise sequence, and the construction of a dual-polarization local sequence based on the optimal base sequence, includes: Receives a sequence of dual-polarization synchronization headers. Received sequence X of noise sequence N:

[0028]

[0029]

[0030] In the formula, For the first received sequence X n × l × k One possible value; For the noise sequence N, the first... n × l × k One possible value; Constructing bipolar local sequences based on the optimal base sequence M : .

[0031] Further, the coherent and incoherent processing of the received sequence based on the local sequence includes: Perform coherent processing on the received sequence based on the local sequence:

[0032]

[0033] In the formula, For receiving a local sequence with relative bipolarization of sequence X Offset is The coherent processing results For receiving sequence The i Each receive value; For transpose operation, This is for rounding up; For the first m Group of dual-polarization mask sequences The k 1 bit; For the first m Group mask sequence The k 1 bit; Incoherent processing of the received sequence based on the local sequence:

[0034]

[0035] In the formula, For receiving a local sequence with relative bipolarization of sequence X Offset is Incoherent processing results This is a modulo operation.

[0036] A synchronization header design and receiving processing system, comprising: The optimal basis sequence generation module is configured to construct a length of l The base sequence is obtained by performing autocorrelation operation on the base sequence to obtain the autocorrelation result. The peak-to-peak ratio of the autocorrelation result is calculated and the base sequence with the maximum peak-to-peak ratio is obtained by iterative search, which is taken as the optimal base sequence. The synchronization header sequence generation module is configured to construct... n Group length is k The mask sequence, using the optimal base sequence as the basic unit and n The group mask sequence is XORed to obtain a sequence of length . n × k× l The synchronization header sequence is obtained and output as a dual-polarization synchronization header sequence through dual-polarization processing; The received sequence processing module is configured to receive a received sequence containing a dual-polarization synchronization header sequence and a noise sequence, construct a dual-polarization local sequence based on the optimal base sequence, perform coherent and incoherent processing on the received sequence according to the local sequence, and output the corresponding processing results.

[0037] A computer device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to implement the synchronization header design and receiving processing method.

[0038] A computer-readable storage medium storing a computer program that, when executed by a processor, implements the synchronization header design and receiving processing method.

[0039] The beneficial effects of this invention are as follows: 1) Reduced receiving processing complexity: By introducing a base sequence and multiple mask sequences, and sequentially XORing and concatenating the base sequence with bits within the multiple mask sequences, a pseudo-random sequence of arbitrary length can be constructed. Since the pseudo-random sequence consists of multiple base sequences, the local sequence only needs to use a shorter base sequence for correlation processing. Based on the order of the multiple base sequences, multiple delay units are used to align the correlation results of the multiple base sequences. Then, using bit indicators within the multiple mask sequences, the signs of the correlation results of the multiple base sequences are corrected and summed to output the final correlation result. This method only requires a shift register the length of the base sequence, significantly reducing the number of multipliers and adders required for a single calculation. It has low hardware processing overhead and is easy to implement in engineering at low cost.

[0040] 2) Possesses good auto / cross-correlation: By introducing a base sequence and multiple mask sequences, and sequentially XORing and concatenating the base sequence with bits within the multiple mask sequences, a pseudo-random sequence of arbitrary length can be constructed. The base sequence is optimized using the maximum peak-to-peak ratio principle, and the multiple mask sequences are optimized using cross-correlation constraints to reduce the auto / cross-correlation sidelobes of the pseudo-random sequence. It can also be extended to multi-user code division multiple access channels, where different users use the same base sequence but different mask sequences to form multiple types of pseudo-code sequences. The good cross-correlation between these multiple types of pseudo-code sequences distinguishes different users. Attached Figure Description

[0041] Figure 1 This is a flowchart of a synchronization header design and receiving processing method according to Embodiment 1 of the present invention.

[0042] Figure 2 This is a schematic diagram of the synchronization header sequence generation in Embodiment 1 of the present invention.

[0043] Figure 3 This is a schematic diagram of the coherent processing of the synchronization header sequence in Embodiment 1 of the present invention.

[0044] Figure 4 This is a schematic diagram of the non-coherent processing of the synchronization header sequence in Embodiment 1 of the present invention.

[0045] Figure 5 This is a comparison diagram of the synchronization header correlation peaks of the method of the present invention and the traditional method in Embodiment 1 of the present invention. Detailed Implementation

[0046] To provide a clearer understanding of the technical features, objectives, and effects of the present invention, specific embodiments are now described. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention; that is, the described embodiments are only a part of the embodiments of the invention, not all of them. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without inventive effort are within the scope of protection of the present invention.

[0047] Example 1 like Figure 1 As shown, this embodiment provides a synchronization header design and receiving processing method, including: Construction length is l The base sequence is obtained by performing autocorrelation operation on the base sequence to obtain the autocorrelation result. The peak-to-peak ratio of the autocorrelation result is calculated and the base sequence with the maximum peak-to-peak ratio is obtained by iterative search, which is taken as the optimal base sequence. structure n Group length is k The mask sequence, using the optimal base sequence as the basic unit and n The group mask sequence is XORed to obtain a sequence of length . n × k × l The synchronization header sequence is obtained and output as a dual-polarization synchronization header sequence through dual-polarization processing; The system receives a received sequence containing a dual-polarization synchronization header sequence and a noise sequence, constructs a dual-polarization local sequence based on the optimal base sequence, performs coherent and incoherent processing on the received sequence according to the local sequence, and outputs the corresponding processing results.

[0048] It should be noted that this method constructs a synchronization header sequence by combining the base sequence and the mask sequence, which greatly reduces the overall complexity of synchronization header design and reception processing. At the same time, relying on the characteristics of the optimal base sequence and the preferred mask sequence, the synchronization header sequence has good autocorrelation and cross-correlation, and the hardware processing overhead is lower, making it easier to achieve low-cost engineering implementation.

[0049] Preferably, the construction length is lThe autocorrelation result is obtained by performing autocorrelation operations on the basis sequences, including the following steps: S101. The structural length is l base sequence , of which n bits The generation methods include:

[0050]

[0051] In the formula, For length is l A random sequence, where the initial value is... exist Randomly select a value within the interval; S102. For lengths of l Perform autocorrelation operation on the basis sequence M' and output the autocorrelation result. :

[0052]

[0053] In the formula, It is a bipolar base sequence. for Right loop Bit, For the expected operation, This is for the transpose operation.

[0054] It should be noted that the above steps provide accurate and effective autocorrelation calculation data for the subsequent selection of the optimal base sequence, ensuring the objectivity and scientific nature of the base sequence selection process, and laying a data foundation for the subsequent construction of a high-performance synchronization head sequence.

[0055] Preferably, the peak-to-peak ratio of the autocorrelation results is calculated and the base sequence with the maximum peak-to-peak ratio is obtained by iterative search, which is then used as the optimal base sequence. This includes the following steps: S103. Calculate the autocorrelation results of the basis sequence M'. peak-to-peak ratio thd :

[0056] S104. Repeat steps S101 to S103, looping. K Next, search for the basis sequence with the largest peak-to-peak ratio, and use it as the optimal basis sequence M, that is:

[0057] In the formula, The optimal basis sequence M is the firstl 1 bit.

[0058] It should be noted that the above steps select the optimal base sequence through the maximum peak-to-peak ratio principle, so that the selected base sequence has better autocorrelation characteristics, which can effectively reduce the autocorrelation sidelobes of the subsequently constructed pseudo-random sequence and improve the overall performance of the synchronization head sequence.

[0059] Preferably, the structure n Group length is k The mask sequence includes: S201. Constructing the first m Group length is k mask sequence :

[0060]

[0061]

[0062] In the formula, For the first m Group mask sequence The k 1 bit; For the first m Group mask random number sequence The p A random number, and an initial value exist Randomly select a value within the interval; It is a cosine function. It is the inverse cosine function; S202. Calculate the first... m Group length is k mask sequence With the previous m- Cross-correlation results of a set of mask sequences:

[0063]

[0064] In the formula, For the first m Group mask sequence and the first j The cross-correlation results of the group mask sequences, For the first m Group of bipolar mask sequences, For the first j Group of bipolar mask sequences, This is a transpose operation; S203. Determine all cross-correlation results Is it less than 2? If so, then m = m +1, return to step S201; otherwise, directly return to step S201. m = n When +1 is reached, the process stops, meaning it's complete. n Group mask sequence Y=[Y1,Y2,…,Y n The construction of ].

[0065] It should be noted that the above steps optimize the mask sequence through the cross-correlation constraint principle, ensuring that the cross-correlation between the constructed mask sequences meets the engineering requirements, avoiding cross-correlation interference in the subsequent synchronization header sequence construction process, and making the mask sequence construction process operable and standardized.

[0066] like Figure 2 As shown, the optimal basis sequence is used as the basic unit and... n The group mask sequence is XORed to obtain a sequence of length . n × k × l The synchronization header sequence is processed and a dual-polarization synchronization header sequence is output, including: Using the optimal basis sequence M as the basic unit, that is:

[0067] In the formula, The optimal basis sequence M is the first l 1 bit; according to n Group mask sequence Y=[Y1,Y2,…,Y n ], where the length of each mask sequence is k The optimal basis sequence M is XORed sequentially, and the output length is... n × k × l The synchronization header sequence S, namely:

[0068]

[0069]

[0070] In the formula, For the first m Group mask sequence The k bits, For the synchronization header sequence S, the first... n × l × k bits, This is an XOR operation; The synchronization header sequence S is processed into dual polarization, and the dual polarization synchronization header sequence is output. ,Right now: .

[0071] It should be noted that the above steps achieve flexible construction of the synchronization header sequence through XOR processing. The sequence length can be flexibly adjusted according to the parameters of the base sequence and the mask sequence. At the same time, the dual polarization processing gives the synchronization header sequence dual polarization signal characteristics, effectively improving the anti-interference capability during signal transmission and expanding the application scenarios of the synchronization header sequence.

[0072] Preferably, receiving a received sequence including a dual-polarization synchronization header sequence and a noise sequence, and constructing a dual-polarization local sequence based on the optimal base sequence includes: Receives a sequence of dual-polarization synchronization headers. Received sequence X of noise sequence N:

[0073]

[0074]

[0075] In the formula, For the first received sequence X n × l × k One possible value; For the noise sequence N, the first... n × l × k One possible value; Constructing bipolar local sequences based on the optimal base sequence M : .

[0076] It should be noted that the local sequence constructed in the above steps has a high degree of matching with the target dual-polarization synchronization header sequence, which can effectively shield the interference of noise sequences on subsequent processing, provide an accurate reference benchmark for coherent and non-coherent processing of the received sequence, and improve the accuracy of subsequent signal detection.

[0077] Preferably, the received sequence is subjected to coherent and incoherent processing based on the local sequence, including: like Figure 3 As shown, the received sequence is coherently processed based on the local sequence:

[0078]

[0079] In the formula, For receiving a local sequence with relative bipolarization of sequence X Offset is The coherent processing results For receiving sequence The i Each receive value; For transpose operation, This is for rounding up; For the first m Group of dual-polarization mask sequences The k 1 bit; For the first m Group mask sequence The k 1 bit; Incoherent processing of the received sequence based on the local sequence:

[0080]

[0081] In the formula, For receiving a local sequence with relative bipolarization of sequence X Offset is Incoherent processing results This is a modulo operation.

[0082] It should be noted that the above steps combine coherent and non-coherent processing, which can extract the effective signals in the received sequence more comprehensively and deeply, effectively improving the accuracy and reliability of synchronization head detection. Even in the presence of noise interference, the target synchronization head sequence can be accurately identified.

[0083] In summary, this method introduces a base sequence and multiple mask sequences. The base sequence is sequentially XORed and concatenated with bits within the multiple mask sequences to construct a pseudo-random sequence of arbitrary length. The base sequence is optimized using the maximum peak-to-peak ratio principle, and the multiple mask sequences are optimized using cross-correlation constraints to reduce the autocorrelation sidelobes of the pseudo-random sequence. Since the pseudo-random sequence consists of multiple base sequences, the local sequence only needs to be correlated using a shorter base sequence. Based on the order of the multiple base sequences, multiple delayers are used to align the correlation results of the multiple base sequences. Then, using bit indicators within the multiple mask sequences, the signs of the correlation results of the multiple base sequences are corrected and summed to output the final correlation result.

[0084] Depend on Figure 5It can be seen that, compared with the unoptimized synchronization header sequence, the base sequence of the method of this invention is optimized using the maximum peak-to-peak ratio principle, and multiple mask sequences are optimized using the cross-correlation constraint principle. This effectively reduces the self / cross-correlation sidelobes of the pseudo-random sequence, improves detection performance, and reduces the probability of false detection. The number of mask sequence groups... n =16, mask sequence length k =16, base sequence length l =24.

[0085] Table 1 - Comparison of resource costs between the method of this invention and traditional methods

[0086] Table 1 compares the resource overhead of the method of this invention with that of the traditional method, when the number of mask sequence groups... n =16, mask sequence length k =16, base sequence length l When =24, the constructed synchronization header length is n × k × l =6144. Using traditional direct correlation processing methods, 6144 shift registers, 6144 multipliers, and 6143 adders are required; while using the method of this invention, only 24 shift registers, 280 multipliers, and 278 adders are needed, significantly reducing the number of multipliers, adders, and shift registers required for a single calculation. This results in low hardware processing overhead and ease of engineering implementation at low cost.

[0087] Example 2 This embodiment is based on embodiment 1: This embodiment provides a synchronization header design and receiving processing system, including an optimal base sequence generation module, a synchronization header sequence generation module, and a receiving sequence processing module, each of which is configured to perform its corresponding function.

[0088] Specifically, the optimal base sequence generation module performs operations such as constructing a base sequence of a specified length, performing autocorrelation on the base sequence, calculating the peak-to-peak ratio, and iteratively searching and filtering for the optimal base sequence; the synchronization header sequence generation module performs operations such as constructing multiple sets of mask sequences of a specified length, XORing the optimal base sequence with the mask sequence to generate the synchronization header sequence, performing dual-polarization processing on the synchronization header sequence, and outputting the dual-polarization synchronization header sequence; the receiving sequence processing module performs operations such as receiving a mixed receiving sequence containing the dual-polarization synchronization header sequence, constructing a dual-polarization local sequence based on the optimal base sequence, performing coherent and non-coherent processing on the received sequence, and outputting the results. The three modules cooperate in the order of signal processing to complete the overall synchronization header design and receiving processing flow.

[0089] It should be noted that the module division of this system follows the logical rules of signal processing. Each module has a highly targeted function, and the collaborative operation between modules can effectively improve the overall processing efficiency. At the same time, the hardware implementation logic of the system is simple, requires fewer hardware components, and has low hardware overhead, making it suitable for low-cost engineering application scenarios.

[0090] Example 3 This embodiment is based on embodiment 1: This embodiment provides a computer device, including a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the synchronization header design and receiving processing method of Embodiment 1. The computer program can be in the form of source code, object code, executable file, or some intermediate form.

[0091] Specifically, a computer program capable of implementing the synchronization header design and receiving processing method is pre-stored in the memory of a computer device. This program contains execution instructions for each step of the method. The processor of the computer device calls the computer program stored in the memory and executes the instructions line by line, thereby triggering each step of the base sequence construction and optimization, mask sequence construction and synchronization header sequence generation, receiving sequence processing and coherent and incoherent operations in sequence, thus completely executing the entire synchronization header design and receiving processing method.

[0092] It should be noted that by implementing the synchronization header design and receiving processing method on computer equipment, the automation and intelligence of the method execution are greatly improved. The high-speed computing characteristics of the processor can ensure the execution efficiency of each step of the method, while the precise computing power of the processor can effectively avoid errors caused by manual operation and improve the accuracy of the processing results.

[0093] Example 4 This embodiment is based on embodiment 1: This embodiment provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the synchronization header design and receiving processing method of Embodiment 1. The computer program can be in the form of source code, object code, executable file, or some intermediate form. The storage medium includes any entity or device capable of carrying computer program code, a recording medium, a computer memory, a read-only memory (ROM), a random access memory (RAM), an electrical carrier signal, a telecommunication signal, and a software distribution medium, etc.

[0094] Specifically, the computer-readable storage medium stores a computer program adapted for execution by various processors. The program is based on the step logic of the synchronization header design and receiving processing method, and has corresponding execution instructions. The instructions include the execution requirements of all stages such as base sequence selection, mask sequence construction, synchronization header sequence generation, and receiving sequence processing. When the processors of different devices read and execute the computer program from the storage medium, they can implement the entire process of the method in sequence according to the instructions.

[0095] It should be noted that computer-readable storage media have good portability and compatibility, enabling flexible storage and cross-device transmission of the program. It can be adapted to different models and types of computer devices, greatly improving the application scope and scalability of this synchronization header design and receiving processing method.

[0096] The above description is merely a preferred embodiment of the present invention. It should be understood that the present invention is not limited to the forms disclosed herein and should not be construed as excluding other embodiments. It can be used in various other combinations, modifications, and environments, and can be altered within the scope of the concept described herein through the above teachings or related technologies or knowledge. Modifications and variations made by those skilled in the art that do not depart from the spirit and scope of the present invention should be within the protection scope of the appended claims.

[0097] It should be noted that, for the sake of simplicity, the foregoing method embodiments are described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, as some steps may be performed in other orders or simultaneously according to this application. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are preferred embodiments, and the actions and modules involved are not necessarily essential to this application.

Claims

1. A synchronization header design and receiving processing method, characterized in that, include: Construction length is l The base sequence is obtained by performing autocorrelation operation on the base sequence to obtain the autocorrelation result. The peak-to-peak ratio of the autocorrelation result is calculated and the base sequence with the maximum peak-to-peak ratio is obtained by iterative search, which is taken as the optimal base sequence. structure n Group length is k The mask sequence, using the optimal base sequence as the basic unit and n The group mask sequence is XORed to obtain a sequence of length . n × k × l The synchronization header sequence is obtained and output as a dual-polarization synchronization header sequence through dual-polarization processing; The system receives a received sequence containing a dual-polarization synchronization header sequence and a noise sequence, constructs a dual-polarization local sequence based on the optimal base sequence, performs coherent and incoherent processing on the received sequence according to the local sequence, and outputs the corresponding processing results.

2. The synchronization header design and receiving processing method according to claim 1, characterized in that, The construction length is l The autocorrelation result is obtained by performing autocorrelation operations on the basis sequences, including the following steps: S101. The structural length is l base sequence , of which n bits The generation methods include: In the formula, For length is l A random sequence, where the initial value is... exist Randomly select a value within the interval; S102. For lengths of l Perform autocorrelation operation on the basis sequence M' and output the autocorrelation result. : In the formula, It is a bipolar base sequence. for Right loop Bit, For the expected operation, This is for the transpose operation.

3. The synchronization header design and receiving processing method according to claim 2, characterized in that, The calculation of the peak-to-peak ratio of the autocorrelation results and the cyclic search to obtain the base sequence with the maximum peak-to-peak ratio as the optimal base sequence include the following steps: S103. Calculate the autocorrelation results of the basis sequence M'. peak-to-peak ratio thd : S104. Repeat steps S101 to S103, looping. K Next, search for the basis sequence with the largest peak-to-peak ratio, and use it as the optimal basis sequence M, that is: In the formula, The optimal basis sequence M is the first l 1 bit.

4. The synchronization header design and receiving processing method according to claim 3, characterized in that, The structure n Group length is k The mask sequence includes: S201. Constructing the first m Group length is k mask sequence : In the formula, For the first m Group mask sequence The k 1 bit; For the first m Group mask random number sequence The p A random number, and an initial value exist Randomly select a value within the interval; It is a cosine function. It is the inverse cosine function; S202. Calculate the first... m Group length is k mask sequence With the previous m- Cross-correlation results of a set of mask sequences: In the formula, For the first m Group mask sequence and the first j The cross-correlation results of the group mask sequences, For the first m Group of bipolar mask sequences, For the first j Group of bipolar mask sequences, This is a transpose operation; S203. Determine all cross-correlation results Is it less than 2? If so, then m = m +1, return to step S201; otherwise, directly return to step S201. m = n When +1 is reached, the process stops, meaning it's complete. n Group mask sequence Y=[Y1,Y2,…,Y n The construction of ].

5. The synchronization header design and receiving processing method according to claim 4, characterized in that, The optimal basis sequence is used as the basic unit and n The group mask sequence is XORed to obtain a sequence of length . n × k × l The synchronization header sequence is processed and a dual-polarization synchronization header sequence is output, including: Using the optimal basis sequence M as the basic unit, that is: In the formula, The optimal basis sequence M is the first l 1 bit; according to n Group mask sequence Y=[Y1,Y2,…,Y n ], where the length of each mask sequence is k The optimal basis sequence M is XORed sequentially, and the output length is... n × k × l The synchronization header sequence S, namely: In the formula, For the first m Group mask sequence The k bits, For the synchronization header sequence S, the first... n × l × k bits, This is an XOR operation; The synchronization header sequence S is processed into dual polarization, and the dual polarization synchronization header sequence is output. ,Right now: 。 6. The synchronization header design and receiving processing method according to claim 5, characterized in that, The received sequence includes a dual-polarization synchronization header sequence and a noise sequence. A local dual-polarization sequence is constructed based on the optimal base sequence, including: Receives a sequence of dual-polarization synchronization headers. Received sequence X of noise sequence N: In the formula, For the first received sequence X n × l × k One possible value; For the noise sequence N, the first... n × l × k One possible value; Constructing bipolar local sequences based on the optimal base sequence M : 。 7. The synchronization header design and receiving processing method according to claim 6, characterized in that, The process of performing coherent and incoherent processing on the received sequence based on the local sequence includes: Perform coherent processing on the received sequence based on the local sequence: In the formula, For receiving a local sequence with relative bipolarization of sequence X Offset is The coherent processing results For receiving sequence The i Each receive value; For transpose operation, This is for rounding up; For the first m Group of dual-polarization mask sequences The k 1 bit; For the first m Group mask sequence The k 1 bit; Incoherent processing of the received sequence based on the local sequence: In the formula, For receiving a local sequence with relative bipolarization of sequence X Offset is Incoherent processing results This is a modulo operation.

8. A synchronization header design and receiving / processing system, characterized in that, include: The optimal basis sequence generation module is configured to construct a length of l The base sequence is obtained by performing autocorrelation operation on the base sequence to obtain the autocorrelation result. The peak-to-peak ratio of the autocorrelation result is calculated and the base sequence with the maximum peak-to-peak ratio is obtained by iterative search, which is taken as the optimal base sequence. The synchronization header sequence generation module is configured to construct... n Group length is k The mask sequence, using the optimal base sequence as the basic unit and n The group mask sequence is XORed to obtain a sequence of length . n × k × l The synchronization header sequence is obtained and output as a dual-polarization synchronization header sequence through dual-polarization processing; The received sequence processing module is configured to receive a received sequence containing a dual-polarization synchronization header sequence and a noise sequence, construct a dual-polarization local sequence based on the optimal base sequence, perform coherent and incoherent processing on the received sequence according to the local sequence, and output the corresponding processing results.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the synchronization header design and receiving processing method according to any one of claims 1-7.

10. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it implements the synchronization header design and receiving processing method according to any one of claims 1-7.

Images