【24h】

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.
机译:帧同步唯一字(UW)对于突发数据通信系统非常重要。常用的UWS,例如M序列,没有针对特定的系统环境进行优化。本文给出了帧同步的MIS检测概率的上边界。基于这些边界,详细描述了一种用于找到给定参数集的最佳帧同步UWS的有效算法。使用该算法获得的UW在检测数据流中检测UW的误报概率方面提供了几乎最佳的性能。与其他方法相比,该算法更有效且灵活地用于在大检测窗口大小或长UW的情况下找到UW。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号