A method and system for blind recognition of frame synchronization features for variable-length frames

By employing a blind recognition method for frame synchronization features of variable-length frames, frequent sequences are filtered and spliced, and the set of maximally frequent sequences is optimized. This solves the problem of low recognition rate in existing technologies for non-uniform-length frames and achieves high recognition rate for frame synchronization features.

CN118018168BActive Publication Date: 2024-11-22NAT SPACE SCI CENT CAS
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410018730.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-01-05
Publication Date
2024-11-22
Estimated Expiration
2044-01-05

AI Technical Summary

Technical Problem

Existing protocol blind identification technologies are difficult to apply when the length of transmitted data frames is variable, especially in non-cooperative communication adversarial fields, resulting in low identification rates.

Method used

A blind identification method for frame synchronization features of variable-length frames is proposed. By traversing the information sequence with a set frequent sequence length, candidate synchronization words are selected, deduplication and splicing are performed, and the decision criteria of frequent sequences are combined to optimize the maximally frequent sequence set, thereby realizing the identification of frame synchronization features.

Benefits of technology

Even with a high bit error rate, the recognition rate can still be maintained above 95%. It is compatible with blind recognition of frame synchronization features for both equal-length and non-equal-length frames, thus improving the accuracy and applicability of the recognition.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118018168B_ABST
    Figure CN118018168B_ABST
Patent Text Reader

Abstract

The present application provides a method and system for blind recognition of frame synchronization features for variable-length frames, the method comprising: traversing within the range of the intercepted information sequence with a set frequent sequence length to obtain all candidate synchronization words; deduplicating the candidate synchronization words, and screening them according to the judgment criteria of the frequent sequence to obtain a frequent sequence set; splicing the frequent sequence set, and then screening them according to the judgment criteria of the frequent sequence to obtain a maximum frequent sequence set; optimizing the maximum frequent sequence set to obtain a final maximum frequent sequence set, wherein the sequence is the identified synchronization feature. The advantage of the present application is that it can effectively realize the blind recognition of frame synchronization features of unequal-length frames, and can still maintain a recognition rate of more than 95% under high bit error rates. In the blind recognition of frame synchronization features of equal-length frames, the recognition rate can also be maintained at more than 95%.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of link layer communication technology and link layer protocol blind recognition technology, and specifically relates to a method and system for blind recognition of frame synchronization features for variable length frames. Background Art

[0002] Standardized protocol identification technology is the key to maintaining the standardized operation of communication protocols. Protocol identification technology is to identify and analyze the data features in the acquired communication data stream through algorithms and tools to determine the type of protocol used by the communication target, and can also be further analyzed to obtain the communication content. Protocol blind identification technology extracts synchronization information without prior information and frame structure information, and then determines the link layer protocol to which it belongs based on the extracted synchronization information. It is generally used for information acquisition and even information confrontation in the field of non-cooperative information transmission, and has more important significance in the increasingly complex communication environment.

[0003] The current protocol blind recognition technology generally adopts statistical methods to identify the difference in statistical characteristics of the synchronization word part and the data bit part. It mainly focuses on blind recognition based on fixed features such as the frame structure and frame length of the protocol data frame. However, in the field of non-cooperative communication confrontation, due to the existence of many factors such as communication scheme design and communication environment, the frame length of the transmission data frame will be uncertain during the actual transmission process. In this scenario, the existing fixed-length frame recognition algorithm will be difficult to apply. Therefore, it is of great significance to study an effective non-equal-length frame protocol blind recognition algorithm. Summary of the invention

[0004] The purpose of the present application is to overcome the defect that the existing protocol blind recognition technology is not applicable to the situation where the transmission data frame length is uncertain.

[0005] In order to achieve the above object, the present application proposes a method for blindly identifying frame synchronization features for variable-length frames, comprising:

[0006] Step 1: Traverse the intercepted information sequence range with the set frequent sequence length to obtain all candidate synchronization words;

[0007] Step 2: Remove duplicate candidate synchronization words and screen them according to the frequent sequence decision criteria to obtain a frequent sequence set;

[0008] Step 3: concatenate the frequent sequence sets, and then filter them according to the frequent sequence judgment criteria to obtain the maximum frequent sequence set;

