測(cè)距雷達(dá)解距離模糊的兩種快速算法
TWO FAST ALGORITHMS OF DE-AMBIGUOUS TECHNIQUE IN RANGING RADAR
-
摘要: 針對(duì)測(cè)距雷達(dá)中存在的實(shí)數(shù)域內(nèi)的測(cè)距解模糊問題,該文認(rèn)真分析了全局搜索算法的計(jì)算量,指出其計(jì)算量過(guò)大,難于適應(yīng)實(shí)時(shí)測(cè)距的要求。在此基礎(chǔ)上該文提出了兩種適用于一般情況的且能在規(guī)定的評(píng)價(jià)函數(shù)下取得最優(yōu)解的快速算法。理論分析及計(jì)算機(jī)仿真表明了這些快速算法的有效性。
-
關(guān)鍵詞:
- 測(cè)距雷達(dá); 信號(hào)處理; 距離模糊; 快速算法
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,林茂庸等(譯),雷達(dá)系統(tǒng)導(dǎo)論,北京:國(guó)防工業(yè)出版社,1992年2月第1版,45 46,58-84[2]沈福民,賈永康,相位測(cè)距中的解模糊技術(shù),西安電子科技大學(xué)學(xué)報(bào),1997,24(1)[3]孫洪,姚天任,同余方程組的微分方程求解法,應(yīng)用數(shù)學(xué),1996增刊,158-161[4]朱宏勛,適合用計(jì)算機(jī)解雷達(dá)模糊的幾種算法,現(xiàn)代雷達(dá),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]黃振興,史燕,用孫子定理解雷達(dá)測(cè)距模糊性,成都電訊工程學(xué)院學(xué)報(bào),1986,15(3),47-51. -
計(jì)量
- 文章訪問數(shù): 3706
- HTML全文瀏覽量: 210
- PDF下載量: 736
- 被引次數(shù): 0
下載:
