A frame synchronization capture method, device and storage medium based on waveform reduction synchronization header

Abstract

The present invention discloses a frame synchronization capture method, device, and storage medium based on waveform-reduced synchronization headers. The method includes obtaining a sampling symbol sequence, sampling a signal sequence processed by a receiving end using a sliding time window, wherein the sampling frame length of the sampling symbol sequence is the known synchronization header length; obtaining a reduced synchronization header correlation sequence, capturing the sampling symbol sequence using the known synchronization header reduced to multiple reduced synchronization headers of different symbol lengths to select a correlation value sequence; obtaining a quantized likelihood function value, calculating a quantized likelihood function value using the correlation value sequence and its corresponding reduced synchronization header sequence; comparing the quantized likelihood function value with a known threshold value of the reduced synchronization header; and determining whether frame synchronization is captured under the corresponding reduced synchronization header using the comparison conclusion. The frame synchronization capture method of the present invention improves the delay of synchronization header capture and reserves more processing response time for subsequent signal processing procedures.

Description

Technical Field

[0001] The present invention belongs to the technical field of digital signal processing, and in particular relates to a frame synchronization capture method, device and storage medium based on waveform reduction synchronization header. Background Art

[0002] Shortwave communications, with its robustness, flexibility, simple equipment, and low cost, have become a primary means of medium- and long-distance communication worldwide. However, due to the time-varying nature of the shortwave channel, transmission timing, time slot allocation, and channel delay remain unknown during real-time shortwave communications. To ensure real-time reception of bursty communication signals and maximize response time to subsequent interference, fast and highly accurate frame synchronization and symbol timing estimation are crucial, significantly impacting the performance of subsequent channel parameter estimation.

[0003] To primarily ensure communication reliability and accurate channel estimation, existing waveform synchronization technologies typically employ a longer synchronization header for synchronization capture, while also considering the design of interpolated probe sequences. However, using a longer synchronization header sequence can introduce drawbacks in practical engineering applications, including delays in waiting for the complete synchronization header sequence and increased computational complexity due to processing more sampling points during the synchronization header sequence. These drawbacks can affect the processing response speed of the receiving end, reducing the time available for processing the bits of information carried by the communication signal. Summary of the Invention

[0004] In order to solve the problems of large signal processing delay and difficulty in reserving more processing response time for subsequent signal processing processes in existing waveform frame synchronization capture methods, the present invention provides a frame synchronization capture method based on waveform reduction synchronization head that overcomes the above problems or at least partially solves the above problems.

[0005] According to one aspect of the present invention, the present invention provides a frame synchronization capture method based on waveform reduction synchronization header, characterized in that:

[0006] The frame synchronization capture method comprises the following steps:

[0007] Obtain a sampling symbol sequence, and perform sampling on the signal sequence processed by the receiving end using a sliding time window. The sampling frame length L of the sampling symbol sequence is the known synchronization header length; the period of the signal sequence processed by the receiving end is T s , the sampling period of the sampling symbol sequence is T;

[0008] Obtain the reduced synchronization header correlation sequence, and capture the sampled symbol sequence with the reduced synchronization headers of different symbol lengths using the known synchronization header to select the correlation value sequence; specifically: at a frame synchronization interval of T / (2TS ), under k=i·T(2T s ) and the reduced synchronization header sequence, where i is a non-negative integer;

[0009] Obtaining a quantized likelihood function value, and calculating the quantized likelihood function value using the correlation value sequence and its corresponding reduced synchronization header sequence;

[0010] Comparing the quantized likelihood function value with the known threshold value of the reduced synchronization header; and determining whether frame synchronization is captured in the case of the reduced synchronization header based on the comparison result;

[0011] The known threshold value of the reduced synchronization header is a known threshold value corresponding to each reduced symbol length obtained through random signal simulation calculation under the known synchronization header and multiple known reduced symbol lengths;

[0012] The judgment based on the comparison conclusion includes: if the likelihood function value after quantization is greater than the known threshold value of the reduced synchronization header, it is determined that frame synchronization is captured in the case corresponding to the reduced synchronization header; if the likelihood function value after quantization is not greater than the known threshold value of the reduced synchronization header, it is determined that frame synchronization is not captured in the case corresponding to the reduced synchronization header.

