A fast algorithm for choosing frame synchronization unique word

The frame synchronization unique word (UW) is very important for burst data communication systems. Commonly used UWs such as M-sequences are not optimized for specific system environments. This paper gives both the upper and lower boundaries of mis-detection probability of frame synchronization. Based on these boundaries, an effective algorithm to find the optimal frame synchronization UWs for a given set of parameters is described in detail. The UW obtained using the proposed algorithm gives nearly optimal performance in terms of mis-detection probability of detecting UW in a data stream. Compared with other methods, this algorithm is more efficient and flexible for finding a UW in the case of a large detection window size or long UW.