基于三步搜索算法的解距离模糊方法  

Resolution method of range ambiguity based on three-step-search algorithm

作　　者：李军侠[1] 

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

出　　处：《系统工程与电子技术》2011年第3期557-561,共5页Systems Engineering and Electronics

摘　　要：一维聚类距离解模糊算法是雷达探测中常用的稳健解模糊算法。该算法通过优化最小误差获得当前视在距离的不模糊距离值。基于逐步减少测距误差的思路,提出了三步搜索算法解距离模糊。首先对距离误差限定三个不同的误差要求,然后代价误差由大到小逐步加严,同时在前步距离区间的基础上逐步缩减不模糊距离的区间范围,直到解得不模糊距离。仿真实验结果表明三步搜索算法的有效性。The one-dimensional clustering range resolution algorithm is a common stable ambiguity resolution in radar detection.The one-dimensional algorithm can acquire the unambiguous range by optimizing the least cost error.Based on the idea of reducing the range error step-by-step,a three-step-search algorithm is presented to solve the range ambiguity.First three different range errors are given corresponding to the radar system parameters,then the cost error is demanded to reduce gradually,meanwhile the ambiguity region is shrunk compared with the preceding region until the ambiguous range is acquired.The experimental results show that the three-step-search algorithm is efficient for range ambiguity resolution.

关 键 词：脉冲多普勒雷达 距离模糊 解模糊 中国剩余定理 

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