Frame timing synchronization method, device and electronic device for wireless communication

Abstract

The embodiment of the present application provides a frame timing synchronization method, device, electronic device and storage medium for wireless communication, wherein the method comprises: obtaining a local frame synchronization header sequence; obtaining air interface data; performing sliding window cross-correlation processing on the local frame synchronization header sequence and air interface data to obtain a metric function; performing a threshold determination on the metric function to obtain an index value set; performing a maximum value determination on the index value set to obtain a frame synchronization position. The implementation of the embodiment of the present application improves the frame synchronization performance, makes the obtained frame synchronization position more accurate, and simplifies the calculation process.

Description

Technical Field

[0001] The present application relates to the field of wireless communication technology, and in particular to a frame timing synchronization method, device, and electronic device for wireless communication. Background Art

[0002] In the existing wireless communication timing synchronization technology, a known digital communication sequence pre-defined by the receiving end and the sending end can be used as a communication synchronization unit. The communication receiving end uses the local known sequence and the received signal to perform time domain correlation operations, and uses the operation result as a measurement function to obtain the synchronization position index value through threshold judgment, thereby achieving frame timing synchronization.

[0003] However, in a complex wireless communication channel environment, the correlation operation result will decrease as the signal-to-noise ratio decreases, and in the case of a multipath fading channel, the correlation operation result will have multiple adjacent interference peaks. In this case, the selection of the threshold and the metric function has a great influence on the accuracy of timing synchronization.

[0004] The correlation operation is complex and requires large hardware resources to implement. In the case of low signal-to-noise ratio and wireless fading channel, the correlation operation peak will be greatly affected. When the peak is determined by the preset threshold, there will be a high probability of missed detection and false alarm, and the synchronization performance will be reduced. Summary of the invention

[0005] The purpose of the embodiments of the present application is to provide a frame timing synchronization method, device, and electronic device for wireless communication, which improves the frame synchronization performance, makes the obtained frame synchronization position more accurate, and simplifies the calculation process.

[0006] In a first aspect, an embodiment of the present application provides a frame timing synchronization method for wireless communication, the method comprising:

[0007] Get the local frame synchronization header sequence;

[0008] Get air interface data;

[0009] Performing sliding window cross-correlation processing on the local frame synchronization header sequence and the air interface data to obtain a metric function;

[0010] Performing threshold determination on the metric function to obtain an index value set;

[0011] A maximum value decision is performed on the index value set to obtain a frame synchronization position.

[0012] In the above implementation process, the frame synchronization position is obtained by performing sliding window cross-correlation processing on the local frame synchronization header sequence and the air interface data, and then performing threshold judgment on the metric function, thereby improving the frame synchronization performance, making the obtained frame synchronization position more accurate, and simplifying the calculation process.

[0013] Furthermore, the step of obtaining a local frame synchronization header sequence includes:

[0014] Get a first length sequence;

[0015] Performing a zero padding operation on the first length sequence to obtain a second length sequence;

[0016] Perform an inverse discrete Fourier transform on the second length sequence to obtain the local frame synchronization header sequence.

[0017] In the above implementation process, the second length sequence is obtained according to the first length sequence, and the second length sequence is subjected to inverse discrete Fourier transform to obtain a local frame synchronization header sequence, which can reduce the error in the calculation process and make the obtained local frame synchronization header sequence more accurate.

[0018] Furthermore, the step of performing threshold determination on the metric function to obtain an index value set includes:

[0019] Performing a fixed threshold decision on the metric function to obtain a metric function after the fixed threshold decision;

[0020] Performing dynamic threshold determination on the metric function to obtain a metric function after dynamic threshold determination;

[0021] The index value set is obtained according to the metric function after the fixed threshold value decision and the metric function after the dynamic threshold value decision.

[0022] In the above implementation process, the threshold value judgment is performed on the metric function, which can reduce the influence of noise on the frame synchronization performance, improve the accuracy of the index in the frame synchronization process, and effectively reduce the influence of the multipath channel on the frame synchronization performance.

[0023] Furthermore, the step of performing a fixed threshold decision on the metric function to obtain the metric function after the fixed threshold decision includes:

[0024] Get the fixed threshold value;

[0025] A fixed threshold decision is performed on the metric function according to the fixed threshold value to obtain the metric function after the fixed threshold decision.

[0026] In the above implementation process, the fixed threshold value judgment is performed on the metric function according to the fixed threshold value, so that the error of the metric function to the frame synchronization can be reduced, and the obtained frame synchronization position can be more accurate.

[0027] Furthermore, the step of performing dynamic threshold determination on the metric function to obtain the metric function after the dynamic threshold determination comprises:

[0028] Get dynamic threshold value;

[0029] Performing a dynamic threshold decision on the metric function according to the dynamic threshold, to obtain the metric function after the dynamic threshold decision.

[0030] In the above implementation process, the dynamic threshold value judgment is performed on the metric function according to the dynamic threshold value, which can reduce the influence of noise on frame synchronization and ensure the accuracy of the frame synchronization position.

[0031] Furthermore, the step of performing maximum value determination on the index value set to obtain a frame synchronization position includes:

[0032] Obtaining a metric function value in the index value set;

[0033] An index value corresponding to the maximum metric function value among the metric function values ​​is selected as the frame synchronization position.

[0034] In the above implementation process, the index value corresponding to the maximum metric function value in the metric function values ​​is used as the frame synchronization position, which can reduce the error of the frame synchronization position, simplify the calculation process, and save time.

[0035] Further, the local frame synchronization header sequence and the air interface data are subjected to sliding window cross-correlation processing by the following formula to obtain the metric function:

[0036]

[0037]

[0038]

[0039]

[0040] Wherein, D(k) is the metric function, R(k) is the result of sliding window cross-correlation operation, P 1 is the power sum of the local frame synchronization header sequence, P 2(k) is the power sum of the air interface data, x(n) is the local frame synchronization header sequence, r(n) is the air interface data, N is the window length, i is the sample number corresponding to the window length, and k is the starting point position corresponding to the window each time the window is slid.

[0041] Furthermore, the dynamic threshold value is obtained by the following formula:

[0042]

[0043] Wherein, λ(k) is the dynamic threshold, μ is the dynamic threshold coefficient, i is the sample number corresponding to the window length, k is the starting point position of the window corresponding to each sliding window, M is the cumulative length of the metric function, and D(k) is the metric function (k is assigned ).

[0044] In a second aspect, an embodiment of the present application further provides a frame timing synchronization device for wireless communication, the device comprising:

[0045] An acquisition module is used to acquire a local frame synchronization header sequence; and is also used to acquire air interface data;

[0046] A sliding window cross-correlation module, used for performing sliding window cross-correlation processing on the local frame synchronization header sequence and air interface data to obtain a metric function;

[0047] A decision module, used for performing a threshold decision on the metric function to obtain an index value set;

[0048] The selection module is used to perform maximum value judgment on the index value set to obtain a frame synchronization position.

[0049] In the above implementation process, the frame synchronization position is obtained by performing sliding window cross-correlation processing on the local frame synchronization header sequence and the air interface data, and then performing threshold judgment on the metric function, thereby improving the frame synchronization performance, making the obtained frame synchronization position more accurate, and simplifying the calculation process.

[0050] In a third aspect, an embodiment of the present application provides an electronic device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method described in any one of the first aspects when executing the computer program.

[0051] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which instructions are stored. When the instructions are executed on a computer, the computer executes the method as described in any one of the first aspects.

[0052] In a fifth aspect, an embodiment of the present application provides a computer program product, which, when running on a computer, enables the computer to execute the method as described in any one of the first aspects.

[0053] Other features and advantages of the present disclosure will be set forth in the following description, or some features and advantages may be inferred or unambiguously determined from the description, or may be learned by implementing the above-mentioned technology of the present disclosure.

[0054] And it can be implemented according to the contents of the specification. The following is a detailed description of the preferred embodiments of the present application with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0055] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments of the present application will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0056] Figure 1 A flowchart of a frame timing synchronization method for wireless communication provided in an embodiment of the present application;

[0057] Figure 2 A schematic diagram of the structure of a frame timing synchronization device for wireless communication provided in an embodiment of the present application;

[0058] Figure 3 A schematic diagram of the structural composition of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0059] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0060] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings. At the same time, in the description of this application, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.

[0061] The specific implementation methods of the present application are further described in detail below in conjunction with the accompanying drawings and examples. The following examples are used to illustrate the present application but are not intended to limit the scope of the present application.

[0062] Embodiment 1

[0063] Figure 1 is a flow chart of a frame timing synchronization method for wireless communication provided in an embodiment of the present application, such as Figure 1 As shown, the method includes:

[0064] S1, obtain the local frame synchronization header sequence;

[0065] S2, obtain air interface data;

[0066] S3, performing sliding window cross-correlation processing on the local frame synchronization header sequence and the air interface data to obtain a metric function;

[0067] S4, performing threshold determination on the metric function to obtain an index value set;

[0068] S5, performing maximum value determination on the index value set to obtain a frame synchronization position.

[0069] In the above implementation process, the frame synchronization position is obtained by performing sliding window cross-correlation processing on the local frame synchronization header sequence and the air interface data, and then performing threshold judgment on the metric function, thereby improving the frame synchronization performance, making the obtained frame synchronization position more accurate, and simplifying the calculation process.

[0070] Furthermore, S1 includes:

[0071] Get a first length sequence;

[0072] Performing a zero padding operation on the first length sequence to obtain a second length sequence;

[0073] Perform an inverse discrete Fourier transform on the second length sequence to obtain a local frame synchronization header sequence.

[0074] In the above implementation process, the second length sequence is obtained according to the first length sequence, and the second length sequence is subjected to inverse discrete Fourier transform to obtain a local frame synchronization header sequence, which can reduce the error in the calculation process and make the obtained local frame synchronization header sequence more accurate.

[0075] Exemplarily, a first length sequence d(n) of length 62 may be generated by the following formula, which has a power banner characteristic and good autocorrelation and cross-correlation characteristics, wherein:

[0076]

[0077] Pad the first length sequence d(n) with zeros on both sides to generate a second length sequence z(n), which is defined as [0,....0,d(0),,,,,d(61),0,...0], with 33 zero values ​​padded on both sides. The length of the sequence z(n) is 128.

[0078] Perform an inverse discrete Fourier transform on the sequence z(n) to generate a local frame synchronization header sequence x(n) with a length of 128.

[0079] Further, in S3, sliding window cross-correlation processing is performed on the local frame synchronization header sequence and the air interface data by the following formula to obtain a metric function:

[0080]

[0081]

[0082]

[0083]

[0084] Among them, D(k) is the metric function, R(k) is the result of sliding window cross-correlation operation, P 1 is the power sum of the local frame synchronization header sequence, P 2 (k) is the power sum of air interface data, x(n) is the local frame synchronization header sequence, r(n) is the air interface data, N is the window length, i is the sample number corresponding to the window length, and k is the starting point position of the window corresponding to each sliding window.

[0085] Sliding window cross-correlation is to correlate the samples received at the current moment with those received and stored before that moment. Exemplarily, the local frame synchronization header sequence and air interface data are correlated, and the result is R(0), where the local frame synchronization header sequence is a sequence x(n) consisting of 127 samples, and the air interface data is a sequence r(n) consisting of 128 samples. The operation length 128 is defined as the sliding window length. The samples received at the next moment are correlated with the sequence x(n) consisting of 127 samples and the sequence r(n) consisting of 128 samples received and stored before that moment, and the result is R(1). The operations are performed in sequence, and this process is called sliding window cross-correlation operation. The essence of sliding window cross-correlation operation is to use the air interface data r(n) to search for a segment of data in the local frame synchronization header sequence that is most similar to r(n). When the similarity is the strongest, the R(k) value is the largest.

[0086] Exemplarily, when the window length is 128, that is, the length of the local frame synchronization header sequence, the sliding window is to form r(n) and x(n) with each received sample and the 127 samples received previously for cross-correlation operation, and the expression is as follows:

[0087]

[0088] Generate the following metric function:

[0089]

[0090] Where P 1 and P 2 (k) are defined as follows:

[0091]

[0092]

[0093] Furthermore, S4 includes:

[0094] Performing a fixed threshold decision on the metric function to obtain a metric function after the fixed threshold decision;

[0095] Performing dynamic threshold determination on the metric function to obtain the metric function after the dynamic threshold determination;

