测距雷达解距离模糊的两种快速算法
TWO FAST ALGORITHMS OF DE-AMBIGUOUS TECHNIQUE IN RANGING RADAR
-
摘要: 针对测距雷达中存在的实数域内的测距解模糊问题,该文认真分析了全局搜索算法的计算量,指出其计算量过大,难于适应实时测距的要求。在此基础上该文提出了两种适用于一般情况的且能在规定的评价函数下取得最优解的快速算法。理论分析及计算机仿真表明了这些快速算法的有效性。Abstract: In ranging radar, range ambiguity usually exists. Computing amount of overall search algorithm to solve the problem is analyzed, and it is pointed out that this algorithm is unsuitable for ranging in real time. Then two fast algorithms that can attain the true solution of original equation set under certain evaluation function are put forward. These algorithms effectiveness is proved by theory analyses and computer simulation.
-
(美)M.I. Skolnik,林茂庸等(译),雷达系统导论,北京:国防工业出版社,1992年2月第1版,45 46,58-84[2]沈福民,贾永康,相位测距中的解模糊技术,西安电子科技大学学报,1997,24(1)[3]孙洪,姚天任,同余方程组的微分方程求解法,应用数学,1996增刊,158-161[4]朱宏勋,适合用计算机解雷达模糊的几种算法,现代雷达,1986(4),93-97.[5]S.A. Hovanessian, An algorithm for calculation of range in a multiple PRF radar, IEEE Trans.on AES 1976, 12(3), 287-290.[6]黄振兴,史燕,用孙子定理解雷达测距模糊性,成都电讯工程学院学报,1986,15(3),47-51. -
计量
- 文章访问数: 3627
- HTML全文浏览量: 191
- PDF下载量: 728
- 被引次数: 0
下载:
