| 零陷展宽的递推实现方法 |
| |
| 引用本文： | 倪淑燕,程乃平,倪正中.零陷展宽的递推实现方法[J].宇航学报,2011,32(4). |
| |
| 作者姓名： | 倪淑燕 程乃平 倪正中 |
| |
| 作者单位： | 1. 装备指挥技术学院,北京,101416
2. 遥感信息研究所,北京,100192 |
| |
| 摘 要： | 目前常用的零陷展宽算法都可以归纳到协方差矩阵锥化(CMT)的范畴,按常规计算方式,CMT法的运算量为O(M3).文章首先通过对CMT法中的锥化矩阵进行特征值分解,提出了一种递推实现的零陷展宽算法,将运算量降为O(JM2)(J为锥化矩阵的秩);将该递推方法与对角加载算法结合,大大提高了算法的鲁棒性;最后针对几种常用的锥化矩阵进行了分析,确定了Mailloux算法中虚拟干扰源的选取原则,对MZ算法的锥化矩阵进行了降秩近似,进一步降低了运算量.计算机仿真分析表明,递推CMT算法在与原算法性能相当的情况下运算速度大大提高,与对角加载算法结合后,可以以较低的运算量实现较好的稳健性.
|
| 关 键 词： | 零陷展宽 协方差矩阵锥化 低秩近似 对角加载 |
A Recursive Method for Null Broadening |
| |
| NI Shu-yan,CHENG Nai-ping,NI Zheng-zhong.A Recursive Method for Null Broadening[J].Journal of Astronautics,2011,32(4). |
| |
| Authors: | NI Shu-yan CHENG Nai-ping NI Zheng-zhong |
| |
| Institution: | NI Shu-yan1,CHENG Nai-ping1,NI Zheng-zhong2(1.Academy of Equipment Command and Technology,Beijing 101416,China,2.Remote Sensing Information Research Institute,Beijing 100192,China) |
| |
| Abstract: | Most of common used null broadening algorithms belong to the covariance matrix tapered(CMT) approach.Calculated in the conventional way,the CMT approach has a computational complexity of O(M3).Through the eigen-decomposition of the tapered matrix,a recursive null broadening approach is proposed to reduce the computational complexity to O(JM2),where J is the rank of the tapered matrix.Then the proposed approach is combined with the diagonal-loading algorithm to improve robustness of the method.Finally,some c... |
| |
| Keywords: | Null broadening Covariance matrix tapered Low-rank approximation Diagonal loading |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