[0096] The index value set is obtained according to the metric function after the fixed threshold value decision and the metric function after the dynamic threshold value decision.

[0097] In the above implementation process, the threshold value judgment is performed on the metric function, which can reduce the influence of noise on the frame synchronization performance, improve the accuracy of the index in the frame synchronization process, and effectively reduce the influence of the multipath channel on the frame synchronization performance.

[0098] A fixed threshold judgment is performed on the metric function D(k), and the value of k when the value of D(k) is greater than the fixed threshold is recorded. The fixed threshold of the embodiment of the present application is obtained through simulation. During simulation, the fixed threshold actually changes dynamically with the signal-to-noise ratio. According to the actual simulation, the fixed threshold when the signal-to-noise ratio is -5dB is taken as the fixed threshold δ of the metric function D(k), and the value is 0.058.

[0099] Furthermore, the step of performing a fixed threshold decision on the metric function to obtain the metric function after the fixed threshold decision includes:

[0100] Get the fixed threshold value;

[0101] A fixed threshold decision is performed on the metric function according to the fixed threshold value to obtain the metric function after the fixed threshold decision.

[0102] In the above implementation process, the fixed threshold value judgment is performed on the metric function according to the fixed threshold value, so that the error of the metric function to the frame synchronization can be reduced, and the obtained frame synchronization position can be more accurate.

[0103] The purpose of thresholding the metric function R(k) is to find the R(k) with the strongest correlation and determine the possible valid synchronization position. R(k) less than the fixed threshold is considered invalid, and R(k) greater than the fixed threshold is judged using the dynamic threshold.

[0104] Furthermore, the step of performing dynamic threshold determination on the metric function to obtain the metric function after the dynamic threshold determination includes:

[0105] Get dynamic threshold value;

[0106] A dynamic threshold value decision is performed on the metric function according to the dynamic threshold value to obtain the metric function after the dynamic threshold value decision.

[0107] In the above implementation process, the dynamic threshold value judgment is performed on the metric function according to the dynamic threshold value, which can reduce the influence of noise on frame synchronization and ensure the accuracy of the frame synchronization position.

[0108] Furthermore, the dynamic threshold value is obtained by the following formula:

[0109]

[0110] Among them, λ(k) is the dynamic threshold, μ is the dynamic threshold coefficient, i is the sample number corresponding to the window length, k is the starting point position of the window corresponding to each sliding window, M is the cumulative length of the metric function, and D(k) is the metric function (k is assigned ).

[0111] Due to the influence of random noise in the transmission channel, the sliding window cross-correlation operation result R(k) at the receiving end fluctuates, that is, weak correlation may be enhanced and strong correlation may be weakened. Therefore, a dynamic threshold is used to judge R(k). In order to reduce the influence of noise, values ​​less than the dynamic threshold are considered invalid, and values ​​greater than the fixed threshold are considered to be the corresponding k value as a possible valid synchronization position.

[0112] Exemplarily, when making a dynamic threshold decision on the metric function D(k), record the k value when the value of D(k) is greater than the dynamic threshold. The dynamic threshold λ(k) corresponding to the index k value is obtained by taking the average of the first 18 sample values ​​of the current D(k), the current value of D(k) and the last 19 sample values ​​of the current D(k), where the μ value determines the false alarm probability and missed detection probability during the dynamic threshold decision. A larger μ value leads to a greater false alarm probability and a smaller missed detection probability. Conversely, a smaller false alarm probability and a greater missed detection probability. The μ value of the embodiment of the present application is obtained through modeling and simulation. As the dynamic threshold λ of the metric function D(k), it is necessary to ensure that the packet error rate is controlled within 1% when the signal-to-noise ratio is greater than -5dB, and the μ value is 5.5. Thus, it is obtained:

[0113]

[0114] Furthermore, the step of performing maximum value determination on the index value set to obtain the frame synchronization position includes:

[0115] Get the metric function value in the index value set;

[0116] An index value corresponding to the maximum metric function value among the metric function values ​​is selected as the frame synchronization position.

[0117] In the above implementation process, the index value corresponding to the maximum metric function value in the metric function values ​​is used as the frame synchronization position, which can reduce the error of the frame synchronization position, simplify the calculation process, and save time.