[0013] Furthermore, the known threshold value of the reduced synchronization header is a known threshold value corresponding to each reduced symbol length obtained through random signal simulation calculation under the known synchronization header and multiple known reduced symbol lengths.

[0014] Furthermore, the plurality of reduced synchronization headers with different symbol lengths are integer multiples of 32, and the length of the reduced synchronization header does not exceed the known synchronization header sequence length.

[0015] Furthermore, the calculation method of the correlation value sequence is:

[0016] r i (n) = y(kT S )·x(n),k=i·T / (2T s ),i=0,1,2,...

[0017] Where, when k=i·T / (2T s ) time (i is a non-negative integer, T is the symbol interval, T s is the sampling interval), y(kT s ) is the monitoring signal sampling sequence at the current moment, x(n) represents the reduced synchronization header sequence element in the known synchronization header sequence, 0≤n <n S L N , n S1 to N S Integer between, L=L N ·N S , where L is the complete synchronization header length, L N N is the length of each synchronization header after splitting. S To split a known complete synchronization header sequence into segments of equal length.

[0018] Furthermore, in the calculation of the correlation value sequence, when i>2(n S L N -1) to calculate the likelihood function value.

[0019] Further,

[0020] The calculation method of the likelihood function value is:

[0021]

[0022] Where * represents the conjugate operation, y is the correlation value sequence, x s is the corresponding shortened synchronization header sequence.

[0023] Furthermore, frequency offset correction is performed on the sampling symbol sequence y to obtain a corrected correlation value sequence.

[0024] Furthermore, when it is determined that the frame synchronization is captured, the starting position of the search interval for the next symbol timing synchronization is determined according to the determined frame synchronization position.

[0025] The present invention also discloses a computer device, comprising a memory and a processor, wherein the memory stores a computer program, and is characterized in that the processor implements the steps of the above method when executing the computer program.

[0026] The present invention also discloses a computer-readable storage medium on which a computer program is stored, characterized in that the computer program implements the steps of the above method when executed by a processor.

[0027] In general, the above technical solutions conceived by the present invention can achieve the following beneficial effects compared with the prior art:

[0028] Using a reduced synchronization header capture method for frame synchronization capture can significantly reduce the synchronization header capture time and calculation workload, leaving sufficient processing time for subsequent signal calculations to prevent signal frame loss.

[0029] In addition, the simulation threshold value is obtained by first performing synchronization header reduction, and a sliding time window is used to perform sampling in the signal sequence sampling, and the correlation value calculation is performed with multiple reduced synchronization headers to obtain the conclusion whether frame synchronization capture is obtained, effectively reducing the calculation length of frame synchronization capture and reducing the calculation time of the synchronization header. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 A schematic flow chart of a frame synchronization capture method based on waveform-reduced synchronization header according to an embodiment of the present invention;

[0031] Figure 2 The figure is a schematic diagram of the processing flow of the communication signal frame synchronization stage according to an embodiment of the present invention. DETAILED DESCRIPTION

[0032] In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely for the purpose of explaining the present invention and are not intended to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.

[0033] like Figure 1 FIG. 1 is a flow chart of a frame synchronization capture method based on waveform-reduced synchronization header provided by an embodiment of the present invention.

[0034] The frame synchronization capture method includes the following steps:

[0035] Obtain a sampling symbol sequence, and perform sampling on the signal sequence processed by the receiving end using a sliding time window. The sampling frame length L of the sampling symbol sequence is the known synchronization header length; the period of the signal sequence processed by the receiving end is T s , the sampling period of the sampling symbol sequence is T;

[0036] Obtain the reduced synchronization header correlation sequence, and use the known synchronization header to reduce the reduced synchronization headers to multiple different symbol lengths to capture the sampled symbol sequence at time to select the correlation value sequence; specifically: at a frame synchronization interval of T / (2T S ), under k=i·T / (2T s ) time and the reduced synchronization header sequence to perform conjugate single-point calculation, where i is a non-negative integer;

[0037] Obtaining a quantized likelihood function value, and calculating the quantized likelihood function value using a correlation value sequence and its corresponding reduced synchronization header sequence;

