...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Geoscience and Remote Sensing Letters >Low-Complexity Off-Grid STAP Algorithm Based on Local Search Clutter Subspace Estimation
【24h】

Low-Complexity Off-Grid STAP Algorithm Based on Local Search Clutter Subspace Estimation

机译：基于局部搜索杂波子空间估计的低复杂度离网STAP算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Space–time adaptive processing (STAP) based on sparse recovery (SR-STAP) techniques exhibits significantly better performance than conventional STAP algorithms within a very small number of snapshots. However, when the clutter patches do not locate exactly on the discrete space–time grid points, the performances of SR-STAP algorithms degrade severely. In this letter, a low-complexity off-grid STAP algorithm based on local search clutter subspace estimation is proposed to overcome this issue. In the proposed algorithm, the global atoms are first selected from the reduced-dimension global STAP dictionary using the design selection criterion. Then, the optimal atoms are searched from the local STAP dictionary. Finally, these space–time steering vectors corresponding to the optimal atoms are used to construct the clutter subspace iteratively, and the STAP weight is obtained by projecting the snapshot on the subspace orthogonal to the clutter subspace. Numerical experiments with both simulated and Mountain-Top data are carried out to demonstrate the effectiveness of the proposed algorithm.
机译：基于稀疏恢复（SR-STAP）技术的时空自适应处理（STAP）在极少数快照中表现出比常规STAP算法更好的性能。但是，当杂波斑块不完全位于离散的时空网格点上时，SR-STAP算法的性能会严重下降。为了克服这个问题，本文提出了一种基于局部搜索杂波子空间估计的低复杂度离网STAP算法。在提出的算法中，首先使用设计选择准则从降维的全局STAP字典中选择全局原子。然后，从本地STAP词典中搜索最佳原子。最后，将这些与最佳原子相对应的时空操纵向量用于迭代地构建杂波子空间，并且通过将快照投影到与杂波子空间正交的子空间上来获得STAP权重。数值模拟和山顶数据进行了实验，以证明该算法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号