[0009] Step 4: Optimize the maximum frequent sequence set to obtain the final maximum frequent sequence set, in which the sequence is the synchronization feature to be identified.

[0010] As an improvement of the above method, step 1 comprises:

[0011] Taking the set frequent sequence length as the window length, starting from the first character of the intercepted information sequence, slide forward one bit at a time, and take a sequence of the window length as a candidate synchronization word.

[0012] As an improvement to the above method, the set frequent sequence length is 4 to 8 hexadecimal characters.

[0013] As an improvement of the above method, the decision criteria of the frequent sequence include:

[0014] The number of times a frequent sequence appears in the intercepted information sequence is greater than the expected number of occurrences E:

[0015]

[0016] Wherein, n represents the length of the intercepted information sequence; m represents the set frequent sequence length.

[0017] As an improvement of the above method, the concatenating of frequent sequence sets includes:

[0018] Detect the first character positions of the two sequences in the frequent sequence set in turn, and record them as position a and position b respectively, with position b following position a; if the two sequences are adjacent or overlapping, and the distance between them is less than a set frequent sequence length, then the two sequences are concatenated; if the two sequences are not adjacent or partially overlapping, then the two sequences are not concatenated;

[0019] When splicing, remove the first M characters from the second sequence and record the subsequent sequence into the first sequence to complete the splicing;

[0020] Wherein: M = m-(ba); m represents the set frequent sequence length.

[0021] As an improvement of the above method, step 4 includes:

[0022] Changing the starting position and / or length of the intercepted information sequence, executing step 1 to step 3 k times;

[0023] The number of sequences in the maximum frequent sequence set obtained in each execution is counted, which are [c1,c2,c3,···,c i ,···,c k ];

[0024] Get the maximum value P of the synchronization word decision probability r The corresponding maximal frequent sequence set is the final maximal frequent sequence set:

[0025]

[0026] As an improvement of the above method, the frequency statistics is to count the number of times corresponding to the sequence that appears most in the maximum frequent sequence set.

[0027] The present application also provides a frame synchronization feature blind recognition system for variable length frames, which is implemented based on the above method, and the system includes:

[0028] A module for obtaining candidate synchronization words is used to traverse the intercepted information sequence range with a set frequent sequence length to obtain all candidate synchronization words;

[0029] A frequent sequence set calculation module is used to remove duplicate candidate synchronization words and screen them according to the frequent sequence decision criteria to obtain a frequent sequence set;

[0030] A module for calculating a maximum frequent sequence set is used to concatenate frequent sequence sets and then screen them according to the judgment criteria of frequent sequences to obtain a maximum frequent sequence set; and

[0031] The technical synchronization feature module is used to optimize the maximum frequent sequence set to obtain the final maximum frequent sequence set, in which the sequence is the recognized synchronization feature.

[0032] Compared with the prior art, the advantages of this application are:

[0033] 1. An improved algorithm is proposed to address the phenomenon of unequal-length frames that may occur in link layer transmission in a communication environment. The algorithm can effectively realize blind recognition of frame synchronization features of unequal-length frames. At the same time, the algorithm is also compatible with blind recognition of frame synchronization features of equal-length frames;

[0034] 2. The algorithm can effectively realize the blind recognition of frame synchronization features of unequal length frames. In the case of high bit error rate, the algorithm can still maintain a recognition rate of more than 95%. In the blind recognition of frame synchronization features of equal length frames, the algorithm can also maintain a recognition rate of more than 95%. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 Shown is a flow chart of a method for blindly identifying frame synchronization features for variable-length frames;

[0036] Figure 2 Shown is a frame synchronization feature program module diagram for variable length frames;

[0037] Figure 3 The figure shows the design flow chart of the frame synchronization feature program of variable length frames;

[0038] Figure 4 The figure shows the program operation diagram in the data reading stage;

[0039] Figure 5The figure shows the program operation diagram of the data preprocessing stage;

[0040] Figure 6 The figure shows the program operation diagram of the initial sequence setting stage;

[0041] Figure 7 The figure shows the program operation diagram of the initial frequent sequence processing stage;

[0042] Figure 8 The figure shows the first part of the program operation diagram of the frequent long sequence recognition stage;

[0043] Fig. 9 The figure shows the second part of the program operation diagram of the frequent long sequence recognition stage;

[0044] Fig.10 The figure shows the program output result. Specific implementation manners

[0045] The technical solution of the present application will be described in detail below with reference to the accompanying drawings.

[0046] Aiming at the current blind recognition technology which mainly focuses on fixed-length frame recognition and has poor recognition effect for non-equal-length frames, the present application proposes a blind recognition method and system for frame synchronization features of variable-length frames. This method can not only effectively recognize the frame synchronization features of non-equal-length frames, but also be applied to the blind recognition of equal-length frames.

[0047] The core of the blind recognition technology lies in accurately and efficiently identifying the features in the communication data stream. According to the encapsulation rules of data frames and the principle of data frame synchronization, each protocol in the link layer protocol has its own synchronization header, that is, no matter which sub-protocol is used for transmission, there will be a same synchronization header in the data frame. This synchronization header can become the feature to be recognized by blind recognition. Since the bit stream of communication data is composed of a large number of data frames transmitted according to the same protocol, in the bit stream, the sequence of the synchronization header of this protocol must be "frequent", that is, a "frequent sequence". Then, according to its characteristics, the following derivations can be made:

[0048] Let S be a bit stream containing n bits, and P be a bit sequence containing m bits in S (m < n). Regarding the number of bits as the sequence length, then: the length of P is m, the length of S is n, and the number of sequences with length m contained in S is denoted as r, r = n - m + 1. If the sequence S is a completely random bit sequence, then the expected frequency of the sequences with length m appearing in it is:

[0049]

[0050] Then the actual number of times the frequent sequence P appears in the bit stream should at least satisfy E.

[0051] In addition, assuming that the length of the intercepted data sequence is N, the following definitions should also be clarified:

[0052] Binary symmetric channel (BSC): When transmitting data, the data obtained by the sender and receiver of the channel have only two symbols, 0 and 1, and bit errors may occur during transmission, that is, 0 in the data changes to 1 or 1 changes to 0, and when bit errors occur, the probability of 0 changing to 1 and 1 changing to 0 is the same.

[0053] Sync word length (M): When data is transmitted in a channel, in order to clearly distinguish the beginning and end of each piece of information, bits of a fixed length and a fixed codeword are placed at the beginning and end of each frame. The combination of the codewords at both ends is the sync word. Due to its fixed characteristics, the sync word can be used to represent the characteristics of the data frame. The length of the sync word is the sync word length M. In the present application method, the sync word is also a concept of a maximum frequent sequence, so the length of the maximum frequent sequence is M.

[0054] Frequent sequence (m): A manually defined parameter that assists in locating the synchronization word.

[0055] Bit Error Rate (SER): When a signal is affected by noise or interference, it will affect the codeword of the signal, which may cause the codeword information to be reversed, thereby generating bit errors, causing 0 in the original data to become 1, and 1 to become 0. The bit error rate is the bit error generated in the transmission. e Ratio to the length N of the data sequence being transmitted:

[0056]

[0057] Recognition rate (R): The result of whether the final recognition result of the algorithm matches the feature sequence of the real data. After repeated experiments, the correct result L r The ratio of the number of experiments L is the recognition rate:

[0058]

[0059] False alarm and missed alarm: If the bit error occurs in the synchronization word, it may cause the algorithm to produce missed alarm, that is, the original synchronization word part will be recognized as a non-synchronous word. If the bit error occurs in the information bit, it may cause the algorithm to produce false alarm, that is, the original non-synchronous word part will be recognized as a synchronization word. Both missed alarm and false alarm will have a great impact on the recognition rate of the frame synchronization feature blind recognition method.

[0060] Since the data sequence is transmitted in the format of a protocol data frame, each frame can be considered as two parts. The first part is the synchronization field, that is, the synchronization feature, represented by S, and the second part is the information segment, represented by D. The frame synchronization word length is M, and the data part length is L. i .

[0061] Embodiment 1:

[0062] like Figure 1 As shown, the frame synchronization feature blind recognition method for variable-length frames proposed in the present application is divided into four steps: first, all candidate synchronization words are traversed and detected within the intercepted information sequence N with a frequent sequence length m, then the candidate codewords are deduplicated and screened according to the frame structure of the candidate synchronization words, and then a decision is made according to the given synchronization decision criteria, and finally the obtained frequent sequence results are optimized and spliced.

[0063] (1) Frequent sequence detection

[0064] Define the screening matrix X, traverse the entire intercepted data N according to the set parameter frequent sequence length, obtain a sequence of length m (the recommended sequence length is 4 to 8 hexadecimal characters, too long will affect the overall recognition efficiency of the method), and record it in the screening matrix X. Since m≤M<<N, the obtained screening matrix X must contain some or all correct frequent sequences.

[0065] The traversal method is: take the frequent sequence length as the window length, start from the first character of the intercepted data N, slide forward one bit each time, take a sequence of the window length and put it into the screening matrix X.

[0066] (2) Frequent sequence deduplication screening

[0067] Define a sequence set Y, and after deduplication, obtain mutually different sequences. Use the obtained sequences as windows to traverse the intercepted data N in turn, and record the number of occurrences and positions of each sequence. The number of sequence occurrences is counted and screened according to the judgment criteria for frequent sequences. The judgment criteria for frequent sequences are: the actual number of occurrences of frequent sequence P should at least meet the expected number of occurrences That is, the actual number of occurrences t>E, and a frequent sequence set that meets the requirements is obtained and recorded in the sequence set Y.

[0068] (3) Determination of extremely frequent sequences

[0069] Define sequence set Z, and splice the frequent sequences in sequence set Y according to their occurrence positions. In the process of splicing two sequences, detect the first character positions of the two sequences, record them as position a and position b respectively, and position b is after position a (i.e., b>a). If the two frequent sequences are adjacent or overlapping, the distance between them will definitely be less than the length of a detection sequence, i.e., ba≤m, and then the two sequences are spliced. When splicing, remove the first m-(ba) characters from the second sequence, and record the subsequent sequence into the first sequence to complete the splicing. If there is no adjacent or partial overlap between the two sequences, the two sequences do not participate in the splicing and are retained in the original sequence set. Then, the obtained sequence is traversed again to intercept data N, record the number of occurrences of each spliced ​​sequence, and screen the sequences according to the judgment criteria of the frequent sequence to obtain a spliced ​​frequent sequence set that meets the requirements. Record it in sequence set Z. Because step (2) has removed the sequences that do not meet the conditions, the longest spliced ​​frequent sequence at this time is the maximum frequent sequence, i.e., the frame synchronization feature.

[0070] (4) Optimization of error-proof performance

[0071] When interfered by bit errors, the intercepted data N will be affected to a certain extent. By analyzing the non-target frequent sequences obtained by judgment, the main reason for the misjudgment is that the bit error generated at the synchronization word will increase the distance between the two synchronization words, and then when judging the frequent sequence, the originally correct frequent sequence will be filtered out and the suboptimal one will be selected. At the same time, another part of the misjudgment is that the appearance of bit errors causes the data of the original non-frequent sequence to appear frequently, and thus it is judged as a frequent sequence, which then leads to misjudgment. Therefore, the method here adopts the law of large numbers, and can be repeatedly verified by the original traversal method or by changing the traversal position. After multiple judgments, the maximum frequent sequence corresponding to the maximum probability is taken as the final judgment. That is, n repeated experiments are performed, and the number of judgment synchronization words obtained is counted (the number statistics are the number of times the sequence that appears most in the maximum frequent sequence set is counted) are [c1, c2, c3, ···, c i ,···,c n ], then according to statistics, the decision probability of each synchronization word is:

[0072]

[0073] P r =max{p i}

[0074] The maximum frequent sequence of the final decision is P r The corresponding maximal frequent sequence.

[0075] The implementation of the frame synchronization feature program of variable length frames implemented by the blind recognition method of frame synchronization features for variable length frames is based on Windows 8 32-bit operating system, Python environment, and the hardware environment is Intel i7 processor with 8GB memory.

[0076] The program is divided into five main parts:

[0077] First, determine the length range and frame length range of the synchronization word, then detect all candidate synchronization words, screen the candidate synchronization words again, and then judge the synchronization words according to the judgment conditions set by the algorithm, and finally optimize the error-proof performance. The main functions are as follows:

[0078] (1) Parameter setting

[0079] The main way for users to set parameters. Through this module, the program first determines the basic value range of the parameters, including frequent sequence m, intercepted data N, and data sampling length N. i .

[0080] (2) Frequent sequence detection

[0081] From the intercepted data N, randomly select a segment of length N i The data of length m is traversed from left to right in sequence to obtain the screening matrix X. The possibility that a sequence of length m can be traversed has a total of N i -m+1 possibilities.

[0082] (3) Frequent sequence deduplication screening

[0083] Because all the obtained sequences may be repeated, in order to reduce the computational complexity of sequence screening, the sequences in the screening matrix X are deduplicated and the intercepted data N is traversed to record the number of times the sequence appears in the sequence set Y. The obtained sequence set Y is screened to screen out the sequences that meet the requirements of frequent sequences, which are frequent sequences.

[0084] (4) Splicing and screening

[0085] The sequences in sequence set Y are concatenated to obtain sequence set Z. If the distance between the two sequences during the concatenation process is greater than m, it is considered that the two sequences are not adjacent or overlapping and do not participate in the concatenation. The obtained sequence set Z is traversed again through the intercepted data N to record the number of times its sequence appears, and the sequence in sequence set Z is judged to be frequent, and the frequent long sequences are retained. Then the longest sequence in sequence set Z is judged to be the maximum frequent sequence, that is, the synchronization feature of the judgment.

[0086] (5) Further optimization

[0087] Since a single blind recognition may have multiple unexpected factors interfering with the final recognized synchronization features, this module allows the user to choose to repeat the recognition process, during which the parameters can be modified or kept unchanged, and the probability of occurrence of different judgment synchronization word lengths is counted, and the judgment result with the highest probability is selected as the final judgment to obtain the final judgment synchronization feature.

[0088] The module design of the program is as follows Figure 2 As shown:

[0089] ● Input: link data file (hexadecimal / binary), parameter configuration;

[0090] ●Output: characteristic sequence results of link data, link data converted to txt format file, initial sequence and frequent sequence results in the recognition process;

[0091] ●Function: Based on the input link data, the user inputs the identification parameters (including the initial sequence determination length, whether to traverse the data in whole / part, the scale and position of the traversed data), and the program will blindly identify the link data according to the configuration and output the protocol characteristics of the link data. The program's default traversal methods include random position, specific position, relative position (data 1 / 4, 1 / 2, 3 / 4), and reverse traversal. The program supports data file formats such as .raw / .dat / .bin.

[0092] like Figure 3 As shown, the program flow is designed as follows:

[0093] (1) Data reading, such as Figure 4 As shown;

[0094] Figure 4 Line 1: Input item, read the link data file of the input path, the default path is the current folder.

[0095] Figure 4 Line 2: The total length of the link data file read.

[0096] Figure 4 Line 3: Output item, output link data file in txt format for user reference.

[0097] Figure 4 Line 4: Prompts the user to the total length of the link data file and enters the preprocessing stage

[0098] (2) Data preprocessing, such as Figure 5 As shown;

[0099] Figure 5 Line 2: Input item, setting the program traversal scale.

[0100] Figure 5Lines 4-7 in: You can choose the starting point of the traversal.

[0101] Figure 5 Lines 8-9 in the input, set the starting point of the traversal, and set more detailed settings according to different options:

[0102] Random: traverse the data from a random position until the truncation length is reached;

[0103] Specify a specific location: start traversing the data from the specified location of the data (relative to the first position of the data);

[0104] Specify relative position: traverse the data from a specific position. The specific positions set by the program are 1 / 4, 1 / 2, and 3 / 4.

[0105] From back to front: traverse the data starting from the specified position of the data (relative to the end of the data).

[0106] (3) Initial sequence setting, such as Figure 6 As shown;

[0107] Figure 6 Line 3: Input item, setting the length of the initial frequent sequence.

[0108] Figure 6 Line 4: Input item, set the initial frequent sequence determination coefficient. The higher the coefficient, the better the effect of shielding interference sequences. The recommended range is between 1.0-2.0.

[0109] (4) Initial frequent sequence processing, such as Figure 7 As shown;

