Please use this identifier to cite or link to this item:
|Title:||Fast algorithm for choosing frame synchronization unique word|
|Source:||Chen, M.,Chua, K.C.,Ding, Q.L. (1998). Fast algorithm for choosing frame synchronization unique word. Conference Record / IEEE Global Telecommunications Conference 6 : 3437-3442. ScholarBank@NUS Repository.|
|Abstract:||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.|
|Source Title:||Conference Record / IEEE Global Telecommunications Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.