北京航空航天大学学报 ›› 2007, Vol. 33 ›› Issue (08): 882-885.

• 论文 • 上一篇    下一篇

曲线合成孔径雷达迭代算法

唐 智, 李景文, 王宝发   

  1. 北京航空航天大学 电子信息工程学院, 北京 100083
  • 收稿日期:2006-09-05 出版日期:2007-08-31 发布日期:2010-09-17
  • 作者简介:唐 智(1977-),男,湖北十堰人,博士后,tangzhi1977@sohu.com.
  • 基金资助:

    中国博士后科学基金资助项目(20060390398)

Curvilinear synthetic aperture radar iterative algorithm

Tang Zhi, Li Jingwen, Wang Baofa   

  1. School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083, China
  • Received:2006-09-05 Online:2007-08-31 Published:2010-09-17

摘要: 研究了曲线合成孔径雷达(SAR,Synthetic Aperture Radar)二维信号模型和三维信号模型,得到了曲线SAR回波信号的数学表达式.将迭代算法应用于曲线SAR, 根据最小化非线性方差准则得到了曲线SAR中RELAX估计算法代价函数,详细研究了二维RELAX估计算法和三维RELAX估计算法的每一个具体步骤,可估计出目标点的散射强度和位置.给出了递推过程,规定了收敛条件,分析了RELAX估计算法的特点和计算量,得出RELAX算法收敛速度快,计算量相对较小,收敛条件苛刻会增加RELAX算法的计算量.研究成果为应用迭代算法提取曲线SAR数据的三维信息提供了指导.

Abstract: Curvilinear SAR (synthetic aperture radar) 2-D signal model and 3-D signal model were studied. The curvilinear SAR echo signal mathematic equation was derived. Iterative algorithm was applied to curvilinear SAR. According to minimum non-linear variance criteria, RELAX algorithm cost function in curvilinear SAR was founded. Every procedure in 2-D RELAX algorithm and 3-D RELAX algorithm was studied in detail. The target scatter amplitude and position can be estimated. The recursive idea was presented. The convergence condition was given. The characteristic and computation for RELAX algorithm were analyzed. RELAX algorithm can converge quickly and its computation is comparatively small. Rigorous convergence condition can increase RELAX algorithm computation. The analysis provides direction for curvilinear SAR data 3-D information extraction with iterative algorithm.

中图分类号: 


版权所有 © 《北京航空航天大学学报》编辑部
通讯地址:北京市海淀区学院路37号 北京航空航天大学学报编辑部 邮编:100191 E-mail:jbuaa@buaa.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发