[0118] The index value k of the metric function D(k) when it is greater than both the solid-state threshold δ and the dynamic threshold λ is denoted as k i , set the adjacent decision interval β to 256, when the adjacent index value k i When the difference does not exceed β, the adjacent index value k i Defined as a new set G, defined as [k i ,k i+1 ,.....,k i+m ], the set G must satisfy the following conditions:

[0119] k i+m -k i <=β

[0120] k i+m+1 -k i >β;

[0121] Compare the D(k) values ​​corresponding to the index values ​​in the set G, the set [D(k i ),D(k i+1 ),....,D(k i+m )] is the frame synchronization position, which is recorded as:

[0122] k s ∈max([D(k i ),D(k i+1 ),....,D(k i+m )])| k

[0123] The embodiment of the present application utilizes a double threshold judgment method to realize frame synchronization by performing threshold judgment on the metric function, wherein the role of the fixed threshold is that when the calculation result of the metric function is less than the fixed threshold, the index value corresponding to the metric function is not used as the synchronization judgment index value, and the fixed threshold is obtained by simulation under the condition that the signal-to-noise ratio is above -5dB and the packet error rate is below 1%. The dynamic threshold is obtained by multiplying the mean of the first 18 sample values, the current sample value and the last 19 sample values ​​of the metric function by the weight coefficient, and then the dynamic threshold is used to judge the metric function greater than the fixed threshold again, and finally the neighboring judgment method is used to compare the neighboring metric function values ​​greater than the fixed threshold and the dynamic threshold, and the index value corresponding to the maximum value of this function value is the frame synchronization position. The embodiment of the present application reduces the high false alarm probability caused by the fixed threshold judgment alone, reduces the influence of noise on the frame synchronization performance, and improves the synchronization index accuracy. At the same time, the neighboring judgment method can effectively reduce the influence of the multipath channel on the synchronization performance. The method of the invention can realize frame synchronization above -5dB, and the packet error rate is below 1%, the calculation complexity is not high, and the hardware is easy to realize.

[0124] Embodiment 2

[0125] In order to execute the method corresponding to the above embodiment 1 to achieve the corresponding functions and technical effects, a frame timing synchronization device for wireless communication is provided below, such as Figure 2 As shown, the device comprises:

[0126] Acquisition module 1, used to acquire a local frame synchronization header sequence; and also used to acquire air interface data;

[0127] A sliding window cross-correlation module 2 is used to perform sliding window cross-correlation processing according to the local frame synchronization header sequence and the air interface data to obtain a metric function;

[0128] The decision module 3 is used to make a threshold decision on the metric function to obtain an index value set;

[0129] The selection module 4 is used to perform maximum value judgment on the index value set to obtain the frame synchronization position.

[0130] In the above implementation process, the frame synchronization position is obtained by performing sliding window cross-correlation processing on the local frame synchronization header sequence and the air interface data, and then performing threshold judgment on the metric function, thereby improving the frame synchronization performance, making the obtained frame synchronization position more accurate, and simplifying the calculation process.

[0131] Furthermore, the acquisition module 1 is also used for:

[0132] Get a first length sequence;

[0133] Performing a zero padding operation on the first length sequence to obtain a second length sequence;

[0134] Perform an inverse discrete Fourier transform on the second length sequence to obtain a local frame synchronization header sequence.

[0135] Furthermore, the decision module 3 is also used for:

[0136] Performing a fixed threshold decision on the metric function to obtain a metric function after the fixed threshold decision;

[0137] Performing dynamic threshold determination on the metric function to obtain the metric function after the dynamic threshold determination;

[0138] The index value set is obtained according to the metric function after the fixed threshold value decision and the metric function after the dynamic threshold value decision.

[0139] Furthermore, the decision module 3 is also used for:

[0140] Get the fixed threshold value;

[0141] A fixed threshold decision is performed on the metric function according to the fixed threshold value to obtain the metric function after the fixed threshold decision.

[0142] Furthermore, the decision module 3 is also used for:

[0143] Get dynamic threshold value;

[0144] A dynamic threshold value decision is performed on the metric function according to the dynamic threshold value to obtain the metric function after the dynamic threshold value decision.

[0145] Furthermore, the selection module 4 is also used for:

