Zhongyong Wang
ABSTRACT
Aiming at the problems of slow speed and low efficiency of the existing signal frame header detection algorithm in the field of cooperative communication, a pattern matching based frame header detection algorithm is proposed. The algorithm is improved on the basis of the pattern matching algorithm to make it suitable for the cooperative communication field. First, the proposed algorithm removes the bad character array table in the preprocessing process of the pattern matching algorithm, and only retains the good suffix character array table. Secondly, for the problem that the pattern matching algorithm can only perform accurate matching, the proposed algorithm adds bit error tolerance, so that it can perform fuzzy matching for bit stream data, and changes the moving rule of matching subscripts, which avoids the problem of missing the frame header due to the error code caused by the influence of the noise in the communication environment, and further strengthens the BER capability of the algorithm. Finally, the proposed algorithm is compared with the pattern matching algorithm and the frame header detection algorithm based on mutual correlation. The results show that the proposed algorithm has faster frame header detection speed and better BER performance, which improves the frame header detection speed by 70%-80% compared with the mutual gateway algorithm, and improves the frame header detection rate by 36% compared with the pattern matching algorithm. The simulation results verify the effectiveness of the proposed algorithm and show that the algorithm has certain value for engineering applications.
- Zhang Y G, Lou CY. Channel coding and its recognition analysis [M]. Beijing: Electronic Industry Press, 2010: 1-2.Google Scholar
- CAO C H, LEI Y K. A review of link-layer unknown frame analysis techniques for bitstream [J]. Small Microcomputer Systems, 2018, 39(02): 297-303.Google Scholar
- WANG Y D. Research on analyzing the structure of protocol frame header for bit stream [D]. Shanghai Jiao Tong University, 2013.Google Scholar
- SUN C. Research on frame length estimation technique for equal frame length signal [J]. Radio Engineering, 2013, 43(02):21-22+26.Google Scholar
- TAO J U, YANG J B, ZHANG B A fast search matching algorithm for bitstream-oriented grouping [J]. Computer Engineering, 2017,43(06):125-128+135.Google Scholar
- BAI Y, YANG X J, WANG M. Frame synchronization code identification based on correlation filtering and Hadamard transform [J]. Journal of Detection and Control, 2011, 33(03):69-72+80.Google Scholar
- GUO K F, WANG M. Research on frame header detection method based on equal frame length signal [J]. Radio Engineering, 2014, 44(06):33-35+59.Google Scholar
- Xu Y, Zhong Y, Huang Z. An improved blind recognition algorithm of frame parameters based on self-correlation [J]. Information, 2019, 10(2): 64.Google ScholarCross Ref
- Brahma P P, Bandyopadhyay K. Non-cooperative denial of communication after synchronizing with repeating sequences [C]//2011 Defense Science Research Conference and Expo (DSR). IEEE, 2011: 1-4.Google Scholar
- LU K, ZHANG M, LI X H. An effective equal frame length frame synchronization blind identification method [J]. Fire and Command and Control, 2015, 40(09):68-71+76.Google Scholar
- Boyer R S, Moore J S. A fast string searching algorithm [J]. Communications of the ACM, 1977, 20(10): 762-772.Google ScholarDigital Library
- WANG Z. Bitstream-oriented link protocol identification and analysis techniques [D]. University of Science and Technology of China, 2014.Google Scholar
- WANG T. Research on unknown protocol identification technology based on data mining [D]. University of Electronic Science and Technology, 2019.Google Scholar
- Zou Y. Research and realization of key technology of channel unit for satellite communication [D]. Beijing University of Technology, 2002.Google Scholar
Index Terms
- Fast Detection Algorithm for Equal Length Frame Signals Based on Pattern Matching
Recommendations
Multi-pattern matching with variable-length wildcards using suffix tree
Multi-pattern matching with variable-length wildcards is an interesting and important problem in bioinformatics, information retrieval and other domains. Most of the previously developed multi-pattern matching methods, such as famous Aho---Corasick and ...
A fast bit-parallel multi-patterns string matching algorithm for biological sequences
ISB '10: Proceedings of the International Symposium on BiocomputingThe problem of searching occurrences of a pattern P[0...m-1] in the text T[0...n-1>with m ≤ n, where the symbols of P and T are drawn from some alphabet Σ of size σ, is called exact string matching problem. In the present day, pattern matching is a ...
Suffix array for multi-pattern matching with variable length wildcards
Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix ...
Comments