[0038] The quantized likelihood function value is compared with a known threshold value of the reduced synchronization header; and a comparison result is used to determine whether frame synchronization is captured under the corresponding reduced synchronization header.

[0039] Specifically, it includes:

[0040] S1, determining the reduced synchronization header length in advance based on the complete synchronization header sequence symbol length of the burst waveform, and determining the synchronization decision threshold under each symbol length through simulation according to the Newman-Pearson criterion;

[0041] Specifically, step S1 determines the reduced synchronization header length based on the symbol length of the complete synchronization header sequence of the burst waveform to be captured, and then determines the synchronization decision threshold for each symbol length through simulation based on the Newman-Pearson criterion. When determining the synchronization decision threshold, a method consistent with the synchronization method actually used during communication should be used to simulate and obtain synchronization thresholds corresponding to different false alarm probabilities.

[0042] The present invention proposes a frame synchronization capture method based on waveform-reduced synchronization header. First, the length of the search-reduced synchronization header sequence is determined according to the length of the known synchronization header sequence of the signal and the corresponding synchronization threshold is calculated. The frame synchronization position is determined by combining a sliding time window with a likelihood function analysis method. According to the frame synchronization position, the symbol synchronization search interval is determined for subsequent processing.

[0043] Based on the above embodiment, step S1 further includes:

[0044] S11, determine the length of the search-reduced synchronization header sequence according to the length of the known synchronization header sequence of the signal. For the waveform frame format synchronization header sequence x=[x0,x1,...x L-1 ]When the full length is L, split the synchronization header sequence into N equal length S Segments, each segment is L in length N =L / N S To facilitate code implementation and algorithm execution, and considering the synchronization header sequence length of most current waveform systems, the length of the synchronization header sequence can be reduced to an integer multiple of 32, and the length of the reduced synchronization header should not exceed the known synchronization header sequence length. This can be selected based on actual conditions.

[0045] For example, when the synchronization header sequence length of the waveform to be captured is 384 symbols, the reduced synchronization header sequence length may be sequentially determined to be 64, 128, 192, 256, 320 symbols, and the full synchronization header sequence length of 384 symbols.

[0046] S12, using a simulation method to determine the synchronization decision threshold λ corresponding to the reduced synchronization header sequence length THA band-limited Gaussian white noise signal is used as the receiver input signal. The bandwidth of the Gaussian white noise signal is equal to the burst signal bandwidth, and the effective values ​​of the noise signal and the burst signal are equal. The noise signal sample duration is typically 700,000 seconds (approximately 8 days). This duration can be increased if the communication system requires a higher false alarm probability.

[0047] S13, the input signal after passing through the matched filter is recorded as y(kT s ), using the sliding time window to y(kT s ) is sampled, where the starting time of the sliding time window increases sample by sample point, i.e., τ u =i u T s ,i u =0,1,2,....700000 / T s -1, sampling is performed every symbol time period T, and the sampling frame length is L x , using the sampling symbol sequence The likelihood function is calculated with the corresponding reduced synchronization header IQ sequence x, and the total amount is 700000 / T s The likelihood function value of .

[0048] Since the synchronization threshold λ TH The determination of is related to the synchronization sequence length, frame synchronization algorithm and false alarm probability. Therefore, the likelihood function calculation method consistent with the actual communication should be adopted in the simulation; the matched filter should use the order and filter coefficient consistent with the actual processing flow of the communication signal.

[0049] S14, perform statistics on the likelihood function value and obtain the false alarm probability P fa =10 -7 ,10 -8 ,10 -9 The corresponding λ TH value and select it according to actual communication requirements.

[0050] The 8PSK sequences with lengths of 32, 64, 96, 128, 160, 192, 224, 256, 384, 576, 640, and 1280 are obtained using the above method. fa =10 -7 ,10 -8 ,10 -9 The synchronization thresholds are shown in Table 1 below.

[0051] Table 1 Synchronization threshold values ​​obtained by simulation under multiple synchronization header lengths