[0146] Get the metric function value in the index value set;

[0147] An index value corresponding to the maximum metric function value among the metric function values ​​is selected as the frame synchronization position.

[0148] Furthermore, the decision module 3 is further used to perform sliding window cross-correlation processing on the local frame synchronization header sequence and the air interface data by using the following formula to obtain a metric function:

[0149]

[0150]

[0151]

[0152]

[0153] Among them, D(k) is the metric function, R(k) is the result of sliding window cross-correlation operation, P 1 is the power sum of the local frame synchronization header sequence, P 2 (k) is the power sum of air interface data, x(n) is the local frame synchronization header sequence, r(n) is the air interface data, N is the window length, i is the sample number corresponding to the window length, and k is the starting point position of the window corresponding to each sliding window.

[0154] Furthermore, the decision module 3 is also used to obtain the dynamic threshold value through the following formula:

[0155]

[0156] Among them, λ(k) is the dynamic threshold, μ is the dynamic threshold coefficient, i is the sample number corresponding to the window length, k is the starting point position of the window corresponding to each sliding window, M is the cumulative length of the metric function, and D(k) is the metric function (k is assigned ).

[0157] The frame timing synchronization device for wireless communication described above can implement the method of the above embodiment 1. The options in the above embodiment 1 are also applicable to this embodiment and will not be described in detail here.

[0158] The rest of the contents of the embodiments of the present application can refer to the contents of the above-mentioned embodiment 1, and will not be repeated in this embodiment.

[0159] Embodiment 3

[0160] An embodiment of the present application provides an electronic device, including a memory and a processor, wherein the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to execute the frame timing synchronization method for wireless communication of embodiment 1.

[0161] Optionally, the above-mentioned electronic device may be a server.

[0162] See also Figure 3 , Figure 3 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. The electronic device may include a processor 31, a communication interface 32, a memory 33 and at least one communication bus 34. The communication bus 34 is used to realize direct connection and communication between these components. The communication interface 32 of the device in the embodiment of the present application is used to communicate signaling or data with other node devices. The processor 31 may be an integrated circuit chip with signal processing capabilities.

[0163] The processor 31 can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor 31 can also be any conventional processor, etc.

[0164] The memory 33 may be, but is not limited to, a random access memory (RAM), a read only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable read-only memory (EEPROM), etc. The memory 33 stores computer-readable instructions. When the computer-readable instructions are executed by the processor 31, the device can execute the above-mentioned Figure 1 The method embodiment involves various steps.

[0165] Optionally, the electronic device may further include a storage controller and an input / output unit. The memory 33, the storage controller, the processor 31, the peripheral interface, and the input / output unit are electrically connected to each other directly or indirectly to achieve data transmission or interaction. For example, these components may be electrically connected to each other via one or more communication buses 34. The processor 31 is used to execute executable modules stored in the memory 33, such as software function modules or computer programs included in the device.

[0166] The input and output unit is used to provide users with the task creation and to create an optional time period or preset execution time for the task to enable interaction between the user and the server. The input and output unit can be, but is not limited to, a mouse and a keyboard.

[0167] Understandably, Figure 3 The structure shown is for illustration only. The electronic device may also include Figure 3 More or fewer components as shown, or with Figure 3 Different configurations are shown. Figure 3Each component shown in the figure can be implemented by hardware, software or a combination thereof.

[0168] In addition, an embodiment of the present application further provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the frame timing synchronization method for wireless communication of embodiment 1.

[0169] The embodiment of the present application also provides a computer program product, which, when running on a computer, enables the computer to execute the method described in the method embodiment.

[0170] In several embodiments provided in the present application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to multiple embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and the module, a program segment or a part of a code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or the flowchart, and the combination of boxes in the block diagram and / or the flowchart, can be implemented with a dedicated hardware-based device that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0171] In addition, the functional modules in the various embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.

[0172] If the functions are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard drives, ROM, RAM, magnetic disks, or optical disks.

[0173] The above description is only an embodiment of the present application and is not intended to limit the scope of protection of the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included in the scope of protection of the present application. It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings.

[0174] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0175] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

Claims