[0110] Figure 7 Lines 4-12 in: The initial frequent sequence results obtained by the program traversal.

[0111] Figure 7 Lines 16-25 in: Frequent long sequences obtained by concatenation.

[0112] Figure 7 Lines 26-29 in : Input item, the user can choose to re-traverse the frequent sequence or continue to the next stage.

[0113] (5) Frequent long sequence recognition, such as Figure 8 , Fig. 9 As shown;

[0114] Figure 8 Lines 7-16 and Fig. 9 Lines 1-7: Progress display during program recognition, including the current position traversed by the program and the progress ratio.

[0115] Fig. 9Lines 8-17 in: Output items, the frequent long sequences finally identified by the program and the number of times they appear in the link data.

[0116] Fig. 9 Line 18 in : The time taken by the program to identify frequent sequences.

[0117] (6) Output results, such as Fig.10 As shown;

[0118] Fig.10 Line 1 in: Link data body file.

[0119] Fig.10 Line 2: The converted link data in txt format.

[0120] Fig.10 Line 3 in: Frequent sequence results identified by the program and the number of times they appear in the link data.

[0121] Fig.10 Line 4 in: The initial frequent sequence results identified by the program and the number of times they appear in the traversal range.

[0122] Fig.10 Line 5: The program identifies the initial frequent sequence results and the number of times they appear in the traversal range, and adds the results of the spliced ​​sequences and the number of times they appear in the traversal range.

[0123] Embodiment 2:

[0124] The present application also provides a frame synchronization feature blind recognition system for variable length frames, which is implemented based on the above method, and the system includes:

[0125] A module for obtaining candidate synchronization words is used to traverse the intercepted information sequence range with a set frequent sequence length to obtain all candidate synchronization words;

[0126] A frequent sequence set calculation module is used to remove duplicate candidate synchronization words and screen them according to the frequent sequence decision criteria to obtain a frequent sequence set;

[0127] A module for calculating a maximum frequent sequence set is used to concatenate frequent sequence sets and then screen them according to the judgment criteria of frequent sequences to obtain a maximum frequent sequence set; and

[0128] The technical synchronization feature module is used to optimize the maximum frequent sequence set to obtain the final maximum frequent sequence set, in which the sequence is the recognized synchronization feature.

[0129] The present application may also provide a computer device, comprising: at least one processor, a memory, at least one network interface and a user interface. The various components in the device are coupled together through a bus system. It is understood that the bus system is used to achieve connection and communication between these components. In addition to the data bus, the bus system also includes a power bus, a control bus and a status signal bus.

[0130] The user interface may include a display, a keyboard or a pointing device, such as a mouse, a trackball, a touch pad or a touch screen.

[0131] It is understood that the memory in the embodiments disclosed in the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct memory bus random access memory (DRRAM). The memories described herein are intended to include, but are not limited to, these and any other suitable types of memories.

[0132] In some embodiments, the memory stores the following elements, executable modules or data structures, or a subset thereof, or an extended set thereof: an operating system and applications.

[0133] The operating system includes various system programs, such as a framework layer, a core library layer, a driver layer, etc., which are used to implement various basic services and process hardware-based tasks. The application includes various application programs, such as a media player (Media Player), a browser (Browser), etc., which are used to implement various application services. The program for implementing the method of the embodiment of the present disclosure can be included in the application.

[0134] In the above embodiment, the processor may also call a program or instruction stored in the memory, specifically, a program or instruction stored in an application program, and is used to:

[0135] Execute the steps of the above method.

[0136] The above method can be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above processor may be a general processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The above-disclosed methods, steps and logic block diagrams can be implemented or executed. The general processor may be a microprocessor or the processor may also be any conventional processor, etc. The steps of the above-disclosed method can be directly embodied as a hardware decoding processor to execute, or the hardware and software modules in the decoding processor are combined to execute. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0137] It is understood that the embodiments described in the present application can be implemented by hardware, software, firmware, middleware, microcode or a combination thereof. For hardware implementation, the processing unit can be implemented in one or more application specific integrated circuits (ASIC), digital signal processors (DSP), digital signal processing devices (DSPD), programmable logic devices (PLD), field programmable gate arrays (FPGA), general-purpose processors, controllers, microcontrollers, microprocessors, other electronic units for performing the functions described in the present application or a combination thereof.