[0052] Synchronization header length <![CDATA[10 -7 ]]> <![CDATA[10 -8 ]]> <![CDATA[10 -9 ]]> 32 0.69531 0.72221 0.73603 64 0.53476 0.56231 0.5909 96 0.44784 0.46705 0.4952 128 0.39502 0.41284 0.42412 160 0.35785 0.37444 0.38709 192 0.33114 0.34706 0.36689 224 0.30886 0.33657 0.35492 256 0.2893 0.30734 0.32611 384 0.22966 0.24052 0.2536 576 0.19017 0.20178 0.21051 640 0.18112 0.19196 0.19839 1280 0.1299 0.13728 0.14432

[0053] Step S2 performs frame synchronization estimation based on the preprocessed IQ complex signal, collects a sampling symbol sequence using a sliding time window, uses the sampling symbol sequence and the local synchronization header sequence to roughly estimate the carrier offset and remove the influence of frequency offset, constructs a likelihood function based on the sequence and the known synchronization header sequence, and calculates the likelihood function value. When the likelihood function value is greater than the synchronization threshold, it is considered that frame synchronization is captured.

[0054] Among them, removing the frequency offset influence is a preferred embodiment of the present invention, which can improve the calculation accuracy of the likelihood function value.

[0055] Based on the above embodiment, the step S2 further includes: the implementation block diagram of the frame synchronization capture method based on burst waveform reduction synchronization header is as follows: Figure 2 shown.

[0056] S21, it is known that the symbol interval of the communication system is T and the sampling interval is T s , the signal sequence processed by the receiving end is y(kT S )=[y0,y1,...y L-1 ], where k is a non-negative integer. s ) sampling, i.e. taking τ u =i u T s is the starting moment, sampling is performed every symbol time period T, and the sampling frame length is L (L is equal to the burst waveform synchronization header length calculated in step 1), then the sampling symbol sequence can be expressed as

[0057]

[0058] S22, assuming that the frame synchronization calculation interval is T / (2T S ), shorten the synchronization header x to length n S L N Multiple reduced sync headers x of different reduced lengths for each symbol s To capture, n S 1 to N S According to the above step S1, the synchronization threshold of the corresponding reduced synchronization header sequence under the corresponding length can be determined as λ THs .

[0059] Then whenever k=i·T / (2T s ) moment, the monitoring signal sampling sequence y(kT S ) and the local synchronization header sequence x, where i is a non-negative integer, we can get

[0060] r i (n) = y(kT S )·x(n), k=i·T / (2Ts ), i=0,1,2,... (2)

[0061] Where x(n) represents the element in the sequence x, 0≤n <n S L N ; r i (n) is regarded as the element with n rows and i columns in the correlation value matrix R. This is equivalent to obtaining the single-point conjugate correlation calculation result under the corresponding reduced synchronization header length at each corresponding sampling moment.

[0062] When i>2(n S L N -1), there is enough data in R to be used to reduce the synchronization header x s The correlation value of is estimated. Take the corresponding correlation sequence r from the matrix R i , where the elements are

[0063]

[0064] The sequence r i That is, the signal sequence sampled at the current moment and the reduced synchronization header x s The result of point-wise conjugate multiplication, where there are n S L N elements.

[0065] S23, using the sampling symbol sequence The carrier offset f is the local synchronization header sequence s Perform a rough estimation (i.e., the process of coarse carrier synchronization) using the sequence r i Estimate the carrier frequency offset and i Conduct n S L N ≤N-point DFT transformation (since the number of DFT points N is usually a power of 2, when the number of points is insufficient, r i Fill with zeros), the result can be expressed as

[0066]

[0067] S24, according to R[n S L N ] can determine the peak spectral line position as f m , which is the result of this frequency offset estimation. According to the f obtained by frequency offset estimation m For the related sequence r i Remove frequency deviation and obtain the sequence after frequency deviation correction It can be expressed as

[0068]

[0069] S25, according to the sequence The relationship between the received signal and the known synchronization header sequence can be used to obtain the normalized correlation value corresponding to the current moment as the likelihood function value, which is the value of the received signal and x s Correlation value ratio of signal to x s The value of the square root product of the energy,

[0070]

[0071] Where * represents the conjugate operation, It is noted that the local reduced synchronization header sequence x s The modulus of each element in is a constant value a x , then

[0072]

