一种基于投票积累的雷达导引头动态解距离模糊算法

A Dynamic Range Ambiguity Resolution Algorithm forRadar Seeker Based on Vote Accumulation

目前工程上的雷达导引头主要采用多重频参差及一维集方法进行解距离模糊。一维集解距离模糊方法具有较好的鲁棒性,但其需要对所有可能的距离进行排序,在模糊重数越高、重频越多时效率受限。针对工程应用中需要快速准确解距离模糊这一问题,本文提出了一种基于投票机制的动态解距离模糊算法,避免了大量的距离排序运算,仅在有限的投票极值点进行解距离模糊,因而极大地改善了解模糊算法效率。仿真试验表明,该算法能快速高效地进行距离模糊解算,适合工程应用。

Most of current PD radar seekers adopt multiple PRF technique and one-dimension set algorithm(OSA)to address range ambiguity.The OSA can solve the range ambiguity effectively with high robustness.However,it needs to sort all the possible ranges which are time-cost,especially for higher ambiguity and higher number of pulse repetition frequency.In the present work,a dynamic range ambiguity resolution algorithm based on vote accumulation(DRAVA)is proposed,which avoids the process of sorting and solves the range ambiguity only at the positions where local-peaks are located.The experiments show that the proposed method can improve the range ambiguity quickly and efficiently,which is especially suit for engineering application.