Backtracking Algorithm for Fast Computing Misdetection Probability of Sync Word in Burst Synchronization

Author

Yu, Hua ; Liang, Jian ; Ding, Quanlong ; Wei, Gang

Author_Institution

Sch. of Electron. & Inf. Eng., South China Univ. of Technol., Guangzhou

fYear

2006

fDate

27-30 Nov. 2006

Firstpage

1

Lastpage

4

Abstract

The frame sync word (SW) is very important for burst data communication systems. The misdetection (including false alarm and detection failure) probability is a very good performance metric of a SW. Usually, the exact misdetection probability of one SW is obtained by Exhaustively Full Searching (EFS) through the whole error pattern space. EFS is straightforward, but the drawback is complexity. In this paper, we propose a new full search algorithm-Backtracking Full Searching (BFS), which is based on the backtracking method. Simulation result shows that BFS algorithm is very efficient and flexible.

Keywords

backtracking; data communication; failure analysis; probability; synchronisation; backtracking algorithm; burst synchronization; complexity drawback; data communication systems; detection failure; exhaustively full searching; false alarm; fast computing misdetection probability; frame sync word; Clocks; Data communication; Data engineering; Extraterrestrial measurements; GSM; Mobile communication; Synchronization; Timing; Wireless LAN; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Technology, 2006. ICCT '06. International Conference on

Conference_Location

Guilin

Print_ISBN

1-4244-0800-8

Electronic_ISBN

1-4244-0801-6

Type

conf

DOI

10.1109/ICCT.2006.341715

Filename

4146370