Blind recognition algorithm for non-equal length frame synchronization word based on two window-sliding operations
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.
NETL
NSTL
万方数据
