首页> 外文会议>International Conference on Signal Processing(ICSP'06); 20061116-20; Guilin(CN) >Fast Selecting Optimal Sync Word Based on Filtering and Backtracking for Burst Synchronization
【24h】

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.
机译:帧同步字(SW)对于突发数据通信系统非常重要。就误检测(包括误报警和检测失败)概率而言,未针对特定系统环境优化诸如M序列之类的常用软件。本文针对给定的前同步码长度和模式,信道的SW长度和BER,推导了帧同步误检概率的上界和下界。根据建议的边界,滤除SW不可能达到最佳效果。然后,在生成的软件上使用回溯完全搜索算法来选择最佳算法。数值结果表明,滤波和回溯全搜索算法(FBFSA)非常有效且灵活。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号