Systems Engineering and Electronics ›› 2024, Vol. 46 ›› Issue (10): 3567-3576.doi: 10.12305/j.issn.1001-506X.2024.10.33

• Communications and Networks • Previous Articles    

Blind recognition algorithm for non-equal length frame synchronization word based on two window-sliding operations

Yuanqing WANG, Pengjiang HU, Jun'an YANG, Hui LIU   

  1. Institute of Electronic Countermeasures, National University of Defense Technology, Hefei 230037, China
  • Received:2023-06-29 Online:2024-09-25 Published:2024-10-22
  • Contact: Jun'an YANG

Abstract:

In non-cooperative communication scenarios, existing blind recognition algorithms for non-equal length frame synchronization face significant challenges, including suboptimal bit error resilience, slow detection speed and incomplete recognition results. In order to solve these challenges, a blind recognition algorithm for non-equal length frame synchronization word based on two window-sliding operations is proposed. Firstly, it divides the bitstream into multiple windows, and uses the first two windows to obtain extended synchronization word (E-SW) through sliding XNOR operation. Then, it uses sliding correlational operation between E-SW and the remaining windows to get the E-SWs for all windows and forms the E-SW set. Finally, statistical analysis is conducted on the E-SW set to determine the codeword of unknown synchronization word. The simulation results show that the proposed algorithm has a recognition accuracy of 98.7% when the bit error rate is 10-2, and recognizes the complete codeword through unknown synchronous words. Under the same accuracy, the proposed algorithm can adapt to at least 0.01 more-bit errors than existing algorithms. In addition, the speed of the proposed algorithm is faster than existing algorithms and is applicable to equal length frame protocols.

Key words: non-cooperative communication, synchronization word, non-equal length frame, blind recognition, window-sliding

CLC Number: 

[an error occurred while processing this directive]