基于离散度分析的帧同步快速盲识别算法  

Fast Blind Recognition Algorithm of Frame Synchronization Based on Dispersion Analysis

作　　者：邵堃 雷迎科 Shao Kun;Lei Yingke(Electronic Countermeasure Institute,National University of Defense Technology, Hefei, Anhui 230037, China)

机构地区：[1]国防科技大学电子对抗学院,安徽合肥230037

出　　处：《信号处理》2020年第3期361-372,共12页Journal of Signal Processing

基　　金：国家自然科学基金资助项目(61272333);国防科技重点实验室基金(9140C130502140C13068);总装预研项目基金(9140A33030114JB39470)。

摘　　要：本文针对协议类型未知条件下集中插入式帧同步的盲识别问题,首次提出了一种基于离散度分析的快速帧同步盲识别算法。首先,根据集中插入式帧同步的特点,通过分析比较同步码和帧内其他序列的相关性,得出集中插入式同步码都具有很小的相关旁瓣的结论;然后,根据离散度分析理论,通过计算序列的相对离散度值分析序列的相关性,利用上述方法对待识别数据进行循环切分并计算每个切分段的相对离散度值,达到准确切分帧同步码的目的;最后,通过分析各子切分序列的相对离散度值,实现同步码的准确识别。仿真试验验证了本文算法的有效性,表明识别算法不受同步码型和数据量的约束,并且算法的抗误码性能较好、识别速度较快,因此具有一定的工程应用价值。To solve the problem of blind recognition of concentratively inserted frame synchronization,a novel fast blind recognition algorithm of frame synchronization based on dispersion analysis is proposed.Firstly,through the analysis of correlation of synchronization words and information sequences,the conclusion that the concentratively inserted frame synchronization codes have very small correlation sidelobes is got.Then,the correlation of sequences can be described according to the discrete degree analysis theory.The frame synchronization code can be cut accurately by cyclic cutting the recognition data and calculating the relative discreteness value of each segment.Finally,the synchronization word can be identified by analyzing the relative discreteness of each subsequence.Simulation results show that the new algorithm is not constrained by the type of synchronization code and the amount of data.The new method,which has higher accurate recognition than existing algorithms,has significant potential in engineering application.

关 键 词：信息处理技术 帧结构 帧同步码 识别 离散度分析 

分 类 号：TN911[电子电信—通信与信息系统]