1. A frame timing synchronization method for wireless communication, characterized in that: The method comprises: Get the local frame synchronization header sequence; Get air interface data; Performing sliding window cross-correlation processing on the local frame synchronization header sequence and the air interface data to obtain a metric function; Performing threshold determination on the metric function to obtain an index value set; Performing maximum value determination on the index value set to obtain a frame synchronization position; The step of performing threshold determination on the metric function to obtain an index value set includes: Performing a fixed threshold decision on the metric function to obtain a metric function after the fixed threshold decision; Performing a dynamic threshold determination on the metric function to obtain a metric function after the dynamic threshold determination; Obtaining the index value set according to the metric function after the fixed threshold value judgment and the metric function after the dynamic threshold value judgment; The step of performing dynamic threshold determination on the metric function to obtain the metric function after dynamic threshold determination includes: Get dynamic threshold value; Performing a dynamic threshold decision on the metric function according to the dynamic threshold, to obtain the metric function after the dynamic threshold decision; The dynamic threshold value is obtained by the following formula: Wherein, λ(k) is the dynamic threshold value, μ is the dynamic threshold coefficient, i is the sample number corresponding to the window length, k is the starting point position of the window corresponding to each sliding window, M is the cumulative length of the metric function, D(k) is the metric function, and k is assigned 2. The frame timing synchronization method for wireless communication according to claim 1, wherein: The step of obtaining a local frame synchronization header sequence includes: Get the first length sequence; Performing a zero-padding operation on the first length sequence to obtain a second length sequence; Perform an inverse discrete Fourier transform on the second length sequence to obtain the local frame synchronization header sequence.

3. The frame timing synchronization method for wireless communication according to claim 1, wherein: The step of performing a fixed threshold judgment on the metric function to obtain the metric function after the fixed threshold judgment comprises: Get fixed threshold value; A fixed threshold decision is performed on the metric function according to the fixed threshold value to obtain the metric function after the fixed threshold decision.

4. The frame timing synchronization method for wireless communication according to claim 1, wherein: The step of performing maximum value determination on the index value set to obtain a frame synchronization position includes: Obtaining a metric function value in the index value set; An index value corresponding to the maximum metric function value among the metric function values ​​is selected as the frame synchronization position.

5. The frame timing synchronization method for wireless communication according to claim 1, wherein: The metric function is obtained by performing sliding window cross-correlation processing on the local frame synchronization header sequence and the air interface data using the following formula: Wherein, D(k) is the metric function, R(k) is the result of the sliding window cross-correlation operation, P1 is the power sum of the local frame synchronization header sequence, P2(k) is the power sum of the air interface data, x(n) is the local frame synchronization header sequence, r(n) is the air interface data, N is the window length, i is the sample number corresponding to the window length, and k is the starting point position corresponding to the window each time the window is slid.

6. A frame timing synchronization device for wireless communication, characterized in that: The device comprises: The acquisition module is used to obtain the local frame synchronization header sequence; it is also used to obtain air interface data; A sliding window cross-correlation module, configured to perform sliding window cross-correlation processing on the local frame synchronization header sequence and the air interface data to obtain a metric function; A decision module, configured to perform a threshold decision on the metric function to obtain an index value set; A selection module, configured to determine a maximum value of the index value set to obtain a frame synchronization position; The decision module is further configured to: Performing a fixed threshold decision on the metric function to obtain a metric function after the fixed threshold decision; Performing a dynamic threshold determination on the metric function to obtain a metric function after the dynamic threshold determination; Obtaining the index value set according to the metric function after the fixed threshold value judgment and the metric function after the dynamic threshold value judgment; Get dynamic threshold value; Performing a dynamic threshold decision on the metric function according to the dynamic threshold, to obtain the metric function after the dynamic threshold decision; The dynamic threshold value is obtained by the following formula: Wherein, λ(k) is the dynamic threshold value, μ is the dynamic threshold coefficient, i is the sample number corresponding to the window length, k is the starting point position of the window corresponding to each sliding window, M is the cumulative length of the metric function, D(k) is the metric function, and k is assigned 7. An electronic device, characterized in that: The electronic device comprises a memory and a processor, wherein the memory is used to store a computer program, and the processor runs the computer program to enable the electronic device to perform the frame timing synchronization method for wireless communication according to any one of claims 1 to 5.

Images