{'fraction_non_alphanumeric': 0.02679830747531735, 'fraction_numerical': 0.0, 'mean_word_length': 5.339285714285714, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Backtracking Algorithm for Fast Computing Misdetection Probability of Sync Word in Burst Synchronization

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.