加权快速聚类距离解模糊算法  

Weighted Fast Clustering Range Resolution Algorithm

作　　者：李军侠[1] 吴卫山[1] 

机构地区：[1]中国空空导弹研究院,洛阳471009

出　　处：《系统仿真学报》2012年第4期868-872,共5页Journal of System Simulation

摘　　要：距离模糊是雷达系统中重频工作模式下必须考虑的问题,而多重频技术是解距离模糊常见的信号波形设计方案。一维聚类算法可根据雷达不同重频的测量视在距离稳健地求解目标不模糊距离,但一维聚类算法在排序效率和根据测距信噪比估计目标不模糊距离性能两方面存在不足。加权快速聚类距离解模糊算法首先提出快速聚类算法提高解模糊时的排序效率,继而采用加权方式提高目标不模糊距离的估计性能。快速聚类算法的仿真试验结果表明快速聚类算法解距离模糊是一种实用的快速解距离模糊算法。Range ambiguity could be considered under medium pulse repetition frequency（PRF） of radar working system,meanwhile multiple PRF technique is commonly waveform design scheme for range ambiguity resolution.One-dimensional clustering algorithm（OCA） can achieve the unambiguous range of targets according to various apparent ranges of different signal-noise ratio（SNR）,but OCA is inefficient in two aspects： sort efficiency and estimation accuracy.Weighted fast clustering algorithm proposes to improve sort efficiency by new sort manner,and the weights are added to obtain higher range estimation accuracy.The simulated experiments of fast clustering algorithms show fast clustering algorithm is a practical and fast range ambiguity resolution algorithm.

关 键 词：脉冲多普勒雷达 距离模糊 一维聚类算法 中国剩余定理 

分 类 号：TN957.524[电子电信—信号与信息处理]