Fast Selecting Optimal Sync Word Based on Filtering and Backtracking for Burst Synchronization

The frame sync word (SW) is very important for burst data communication systems. Commonly used SWs such as m-sequences are not optimized for specific system environments in terms of misdetection (including false alarm and detection failure) probability. In this paper, both upper boundary and lower boundary of misdetection probability of frame synchronization are derived for given length and pattern of the preamble, length of SW and BER of channel. Based on the proposed boundaries, filtering out the SWs impossible to be optimal. And then, a backtracking full searching algorithm is used on the resulting SWs to select the optimal ones. Numerical results show that the filtering and backtracking full search algorithm (FBFSA) is very efficient and flexible