Suppressing range ambiguity for spaceborne synthetic aperture radar based on linearly constrained minimum variance algorithm

被引：0

作者：

Yu, Ze ^{[1
]}

Zhou, Yinqing ^{[1
]}

Chen, Jie ^{[1
]}

Li, Chunsheng ^{[1
]}

机构：

[1] Beijing Univ Aeronaut & Astronaut, Sch Elect & Informat Engn, Beijing 100083, Peoples R China

来源：

PROCEEDINGS OF 2006 CIE INTERNATIONAL CONFERENCE ON RADAR, VOLS 1 AND 2 | 2006年

关键词：

synthetic aperture radar (SAR); ambiguity; linearly constrained minimum variance (LCMV); algorithm;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The range ambiguity of the spaceborne Synthetic Aperture Radar (SAR) is serious, because of the wide swath and the large detection range. This also decreases the radar image quality. Increasing the antenna height can solve this problem. But usually the satellite platform can not load the large antenna. So the range ambiguity suppression is an important problem for the spaceborne SAR. In this paper, the mathematical model of the range ambiguity is presented first. The difference between the average range ambiguity signal ratio (ARASR) and the distributed range ambiguity signal ratio (DRASR) is analyzed. Then an approach of the range ambiguity suppression for the spaceborne SAR based on the linearly constrained minimum variance (LCMV) algorithm is proposed. Simulation results prove that this approach improves not only the ARASR but also the DRASR under the condition that the antenna height is not needed to be changed. This method will be useful for achieving the wide swath.

引用

页码：1319 / +

页数：2

共 4 条

[1] CHOTIKAKAMTHORN N, 2000, SIGN PROC P WCCC ICS, V3, P1881
[2] CURLANDER JC, 1999, SYNTHETIC APERTURE R, P296
[3] Pattern synthesis method for arbitrary arrays based on LCMV criterion
Guo, Q
Liao, G
Wu, Y
Li, J
[J]. ELECTRONICS LETTERS, 2003, 39 (23) : 1628 - 1630
[4] Mehlis J. G., 1980, IEEE 1980 International Radar Conference, P143

← 1 →