[0073] S26, when the calculated normalized correlation value Greater than the current reduced synchronization header x s The corresponding threshold λ THs When the frame synchronization is captured, the current i value is the frame synchronization position, and the corresponding k=i·T / (2T s ) can be used as the reference position for symbol timing synchronization in the next step. According to the embodiments of the present invention, the normalized calculation method is a numerical quantization calculation method. Normalization is one of the specific implementation methods. Furthermore, selecting the comparison result as greater than is also a relative comparison result. In the comparison calculation, selecting a relatively large number as the threshold for determining less than is also one of the specific implementation methods.

[0074] Step S3 first uses a multi-filter group to estimate the search interval for further fine synchronization, and then uses an iterative interpolation search method based on the likelihood function value to perform an iterative search within the search interval to increase the search speed. At the same time, Gaussian interpolation is used in the iterative process to obtain accurate estimation results, thereby capturing the waveform synchronization position.

[0075] Based on the above embodiment, step S3 further includes:

[0076] S31, determine the starting position of the search interval for the next symbol timing synchronization based on the frame synchronization position determined in S2. Since the frame synchronization calculation interval is T / (2T S ), that is, the resolution of frame synchronization is the frame synchronization calculation interval T / (2T S ), so the starting sampling point position of the symbol timing synchronization search interval can be determined to be iT / (2T S ).

[0077] S32, based on the frame synchronization position determined in S2 and the specific communication requirements, the overall length of the search interval is determined to obtain the end position of the search interval for the next symbol timing synchronization. The communication requirements involved include channel conditions and processing speed requirements. Among them, the communication channel conditions determine the minimum value of the overall length of the search interval, and the maximum multipath delay D of the communication service channel is determined. max After clarifying, it can be determined that the length of the search interval is greater than [D max / T]·T / T s sampling points, where [] indicates rounding up; the processing speed requirement determines the maximum value of the overall length of the search interval, which usually does not exceed 16 symbols.

[0078] Table 2 is a comparison diagram of the delay generated by the frame synchronization capture method based on waveform-reduced synchronization header and the delay generated by the full synchronization header synchronization capture method according to an embodiment of the present invention.

[0079] Table 2 Comparison of results under reduced and unreduced synchronous capture modes

[0080] Synchronization header length Capture delay / ms Save response time / ms 32 13.33333 146.6667 64 26.66667 133.3333 96 40 120 128 53.33333 106.6667 160 66.66667 93.33333 192 80 80 224 93.33333 66.66667 256 106.6667 53.33333 288 120 40 320 133.3333 26.66667 352 146.6667 13.33333 384 160 0

[0081] Note: This example uses a symbol rate of 2400 Baud and a full synchronization header length of 384.

[0082] The present invention also provides a storage medium storing a computer program executable by a processor, which, when executed on the processor, causes the processor to perform any of the steps of the above-mentioned general product traceability method. The computer-readable storage medium may include, but is not limited to, any type of disk, including a floppy disk, an optical disk, a DVD, a CD-ROM, a microdrive, a magneto-optical disk, a ROM, a RAM, an EPROM, an EEPROM, a DRAM, a VRAM, a flash memory device, a magnetic card or an optical card, a nanosystem (including a molecular memory IC), or any type of medium or device suitable for storing instructions and / or data.

[0083] It should be noted that for the aforementioned method embodiments, for simplicity of description, they are all expressed as a series of action combinations. However, those skilled in the art should be aware that the present invention is not limited by the order of the actions described, because according to the present invention, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in this specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the present invention.

[0084] In the above embodiments, the description of each embodiment has its own focus. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0085] In the several embodiments provided herein, it should be understood that the disclosed system can be implemented in other ways. For example, the system embodiments described above are merely illustrative. For example, the module division is merely a logical functional division. In actual implementation, other division methods may be used. For example, multiple modules or components may be combined or integrated into another system, or some features may be ignored or not implemented. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be through some service interface, and the indirect coupling or communication connection of the system or module may be electrical or other forms.

[0086] The modules described as separate components may or may not be physically separate, and the components shown as modules may or may not be physical modules, that is, they may be located in one place or distributed across multiple network modules. Some or all of the modules may be selected to achieve the purpose of the present embodiment according to actual needs.

[0087] In addition, the functional modules in various embodiments of the present invention may be integrated into a single processing module, or each module may exist physically separately, or two or more modules may be integrated into a single module. The aforementioned integrated modules may be implemented in the form of hardware or software functional modules.

[0088] If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of the present invention, 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. The computer software product is stored in a memory and includes several instructions for enabling a computer device (which can be a personal computer, server or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present invention. The aforementioned memory includes: various media that can store program codes, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk.

[0089] The contents described in this specification are merely examples of the present invention. Those skilled in the art may make various modifications or additions to the specific embodiments described or replace them in a similar manner. As long as they do not deviate from the contents of the specification of the present invention or exceed the scope defined by the claims, they shall fall within the scope of protection of the present invention.

Claims

1. A frame synchronization capture method based on waveform reduction synchronization header, characterized in that: The frame synchronization capture method comprises the following steps: Obtain a sampling symbol sequence, and perform sampling on the signal sequence processed by the receiving end using a sliding time window. The sampling frame length L of the sampling symbol sequence is the known synchronization header length; the period of the signal sequence processed by the receiving end is T s , the sampling period of the sampling symbol sequence is T; Obtain the reduced synchronization header correlation sequence, and capture the sampled symbol sequence with the reduced synchronization headers of different symbol lengths using the known synchronization header to select the correlation value sequence; specifically: at a frame synchronization interval of T / (2T s ), under k=i·T / (2T s ) and the reduced synchronization header sequence, where i is a non-negative integer; Obtaining a quantized likelihood function value, and calculating the quantized likelihood function value using the correlation value sequence and its corresponding reduced synchronization header sequence; Comparing the quantized likelihood function value with a known threshold value of the reduced synchronization header to determine whether frame synchronization is captured in a case corresponding to the reduced synchronization header; The known threshold value of the reduced synchronization header is a known threshold value corresponding to each reduced symbol length obtained through random signal simulation calculation under the known synchronization header and multiple known reduced symbol lengths; The determination based on the comparison conclusion includes: if the quantized likelihood function value is greater than a known threshold value of the reduced synchronization header, determining that frame synchronization is captured in the case of the reduced synchronization header; If the quantized likelihood function value is not greater than the known threshold value of the reduced synchronization header, it is determined that frame synchronization is not captured in the case corresponding to the reduced synchronization header.

2. The frame synchronization capture method based on waveform reduction synchronization header according to claim 1, characterized in that: The multiple reduced synchronization headers with different symbol lengths are integer multiples of 32, and the length of the reduced synchronization header does not exceed the known synchronization header sequence length.

3. The frame synchronization capture method based on waveform reduction synchronization header according to claim 1, characterized in that: The calculation method of the correlation value sequence is: r i (n)=y(kT S )·x(n),k=i·T / (2T s ),i=0,1,2,... Where, when k=i·T / (2T s ) moment, i is a non-negative integer, T is the symbol interval, T s is the sampling interval, y(kT s ) is the monitoring signal sampling sequence at the current moment, x(n) represents the reduced synchronization header sequence element in the known synchronization header sequence, 0≤n <n S L N , n S 1 to N S Integer between, L=L N ·N S , where L is the complete synchronization header length, L N N is the length of each synchronization header after splitting. S To split a known complete synchronization header sequence into segments of equal length.

4. The frame synchronization capture method based on waveform reduction synchronization header according to claim 3, characterized in that: In the calculation of the correlation value sequence, when i>2(n S L N -1) to calculate the likelihood function value.

5. The frame synchronization capture method based on waveform reduction synchronization header according to claim 4, characterized in that: The calculation method of the likelihood function value is: Where * represents the conjugate operation, y is the correlation value sequence, x s is the corresponding shortened synchronization header sequence.

6. The frame synchronization capture method based on waveform reduction synchronization header according to claim 5, characterized in that: Frequency offset correction is performed on the sampling symbol sequence y to obtain a corrected correlation value sequence.

7. The frame synchronization capture method based on waveform reduction synchronization header according to claim 1, characterized in that: When it is determined that the frame synchronization is captured, the starting position of the search interval for the next symbol timing synchronization is determined according to the determined frame synchronization position.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images