[0138] For software implementation, the technology of the present application can be implemented by executing the functional modules (such as procedures, functions, etc.) of the present application. The software code can be stored in a memory and executed by a processor. The memory can be implemented in the processor or outside the processor.

[0139] The present application may also provide a non-volatile storage medium for storing a computer program. When the computer program is executed by a processor, each step in the above method embodiment can be implemented.

[0140] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present application and are not intended to limit it. Although the present application is described in detail with reference to the embodiments, a person skilled in the art should understand that any modification or equivalent replacement of the technical solution of the present application does not depart from the spirit and scope of the technical solution of the present application and should be included in the scope of the claims of the present application.

Claims

1. A method for blindly identifying frame synchronization features of variable length frames, comprising: Step 1: Traverse the intercepted information sequence range with the set frequent sequence length to obtain all candidate synchronization words; Step 2: Remove duplicate candidate synchronization words and screen them according to the frequent sequence decision criteria to obtain a frequent sequence set; Step 3: Splice the frequent sequence set, combine the spliced ​​sequences with the unspliced ​​sequences to form a new sequence set, and then screen the new sequence set according to the frequent sequence judgment criteria to obtain the maximum frequent sequence set; Step 4: Optimize the maximum frequent sequence set to obtain the final maximum frequent sequence set, in which the sequence is the synchronization feature to be identified; The splicing of the frequent sequence sets comprises: Detect the first character positions of the two sequences in the frequent sequence set in turn, and record them as position a and position b respectively, with position b following position a; if the two sequences are adjacent or overlapping, and the distance between them is less than a set frequent sequence length, then the two sequences are concatenated; if the two sequences are not adjacent or partially overlapping, then the two sequences are not concatenated; When splicing, remove the first M characters from the second sequence and record the subsequent sequence into the first sequence to complete the splicing; Wherein: M = m-(ba); m represents the set frequent sequence length.

2. The method for blindly identifying frame synchronization features of variable length frames according to claim 1, characterized in that: The step 1 comprises: Taking the set frequent sequence length as the window length, starting from the first character of the intercepted information sequence, slide forward one bit at a time, and take a sequence of the window length as a candidate synchronization word.

3. The method for blindly identifying frame synchronization features of variable length frames according to claim 1, characterized in that: The set frequent sequence length is 4 to 8 hexadecimal characters.

4. The method for blindly identifying frame synchronization features of variable length frames according to claim 1, characterized in that: The judgment criteria of the frequent sequence include: The number of times a frequent sequence appears in the intercepted information sequence is greater than the expected number of occurrences E: Wherein, n represents the length of the intercepted information sequence; m represents the set frequent sequence length.

5. The method for blindly identifying frame synchronization features for variable length frames according to claim 1, characterized in that: The step 4 comprises: Changing the starting position and / or length of the intercepted information sequence, executing step 1 to step 3 k times; The number of sequences in the maximum frequent sequence set obtained in each execution is counted, which are [c1, c2, c3, …, c i ,…,c k ]; Get the maximum value P of the synchronization word decision probability r The corresponding maximal frequent sequence set is the final maximal frequent sequence set:

6. The method for blindly identifying frame synchronization features of variable length frames according to claim 5, characterized in that: The frequency statistics are to count the number of times the sequence that appears most in the maximum frequent sequence set corresponds to.

7. A frame synchronization feature blind recognition system for variable length frames, implemented based on any method described in claims 1-6, characterized in that: The system comprises: A module for obtaining candidate synchronization words is used to traverse the intercepted information sequence range with a set frequent sequence length to obtain all candidate synchronization words; A frequent sequence set calculation module is used to remove duplicate candidate synchronization words and screen them according to the frequent sequence decision criteria to obtain a frequent sequence set; A module for calculating a maximum frequent sequence set is used to concatenate frequent sequence sets and then screen them according to the judgment criteria of frequent sequences to obtain a maximum frequent sequence set; and The technical synchronization feature module is used to optimize the maximum frequent sequence set to obtain the final maximum frequent sequence set, in which the sequence is the recognized synchronization feature.